Andre Schulz 个人学术档案 - 学术资源搜索

引用次数

	总计	2019 年至今
引用	858	330
h 指数	17	11
i10 指数	28	14

2007200820092010201120122013201420152016201720182019202020212022202320243 7 14 10 21 39 67 55 78 72 73 64 77 66 52 45 60 29

开放获取的出版物数量

查看全部

30 篇文章

1 篇文章

可查看的文章

无法查看的文章

根据资助方的强制性开放获取政策

合著作者

Kevin BuchinProfessor of Computer Science, Technical University Dortmund在 tu-dortmund.de 的电子邮件经过验证
Philipp KindermannUniversität Trier在 uni-trier.de 的电子邮件经过验证
Wouter MeulemansEindhoven University of Technology在 tue.nl 的电子邮件经过验证
Csaba D. TothCalifornia State University Northridge在 csun.edu 的电子邮件经过验证
Erik DemaineProfessor of Electrical Engineering and Computer Science, Massachusetts Institute of Technology在 mit.edu 的电子邮件经过验证
Alexander WolffChair for Algorithms and Complexity, Institute of Computer Science, University of Würzburg在 uni-wuerzburg.de 的电子邮件经过验证
Maike BuchinRuhr-Universität Bochum在 rub.de 的电子邮件经过验证
Martin DemaineMIT在 mit.edu 的电子邮件经过验证
Maarten LöfflerComputer Science, Utrecht University在 cs.uu.nl 的电子邮件经过验证
Adam ShefferCUNY - Baruch College在 baruch.cuny.edu 的电子邮件经过验证
Anna LubiwProfessor, David R. Cheriton School of Computer Science, University of Waterloo在 uwaterloo.ca 的电子邮件经过验证
Diane SouvaineProfessor of Computer Science & Vice Provost for Research, Tufts University在 tufts.edu 的电子邮件经过验证
Christian KnauerInstitut für Informatik, Universität Bayreuth在 uni-bayreuth.de 的电子邮件经过验证
Andrew WinslowUnaffiliated在 tufts.edu 的电子邮件经过验证
Oswin AichholzerProf. Informatik, TU Graz, Graz, Austria在 ist.tugraz.at 的电子邮件经过验证
Joachim SpoerhaseDepartment of Computer Science, University of Sheffield, UK在 sheffield.ac.uk 的电子邮件经过验证
Ignaz RutterUniversity of Passau在 uni-passau.de 的电子邮件经过验证
Tetsuo AsanoProfessor of School of Information Science, JAIST在 jaist.ac.jp 的电子邮件经过验证
Matias KormanSiemens EDA在 mentor.com 的电子邮件经过验证
Martin NöllenburgProfessor, Algorithms and Complexity Group, TU Wien在 ac.tuwien.ac.at 的电子邮件经过验证

关注

Andre Schulz

Professor of CS

在 fernuni-hagen.de 的电子邮件经过验证 - 首页

Computational Geometry Graph Drawing Graph Algorithms Polytopes Information Visualization


标题按引用次数排序按年份排序按标题排序	引用次数引用次数	年份
Memory-constrained algorithms for simple polygons T Asano, K Buchin, M Buchin, M Korman, W Mulzer, G Rote, A Schulz Computational Geometry 46 (8), 959-969, 2013	64*	2013
Algorithms for labeling focus regions M Fink, JH Haunert, A Schulz, J Spoerhase, A Wolff IEEE Transactions on Visualization and Computer Graphics 18 (12), 2583-2592, 2012	60	2012
On the number of cycles in planar graphs K Buchin, C Knauer, K Kriegel, A Schulz, R Seidel Computing and Combinatorics: 13th Annual International Conference, COCOON …, 2007	57	2007
Bounds on the maximum multiplicity of some common geometric graphs A Dumitrescu, A Schulz, A Sheffer, CD Tóth SIAM Journal on Discrete Mathematics 27 (2), 802-826, 2013	55	2013
Counting plane graphs: flippability and its applications M Hoffmann, A Schulz, M Sharir, A Sheffer, CD Tóth, E Welzl Thirty Essays on Geometric Graph Theory, 303-325, 2012	41	2012
On the number of spanning trees a planar graph can have K Buchin, A Schulz Algorithms–ESA 2010: 18th Annual European Symposium, Liverpool, UK …, 2010	39	2010
Drawing graphs with few arcs A Schulz Journal of Graph Algorithms and Applications 19 (1), 393-412, 2015	31	2015
Two-sided boundary labeling with adjacent sides P Kindermann, B Niedermann, I Rutter, M Schaefer, A Schulz, A Wolff Algorithms and Data Structures: 13th International Symposium, WADS 2013 …, 2013	31*	2013
Small grid embeddings of 3-polytopes A Ribó Mor, G Rote, A Schulz Discrete and Computational Geometry, 1-23, 2011	31*	2011
Fréchet distance of surfaces: Some simple hard cases K Buchin, M Buchin, A Schulz European Symposium on Algorithms, 63-74, 2010	30	2010
On monotone drawings of trees P Kindermann, A Schulz, J Spoerhase, A Wolff Graph Drawing: 22nd International Symposium, GD 2014, Würzburg, Germany …, 2014	25	2014
Convexifying Polygons Without Losing Visibilities. O Aichholzer, G Aloupis, ED Demaine, ML Demaine, V Dujmovic, ... CCCG, 229-234, 2011	24	2011
Experimental analysis of the accessibility of drawings with few segments P Kindermann, W Meulemans, A Schulz Graph Drawing and Network Visualization: 25th International Symposium, GD …, 2018	21	2018
On minimizing crossings in storyline visualizations I Kostitsyna, M Nöllenburg, V Polishchuk, A Schulz, D Strash International Symposium on Graph Drawing, 192-198, 2015	20	2015
Embedding stacked polytopes on a polynomial-size grid ED Demaine, A Schulz Discrete & Computational Geometry 57, 782-809, 2017	18	2017
Contact graphs of circular arcs MJ Alam, D Eppstein, M Kaufmann, SG Kobourov, S Pupyrev, A Schulz, ... Algorithms and Data Structures: 14th International Symposium, WADS 2015 …, 2015	18*	2015
Drawing planar graphs with few geometric primitives G Hültenschmidt, P Kindermann, W Meulemans, A Schulz International Workshop on Graph-Theoretic Concepts in Computer Science, 316-329, 2017	17*	2017
Realization of simply connected polygonal linkages and recognition of unit disk contact trees C Bowen, S Durocher, M Löffler, A Rounds, A Schulz, CD Tóth Graph Drawing and Network Visualization: 23rd International Symposium, GD …, 2015	17	2015
On Rolling Cube Puzzles. K Buchin, M Buchin, ED Demaine, ML Demaine, D El-Khechen, ... CCCG, 141-144, 2007	16	2007
Drawing 3-polytopes with good vertex resolution. A Schulz Journal of Graph Algorithms and Applications 15 (1), 33-52, 2011	15	2011

系统目前无法执行此操作，请稍后再试。

文章 1–20

每年引用数

重复的引用

合并的引用

添加合著者合著作者

上传 PDF

关注此作者

引用次数

合著作者

引用