André Schulz

Orcid: 0000-0002-2134-4852

Affiliations:
  • FernUniversität in Hagen, LG Theoretische Informatik, Germany
  • University of Münster, Institute of Mathematical Logic and Fundamental Research, Germany
  • FU Berlin, Institute of Computer Science, Germany


According to our database1, André Schulz authored at least 55 papers between 2005 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Adjacency Graphs of Polyhedral Surfaces.
Discret. Comput. Geom., June, 2024

2023
Color-Encoded Links Improve Homophily Perception in Node-Link Diagrams.
IEEE Trans. Vis. Comput. Graph., December, 2023

Arrangements of orthogonal circles with many intersections.
J. Graph Algorithms Appl., 2023

Side-Contact Representations with Convex Polygons in 3D: New Results for Complete Bipartite Graphs.
Proceedings of the Graph Drawing and Network Visualization - 31st International Symposium, 2023

On the Geometric Thickness of 2-Degenerate Graphs.
Proceedings of the 39th International Symposium on Computational Geometry, 2023

2022
Computing Schematic Layouts for Spatial Hypergraphs on Concentric Circles and Grids.
Comput. Graph. Forum, 2022

2021
Drawing Subcubic 1-Planar Graphs with Few Bends, Few Slopes, and Large Angles.
J. Graph Algorithms Appl., 2021

2020
Augmenting Geometric Graphs with Matchings.
Proceedings of the Graph Drawing and Network Visualization - 28th International Symposium, 2020

2019
Lombardi drawings of knots and links.
J. Comput. Geom., 2019

Recognizing Planar Laman Graphs.
Proceedings of the 27th Annual European Symposium on Algorithms, 2019

2018
Experimental Analysis of the Accessibility of Drawings with Few Segments.
J. Graph Algorithms Appl., 2018

Drawing Planar Graphs with Few Geometric Primitives.
J. Graph Algorithms Appl., 2018

Saturated simple and 2-simple topological graphs with few edges.
J. Graph Algorithms Appl., 2018

The Partition Spanning Forest Problem.
CoRR, 2018

2017
Drawing Planar Cubic 3-Connected Graphs with Few Segments: Algorithms & Experiments.
J. Graph Algorithms Appl., 2017

Embedding Stacked Polytopes on a Polynomial-Size Grid.
Discret. Comput. Geom., 2017

On Gallai's conjecture for series-parallel graphs and planar 3-trees.
CoRR, 2017

2016
Counting Carambolas.
Graphs Comb., 2016

A duality transform for constructing small grid embeddings of 3d polytopes.
Comput. Geom., 2016

Multi-sided Boundary Labeling.
Algorithmica, 2016

2015
Drawing Graphs with Few Arcs.
J. Graph Algorithms Appl., 2015

Contact Representations of Sparse Planar Graphs.
CoRR, 2015

Contact Graphs of Circular Arcs.
Proceedings of the Algorithms and Data Structures - 14th International Symposium, 2015

A Tale of Two Communities: Assessing Homophily in Node-Link Diagrams.
Proceedings of the Graph Drawing and Network Visualization - 23rd International Symposium, 2015

On Minimizing Crossings in Storyline Visualizations.
Proceedings of the Graph Drawing and Network Visualization - 23rd International Symposium, 2015

Drawing Planar Cubic 3-Connected Graphs with Few Segments: Algorithms and Experiments.
Proceedings of the Graph Drawing and Network Visualization - 23rd International Symposium, 2015

Realization of Simply Connected Polygonal Linkages and Recognition of Unit Disk Contact Trees.
Proceedings of the Graph Drawing and Network Visualization - 23rd International Symposium, 2015

2014
Reprint of: Memory-constrained algorithms for simple polygons.
Comput. Geom., 2014

On Monotone Drawings of Trees.
Proceedings of the Graph Drawing - 22nd International Symposium, 2014

2013
Bounds on the Maximum Multiplicity of Some Common Geometric Graphs.
SIAM J. Discret. Math., 2013

The union of colorful simplices spanned by a colored point set.
Comput. Geom., 2013

On numbers of pseudo-triangulations.
Comput. Geom., 2013

Bounded-degree polyhedronization of point sets.
Comput. Geom., 2013

Memory-constrained algorithms for simple polygons.
Comput. Geom., 2013

Two-Sided Boundary Labeling with Adjacent Sides.
Proceedings of the Algorithms and Data Structures - 13th International Symposium, 2013

Algorithms for Designing Pop-Up Cards.
Proceedings of the 30th International Symposium on Theoretical Aspects of Computer Science, 2013

Counting Carambolas.
Proceedings of the 25th Canadian Conference on Computational Geometry, 2013

2012
Algorithms for Labeling Focus Regions.
IEEE Trans. Vis. Comput. Graph., 2012

Pinning balloons with perfect angles and optimal area.
J. Graph Algorithms Appl., 2012

Pointed drawings of planar graphs.
Comput. Geom., 2012

2011
Drawing 3-Polytopes with Good Vertex Resolution.
J. Graph Algorithms Appl., 2011

Small Grid Embeddings of 3-Polytopes.
Discret. Comput. Geom., 2011

Convexifying Polygons Without Losing Visibilities.
Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, 2011

2010
On the Number of Spanning Trees a Planar Graph Can Have.
Proceedings of the Algorithms, 2010

Fréchet Distance of Surfaces: Some Simple Hard Cases.
Proceedings of the Algorithms, 2010

2009
Flip Graphs of Bounded-Degree Triangulations.
Electron. Notes Discret. Math., 2009

Resolving Loads with Positive Interior Stresses.
Proceedings of the Algorithms and Data Structures, 11th International Symposium, 2009

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)
PhD thesis, 2008

2007
Embedding 3-polytopes on a small grid.
Proceedings of the 23rd ACM Symposium on Computational Geometry, 2007

Inflating the cube by shrinking.
Proceedings of the 23rd ACM Symposium on Computational Geometry, 2007

On the Number of Cycles in Planar Graphs.
Proceedings of the Computing and Combinatorics, 13th Annual International Conference, 2007

On Rolling Cube Puzzles.
Proceedings of the 19th Annual Canadian Conference on Computational Geometry, 2007

2006
Threshold arrangements and the knapsack problem.
Appl. Math. Lett., 2006

2005
A pointed Delaunay pseudo-triangulation of a simple polygon.
Proceedings of the (Informal) Proceedings of the 21st European Workshop on Computational Geometry, 2005

New results on Pseudo-triangulations with low vertex degree.
Proceedings of the 17th Canadian Conference on Computational Geometry, 2005


  Loading...