Search the dblp DataBase

Publications of Author

1. Anne Berry, Martin Charles Golumbic, Marina Lipshteyn
   Two tricks to triangulate chordal probe graphs in polynomial time. [Citation Graph (0, 0)][DBLP]
   SODA, 2004, pp:962-969 [Conf]
   
2. Martin Charles Golumbic, Marina Lipshteyn
   Chordal Probe Graphs. [Citation Graph (0, 0)][DBLP]
   WG, 2003, pp:249-260 [Conf]
   
3. Martin Charles Golumbic, Marina Lipshteyn, Michal Stern
   Finding Intersection Models of Weakly Chordal Graphs. [Citation Graph (0, 0)][DBLP]
   WG, 2006, pp:241-255 [Conf]
   
4. Martin Charles Golumbic, Marina Lipshteyn
   Chordal probe graphs. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2004, v:143, n:1-3, pp:221-237 [Journal]
   
5. 
   Path-Bicolorable Graphs. [Citation Graph (, )][DBLP]
   
   
6. 
   What Is between Chordal and Weakly Chordal Graphs?. [Citation Graph (, )][DBLP]
   
   
7. 
   Edge intersection graphs of single bend paths on a grid. [Citation Graph (, )][DBLP]
   
   
8. 
   On the Bi-enhancement of Chordal-bipartite Probe Graphs. [Citation Graph (, )][DBLP]
   
   
9. 
   The k-edge intersection graphs of paths in a tree. [Citation Graph (, )][DBLP]
   
   
10. 
    Equivalences and the complete hierarchy of intersection graphs of paths in a tree. [Citation Graph (, )][DBLP]
    
    
11. 
    Intersection models of weakly chordal graphs. [Citation Graph (, )][DBLP]
    
    
12. 
    Representing edge intersection graphs of paths on degree 4 trees. [Citation Graph (, )][DBLP]