André Schulz

MaRDI QIDQ293618zbMATH OpenFDO

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Realizing planar linkages in polygonal domains	2026-09-29	Paper
Reconfiguration of unit squares and disks: PSPACE-hardness in simple settings	2026-08-11	Paper
On plane cycles in geometric multipartite graphs	2026-07-10	Paper
Adjacency graphs of polyhedral surfaces	2026-04-27	Paper
On the geometric thickness of 2-degenerate graphs Journal of Computational Geometry	2025-04-23	Paper
On the geometric thickness of 2-degenerate graphs	2024-10-16	Paper
Side-contact representations with convex polygons in 3D: new results for complete bipartite graphs	2024-06-21	Paper
Adjacency graphs of polyhedral surfaces Discrete & Computational Geometry	2024-05-21	Paper
Arrangements of orthogonal circles with many intersections Journal of Graph Algorithms and Applications	2023-03-30	Paper
On the geometric thickness of 2-degenerate graphs	2023-02-28	Paper
Arrangements of orthogonal circles with many intersections (available as arXiv preprint)	2022-07-01	Paper
Recognizing planar Laman graphs	2022-05-11	Paper
Augmenting Geometric Graphs with Matchings Lecture Notes in Computer Science	2021-12-01	Paper
Arrangements of orthogonal circles with many intersections (available as arXiv preprint)	2021-06-07	Paper
Drawing subcubic 1-planar graphs with few bends, few slopes, and large angles Journal of Graph Algorithms and Applications	2021-01-19	Paper
Lombardi drawings of knots and links	2020-01-13	Paper
The Number of Convex Polyominoes with Given Height and Width	2019-03-04	Paper
Experimental analysis of the accessibility of drawings with few segments Lecture Notes in Computer Science	2019-02-20	Paper
Lombardi drawings of knots and links Lecture Notes in Computer Science	2019-02-20	Paper
Drawing subcubic 1-planar graphs with few bends, few slopes, and large angles (available as arXiv preprint)	2019-02-15	Paper
Experimental analysis of the accessibility of drawings with few segments Journal of Graph Algorithms and Applications	2018-10-25	Paper
Drawing planar graphs with few geometric primitives Journal of Graph Algorithms and Applications	2018-09-06	Paper
A duality transform for constructing small grid embeddings of 3d polytopes Computational Geometry	2018-01-19	Paper
Saturated simple and 2-simple topological graphs with few edges Journal of Graph Algorithms and Applications	2018-01-12	Paper
Drawing planar graphs with few geometric primitives (available as arXiv preprint)	2018-01-04	Paper
Embedding stacked polytopes on a polynomial-size grid	2017-09-29	Paper
Embedding stacked polytopes on a polynomial-size grid Discrete & Computational Geometry	2017-06-16	Paper
On Gallai's conjecture for series-parallel graphs and planar 3-trees	2017-06-13	Paper
Drawing planar cubic 3-connected graphs with few segments: algorithms \& experiments Journal of Graph Algorithms and Applications	2017-05-16	Paper
Drawing Planar Cubic 3-Connected Graphs with Few Segments: Algorithms and Experiments Lecture Notes in Computer Science	2017-02-10	Paper
On minimizing crossings in storyline visualizations Lecture Notes in Computer Science	2017-02-10	Paper
Realization of Simply Connected Polygonal Linkages and Recognition of Unit Disk Contact Trees Lecture Notes in Computer Science	2017-02-10	Paper
A tale of two communities: assessing homophily in node-link diagrams Lecture Notes in Computer Science	2017-02-10	Paper
Algorithms for designing pop-up cards	2017-01-30	Paper
Multi-sided boundary labeling Algorithmica	2016-11-01	Paper
Saturated Simple and 2-simple Topological Graphs with Few Edges Graph-Theoretic Concepts in Computer Science	2016-10-21	Paper
Counting carambolas Graphs and Combinatorics	2016-06-09	Paper
Contact Graphs of Circular Arcs Lecture Notes in Computer Science	2015-10-30	Paper
Drawing Graphs with Few Arcs Journal of Graph Algorithms and Applications	2015-10-29	Paper
On monotone drawings of trees Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications	2015-01-07	Paper
Flip graphs of bounded degree triangulations Graphs and Combinatorics	2014-02-14	Paper
Reprint of: Memory-constrained algorithms for simple polygons Computational Geometry	2014-01-22	Paper
A Duality Transform for Constructing Small Grid Embeddings of 3D Polytopes Graph Drawing	2013-12-20	Paper
Drawing graphs with few arcs Graph-Theoretic Concepts in Computer Science	2013-12-06	Paper
Flip graphs of bounded-degree triangulations Electronic Notes in Discrete Mathematics	2013-10-10	Paper
Bounds on the maximum multiplicity of some common geometric graphs SIAM Journal on Discrete Mathematics	2013-09-26	Paper
Counting plane graphs: flippability and its applications Thirty Essays on Geometric Graph Theory	2013-09-25	Paper
Two-sided boundary labeling with adjacent sides Lecture Notes in Computer Science	2013-08-12	Paper
Memory-constrained algorithms for simple polygons Computational Geometry	2013-07-31	Paper
Memory-constrained algorithms for simple polygons Computational Geometry	2013-07-31	Paper
On numbers of pseudo-triangulations Computational Geometry	2013-04-29	Paper
The union of colorful simplices spanned by a colored point set Computational Geometry	2013-03-12	Paper
Pinning balloons with perfect angles and optimal area Journal of Graph Algorithms and Applications	2012-12-07	Paper
Bounded-degree polyhedronization of point sets Computational Geometry	2012-12-04	Paper
Pointed drawings of planar graphs Computational Geometry	2012-09-21	Paper
Pinning balloons with perfect angles and optimal area Graph Drawing	2012-03-09	Paper
Bounds on the maximum multiplicity of some common geometric graphs (available as arXiv preprint)	2012-01-23	Paper
Bounds on the maximum multiplicity of some common geometric graphs	2012-01-23	Paper
Drawing 3-polytopes with good vertex resolution Journal of Graph Algorithms and Applications	2011-04-19	Paper
Small grid embeddings of 3-polytopes Discrete & Computational Geometry	2011-03-10	Paper
The union of colorful simplices spanned by a colored point set Combinatorial Optimization and Applications	2011-01-08	Paper
Fréchet distance of surfaces: some simple hard cases Algorithms – ESA 2010	2010-09-06	Paper
On the number of spanning trees a planar graph can have Algorithms – ESA 2010	2010-09-06	Paper
Drawing 3-polytopes with good vertex resolution Graph Drawing	2010-04-27	Paper
Resolving Loads with Positive Interior Stresses Lecture Notes in Computer Science	2009-10-20	Paper
On the Number of Cycles in Planar Graphs Lecture Notes in Computer Science	2009-03-06	Paper
Embedding 3-polytopes on a small grid Proceedings of the twenty-third annual symposium on Computational geometry - SCG '07	2009-02-12	Paper
Inflating the cube by shrinking Proceedings of the twenty-third annual symposium on Computational geometry - SCG '07	2009-02-12	Paper
Threshold arrangements and the knapsack problem Applied Mathematics Letters	2006-01-24	Paper

Research outcomes over time

This page was built for person: André Schulz