André Schulz

From MaRDI portal
Person:293618

Available identifiers

zbMath Open schulz.andreMaRDI QIDQ293618

List of research outcomes





PublicationDate of PublicationType
On the geometric thickness of 2-degenerate graphs2024-10-16Paper
Side-contact representations with convex polygons in 3D: new results for complete bipartite graphs2024-06-21Paper
Adjacency graphs of polyhedral surfaces2024-05-21Paper
Arrangements of orthogonal circles with many intersections2023-03-30Paper
On the geometric thickness of 2-degenerate graphs2023-02-28Paper
Arrangements of orthogonal circles with many intersections2022-07-01Paper
Recognizing planar Laman graphs2022-05-11Paper
Augmenting Geometric Graphs with Matchings2021-12-01Paper
Arrangements of orthogonal circles with many intersections2021-06-07Paper
Drawing subcubic 1-planar graphs with few bends, few slopes, and large angles2021-01-19Paper
Lombardi drawings of knots and links2020-01-13Paper
The Number of Convex Polyominoes with Given Height and Width2019-03-04Paper
Experimental analysis of the accessibility of drawings with few segments2019-02-20Paper
Lombardi drawings of knots and links2019-02-20Paper
Drawing subcubic 1-planar graphs with few bends, few slopes, and large angles2019-02-15Paper
Experimental analysis of the accessibility of drawings with few segments2018-10-25Paper
Drawing planar graphs with few geometric primitives2018-09-06Paper
A duality transform for constructing small grid embeddings of 3d polytopes2018-01-19Paper
Saturated simple and 2-simple topological graphs with few edges2018-01-12Paper
Drawing planar graphs with few geometric primitives2018-01-04Paper
Embedding stacked polytopes on a polynomial-size grid2017-09-29Paper
Embedding stacked polytopes on a polynomial-size grid2017-06-16Paper
On Gallai's conjecture for series-parallel graphs and planar 3-trees2017-06-13Paper
Drawing planar cubic 3-connected graphs with few segments: algorithms \& experiments2017-05-16Paper
Drawing Planar Cubic 3-Connected Graphs with Few Segments: Algorithms and Experiments2017-02-10Paper
Realization of Simply Connected Polygonal Linkages and Recognition of Unit Disk Contact Trees2017-02-10Paper
A tale of two communities: assessing homophily in node-link diagrams2017-02-10Paper
On minimizing crossings in storyline visualizations2017-02-10Paper
Algorithms for designing pop-up cards2017-01-30Paper
Multi-sided boundary labeling2016-11-01Paper
Saturated Simple and 2-simple Topological Graphs with Few Edges2016-10-21Paper
Counting carambolas2016-06-09Paper
Contact Graphs of Circular Arcs2015-10-30Paper
Drawing Graphs with Few Arcs2015-10-29Paper
On monotone drawings of trees2015-01-07Paper
Flip graphs of bounded degree triangulations2014-02-14Paper
Reprint of: Memory-constrained algorithms for simple polygons2014-01-22Paper
A Duality Transform for Constructing Small Grid Embeddings of 3D Polytopes2013-12-20Paper
Drawing graphs with few arcs2013-12-06Paper
Flip graphs of bounded-degree triangulations2013-10-10Paper
Bounds on the maximum multiplicity of some common geometric graphs2013-09-26Paper
Counting plane graphs: flippability and its applications2013-09-25Paper
Two-sided boundary labeling with adjacent sides2013-08-12Paper
Memory-constrained algorithms for simple polygons2013-07-31Paper
On numbers of pseudo-triangulations2013-04-29Paper
The union of colorful simplices spanned by a colored point set2013-03-12Paper
Pinning balloons with perfect angles and optimal area2012-12-07Paper
Bounded-degree polyhedronization of point sets2012-12-04Paper
Pointed drawings of planar graphs2012-09-21Paper
Pinning balloons with perfect angles and optimal area2012-03-09Paper
Bounds on the maximum multiplicity of some common geometric graphs2012-01-23Paper
Drawing 3-polytopes with good vertex resolution2011-04-19Paper
Small grid embeddings of 3-polytopes2011-03-10Paper
The union of colorful simplices spanned by a colored point set2011-01-08Paper
On the number of spanning trees a planar graph can have2010-09-06Paper
Fréchet distance of surfaces: some simple hard cases2010-09-06Paper
Drawing 3-polytopes with good vertex resolution2010-04-27Paper
Resolving Loads with Positive Interior Stresses2009-10-20Paper
On the Number of Cycles in Planar Graphs2009-03-06Paper
Embedding 3-polytopes on a small grid2009-02-12Paper
Inflating the cube by shrinking2009-02-12Paper
Threshold arrangements and the knapsack problem2006-01-24Paper

Research outcomes over time

This page was built for person: André Schulz