Michal Stern

Publication Activity (10 Years)

Years Active: 2003-2024
Publications (10 Years): 9

Top Topics

Approximation Algorithms

Minimum Spanning Trees

Ordered Labeled Trees

Top Venues

Discret. Appl. Math.

Oper. Res. Lett.

Discret. Math. Theor. Comput. Sci.

Publications

Nili Guttmann-Beck, Refael Hassin, Michal Stern
On partitioning minimum spanning trees. Discret. Appl. Math. 359 (2024)
Nili Guttmann-Beck, Michal Stern
Decomposing the feasibility of Clustered Spanning Tree by Paths. Discret. Appl. Math. 354 (2024)
Nili Guttmann-Beck, Hadas Meshita-Sayag, Michal Stern
Achieving feasibility for clustered traveling salesman problems using PQ-trees. Networks 82 (2) (2023)
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) (2022)
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) (2022)
Nili Guttmann-Beck, Roni Rozen, Michal Stern
Vertices removal for feasibility of clustered spanning trees. Discret. Appl. Math. 296 (2021)
Nili Guttmann-Beck, Zeev Sorek, Michal Stern
Clustered Spanning Tree - Conditions for Feasibility. Discret. Math. Theor. Comput. Sci. 21 (1) (2019)
Nili Guttmann-Beck, Eyal Knaan, Michal Stern
Approximation Algorithms for Not Necessarily Disjoint Clustered TSP. J. Graph Algorithms Appl. 22 (4) (2018)
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) (2017)
Martin Charles Golumbic, Marina Lipshteyn, Michal Stern
"edge intersection graphs of single bend paths on a grid". Networks 62 (2) (2013)
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) (2012)
Martin Charles Golumbic, Michal Stern, Avivit Levy, Gila Morgenstern
Student Poster Session. WG (2012)
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 (2011)
Elad Cohen, Martin Charles Golumbic, Marina Lipshteyn, Michal Stern
On the bi-enhancement of chordal-bipartite probe graphs. Inf. Process. Lett. 110 (5) (2010)
Therese C. Biedl, Michal Stern
On edge-intersection graphs of k-bend paths in grids. Discret. Math. Theor. Comput. Sci. 12 (1) (2010)
Martin Charles Golumbic, Marina Lipshteyn, Michal Stern
Intersection models of weakly chordal graphs. Discret. Appl. Math. 157 (9) (2009)
Martin Charles Golumbic, Marina Lipshteyn, Michal Stern
Edge intersection graphs of single bend paths on a grid. Networks 54 (3) (2009)
Therese C. Biedl, Michal Stern
-Bend Paths in Grids. COCOON (2009)
Shimon Shrem, Michal Stern, Martin Charles Golumbic
Smallest Odd Holes in Claw-Free Graphs (Extended Abstract). WG (2009)
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) (2008)
Elad Cohen, Martin Charles Golumbic, Marina Lipshteyn, Michal Stern
What Is between Chordal and Weakly Chordal Graphs?. WG (2008)
Elad Cohen, Martin Charles Golumbic, Marina Lipshteyn, Michal Stern
On the Bi-enhancement of Chordal-bipartite Probe Graphs. CTW (2008)
Martin Charles Golumbic, Marina Lipshteyn, Michal Stern
Representing edge intersection graphs of paths on degree 4 trees. Discret. Math. 308 (8) (2008)
Martin Charles Golumbic, Marina Lipshteyn, Michal Stern
The k-edge intersection graphs of paths in a tree. Discret. Appl. Math. 156 (4) (2008)
Ephraim Korach, Michal Stern
The complete optimal stars-clustering-tree problem. Discret. Appl. Math. 156 (4) (2008)
Martin Charles Golumbic, Marina Lipshteyn, Michal Stern
Edge intersection graphs of single bend paths on a grid. CTW (2007)
Michal Stern, Ephraim Korach
On the Optimal Stars Clustering Tree Problem. Electron. Notes Discret. Math. 27 (2006)
Martin Charles Golumbic, Marina Lipshteyn, Michal Stern
Finding Intersection Models of Weakly Chordal Graphs. WG (2006)
Ephraim Korach, Michal Stern
The clustering matroid and the optimal clustering tree. Math. Program. 98 (1-3) (2003)