Andre Schulz

Citée par

	Toutes	Depuis 2020
Citations	924	303
indice h	18	10
indice i10	28	12

200620072008200920102011201220132014201520162017201820192020202120222023202420253 4 5 14 11 21 40 67 57 78 78 74 66 78 68 55 49 59 55 17

Accès public

Tout afficher

30 articles

1 article

disponibles

non disponibles

Sur la base des exigences liées au financement

Coauteurs

Kevin BuchinProfessor of Computer Science, Technical University DortmundAdresse e-mail validée de tu-dortmund.de
Philipp KindermannUniversität TrierAdresse e-mail validée de uni-trier.de
Wouter MeulemansEindhoven University of TechnologyAdresse e-mail validée de tue.nl
Erik DemaineProfessor of Electrical Engineering and Computer Science, Massachusetts Institute of TechnologyAdresse e-mail validée de mit.edu
Alexander WolffChair for Algorithms and Complexity, Institute of Computer Science, University of WürzburgAdresse e-mail validée de uni-wuerzburg.de
Csaba D. TothCalifornia State University NorthridgeAdresse e-mail validée de csun.edu
Maike BuchinRuhr-Universität BochumAdresse e-mail validée de rub.de
Maarten LöfflerComputer Science, Utrecht UniversityAdresse e-mail validée de cs.uu.nl
Martin DemaineMITAdresse e-mail validée de mit.edu
Adam ShefferCUNY - Baruch CollegeAdresse e-mail validée de baruch.cuny.edu
Anna LubiwProfessor, David R. Cheriton School of Computer Science, University of WaterlooAdresse e-mail validée de uwaterloo.ca
Diane SouvaineProfessor of Computer Science & Vice Provost for Research, Tufts UniversityAdresse e-mail validée de tufts.edu
Christian KnauerInstitut für Informatik, Universität BayreuthAdresse e-mail validée de uni-bayreuth.de
Andrew WinslowUnaffiliatedAdresse e-mail validée de tufts.edu
Oswin AichholzerProf. Informatik, TU Graz, Graz, AustriaAdresse e-mail validée de ist.tugraz.at
Joachim SpoerhaseDepartment of Computer Science, University of Liverpool, UKAdresse e-mail validée de liverpool.ac.uk
Ignaz RutterUniversity of PassauAdresse e-mail validée de uni-passau.de
Martin NöllenburgProfessor, Algorithms and Complexity Group, TU WienAdresse e-mail validée de ac.tuwien.ac.at
Tetsuo AsanoProfessor of School of Information Science, JAISTAdresse e-mail validée de jaist.ac.jp
Matias KormanSiemens EDAAdresse e-mail validée de mentor.com

Suivre

Andre Schulz

Professor of CS

Adresse e-mail validée de fernuni-hagen.de - Page d'accueil

Computational Geometry Graph Drawing Graph Algorithms Polytopes Information Visualization


Titre Trier par citations Trier par année Trier par titre	Citée par Citée par	Année
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	66*	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	63	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	58	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	56	2013
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	43	2010
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	42	2012
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	35*	2013
Fréchet distance of surfaces: Some simple hard cases K Buchin, M Buchin, A Schulz European Symposium on Algorithms, 63-74, 2010	33	2010
Drawing graphs with few arcs A Schulz Journal of Graph Algorithms and Applications 19 (1), 393-412, 2015	32	2015
Small grid embeddings of 3-polytopes A Ribó Mor, G Rote, A Schulz Discrete and Computational Geometry, 1-23, 2011	31*	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	26	2015
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
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	21*	2015
Embedding stacked polytopes on a polynomial-size grid ED Demaine, A Schulz Discrete & Computational Geometry 57, 782-809, 2017	19	2017
On Rolling Cube Puzzles. K Buchin, M Buchin, ED Demaine, ML Demaine, D El-Khechen, ... CCCG, 141-144, 2007	19	2007
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	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
Fine-grained analysis of problems on curves K Buchin, M Buchin, M Konzack, W Mulzer, A Schulz EuroCG, Lugano, Switzerland 3, 2016	17	2016

Le système ne peut pas réaliser cette opération maintenant. Veuillez réessayer plus tard.

Articles 1–20

Nombre de citations par an

Citations en double

Citations fusionnées

Ajouter les coauteursCoauteurs

Suivre

Citée par

Coauteurs