Marcus Schaefer

引用次數

	全部	自 2020 年
引文	2924	1057
H 指數	27	15
i10 指數	54	33

300

150

225

20022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202518 11 27 40 50 88 88 92 77 101 134 135 120 159 139 163 134 191 177 161 210 191 284 33

公開取用

查看全部

8 篇文章

0 篇文章

可供使用

無法使用

根據資金強制性政策

共同作者

Daniel StefankovicUniversity of Rochester在 cs.rochester.edu 的電子郵件地址已通過驗證
Michael PelsmajerApplied Mathematics, Illinois Institute of Technology在 iit.edu 的電子郵件地址已通過驗證
Eric SedgwickProfessor, DePaul University在 cdm.depaul.edu 的電子郵件地址已通過驗證
Chris UmansProfessor of Computer Science, Caltech在 cs.caltech.edu 的電子郵件地址已通過驗證
Petra MutzelProfessorin für Informatik, Universität Bonn在 cs.uni-bonn.de 的電子郵件地址已通過驗證
Andre SchulzProfessor of CS在 fernuni-hagen.de 的電子郵件地址已通過驗證
Alexander WolffChair for Algorithms and Complexity, Institute of Computer Science, University of Würzburg在 uni-wuerzburg.de 的電子郵件地址已通過驗證
Ignaz RutterUniversity of Passau在 uni-passau.de 的電子郵件地址已通過驗證
Philipp KindermannUniversität Trier在 uni-trier.de 的電子郵件地址已通過驗證
Anna LubiwProfessor, David R. Cheriton School of Computer Science, University of Waterloo在 uwaterloo.ca 的電子郵件地址已通過驗證
Fabrizio FratiFull Professor, Roma Tre University在 dia.uniroma3.it 的電子郵件地址已通過驗證
Ge XiaLafayette College在 lafayette.edu 的電子郵件地址已通過驗證
Dániel MarxCISPA Helmholtz Center for Information Security在 cispa.saarland 的電子郵件地址已通過驗證
Randall PruimProfessor of Mathematics and Statistics, Calvin College在 calvin.edu 的電子郵件地址已通過驗證
Eyal AckermanUniversity of Haifa at Oranim在 sci.haifa.ac.il 的電子郵件地址已通過驗證
Frank StephanNational University of Singapore, Department of Mathematics and Department of Computer Science在 comp.nus.edu.sg 的電子郵件地址已通過驗證
Steve HomerProfessor, CS, Boston University在 cs.bu.edu 的電子郵件地址已通過驗證
Frederic GreenClark University在 clarku.edu 的電子郵件地址已通過驗證

追蹤

Marcus Schaefer

DePaul University

在 cdm.depaul.edu 的電子郵件地址已通過驗證 - 首頁

graph theory graph drawing computational complexity computability


標題按引用次數排序按年份排序按標題排序	引用次數引用次數	年份
Completeness in the polynomial-time hierarchy: A compendium M Schaefer, C Umans SIGACT news 33 (3), 32-49, 2002	211	2002
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	211	2002
The graph crossing number and its variants: A survey M Schaefer The electronic journal of combinatorics, DS21: May 17-2024, 2012	209	2012
Complexity of some geometric and topological problems M Schaefer International Symposium on Graph Drawing, 334-344, 2009	192	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	151	2017
Decidability of string graphs M Schaefer, D Stefankovic Proceedings of the thirty-third annual ACM symposium on Theory of computing …, 2001	125	2001
Realizability of graphs and linkages M Schaefer Thirty essays on geometric graph theory, 461-482, 2012	109	2012
Algorithms R Johnsonbaugh, M Schaefer Pearson Education India, 2003	108	2003
Crossing numbers of graphs M Schaefer CRC Press, 2018	95	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	77*	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	72	2004
Graph Ramsey theory and the polynomial hierarchy M Schaefer Proceedings of the thirty-first annual ACM symposium on Theory of computing …, 1999	70	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	69	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	59	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	47	2009
The complexity of tensor rank M Schaefer, D Štefankovič Theory of Computing Systems 62, 1161-1174, 2018	46	2018

系統目前無法執行作業，請稍後再試。

文章 1–20

每年的引文數

重複引用

合併引文

新增共同作者共同作者

追蹤

引用次數

共同作者