| Publication | Date of Publication | Type |
|---|
Scheduling split intervals with non-uniform demands
Discrete Optimization | 2021-01-15 | Paper |
Set cover problems with small neighborhood covers
Theory of Computing Systems | 2019-09-05 | Paper |
Improved algorithms for resource allocation under varying capacity
Journal of Scheduling | 2018-11-07 | Paper |
Replica placement on bounded treewidth graphs
(available as arXiv preprint) | 2017-09-22 | Paper |
| Replica placement on directed acyclic graphs | 2017-04-25 | 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 |
| Replica Placement via Capacitated Vertex Cover | 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 |
New results on the computability and complexity of points-to analysis
Proceedings of the 30th ACM SIGPLAN-SIGACT symposium on Principles of programming languages | 2015-09-11 | 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 |
Decision trees for entity identification, approximation algorithms and hardness results
ACM Transactions on Algorithms | 2014-09-09 | Paper |
| Finding irrefutable certificates for \({\mathrm{S}_2}^p\) via Arthur and Merlin | 2013-03-19 | Paper |
Efficient decentralized algorithms for the distributed trigger counting problem
Theory of Computing Systems | 2012-12-07 | Paper |
| A near-linear time constant factor algorithm for unsplittable flow problem on line with bag constraints | 2012-08-29 | 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 |
Approximating maximum weight \(K\)-colorable subgraphs in chordal graphs
Information Processing Letters | 2010-06-16 | 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 |
STACS 2004
Lecture Notes in Computer Science | 2007-10-01 | Paper |
Time-space tradeoff in derandomizing probabilistic logspace
Theory of Computing Systems | 2006-10-25 | Paper |
On zero error algorithms having oracle access to one query
Journal of Combinatorial Optimization | 2006-08-14 | Paper |
Computing and Combinatorics
Lecture Notes in Computer Science | 2006-01-11 | Paper |
Competing provers yield improved Karp-Lipton collapse results
Information and Computation | 2005-05-04 | Paper |
| scientific article; zbMATH DE number 2087044 (Why is no real title available?) | 2004-08-11 | Paper |
On the non-approximability of points-to analysis
Acta Informatica | 2003-09-01 | Paper |
| scientific article; zbMATH DE number 1962842 (Why is no real title available?) | 2003-08-11 | Paper |
| scientific article; zbMATH DE number 1953137 (Why is no real title available?) | 2003-07-25 | Paper |
| scientific article; zbMATH DE number 1234889 (Why is no real title available?) | 1999-04-11 | Paper |
| scientific article; zbMATH DE number 1064113 (Why is no real title available?) | 1997-11-20 | Paper |
