| Publication | Date of Publication | Type |
|---|
Scheduling split intervals with non-uniform demands
Discrete Optimization | 2021-01-15 | Paper |
| Knapsack Cover Subject to a Matroid Constraint | 2017-02-21 | Paper |
Distributed and Parallel Algorithms for Set Cover Problems with Small Neighborhood Covers
(available as arXiv preprint) | 2017-02-21 | Paper |
Density functions subject to a co-matroid constraint
(available as arXiv preprint) | 2017-01-26 | Paper |
Scheduling resources for executing a partial set of jobs
(available as arXiv preprint) | 2017-01-26 | Paper |
Fast algorithms for constrained graph density problems
WALCOM: Algorithms and Computation | 2015-02-27 | Paper |
Distributed algorithms for scheduling on line and tree networks
Proceedings of the 2012 ACM symposium on Principles of distributed computing | 2014-12-05 | Paper |
Improved algorithms for resource allocation under varying capacity
Algorithms - ESA 2014 | 2014-10-08 | Paper |
Approximation algorithms for the partition vertex cover problem
Theoretical Computer Science | 2014-10-06 | Paper |
Decision trees for entity identification, approximation algorithms and hardness results
ACM Transactions on Algorithms | 2014-09-09 | Paper |
Approximation algorithms for the partition vertex cover problem
WALCOM: Algorithms and Computation | 2013-04-12 | Paper |
| Finding irrefutable certificates for \({\mathrm{S}_2}^p\) via Arthur and Merlin | 2013-03-19 | Paper |
| Deterministically isolating a perfect matching in bipartite planar graphs | 2013-03-19 | Paper |
| Finding independent sets in unions of perfect graphs | 2012-08-29 | Paper |
Arthur and Merlin as oracles
Computational Complexity | 2011-11-30 | Paper |
Resource allocation for covering time varying demands
Algorithms – ESA 2011 | 2011-09-16 | Paper |
Scheduling Resources for Throughput Maximization
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2011-08-17 | Paper |
Contact center scheduling with strict resource requirements
Integer Programming and Combinatoral Optimization | 2011-06-24 | Paper |
Space-efficient counting in graphs on surfaces
Computational Complexity | 2011-02-18 | Paper |
The pervasive reach of resource-bounded Kolmogorov complexity in computational complexity theory
Journal of Computer and System Sciences | 2011-01-18 | Paper |
Deterministically isolating a perfect matching in bipartite planar graphs
Theory of Computing Systems | 2010-10-06 | Paper |
Approximating maximum weight \(K\)-colorable subgraphs in chordal graphs
Information Processing Letters | 2010-06-16 | Paper |
Planar and grid graph reachability problems
Theory of Computing Systems | 2009-10-19 | Paper |
Approximating Decision Trees with Multiway Branches
Automata, Languages and Programming | 2009-07-14 | Paper |
Arthur and Merlin as Oracles
Lecture Notes in Computer Science | 2009-02-03 | Paper |
Oblivious Symmetric Alternation
STACS 2006 | 2008-03-19 | Paper |
Some combinatorial and algorithmic applications of the Borsuk-Ulam theorem
Graphs and Combinatorics | 2007-07-19 | Paper |
FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
Lecture Notes in Computer Science | 2006-11-14 | Paper |
