Marcus Schaefer
Title
Cited by
Cited by
Year
Recognizing string graphs in NP
M Schaefer, E Sedgwick, D Štefankovič
Journal of Computer and System Sciences 67 (2), 365-380, 2003
1702003
Completeness in the polynomial-time hierarchy: A compendium
M Schaefer, C Umans
SIGACT news 33 (3), 32-49, 2002
1622002
The graph crossing number and its variants: A survey
M Schaefer
The electronic journal of combinatorics, DS21: Feb 14-2020, 2012
1022012
Decidability of string graphs
M Schaefer, D Stefankovic
Journal of Computer and System Sciences 68 (2), 319-334, 2004
1012004
Complexity of some geometric and topological problems
M Schaefer
International Symposium on Graph Drawing, 334-344, 2009
952009
Algorithms
R Johnsonbaugh, M Schaefer
Pearson Education, 2004
922004
Removing even crossings
MJ Pelsmajer, M Schaefer, D Štefankovič
Journal of Combinatorial Theory, Series B 97 (4), 489-500, 2007
672007
Fixed points, Nash equilibria, and the existential theory of the reals
M Schaefer, D Štefankovič
Theory of Computing Systems 60 (2), 172-193, 2017
642017
Toward a theory of planarity: Hanani-Tutte and planarity variants
M Schaefer
International Symposium on Graph Drawing, 162-173, 2012
622012
Parameterized algorithms for feedback vertex set
I Kanj, M Pelsmajer, M Schaefer
International Workshop on Parameterized and Exact Computation, 235-247, 2004
612004
Simultaneous geometric graph embeddings
A Estrella-Balderrama, E Gassner, M Jünger, M Percan, M Schaefer, ...
International Symposium on Graph Drawing, 280-290, 2007
602007
Graph Ramsey theory and the polynomial hierarchy
M Schaefer
Journal of Computer and System Sciences 62 (2), 290-322, 2001
562001
Simultaneous graph embeddings with fixed edges
E Gassner, M Jünger, M Percan, M Schaefer, M Schulz
International Workshop on Graph-Theoretic Concepts in Computer Science, 325-335, 2006
542006
Realizability of graphs and linkages
M Schaefer
Thirty Essays on Geometric Graph Theory, 461-482, 2013
492013
On the induced matching problem
I Kanj, MJ Pelsmajer, M Schaefer, G Xia
Journal of Computer and System Sciences 77 (6), 1058-1070, 2011
492011
Deciding the Vapnik–Červonenkis Dimension is∑ p3-complete
M Schaefer
Journal of Computer and System Sciences 58 (1), 177-182, 1999
471999
Completeness in the polynomial-time hierarchy: Part II
M Schaefer, C Umans
SIGACT News 33 (4), 22-36, 2002
392002
Crossing numbers of graphs
M Schaefer
CRC Press, 2018
362018
Odd crossing number and crossing number are not the same
MJ Pelsmajer, M Schaefer, D Štefankovic
Twentieth Anniversary Volume:, 1-13, 2009
342009
Strong Hanani–Tutte on the projective plane
MJ Pelsmajer, M Schaefer, D Stasi
SIAM Journal on Discrete Mathematics 23 (3), 1317-1323, 2009
312009
The system can't perform the operation now. Try again later.
Articles 1–20