| Publication | Date of Publication | Type |
|---|
| Minimum consistent subset in trees and interval graphs | 2026-06-12 | Paper |
| Cuts in graphs with matroid constraints | 2026-05-26 | Paper |
| Tractability of packing vertex-disjoint a-paths under length constraints | 2026-05-12 | Paper |
Dominator coloring and CD coloring in almost cluster graphs
Journal of Computer and System Sciences | 2025-03-26 | Paper |
| Parameterized complexity of non-separating and non-disconnecting paths and sets | 2024-08-06 | Paper |
Dominator coloring and CD coloring in almost cluster graphs
Lecture Notes in Computer Science | 2024-01-16 | Paper |
| scientific article; zbMATH DE number 7788585 (Why is no real title available?) | 2024-01-15 | Paper |
On colorful vertex and edge cover problems
Algorithmica | 2023-12-13 | Paper |
On the geometric priority set cover problem
Computational Geometry | 2023-06-26 | Paper |
Structural parameterizations of budgeted graph coloring
Theoretical Computer Science | 2023-04-20 | Paper |
| Optimal strategies in single round Voronoi game on convex polygons with constraints | 2023-03-21 | Paper |
Parameterized algorithms for finding highly connected solution
Theoretical Computer Science | 2022-12-21 | Paper |
Parameterized algorithms for finding highly connected solution
Computer Science – Theory and Applications | 2022-11-11 | Paper |
Structural parameterizations of budgeted graph coloring
WALCOM: Algorithms and Computation | 2022-07-13 | Paper |
| On fair covering and hitting problems | 2022-06-08 | Paper |
Geometric systems of unbiased representatives
Information Processing Letters | 2022-04-07 | Paper |
Geometric planar networks on bichromatic collinear points
Theoretical Computer Science | 2021-11-18 | Paper |
Voronoi game on polygons
Theoretical Computer Science | 2021-08-11 | Paper |
Fixed-parameter tractability of (n-k) list coloring
Theory of Computing Systems | 2021-06-11 | Paper |
Network optimization on partitioned pairs of points
(available as arXiv preprint) | 2020-11-25 | Paper |
Fixed-parameter tractable algorithms for tracking shortest paths
Theoretical Computer Science | 2020-11-06 | Paper |
Approximation algorithms for geometric conflict free covering problems
Computational Geometry | 2020-10-23 | Paper |
Sensor network topology design and analysis for efficient data gathering by a mobile mule
Algorithmica | 2020-10-12 | Paper |
Geometric planar networks on bichromatic points
(available as arXiv preprint) | 2020-07-21 | Paper |
| Some (in)tractable parameterizations of coloring and list-coloring | 2020-07-07 | Paper |
Tracking paths
Discrete Applied Mathematics | 2020-06-05 | Paper |
List-coloring -- parameterizing from triviality
Theoretical Computer Science | 2020-04-22 | Paper |
Fixed-parameter tractability of \((n-k)\) list coloring
Lecture Notes in Computer Science | 2020-02-25 | Paper |
A polynomial sized kernel for tracking paths problem
LATIN 2018: Theoretical Informatics | 2020-02-12 | Paper |
The 1-dimensional discrete Voronoi game
Operations Research Letters | 2020-02-10 | Paper |
A polynomial sized kernel for tracking paths problem
Algorithmica | 2020-01-16 | Paper |
Parameterized complexity of geometric covering problems having conflicts
Algorithmica | 2020-01-16 | Paper |
The discrete Voronoi game in a simple polygon
Theoretical Computer Science | 2019-10-07 | Paper |
The discrete Voronoi game in \(\mathbb{R}^2\)
Computational Geometry | 2018-11-01 | Paper |
Selecting and covering colored points
Discrete Applied Mathematics | 2018-10-26 | Paper |
Fréchet distance between a line and avatar point set
Algorithmica | 2018-07-26 | Paper |
| Fixed-parameter tractable algorithms for tracking set problems | 2018-06-05 | Paper |
| Fréchet distance between a line and avatar point set | 2018-04-19 | Paper |
Discrete Voronoi games and -nets, in two and three dimensions
Computational Geometry | 2018-01-19 | Paper |
The p-center problem in tree networks revisited
(available as arXiv preprint) | 2017-10-17 | Paper |
Parameterized complexity of geometric covering problems having conflicts
Lecture Notes in Computer Science | 2017-09-22 | Paper |
Tracking paths
Lecture Notes in Computer Science | 2017-07-21 | Paper |
Polynomial time algorithms for bichromatic problems
Algorithms and Discrete Applied Mathematics | 2017-04-07 | Paper |
Choice is hard
Algorithms and Computation | 2016-01-11 | Paper |
Voronoi game on graphs
Theoretical Computer Science | 2014-12-02 | Paper |
Minimum enclosing circle of a set of fixed points and a mobile point
Computational Geometry | 2014-08-13 | Paper |
Two-round discrete Voronoi game along a line
Frontiers in Algorithmics and Algorithmic Aspects in Information and Management | 2014-04-03 | Paper |
Optimal strategies for the one-round discrete Voronoi game on a line
Journal of Combinatorial Optimization | 2013-12-09 | Paper |
| An Existential Proof of the Conjecture on Packing Anchored Rectangles | 2013-10-31 | Paper |
The discrete Voronoi game in a simple polygon
Lecture Notes in Computer Science | 2013-06-11 | Paper |
Voronoi game on graphs
WALCOM: Algorithms and Computation | 2013-04-12 | Paper |
Optimal strategies for the one-round discrete Voronoi game on a line
Lecture Notes in Computer Science | 2011-08-17 | Paper |
Minimum enclosing circle of a set of fixed points and a mobile point
WALCOM: Algorithms and Computation | 2011-02-20 | Paper |
