Seuraa
Andre Schulz
Andre Schulz
Professor of CS
Vahvistettu sähköpostiosoite verkkotunnuksessa fernuni-hagen.de - Kotisivu
Nimike
Viittaukset
Viittaukset
Vuosi
A polarized fast radio burst at low Galactic latitude
E Petroff, S Burke-Spolaor, EF Keane, MA McLaughlin, R Miller, ...
Monthly Notices of the Royal Astronomical Society 469 (4), 4465-4482, 2017
1092017
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
62*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
572012
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
562007
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
542013
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
432012
Drawing graphs with few arcs
A Schulz
International Workshop on Graph-Theoretic Concepts in Computer Science, 406-417, 2013
362013
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
342010
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
European Symposium on Algorithms, 63-74, 2010
292010
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
242014
Convexifying Polygons Without Losing Visibilities.
O Aichholzer, G Aloupis, ED Demaine, ML Demaine, V Dujmovic, ...
CCCG, 2011
222011
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
202018
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
18*2017
Embedding stacked polytopes on a polynomial-size grid
ED Demaine, A Schulz
Discrete & Computational Geometry 57, 782-809, 2017
172017
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
17*2015
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
152015
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
152015
Drawing 3-polytopes with good vertex resolution.
A Schulz
Journal of Graph Algorithms and Applications 15 (1), 33-52, 2011
152011
Järjestelmä ei voi suorittaa toimenpidettä nyt. Yritä myöhemmin uudelleen.
Artikkelit 1–20