The following pages link to Michal Stern (Q991749):
Displayed 24 items.
- On the bi-enhancement of chordal-bipartite probe graphs (Q991750) (← links)
- Equivalences and the complete hierarchy of intersection graphs of paths in a tree (Q1003465) (← links)
- Intersection models of weakly chordal graphs (Q1026105) (← links)
- Erratum to: ``Two dimensional maximum weight matching using Manhattan topology'' (Q2084010) (← links)
- Two dimensional maximum weight matching using Manhattan topology (Q2157895) (← links)
- Tolerance intersection graphs of degree bounded subtrees of a tree with constant tolerance 2 (Q2374177) (← links)
- The complete optimal stars-clustering-tree problem (Q2473041) (← links)
- The \(k\)-edge intersection graphs of paths in a tree (Q2473042) (← links)
- Representing edge intersection graphs of paths on degree 4 trees (Q2476278) (← links)
- Vertices removal for feasibility of clustered spanning trees (Q2663996) (← links)
- 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” (Q2811306) (← links)
- String graphs of k-bend paths on a grid (Q2840697) (← links)
- Edge intersection graphs of single bend paths on a grid (Q3057113) (← links)
- Vertex Intersection Graphs of Paths on a Grid (Q3143733) (← links)
- On the Optimal Stars Clustering Tree Problem (Q3439552) (← links)
- Finding Intersection Models of Weakly Chordal Graphs (Q3522961) (← links)
- (Q3575465) (← links)
- (Q3576666) (← links)
- Approximation Algorithms for Not Necessarily Disjoint Clustered TSP (Q4554892) (← links)
- (Q5207831) (← links)
- What Is between Chordal and Weakly Chordal Graphs? (Q5302062) (← links)
- Edge-Intersection Graphs of k-Bend Paths in Grids (Q5323053) (← links)
- Smallest Odd Holes in Claw-Free Graphs (Extended Abstract) (Q5851118) (← links)
- Achieving feasibility for clustered traveling salesman problems using PQ‐trees (Q6139372) (← links)