| Publication | Date of Publication | Type |
|---|
Linear versus centred chromatic numbers
(available as arXiv preprint) | N/A | Paper |
Connected Dominating Sets in Triangulations
(available as arXiv preprint) | N/A | Paper |
On \(k\)-planar graphs without short cycles
Journal of Graph Algorithms and Applications | 2026-09-25 | Paper |
On shortest path, \textsf{BFS}- and \textsf{DFS}-tree graphs
Journal of Graph Algorithms and Applications | 2026-09-25 | Paper |
Linear versus centred colouring via pseudogrids
Journal of Graph Theory | 2026-09-14 | Paper |
| An improved bound for plane covering paths | 2026-08-31 | Paper |
| Constructing and routing on geometric spanners (invited talk) | 2026-08-11 | Paper |
| Tight bounds on the number of closest pairs in vertical slabs | 2026-08-11 | Paper |
| Online routing in directed \({\mathrm{Yao}}_4^\infty\) graphs | 2026-08-11 | Paper |
| On geodesic disks enclosing many points | 2026-08-11 | Paper |
| Cops and robbers for graphs on surfaces with crossings | 2026-08-05 | Paper |
| Routing from pentagon to octagon Delaunay graphs | 2026-06-08 | Paper |
| On the spanning and routing ratios of the Yao-four graph | 2026-06-08 | Paper |
| A parameterized algorithm for vertex and edge connectivity of embedded graphs | 2026-05-26 | Paper |
On the d-independence number in 1-planar graphs
Graphs and Combinatorics | 2026-01-29 | Paper |
Noncrossing longest paths and cycles
Graphs and Combinatorics | 2026-01-29 | Paper |
Piercing unit geodesic disks
Computational Geometry | 2026-01-22 | Paper |
On separating path and tree systems in graphs
Discrete Mathematics and Theoretical Computer Science. DMTCS | 2026-01-13 | Paper |
| On the independence number of 1-planar graphs | 2025-12-02 | Paper |
| Noncrossing longest paths and cycles | 2025-10-07 | Paper |
| On k-planar graphs without short cycles | 2025-10-07 | Paper |
Computing shortest paths amid non-overlapping weighted disks
Results in Mathematics | 2025-08-15 | Paper |
Approximating the smallest k-enclosing geodesic disc in a simple polygon
Journal of Computational Geometry | 2025-06-19 | Paper |
On 1-planar graphs with bounded cop-number
Theoretical Computer Science | 2025-04-03 | Paper |
The exact spanning ratio of the parallelogram Delaunay graph
Theoretical Computer Science | 2025-04-03 | Paper |
Approximating average bounded-angle minimum spanning trees
Computational Geometry | 2025-03-10 | Paper |
Optimal algorithms for separating a polyhedron from its single-part mold
CGT. Computing in Geometry and Topology | 2024-11-18 | Paper |
Pursuit-evasion in graphs: zombies, lazy zombies and a survivor
Discrete Mathematics | 2024-11-09 | Paper |
Improved spanning ratio of the Theta-5 graph
Journal of Computational Geometry | 2024-10-18 | Paper |
| Pursuit-evasion in graphs: zombies, lazy zombies and a survivor | 2024-09-11 | Paper |
Routing on heavy path WSPD spanners
Computational Geometry | 2024-09-10 | Paper |
A Steiner-point-based algorithm for approximate shortest paths in weighted equilateral-triangle meshes
Theoretical Computer Science | 2024-05-08 | Paper |
On the spanning and routing ratio of the directed theta-four graph
Discrete & Computational Geometry | 2024-04-02 | Paper |
Approximating the smallest \(k\)-enclosing geodesic disc in a simple polygon
Lecture Notes in Computer Science | 2024-01-16 | Paper |
| On Separating Path and Tree Systems in Graphs | 2023-12-21 | Paper |
| Bounded-Angle Minimum Spanning Trees | 2023-11-02 | Paper |
| Parameterized complexity of two-interval pattern problem | 2023-11-02 | Paper |
Competitive Online Search Trees on Trees
ACM Transactions on Algorithms | 2023-10-23 | Paper |
Improved routing on the Delaunay triangulation
Discrete & Computational Geometry | 2023-10-12 | Paper |
Simple linear time algorithms for piercing pairwise intersecting disks
Computational Geometry | 2023-07-31 | Paper |
On the zombie number of various graph classes
LATIN 2022: Theoretical Informatics | 2023-07-26 | Paper |
Piercing pairwise intersecting convex shapes in the plane
LATIN 2022: Theoretical Informatics | 2023-07-26 | Paper |
Local routing algorithms on Euclidean spanners with small diameter
LATIN 2022: Theoretical Informatics | 2023-07-26 | Paper |
On approximating shortest paths in weighted triangular tessellations
Artificial Intelligence | 2023-06-27 | Paper |
Separating layered treewidth and row treewidth
Discrete Mathematics & Theoretical Computer Science | 2023-05-30 | Paper |
The Minimum Moving Spanning Tree Problem
Journal of Graph Algorithms and Applications | 2023-03-30 | Paper |
Fragile complexity of adaptive algorithms
Lecture Notes in Computer Science | 2023-03-22 | Paper |
| No quadrangulation is extremely odd | 2023-03-21 | Paper |
Pattern matching for permutations
Lecture Notes in Computer Science | 2023-01-18 | Paper |
Filling polyhedral molds
Lecture Notes in Computer Science | 2023-01-18 | Paper |
Drawing graphs as spanners
Graph-Theoretic Concepts in Computer Science | 2022-12-21 | Paper |
Geodesic obstacle representation of graphs
Computational Geometry | 2022-11-16 | Paper |
On the restricted k-Steiner tree problem
Journal of Combinatorial Optimization | 2022-10-18 | Paper |
| Flips in higher order Delaunay triangulations | 2022-10-13 | Paper |
Drawing graphs as spanners
Discrete & Computational Geometry | 2022-09-16 | Paper |
Computing constrained minimum-width annuli of point sets
Lecture Notes in Computer Science | 2022-08-19 | Paper |
On approximating shortest paths in weighted triangular tessellations
(available as arXiv preprint) | 2022-07-13 | Paper |
On the spanning and routing ratios of the directed _6-graph
Computational Geometry | 2022-06-13 | Paper |
Fragile complexity of adaptive algorithms
Theoretical Computer Science | 2022-05-10 | Paper |
| Pursuit-Evasion in Graphs: Zombies, Lazy Zombies and a Survivor | 2022-04-25 | Paper |
Computing maximum independent set on outerstring graphs and their relatives
Computational Geometry | 2022-04-08 | Paper |
| On the spanning and routing ratios of the directed _6-graph | 2022-03-25 | Paper |
| The minimum moving spanning tree problem | 2022-03-25 | Paper |
| Improved bounds on the spanning ratio of the theta-5-graph | 2022-03-25 | Paper |
| Routing on heavy-path WSPD-spanners | 2022-03-25 | Paper |
| An Optimal Algorithm for Product Structure in Planar Graphs | 2022-02-17 | Paper |
Bounded-angle minimum spanning trees
Algorithmica | 2022-02-01 | Paper |
Parameterized complexity of two-interval pattern problem
Theoretical Computer Science | 2022-01-18 | Paper |
Affine invariant triangulations
Computer Aided Geometric Design | 2022-01-12 | Paper |
Affine invariant triangulations
Computer Aided Geometric Design | 2022-01-12 | Paper |
Faster multi-sided one-bend boundary labelling
(available as arXiv preprint) | 2021-10-04 | Paper |
Piercing pairwise intersecting geodesic disks
Computational Geometry | 2021-09-17 | Paper |
Attraction-convexity and normal visibility
Computational Geometry | 2021-09-16 | Paper |
| Improved routing on the Delaunay triangulation | 2021-08-04 | Paper |
Geodesic obstacle representation of graphs
(available as arXiv preprint) | 2021-07-28 | Paper |
Computing the \(k\)-visibility region of a point in a polygon
Theory of Computing Systems | 2021-06-11 | Paper |
| On the restricted 1-Steiner tree problem | 2021-04-21 | Paper |
| Local routing in WSPD-based spanners | 2021-03-17 | Paper |
Constrained routing between non-visible vertices
Theoretical Computer Science | 2021-03-09 | Paper |
Local routing in convex subdivisions
International Journal of Computational Geometry & Applications | 2021-02-11 | Paper |
Competitive Online Search Trees on Trees
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
Routing on the visibility graph
(available as arXiv preprint) | 2020-11-25 | Paper |
Faster algorithms for some optimization problems on collinear points
(available as arXiv preprint) | 2020-11-12 | Paper |
Gathering by repulsion
Computational Geometry | 2020-10-23 | Paper |
Hamiltonicity for convex shape Delaunay and Gabriel graphs
Computational Geometry | 2020-10-23 | Paper |
Boundary labeling for rectangular diagrams
(available as arXiv preprint) | 2020-08-25 | Paper |
| Gathering by repulsion | 2020-08-25 | Paper |
| Improved bounds for guarding plane graphs with edges | 2020-08-25 | Paper |
| Faster algorithms for some optimization problems on collinear points | 2020-08-18 | Paper |
Power domination on triangular grids with triangular and hexagonal shape
Journal of Combinatorial Optimization | 2020-07-29 | Paper |
| Asymptotically Optimal Vertex Ranking of Planar Graphs | 2020-07-13 | Paper |
Self-approaching paths in simple polygons
Computational Geometry | 2020-04-22 | Paper |
Optimal art gallery localization is NP-hard
Computational Geometry | 2020-03-23 | Paper |
| Computing the \(k\)-crossing visibility region of a point in a polygon | 2020-02-25 | Paper |
Hamiltonicity for convex shape Delaunay and Gabriel graphs
Lecture Notes in Computer Science | 2020-01-16 | Paper |
Computing maximum independent set on outerstring graphs and their relatives
Lecture Notes in Computer Science | 2020-01-16 | Paper |
Reconstructing a convex Polygon from its \(\omega\)-cloud
(available as arXiv preprint) | 2019-10-22 | Paper |
On the spanning and routing ratio of Theta-Four
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
Spanning properties of Yao and -graphs in the presence of constraints
International Journal of Computational Geometry & Applications | 2019-09-24 | Paper |
Pole dancing: 3D morphs for tree drawings
Journal of Graph Algorithms and Applications | 2019-09-16 | Paper |
A characterization of the degree sequences of 2-trees
2007 Proceedings of the Fourth Workshop on Analytic Algorithmics and Combinatorics (ANALCO) | 2019-09-16 | Paper |
