| Publication | Date of Publication | Type |
|---|
| Adjacency graphs of polyhedral surfaces | 2026-04-27 | Paper |
Geometric thickness of multigraphs is \(\exists \mathbb{R}\)-complete
Algorithmica | 2025-11-25 | Paper |
| Separable drawings: extendability and crossing-free Hamiltonian cycles | 2025-10-07 | Paper |
| On the uncrossed number of graphs | 2025-10-07 | Paper |
Drawings of complete multipartite graphs up to triangle flips
Journal of Computational Geometry | 2025-04-23 | Paper |
| Flip graph connectivity for arrangements of pseudolines and pseudocircles | 2024-11-28 | Paper |
| Drawings of complete multipartite graphs up to triangle flips | 2024-10-16 | Paper |
| Different types of isomorphisms of drawings of complete multipartite graphs | 2024-10-14 | Paper |
Coloring circle arrangements: new 4-chromatic planar graphs
European Journal of Combinatorics | 2024-09-30 | Paper |
No selection lemma for empty triangles
Acta Mathematica Hungarica | 2024-09-19 | Paper |
| Coloring circle arrangements: new 4-chromatic planar graphs | 2024-09-13 | Paper |
| Geometric thickness of multigraphs is \(\exists \mathbb{R} \)-complete | 2024-05-31 | Paper |
Adjacency graphs of polyhedral surfaces
Discrete & Computational Geometry | 2024-05-21 | Paper |
| Twisted ways to find plane structures in simple drawings of complete graphs | 2024-05-14 | Paper |
| Edge partitions of complete geometric graphs | 2024-05-14 | Paper |
Towards crossing-free Hamiltonian cycles in simple drawings of complete graphs
(available as arXiv preprint) | 2024-04-02 | Paper |
Perfect matchings with crossings
Algorithmica | 2024-03-25 | Paper |
Twisted ways to find plane structures in simple drawings of complete graphs
Discrete & Computational Geometry | 2024-01-09 | Paper |
Empty Triangles in Generalized Twisted Drawings of $K_n$
Journal of Graph Algorithms and Applications | 2023-12-20 | Paper |
Flipping plane spanning paths
WALCOM: Algorithms and Computation | 2023-11-24 | Paper |
| Flip Graph Connectivity for Arrangements of Pseudolines and Pseudocircles | 2023-10-30 | Paper |
| Bichromatic Perfect Matchings with Crossings | 2023-09-01 | Paper |
Empty triangles in generalized twisted drawings of \(K_n\)
Lecture Notes in Computer Science | 2023-08-16 | Paper |
Compatible spanning trees in simple drawings of \(K_n\)
Lecture Notes in Computer Science | 2023-08-16 | Paper |
Shooting stars in simple drawings of \(K_{m,n}\)
Lecture Notes in Computer Science | 2023-08-16 | Paper |
Disjoint compatibility via graph classes
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 |
Graphs with large total angular resolution
Theoretical Computer Science | 2023-01-05 | Paper |
Inserting one edge into a simple drawing is hard
Graph-Theoretic Concepts in Computer Science | 2022-12-21 | Paper |
Drawing graphs as spanners
Graph-Theoretic Concepts in Computer Science | 2022-12-21 | Paper |
On Compatible Matchings
Journal of Graph Algorithms and Applications | 2022-11-14 | Paper |
Drawing graphs as spanners
Discrete & Computational Geometry | 2022-09-16 | Paper |
| Perfect matchings with crossings | 2022-08-30 | Paper |
On weighted sums of numbers of convex polygons in point sets
Discrete & Computational Geometry | 2022-08-25 | Paper |
On crossing-families in planar point sets
Computational Geometry | 2022-06-13 | Paper |
| Coloring circle arrangements: New $4$-chromatic planar graphs | 2022-05-17 | Paper |
| Edge Partitions of Complete Geometric Graphs (Part 2) | 2021-12-15 | Paper |
On compatible matchings
(available as arXiv preprint) | 2021-10-04 | Paper |
Rainbow polygons for colored point sets in the plane
Discrete Mathematics | 2021-06-14 | Paper |
Flip distances between graph orientations
Algorithmica | 2021-02-01 | Paper |
| Evacuating robots from a disk using face-to-face communication | 2021-01-05 | Paper |
Routing in polygonal domains
(available as arXiv preprint) | 2020-11-25 | Paper |
On the 2-colored crossing number
(available as arXiv preprint) | 2020-10-26 | Paper |
On the edge-vertex ratio of maximal thrackles
(available as arXiv preprint) | 2020-10-26 | Paper |
Graphs with large total angular resolution
Lecture Notes in Computer Science | 2020-10-26 | Paper |
Routing in polygonal domains
Computational Geometry | 2020-04-22 | Paper |
A superlinear lower bound on the number of 5-holes
Journal of Combinatorial Theory. Series A | 2020-03-20 | Paper |
Flip distances between graph orientations
Graph-Theoretic Concepts in Computer Science | 2020-02-24 | Paper |
Flip distances between graph orientations
Graph-Theoretic Concepts in Computer Science | 2020-02-24 | Paper |
| Lombardi drawings of knots and links | 2020-01-13 | Paper |
Packing plane spanning graphs with short edges in complete geometric graphs
Computational Geometry | 2019-10-25 | Paper |
On the edge-vertex ratio of maximal thrackles
(available as arXiv preprint) | 2019-08-23 | Paper |
On the 2-colored crossing number
(available as arXiv preprint) | 2019-08-18 | Paper |
| Transformed flips in triangulations and matchings | 2019-07-20 | Paper |
Lombardi drawings of knots and links
Lecture Notes in Computer Science | 2019-02-20 | Paper |
Perfect \(k\)-colored matchings and \((k+2)\)-gonal tilings
Graphs and Combinatorics | 2019-01-11 | Paper |
Cross-sections of line configurations in \(\mathbb{R}^3\) and (\(d-2\))-flat configurations in \(\mathbb{R}^d\)
Computational Geometry | 2018-11-19 | Paper |
Bishellable drawings of $K_n$
SIAM Journal on Discrete Mathematics | 2018-11-19 | Paper |
Holes in 2-convex point sets
Computational Geometry | 2018-10-31 | Paper |
Intersection graphs of rays and grounded segments
Journal of Graph Algorithms and Applications | 2018-09-06 | Paper |
A superlinear lower bound on the number of 5-holes
(available as arXiv preprint) | 2018-08-13 | Paper |
Holes in 2-convex point sets
Lecture Notes in Computer Science | 2018-06-15 | Paper |
Linear transformation distance for bichromatic matchings
Proceedings of the thirtieth annual symposium on Computational geometry | 2018-04-23 | Paper |
Packing short plane spanning trees in complete geometric graphs
(available as arXiv preprint) | 2018-04-19 | Paper |
Computing balanced islands in two colored point sets in the plane
Information Processing Letters | 2018-04-05 | Paper |
Modem illumination of monotone polygons
Computational Geometry | 2018-02-19 | Paper |
Modem illumination of monotone polygons
Computational Geometry | 2018-02-19 | Paper |
Linear transformation distance for bichromatic matchings
Computational Geometry | 2018-02-19 | Paper |
The dual diameter of triangulations
Computational Geometry | 2018-02-19 | Paper |
| An improved lower bound on the minimum number of triangulations | 2018-01-30 | Paper |
| Intersection graphs of rays and grounded segments | 2018-01-04 | Paper |
Representing directed trees as straight skeletons
Lecture Notes in Computer Science | 2017-02-10 | Paper |
A note on the number of general 4-holes in (perturbed) grids
Lecture Notes in Computer Science | 2017-02-01 | Paper |
3-colorability of pseudo-triangulations
International Journal of Computational Geometry & Applications | 2016-03-14 | Paper |
Embedding Four-directional Paths on Convex Point Sets
Journal of Graph Algorithms and Applications | 2016-01-07 | Paper |
On \(k\)-gons and \(k\)-holes in point sets
Computational Geometry | 2015-12-30 | Paper |
\((n,m)\)-fold covers of spheres
Proceedings of the Steklov Institute of Mathematics | 2015-08-20 | Paper |
Geodesic-preserving polygon simplification
International Journal of Computational Geometry & Applications | 2015-07-01 | Paper |
Empty triangles in good drawings of the complete graph
Graphs and Combinatorics | 2015-05-22 | Paper |
Flips in combinatorial pointed pseudo-triangulations with face degree at most four
International Journal of Computational Geometry & Applications | 2015-04-22 | Paper |
Monotone simultaneous embeddings of upward planar digraphs
Journal of Graph Algorithms and Applications | 2015-03-04 | Paper |
| Cell-paths in mono- and bichromatic line arrangements in the plane | 2015-02-09 | Paper |
Geodesic order types
Algorithmica | 2015-01-19 | Paper |
Embedding four-directional paths on convex point sets
Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications | 2015-01-07 | Paper |
On \(k\)-convex point sets
Computational Geometry | 2014-06-27 | Paper |
4-holes in point sets
Computational Geometry | 2014-05-19 | Paper |
Lower bounds for the number of small convex \(k\)-holes
Computational Geometry | 2014-04-09 | Paper |
Geodesic-preserving polygon simplification
Algorithms and Computation | 2014-01-14 | Paper |
On 5-gons and 5-holes
Lecture Notes in Computer Science | 2013-01-07 | Paper |
Blocking Delaunay triangulations
Computational Geometry | 2012-12-04 | Paper |
Geodesic order types
Lecture Notes in Computer Science | 2012-09-25 | Paper |
Pointed drawings of planar graphs
Computational Geometry | 2012-09-21 | Paper |
Large bichromatic point sets admit empty monochromatic 4-gons
SIAM Journal on Discrete Mathematics | 2010-12-03 | Paper |
On the number of plane graphs
Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 | 2010-08-16 | Paper |
Gray code enumeration of plane straight-line graphs
Graphs and Combinatorics | 2007-12-10 | Paper |
On the number of plane geometric graphs
Graphs and Combinatorics | 2007-07-19 | Paper |
