| 2009 |
|---|
| 35 | EE | Dániel Marx,
Marcus Schaefer:
The complexity of nonrepetitive coloring.
Discrete Applied Mathematics 157(1): 13-18 (2009) |
| 2008 |
|---|
| 34 | | Marcus Schaefer,
Eric Sedgwick,
Daniel Stefankovic:
Computing Dehn Twists and Geometric Intersection Numbers in Polynomial Time.
CCCG 2008 |
| 33 | EE | Iyad A. Kanj,
Michael J. Pelsmajer,
Ge Xia,
Marcus Schaefer:
On the Induced Matching Problem.
STACS 2008: 397-408 |
| 32 | EE | Michael J. Pelsmajer,
Marcus Schaefer,
Daniel Stefankovic:
Odd Crossing Number and Crossing Number Are Not the Same.
Discrete & Computational Geometry 39(1-3): 442-454 (2008) |
| 2007 |
|---|
| 31 | | Marcus Schaefer,
Eric Sedgwick,
Daniel Stefankovic:
Spiralling and Folding: The Topological View.
CCCG 2007: 73-76 |
| 30 | EE | Alejandro Estrella-Balderrama,
Elisabeth Gassner,
Michael Jünger,
Merijam Percan,
Marcus Schaefer,
Michael Schulz:
Simultaneous Geometric Graph Embeddings.
Graph Drawing 2007: 280-290 |
| 29 | EE | Michael J. Pelsmajer,
Marcus Schaefer,
Daniel Stefankovic:
Crossing Number of Graphs with Rotation Systems.
Graph Drawing 2007: 3-12 |
| 28 | EE | Michael J. Pelsmajer,
Marcus Schaefer,
Daniel Stefankovic:
Crossing Numbers and Parameterized Complexity.
Graph Drawing 2007: 31-36 |
| 27 | EE | Peter Hui,
Michael J. Pelsmajer,
Marcus Schaefer,
Daniel Stefankovic:
Train Tracks and Confluent Drawings.
Algorithmica 47(4): 465-479 (2007) |
| 26 | EE | Marcus Schaefer,
Eric Sedgwick,
Daniel Stefankovic:
Folding and Spiralling: The Word View.
Electronic Notes in Discrete Mathematics 29: 101-105 (2007) |
| 25 | EE | Michael J. Pelsmajer,
Marcus Schaefer,
Daniel Stefankovic:
Removing Even Crossings on Surfaces.
Electronic Notes in Discrete Mathematics 29: 85-90 (2007) |
| 24 | EE | Michael J. Pelsmajer,
Marcus Schaefer,
Daniel Stefankovic:
Removing even crossings.
J. Comb. Theory, Ser. B 97(4): 489-500 (2007) |
| 2006 |
|---|
| 23 | EE | Elisabeth Gassner,
Michael Jünger,
Merijam Percan,
Marcus Schaefer,
Michael Schulz:
Simultaneous Graph Embeddings with Fixed Edges.
WG 2006: 325-335 |
| 2005 |
|---|
| 22 | EE | Michael J. Pelsmajer,
Marcus Schaefer,
Daniel Stefankovic:
Odd Crossing Number Is Not Crossing Number.
Graph Drawing 2005: 386-396 |
| 21 | EE | Marcus Schaefer,
Daniel Stefankovic:
Solvability of Graph Inequalities.
SIAM J. Discrete Math. 19(3): 728-743 (2005) |
| 2004 |
|---|
| 20 | EE | Peter Hui,
Marcus Schaefer,
Daniel Stefankovic:
Train Tracks and Confluent Drawings.
Graph Drawing 2004: 318-328 |
| 19 | EE | Peter Hui,
Marcus Schaefer:
Paired Pointset Traversal.
ISAAC 2004: 534-544 |
| 18 | EE | Iyad A. Kanj,
Michael J. Pelsmajer,
Marcus Schaefer:
Parameterized Algorithms for Feedback Vertex Set.
IWPEC 2004: 235-247 |
| 17 | EE | Marcus Schaefer,
Stephen A. Fenner:
Simplicity and Strong Reductions
Electronic Colloquium on Computational Complexity (ECCC)(071): (2004) |
| 16 | EE | Marcus Schaefer,
Daniel Stefankovic:
Decidability of string graphs.
J. Comput. Syst. Sci. 68(2): 319-334 (2004) |
| 2003 |
|---|
| 15 | EE | Marcus Schaefer,
Frank Stephan:
Strong Reductions and Immunity for Exponential Time.
STACS 2003: 559-570 |
| 14 | | Marcus Schaefer,
Pradyut Shah:
Induced Graph Ramsey Theory.
Ars Comb. 66: (2003) |
| 13 | EE | Marcus Schaefer,
Eric Sedgwick,
Daniel Stefankovic:
Recognizing string graphs in NP.
J. Comput. Syst. Sci. 67(2): 365-380 (2003) |
| 2002 |
|---|
| 12 | EE | Marcus Schaefer,
Eric Sedgwick,
Daniel Stefankovic:
Algorithms for Normal Curves and Surfaces.
COCOON 2002: 370-380 |
| 11 | EE | Marcus Schaefer,
Eric Sedgwick,
Daniel Stefankovic:
Recognizing string graphs in NP.
STOC 2002: 1-6 |
| 2001 |
|---|
| 10 | EE | Marcus Schaefer,
Daniel Stefankovic:
Decidability of string graphs.
STOC 2001: 241-246 |
| 9 | | Marcus Schaefer:
Graph Ramsey Theory and the Polynomial Hierarchy.
J. Comput. Syst. Sci. 62(2): 290-322 (2001) |
| 8 | EE | Stephen A. Fenner,
Steven Homer,
Randall Pruim,
Marcus Schaefer:
Hyper-polynomial hierarchies and the polynomial jump.
Theor. Comput. Sci. 262(1): 241-256 (2001) |
| 2000 |
|---|
| 7 | EE | Marcus Schaefer:
Deciding the K-Dimension is PSPACE-Complete.
IEEE Conference on Computational Complexity 2000: 198-203 |
| 1999 |
|---|
| 6 | EE | Marcus Schaefer:
Graph Ramsey Theory and the Polynomial Hierarchy (Abstract).
IEEE Conference on Computational Complexity 1999: 6 |
| 5 | EE | Marcus Schaefer:
Graph Ramsey Theory and the Polynomial Hierarchy.
STOC 1999: 592-601 |
| 4 | | Marcus Schaefer:
Deciding the Vapnik-Cervonenkis Dimension in Sigmap3-Complete.
J. Comput. Syst. Sci. 58(1): 177-182 (1999) |
| 3 | | Stephen A. Fenner,
Marcus Schaefer:
Bounded Immunity and Btt-Reductions.
Math. Log. Q. 45: 3-21 (1999) |
| 1998 |
|---|
| 2 | EE | Marcus Schaefer:
A guided tour of minimal indices and shortest descriptions.
Arch. Math. Log. 37(8): 521-548 (1998) |
| 1997 |
|---|
| 1 | EE | Stephen A. Fenner,
Steven Homer,
Randall Pruim,
Marcus Schaefer:
Hyper-Polynomial Hierarchies and the NP-Jump.
IEEE Conference on Computational Complexity 1997: 102-110 |
