The SCEAS System
| |||||||

## Search the dblp DataBase
Marcus Schaefer:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Stephen A. Fenner, Steven Homer, Randall Pruim, Marcus Schaefer
**Hyper-Polynomial Hierarchies and the NP-Jump.**[Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 1997, pp:102-110 [Conf] - Marcus Schaefer
**Deciding the K-Dimension is PSPACE-Complete.**[Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 2000, pp:198-203 [Conf] - Marcus Schaefer
**Graph Ramsey Theory and the Polynomial Hierarchy (Abstract).**[Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 1999, pp:6- [Conf] - Marcus Schaefer, Eric Sedgwick, Daniel Stefankovic
**Algorithms for Normal Curves and Surfaces.**[Citation Graph (0, 0)][DBLP] COCOON, 2002, pp:370-380 [Conf] - Peter Hui, Marcus Schaefer, Daniel Stefankovic
**Train Tracks and Confluent Drawings.**[Citation Graph (0, 0)][DBLP] Graph Drawing, 2004, pp:318-328 [Conf] - Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic
**Odd Crossing Number Is Not Crossing Number.**[Citation Graph (0, 0)][DBLP] Graph Drawing, 2005, pp:386-396 [Conf] - Peter Hui, Marcus Schaefer
**Paired Pointset Traversal.**[Citation Graph (0, 0)][DBLP] ISAAC, 2004, pp:534-544 [Conf] - Iyad A. Kanj, Michael J. Pelsmajer, Marcus Schaefer
**Parameterized Algorithms for Feedback Vertex Set.**[Citation Graph (0, 0)][DBLP] IWPEC, 2004, pp:235-247 [Conf] - Marcus Schaefer, Frank Stephan
**Strong Reductions and Immunity for Exponential Time.**[Citation Graph (0, 0)][DBLP] STACS, 2003, pp:559-570 [Conf] - Marcus Schaefer
**Graph Ramsey Theory and the Polynomial Hierarchy.**[Citation Graph (0, 0)][DBLP] STOC, 1999, pp:592-601 [Conf] - Marcus Schaefer, Daniel Stefankovic
**Decidability of string graphs.**[Citation Graph (0, 0)][DBLP] STOC, 2001, pp:241-246 [Conf] - Marcus Schaefer, Eric Sedgwick, Daniel Stefankovic
**Recognizing string graphs in NP.**[Citation Graph (0, 0)][DBLP] STOC, 2002, pp:1-6 [Conf] - Elisabeth Gassner, Michael Jünger, Merijam Percan, Marcus Schaefer, Michael Schulz
**Simultaneous Graph Embeddings with Fixed Edges.**[Citation Graph (0, 0)][DBLP] WG, 2006, pp:325-335 [Conf] - Marcus Schaefer, Pradyut Shah
**Induced Graph Ramsey Theory.**[Citation Graph (0, 0)][DBLP] Ars Comb., 2003, v:66, n:, pp:- [Journal] - Marcus Schaefer, Stephen A. Fenner
**Simplicity and Strong Reductions**[Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2004, v:, n:071, pp:- [Journal] - Marcus Schaefer
**Graph Ramsey Theory and the Polynomial Hierarchy.**[Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 2001, v:62, n:2, pp:290-322 [Journal] - Marcus Schaefer
**Deciding the Vapnik-Cervonenkis Dimension in Sigma**[Citation Graph (0, 0)][DBLP]^{p}_{3}-Complete. J. Comput. Syst. Sci., 1999, v:58, n:1, pp:177-182 [Journal] - Marcus Schaefer, Daniel Stefankovic
**Decidability of string graphs.**[Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 2004, v:68, n:2, pp:319-334 [Journal] - Marcus Schaefer, Eric Sedgwick, Daniel Stefankovic
**Recognizing string graphs in NP.**[Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 2003, v:67, n:2, pp:365-380 [Journal] - Stephen A. Fenner, Marcus Schaefer
**Bounded Immunity and Btt-Reductions.**[Citation Graph (0, 0)][DBLP] Math. Log. Q., 1999, v:45, n:, pp:3-21 [Journal] - Marcus Schaefer, Daniel Stefankovic
**Solvability of Graph Inequalities.**[Citation Graph (0, 0)][DBLP] SIAM J. Discrete Math., 2005, v:19, n:3, pp:728-743 [Journal] - Stephen A. Fenner, Steven Homer, Randall Pruim, Marcus Schaefer
**Hyper-polynomial hierarchies and the polynomial jump.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2001, v:262, n:1, pp:241-256 [Journal] - Marcus Schaefer, Eric Sedgwick, Daniel Stefankovic
**Spiralling and Folding: The Topological View.**[Citation Graph (0, 0)][DBLP] CCCG, 2007, pp:73-76 [Conf] - Peter Hui, Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic
**Train Tracks and Confluent Drawings.**[Citation Graph (0, 0)][DBLP] Algorithmica, 2007, v:47, n:4, pp:465-479 [Journal] - Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic
**Removing even crossings.**[Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 2007, v:97, n:4, pp:489-500 [Journal] **Computing Dehn Twists and Geometric Intersection Numbers in Polynomial Time.**[Citation Graph (, )][DBLP]**Removing Independently Even Crossings.**[Citation Graph (, )][DBLP]**Simultaneous Geometric Graph Embeddings.**[Citation Graph (, )][DBLP]**Crossing Number of Graphs with Rotation Systems.**[Citation Graph (, )][DBLP]**Crossing Numbers and Parameterized Complexity.**[Citation Graph (, )][DBLP]**Complexity of Some Geometric and Topological Problems.**[Citation Graph (, )][DBLP]**On the Induced Matching Problem.**[Citation Graph (, )][DBLP]**A guided tour of minimal indices and shortest descriptions.**[Citation Graph (, )][DBLP]**The complexity of nonrepetitive coloring.**[Citation Graph (, )][DBLP]**Odd Crossing Number and Crossing Number Are Not the Same.**[Citation Graph (, )][DBLP]**Removing even crossings on surfaces.**[Citation Graph (, )][DBLP]
Search in 0.005secs, Finished in 0.006secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |