
Search the dblp DataBase
Marina Lipshteyn:
[Publications]
[Author Rank by year]
[Coauthors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
 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:962969 [Conf]
 Martin Charles Golumbic, Marina Lipshteyn
Chordal Probe Graphs. [Citation Graph (0, 0)][DBLP] WG, 2003, pp:249260 [Conf]
 Martin Charles Golumbic, Marina Lipshteyn, Michal Stern
Finding Intersection Models of Weakly Chordal Graphs. [Citation Graph (0, 0)][DBLP] WG, 2006, pp:241255 [Conf]
 Martin Charles Golumbic, Marina Lipshteyn
Chordal probe graphs. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2004, v:143, n:13, pp:221237 [Journal]
PathBicolorable Graphs. [Citation Graph (, )][DBLP]
What Is between Chordal and Weakly Chordal Graphs?. [Citation Graph (, )][DBLP]
Edge intersection graphs of single bend paths on a grid. [Citation Graph (, )][DBLP]
On the Bienhancement of Chordalbipartite Probe Graphs. [Citation Graph (, )][DBLP]
The kedge intersection graphs of paths in a tree. [Citation Graph (, )][DBLP]
Equivalences and the complete hierarchy of intersection graphs of paths in a tree. [Citation Graph (, )][DBLP]
Intersection models of weakly chordal graphs. [Citation Graph (, )][DBLP]
Representing edge intersection graphs of paths on degree 4 trees. [Citation Graph (, )][DBLP]
Search in 0.002secs, Finished in 0.003secs
