Andre Schulz

Citado por

	Total	Desde 2019
Citas	883	355
Índice h	17	11
Índice i10	28	18

2007200820092010201120122013201420152016201720182019202020212022202320243 7 14 10 21 39 67 55 78 72 72 65 77 67 52 45 60 53

Acceso público

Ver todo

30 artículos

1 artículo

disponibles

no disponibles

Basado en requisitos de financiación

Coautores

Kevin BuchinProfessor of Computer Science, Technical University DortmundDirección de correo verificada de tu-dortmund.de
Philipp KindermannUniversität TrierDirección de correo verificada de uni-trier.de
Wouter MeulemansEindhoven University of TechnologyDirección de correo verificada de tue.nl
Csaba D. TothCalifornia State University NorthridgeDirección de correo verificada de csun.edu
Erik DemaineProfessor of Electrical Engineering and Computer Science, Massachusetts Institute of TechnologyDirección de correo verificada de mit.edu
Alexander WolffChair for Algorithms and Complexity, Institute of Computer Science, University of WürzburgDirección de correo verificada de uni-wuerzburg.de
Maike BuchinRuhr-Universität BochumDirección de correo verificada de rub.de
Maarten LöfflerComputer Science, Utrecht UniversityDirección de correo verificada de cs.uu.nl
Martin DemaineMITDirección de correo verificada de mit.edu
Adam ShefferCUNY - Baruch CollegeDirección de correo verificada de baruch.cuny.edu
Anna LubiwProfessor, David R. Cheriton School of Computer Science, University of WaterlooDirección de correo verificada de uwaterloo.ca
Diane SouvaineProfessor of Computer Science & Vice Provost for Research, Tufts UniversityDirección de correo verificada de tufts.edu
Christian KnauerInstitut für Informatik, Universität BayreuthDirección de correo verificada de uni-bayreuth.de
Andrew WinslowUnaffiliatedDirección de correo verificada de tufts.edu
Oswin AichholzerProf. Informatik, TU Graz, Graz, AustriaDirección de correo verificada de ist.tugraz.at
Joachim SpoerhaseDepartment of Computer Science, University of Liverpool, UKDirección de correo verificada de liverpool.ac.uk
Ignaz RutterUniversity of PassauDirección de correo verificada de uni-passau.de
Martin NöllenburgProfessor, Algorithms and Complexity Group, TU WienDirección de correo verificada de ac.tuwien.ac.at
Tetsuo AsanoProfessor of School of Information Science, JAISTDirección de correo verificada de jaist.ac.jp
Matias KormanSiemens EDADirección de correo verificada de mentor.com

Seguir

Andre Schulz

Professor of CS

Dirección de correo verificada de fernuni-hagen.de - Página principal

Computational Geometry Graph Drawing Graph Algorithms Polytopes Information Visualization


Título Ordenar por citas Ordenar por año Ordenar por título	Citado por Citado por	Año
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	65*	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	61	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	55	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	42	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	41	2012
Drawing graphs with few arcs A Schulz Journal of Graph Algorithms and Applications 19 (1), 393-412, 2015	32	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	32*	2013
Fréchet distance of surfaces: Some simple hard cases K Buchin, M Buchin, A Schulz European Symposium on Algorithms, 63-74, 2010	32	2010
Small grid embeddings of 3-polytopes A Ribó Mor, G Rote, A Schulz Discrete and Computational Geometry, 1-23, 2011	31*	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	26	2014
Convexifying Polygons Without Losing Visibilities. O Aichholzer, G Aloupis, ED Demaine, ML Demaine, V Dujmovic, ... CCCG, 229-234, 2011	24	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	23	2015
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	20*	2015
Embedding stacked polytopes on a polynomial-size grid ED Demaine, A Schulz Discrete & Computational Geometry 57, 782-809, 2017	18	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	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
Saturated simple and 2-simple topological graphs with few edges P Hajnal, A Igamberdiev, G Rote, A Schulz Graph-Theoretic Concepts in Computer Science: 41st International Workshop …, 2016	16	2016
Drawing 3-polytopes with good vertex resolution. A Schulz Journal of Graph Algorithms and Applications 15 (1), 33-52, 2011	16	2011

El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.

Artículos 1–20

Citas por año

Citas duplicadas

Citas combinadas

Añadir coautoresCoautores

Seguir

Citado por

Coautores