| Publication | Date of Publication | Type |
|---|
| https://portal.mardi4nfdi.de/entity/Q6124764 | 2024-04-02 | Paper |
| A Sublinear Bound on the Page Number of Upward Planar Graphs | 2023-10-26 | Paper |
| Colouring bottomless rectangles and arborescences | 2023-07-31 | Paper |
| Polychromatic colorings of unions of geometric hypergraphs | 2023-05-05 | Paper |
| Guarding quadrangulations and stacked triangulations with edges | 2022-12-21 | Paper |
| Plattenbauten: touching rectangles in space | 2022-12-21 | Paper |
| An improved planar graph product structure theorem | 2022-07-11 | Paper |
| Edge-minimum saturated \(k\)-planar drawings | 2022-07-01 | Paper |
| On the queue-number of partial orders | 2022-07-01 | Paper |
| Linear layouts of complete graphs | 2022-07-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5075800 | 2022-05-11 | Paper |
| The Local Queue Number of Graphs with Bounded Treewidth | 2021-12-01 | Paper |
| The interval number of a planar graph is at most three | 2021-02-03 | Paper |
| Planar Graphs Have Bounded Queue-Number | 2020-11-11 | Paper |
| Local and union page numbers | 2020-10-26 | Paper |
| Four pages are indeed necessary for planar graphs | 2020-09-09 | Paper |
| Planar graphs of bounded degree have bounded queue number | 2020-01-30 | Paper |
| Planar Ramsey graphs | 2019-10-14 | Paper |
| Planar Graphs of Bounded Degree Have Bounded Queue Number | 2019-10-11 | Paper |
| Making Octants Colorful and Related Covering Decomposition Problems | 2019-06-20 | Paper |
| Combinatorial and Geometric Properties of Planar Laman Graphs | 2019-05-15 | Paper |
| The queue-number of posets of bounded width or height | 2019-02-15 | Paper |
| Chromatic number of ordered graphs with forbidden ordered subgraphs | 2019-02-01 | Paper |
| Decomposing 4-connected planar triangulations into two trees and one path | 2018-12-20 | Paper |
| Induced and weak induced arboricities | 2018-11-29 | Paper |
| On the maximum crossing number | 2018-06-15 | Paper |
| Local and union boxicity | 2018-04-05 | Paper |
| On the Maximum Crossing Number | 2018-01-12 | Paper |
| The Chromatic Number of Ordered Graphs With Constrained Conflict Graphs | 2017-12-06 | Paper |
| The \(k\)-strong induced arboricity of a graph | 2017-10-10 | Paper |
| On-line coloring between two lines | 2017-10-10 | Paper |
| Conditions on Ramsey Nonequivalence | 2017-09-26 | Paper |
| Splitting Planar Graphs of Girth 6 into Two Linear Forests with Short Paths | 2017-08-08 | Paper |
| Density of range capturing hypergraphs | 2017-03-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2968079 | 2017-03-09 | Paper |
| Making triangles colorful | 2017-03-09 | Paper |
| Combinatorial Properties of Triangle-Free Rectangle Arrangements and the Squarability Problem | 2017-02-10 | Paper |
| Pixel and Voxel Representations of Graphs | 2017-02-10 | Paper |
| A note on concurrent graph sharing games | 2016-10-28 | Paper |
| Spectrum of mixed bi-uniform hypergraphs | 2016-06-13 | Paper |
| Intersection graphs of L-shapes and segments in the plane | 2016-05-02 | Paper |
| Three ways to cover a graph | 2015-12-08 | Paper |
| Contact Graphs of Circular Arcs | 2015-10-30 | Paper |
| Contact Representations of Graphs in 3D | 2015-10-30 | Paper |
| Playing weighted Tron on trees | 2015-08-05 | Paper |
| Making Octants Colorful and Related Covering Decomposition Problems | 2015-04-17 | Paper |
| On the bend-number of planar and outerplanar graphs | 2014-12-03 | Paper |
| Intersection Graphs of L-Shapes and Segments in the Plane | 2014-10-14 | Paper |
| Cycle bases in graphs characterization, algorithms, complexity, and applications | 2014-10-07 | Paper |
| Computing cartograms with optimal complexity | 2014-08-07 | Paper |
| Online and size anti-Ramsey numbers | 2014-04-30 | Paper |
| Twins in graphs | 2014-03-31 | Paper |
| Semantic Word Cloud Representations: Hardness and Approximation Algorithms | 2014-03-31 | Paper |
| Edge-intersection graphs of grid paths: the bend-number | 2014-03-27 | Paper |
| Packing polyominoes clumsily | 2014-01-08 | Paper |
| Equilateral L-Contact Graphs | 2013-12-06 | Paper |
| Computing cartograms with optimal complexity | 2013-11-06 | Paper |
| Planar Graphs as VPG-Graphs | 2013-08-13 | Paper |
| Non-crossing Connectors in the Plane | 2013-05-28 | Paper |
| Planar Graphs as VPG-Graphs | 2013-04-03 | Paper |
| On the bend-number of planar and outerplanar graphs | 2012-06-29 | Paper |
| How to eat 4/9 of a pizza | 2011-08-08 | Paper |
