André Schulz - RankMe

98 papers A* 4A 16B 7C 1Misc 1Journal 56Unranked 12

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