| Publication | Date of Publication | Type |
|---|
| Arrangements of orthogonal circles with many intersections | 2023-03-30 | Paper |
| On the geometric thickness of 2-degenerate graphs | 2023-02-28 | Paper |
| Arrangements of orthogonal circles with many intersections | 2022-07-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5075827 | 2022-05-11 | Paper |
| Augmenting Geometric Graphs with Matchings | 2021-12-01 | Paper |
| Arrangements of orthogonal circles with many intersections | 2021-06-07 | Paper |
| Drawing Subcubic 1-Planar Graphs with Few Bends, Few Slopes, and Large Angles | 2021-01-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5207877 | 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 | 2019-02-20 | Paper |
| Lombardi Drawings of Knots and Links | 2019-02-20 | Paper |
| Drawing subcubic 1-planar graphs with few bends, few slopes, and large angles | 2019-02-15 | Paper |
| Experimental Analysis of the Accessibility of Drawings with Few Segments | 2018-10-25 | Paper |
| Drawing Planar Graphs with Few Geometric Primitives | 2018-09-06 | Paper |
| A duality transform for constructing small grid embeddings of 3d polytopes | 2018-01-19 | Paper |
| Saturated simple and 2-simple topological graphs with few edges | 2018-01-12 | Paper |
| Drawing planar graphs with few geometric primitives | 2018-01-04 | Paper |
| Embedding stacked polytopes on a polynomial-size grid | 2017-09-29 | Paper |
| Embedding stacked polytopes on a polynomial-size grid | 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 | 2017-05-16 | Paper |
| Drawing Planar Cubic 3-Connected Graphs with Few Segments: Algorithms and Experiments | 2017-02-10 | Paper |
| On Minimizing Crossings in Storyline Visualizations | 2017-02-10 | Paper |
| Realization of Simply Connected Polygonal Linkages and Recognition of Unit Disk Contact Trees | 2017-02-10 | Paper |
| A Tale of Two Communities: Assessing Homophily in Node-Link Diagrams | 2017-02-10 | Paper |
| Algorithms for Designing Pop-Up Cards | 2017-01-30 | Paper |
| Multi-sided boundary labeling | 2016-11-01 | Paper |
| Saturated Simple and 2-simple Topological Graphs with Few Edges | 2016-10-21 | Paper |
| Counting carambolas | 2016-06-09 | Paper |
| Contact Graphs of Circular Arcs | 2015-10-30 | Paper |
| Drawing Graphs with Few Arcs | 2015-10-29 | Paper |
| On Monotone Drawings of Trees | 2015-01-07 | Paper |
| Flip graphs of bounded degree triangulations | 2014-02-14 | Paper |
| Reprint of: Memory-constrained algorithms for simple polygons | 2014-01-22 | Paper |
| A Duality Transform for Constructing Small Grid Embeddings of 3D Polytopes | 2013-12-20 | Paper |
| Drawing Graphs with Few Arcs | 2013-12-06 | Paper |
| Flip Graphs of Bounded-Degree Triangulations | 2013-10-10 | Paper |
| Bounds on the Maximum Multiplicity of Some Common Geometric Graphs | 2013-09-26 | Paper |
| Two-Sided Boundary Labeling with Adjacent Sides | 2013-08-12 | Paper |
| Memory-constrained algorithms for simple polygons | 2013-07-31 | Paper |
| On numbers of pseudo-triangulations | 2013-04-29 | Paper |
| The union of colorful simplices spanned by a colored point set | 2013-03-12 | Paper |
| Pinning balloons with perfect angles and optimal area | 2012-12-07 | Paper |
| Bounded-degree polyhedronization of point sets | 2012-12-04 | Paper |
| Pointed drawings of planar graphs | 2012-09-21 | Paper |
| Pinning Balloons with Perfect Angles and Optimal Area | 2012-03-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3113726 | 2012-01-23 | Paper |
| Drawing 3-Polytopes with Good Vertex Resolution | 2011-04-19 | Paper |
| Small grid embeddings of 3-polytopes | 2011-03-10 | Paper |
| The Union of Colorful Simplices Spanned by a Colored Point Set | 2011-01-08 | Paper |
| Fréchet Distance of Surfaces: Some Simple Hard Cases | 2010-09-06 | Paper |
| On the Number of Spanning Trees a Planar Graph Can Have | 2010-09-06 | Paper |
| Drawing 3-Polytopes with Good Vertex Resolution | 2010-04-27 | Paper |
| Resolving Loads with Positive Interior Stresses | 2009-10-20 | Paper |
| On the Number of Cycles in Planar Graphs | 2009-03-06 | Paper |
| Embedding 3-polytopes on a small grid | 2009-02-12 | Paper |
| Inflating the cube by shrinking | 2009-02-12 | Paper |
| Threshold arrangements and the knapsack problem | 2006-01-24 | Paper |
