|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 5 occurrences of 5 keywords
|
|
|
|
|
Results
Found 30 publication records. Showing 30 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic |
Crossing Numbers of Graphs with Rotation Systems.  |
Algorithmica  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Iyad A. Kanj, Michael J. Pelsmajer, Marcus Schaefer, Ge Xia |
On the induced matching problem. |
J. Comput. Syst. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Radoslav Fulek, Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic |
Hanani-Tutte and Monotone Drawings. |
WG |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Radoslav Fulek, Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic |
Adjacent Crossings Do Matter. |
Graph Drawing |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Erika L. C. King, Michael J. Pelsmajer |
Dominating sets in plane triangulations. |
Discrete Mathematics |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | André Kündgen, Michael J. Pelsmajer, Radhika Ramamurthi |
k-Robust Single-Message Transmission. |
SIAM J. Discrete Math. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic |
Removing Independently Even Crossings. |
SIAM J. Discrete Math. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic |
Removing even crossings on surfaces. |
Eur. J. Comb. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael J. Pelsmajer, Marcus Schaefer, Despina Stasi |
Strong Hanani--Tutte on the Projective Plane. |
SIAM J. Discrete Math. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael J. Pelsmajer |
Equitable list coloring and treewidth. |
Journal of Graph Theory |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic |
Removing Independently Even Crossings. |
Graph Drawing |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | André Kündgen, Michael J. Pelsmajer |
Nonrepetitive colorings of graphs of bounded tree-width. |
Discrete Mathematics |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic |
Odd Crossing Number and Crossing Number Are Not the Same. |
Discrete & Computational Geometry |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Gruia Calinescu, Michael J. Pelsmajer |
Fast edge colorings with fixed number of colors to minimize imbalance. |
J. Graph Algorithms Appl. |
2008 |
DBLP BibTeX RDF |
|
| 1 | Iyad A. Kanj, Michael J. Pelsmajer, Ge Xia, Marcus Schaefer |
On the Induced Matching Problem. |
STACS |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic |
Removing even crossings. |
J. Comb. Theory, Ser. B |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic |
Removing Even Crossings on Surfaces. |
Electronic Notes in Discrete Mathematics |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Hui, Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic |
Train Tracks and Confluent Drawings. |
Algorithmica |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic |
Crossing Number of Graphs with Rotation Systems. |
Graph Drawing |
2007 |
DBLP DOI BibTeX RDF |
computational complexity, computational geometry, crossing number |
| 1 | Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic |
Crossing Numbers and Parameterized Complexity. |
Graph Drawing |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Seog-Jin Kim, Kittikorn Nakprasit, Michael J. Pelsmajer, Jozef Skokan |
Transversal numbers of translates of a convex body. |
Discrete Mathematics |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Gruia Calinescu, Michael J. Pelsmajer |
Fast Edge Colorings with Fixed Number of Colors to Minimize Imbalance. |
FSTTCS |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Faith Ellen Fich, André Kündgen, Michael J. Pelsmajer, Radhika Ramamurthi |
Graph Minors and Reliable Single Message Transmission. |
SIAM J. Discrete Math. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Jamiru Luttamaguzi, Michael J. Pelsmajer, Zhizhang Shen, Boting Yang |
Integer Programming Methods for Several Optimization Problems in Graph Theory. |
Computers and Their Applications |
2005 |
DBLP BibTeX RDF |
|
| 1 | Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic |
Odd Crossing Number Is Not Crossing Number. |
Graph Drawing |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael J. Pelsmajer |
Maximum Induced Linear Forests in Outerplanar Graphs. |
Graphs and Combinatorics |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Weiting Cao, Michael J. Pelsmajer |
The Toughness of a Toroidal Graph with Connectivity 3 and Girth 6 is Exactly 1. |
Graphs and Combinatorics |
2004 |
DBLP DOI BibTeX RDF |
Toughness, Toroidal graph, Connectivity, Girth |
| 1 | Michael J. Pelsmajer |
Equitable list-coloring for graphs of maximum degree 3. |
Journal of Graph Theory |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Iyad A. Kanj, Michael J. Pelsmajer, Marcus Schaefer |
Parameterized Algorithms for Feedback Vertex Set. |
IWPEC |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | André Kündgen, Michael J. Pelsmajer, Radhika Ramamurthi |
k-Robust Single-Message Transmission. |
CAAN |
2004 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #30 of 30 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")