Follow
Marcus Schaefer
Title
Cited by
Cited by
Year
Completeness in the polynomial-time hierarchy: A compendium
M Schaefer, C Umans
SIGACT news 33 (3), 32-49, 2002
2102002
Recognizing string graphs in NP
M Schaefer, E Sedgwick, D Štefankovič
Proceedings of the thiry-fourth annual ACM symposium on Theory of computing, 1-6, 2002
2012002
The graph crossing number and its variants: A survey
M Schaefer
The electronic journal of combinatorics, DS21: May 17-2024, 2012
1962012
Complexity of some geometric and topological problems
M Schaefer
International Symposium on Graph Drawing, 334-344, 2009
1802009
Fixed points, Nash equilibria, and the existential theory of the reals
M Schaefer, D Štefankovič
Theory of Computing Systems 60 (2), 172-193, 2017
1442017
Decidability of string graphs
M Schaefer, D Stefankovic
Proceedings of the thirty-third annual ACM symposium on Theory of computing …, 2001
1242001
Algorithms
R Johnsonbaugh, M Schaefer
Pearson Education India, 2003
1092003
Realizability of graphs and linkages
M Schaefer
Thirty essays on geometric graph theory, 461-482, 2012
1042012
Crossing numbers of graphs
M Schaefer
CRC Press, 2018
912018
Toward a theory of planarity: Hanani-Tutte and planarity variants
M Schaefer
International Symposium on Graph Drawing, 162-173, 2012
862012
Removing even crossings
D Štefankovič, M Schaefer, MJ Pelsmajer
Eurocomb (Discrete Mathematics & Theoretical Computer Science), 105-110, 2005
78*2005
Simultaneous geometric graph embeddings
A Estrella-Balderrama, E Gassner, M Jünger, M Percan, M Schaefer, ...
International Symposium on Graph Drawing, 280-290, 2007
742007
Parameterized algorithms for feedback vertex set
I Kanj, M Pelsmajer, M Schaefer
International Workshop on Parameterized and Exact Computation, 235-247, 2004
682004
Graph Ramsey theory and the polynomial hierarchy
M Schaefer
Proceedings of the thirty-first annual ACM symposium on Theory of computing …, 1999
681999
Simultaneous graph embeddings with fixed edges
E Gassner, M Jünger, M Percan, M Schaefer, M Schulz
Graph-Theoretic Concepts in Computer Science: 32nd International Workshop …, 2006
662006
On the induced matching problem
I Kanj, MJ Pelsmajer, M Schaefer, G Xia
Journal of Computer and System Sciences 77 (6), 1058-1070, 2011
622011
Hanani–Tutte, monotone drawings, and level-planarity
R Fulek, MJ Pelsmajer, M Schaefer, D Štefankovič
Thirty essays on geometric graph theory, 263-287, 2013
572013
Deciding the Vapnik–Červonenkis Dimension is ∑^p_3-complete
M Schaefer
Journal of Computer and System Sciences 58 (1), 177-182, 1999
561999
Odd crossing number and crossing number are not the same
MJ Pelsmajer, M Schaefer, D Štefankovic
Twentieth Anniversary Volume: Discrete & Computational Geometry, 1-13, 2009
452009
Completeness in the polynomial-time hierarchy: Part II
M Schaefer, C Umans
SIGACT News 33 (4), 22-36, 2002
412002
The system can't perform the operation now. Try again later.
Articles 1–20