The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Marcus Schaefer" ( http://dblp.L3S.de/Authors/Marcus_Schaefer )

  Author page on DBLP  Author page in RDF  Community of Marcus Schaefer in ASPL-2

Publication years (Num. hits)
1997-2003 (15) 2004-2007 (16) 2008-2011 (14)
Publication types (Num. hits)
article(22) inproceedings(23)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 7 occurrences of 6 keywords

Results
Found 45 publication records. Showing 45 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic Crossing Numbers of Graphs with Rotation Systems. Search on Bibsonomy Algorithmica The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Marcus Schaefer, Eric Sedgwick, Daniel Stefankovic Spiraling and Folding: The Word View. Search on Bibsonomy Algorithmica The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Iyad A. Kanj, Michael J. Pelsmajer, Marcus Schaefer, Ge Xia On the induced matching problem. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Radoslav Fulek, Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic Hanani-Tutte and Monotone Drawings. Search on Bibsonomy WG The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Radoslav Fulek, Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic Adjacent Crossings Do Matter. Search on Bibsonomy Graph Drawing The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic Removing Independently Even Crossings. Search on Bibsonomy SIAM J. Discrete Math. The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic Removing even crossings on surfaces. Search on Bibsonomy Eur. J. Comb. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Michael J. Pelsmajer, Marcus Schaefer, Despina Stasi Strong Hanani--Tutte on the Projective Plane. Search on Bibsonomy SIAM J. Discrete Math. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Dániel Marx, Marcus Schaefer The complexity of nonrepetitive coloring. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic Removing Independently Even Crossings. Search on Bibsonomy Graph Drawing The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Marcus Schaefer Complexity of Some Geometric and Topological Problems. Search on Bibsonomy Graph Drawing The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic Odd Crossing Number and Crossing Number Are Not the Same. Search on Bibsonomy Discrete & Computational Geometry The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Marcus Schaefer, Eric Sedgwick, Daniel Stefankovic Computing Dehn Twists and Geometric Intersection Numbers in Polynomial Time. Search on Bibsonomy CCCG The full citation details ... 2008 DBLP  BibTeX  RDF
1Iyad A. Kanj, Michael J. Pelsmajer, Ge Xia, Marcus Schaefer On the Induced Matching Problem. Search on Bibsonomy STACS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic Removing even crossings. Search on Bibsonomy J. Comb. Theory, Ser. B The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic Removing Even Crossings on Surfaces. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Marcus Schaefer, Eric Sedgwick, Daniel Stefankovic Folding and Spiralling: The Word View. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Peter Hui, Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic Train Tracks and Confluent Drawings. Search on Bibsonomy Algorithmica The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Marcus Schaefer, Eric Sedgwick, Daniel Stefankovic Spiralling and Folding: The Topological View. Search on Bibsonomy CCCG The full citation details ... 2007 DBLP  BibTeX  RDF
1Alejandro Estrella-Balderrama, Elisabeth Gassner, Michael Jünger, Merijam Percan, Marcus Schaefer, Michael Schulz Simultaneous Geometric Graph Embeddings. Search on Bibsonomy Graph Drawing The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic Crossing Number of Graphs with Rotation Systems. Search on Bibsonomy Graph Drawing The full citation details ... 2007 DBLP  DOI  BibTeX  RDF computational complexity, computational geometry, crossing number
1Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic Crossing Numbers and Parameterized Complexity. Search on Bibsonomy Graph Drawing The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Elisabeth Gassner, Michael Jünger, Merijam Percan, Marcus Schaefer, Michael Schulz Simultaneous Graph Embeddings with Fixed Edges. Search on Bibsonomy WG The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Marcus Schaefer, Daniel Stefankovic Solvability of Graph Inequalities. Search on Bibsonomy SIAM J. Discrete Math. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic Odd Crossing Number Is Not Crossing Number. Search on Bibsonomy Graph Drawing The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Marcus Schaefer, Stephen A. Fenner Simplicity and Strong Reductions Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2004 DBLP  BibTeX  RDF
1Marcus Schaefer, Daniel Stefankovic Decidability of string graphs. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Iyad A. Kanj, Michael J. Pelsmajer, Marcus Schaefer Parameterized Algorithms for Feedback Vertex Set. Search on Bibsonomy IWPEC The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Peter Hui, Marcus Schaefer Paired Pointset Traversal. Search on Bibsonomy ISAAC The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Peter Hui, Marcus Schaefer, Daniel Stefankovic Train Tracks and Confluent Drawings. Search on Bibsonomy Graph Drawing The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Marcus Schaefer, Eric Sedgwick, Daniel Stefankovic Recognizing string graphs in NP. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Marcus Schaefer, Pradyut Shah Induced Graph Ramsey Theory. Search on Bibsonomy Ars Comb. The full citation details ... 2003 DBLP  BibTeX  RDF
1Marcus Schaefer, Frank Stephan Strong Reductions and Immunity for Exponential Time. Search on Bibsonomy STACS The full citation details ... 2003 DBLP  DOI  BibTeX  RDF hardness for exponential time, polynomial time reducibilities, Computational and structural complexity
1Marcus Schaefer, Eric Sedgwick, Daniel Stefankovic Algorithms for Normal Curves and Surfaces. Search on Bibsonomy COCOON The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Marcus Schaefer, Eric Sedgwick, Daniel Stefankovic Recognizing string graphs in NP. Search on Bibsonomy STOC The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Stephen A. Fenner, Steven Homer, Randall Pruim, Marcus Schaefer Hyper-polynomial hierarchies and the polynomial jump. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Marcus Schaefer Graph Ramsey Theory and the Polynomial Hierarchy. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Marcus Schaefer, Daniel Stefankovic Decidability of string graphs. Search on Bibsonomy STOC The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Marcus Schaefer Deciding the K-Dimension is PSPACE-Complete. (PDF / PS) Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2000 DBLP  DOI  BibTeX  RDF computational complexity, learning theory, PSPACE
1Stephen A. Fenner, Marcus Schaefer Bounded Immunity and Btt-Reductions. Search on Bibsonomy Math. Log. Q. The full citation details ... 1999 DBLP  BibTeX  RDF
1Marcus Schaefer Deciding the Vapnik-Cervonenkis Dimension in Sigmap3-Complete. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
1Marcus Schaefer Graph Ramsey Theory and the Polynomial Hierarchy (Abstract). (PDF / PS) Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
1Marcus Schaefer Graph Ramsey Theory and the Polynomial Hierarchy. Search on Bibsonomy STOC The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
1Marcus Schaefer A guided tour of minimal indices and shortest descriptions. Search on Bibsonomy Arch. Math. Log. The full citation details ... 1998 DBLP  DOI  BibTeX  RDF Mathematics Subject Classification (1991): 03D15, 03D35, 03D80
1Stephen A. Fenner, Steven Homer, Randall Pruim, Marcus Schaefer Hyper-Polynomial Hierarchies and the NP-Jump. (PDF / PS) Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #45 of 45 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.