| Publication | Date of Publication | Type |
|---|
Distributed Approximation on Power Graphs
Proceedings of the 39th Symposium on Principles of Distributed Computing | 2021-03-15 | Paper |
Growing Half-Balls: Minimizing Storage and Communication Costs in Content Delivery Networks
SIAM Journal on Discrete Mathematics | 2018-08-07 | Paper |
1.5-approximation algorithm for the 2-convex recoloring problem
Discrete Applied Mathematics | 2018-06-27 | Paper |
A Distributed (2 + ε)-Approximation for Vertex Cover in O(log Δ / ε log log Δ) Rounds
Journal of the ACM | 2018-05-17 | Paper |
Distributed approximation of maximum independent set and maximum matching
Proceedings of the ACM Symposium on Principles of Distributed Computing | 2017-10-11 | Paper |
A Distributed (2+ε)-Approximation for Vertex Cover in O(logδ/ε log log δ) Rounds
Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing | 2017-09-29 | Paper |
A constant factor approximation algorithm for the storage allocation problem
Algorithmica | 2017-05-02 | Paper |
1.5-approximation algorithm for the 2-convex recoloring problem
Lecture Notes in Computer Science | 2016-04-04 | Paper |
A unified approach to approximating resource allocation and scheduling
Journal of the ACM | 2015-10-30 | Paper |
Bandwidth allocation in cellular networks with multiple interferences
Discrete Applied Mathematics | 2015-09-01 | Paper |
A unified approach to approximating resource allocation and scheduling
Proceedings of the thirty-second annual ACM symposium on Theory of computing | 2014-09-26 | Paper |
A note on multicovering with disks
Computational Geometry | 2013-01-25 | Paper |
Growing half-balls: minimizing storage and communication costs in CDNs
Automata, Languages, and Programming | 2012-11-01 | Paper |
Minimum vertex cover in rectangle graphs
Computational Geometry | 2011-07-20 | Paper |
Approximation of Partial Capacitated Vertex Cover
SIAM Journal on Discrete Mathematics | 2011-07-18 | Paper |
An extension of the Nemhauser-Trotter theorem to generalized vertex cover with applications
SIAM Journal on Discrete Mathematics | 2011-03-15 | Paper |
Minimum vertex cover in rectangle graphs
Algorithms – ESA 2010 | 2010-09-06 | Paper |
Extension of the Nemhauser and Trotter Theorem to Generalized Vertex Cover with Applications
Approximation and Online Algorithms | 2010-05-11 | Paper |
On approximating a geometric prize-collecting traveling salesman problem with time windows (extended abstract)
Lecture Notes in Computer Science | 2010-03-03 | Paper |
Resource allocation in bounded degree trees
Algorithmica | 2009-06-16 | Paper |
A Factor-Two Approximation Algorithm for Two-Dimensional Phase Unwrapping
Journal of Graph Algorithms and Applications | 2009-01-19 | Paper |
Approximation of Partial Capacitated Vertex Cover
Algorithms – ESA 2007 | 2008-09-25 | Paper |
Improved approximation algorithm for convex recoloring of trees
Theory of Computing Systems | 2008-06-06 | Paper |
Exploiting locality: Approximating sorting buffers
Journal of Discrete Algorithms | 2008-05-29 | Paper |
Resource Allocation in Bounded Degree Trees
Lecture Notes in Computer Science | 2008-03-11 | Paper |
Using fractional primal-dual to schedule split intervals with demands
Discrete Optimization | 2007-02-20 | Paper |
Approximation and Online Algorithms
Lecture Notes in Computer Science | 2007-02-12 | Paper |
Approximation and Online Algorithms
Lecture Notes in Computer Science | 2007-02-12 | Paper |
Algorithms – ESA 2005
Lecture Notes in Computer Science | 2006-06-27 | Paper |
On the Equivalence between the Primal-Dual Schema and the Local Ratio Technique
SIAM Journal on Discrete Mathematics | 2006-06-01 | Paper |
Scheduling Split Intervals
SIAM Journal on Computing | 2006-06-01 | Paper |
scientific article; zbMATH DE number 5010629 (Why is no real title available?)
| 2006-03-09 | Paper |
On approximating a geometric prize-collecting traveling salesman problem with time windows
Journal of Algorithms | 2005-05-04 | Paper |
Approximating the dense set-cover problem
Journal of Computer and System Sciences | 2005-02-23 | Paper |
Local ratio with negative weights.
Operations Research Letters | 2005-01-11 | Paper |
scientific article; zbMATH DE number 2119734 (Why is no real title available?)
| 2004-11-29 | Paper |
scientific article; zbMATH DE number 1833399 (Why is no real title available?)
| 2002-11-21 | Paper |
Approximating element-weighted vertex deletion problems for the complete \(k\)-partite property
Journal of Algorithms | 2002-08-14 | Paper |
Computing an optimal orientation of a balanced decomposition tree for linear arrangement problems
Journal of Graph Algorithms and Applications | 2002-01-07 | Paper |
Using homogeneous weights for approximating the partial cover problem
Journal of Algorithms | 2001-12-12 | Paper |
scientific article; zbMATH DE number 1305393 (Why is no real title available?)
| 2001-12-12 | Paper |
Efficient algorithms for integer programs with two variables per constraint.
Algorithmica | 2001-09-27 | Paper |
scientific article; zbMATH DE number 1467487 (Why is no real title available?)
| 2000-07-25 | Paper |
scientific article; zbMATH DE number 1405787 (Why is no real title available?)
| 2000-06-05 | Paper |
One for the price of two: a unified approach for approximating covering problems
Algorithmica | 2000-05-09 | Paper |
Partitioning a sequence into few monotone subsequences
Acta Informatica | 1998-11-08 | Paper |
Approximation Algorithms for the Feedback Vertex Set Problem with Applications to Constraint Satisfaction and Bayesian Inference
SIAM Journal on Computing | 1998-09-20 | Paper |
scientific article; zbMATH DE number 1182761 (Why is no real title available?)
| 1998-08-02 | Paper |
scientific article; zbMATH DE number 1003266 (Why is no real title available?)
| 1997-06-01 | Paper |
A LINEAR-TIME ALGORITHM FOR COVERING SIMPLE POLYGONS WITH SIMILAR RECTANGLES
International Journal of Computational Geometry & Applications | 1996-10-21 | Paper |
TRIANGULATING DISJOINT JORDAN CHAINS
International Journal of Computational Geometry & Applications | 1995-04-06 | Paper |
Privacy, additional information and communication
IEEE Transactions on Information Theory | 1994-10-26 | Paper |
Multiple Communication in Multihop Radio Networks
SIAM Journal on Computing | 1993-10-10 | Paper |
Rotating-table games and derivatives of words
Theoretical Computer Science | 1993-05-16 | Paper |
On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization
Journal of Computer and System Sciences | 1993-01-16 | Paper |
Connections between two cycles --- a new design of dense processor interconnection networks
Discrete Applied Mathematics | 1993-01-16 | Paper |
Efficient emulation of single-hop radio network with collision detection on multi-hop radio network with no collision detection
Distributed Computing | 1991-01-01 | Paper |
Fault tolerant distributed majority commitment
Journal of Algorithms | 1988-01-01 | Paper |
scientific article; zbMATH DE number 3990855 (Why is no real title available?)
| 1987-01-01 | Paper |
On approximation problems related to the independent set and vertex cover problems
Discrete Applied Mathematics | 1984-01-01 | Paper |
Complexity of finding k-path-free dominating sets in graphs
Information Processing Letters | 1982-01-01 | Paper |
