| 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 | Marcus Schaefer, Eric Sedgwick, Daniel Stefankovic |
Spiraling and Folding: The Word View.  |
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 | 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 | Dániel Marx, Marcus Schaefer |
The complexity of nonrepetitive coloring.  |
Discrete Applied Mathematics  |
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 | Marcus Schaefer |
Complexity of Some Geometric and Topological Problems.  |
Graph Drawing  |
2009 |
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 | Marcus Schaefer, Eric Sedgwick, Daniel Stefankovic |
Computing Dehn Twists and Geometric Intersection Numbers in Polynomial Time.  |
CCCG  |
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 | Marcus Schaefer, Eric Sedgwick, Daniel Stefankovic |
Folding and Spiralling: The Word View.  |
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 | Marcus Schaefer, Eric Sedgwick, Daniel Stefankovic |
Spiralling and Folding: The Topological View.  |
CCCG  |
2007 |
DBLP BibTeX RDF |
|
| 1 | Alejandro Estrella-Balderrama, Elisabeth Gassner, Michael Jünger, Merijam Percan, Marcus Schaefer, Michael Schulz |
Simultaneous Geometric Graph Embeddings.  |
Graph Drawing  |
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 | Elisabeth Gassner, Michael Jünger, Merijam Percan, Marcus Schaefer, Michael Schulz |
Simultaneous Graph Embeddings with Fixed Edges.  |
WG  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Marcus Schaefer, Daniel Stefankovic |
Solvability of Graph Inequalities.  |
SIAM J. Discrete Math.  |
2005 |
DBLP DOI 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 | Marcus Schaefer, Stephen A. Fenner |
Simplicity and Strong Reductions  |
Electronic Colloquium on Computational Complexity (ECCC)  |
2004 |
DBLP BibTeX RDF |
|
| 1 | Marcus Schaefer, Daniel Stefankovic |
Decidability of string graphs.  |
J. Comput. Syst. Sci.  |
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 | Peter Hui, Marcus Schaefer |
Paired Pointset Traversal.  |
ISAAC  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Hui, Marcus Schaefer, Daniel Stefankovic |
Train Tracks and Confluent Drawings.  |
Graph Drawing  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Marcus Schaefer, Eric Sedgwick, Daniel Stefankovic |
Recognizing string graphs in NP.  |
J. Comput. Syst. Sci.  |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Marcus Schaefer, Pradyut Shah |
Induced Graph Ramsey Theory.  |
Ars Comb.  |
2003 |
DBLP BibTeX RDF |
|
| 1 | Marcus Schaefer, Frank Stephan |
Strong Reductions and Immunity for Exponential Time.  |
STACS  |
2003 |
DBLP DOI BibTeX RDF |
hardness for exponential time, polynomial time reducibilities, Computational and structural complexity |
| 1 | Marcus Schaefer, Eric Sedgwick, Daniel Stefankovic |
Algorithms for Normal Curves and Surfaces.  |
COCOON  |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Marcus Schaefer, Eric Sedgwick, Daniel Stefankovic |
Recognizing string graphs in NP.  |
STOC  |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Stephen A. Fenner, Steven Homer, Randall Pruim, Marcus Schaefer |
Hyper-polynomial hierarchies and the polynomial jump.  |
Theor. Comput. Sci.  |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Marcus Schaefer |
Graph Ramsey Theory and the Polynomial Hierarchy.  |
J. Comput. Syst. Sci.  |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Marcus Schaefer, Daniel Stefankovic |
Decidability of string graphs.  |
STOC  |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Marcus Schaefer |
Deciding the K-Dimension is PSPACE-Complete. (PDF / PS)  |
IEEE Conference on Computational Complexity  |
2000 |
DBLP DOI BibTeX RDF |
computational complexity, learning theory, PSPACE |
| 1 | Stephen A. Fenner, Marcus Schaefer |
Bounded Immunity and Btt-Reductions.  |
Math. Log. Q.  |
1999 |
DBLP BibTeX RDF |
|
| 1 | Marcus Schaefer |
Deciding the Vapnik-Cervonenkis Dimension in Sigmap3-Complete.  |
J. Comput. Syst. Sci.  |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Marcus Schaefer |
Graph Ramsey Theory and the Polynomial Hierarchy (Abstract). (PDF / PS)  |
IEEE Conference on Computational Complexity  |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Marcus Schaefer |
Graph Ramsey Theory and the Polynomial Hierarchy.  |
STOC  |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Marcus Schaefer |
A guided tour of minimal indices and shortest descriptions.  |
Arch. Math. Log.  |
1998 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (1991): 03D15, 03D35, 03D80 |
| 1 | Stephen A. Fenner, Steven Homer, Randall Pruim, Marcus Schaefer |
Hyper-Polynomial Hierarchies and the NP-Jump. (PDF / PS)  |
IEEE Conference on Computational Complexity  |
1997 |
DBLP DOI BibTeX RDF |
|