Computability of Convex Sets (Extended Abstract). - Martin Kummer; Marcus Schäfer 001 (STACS, 1995)

Deciding the Vapnik-Cervonenkis dimension is SigmaP3-complete. - Marcus Schäfer 001 (CCC, 1996)

Hyper-Polynomial Hierarchies and the NP-Jump. - Stephen A. Fenner; Steven Homer; Randall J. Pruim; Marcus Schaefer 001 (CCC, 1997)

A guided tour of minimal indices and shortest descriptions. - Marcus Schaefer 001 (Arch. Math. Log., 1998)

Graph Ramsey Theory and the Polynomial Hierarchy (Abstract). - Marcus Schaefer 001 (CCC, 1999)

Deciding the Vapnik-Červonenkis Dimension in ∑p3-Complete. - Marcus Schaefer 001 (J. Comput. Syst. Sci., 1999)

Bounded Immunity and Btt-Reductions. - Stephen A. Fenner; Marcus Schaefer 001 (Math. Log. Q., 1999)

Deciding the K-Dimension is PSPACE-Complete. - Marcus Schaefer 001 (CCC, 2000)

Graph Ramsey Theory and the Polynomial Hierarchy. - Marcus Schaefer 001 (J. Comput. Syst. Sci., 2001)

Hyper-polynomial hierarchies and the polynomial jump. - Stephen A. Fenner; Steven Homer; Randall J. Pruim; Marcus Schaefer 001 (Theor. Comput. Sci., 2001)

Algorithms for Normal Curves and Surfaces. - Marcus Schaefer 001; Eric Sedgwick; Daniel Stefankovic (COCOON, 2002)

Strong Reductions and Immunity for Exponential Time. - Marcus Schaefer 001; Frank Stephan 001 (STACS, 2003)

Induced Graph Ramsey Theory. - Marcus Schaefer 001; Pradyut Shah (Ars Comb., 2003)

Recognizing string graphs in NP. - Marcus Schaefer 001; Eric Sedgwick; Daniel Stefankovic (J. Comput. Syst. Sci., 2003)

Train Tracks and Confluent Drawings. - Peter Hui; Marcus Schaefer 001; Daniel Stefankovic (GD, 2004)

Paired Pointset Traversal. - Peter Hui; Marcus Schaefer 001 (ISAAC, 2004)

Parameterized Algorithms for Feedback Vertex Set. - Iyad A. Kanj; Michael J. Pelsmajer; Marcus Schaefer 001 (IWPEC, 2004)

Simplicity and Strong Reductions - Marcus Schaefer 001; Stephen A. Fenner (Electron. Colloquium Comput. Complex., 2004)

Decidability of string graphs. - Marcus Schaefer 001; Daniel Stefankovic (J. Comput. Syst. Sci., 2004)

Odd Crossing Number Is Not Crossing Number. - Michael J. Pelsmajer; Marcus Schaefer 001; Daniel Stefankovic (GD, 2005)

Solvability of Graph Inequalities. - Marcus Schaefer 001; Daniel Stefankovic (SIAM J. Discret. Math., 2005)

Simultaneous Graph Embeddings with Fixed Edges. - Elisabeth Gassner; Michael Jünger; Merijam Percan; Marcus Schaefer 001; Michael Schulz 001 (WG, 2006)

Spiralling and Folding: The Topological View. - Marcus Schaefer 001; Eric Sedgwick; Daniel Stefankovic (CCCG, 2007)

Simultaneous Geometric Graph Embeddings. - Alejandro Estrella-Balderrama; Elisabeth Gassner; Michael Jünger; Merijam Percan; Marcus Schaefer 001; Michael Schulz 001 (GD, 2007)

Crossing Number of Graphs with Rotation Systems. - Michael J. Pelsmajer; Marcus Schaefer 001; Daniel Stefankovic (GD, 2007)

Crossing Numbers and Parameterized Complexity. - Michael J. Pelsmajer; Marcus Schaefer 001; Daniel Stefankovic (GD, 2007)

