default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichal Stern
Person information
- affiliation: Academic College of Tel-Aviv Yaffo, Yaffo, Israel
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j22]Nili Guttmann-Beck, Michal Stern
:
Decomposing the feasibility of Clustered Spanning Tree by Paths. Discret. Appl. Math. 354: 160-180 (2024)- [j21]Nili Guttmann-Beck, Refael Hassin, Michal Stern:
On partitioning minimum spanning trees. Discret. Appl. Math. 359: 45-54 (2024) - 2023
- [j20]Nili Guttmann-Beck, Hadas Meshita-Sayag, Michal Stern:
Achieving feasibility for clustered traveling salesman problems using PQ-trees. Networks 82(2): 153-166 (2023) - 2022
- [j19]Nili Guttmann-Beck, Hila Ohana Brumer, Yulia Shalev, Eitan Shvartz, Michal Stern:
Two dimensional maximum weight matching using Manhattan topology. Oper. Res. Lett. 50(3): 281-286 (2022) - [j18]Nili Guttmann-Beck, Hila Ohana Brumer, Yulia Shalev, Eitan Shvartz, Michal Stern:
Erratum to "Two dimensional maximum weight matching using Manhattan topology" [Oper. Res. Lett. 50 (3) (2022) 281-286]. Oper. Res. Lett. 50(5): 475 (2022) - 2021
- [j17]Nili Guttmann-Beck, Roni Rozen, Michal Stern:
Vertices removal for feasibility of clustered spanning trees. Discret. Appl. Math. 296: 68-84 (2021)
2010 – 2019
- 2019
- [j16]Nili Guttmann-Beck, Zeev Sorek, Michal Stern:
Clustered Spanning Tree - Conditions for Feasibility. Discret. Math. Theor. Comput. Sci. 21(1) (2019) - 2018
- [j15]Nili Guttmann-Beck, Eyal Knaan, Michal Stern:
Approximation Algorithms for Not Necessarily Disjoint Clustered TSP. J. Graph Algorithms Appl. 22(4): 555-575 (2018) - 2017
- [j14]Elad Cohen, Martin Charles Golumbic, Marina Lipshteyn, Michal Stern:
Tolerance intersection graphs of degree bounded subtrees of a tree with constant tolerance 2. Discret. Math. 340(2): 209-222 (2017) - 2013
- [j13]Martin Charles Golumbic, Marina Lipshteyn, Michal Stern:
Single bend paths on a grid have strong helly number 4: errata atque emendationes ad "edge intersection graphs of single bend paths on a grid". Networks 62(2): 161-163 (2013) - 2012
- [j12]Andrei Asinowski, Elad Cohen, Martin Charles Golumbic, Vincent Limouzy, Marina Lipshteyn, Michal Stern:
Vertex Intersection Graphs of Paths on a Grid. J. Graph Algorithms Appl. 16(2): 129-150 (2012) - [c7]Martin Charles Golumbic, Michal Stern, Avivit Levy, Gila Morgenstern:
Student Poster Session. WG 2012: 4-6 - [e1]Martin Charles Golumbic, Michal Stern, Avivit Levy, Gila Morgenstern:
Graph-Theoretic Concepts in Computer Science - 38th International Workshop, WG 2012, Jerusalem, Israel, June 26-28, 2012, Revised Selcted Papers. Lecture Notes in Computer Science 7551, Springer 2012, ISBN 978-3-642-34610-1 [contents] - 2011
- [j11]Andrei Asinowski, Elad Cohen, Martin Charles Golumbic, Vincent Limouzy, Marina Lipshteyn, Michal Stern:
String graphs of k-bend paths on a grid. Electron. Notes Discret. Math. 37: 141-146 (2011) - 2010
- [j10]Therese Biedl, Michal Stern:
On edge-intersection graphs of k-bend paths in grids. Discret. Math. Theor. Comput. Sci. 12(1): 1-12 (2010) - [j9]Elad Cohen, Martin Charles Golumbic, Marina Lipshteyn, Michal Stern:
On the bi-enhancement of chordal-bipartite probe graphs. Inf. Process. Lett. 110(5): 193-197 (2010)
2000 – 2009
- 2009
- [j8]Martin Charles Golumbic, Marina Lipshteyn, Michal Stern:
Intersection models of weakly chordal graphs. Discret. Appl. Math. 157(9): 2031-2047 (2009) - [j7]Martin Charles Golumbic, Marina Lipshteyn, Michal Stern:
Edge intersection graphs of single bend paths on a grid. Networks 54(3): 130-138 (2009) - [c6]Therese Biedl, Michal Stern:
Edge-Intersection Graphs of k-Bend Paths in Grids. COCOON 2009: 86-95 - [c5]Shimon Shrem, Michal Stern, Martin Charles Golumbic:
Smallest Odd Holes in Claw-Free Graphs (Extended Abstract). WG 2009: 329-340 - 2008
- [j6]Ephraim Korach, Michal Stern:
The complete optimal stars-clustering-tree problem. Discret. Appl. Math. 156(4): 444-450 (2008) - [j5]Martin Charles Golumbic, Marina Lipshteyn, Michal Stern:
The k-edge intersection graphs of paths in a tree. Discret. Appl. Math. 156(4): 451-461 (2008) - [j4]Martin Charles Golumbic, Marina Lipshteyn, Michal Stern:
Equivalences and the complete hierarchy of intersection graphs of paths in a tree. Discret. Appl. Math. 156(17): 3203-3215 (2008) - [j3]Martin Charles Golumbic, Marina Lipshteyn, Michal Stern:
Representing edge intersection graphs of paths on degree 4 trees. Discret. Math. 308(8): 1381-1387 (2008) - [c4]Elad Cohen, Martin Charles Golumbic, Marina Lipshteyn, Michal Stern:
On the Bi-enhancement of Chordal-bipartite Probe Graphs. CTW 2008: 152-156 - [c3]Elad Cohen, Martin Charles Golumbic, Marina Lipshteyn, Michal Stern:
What Is between Chordal and Weakly Chordal Graphs?. WG 2008: 275-286 - 2007
- [c2]Martin Charles Golumbic, Marina Lipshteyn, Michal Stern:
Edge intersection graphs of single bend paths on a grid. CTW 2007: 53-55 - 2006
- [j2]Michal Stern, Ephraim Korach:
On the Optimal Stars Clustering Tree Problem. Electron. Notes Discret. Math. 27: 99-100 (2006) - [c1]Martin Charles Golumbic, Marina Lipshteyn, Michal Stern:
Finding Intersection Models of Weakly Chordal Graphs. WG 2006: 241-255 - 2003
- [j1]Ephraim Korach, Michal Stern:
The clustering matroid and the optimal clustering tree. Math. Program. 98(1-3): 385-414 (2003)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-02 00:10 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
