|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
No Growbag Graphs found.
|
|
|
|
|
Results
Found 18 publication records. Showing 18 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 | 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 | Therese C. Biedl, Michal Stern |
On edge-intersection graphs of k-bend paths in grids. |
Discrete Mathematics & Theoretical Computer Science |
2010 |
DBLP 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 | Shimon Shrem, Michal Stern, Martin Charles Golumbic |
Smallest Odd Holes in Claw-Free Graphs (Extended Abstract). |
WG |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Therese C. Biedl, Michal Stern |
Edge-Intersection Graphs of k-Bend Paths in Grids. |
COCOON |
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 | Ephraim Korach, Michal Stern |
The complete optimal stars-clustering-tree problem. |
Discrete Applied 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 | Martin Charles Golumbic, Marina Lipshteyn, Michal Stern |
Edge intersection graphs of single bend paths on a grid. |
CTW |
2007 |
DBLP BibTeX RDF |
|
| 1 | Michal Stern, Ephraim Korach |
On the Optimal Stars Clustering Tree Problem. |
Electronic Notes in Discrete Mathematics |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Charles Golumbic, Marina Lipshteyn, Michal Stern |
Finding Intersection Models of Weakly Chordal Graphs. |
WG |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Ephraim Korach, Michal Stern |
The clustering matroid and the optimal clustering tree. |
Math. Program. |
2003 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #18 of 18 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")