|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 1 occurrences of 1 keywords
|
|
|
|
|
Results
Found 20 publication records. Showing 20 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Andrei Asinowski, Elad Cohen, Martin Charles Golumbic, Vincent Limouzy, Marina Lipshteyn, Michal Stern |
Vertex Intersection Graphs of Paths on a Grid.  |
J. Graph Algorithms Appl.  |
2012 |
DBLP BibTeX RDF |
|
| 1 | Andrei Asinowski, Elad Cohen, Martin Charles Golumbic, Vincent Limouzy, Marina Lipshteyn, Michal Stern |
String graphs of k-bend paths on a grid.  |
Electronic Notes in Discrete Mathematics  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Brandstädt, Martin Charles Golumbic, Van Bang Le, Marina Lipshteyn |
Path-Bicolorable Graphs.  |
Graphs and Combinatorics  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Marina Lipshteyn, Ross M. McConnell, Haim Kaplan, Vadim E. Levit |
Foreword.  |
Discrete Applied Mathematics  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Elad Cohen, Martin Charles Golumbic, Marina Lipshteyn, Michal Stern |
On the bi-enhancement of chordal-bipartite probe graphs.  |
Inf. Process. Lett.  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Charles Golumbic, Marina Lipshteyn, Michal Stern |
Edge intersection graphs of single bend paths on a grid.  |
Networks  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Charles Golumbic, Marina Lipshteyn, Michal Stern |
Intersection models of weakly chordal graphs.  |
Discrete Applied Mathematics  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Brandstädt, Martin Charles Golumbic, Van Bang Le, Marina Lipshteyn |
Path-Bicolorable Graphs.  |
Graph Theory, Computational Intelligence and Thought  |
2009 |
DBLP DOI BibTeX RDF |
P 3-bicolorable graphs, P 4-bicolorable graphs, linear time recognition, bipartite graphs |
| 1 | Marina Lipshteyn, Vadim E. Levit, Ross M. McConnell (eds.) |
Graph Theory, Computational Intelligence and Thought, Essays Dedicated to Martin Charles Golumbic on the Occasion of His 60th Birthday  |
Graph Theory, Computational Intelligence and Thought  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Charles Golumbic, Marina Lipshteyn, Michal Stern |
Representing edge intersection graphs of paths on degree 4 trees.  |
Discrete Mathematics  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Charles Golumbic, Marina Lipshteyn, Michal Stern |
The k-edge intersection graphs of paths in a tree.  |
Discrete Applied Mathematics  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Charles Golumbic, Marina Lipshteyn, Michal Stern |
Equivalences and the complete hierarchy of intersection graphs of paths in a tree.  |
Discrete Applied Mathematics  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Elad Cohen, Martin Charles Golumbic, Marina Lipshteyn, Michal Stern |
What Is between Chordal and Weakly Chordal Graphs?.  |
WG  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Elad Cohen, Martin Charles Golumbic, Marina Lipshteyn, Michal Stern |
On the Bi-enhancement of Chordal-bipartite Probe Graphs.  |
CTW  |
2008 |
DBLP BibTeX RDF |
|
| 1 | Anne Berry, Martin Charles Golumbic, Marina Lipshteyn |
Recognizing Chordal Probe Graphs and Cycle-Bicolorable Graphs.  |
SIAM J. Discrete Math.  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Charles Golumbic, Marina Lipshteyn, Michal Stern |
Edge intersection graphs of single bend paths on a grid.  |
CTW  |
2007 |
DBLP BibTeX RDF |
|
| 1 | Martin Charles Golumbic, Marina Lipshteyn, Michal Stern |
Finding Intersection Models of Weakly Chordal Graphs.  |
WG  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Charles Golumbic, Marina Lipshteyn |
Chordal probe graphs.  |
Discrete Applied Mathematics  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Anne Berry, Martin Charles Golumbic, Marina Lipshteyn |
Two tricks to triangulate chordal probe graphs in polynomial time.  |
SODA  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Charles Golumbic, Marina Lipshteyn |
Chordal Probe Graphs.  |
WG  |
2003 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #20 of 20 (100 per page; Change: )
|
|