 | 2009 |
|---|
| 11 |       | Therese C. Biedl,
Michal Stern:
Edge-Intersection Graphs of k-Bend Paths in Grids.
COCOON 2009: 86-95 |
| 10 | | Martin Charles Golumbic,
Marina Lipshteyn,
Michal Stern:
Intersection models of weakly chordal graphs.
Discrete Applied Mathematics 157(9): 2031-2047 (2009) |
| 2008 |
|---|
| 9 |  | Elad Cohen,
Martin Charles Golumbic,
Marina Lipshteyn,
Michal Stern:
On the Bi-enhancement of Chordal-bipartite Probe Graphs.
CTW 2008: 152-156 |
| 8 | | Elad Cohen,
Martin Charles Golumbic,
Marina Lipshteyn,
Michal Stern:
What Is between Chordal and Weakly Chordal Graphs?.
WG 2008: 275-286 |
| 7 | | Martin Charles Golumbic,
Marina Lipshteyn,
Michal Stern:
Equivalences and the complete hierarchy of intersection graphs of paths in a tree.
Discrete Applied Mathematics 156(17): 3203-3215 (2008) |
| 6 | | Ephraim Korach,
Michal Stern:
The complete optimal stars-clustering-tree problem.
Discrete Applied Mathematics 156(4): 444-450 (2008) |
| 5 | | Martin Charles Golumbic,
Marina Lipshteyn,
Michal Stern:
The k-edge intersection graphs of paths in a tree.
Discrete Applied Mathematics 156(4): 451-461 (2008) |
| 4 | | Martin Charles Golumbic,
Marina Lipshteyn,
Michal Stern:
Representing edge intersection graphs of paths on degree 4 trees.
Discrete Mathematics 308(8): 1381-1387 (2008) |
| 2007 |
|---|
| 3 | | Martin Charles Golumbic,
Marina Lipshteyn,
Michal Stern:
Edge intersection graphs of single bend paths on a grid.
CTW 2007: 53-55 |
| 2006 |
|---|
| 2 | | Martin Charles Golumbic,
Marina Lipshteyn,
Michal Stern:
Finding Intersection Models of Weakly Chordal Graphs.
WG 2006: 241-255 |
| 1 | | Michal Stern,
Ephraim Korach:
On the Optimal Stars Clustering Tree Problem.
Electronic Notes in Discrete Mathematics 27: 99-100 (2006) |
