| Publication | Date of Publication | Type |
|---|
| Approximation schemes for geometric knapsack for packing spheres and fat objects | 2026-01-14 | Paper |
| Fully dynamic maximum independent sets of disks in polylogarithmic update time | 2025-11-24 | Paper |
| Online duet between metric embeddings and minimum-weight perfect matchings | 2024-11-28 | Paper |
| Extending orthogonal planar graph drawings is fixed-parameter tractable | 2024-10-16 | Paper |
Dynamic Euclidean bottleneck matching
Theoretical Computer Science | 2024-10-01 | Paper |
| Minimum link fencing | 2024-09-11 | Paper |
An Algorithmic Study of Fully Dynamic Independent Sets for Map Labeling
ACM Journal of Experimental Algorithmics | 2024-04-14 | Paper |
Online Spanners in Metric Spaces
SIAM Journal on Discrete Mathematics | 2024-03-14 | Paper |
| scientific article; zbMATH DE number 7788592 (Why is no real title available?) | 2024-01-15 | Paper |
| Space-efficient algorithms for reachability in directed geometric graphs | 2024-01-15 | Paper |
On colorful vertex and edge cover problems
Algorithmica | 2023-12-13 | Paper |
| Parameterized Study of Steiner Tree on Unit Disk Graphs | 2023-11-02 | Paper |
Online Euclidean Spanners
(available as arXiv preprint) | 2023-09-20 | Paper |
On streaming algorithms for geometric independent set and clique
Approximation and Online Algorithms | 2023-07-25 | Paper |
Untangling circular drawings: algorithms and complexity
Computational Geometry | 2023-06-20 | Paper |
Space-efficient algorithms for reachability in directed geometric graphs
Theoretical Computer Science | 2023-05-23 | Paper |
On the upward book thickness problem: combinatorial and complexity results
European Journal of Combinatorics | 2023-04-27 | Paper |
Parameterized study of Steiner tree on unit disk graphs
Algorithmica | 2023-04-21 | Paper |
| Planar Bichromatic Bottleneck Spanning Trees | 2023-02-07 | Paper |
scientific article; zbMATH DE number 7651158 (Why is no real title available?)
(available as arXiv preprint) | 2023-02-07 | Paper |
Parameterized algorithms for queue layouts
Journal of Graph Algorithms and Applications | 2022-11-14 | Paper |
Euclidean Steiner spanners: light and sparse
SIAM Journal on Discrete Mathematics | 2022-10-06 | Paper |
The balanced connected subgraph problem for geometric intersection graphs
Theoretical Computer Science | 2022-08-25 | Paper |
The balanced connected subgraph problem
Discrete Applied Mathematics | 2022-08-04 | Paper |
Unit disk representations of embedded trees, outerplanar and multi-legged graphs
(available as arXiv preprint) | 2022-07-01 | Paper |
On the upward book thickness problem: combinatorial and complexity results
Lecture Notes in Computer Science | 2022-07-01 | Paper |
| On fair covering and hitting problems | 2022-06-08 | Paper |
Geometric systems of unbiased representatives
Information Processing Letters | 2022-04-07 | Paper |
Balanced independent and dominating sets on colored interval graphs
(available as arXiv preprint) | 2022-03-24 | Paper |
Parameterized Algorithms for Queue Layouts
Lecture Notes in Computer Science | 2021-12-01 | Paper |
Geometric planar networks on bichromatic collinear points
Theoretical Computer Science | 2021-11-18 | Paper |
Planar bichromatic bottleneck spanning trees
(available as arXiv preprint) | 2021-09-07 | Paper |
Parameterized algorithms for book embedding problems
Journal of Graph Algorithms and Applications | 2020-12-18 | Paper |
Parameterized algorithms for book embedding problems
(available as arXiv preprint) | 2020-10-26 | Paper |
On Erdős-Szekeres-type problems for \(k\)-convex point sets
European Journal of Combinatorics | 2020-09-15 | Paper |
Geometric planar networks on bichromatic points
(available as arXiv preprint) | 2020-07-21 | Paper |
Balanced connected subgraph problem in geometric intersection graphs
(available as arXiv preprint) | 2020-05-13 | Paper |
On Erdős-Szekeres-type problems for \(k\)-convex point sets
Lecture Notes in Computer Science | 2020-02-25 | Paper |
Algorithm and hardness results on liar's dominating set and \({k}\)-tuple dominating set
(available as arXiv preprint) | 2020-02-25 | Paper |
| Algorithms and hardness results for nearest neighbor problems in bicolored point sets | 2020-02-12 | Paper |
Monochromatic plane matchings in bicolored point set
Information Processing Letters | 2019-11-21 | Paper |
The balanced connected subgraph problem
Lecture Notes in Computer Science | 2019-10-10 | Paper |
Bottleneck bichromatic full Steiner trees
Information Processing Letters | 2018-12-05 | Paper |
On local structures of cubicity 2 graphs
Combinatorial Optimization and Applications | 2017-02-01 | Paper |
On a special class of boxicity 2 graphs
Algorithms and Discrete Applied Mathematics | 2015-02-19 | Paper |
