- CSB - MetaPress - Google - Bing - Yahoo
 | 2012 | |
|---|---|---|
| j22 |      | Radoslav Fulek, Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic: Adjacent Crossings Do Matter. J. Graph Algorithms Appl. 16(3): 759-782 (2012) |
| c24 | | Marcus Schaefer: Toward a Theory of Planarity: Hanani-Tutte and Planarity Variants. Graph Drawing 2012: 162-173 |
| 2011 | ||
| j21 | | Marcus Schaefer, Eric Sedgwick, Daniel Stefankovic: Spiraling and Folding: The Word View. Algorithmica 60(3): 609-626 (2011) |
| j20 | | Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic: Crossing Numbers of Graphs with Rotation Systems. Algorithmica 60(3): 679-702 (2011) |
| j19 | | Iyad A. Kanj, Michael J. Pelsmajer, Marcus Schaefer, Ge Xia: On the induced matching problem. J. Comput. Syst. Sci. 77(6): 1058-1070 (2011) |
| c23 | | Radoslav Fulek, Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic: Adjacent Crossings Do Matter. Graph Drawing 2011: 343-354 |
| c22 | | Radoslav Fulek, Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic: Hanani-Tutte and Monotone Drawings. WG 2011: 283-294 |
| 2010 | ||
| j18 | | Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic: Removing Independently Even Crossings. SIAM J. Discrete Math. 24(2): 379-393 (2010) |
| 2009 | ||
| j17 | | Dániel Marx, Marcus Schaefer: The complexity of nonrepetitive coloring. Discrete Applied Mathematics 157(1): 13-18 (2009) |
| j16 | | Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic: Removing even crossings on surfaces. Eur. J. Comb. 30(7): 1704-1717 (2009) |
| j15 | | Michael J. Pelsmajer, Marcus Schaefer, Despina Stasi: Strong Hanani--Tutte on the Projective Plane. SIAM J. Discrete Math. 23(3): 1317-1323 (2009) |
| c21 | | Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic: Removing Independently Even Crossings. Graph Drawing 2009: 201-206 |
| c20 | | |
| 2008 | ||
| j14 | | 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) |
| c19 |  | Marcus Schaefer, Eric Sedgwick, Daniel Stefankovic: Computing Dehn Twists and Geometric Intersection Numbers in Polynomial Time. CCCG 2008 |
| c18 | | Iyad A. Kanj, Michael J. Pelsmajer, Ge Xia, Marcus Schaefer: On the Induced Matching Problem. STACS 2008: 397-408 |
| 2007 | ||
| j13 | | Peter Hui, Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic: Train Tracks and Confluent Drawings. Algorithmica 47(4): 465-479 (2007) |
| j12 | | Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic: Removing Even Crossings on Surfaces. Electronic Notes in Discrete Mathematics 29: 85-90 (2007) |
| j11 | | Marcus Schaefer, Eric Sedgwick, Daniel Stefankovic: Folding and Spiralling: The Word View. Electronic Notes in Discrete Mathematics 29: 101-105 (2007) |
| j10 | | Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic: Removing even crossings. J. Comb. Theory, Ser. B 97(4): 489-500 (2007) |
| c17 | | Marcus Schaefer, Eric Sedgwick, Daniel Stefankovic: Spiralling and Folding: The Topological View. CCCG 2007: 73-76 |
| c16 | | Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic: Crossing Number of Graphs with Rotation Systems. Graph Drawing 2007: 3-12 |
| c15 | | Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic: Crossing Numbers and Parameterized Complexity. Graph Drawing 2007: 31-36 |
| c14 | | Alejandro Estrella-Balderrama, Elisabeth Gassner, Michael Jünger, Merijam Percan, Marcus Schaefer, Michael Schulz: Simultaneous Geometric Graph Embeddings. Graph Drawing 2007: 280-290 |
| 2006 | ||
| c13 | | Elisabeth Gassner, Michael Jünger, Merijam Percan, Marcus Schaefer, Michael Schulz: Simultaneous Graph Embeddings with Fixed Edges. WG 2006: 325-335 |
| 2005 | ||
| j9 | | Marcus Schaefer, Daniel Stefankovic: Solvability of Graph Inequalities. SIAM J. Discrete Math. 19(3): 728-743 (2005) |
| c12 | | Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic: Odd Crossing Number Is Not Crossing Number. Graph Drawing 2005: 386-396 |
| 2004 | ||
| j8 | | Marcus Schaefer, Daniel Stefankovic: Decidability of string graphs. J. Comput. Syst. Sci. 68(2): 319-334 (2004) |
| c11 | | Peter Hui, Marcus Schaefer, Daniel Stefankovic: Train Tracks and Confluent Drawings. Graph Drawing 2004: 318-328 |
| c10 | | |
| c9 | | Iyad A. Kanj, Michael J. Pelsmajer, Marcus Schaefer: Parameterized Algorithms for Feedback Vertex Set. IWPEC 2004: 235-247 |
| i1 | | Marcus Schaefer, Stephen A. Fenner: Simplicity and Strong Reductions. Electronic Colloquium on Computational Complexity (ECCC)(071) (2004) |
| 2003 | ||
| j7 | | |
| j6 | | Marcus Schaefer, Eric Sedgwick, Daniel Stefankovic: Recognizing string graphs in NP. J. Comput. Syst. Sci. 67(2): 365-380 (2003) |
| c8 | | Marcus Schaefer, Frank Stephan: Strong Reductions and Immunity for Exponential Time. STACS 2003: 559-570 |
| 2002 | ||
| c7 | | Marcus Schaefer, Eric Sedgwick, Daniel Stefankovic: Algorithms for Normal Curves and Surfaces. COCOON 2002: 370-380 |
| c6 | | |
| 2001 | ||
| j5 | | Marcus Schaefer: Graph Ramsey Theory and the Polynomial Hierarchy. J. Comput. Syst. Sci. 62(2): 290-322 (2001) |
| j4 | | Stephen A. Fenner, Steven Homer, Randall Pruim, Marcus Schaefer: Hyper-polynomial hierarchies and the polynomial jump. Theor. Comput. Sci. 262(1): 241-256 (2001) |
| c5 | | |
| 2000 | ||
| c4 | | Marcus Schaefer: Deciding the K-Dimension is PSPACE-Complete. IEEE Conference on Computational Complexity 2000: 198-203 |
| 1999 | ||
| j3 | | Marcus Schaefer: Deciding the Vapnik-Cervonenkis Dimension in Sigmap3-Complete. J. Comput. Syst. Sci. 58(1): 177-182 (1999) |
| j2 | | Stephen A. Fenner, Marcus Schaefer: Bounded Immunity and Btt-Reductions. Math. Log. Q. 45: 3-21 (1999) |
| c3 | | Marcus Schaefer: Graph Ramsey Theory and the Polynomial Hierarchy (Abstract). IEEE Conference on Computational Complexity 1999: 6 |
| c2 | | |
| 1998 | ||
| j1 | | Marcus Schaefer: A guided tour of minimal indices and shortest descriptions. Arch. Math. Log. 37(8): 521-548 (1998) |
| 1997 | ||
| c1 | | Stephen A. Fenner, Steven Homer, Randall Pruim, Marcus Schaefer: Hyper-Polynomial Hierarchies and the NP-Jump. IEEE Conference on Computational Complexity 1997: 102-110 |
Colors in the list of coauthors
Last update Sat May 18 17:27:06 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page