| 2008 |
|---|
| 11 | | Elad Cohen,
Martin Charles Golumbic,
Marina Lipshteyn,
Michal Stern:
On the Bi-enhancement of Chordal-bipartite Probe Graphs.
CTW 2008: 152-156 |
| 10 | EE | Elad Cohen,
Martin Charles Golumbic,
Marina Lipshteyn,
Michal Stern:
What Is between Chordal and Weakly Chordal Graphs?.
WG 2008: 275-286 |
| 9 | EE | 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) |
| 8 | EE | 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) |
| 7 | EE | 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 |
|---|
| 6 | | Martin Charles Golumbic,
Marina Lipshteyn,
Michal Stern:
Edge intersection graphs of single bend paths on a grid.
CTW 2007: 53-55 |
| 5 | EE | Anne Berry,
Martin Charles Golumbic,
Marina Lipshteyn:
Recognizing Chordal Probe Graphs and Cycle-Bicolorable Graphs.
SIAM J. Discrete Math. 21(3): 573-591 (2007) |
| 2006 |
|---|
| 4 | EE | Martin Charles Golumbic,
Marina Lipshteyn,
Michal Stern:
Finding Intersection Models of Weakly Chordal Graphs.
WG 2006: 241-255 |
| 2004 |
|---|
| 3 | EE | Anne Berry,
Martin Charles Golumbic,
Marina Lipshteyn:
Two tricks to triangulate chordal probe graphs in polynomial time.
SODA 2004: 962-969 |
| 2 | EE | Martin Charles Golumbic,
Marina Lipshteyn:
Chordal probe graphs.
Discrete Applied Mathematics 143(1-3): 221-237 (2004) |
| 2003 |
|---|
| 1 | EE | Martin Charles Golumbic,
Marina Lipshteyn:
Chordal Probe Graphs.
WG 2003: 249-260 |
