Michal Stern

According to our database, Michal Stern authored at least 27 papers between 2003 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Decomposing the feasibility of Clustered Spanning Tree by Paths.

Nili Guttmann-Beck, Michal Stern

Discret. Appl. Math., 2024

On partitioning minimum spanning trees.

Nili Guttmann-Beck, Refael Hassin, Michal Stern

Discret. Appl. Math., 2024

2023

Achieving feasibility for clustered traveling salesman problems using PQ-trees.

Nili Guttmann-Beck, Hadas Meshita-Sayag, Michal Stern

Networks, September, 2023

2022

Erratum to "Two dimensional maximum weight matching using Manhattan topology" [Oper. Res. Lett. 50 (3) (2022) 281-286].

Nili Guttmann-Beck, Hila Ohana Brumer, Yulia Shalev, Eitan Shvartz, Michal Stern

Oper. Res. Lett., 2022

Two dimensional maximum weight matching using Manhattan topology.

Nili Guttmann-Beck, Hila Ohana Brumer, Yulia Shalev, Eitan Shvartz, Michal Stern

Oper. Res. Lett., 2022

2021

Vertices removal for feasibility of clustered spanning trees.

Nili Guttmann-Beck, Roni Rozen, Michal Stern

Discret. Appl. Math., 2021

2019

Clustered Spanning Tree - Conditions for Feasibility.

Nili Guttmann-Beck, Zeev Sorek, Michal Stern

Discret. Math. Theor. Comput. Sci., 2019

2018

Approximation Algorithms for Not Necessarily Disjoint Clustered TSP.

Nili Guttmann-Beck, Eyal Knaan, Michal Stern

J. Graph Algorithms Appl., 2018

2017

Tolerance intersection graphs of degree bounded subtrees of a tree with constant tolerance 2.

Elad Cohen, Martin Charles Golumbic, Marina Lipshteyn, Michal Stern

Discret. Math., 2017

2013

Single bend paths on a grid have strong helly number 4: <i>errata atque emendationes ad</i> "edge intersection graphs of single bend paths on a grid".

Martin Charles Golumbic, Marina Lipshteyn, Michal Stern

Networks, 2013

2012

Vertex Intersection Graphs of Paths on a Grid.

Andrei Asinowski, Elad Cohen, Martin Charles Golumbic, Vincent Limouzy, Marina Lipshteyn, Michal Stern

J. Graph Algorithms Appl., 2012

Student Poster Session.

Martin Charles Golumbic, Michal Stern, Avivit Levy, Gila Morgenstern

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2012

2011

String graphs of k-bend paths on a grid.

Andrei Asinowski, Elad Cohen, Martin Charles Golumbic, Vincent Limouzy, Marina Lipshteyn, Michal Stern

Electron. Notes Discret. Math., 2011

2010

On the bi-enhancement of chordal-bipartite probe graphs.

Elad Cohen, Martin Charles Golumbic, Marina Lipshteyn, Michal Stern

Inf. Process. Lett., 2010

On edge-intersection graphs of k-bend paths in grids.

Therese Biedl, Michal Stern

Discret. Math. Theor. Comput. Sci., 2010

2009

Edge intersection graphs of single bend paths on a grid.

Martin Charles Golumbic, Marina Lipshteyn, Michal Stern

Networks, 2009

Intersection models of weakly chordal graphs.

Martin Charles Golumbic, Marina Lipshteyn, Michal Stern

Discret. Appl. Math., 2009

Smallest Odd Holes in Claw-Free Graphs (Extended Abstract).

Shimon Shrem, Michal Stern, Martin Charles Golumbic

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2009

Edge-Intersection Graphs of <i>k</i>-Bend Paths in Grids.

Therese Biedl, Michal Stern

Proceedings of the Computing and Combinatorics, 15th Annual International Conference, 2009

2008

Representing edge intersection graphs of paths on degree 4 trees.

Martin Charles Golumbic, Marina Lipshteyn, Michal Stern

Discret. Math., 2008

The complete optimal stars-clustering-tree problem.

Ephraim Korach, Michal Stern

Discret. Appl. Math., 2008

Equivalences and the complete hierarchy of intersection graphs of paths in a tree.

Martin Charles Golumbic, Marina Lipshteyn, Michal Stern

Discret. Appl. Math., 2008

The k-edge intersection graphs of paths in a tree.

Martin Charles Golumbic, Marina Lipshteyn, Michal Stern

Discret. Appl. Math., 2008

What Is between Chordal and Weakly Chordal Graphs?.

Elad Cohen, Martin Charles Golumbic, Marina Lipshteyn, Michal Stern

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2008

2006

On the Optimal Stars Clustering Tree Problem.

Michal Stern, Ephraim Korach

Electron. Notes Discret. Math., 2006

Finding Intersection Models of Weakly Chordal Graphs.

Martin Charles Golumbic, Marina Lipshteyn, Michal Stern

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2006

2003

The clustering matroid and the optimal clustering tree.

Ephraim Korach, Michal Stern

Math. Program., 2003