List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| Beyond the Existential Theory of the Reals Theory of Computing Systems | 2024-04-21 | Paper |
| RAC-Drawability is ∃ℝ-complete and Related Results Journal of Graph Algorithms and Applications | 2023-12-20 | Paper |
| The Complexity of Angular Resolution Journal of Graph Algorithms and Applications | 2023-09-20 | Paper |
| Hanani-Tutte for radial planarity. II The Electronic Journal of Combinatorics | 2023-02-17 | Paper |
| Hanani--Tutte and Hierarchical Partial Planarity SIAM Journal on Discrete Mathematics | 2022-12-02 | Paper |
| RAC-drawability is \(\exists \mathbb{R} \)-complete (available as arXiv preprint) | 2022-07-01 | Paper |
| The degenerate crossing number and higher-genus embeddings Journal of Graph Algorithms and Applications | 2022-06-28 | Paper |
| Spiraling and Folding: The Topological View | 2022-06-15 | Paper |
| A new algorithm for embedding plane graphs at fixed vertex locations The Electronic Journal of Combinatorics | 2022-04-04 | Paper |
| 10 reasons to get interested in graph drawing | 2022-02-16 | Paper |
| RAC-drawability is $\exists\mathbb{R}$-complete (available as arXiv preprint) | 2021-07-24 | Paper |
| Taking a detour; or, Gioan's theorem, and pseudolinear drawings of complete graphs Discrete & Computational Geometry | 2021-07-02 | Paper |
| A note on the maximum rectilinear crossing number of spiders (available as arXiv preprint) | 2021-04-14 | Paper |
| On the complexity of some geometric problems with fixed parameters Journal of Graph Algorithms and Applications | 2021-03-29 | Paper |
| Complexity of geometric \(k\)-planarity for fixed \(k\) Journal of Graph Algorithms and Applications | 2021-01-19 | Paper |
| Strong Hanani-Tutte for the Torus | 2020-09-01 | Paper |
| Link crossing number is NP-hard Journal of Knot Theory and Its Ramifications | 2020-08-27 | Paper |
| Practical Experience with Hanani-Tutte for Testing c-Planarity 2014 Proceedings of the Sixteenth Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-12 | Paper |
| The complexity of tensor rank Theory of Computing Systems | 2018-07-23 | Paper |
| Crossing numbers of graphs | 2017-11-10 | Paper |
| Hanani-Tutte for Radial Planarity Journal of Graph Algorithms and Applications | 2017-04-05 | Paper |
| Fixed points, Nash equilibria, and the existential theory of the reals Theory of Computing Systems | 2017-03-31 | Paper |
| Hanani-Tutte for Radial Planarity II Lecture Notes in Computer Science | 2017-02-21 | Paper |
| The Degenerate Crossing Number and Higher-Genus Embeddings Lecture Notes in Computer Science | 2017-02-10 | Paper |
| Hanani-Tutte for Radial Planarity Lecture Notes in Computer Science | 2017-02-10 | Paper |
| Multi-sided boundary labeling Algorithmica | 2016-11-01 | Paper |
| Graph Ramsey theory and the polynomial hierarchy 1345.68147 | 2016-09-29 | Paper |
| Drawing partially embedded and simultaneously planar graphs Journal of Graph Algorithms and Applications | 2016-01-07 | Paper |
| Hanani-Tutte and related results Bolyai Society Mathematical Studies | 2015-06-24 | Paper |
| Decidability of string graphs Proceedings of the thirty-third annual ACM symposium on Theory of computing | 2015-02-27 | Paper |
| Drawing partially embedded and simultaneously planar graphs Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications | 2015-01-07 | Paper |
| A crossing lemma for the pair-crossing number Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications | 2015-01-07 | Paper |
| Picking planar edges; or, drawing a graph with a planar subgraph Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications | 2015-01-07 | Paper |
| Block additivity of \(\mathbb Z_{2}\)-embeddings Graph Drawing | 2013-12-20 | Paper |
| Realizability of graphs and linkages Thirty Essays on Geometric Graph Theory | 2013-09-25 | Paper |
| Hanani-Tutte, monotone drawings, and level-planarity Thirty Essays on Geometric Graph Theory | 2013-09-25 | Paper |
| Toward a theory of planarity: Hanani-Tutte and planarity variants Journal of Graph Algorithms and Applications | 2013-08-13 | Paper |
| Two-sided boundary labeling with adjacent sides Lecture Notes in Computer Science | 2013-08-12 | Paper |
| The graph crossing number and its variants: a survey The Electronic Journal of Combinatorics | 2013-06-07 | Paper |
| Toward a theory of planarity: Hanani-Tutte and planarity variants Graph Drawing | 2013-04-03 | Paper |
| On the Induced Matching Problem | 2013-03-19 | Paper |
| Adjacent crossings do matter Journal of Graph Algorithms and Applications | 2012-12-07 | Paper |
| Adjacent Crossings Do Matter Graph Drawing | 2012-03-09 | Paper |
| On the induced matching problem Journal of Computer and System Sciences | 2012-01-11 | Paper |
| Hanani-Tutte and monotone drawings Graph-Theoretic Concepts in Computer Science | 2011-12-16 | Paper |
| Crossing numbers of graphs with rotation systems Algorithmica | 2011-06-30 | Paper |
| Spiraling and folding: the word view Algorithmica | 2011-06-30 | Paper |
| Removing Independently Even Crossings SIAM Journal on Discrete Mathematics | 2011-04-15 | Paper |
| Strong Hanani–Tutte on the Projective Plane SIAM Journal on Discrete Mathematics | 2010-08-27 | Paper |
| Recognizing string graphs in NP Proceedings of the thiry-fourth annual ACM symposium on Theory of computing | 2010-08-05 | Paper |
| scientific article; zbMATH DE number 5763167 (Why is no real title available?) | 2010-07-30 | Paper |
| Complexity of some geometric and topological problems Graph Drawing | 2010-04-27 | Paper |
| Removing independently even crossings Graph Drawing | 2010-04-27 | Paper |
| Removing even crossings on surfaces European Journal of Combinatorics | 2009-11-30 | Paper |
| scientific article; zbMATH DE number 5542505 (Why is no real title available?) | 2009-04-14 | Paper |
| The complexity of nonrepetitive coloring Discrete Applied Mathematics | 2009-03-04 | Paper |
| Removing Even Crossings on Surfaces Electronic Notes in Discrete Mathematics | 2008-06-05 | Paper |
| Folding and Spiralling: The Word View Electronic Notes in Discrete Mathematics | 2008-06-05 | Paper |
| Odd crossing number and crossing number are not the same Discrete & Computational Geometry | 2008-04-16 | Paper |
| Crossing Numbers and Parameterized Complexity Graph Drawing | 2008-03-25 | Paper |
| Crossing Number of Graphs with Rotation Systems Graph Drawing | 2008-03-25 | Paper |
| Removing even crossings Journal of Combinatorial Theory. Series B | 2007-06-08 | Paper |
| Train tracks and confluent drawings Algorithmica | 2007-05-10 | Paper |
| Graph Drawing Lecture Notes in Computer Science | 2006-11-13 | Paper |
| Solvability of Graph Inequalities SIAM Journal on Discrete Mathematics | 2006-06-01 | Paper |
| Algorithms and Computation Lecture Notes in Computer Science | 2005-12-22 | Paper |
| Graph Drawing Lecture Notes in Computer Science | 2005-12-07 | Paper |
| Parameterized and Exact Computation Lecture Notes in Computer Science | 2005-08-23 | Paper |
| scientific article; zbMATH DE number 2197902 (Why is no real title available?) | 2005-08-23 | Paper |
| Decidability of string graphs Journal of Computer and System Sciences | 2004-11-22 | Paper |
| Recognizing string graphs in NP Journal of Computer and System Sciences | 2004-11-18 | Paper |
| scientific article; zbMATH DE number 2089992 (Why is no real title available?) | 2004-08-12 | Paper |
| scientific article; zbMATH DE number 1962844 (Why is no real title available?) | 2003-08-11 | Paper |
| Graph Ramsey theory and the polynomial hierarchy Journal of Computer and System Sciences | 2002-06-03 | Paper |
| Hyper-polynomial hierarchies and the polynomial jump Theoretical Computer Science | 2002-03-03 | Paper |
| Deciding the Vapnik-Červonenkis dimension is \(\Sigma_3^p\)-complete Journal of Computer and System Sciences | 2000-10-17 | Paper |
| Bounded Immunity and Btt-Reductions Mathematical Logic Quarterly | 1999-09-21 | Paper |
| A guided tour of minimal indices and shortest descriptions Archive for Mathematical Logic | 1998-08-10 | Paper |
Research outcomes over time
This page was built for person: Marcus Schaefer
