Andre Schulz
Andre Schulz
Professor of CS
Verified email at - Homepage
Cited by
Cited by
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
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
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
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
On the number of spanning trees a planar graph can have
K Buchin, A Schulz
European Symposium on Algorithms, 110-121, 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, 2013
Drawing graphs with few arcs
A Schulz
International Workshop on Graph-Theoretic Concepts in Computer Science, 406-417, 2013
Small grid embeddings of 3-polytopes
A Ribó Mor, G Rote, A Schulz
Discrete and Computational Geometry, 1-23, 2011
Fréchet distance of surfaces: Some simple hard cases
K Buchin, M Buchin, A Schulz
European Symposium on Algorithms, 63-74, 2010
On monotone drawings of trees
P Kindermann, A Schulz, J Spoerhase, A Wolff
International Symposium on Graph Drawing, 488-500, 2014
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
Convexifying Polygons Without Losing Visibilities.
O Aichholzer, G Aloupis, ED Demaine, ML Demaine, V Dujmovic, ...
CCCG, 2011
Embedding stacked polytopes on a polynomial-size grid
ED Demaine, A Schulz
Discrete & Computational Geometry 57 (4), 782-809, 2017
Drawing 3-polytopes with good vertex resolution.
A Schulz
Journal of Graph Algorithms and Applications 15 (1), 33-52, 2011
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
Contact Graphs of Circular Arcs
SG Kobourov, S Pupyrev, A Schulz, T Ueckerdt
Algorithms and Data Structures: 14th International Symposium, WADS 2015 …, 2015
Algorithms for designing pop-up cards
ZR Abel, ED Demaine, ML Demaine, SC Eisenstat, A Lubiw, A Schulz, ...
Schloss Dagstuhl Publishing, 2013
Lifting planar graphs to realize integral 3-polytopes and topics in pseudo-triangulations
A Schulz
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
On Rolling Cube Puzzles.
K Buchin, M Buchin, ED Demaine, ML Demaine, D El-Khechen, ...
CCCG, 141-144, 2007
The system can't perform the operation now. Try again later.
Articles 1–20