default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMarcus Schaefer 0001
Person information
- affiliation: DePaul University, School of Computing, Chicago, IL, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j40]Jan Kyncl
, Marcus Schaefer, Eric Sedgwick, Daniel Stefankovic:
Spiraling and Folding: The Topological View. Discret. Comput. Geom. 72(1): 246-268 (2024)- [j39]Marcus Schaefer, Daniel Stefankovic:
Beyond the Existential Theory of the Reals. Theory Comput. Syst. 68(2): 195-226 (2024) - [i13]Marcus Schaefer, Jean Cardinal, Tillmann Miltzow:
The Existential Theory of the Reals as a Complexity Class: A Compendium. CoRR abs/2407.18006 (2024) - 2023
- [j38]Radoslav Fulek, Michael J. Pelsmajer, Marcus Schaefer:
Hanani-Tutte for Radial Planarity II. Electron. J. Comb. 30(1) (2023) - [j37]Marcus Schaefer:
The Complexity of Angular Resolution. J. Graph Algorithms Appl. 27(7): 565-580 (2023) - [j36]Marcus Schaefer:
RAC-Drawability is ∃ℝ-complete and Related Results. J. Graph Algorithms Appl. 27(9): 803-841 (2023) - 2022
- [j35]Marcus Schäfer, Daniel Stefankovic:
The Degenerate Crossing Number and Higher-Genus Embeddings. J. Graph Algorithms Appl. 26(1): 35-58 (2022) - [j34]Marcus Schaefer:
Hanani-Tutte and Hierarchical Partial Planarity. SIAM J. Discret. Math. 36(4): 2959-2974 (2022) - [i12]Jan Kyncl, Marcus Schaefer, Eric Sedgwick, Daniel Stefankovic:
Spiraling and Folding: The Topological View. CoRR abs/2206.07849 (2022) - [i11]Marcus Schaefer, Daniel Stefankovic:
Beyond the Existential Theory of the Reals. CoRR abs/2210.00571 (2022) - 2021
- [j33]Marcus Schaefer:
A New Algorithm for Embedding Plane Graphs at Fixed Vertex Locations. Electron. J. Comb. 28(4) (2021) - [j32]Marcus Schaefer:
Taking a Detour; or, Gioan's Theorem, and Pseudolinear Drawings of Complete Graphs. Discret. Comput. Geom. 66(1): 12-31 (2021) - [j31]Marcus Schaefer:
Complexity of Geometric k-Planarity for Fixed k. J. Graph Algorithms Appl. 25(1): 29-41 (2021) - [j30]Marcus Schaefer:
On the Complexity of Some Geometric Problems With Fixed Parameters. J. Graph Algorithms Appl. 25(1): 195-218 (2021) - [c37]Radoslav Fulek, Michael J. Pelsmajer, Marcus Schaefer:
Strong Hanani-Tutte for the Torus. SoCG 2021: 38:1-38:15 - [c36]Marcus Schaefer:
RAC-Drawability is ∃ ℝ-Complete. GD 2021: 72-86 - [i10]Marcus Schaefer:
RAC-drawability is ∃R-complete. CoRR abs/2107.11663 (2021) - 2020
- [i9]Radoslav Fulek, Michael J. Pelsmajer, Marcus Schaefer:
Strong Hanani-Tutte for the Torus. CoRR abs/2009.01683 (2020)
2010 – 2019
- 2019
- [p1]Carla Binucci, Ulrik Brandes, Tim Dwyer, Martin Gronemann, Reinhard von Hanxleden, Marc J. van Kreveld, Petra Mutzel, Marcus Schaefer, Falk Schreiber, Bettina Speckmann:
10 Reasons to Get Interested in Graph Drawing. Computing and Software Science 2019: 85-104 - [i8]Arnaud de Mesmay, Marcus Schaefer, Eric Sedgwick:
Link Crossing Number is NP-hard. CoRR abs/1908.04073 (2019) - [i7]Marcus Schaefer:
A Proof of Levi's Extension Lemma. CoRR abs/1910.05388 (2019) - 2018
- [j29]Marcus Schaefer, Daniel Stefankovic:
The Complexity of Tensor Rank. Theory Comput. Syst. 62(5): 1161-1174 (2018) - 2017
- [j28]Radoslav Fulek, Michael J. Pelsmajer, Marcus Schaefer:
Hanani-Tutte for Radial Planarity. J. Graph Algorithms Appl. 21(1): 135-154 (2017) - [j27]Marcus Schaefer, Daniel Stefankovic:
Fixed Points, Nash Equilibria, and the Existential Theory of the Reals. Theory Comput. Syst. 60(2): 172-193 (2017) - 2016
- [j26]Philipp Kindermann, Benjamin Niedermann, Ignaz Rutter, Marcus Schaefer, André Schulz, Alexander Wolff:
Multi-sided Boundary Labeling. Algorithmica 76(1): 225-258 (2016) - [c35]Radoslav Fulek, Michael J. Pelsmajer, Marcus Schaefer:
Hanani-Tutte for Radial Planarity II. GD 2016: 468-481 - [i6]Radoslav Fulek, Michael J. Pelsmajer, Marcus Schaefer:
Hanani-Tutte for Radial Planarity II. CoRR abs/1608.08662 (2016) - [i5]Marcus Schaefer, Daniel Stefankovic:
The Complexity of Tensor Rank. CoRR abs/1612.04338 (2016) - 2015
- [j25]Timothy M. Chan, Fabrizio Frati, Carsten Gutwenger, Anna Lubiw, Petra Mutzel, Marcus Schaefer:
Drawing Partially Embedded and Simultaneously Planar Graphs. J. Graph Algorithms Appl. 19(2): 681-706 (2015) - [c34]Marcus Schaefer, Daniel Stefankovic:
The Degenerate Crossing Number and Higher-Genus Embeddings. GD 2015: 63-74 - [c33]Radoslav Fulek, Michael J. Pelsmajer, Marcus Schaefer:
Hanani-Tutte for Radial Planarity. GD 2015: 99-110 - 2014
- [c32]Carsten Gutwenger, Petra Mutzel, Marcus Schaefer:
Practical Experience with Hanani-Tutte for Testing c-Planarity. ALENEX 2014: 86-97 - [c31]Marcus Schaefer:
Picking Planar Edges; or, Drawing a Graph with a Planar Subgraph. GD 2014: 13-24 - [c30]Timothy M. Chan, Fabrizio Frati, Carsten Gutwenger, Anna Lubiw, Petra Mutzel, Marcus Schaefer:
Drawing Partially Embedded and Simultaneously Planar Graphs. GD 2014: 25-39 - [c29]Eyal Ackerman, Marcus Schaefer:
A Crossing Lemma for the Pair-Crossing Number. GD 2014: 222-233 - [i4]Timothy M. Chan, Fabrizio Frati, Carsten Gutwenger, Anna Lubiw, Petra Mutzel, Marcus Schaefer:
Drawing Partially Embedded and Simultaneously Planar Graphs. CoRR abs/1410.8205 (2014) - 2013
- [j24]Marcus Schaefer:
Toward a Theory of Planarity: Hanani-Tutte and Planarity Variants. J. Graph Algorithms Appl. 17(4): 367-440 (2013) - [c28]Marcus Schaefer, Daniel Stefankovic:
Block Additivity of ℤ2-Embeddings. GD 2013: 185-195 - [c27]Philipp Kindermann, Benjamin Niedermann, Ignaz Rutter, Marcus Schaefer, André Schulz, Alexander Wolff:
Two-Sided Boundary Labeling with Adjacent Sides. WADS 2013: 463-474 - [i3]Philipp Kindermann, Benjamin Niedermann, Ignaz Rutter, Marcus Schaefer, André Schulz, Alexander Wolff:
Multi-Sided Boundary Labeling. CoRR abs/1305.0750 (2013) - [i2]Marcus Schaefer:
Picking Planar Edges; or, Drawing a Graph with a Planar Subgraph. CoRR abs/1311.6839 (2013) - 2012
- [j23]Radoslav Fulek, Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic:
Adjacent Crossings Do Matter. J. Graph Algorithms Appl. 16(3): 759-782 (2012) - [c26]Marcus Schaefer:
Toward a Theory of Planarity: Hanani-Tutte and Planarity Variants. GD 2012: 162-173 - 2011
- [j22]Marcus Schaefer, Eric Sedgwick, Daniel Stefankovic:
Spiraling and Folding: The Word View. Algorithmica 60(3): 609-626 (2011) - [j21]Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic:
Crossing Numbers of Graphs with Rotation Systems. Algorithmica 60(3): 679-702 (2011) - [j20]Iyad A. Kanj, Michael J. Pelsmajer, Marcus Schaefer, Ge Xia:
On the induced matching problem. J. Comput. Syst. Sci. 77(6): 1058-1070 (2011) - [c25]Radoslav Fulek, Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic:
Adjacent Crossings Do Matter. GD 2011: 343-354 - [c24]Radoslav Fulek, Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic:
Hanani-Tutte and Monotone Drawings. WG 2011: 283-294 - 2010
- [j19]Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic:
Removing Independently Even Crossings. SIAM J. Discret. Math. 24(2): 379-393 (2010)
2000 – 2009
- 2009
- [j18]Dániel Marx, Marcus Schaefer:
The complexity of nonrepetitive coloring. Discret. Appl. Math. 157(1): 13-18 (2009) - [j17]Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic:
Removing even crossings on surfaces. Eur. J. Comb. 30(7): 1704-1717 (2009) - [j16]Michael J. Pelsmajer, Marcus Schaefer, Despina Stasi:
Strong Hanani--Tutte on the Projective Plane. SIAM J. Discret. Math. 23(3): 1317-1323 (2009) - [c23]Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic:
Removing Independently Even Crossings. GD 2009: 201-206 - [c22]Marcus Schaefer:
Complexity of Some Geometric and Topological Problems. GD 2009: 334-344 - 2008
- [j15]Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic:
Odd Crossing Number and Crossing Number Are Not the Same. Discret. Comput. Geom. 39(1-3): 442-454 (2008) - [c21]Marcus Schaefer, Eric Sedgwick, Daniel Stefankovic:
Computing Dehn Twists and Geometric Intersection Numbers in Polynomial Time. CCCG 2008 - [c20]Iyad A. Kanj, Michael J. Pelsmajer, Ge Xia, Marcus Schaefer:
On the Induced Matching Problem. STACS 2008: 397-408 - 2007
- [j14]Peter Hui, Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic:
Train Tracks and Confluent Drawings. Algorithmica 47(4): 465-479 (2007) - [j13]Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic:
Removing Even Crossings on Surfaces. Electron. Notes Discret. Math. 29: 85-90 (2007) - [j12]Marcus Schaefer, Eric Sedgwick, Daniel Stefankovic:
Folding and Spiralling: The Word View. Electron. Notes Discret. Math. 29: 101-105 (2007) - [j11]Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic:
Removing even crossings. J. Comb. Theory B 97(4): 489-500 (2007) - [j10]Martin Kummer, Marcus Schäfer:
Cuppability of Simple and Hypersimple Sets. Notre Dame J. Formal Log. 48(3): 349-369 (2007) - [c19]Marcus Schaefer, Eric Sedgwick, Daniel Stefankovic:
Spiralling and Folding: The Topological View. CCCG 2007: 73-76 - [c18]Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic:
Crossing Number of Graphs with Rotation Systems. GD 2007: 3-12 - [c17]Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic:
Crossing Numbers and Parameterized Complexity. GD 2007: 31-36 - [c16]Alejandro Estrella-Balderrama, Elisabeth Gassner, Michael Jünger, Merijam Percan, Marcus Schaefer, Michael Schulz:
Simultaneous Geometric Graph Embeddings. GD 2007: 280-290 - 2006
- [c15]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. Discret. Math. 19(3): 728-743 (2005) - [c14]Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic:
Odd Crossing Number Is Not Crossing Number. GD 2005: 386-396 - 2004
- [j8]Marcus Schaefer, Daniel Stefankovic:
Decidability of string graphs. J. Comput. Syst. Sci. 68(2): 319-334 (2004) - [c13]Peter Hui, Marcus Schaefer, Daniel Stefankovic:
Train Tracks and Confluent Drawings. GD 2004: 318-328 - [c12]Peter Hui, Marcus Schaefer:
Paired Pointset Traversal. ISAAC 2004: 534-544 - [c11]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. Electron. Colloquium Comput. Complex. TR04 (2004) - 2003
- [j7]Marcus Schaefer, Pradyut Shah:
Induced Graph Ramsey Theory. Ars Comb. 66 (2003) - [j6]Marcus Schaefer, Eric Sedgwick, Daniel Stefankovic:
Recognizing string graphs in NP. J. Comput. Syst. Sci. 67(2): 365-380 (2003) - [c10]Marcus Schaefer, Frank Stephan:
Strong Reductions and Immunity for Exponential Time. STACS 2003: 559-570 - 2002
- [c9]Marcus Schaefer, Eric Sedgwick, Daniel Stefankovic:
Algorithms for Normal Curves and Surfaces. COCOON 2002: 370-380 - [c8]Marcus Schaefer, Eric Sedgwick, Daniel Stefankovic:
Recognizing string graphs in NP. STOC 2002: 1-6 - 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) - [c7]Marcus Schaefer, Daniel Stefankovic:
Decidability of string graphs. STOC 2001: 241-246 - 2000
- [c6]Marcus Schaefer:
Deciding the K-Dimension is PSPACE-Complete. CCC 2000: 198-203
1990 – 1999
- 1999
- [j3]Marcus Schaefer:
Deciding the Vapnik-Červonenkis Dimension in ∑p3-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) - [c5]Marcus Schaefer:
Graph Ramsey Theory and the Polynomial Hierarchy (Abstract). CCC 1999: 6 - [c4]Marcus Schaefer:
Graph Ramsey Theory and the Polynomial Hierarchy. STOC 1999: 592-601 - 1998
- [j1]Marcus Schaefer:
A guided tour of minimal indices and shortest descriptions. Arch. Math. Log. 37(8): 521-548 (1998) - 1997
- [c3]Stephen A. Fenner, Steven Homer, Randall Pruim, Marcus Schaefer:
Hyper-Polynomial Hierarchies and the NP-Jump. CCC 1997: 102-110 - 1996
- [c2]Marcus Schäfer:
Deciding the Vapnik-Cervonenkis dimension is SigmaP3-complete. CCC 1996: 77-80 - 1995
- [c1]Martin Kummer, Marcus Schäfer:
Computability of Convex Sets (Extended Abstract). STACS 1995: 550-561
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-20 22:56 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
