Andre Schulz

Cited by

	All	Since 2018
Citations	786	327
h-index	16	11
i10-index	27	14

20052006200720082009201020112012201320142015201620172018201920202021202220232 2 4 6 16 9 24 35 65 59 77 69 71 70 77 66 51 52 11

Public access

View all

25 articles

2 articles

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
Csaba D. TothCalifornia State University NorthridgeVerified email at csun.edu
Erik DemaineProfessor of Electrical Engineering and Computer Science, Massachusetts Institute of TechnologyVerified email at mit.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
Adam ShefferCUNY - Baruch CollegeVerified email at baruch.cuny.edu
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
Christian KnauerInstitut für Informatik, Universität BayreuthVerified email at uni-bayreuth.de
Joachim SpoerhaseDepartment of Computer Science, University of Sheffield, UKVerified email at sheffield.ac.uk
Ignaz RutterUniversity of PassauVerified email at uni-passau.de
Tetsuo AsanoProfessor of School of Information Science, JAISTVerified email at jaist.ac.jp
Matias KormanSiemens EDAVerified email at mentor.com
Adrian Dumitrescualgoresearch.orgVerified email at adriandumitrescu.org
Stephen KobourovProfessor of Computer Science, University of ArizonaVerified email at cs.arizona.edu
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	61*	2013
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	56	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
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	52	2012
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	43	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	35	2010
Drawing graphs with few arcs A Schulz Graph-Theoretic Concepts in Computer Science: 39th International Workshop …, 2013	32	2013
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	30*	2013
Fréchet distance of surfaces: Some simple hard cases K Buchin, M Buchin, A Schulz Algorithms–ESA 2010: 18th Annual European Symposium, Liverpool, UK …, 2010	28	2010
Small grid embeddings of 3-polytopes A Ribó Mor, G Rote, A Schulz Discrete and Computational Geometry, 1-23, 2011	27*	2011
On monotone drawings of trees P Kindermann, A Schulz, J Spoerhase, A Wolff Graph Drawing: 22nd International Symposium, GD 2014, Würzburg, Germany …, 2014	23	2014
Convexifying Polygons Without Losing Visibilities. O Aichholzer, G Aloupis, ED Demaine, ML Demaine, V Dujmovic, ... CCCG, 2011	22	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	18	2018
Embedding stacked polytopes on a polynomial-size grid ED Demaine, A Schulz Discrete & Computational Geometry 57, 782-809, 2017	17	2017
Drawing planar graphs with few geometric primitives G Hültenschmidt, P Kindermann, W Meulemans, A Schulz Graph-Theoretic Concepts in Computer Science: 43rd International Workshop …, 2017	16*	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	16	2015
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 Graph Drawing and Network Visualization: 23rd International Symposium, GD …, 2015	15	2015
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	15*	2015
Algorithms for designing pop-up cards ZR Abel, ED Demaine, ML Demaine, SC Eisenstat, A Lubiw, A Schulz, ... Schloss Dagstuhl Publishing, 2013	14	2013

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

Cited by

Co-authors