Train Tracks and Confluent Drawings. - Peter Hui; Michael J. Pelsmajer; Marcus Schaefer 001; Daniel Stefankovic (Algorithmica, 2007)

Removing Even Crossings on Surfaces. - Michael J. Pelsmajer; Marcus Schaefer 001; Daniel Stefankovic (Electron. Notes Discret. Math., 2007)

Folding and Spiralling: The Word View. - Marcus Schaefer 001; Eric Sedgwick; Daniel Stefankovic (Electron. Notes Discret. Math., 2007)

Removing even crossings. - Michael J. Pelsmajer; Marcus Schaefer 001; Daniel Stefankovic (J. Comb. Theory B, 2007)

Cuppability of Simple and Hypersimple Sets. - Martin Kummer; Marcus Schäfer 001 (Notre Dame J. Formal Log., 2007)

Computing Dehn Twists and Geometric Intersection Numbers in Polynomial Time. - Marcus Schaefer 001; Eric Sedgwick; Daniel Stefankovic (CCCG, 2008)

Odd Crossing Number and Crossing Number Are Not the Same. - Michael J. Pelsmajer; Marcus Schaefer 001; Daniel Stefankovic (Discret. Comput. Geom., 2008)

Complexity of Some Geometric and Topological Problems. - Marcus Schaefer 001 (GD, 2009)

The complexity of nonrepetitive coloring. - Dániel Marx; Marcus Schaefer 001 (Discret. Appl. Math., 2009)

Strong Hanani–Tutte on the Projective Plane. - Michael J. Pelsmajer; Marcus Schaefer 001; Despina Stasi (SIAM J. Discret. Math., 2009)

Removing Independently Even Crossings. - Michael J. Pelsmajer; Marcus Schaefer 001; Daniel Stefankovic (SIAM J. Discret. Math., 2010)

Hanani-Tutte and Monotone Drawings. - Radoslav Fulek; Michael J. Pelsmajer; Marcus Schaefer 001; Daniel Stefankovic (WG, 2011)

Crossing Numbers of Graphs with Rotation Systems. - Michael J. Pelsmajer; Marcus Schaefer 001; Daniel Stefankovic (Algorithmica, 2011)

Spiraling and Folding: The Word View. - Marcus Schaefer 001; Eric Sedgwick; Daniel Stefankovic (Algorithmica, 2011)

On the induced matching problem. - Iyad A. Kanj; Michael J. Pelsmajer; Marcus Schaefer 001; Ge Xia (J. Comput. Syst. Sci., 2011)

Adjacent Crossings Do Matter. - Radoslav Fulek; Michael J. Pelsmajer; Marcus Schaefer 001; Daniel Stefankovic (J. Graph Algorithms Appl., 2012)

Block Additivity of ℤ2-Embeddings. - Marcus Schaefer 001; Daniel Stefankovic (GD, 2013)

Two-Sided Boundary Labeling with Adjacent Sides. - Philipp Kindermann; Benjamin Niedermann; Ignaz Rutter; Marcus Schaefer 001; André Schulz 001; Alexander Wolff 001 (WADS, 2013)

Toward a Theory of Planarity: Hanani-Tutte and Planarity Variants. - Marcus Schaefer 001 (J. Graph Algorithms Appl., 2013)

Practical Experience with Hanani-Tutte for Testing c-Planarity. - Carsten Gutwenger; Petra Mutzel; Marcus Schaefer 001 (ALENEX, 2014)

A Crossing Lemma for the Pair-Crossing Number. - Eyal Ackerman; Marcus Schaefer 001 (GD, 2014)

Picking Planar Edges; or, Drawing a Graph with a Planar Subgraph. - Marcus Schaefer 001 (GD, 2014)

Drawing Partially Embedded and Simultaneously Planar Graphs. - Timothy M. Chan; Fabrizio Frati; Carsten Gutwenger; Anna Lubiw; Petra Mutzel; Marcus Schaefer 001 (J. Graph Algorithms Appl., 2015)

