Marcus Schaefer

Citado por

	Todos	Desde 2019
Citações	2861	1192
Índice h	27	16
Índice i10	50	32

280

140

210

2002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202421 11 28 35 52 87 88 96 73 100 133 133 123 154 144 167 131 189 175 156 207 191 272

Acesso público

Ver todos

8 artigos

0 artigo

disponível

não disponível

Com base nas autorizações de financiamento

Coautores

Daniel StefankovicUniversity of RochesterE-mail confirmado em cs.rochester.edu
Michael PelsmajerApplied Mathematics, Illinois Institute of TechnologyE-mail confirmado em iit.edu
Eric SedgwickProfessor, DePaul UniversityE-mail confirmado em cdm.depaul.edu
Chris UmansProfessor of Computer Science, CaltechE-mail confirmado em cs.caltech.edu
Petra MutzelProfessorin für Informatik, Universität BonnE-mail confirmado em cs.uni-bonn.de
Andre SchulzProfessor of CSE-mail confirmado em fernuni-hagen.de
Alexander WolffChair for Algorithms and Complexity, Institute of Computer Science, University of WürzburgE-mail confirmado em uni-wuerzburg.de
Ignaz RutterUniversity of PassauE-mail confirmado em uni-passau.de
Philipp KindermannUniversität TrierE-mail confirmado em uni-trier.de
Anna LubiwProfessor, David R. Cheriton School of Computer Science, University of WaterlooE-mail confirmado em uwaterloo.ca
Fabrizio FratiFull Professor, Roma Tre UniversityE-mail confirmado em dia.uniroma3.it
Ge XiaLafayette CollegeE-mail confirmado em lafayette.edu
Dániel MarxCISPA Helmholtz Center for Information SecurityE-mail confirmado em cispa.saarland
Randall PruimProfessor of Mathematics and Statistics, Calvin CollegeE-mail confirmado em calvin.edu
Eyal AckermanUniversity of Haifa at OranimE-mail confirmado em sci.haifa.ac.il
Frank StephanNational University of Singapore, Department of Mathematics and Department of Computer ScienceE-mail confirmado em comp.nus.edu.sg
Steve HomerProfessor, CS, Boston UniversityE-mail confirmado em cs.bu.edu
Frederic GreenClark UniversityE-mail confirmado em clarku.edu

Seguir

Marcus Schaefer

DePaul University

E-mail confirmado em cdm.depaul.edu - Página inicial

graph theory graph drawing computational complexity computability


Título Ordenar por citações Ordenar por ano Ordenar por título	Citado por Citado por	Ano
Completeness in the polynomial-time hierarchy: A compendium M Schaefer, C Umans SIGACT news 33 (3), 32-49, 2002	211	2002
The graph crossing number and its variants: A survey M Schaefer The electronic journal of combinatorics, DS21: May 17-2024, 2012	202	2012
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	202	2002
Complexity of some geometric and topological problems M Schaefer International Symposium on Graph Drawing, 334-344, 2009	186	2009
Fixed points, Nash equilibria, and the existential theory of the reals M Schaefer, D Štefankovič Theory of Computing Systems 60 (2), 172-193, 2017	146	2017
Decidability of string graphs M Schaefer, D Stefankovic Proceedings of the thirty-third annual ACM symposium on Theory of computing …, 2001	124	2001
Algorithms R Johnsonbaugh, M Schaefer Pearson Education India, 2003	109	2003
Realizability of graphs and linkages M Schaefer Thirty essays on geometric graph theory, 461-482, 2012	107	2012
Crossing numbers of graphs M Schaefer CRC Press, 2018	93	2018
Toward a theory of planarity: Hanani-Tutte and planarity variants M Schaefer International Symposium on Graph Drawing, 162-173, 2012	86	2012
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	75	2007
Parameterized algorithms for feedback vertex set I Kanj, M Pelsmajer, M Schaefer International Workshop on Parameterized and Exact Computation, 235-247, 2004	69	2004
Graph Ramsey theory and the polynomial hierarchy M Schaefer Proceedings of the thirty-first annual ACM symposium on Theory of computing …, 1999	68	1999
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	66	2006
On the induced matching problem I Kanj, MJ Pelsmajer, M Schaefer, G Xia Journal of Computer and System Sciences 77 (6), 1058-1070, 2011	62	2011
Hanani–Tutte, monotone drawings, and level-planarity R Fulek, MJ Pelsmajer, M Schaefer, D Štefankovič Thirty essays on geometric graph theory, 263-287, 2013	57	2013
Deciding the Vapnik–Červonenkis Dimension is ∑^p_3-complete M Schaefer Journal of Computer and System Sciences 58 (1), 177-182, 1999	56	1999
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	46	2009
The complexity of tensor rank M Schaefer, D Štefankovič Theory of Computing Systems 62, 1161-1174, 2018	44	2018

O sistema não pode executar a operação agora. Tente novamente mais tarde.

Artigos 1–20

Citações por ano

Citações duplicadas

Citações mescladas

Adicionar coautoresCoautores

Seguir

Citado por

Coautores