Michal Stern

Affiliations:
  • Academic College of Tel-Aviv Yaffo, Yaffo, Israel


According to our database1, Michal Stern authored at least 25 papers between 2003 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Achieving feasibility for clustered traveling salesman problems using PQ-trees.
Networks, September, 2023

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

Two dimensional maximum weight matching using Manhattan topology.
Oper. Res. Lett., 2022

2021
Vertices removal for feasibility of clustered spanning trees.
Discret. Appl. Math., 2021

2019
Clustered Spanning Tree - Conditions for Feasibility.
Discret. Math. Theor. Comput. Sci., 2019

2018
Approximation Algorithms for Not Necessarily Disjoint Clustered TSP.
J. Graph Algorithms Appl., 2018

2017
Tolerance intersection graphs of degree bounded subtrees of a tree with constant tolerance 2.
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".
Networks, 2013

2012
Vertex Intersection Graphs of Paths on a Grid.
J. Graph Algorithms Appl., 2012

Student Poster Session.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2012

2011
String graphs of k-bend paths on a grid.
Electron. Notes Discret. Math., 2011

2010
On the bi-enhancement of chordal-bipartite probe graphs.
Inf. Process. Lett., 2010

On edge-intersection graphs of k-bend paths in grids.
Discret. Math. Theor. Comput. Sci., 2010

2009
Edge intersection graphs of single bend paths on a grid.
Networks, 2009

Intersection models of weakly chordal graphs.
Discret. Appl. Math., 2009

Smallest Odd Holes in Claw-Free Graphs (Extended Abstract).
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2009

Edge-Intersection Graphs of <i>k</i>-Bend Paths in Grids.
Proceedings of the Computing and Combinatorics, 15th Annual International Conference, 2009

2008
Representing edge intersection graphs of paths on degree 4 trees.
Discret. Math., 2008

The complete optimal stars-clustering-tree problem.
Discret. Appl. Math., 2008

Equivalences and the complete hierarchy of intersection graphs of paths in a tree.
Discret. Appl. Math., 2008

The k-edge intersection graphs of paths in a tree.
Discret. Appl. Math., 2008

What Is between Chordal and Weakly Chordal Graphs?.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2008

2006
On the Optimal Stars Clustering Tree Problem.
Electron. Notes Discret. Math., 2006

Finding Intersection Models of Weakly Chordal Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2006

2003
The clustering matroid and the optimal clustering tree.
Math. Program., 2003


  Loading...