Multi-sided Boundary Labeling. - Philipp Kindermann; Benjamin Niedermann; Ignaz Rutter; Marcus Schaefer 001; André Schulz 001; Alexander Wolff 001 (Algorithmica, 2016)

Hanani-Tutte for Radial Planarity. - Radoslav Fulek; Michael J. Pelsmajer; Marcus Schaefer 001 (J. Graph Algorithms Appl., 2017)

Fixed Points, Nash Equilibria, and the Existential Theory of the Reals. - Marcus Schaefer 001; Daniel Stefankovic (Theory Comput. Syst., 2017)

The Complexity of Tensor Rank. - Marcus Schaefer 001; Daniel Stefankovic (Theory Comput. Syst., 2018)

Link Crossing Number is NP-hard. - Arnaud de Mesmay; Marcus Schaefer 001; Eric Sedgwick (CoRR, 2019)

A Proof of Levi's Extension Lemma. - Marcus Schaefer 001 (CoRR, 2019)

10 Reasons to Get Interested in Graph Drawing. - Carla Binucci; Ulrik Brandes; Tim Dwyer; Martin Gronemann; Reinhard von Hanxleden; Marc J. van Kreveld; Petra Mutzel; Marcus Schaefer 001; Falk Schreiber; Bettina Speckmann (Computing and Software Science, 2019)

Strong Hanani-Tutte for the Torus. - Radoslav Fulek; Michael J. Pelsmajer; Marcus Schaefer 001 (SoCG, 2021)

RAC-Drawability is ∃ ℝ-Complete. - Marcus Schaefer 001 (GD, 2021)

A New Algorithm for Embedding Plane Graphs at Fixed Vertex Locations. - Marcus Schaefer 001 (Electron. J. Comb., 2021)

Taking a Detour; or, Gioan's Theorem, and Pseudolinear Drawings of Complete Graphs. - Marcus Schaefer 001 (Discret. Comput. Geom., 2021)

Complexity of Geometric k-Planarity for Fixed k. - Marcus Schaefer 001 (J. Graph Algorithms Appl., 2021)

On the Complexity of Some Geometric Problems With Fixed Parameters. - Marcus Schaefer 001 (J. Graph Algorithms Appl., 2021)

The Degenerate Crossing Number and Higher-Genus Embeddings. - Marcus Schäfer 001; Daniel Stefankovic (J. Graph Algorithms Appl., 2022)

Hanani-Tutte and Hierarchical Partial Planarity. - Marcus Schaefer 001 (SIAM J. Discret. Math., 2022)

Hanani-Tutte for Radial Planarity II. - Radoslav Fulek; Michael J. Pelsmajer; Marcus Schaefer 001 (Electron. J. Comb., 2023)

The Complexity of Angular Resolution. - Marcus Schaefer 001 (J. Graph Algorithms Appl., 2023)

RAC-Drawability is ∃ℝ-complete and Related Results. - Marcus Schaefer 001 (J. Graph Algorithms Appl., 2023)

The Existential Theory of the Reals as a Complexity Class: A Compendium. - Marcus Schaefer 001; Jean Cardinal; Tillmann Miltzow (CoRR, 2024)

Beyond the Existential Theory of the Reals. - Marcus Schaefer 001; Daniel Stefankovic (Theory Comput. Syst., 2024)

Spiraling and Folding: The Topological View. - Jan Kyncl; Marcus Schaefer 001; Eric Sedgwick; Daniel Stefankovic (Discret. Comput. Geom., 2024)

How Hard is it to be a Star? Convex Geometry and the Real Hierarchy. - Marcus Schaefer 001; Daniel Stefankovic (CoRR, 2025)

Recognizing Penny and Marble Graphs is Hard for Existential Theory of the Reals. - Anna Lubiw; Marcus Schaefer 001 (CoRR, 2025)