The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Michal Stern: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. 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]

  2. Edge-Intersection Graphs of k-Bend Paths in Grids. [Citation Graph (, )][DBLP]


  3. What Is between Chordal and Weakly Chordal Graphs?. [Citation Graph (, )][DBLP]


  4. Smallest Odd Holes in Claw-Free Graphs (Extended Abstract). [Citation Graph (, )][DBLP]


  5. Edge intersection graphs of single bend paths on a grid. [Citation Graph (, )][DBLP]


  6. On the Bi-enhancement of Chordal-bipartite Probe Graphs. [Citation Graph (, )][DBLP]


  7. The complete optimal stars-clustering-tree problem. [Citation Graph (, )][DBLP]


  8. The k-edge intersection graphs of paths in a tree. [Citation Graph (, )][DBLP]


  9. Equivalences and the complete hierarchy of intersection graphs of paths in a tree. [Citation Graph (, )][DBLP]


  10. Intersection models of weakly chordal graphs. [Citation Graph (, )][DBLP]


  11. Representing edge intersection graphs of paths on degree 4 trees. [Citation Graph (, )][DBLP]


Search in 0.001secs, Finished in 0.001secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002