Andre Schulz

Cited by

	All	Since 2017
Citations	733	351
h-index	16	10
i10-index	26	17

20042005200620072008200920102011201220132014201520162017201820192020202120222 2 2 3 8 13 11 35 25 71 52 75 68 79 56 79 65 56 15

Public access

View all

31 articles

1 article

available

not available

Based on funding mandates

Co-authors

Kevin BuchinProfessor of Computer Science, Technical University DortmundVerified email at tu-dortmund.de
Philipp KindermannUniversität TrierVerified email at uni-trier.de
Erik DemaineProfessor of Electrical Engineering and Computer Science, Massachusetts Institute of TechnologyVerified email at mit.edu
Csaba D. TothCalifornia State University NorthridgeVerified email at csun.edu
Alexander WolffChair for Algorithms and Complexity, Institute of Computer Science, University of WürzburgVerified email at uni-wuerzburg.de
Wouter MeulemansEindhoven University of TechnologyVerified email at tue.nl
Maike BuchinRuhr-Universität BochumVerified email at rub.de
Martin DemaineMITVerified email at mit.edu
Maarten LöfflerComputer Science, Utrecht UniversityVerified email at cs.uu.nl
Anna LubiwProfessor, David R. Cheriton School of Computer Science, University of WaterlooVerified email at uwaterloo.ca
Diane SouvaineProfessor of Computer Science & Vice Provost for Research, Tufts UniversityVerified email at tufts.edu
Adam ShefferCUNY - Baruch CollegeVerified email at baruch.cuny.edu
Christian KnauerInstitut für Informatik, Universität BayreuthVerified email at uni-bayreuth.de
Andrew WinslowUnaffiliatedVerified email at google.com
Joachim SpoerhaseMax Planck Institute for Informatics, Saarbrücken, GermanyVerified email at mpi-inf.mpg.de
Tetsuo AsanoProfessor of School of Information Science, JAISTVerified email at jaist.ac.jp
Matias KormanSiemens EDAVerified email at mentor.com
Ignaz RutterUniversity of PassauVerified email at uni-passau.de
Adrian Dumitrescualgoresearch.orgVerified email at adriandumitrescu.org
Martin NöllenburgProfessor, Algorithms and Complexity Group, TU WienVerified email at ac.tuwien.ac.at

Andre Schulz

Professor of CS

Verified email at fernuni-hagen.de - Homepage

Computational Geometry Graph Drawing Graph Algorithms Polytopes Information Visualization


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
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	63*	2013
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
On the number of cycles in planar graphs K Buchin, C Knauer, K Kriegel, A Schulz, R Seidel International Computing and Combinatorics Conference, 97-107, 2007	54	2007
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	47	2012
On the number of spanning trees a planar graph can have K Buchin, A Schulz European Symposium on Algorithms, 110-121, 2010	34	2010
Drawing graphs with few arcs A Schulz International Workshop on Graph-Theoretic Concepts in Computer Science, 406-417, 2013	32	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, 2013	32	2013
Two-sided boundary labeling with adjacent sides P Kindermann, B Niedermann, I Rutter, M Schaefer, A Schulz, A Wolff Workshop on Algorithms and Data Structures, 463-474, 2013	27*	2013
Small grid embeddings of 3-polytopes A Ribó Mor, G Rote, A Schulz Discrete and Computational Geometry, 1-23, 2011	27*	2011
Fréchet distance of surfaces: Some simple hard cases K Buchin, M Buchin, A Schulz European Symposium on Algorithms, 63-74, 2010	24	2010
On monotone drawings of trees P Kindermann, A Schulz, J Spoerhase, A Wolff International Symposium on Graph Drawing, 488-500, 2014	23	2014
Convexifying Polygons Without Losing Visibilities. O Aichholzer, G Aloupis, ED Demaine, ML Demaine, V Dujmovic, ... CCCG, 2011	22	2011
Embedding stacked polytopes on a polynomial-size grid ED Demaine, A Schulz Discrete & Computational Geometry 57 (4), 782-809, 2017	17	2017
Experimental analysis of the accessibility of drawings with few segments P Kindermann, W Meulemans, A Schulz International Symposium on Graph Drawing and Network Visualization, 52-64, 2017	16	2017
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	16*	2017
Drawing 3-polytopes with good vertex resolution. A Schulz Journal of Graph Algorithms and Applications 15 (1), 33-52, 2011	16	2011
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	15	2015
Algorithms for designing pop-up cards ZR Abel, ED Demaine, ML Demaine, SC Eisenstat, A Lubiw, A Schulz, ... Schloss Dagstuhl Publishing, 2013	13	2013
Contact graphs of circular arcs M Alam, D Eppstein, M Kaufmann, SG Kobourov, S Pupyrev, A Schulz, ... Workshop on Algorithms and Data Structures, 1-13, 2015	12*	2015
Lifting planar graphs to realize integral 3-polytopes and topics in pseudo-triangulations A Schulz	12	2008

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Follow this author

Cited by

Co-authors