Michal Stern

30 papers B 5C 2Misc 1Journal 22
YearRankTypeTitle / Venue / Authors
2024 J jnl
Decomposing the feasibility of Clustered Spanning Tree by Paths.
Discret. Appl. Math.
Nili Guttmann-Beck, Michal Stern
2024 J jnl
On partitioning minimum spanning trees.
Discret. Appl. Math.
Nili Guttmann-Beck, Refael Hassin, Michal Stern
2023 J jnl
Achieving feasibility for clustered traveling salesman problems using PQ-trees.
Networks
Nili Guttmann-Beck, Hadas Meshita-Sayag, Michal Stern
2022 J jnl
Erratum to "Two dimensional maximum weight matching using Manhattan topology" [Oper. Res. Lett. 50 (3) (2022) 281-286].
Oper. Res. Lett.
Nili Guttmann-Beck, Hila Ohana Brumer, Yulia Shalev, Eitan Shvartz, Michal Stern
2022 J jnl
Two dimensional maximum weight matching using Manhattan topology.
Oper. Res. Lett.
Nili Guttmann-Beck, Hila Ohana Brumer, Yulia Shalev, Eitan Shvartz, Michal Stern
2021 J jnl
Vertices removal for feasibility of clustered spanning trees.
Discret. Appl. Math.
Nili Guttmann-Beck, Roni Rozen, Michal Stern
2019 J jnl
Clustered Spanning Tree - Conditions for Feasibility.
Discret. Math. Theor. Comput. Sci.
Nili Guttmann-Beck, Zeev Sorek, Michal Stern
2018 J jnl
Approximation Algorithms for Not Necessarily Disjoint Clustered TSP.
J. Graph Algorithms Appl.
Nili Guttmann-Beck, Eyal Knaan, Michal Stern
2017 J jnl
Tolerance intersection graphs of degree bounded subtrees of a tree with constant tolerance 2.
Discret. Math.
Elad Cohen, Martin Charles Golumbic, Marina Lipshteyn, Michal Stern
2013 J jnl
Single bend paths on a grid have strong helly number 4:
Networks
Martin Charles Golumbic, Marina Lipshteyn, Michal Stern
2012 B ed.
Graph-Theoretic Concepts in Computer Science - 38th International Workshop, WG 2012, Jerusalem, Israel, June 26-28, 2012, Revised Selcted Papers
WG
Martin Charles Golumbic, Michal Stern, Avivit Levy, Gila Morgenstern
2012 B conf
Student Poster Session.
WG
Martin Charles Golumbic, Michal Stern, Avivit Levy, Gila Morgenstern
2012 J jnl
Vertex Intersection Graphs of Paths on a Grid.
J. Graph Algorithms Appl.
Andrei Asinowski, Elad Cohen, Martin Charles Golumbic, Vincent Limouzy, Marina Lipshteyn, Michal Stern
2011 J jnl
String graphs of k-bend paths on a grid.
Electron. Notes Discret. Math.
Andrei Asinowski, Elad Cohen, Martin Charles Golumbic, Vincent Limouzy, Marina Lipshteyn, Michal Stern
2010 J jnl
On edge-intersection graphs of k-bend paths in grids.
Discret. Math. Theor. Comput. Sci.
Therese Biedl, Michal Stern
2010 J jnl
On the bi-enhancement of chordal-bipartite probe graphs.
Inf. Process. Lett.
Elad Cohen, Martin Charles Golumbic, Marina Lipshteyn, Michal Stern
2009 J jnl
Edge intersection graphs of single bend paths on a grid.
Networks
Martin Charles Golumbic, Marina Lipshteyn, Michal Stern
2009 Misc conf
Edge-Intersection Graphs of
COCOON
Therese Biedl, Michal Stern
2009 J jnl
Intersection models of weakly chordal graphs.
Discret. Appl. Math.
Martin Charles Golumbic, Marina Lipshteyn, Michal Stern
2009 B conf
Smallest Odd Holes in Claw-Free Graphs (Extended Abstract).
WG
Shimon Shrem, Michal Stern, Martin Charles Golumbic
2008 J jnl
Equivalences and the complete hierarchy of intersection graphs of paths in a tree.
Discret. Appl. Math.
Martin Charles Golumbic, Marina Lipshteyn, Michal Stern
2008 C conf
On the Bi-enhancement of Chordal-bipartite Probe Graphs.
CTW
Elad Cohen, Martin Charles Golumbic, Marina Lipshteyn, Michal Stern
2008 J jnl
Representing edge intersection graphs of paths on degree 4 trees.
Discret. Math.
Martin Charles Golumbic, Marina Lipshteyn, Michal Stern
2008 J jnl
The complete optimal stars-clustering-tree problem.
Discret. Appl. Math.
Ephraim Korach, Michal Stern
2008 J jnl
The k-edge intersection graphs of paths in a tree.
Discret. Appl. Math.
Martin Charles Golumbic, Marina Lipshteyn, Michal Stern
2008 B conf
What Is between Chordal and Weakly Chordal Graphs?.
WG
Elad Cohen, Martin Charles Golumbic, Marina Lipshteyn, Michal Stern
2007 C conf
Edge intersection graphs of single bend paths on a grid.
CTW
Martin Charles Golumbic, Marina Lipshteyn, Michal Stern
2006 B conf
Finding Intersection Models of Weakly Chordal Graphs.
WG
Martin Charles Golumbic, Marina Lipshteyn, Michal Stern
2006 J jnl
On the Optimal Stars Clustering Tree Problem.
Electron. Notes Discret. Math.
Michal Stern, Ephraim Korach
2003 J jnl
The clustering matroid and the optimal clustering tree.
Math. Program.
Ephraim Korach, Michal Stern