| Publication | Date of Publication | Type |
|---|
| 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 | 2024-10-01 | Paper |
| Minimum link fencing | 2024-09-11 | Paper |
| An Algorithmic Study of Fully Dynamic Independent Sets for Map Labeling | 2024-04-14 | Paper |
| Online Spanners in Metric Spaces | 2024-03-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6147516 | 2024-01-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6187831 | 2024-01-15 | Paper |
| On colorful vertex and edge cover problems | 2023-12-13 | Paper |
| Parameterized Study of Steiner Tree on Unit Disk Graphs | 2023-11-02 | Paper |
| Online Euclidean Spanners | 2023-09-20 | Paper |
| On streaming algorithms for geometric independent set and clique | 2023-07-25 | Paper |
| Untangling circular drawings: algorithms and complexity | 2023-06-20 | Paper |
| Space-efficient algorithms for reachability in directed geometric graphs | 2023-05-23 | Paper |
| On the upward book thickness problem: combinatorial and complexity results | 2023-04-27 | Paper |
| Parameterized study of Steiner tree on unit disk graphs | 2023-04-21 | Paper |
| Planar Bichromatic Bottleneck Spanning Trees | 2023-02-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5874486 | 2023-02-07 | Paper |
| Parameterized Algorithms for Queue Layouts | 2022-11-14 | Paper |
| Euclidean Steiner Spanners: Light and Sparse | 2022-10-06 | Paper |
| The balanced connected subgraph problem for geometric intersection graphs | 2022-08-25 | Paper |
| The balanced connected subgraph problem | 2022-08-04 | Paper |
| Unit disk representations of embedded trees, outerplanar and multi-legged graphs | 2022-07-01 | Paper |
| On the upward book thickness problem: combinatorial and complexity results | 2022-07-01 | Paper |
| On fair covering and hitting problems | 2022-06-08 | Paper |
| Geometric systems of unbiased representatives | 2022-04-07 | Paper |
| Balanced independent and dominating sets on colored interval graphs | 2022-03-24 | Paper |
| Parameterized Algorithms for Queue Layouts | 2021-12-01 | Paper |
| Geometric planar networks on bichromatic collinear points | 2021-11-18 | Paper |
| Planar bichromatic bottleneck spanning trees | 2021-09-07 | Paper |
| Parameterized Algorithms for Book Embedding Problems | 2020-12-18 | Paper |
| Parameterized algorithms for book embedding problems | 2020-10-26 | Paper |
| On Erdős-Szekeres-type problems for \(k\)-convex point sets | 2020-09-15 | Paper |
| Geometric planar networks on bichromatic points | 2020-07-21 | Paper |
| Balanced connected subgraph problem in geometric intersection graphs | 2020-05-13 | Paper |
| On Erdős-Szekeres-type problems for \(k\)-convex point sets | 2020-02-25 | Paper |
| Algorithm and hardness results on liar's dominating set and \({k}\)-tuple dominating set | 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 | 2019-11-21 | Paper |
| The balanced connected subgraph problem | 2019-10-10 | Paper |
| Bottleneck bichromatic full Steiner trees | 2018-12-05 | Paper |
| On Local Structures of Cubicity 2 Graphs | 2017-02-01 | Paper |
| On a Special Class of Boxicity 2 Graphs | 2015-02-19 | Paper |
