| Publication | Date of Publication | Type |
|---|
| Graph drawing contest report (graph drawing contest report) | 2026-09-21 | Paper |
| Crossing and independent families among polygons | 2026-08-11 | Paper |
| Algorithms for distance problems in continuous graphs | 2026-08-11 | Paper |
Bowties and hourglasses: intersections of double-wedges or: \textit{stabbing and avoiding line segments}
Information Processing Letters | 2026-07-14 | Paper |
| The PACE 2024 parameterized algorithms and computational experiments challenge: one-sided crossing minimization | 2026-05-29 | Paper |
| Crossing-optimal extension of simple drawings | 2026-05-12 | Paper |
| Extending partial 1-planar drawings | 2026-03-18 | Paper |
| Graph drawing contest report (graph drawing contest report) | 2025-10-07 | Paper |
| On k-plane insertion into plane drawings | 2025-10-07 | Paper |
Faces in rectilinear drawings of complete graphs
European Journal of Combinatorics | 2025-09-16 | Paper |
Strong odd coloring in minor-closed classes
(available as arXiv preprint) | 2025-01-01 | Paper |
| Minimum link fencing | 2024-09-11 | Paper |
Edge-minimum saturated \(k\)-planar drawings
Journal of Graph Theory | 2024-07-02 | Paper |
Graph drawing contest report
Lecture Notes in Computer Science | 2023-08-16 | Paper |
On streaming algorithms for geometric independent set and clique
Approximation and Online Algorithms | 2023-07-25 | Paper |
On fully diverse sets of geometric objects and graphs
Graph-Theoretic Concepts in Computer Science | 2023-05-05 | Paper |
Inserting one edge into a simple drawing is hard
Discrete & Computational Geometry | 2023-03-09 | Paper |
Finding large matchings in 1-planar graphs of minimum degree 3
(available as arXiv preprint) | 2022-12-21 | Paper |
Inserting one edge into a simple drawing is hard
Graph-Theoretic Concepts in Computer Science | 2022-12-21 | Paper |
scientific article; zbMATH DE number 7559402 (Why is no real title available?)
(available as arXiv preprint) | 2022-07-18 | Paper |
Edge-minimum saturated \(k\)-planar drawings
(available as arXiv preprint) | 2022-07-01 | Paper |
On strict (outer-)confluent graphs
Journal of Graph Algorithms and Applications | 2022-06-28 | Paper |
Efficient segment folding is hard
Computational Geometry | 2022-04-08 | Paper |
Balanced independent and dominating sets on colored interval graphs
(available as arXiv preprint) | 2022-03-24 | Paper |
Labeling nonograms: boundary labeling for curve arrangements
Computational Geometry | 2021-09-17 | Paper |
On structural parameterizations of the bounded-degree vertex deletion problem
Algorithmica | 2021-02-01 | Paper |
Edge-Minimum Saturated k-Planar Drawings
(available as arXiv preprint) | 2020-12-15 | Paper |
On strict (outer-)confluent graphs
(available as arXiv preprint) | 2020-10-26 | Paper |
Maximizing ink in partial edge drawings of \(k\)-plane graphs
(available as arXiv preprint) | 2020-10-26 | Paper |
Mixed linear layouts: complexity, heuristics, and experiments
(available as arXiv preprint) | 2020-10-26 | Paper |
Four pages are indeed necessary for planar graphs
(available as arXiv preprint) | 2020-09-09 | Paper |
| scientific article; zbMATH DE number 7236457 (Why is no real title available?) | 2020-08-18 | Paper |
| On structural parameterizations of the bounded-degree vertex deletion problem | 2020-08-05 | Paper |
Minimizing crossings in constrained two-sided circular graph layouts
(available as arXiv preprint) | 2020-01-13 | Paper |
On Strict (Outer-)Confluent Graphs
(available as arXiv preprint) | 2019-08-14 | Paper |
