default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAndré Schulz 0001
Person information
- affiliation: FernUniversität in Hagen, LG Theoretische Informatik, Germany
- affiliation: University of Münster, Institute of Mathematical Logic and Fundamental Research, Germany
- affiliation: FU Berlin, Institute of Computer Science, Germany
Other persons with the same name
- André Schulz 0002 — University of Paderborn, Germany
- André Schulz 0003 — KIT Karlsruhe, Germany
- André Schulz 0004 — TU Darmstadt, Germany
- André Schulz 0005 — FH Erfurt, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j29]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): 1429-1455 (2024)- [i26]Mikkel Abrahamsen, Kevin Buchin, Maike Buchin, Linda Kleist, Maarten Löffler, Lena Schlipf, André Schulz, Jack Stade:
Reconfiguration of unit squares and disks: PSPACE-hardness in simple settings. CoRR abs/2412.21017 (2024) - 2023
- [j28]Sarah Carmesin, André Schulz:
Arrangements of orthogonal circles with many intersections. J. Graph Algorithms Appl. 27(2): 49-70 (2023) - [j27]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): 5593-5598 (2023) - [c38]Rahul Jain, Marco Ricci, Jonathan Rollin, André Schulz:
On the Geometric Thickness of 2-Degenerate Graphs. SoCG 2023: 44:1-44:15 - [c37]André Schulz:
Side-Contact Representations with Convex Polygons in 3D: New Results for Complete Bipartite Graphs. GD (1) 2023: 296-303 - [i25]Rahul Jain, Marco Ricci, Jonathan Rollin, André Schulz:
On the geometric thickness of 2-degenerate graphs. CoRR abs/2302.14721 (2023) - [i24]André Schulz:
Side-Contact Representations with Convex Polygons in 3D: New Results for Complete Bipartite Graphs. CoRR abs/2308.00380 (2023) - 2022
- [j26]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): 316-335 (2022) - 2021
- [j25]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): 1-28 (2021) - [c36]Elena Arseneva, Linda Kleist, Boris Klemz, Maarten Löffler, André Schulz, Birgit Vogtenhuber, Alexander Wolff:
Adjacency Graphs of Polyhedral Surfaces. SoCG 2021: 11:1-11:17 - [c35]Sarah Carmesin, André Schulz:
Arrangements of Orthogonal Circles with Many Intersections. GD 2021: 329-342 - [i23]Elena Arseneva, Linda Kleist, Boris Klemz, Maarten Löffler, André Schulz, Birgit Vogtenhuber, Alexander Wolff:
Adjacency Graphs of Polyhedral Surfaces. CoRR abs/2103.09803 (2021) - [i22]Sarah Carmesin, André Schulz:
Arrangements of orthogonal circles with many intersections. CoRR abs/2106.03557 (2021) - 2020
- [c34]Alexander Pilz, Jonathan Rollin, Lena Schlipf, André Schulz:
Augmenting Geometric Graphs with Matchings. GD 2020: 490-504 - [i21]Alexander Pilz, Jonathan Rollin, Lena Schlipf, André Schulz:
Augmenting Geometric Graphs with Matchings. CoRR abs/2008.08413 (2020)
2010 – 2019
- 2019
- [j24]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): 444-476 (2019) - [c33]Jonathan Rollin, Lena Schlipf, André Schulz:
Recognizing Planar Laman Graphs. ESA 2019: 79:1-79:12 - 2018
- [j23]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): 117-138 (2018) - [j22]Gregor Hültenschmidt, Philipp Kindermann, Wouter Meulemans, André Schulz:
Drawing Planar Graphs with Few Geometric Primitives. J. Graph Algorithms Appl. 22(2): 357-387 (2018) - [j21]Philipp Kindermann, Wouter Meulemans, André Schulz:
Experimental Analysis of the Accessibility of Drawings with Few Segments. J. Graph Algorithms Appl. 22(3): 501-518 (2018) - [c32]Philipp Kindermann, Fabrizio Montecchiani, Lena Schlipf, André Schulz:
Drawing Subcubic 1-Planar Graphs with Few Bends, Few Slopes, and Large Angles. GD 2018: 152-166 - [i20]Philipp Kindermann, Fabrizio Montecchiani, Lena Schlipf, André Schulz:
Drawing Subcubic 1-Planar Graphs with Few Bends, Few Slopes, and Large Angles. CoRR abs/1808.08496 (2018) - [i19]Philipp Kindermann, Boris Klemz, Ignaz Rutter, Patrick Schnider, André Schulz:
The Partition Spanning Forest Problem. CoRR abs/1809.02710 (2018) - 2017
- [j20]Erik D. Demaine, André Schulz:
Embedding Stacked Polytopes on a Polynomial-Size Grid. Discret. Comput. Geom. 57(4): 782-809 (2017) - [j19]Alexander Igamberdiev, Wouter Meulemans, André Schulz:
Drawing Planar Cubic 3-Connected Graphs with Few Segments: Algorithms & Experiments. J. Graph Algorithms Appl. 21(4): 561-588 (2017) - [c31]Philipp Kindermann, Wouter Meulemans, André Schulz:
Experimental Analysis of the Accessibility of Drawings with Few Segments. GD 2017: 52-64 - [c30]Philipp Kindermann, Stephen G. Kobourov, Maarten Löffler, Martin Nöllenburg, André Schulz, Birgit Vogtenhuber:
Lombardi Drawings of Knots and Links. GD 2017: 113-126 - [c29]Gregor Hültenschmidt, Philipp Kindermann, Wouter Meulemans, André Schulz:
Drawing Planar Graphs with Few Geometric Primitives. WG 2017: 316-329 - [i18]Gregor Hültenschmidt, Philipp Kindermann, Wouter Meulemans, André Schulz:
Drawing Planar Graphs with Few Geometric Primitives. CoRR abs/1703.01691 (2017) - [i17]Philipp Kindermann, Lena Schlipf, André Schulz:
On Gallai's conjecture for series-parallel graphs and planar 3-trees. CoRR abs/1706.04130 (2017) - [i16]Philipp Kindermann, Wouter Meulemans, André Schulz:
Experimental analysis of the accessibility of drawings with few segments. CoRR abs/1708.09815 (2017) - [i15]Philipp Kindermann, Stephen G. Kobourov, Maarten Löffler, Martin Nöllenburg, André Schulz, Birgit Vogtenhuber:
Lombardi Drawings of Knots and Links. CoRR abs/1708.09819 (2017) - 2016
- [j18]Philipp Kindermann, Benjamin Niedermann, Ignaz Rutter, Marcus Schaefer, André Schulz, Alexander Wolff:
Multi-sided Boundary Labeling. Algorithmica 76(1): 225-258 (2016) - [j17]Alexander Igamberdiev, André Schulz:
A duality transform for constructing small grid embeddings of 3d polytopes. Comput. Geom. 56: 19-36 (2016) - [j16]Adrian Dumitrescu, Maarten Löffler, André Schulz, Csaba D. Tóth:
Counting Carambolas. Graphs Comb. 32(3): 923-942 (2016) - 2015
- [j15]André Schulz:
Drawing Graphs with Few Arcs. J. Graph Algorithms Appl. 19(1): 393-412 (2015) - [c28]Alexander Igamberdiev, Wouter Meulemans, André Schulz:
Drawing Planar Cubic 3-Connected Graphs with Few Segments: Algorithms and Experiments. GD 2015: 113-124 - [c27]Irina Kostitsyna, Martin Nöllenburg, Valentin Polishchuk, André Schulz, Darren Strash:
On Minimizing Crossings in Storyline Visualizations. GD 2015: 192-198 - [c26]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. GD 2015: 447-459 - [c25]Wouter Meulemans, André Schulz:
A Tale of Two Communities: Assessing Homophily in Node-Link Diagrams. GD 2015: 489-501 - [c24]Md. Jawaherul Alam, David Eppstein, Michael Kaufmann, Stephen G. Kobourov, Sergey Pupyrev, André Schulz, Torsten Ueckerdt:
Contact Graphs of Circular Arcs. WADS 2015: 1-13 - [c23]Péter Hajnal, Alexander Igamberdiev, Günter Rote, André Schulz:
Saturated Simple and 2-simple Topological Graphs with Few Edges. WG 2015: 391-405 - [i14]Md. Jawaherul Alam, David Eppstein, Michael Kaufmann, Stephen G. Kobourov, Sergey Pupyrev, André Schulz, Torsten Ueckerdt:
Contact Representations of Sparse Planar Graphs. CoRR abs/1501.00318 (2015) - [i13]Péter Hajnal, Alexander Igamberdiev, Günter Rote, André Schulz:
Saturated simple and 2-simple topological graphs with few edges. CoRR abs/1503.01386 (2015) - [i12]Philipp Kindermann, André Schulz, Joachim Spoerhase, Alexander Wolff:
On Monotone Drawings of Trees. CoRR abs/1505.01410 (2015) - [i11]Irina Kostitsyna, Martin Nöllenburg, Valentin Polishchuk, André Schulz, Darren Strash:
On Minimizing Crossings in Storyline Visualizations. CoRR abs/1509.00442 (2015) - 2014
- [j14]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): 469-479 (2014) - [c22]Philipp Kindermann, André Schulz, Joachim Spoerhase, Alexander Wolff:
On Monotone Drawings of Trees. GD 2014: 488-500 - [i10]Alexander Igamberdiev, André Schulz:
A Duality Transform for Constructing Small Grid Embeddings of 3d Polytopes. CoRR abs/1402.1660 (2014) - [i9]Erik D. Demaine, André Schulz:
Embedding Stacked Polytopes on a Polynomial-Size Grid. CoRR abs/1403.7980 (2014) - [i8]Adrian Dumitrescu, Maarten Löffler, André Schulz, Csaba D. Tóth:
Counting Carambolas. CoRR abs/1410.1579 (2014) - 2013
- [j13]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): 148-153 (2013) - [j12]André Schulz, Csaba D. Tóth:
The union of colorful simplices spanned by a colored point set. Comput. Geom. 46(5): 574-590 (2013) - [j11]Moria Ben-Ner, André Schulz, Adam Sheffer:
On numbers of pseudo-triangulations. Comput. Geom. 46(6): 688-699 (2013) - [j10]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): 959-969 (2013) - [j9]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): 1577-1593 (2013) - [j8]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): 802-826 (2013) - [c21]Maarten Löffler, André Schulz, Csaba D. Tóth:
Counting Carambolas. CCCG 2013 - [c20]Alexander Igamberdiev, André Schulz:
A Duality Transform for Constructing Small Grid Embeddings of 3D Polytopes. GD 2013: 173-184 - [c19]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: 269-280 - [c18]Philipp Kindermann, Benjamin Niedermann, Ignaz Rutter, Marcus Schaefer, André Schulz, Alexander Wolff:
Two-Sided Boundary Labeling with Adjacent Sides. WADS 2013: 463-474 - [c17]André Schulz:
Drawing Graphs with Few Arcs. WG 2013: 406-417 - [i7]Philipp Kindermann, Benjamin Niedermann, Ignaz Rutter, Marcus Schaefer, André Schulz, Alexander Wolff:
Multi-Sided Boundary Labeling. CoRR abs/1305.0750 (2013) - 2012
- [j7]Oswin Aichholzer, Günter Rote, André Schulz, Birgit Vogtenhuber:
Pointed drawings of planar graphs. Comput. Geom. 45(9): 482-494 (2012) - [j6]Immanuel Halupczok, André Schulz:
Pinning balloons with perfect angles and optimal area. J. Graph Algorithms Appl. 16(4): 847-870 (2012) - [j5]Martin Fink, Jan-Henrik Haunert, André Schulz, Joachim Spoerhase, Alexander Wolff:
Algorithms for Labeling Focus Regions. IEEE Trans. Vis. Comput. Graph. 18(12): 2583-2592 (2012) - [i6]Moria Ben-Ner, André Schulz, Adam Sheffer:
On Numbers of Pseudo-Triangulations. CoRR abs/1210.7126 (2012) - 2011
- [j4]Ares Ribó Mor, Günter Rote, André Schulz:
Small Grid Embeddings of 3-Polytopes. Discret. Comput. Geom. 45(1): 65-87 (2011) - [j3]André Schulz:
Drawing 3-Polytopes with Good Vertex Resolution. J. Graph Algorithms Appl. 15(1): 33-52 (2011) - [c16]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 - [c15]Immanuel Halupczok, André Schulz:
Pinning Balloons with Perfect Angles and Optimal Area. GD 2011: 154-165 - [c14]Erik D. Demaine, André Schulz:
Embedding Stacked Polytopes on a Polynomial-Size Grid. SODA 2011: 1177-1187 - [c13]Adrian Dumitrescu, André Schulz, Adam Sheffer, Csaba D. Tóth:
Bounds on the maximum multiplicity of some common geometric graphs. STACS 2011: 637-648 - [i5]Immanuel Halupczok, André Schulz:
Pinning Balloons with Perfect Angles and Optimal Area. CoRR abs/1109.1705 (2011) - [i4]Tetsuo Asano, Kevin Buchin, Maike Buchin, Matias Korman, Wolfgang Mulzer, Günter Rote, André Schulz:
Memory-Constrained Algorithms for Simple Polygons. CoRR abs/1112.5904 (2011) - 2010
- [c12]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: 99-102 - [c11]André Schulz, Csaba D. Tóth:
The Union of Colorful Simplices Spanned by a Colored Point Set. COCOA (1) 2010: 324-338 - [c10]Kevin Buchin, Maike Buchin, André Schulz:
Fréchet Distance of Surfaces: Some Simple Hard Cases. ESA (2) 2010: 63-74 - [c9]Kevin Buchin, André Schulz:
On the Number of Spanning Trees a Planar Graph Can Have. ESA (1) 2010: 110-121 - [i3]Adrian Dumitrescu, André Schulz, Adam Sheffer, Csaba D. Tóth:
Bounds on the maximum multiplicity of some common geometric graphs. CoRR abs/1012.5664 (2010)
2000 – 2009
- 2009
- [j2]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: 509-513 (2009) - [c8]André Schulz:
Drawing 3-Polytopes with Good Vertex Resolution. GD 2009: 33-44 - [c7]Günter Rote, André Schulz:
Resolving Loads with Positive Interior Stresses. WADS 2009: 530-541 - [i2]Ares Ribó Mor, Günter Rote, André Schulz:
Small grid embeddings of 3-polytopes. CoRR abs/0908.0488 (2009) - 2008
- [b1]André Schulz:
Lifting planar graphs to realize integral 3-polytopes and topics in pseudo- triangulations (Heben von planaren Graphen zur ganzzahligen Einbettung von 3-Polytopen und Themen über Pseudo-Triangulierungen). FU Berlin, Germany, 2008 - 2007
- [c6]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: 141-144 - [c5]Oswin Aichholzer, Günter Rote, André Schulz, Birgit Vogtenhuber:
Pointed Drawings of Planar Graphs. CCCG 2007: 237-240 - [c4]Kevin Buchin, Christian Knauer, Klaus Kriegel, André Schulz, Raimund Seidel:
On the Number of Cycles in Planar Graphs. COCOON 2007: 97-107 - [c3]Ares Ribó Mor, Günter Rote, André Schulz:
Embedding 3-polytopes on a small grid. SCG 2007: 112-118 - [c2]Kevin Buchin, André Schulz:
Inflating the cube by shrinking. SCG 2007: 125-126 - 2006
- [j1]Günter Rote, André Schulz:
Threshold arrangements and the knapsack problem. Appl. Math. Lett. 19(1): 108-112 (2006) - 2005
- [c1]André Schulz:
New results on Pseudo-triangulations with low vertex degree. CCCG 2005: 130-133 - [i1]Günter Rote, André Schulz:
A pointed Delaunay pseudo-triangulation of a simple polygon. EuroCG 2005: 77-80
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-03-04 22:17 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
