| Publication | Date of Publication | Type |
|---|
| Approximating the minimum logarithmic arrangement problem | 2024-09-11 | Paper |
| Nested active-time scheduling | 2024-09-11 | Paper |
scientific article; zbMATH DE number 7788615 (Why is no real title available?)
(available as arXiv preprint) | 2024-01-15 | Paper |
The ad types problem
(available as arXiv preprint) | 2023-03-21 | Paper |
Barrier Coverage with Uniform Radii in 2D
Algorithms for Sensor Systems | 2022-12-09 | Paper |
Bounded-degree light approximate shortest-path trees in doubling metrics
Discrete Applied Mathematics | 2021-10-21 | Paper |
| Tight approximation for the minimum bottleneck generalized matching problem | 2021-04-21 | Paper |
| An optimal lower bound for hierarchical universal solutions for TSP on the plane | 2021-04-21 | Paper |
Barrier coverage with non-uniform lengths to minimize aggregate movements
(available as arXiv preprint) | 2020-11-25 | Paper |
| Precedence-Constrained Min Sum Set Cover | 2020-11-25 | Paper |
A polynomial delay algorithm for enumerating approximate solutions to the interval constrained coloring problem
2010 Proceedings of the Twelfth Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-11 | Paper |
Turbocharging treewidth heuristics
Algorithmica | 2019-02-14 | Paper |
On the intersection of independence systems
Operations Research Letters | 2018-09-28 | Paper |
Approximating weighted induced matchings
Discrete Applied Mathematics | 2018-05-24 | Paper |
How unsplittable-flow-covering helps scheduling with job-dependent cost functions
Algorithmica | 2018-05-23 | Paper |
How unsplittable-flow-covering helps scheduling with job-dependent cost functions
Algorithmica | 2018-05-23 | Paper |
| Turbocharging treewidth heuristics | 2018-04-10 | Paper |
Approximating weighted neighborhood independent sets
Information Processing Letters | 2017-11-22 | Paper |
A primal-dual approximation algorithm for Min-sum single-machine scheduling problems
SIAM Journal on Discrete Mathematics | 2017-05-24 | Paper |
Instance-sensitive robustness guarantees for sequencing with unknown packing and covering constraints (extended abstract)
Proceedings of the 4th conference on Innovations in Theoretical Computer Science | 2017-05-16 | Paper |
Parametric packing of selfish items and the subset sum algorithm
Algorithmica | 2016-03-23 | Paper |
Weighted popular matchings
ACM Transactions on Algorithms | 2015-08-14 | Paper |
A polynomial-delay algorithm for enumerating approximate solutions to the interval constrained coloring problem
ACM Journal of Experimental Algorithmics | 2015-03-16 | Paper |
On tree-constrained matchings and generalizations
Algorithmica | 2015-03-02 | Paper |
Parametrized algorithms for random serial dictatorship
Mathematical Social Sciences | 2014-12-09 | Paper |
To fill or not to fill, the gas station problem
ACM Transactions on Algorithms | 2014-09-09 | Paper |
Optimization problems in dotted interval graphs
Discrete Applied Mathematics | 2014-08-22 | Paper |
How Unsplittable-Flow-Covering Helps Scheduling with Job-Dependent Cost Functions
Automata, Languages, and Programming | 2014-07-01 | Paper |
| Lagrangian relaxation and partial cover (Extended abstract) | 2013-03-19 | Paper |
When LP is the cure for your matching woes: improved bounds for stochastic matchings
Algorithmica | 2012-12-06 | Paper |
Optimization problems in dotted interval graphs
Graph-Theoretic Concepts in Computer Science | 2012-11-06 | Paper |
The checkpoint problem
Theoretical Computer Science | 2012-10-11 | Paper |
Max-coloring paths: tight bounds and extensions
Journal of Combinatorial Optimization | 2012-10-01 | Paper |
Universal sequencing on an unreliable machine
SIAM Journal on Computing | 2012-09-12 | Paper |
| Improved approximations for guarding 1.5-dimensional terrains | 2012-04-24 | Paper |
Improved approximation guarantees for weighted matching in the semi-streaming model
SIAM Journal on Discrete Mathematics | 2012-03-15 | Paper |
| IMPROVED APPROXIMATION GUARANTEES FOR WEIGHTED MATCHING IN THE SEMI-STREAMING MODEL * | 2012-01-23 | Paper |
Approximation algorithms for the interval constrained coloring problem
Algorithmica | 2011-09-20 | Paper |
Approximation of Partial Capacitated Vertex Cover
SIAM Journal on Discrete Mathematics | 2011-07-18 | Paper |
On tree-constrained matchings and generalizations
Automata, Languages and Programming | 2011-07-06 | Paper |
Popular mixed matchings
Theoretical Computer Science | 2011-06-07 | Paper |
Improved approximations for guarding 1.5-dimensional terrains
Algorithmica | 2011-05-10 | Paper |
Adaptive local ratio
SIAM Journal on Computing | 2011-04-04 | Paper |
Assigning papers to referees
Algorithmica | 2010-10-07 | Paper |
The checkpoint problem
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2010-09-10 | Paper |
When LP is the cure for your matching woes: improved bounds for stochastic matchings (extended abstract)
Algorithms – ESA 2010 | 2010-09-06 | Paper |
| scientific article; zbMATH DE number 5764847 (Why is no real title available?) | 2010-08-06 | Paper |
Universal sequencing on a single machine
Integer Programming and Combinatorial Optimization | 2010-06-22 | Paper |
On the multi-radius cover problem
Information Processing Letters | 2010-01-29 | Paper |
Max-coloring paths: tight bounds and extensions
Algorithms and Computation | 2009-12-17 | Paper |
A primal-dual approximation algorithm for partial vertex cover: Making educated guesses
Algorithmica | 2009-07-24 | Paper |
Popular Mixed Matchings
Automata, Languages and Programming | 2009-07-14 | Paper |
Combinatorial algorithms for data migration to minimize average completion time
Algorithmica | 2009-06-16 | Paper |
Weighted Popular Matchings
Automata, Languages and Programming | 2009-03-12 | Paper |
An Optimal Incremental Algorithm for Minimizing Lateness with Rejection
Algorithms - ESA 2008 | 2008-11-25 | Paper |
To Fill or Not to Fill: The Gas Station Problem
Algorithms – ESA 2007 | 2008-09-25 | Paper |
Approximation of Partial Capacitated Vertex Cover
Algorithms – ESA 2007 | 2008-09-25 | Paper |
Approximating the Interval Constrained Coloring Problem
Algorithm Theory – SWAT 2008 | 2008-07-15 | Paper |
Greedy in Approximation Algorithms
Lecture Notes in Computer Science | 2008-03-11 | Paper |
Combinatorial Algorithms for Data Migration to Minimize Average Completion Time
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2007-08-28 | Paper |
| Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques | 2006-07-07 | Paper |
