| Publication | Date of Publication | Type |
|---|
| A fast algorithm for computing a planar support for non-piercing rectangles | 2026-06-08 | Paper |
| Sweeping arrangements of non-piercing regions in the plane | 2025-11-24 | Paper |
| Settling the APX-hardness status for geometric set cover | 2025-08-05 | Paper |
| On hypergraph supports (extended abstract) | 2025-04-15 | Paper |
| scientific article; zbMATH DE number 7788585 (Why is no real title available?) | 2024-01-15 | Paper |
On the geometric priority set cover problem
Computational Geometry | 2023-06-26 | Paper |
| Improved Approximation Algorithm for Set Multicover with Non-Piercing Regions. | 2023-02-07 | Paper |
On the geometric set multicover problem
Discrete & Computational Geometry | 2022-08-25 | Paper |
| Planar Support for Non-piercing Regions and Applications | 2021-08-04 | Paper |
Constructing planar support for non-piercing regions
Discrete & Computational Geometry | 2020-10-23 | Paper |
| scientific article; zbMATH DE number 7051292 (Why is no real title available?) | 2019-05-06 | Paper |
Constant factor approximation for the weighted partial degree bounded edge packing problem
Journal of Combinatorial Optimization | 2018-12-06 | Paper |
Packing and covering with non-piercing regions
Discrete & Computational Geometry | 2018-10-30 | Paper |
On the approximability of the maximum interval constrained coloring problem
Discrete Optimization | 2018-08-17 | Paper |
| Packing and covering with non-piercing regions | 2018-03-02 | Paper |
An experimental study of different approaches to solve the market equilibrium problem
ACM Journal of Experimental Algorithmics | 2017-06-15 | Paper |
Constant factor approximation for the weighted partial degree bounded edge packing problem
Combinatorial Optimization and Applications | 2017-02-01 | Paper |
Quasi-Polynomial Time Approximation Scheme for Weighted Geometric Set Cover on Pseudodisks and Halfspaces
SIAM Journal on Computing | 2015-11-18 | Paper |
| scientific article; zbMATH DE number 6469191 (Why is no real title available?) | 2015-08-03 | Paper |
Max-coloring and online coloring with bandwidths on interval graphs
ACM Transactions on Algorithms | 2014-09-09 | Paper |
An SDP primal-dual algorithm for approximating the Lovász-theta function
Algorithmica | 2014-07-03 | Paper |
On the complexity of the highway problem
Theoretical Computer Science | 2012-11-27 | Paper |
Colouring vertices of triangle-free graphs without forests
Discrete Mathematics | 2012-03-16 | Paper |
SUB-COLORING AND HYPO-COLORING INTERVAL GRAPHS
Discrete Mathematics, Algorithms and Applications | 2010-12-15 | Paper |
On the approximability of the maximum interval constrained coloring problem
Algorithms and Computation | 2010-12-09 | Paper |
Colouring vertices of triangle-free graphs
Graph Theoretic Concepts in Computer Science | 2010-11-16 | Paper |
Sub-coloring and hypo-coloring interval graphs
Graph-Theoretic Concepts in Computer Science | 2010-01-21 | Paper |
On profit-maximizing pricing for the highway and tollbooth problems
Algorithmic Game Theory | 2009-12-01 | Paper |
Approximating interval coloring and max-coloring in chordal graphs
ACM Journal of Experimental Algorithmics | 2008-06-20 | Paper |
Algorithms – ESA 2005
Lecture Notes in Computer Science | 2006-06-27 | Paper |
Automata, Languages and Programming
Lecture Notes in Computer Science | 2006-01-10 | Paper |
On Hypergraph Supports
(available as arXiv preprint) | N/A | Paper |
