André Schulz

Publication Activity (10 Years)

Years Active: 2005-2024
Publications (10 Years): 46

Top Topics

Geometric Primitives

Concentric Circles

Simply Connected

Top Venues

J. Graph Algorithms Appl.

Publications

Elena Arseneva, Linda Kleist, Boris Klemz, Maarten Löffler, André Schulz, Birgit Vogtenhuber, Alexander Wolff
Adjacency Graphs of Polyhedral Surfaces. Discret. Comput. Geom. 71 (4) (2024)
André Schulz
Side-Contact Representations with Convex Polygons in 3D: New Results for Complete Bipartite Graphs. GD (1) (2023)
André Schulz
Side-Contact Representations with Convex Polygons in 3D: New Results for Complete Bipartite Graphs. CoRR (2023)
Rahul Jain, Marco Ricci, Jonathan Rollin, André Schulz
On the Geometric Thickness of 2-Degenerate Graphs. SoCG (2023)
Daniel Reimann, André Schulz, Nilam Ram, Robert Gaschler
Color-Encoded Links Improve Homophily Perception in Node-Link Diagrams. IEEE Trans. Vis. Comput. Graph. 29 (12) (2023)
Rahul Jain, Marco Ricci, Jonathan Rollin, André Schulz
On the geometric thickness of 2-degenerate graphs. CoRR (2023)
Sarah Carmesin, André Schulz
Arrangements of orthogonal circles with many intersections. J. Graph Algorithms Appl. 27 (2) (2023)
Michael A. Bekos, D. J. C. Dekker, F. Frank, Wouter Meulemans, Peter J. Rodgers, André Schulz, S. Wessel
Computing Schematic Layouts for Spatial Hypergraphs on Concentric Circles and Grids. Comput. Graph. Forum 41 (6) (2022)
Philipp Kindermann, Fabrizio Montecchiani, Lena Schlipf, André Schulz
Drawing Subcubic 1-Planar Graphs with Few Bends, Few Slopes, and Large Angles. J. Graph Algorithms Appl. 25 (1) (2021)
Sarah Carmesin, André Schulz
Arrangements of orthogonal circles with many intersections. CoRR (2021)
Elena Arseneva, Linda Kleist, Boris Klemz, Maarten Löffler, André Schulz, Birgit Vogtenhuber, Alexander Wolff
Adjacency Graphs of Polyhedral Surfaces. SoCG (2021)
Sarah Carmesin, André Schulz
Arrangements of Orthogonal Circles with Many Intersections. Graph Drawing (2021)
Elena Arseneva, Linda Kleist, Boris Klemz, Maarten Löffler, André Schulz, Birgit Vogtenhuber, Alexander Wolff
Adjacency Graphs of Polyhedral Surfaces. CoRR (2021)
Alexander Pilz, Jonathan Rollin, Lena Schlipf, André Schulz
Augmenting Geometric Graphs with Matchings. CoRR (2020)
Alexander Pilz, Jonathan Rollin, Lena Schlipf, André Schulz
Augmenting Geometric Graphs with Matchings. Graph Drawing (2020)
Philipp Kindermann, Stephen G. Kobourov, Maarten Löffler, Martin Nöllenburg, André Schulz, Birgit Vogtenhuber
Lombardi drawings of knots and links. J. Comput. Geom. 10 (1) (2019)
Jonathan Rollin, Lena Schlipf, André Schulz
Recognizing Planar Laman Graphs. ESA (2019)
Péter Hajnal, Alexander Igamberdiev, Günter Rote, André Schulz
Saturated simple and 2-simple topological graphs with few edges. J. Graph Algorithms Appl. 22 (1) (2018)
Gregor Hültenschmidt, Philipp Kindermann, Wouter Meulemans, André Schulz
Drawing Planar Graphs with Few Geometric Primitives. J. Graph Algorithms Appl. 22 (2) (2018)
Philipp Kindermann, Fabrizio Montecchiani, Lena Schlipf, André Schulz
Drawing Subcubic 1-Planar Graphs with Few Bends, Few Slopes, and Large Angles. Graph Drawing (2018)
Philipp Kindermann, Fabrizio Montecchiani, Lena Schlipf, André Schulz
Drawing Subcubic 1-Planar Graphs with Few Bends, Few Slopes, and Large Angles. CoRR (2018)
Philipp Kindermann, Boris Klemz, Ignaz Rutter, Patrick Schnider, André Schulz
The Partition Spanning Forest Problem. CoRR (2018)
Philipp Kindermann, Wouter Meulemans, André Schulz
Experimental Analysis of the Accessibility of Drawings with Few Segments. J. Graph Algorithms Appl. 22 (3) (2018)
Philipp Kindermann, Stephen G. Kobourov, Maarten Löffler, Martin Nöllenburg, André Schulz, Birgit Vogtenhuber
Lombardi Drawings of Knots and Links. CoRR (2017)
Erik D. Demaine, André Schulz
Embedding Stacked Polytopes on a Polynomial-Size Grid. Discret. Comput. Geom. 57 (4) (2017)
Philipp Kindermann, Wouter Meulemans, André Schulz
Experimental Analysis of the Accessibility of Drawings with Few Segments. Graph Drawing (2017)
Philipp Kindermann, Stephen G. Kobourov, Maarten Löffler, Martin Nöllenburg, André Schulz, Birgit Vogtenhuber
Lombardi Drawings of Knots and Links. Graph Drawing (2017)
Philipp Kindermann, Lena Schlipf, André Schulz
On Gallai's conjecture for series-parallel graphs and planar 3-trees. CoRR (2017)
Gregor Hültenschmidt, Philipp Kindermann, Wouter Meulemans, André Schulz
Drawing Planar Graphs with Few Geometric Primitives. WG (2017)
Gregor Hültenschmidt, Philipp Kindermann, Wouter Meulemans, André Schulz
Drawing Planar Graphs with Few Geometric Primitives. CoRR (2017)
Alexander Igamberdiev, Wouter Meulemans, André Schulz
Drawing Planar Cubic 3-Connected Graphs with Few Segments: Algorithms & Experiments. J. Graph Algorithms Appl. 21 (4) (2017)
Philipp Kindermann, Wouter Meulemans, André Schulz
Experimental analysis of the accessibility of drawings with few segments. CoRR (2017)
Adrian Dumitrescu, Maarten Löffler, André Schulz, Csaba D. Tóth
Counting Carambolas. Graphs Comb. 32 (3) (2016)
Philipp Kindermann, Benjamin Niedermann, Ignaz Rutter, Marcus Schaefer, André Schulz, Alexander Wolff
Multi-sided Boundary Labeling. Algorithmica 76 (1) (2016)
Alexander Igamberdiev, André Schulz
A duality transform for constructing small grid embeddings of 3d polytopes. Comput. Geom. 56 (2016)
André Schulz
Drawing Graphs with Few Arcs. J. Graph Algorithms Appl. 19 (1) (2015)
Péter Hajnal, Alexander Igamberdiev, Günter Rote, André Schulz
Saturated Simple and 2-simple Topological Graphs with Few Edges. WG (2015)
Clinton Bowen, Stephane Durocher, Maarten Löffler, Anika Rounds, André Schulz, Csaba D. Tóth
Realization of Simply Connected Polygonal Linkages and Recognition of Unit Disk Contact Trees. Graph Drawing (2015)
Irina Kostitsyna, Martin Nöllenburg, Valentin Polishchuk, André Schulz, Darren Strash
On Minimizing Crossings in Storyline Visualizations. Graph Drawing (2015)
Péter Hajnal, Alexander Igamberdiev, Günter Rote, André Schulz
Saturated simple and 2-simple topological graphs with few edges. CoRR (2015)
Md. Jawaherul Alam, David Eppstein, Michael Kaufmann, Stephen G. Kobourov, Sergey Pupyrev, André Schulz, Torsten Ueckerdt
Contact Graphs of Circular Arcs. WADS (2015)
Alexander Igamberdiev, Wouter Meulemans, André Schulz
Drawing Planar Cubic 3-Connected Graphs with Few Segments: Algorithms and Experiments. Graph Drawing (2015)
Wouter Meulemans, André Schulz
A Tale of Two Communities: Assessing Homophily in Node-Link Diagrams. Graph Drawing (2015)
Philipp Kindermann, André Schulz, Joachim Spoerhase, Alexander Wolff
On Monotone Drawings of Trees. CoRR (2015)
Md. Jawaherul Alam, David Eppstein, Michael Kaufmann, Stephen G. Kobourov, Sergey Pupyrev, André Schulz, Torsten Ueckerdt
Contact Representations of Sparse Planar Graphs. CoRR (2015)
Irina Kostitsyna, Martin Nöllenburg, Valentin Polishchuk, André Schulz, Darren Strash
On Minimizing Crossings in Storyline Visualizations. CoRR (2015)
Alexander Igamberdiev, André Schulz
A Duality Transform for Constructing Small Grid Embeddings of 3d Polytopes. CoRR (2014)
Erik D. Demaine, André Schulz
Embedding Stacked Polytopes on a Polynomial-Size Grid. CoRR (2014)
Adrian Dumitrescu, Maarten Löffler, André Schulz, Csaba D. Tóth
Counting Carambolas. CoRR (2014)
Tetsuo Asano, Kevin Buchin, Maike Buchin, Matias Korman, Wolfgang Mulzer, Günter Rote, André Schulz
Reprint of: Memory-constrained algorithms for simple polygons. Comput. Geom. 47 (3) (2014)
Philipp Kindermann, André Schulz, Joachim Spoerhase, Alexander Wolff
On Monotone Drawings of Trees. Graph Drawing (2014)
Philipp Kindermann, Benjamin Niedermann, Ignaz Rutter, Marcus Schaefer, André Schulz, Alexander Wolff
Two-Sided Boundary Labeling with Adjacent Sides. WADS (2013)
Tetsuo Asano, Kevin Buchin, Maike Buchin, Matias Korman, Wolfgang Mulzer, Günter Rote, André Schulz
Memory-constrained algorithms for simple polygons. Comput. Geom. 46 (8) (2013)
Moria Ben-Ner, André Schulz, Adam Sheffer
On numbers of pseudo-triangulations. Comput. Geom. 46 (6) (2013)
Maarten Löffler, André Schulz, Csaba D. Tóth
Counting Carambolas. CCCG (2013)
Philipp Kindermann, Benjamin Niedermann, Ignaz Rutter, Marcus Schaefer, André Schulz, Alexander Wolff
Multi-Sided Boundary Labeling CoRR (2013)
André Schulz
Drawing Graphs with Few Arcs. WG (2013)
Zachary Abel, Erik D. Demaine, Martin L. Demaine, Sarah Eisenstat, Anna Lubiw, André Schulz, Diane L. Souvaine, Giovanni Viglietta, Andrew Winslow
Algorithms for Designing Pop-Up Cards. STACS (2013)
Oswin Aichholzer, Thomas Hackl, David Orden, Pedro Ramos, Günter Rote, André Schulz, Bettina Speckmann
Flip Graphs of Bounded Degree Triangulations. Graphs Comb. 29 (6) (2013)
Alexander Igamberdiev, André Schulz
A Duality Transform for Constructing Small Grid Embeddings of 3D Polytopes. Graph Drawing (2013)
André Schulz, Csaba D. Tóth
The union of colorful simplices spanned by a colored point set. Comput. Geom. 46 (5) (2013)
Adrian Dumitrescu, André Schulz, Adam Sheffer, Csaba D. Tóth
Bounds on the Maximum Multiplicity of Some Common Geometric Graphs. SIAM J. Discret. Math. 27 (2) (2013)
Gill Barequet, Nadia M. Benbernou, David Charlton, Erik D. Demaine, Martin L. Demaine, Mashhood Ishaque, Anna Lubiw, André Schulz, Diane L. Souvaine, Godfried T. Toussaint, Andrew Winslow
Bounded-degree polyhedronization of point sets. Comput. Geom. 46 (2) (2013)
Martin Fink, Jan-Henrik Haunert, André Schulz, Joachim Spoerhase, Alexander Wolff
Algorithms for Labeling Focus Regions. IEEE Trans. Vis. Comput. Graph. 18 (12) (2012)
Moria Ben-Ner, André Schulz, Adam Sheffer
On Numbers of Pseudo-Triangulations CoRR (2012)
Oswin Aichholzer, Günter Rote, André Schulz, Birgit Vogtenhuber
Pointed drawings of planar graphs. Comput. Geom. 45 (9) (2012)
Immanuel Halupczok, André Schulz
Pinning balloons with perfect angles and optimal area. J. Graph Algorithms Appl. 16 (4) (2012)
André Schulz
Drawing 3-Polytopes with Good Vertex Resolution. J. Graph Algorithms Appl. 15 (1) (2011)
Immanuel Halupczok, André Schulz
Pinning Balloons with Perfect Angles and Optimal Area. Graph Drawing (2011)
Immanuel Halupczok, André Schulz
Pinning Balloons with Perfect Angles and Optimal Area CoRR (2011)
Oswin Aichholzer, Greg Aloupis, Erik D. Demaine, Martin L. Demaine, Vida Dujmovic, Ferran Hurtado, Anna Lubiw, Günter Rote, André Schulz, Diane L. Souvaine, Andrew Winslow
Convexifying Polygons Without Losing Visibilities. CCCG (2011)
Erik D. Demaine, André Schulz
Embedding Stacked Polytopes on a Polynomial-Size Grid. SODA (2011)
Tetsuo Asano, Kevin Buchin, Maike Buchin, Matias Korman, Wolfgang Mulzer, Günter Rote, André Schulz
Memory-Constrained Algorithms for Simple Polygons CoRR (2011)
Ares Ribó Mor, Günter Rote, André Schulz
Small Grid Embeddings of 3-Polytopes. Discret. Comput. Geom. 45 (1) (2011)
Adrian Dumitrescu, André Schulz, Adam Sheffer, Csaba D. Tóth
Bounds on the maximum multiplicity of some common geometric graphs. STACS (2011)
André Schulz, Csaba D. Tóth
The Union of Colorful Simplices Spanned by a Colored Point Set. COCOA (1) (2010)
Adrian Dumitrescu, André Schulz, Adam Sheffer, Csaba D. Tóth
Bounds on the maximum multiplicity of some common geometric graphs CoRR (2010)
Kevin Buchin, Maike Buchin, André Schulz
Fréchet Distance of Surfaces: Some Simple Hard Cases. ESA (2) (2010)
Kevin Buchin, André Schulz
On the Number of Spanning Trees a Planar Graph Can Have. ESA (1) (2010)
Gill Barequet, Nadia M. Benbernou, David Charlton, Erik D. Demaine, Martin L. Demaine, Mashhood Ishaque, Anna Lubiw, André Schulz, Diane L. Souvaine, Godfried T. Toussaint, Andrew Winslow
Bounded-degree polyhedronization of point sets. CCCG (2010)
Ares Ribó Mor, Günter Rote, André Schulz
Small grid embeddings of 3-polytopes CoRR (2009)
André Schulz
Drawing 3-Polytopes with Good Vertex Resolution. Graph Drawing (2009)
Günter Rote, André Schulz
Resolving Loads with Positive Interior Stresses. WADS (2009)
Oswin Aichholzer, Thomas Hackl, David Orden, Pedro Ramos, Günter Rote, André Schulz, Bettina Speckmann
Flip Graphs of Bounded-Degree Triangulations. Electron. Notes Discret. Math. 34 (2009)
Kevin Buchin, Maike Buchin, Erik D. Demaine, Martin L. Demaine, Dania El-Khechen, Sándor P. Fekete, Christian Knauer, André Schulz, Perouz Taslakian
On Rolling Cube Puzzles. CCCG (2007)
Oswin Aichholzer, Günter Rote, André Schulz, Birgit Vogtenhuber
Pointed Drawings of Planar Graphs. CCCG (2007)
Kevin Buchin, Christian Knauer, Klaus Kriegel, André Schulz, Raimund Seidel
On the Number of Cycles in Planar Graphs. COCOON (2007)
Kevin Buchin, André Schulz
Inflating the cube by shrinking. SCG (2007)
Ares Ribó Mor, Günter Rote, André Schulz
Embedding 3-polytopes on a small grid. SCG (2007)
Günter Rote, André Schulz
Threshold arrangements and the knapsack problem. Appl. Math. Lett. 19 (1) (2006)
Günter Rote, André Schulz
A pointed Delaunay pseudo-triangulation of a simple polygon. EuroCG (2005)
André Schulz
New results on Pseudo-triangulations with low vertex degree. CCCG (2005)