Marina Lipshteyn Coauthor index DBLP Vis pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

DBLP keys2009
14Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMarina Lipshteyn, Vadim E. Levit, Ross M. McConnell: Graph Theory, Computational Intelligence and Thought, Essays Dedicated to Martin Charles Golumbic on the Occasion of His 60th Birthday Springer 2009
13Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAndreas Brandstädt, Martin Charles Golumbic, Van Bang Le, Marina Lipshteyn: Path-Bicolorable Graphs. Graph Theory, Computational Intelligence and Thought 2009: 172-182
12Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMartin Charles Golumbic, Marina Lipshteyn, Michal Stern: Intersection models of weakly chordal graphs. Discrete Applied Mathematics 157(9): 2031-2047 (2009)
2008
11no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLElad Cohen, Martin Charles Golumbic, Marina Lipshteyn, Michal Stern: On the Bi-enhancement of Chordal-bipartite Probe Graphs. CTW 2008: 152-156
10Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLElad Cohen, Martin Charles Golumbic, Marina Lipshteyn, Michal Stern: What Is between Chordal and Weakly Chordal Graphs?. WG 2008: 275-286
9Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMartin 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)
8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMartin Charles Golumbic, Marina Lipshteyn, Michal Stern: The k-edge intersection graphs of paths in a tree. Discrete Applied Mathematics 156(4): 451-461 (2008)
7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMartin Charles Golumbic, Marina Lipshteyn, Michal Stern: Representing edge intersection graphs of paths on degree 4 trees. Discrete Mathematics 308(8): 1381-1387 (2008)
2007
6no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMartin Charles Golumbic, Marina Lipshteyn, Michal Stern: Edge intersection graphs of single bend paths on a grid. CTW 2007: 53-55
5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAnne Berry, Martin Charles Golumbic, Marina Lipshteyn: Recognizing Chordal Probe Graphs and Cycle-Bicolorable Graphs. SIAM J. Discrete Math. 21(3): 573-591 (2007)
2006
4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMartin Charles Golumbic, Marina Lipshteyn, Michal Stern: Finding Intersection Models of Weakly Chordal Graphs. WG 2006: 241-255
2004
3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAnne Berry, Martin Charles Golumbic, Marina Lipshteyn: Two tricks to triangulate chordal probe graphs in polynomial time. SODA 2004: 962-969
2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMartin Charles Golumbic, Marina Lipshteyn: Chordal probe graphs. Discrete Applied Mathematics 143(1-3): 221-237 (2004)
2003
1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMartin Charles Golumbic, Marina Lipshteyn: Chordal Probe Graphs. WG 2003: 249-260

Coauthor Index

1Anne Berry [3] [5]
2Andreas Brandstädt [13]
3Elad Cohen [10] [11]
4Martin Charles Golumbic [1] [2] [3] [4] [5] [6] [7] [8] [9] [10] [11] [12] [13]
5Van Bang Le [13]
6Vadim E. Levit [14]
7Ross M. McConnell [14]
8Michal Stern [4] [6] [7] [8] [9] [10] [11] [12]

Copyright © Mon Nov 30 15:58:31 2009 by Michael Ley (ley@uni-trier.de)