| Publication | Date of Publication | Type |
|---|
| Scalable auction algorithms for bipartite maximum matching problems | 2025-01-14 | Paper |
On the cost of essentially fair clusterings
(available as arXiv preprint) | 2023-02-03 | Paper |
Designing multi-commodity flow trees
Lecture Notes in Computer Science | 2023-01-18 | Paper |
Facility location with dynamic distance functions
Algorithm Theory — SWAT'98 | 2022-12-09 | Paper |
LP-based approximation for uniform capacitated facility location problem
Discrete Optimization | 2022-09-15 | Paper |
| Constant factor approximation algorithm for uniform hard capacitated knapsack median problem | 2022-07-21 | Paper |
Multi-transversals for Triangles and the Tuza's Conjecture
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
On scheduling coflows
Algorithmica | 2020-11-11 | Paper |
Select and permute: an improved online framework for scheduling to minimize weighted completion time
Lecture Notes in Computer Science | 2020-02-12 | Paper |
Min-max correlation clustering via multicut
(available as arXiv preprint) | 2020-02-06 | Paper |
Analyzing the optimal neighborhood: algorithms for partial and budgeted connected dominating set problems
SIAM Journal on Discrete Mathematics | 2020-01-17 | Paper |
Approximation algorithms for graph augmentation
Automata, Languages and Programming | 2019-12-04 | Paper |
Select and permute: an improved online framework for scheduling to minimize weighted completion time
Theoretical Computer Science | 2019-10-18 | Paper |
A min-edge cost flow framework for capacitated covering problems
2013 Proceedings of the Fifteenth Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-12 | Paper |
Analyzing the optimal neighborhood: algorithms for budgeted and partial connected dominating set problems
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-06-20 | Paper |
Revisiting connected dominating sets: an almost optimal local information algorithm
Algorithmica | 2019-05-17 | Paper |
A network-flow technique for finding low-weight bounded-degree spanning trees
Lecture Notes in Computer Science | 2019-01-11 | Paper |
Graphbots: mobility in discrete spaces
Automata, Languages and Programming | 2019-01-10 | Paper |
Facility location with red-blue demands
Operations Research Letters | 2018-09-28 | Paper |
Scheduling distributed clusters of parallel machines : primal-dual and LP-based approximation algorithms
Algorithmica | 2018-07-26 | Paper |
Scheduling distributed clusters of parallel machines : primal-dual and LP-based approximation algorithms
Algorithmica | 2018-07-26 | Paper |
| Revisiting connected dominating sets: an optimal local algorithm? | 2018-04-19 | Paper |
| Scheduling distributed clusters of parallel machines: primal-dual and LP-based approximation algorithms | 2018-03-02 | Paper |
LP rounding and combinatorial algorithms for minimizing active and busy time
Journal of Scheduling | 2018-02-28 | Paper |
The capacitated \(K\)-center problem (extended abstract)
Algorithms — ESA '96 | 2017-12-05 | Paper |
Approximation algorithms for connected dominating sets
Algorithms — ESA '96 | 2017-12-05 | Paper |
| Generalized machine activation problems | 2017-09-29 | Paper |
| Busy time scheduling on a bounded number of machines (extended abstract) | 2017-09-22 | Paper |
| On scheduling coflows (extended abstract) | 2017-08-31 | Paper |
On correcting inputs: inverse optimization for online structured prediction
(available as arXiv preprint) | 2017-07-13 | Paper |
Low degree spanning trees of small weight
Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94 | 2016-09-01 | Paper |
Addendum to ``An \(O(|V|^{2})\) algorithm for single connectedness
Information Processing Letters | 2016-06-16 | Paper |
New approximation results for resource replication problems
Algorithmica | 2016-04-06 | Paper |
| scientific article; zbMATH DE number 6469246 (Why is no real title available?) | 2015-08-03 | Paper |
A model for minimizing active processor time
Algorithmica | 2015-01-19 | Paper |
Approximation algorithms for data placement on parallel disks
ACM Transactions on Algorithms | 2014-11-18 | Paper |
Achieving anonymity via clustering
ACM Transactions on Algorithms | 2014-11-18 | Paper |
To fill or not to fill, the gas station problem
ACM Transactions on Algorithms | 2014-09-09 | Paper |
Broadcast scheduling, algorithms and complexity
ACM Transactions on Algorithms | 2014-09-09 | Paper |
| scientific article; zbMATH DE number 6297793 (Why is no real title available?) | 2014-05-22 | Paper |
Optimal batch schedules for parallel machines
Lecture Notes in Computer Science | 2013-08-12 | Paper |
Set cover revisited: hypergraph cover with hard capacities
Automata, Languages, and Programming | 2013-08-12 | Paper |
New Approximation Results for Resource Replication Problems
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2012-11-02 | Paper |
A model for minimizing active processor time
Lecture Notes in Computer Science | 2012-09-25 | Paper |
Performance tradeoffs in structured peer to peer streaming
Journal of Parallel and Distributed Computing | 2012-07-13 | Paper |
The load-distance balancing problem
Networks | 2012-06-18 | Paper |
Improved approximation algorithms for data migration
Algorithmica | 2012-04-26 | Paper |
Relay placement for fault tolerance in wireless networks in higher dimensions
Computational Geometry | 2011-03-25 | Paper |
Energy efficient monitoring in sensor networks
Algorithmica | 2011-03-02 | Paper |
New models and algorithms for throughput maximization in broadcast scheduling (extended abstract)
Approximation and Online Algorithms | 2011-02-15 | Paper |
A robust maximum completion time measure for scheduling
Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 | 2010-08-16 | Paper |
| scientific article; zbMATH DE number 5764814 (Why is no real title available?) | 2010-08-06 | Paper |
Broadcasting on networks of workstations
Algorithmica | 2010-05-28 | Paper |
Approximation algorithms for channel allocation problems in broadcast networks
Lecture Notes in Computer Science | 2010-05-26 | Paper |
Algorithms - ESA 2003
Lecture Notes in Computer Science | 2010-03-03 | Paper |
FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
Lecture Notes in Computer Science | 2009-08-06 | Paper |
On Finding Dense Subgraphs
Automata, Languages and Programming | 2009-07-14 | Paper |
Dependent rounding and its applications to approximation algorithms
Journal of the ACM | 2008-12-21 | Paper |
Streaming Algorithms for k-Center Clustering with Outliers and with Anonymity
Lecture Notes in Computer Science | 2008-11-27 | 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 |
Computing most probable worlds of action probabilistic logic programs: scalable estimation for \(10^{30,000}\) worlds
Annals of Mathematics and Artificial Intelligence | 2008-04-21 | Paper |
Energy Efficient Monitoring in Sensor Networks
Lecture Notes in Computer Science | 2008-04-15 | Paper |
Improved Algorithms for Data Migration
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2007-08-28 | Paper |
Broadcasting in heterogeneous networks
Algorithmica | 2007-07-19 | Paper |
Data migration on parallel disks: Algorithms and evaluation
Algorithmica | 2007-06-21 | Paper |
Approximating the minimal sensor selection for supervisory control
Discrete Event Dynamic Systems | 2006-11-17 | Paper |
Algorithms for non-uniform size data placement on parallel disks
Journal of Algorithms | 2006-10-05 | Paper |
Approximation algorithms for channel allocation problems in broadcast networks
Networks | 2006-09-12 | Paper |
On generalized gossiping and broadcasting
Journal of Algorithms | 2006-06-30 | Paper |
Algorithms – ESA 2005
Lecture Notes in Computer Science | 2006-06-27 | Paper |
An improved approximation algorithm for vertex cover with hard capacities
Journal of Computer and System Sciences | 2006-01-10 | Paper |
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Lecture Notes in Computer Science | 2005-08-25 | Paper |
Algorithms – ESA 2004
Lecture Notes in Computer Science | 2005-08-18 | Paper |
Algorithms for Data Migration with Cloning
SIAM Journal on Computing | 2005-02-21 | Paper |
Equivalence of two linear programming relaxations for broadcast scheduling.
Operations Research Letters | 2005-01-11 | Paper |
| scientific article; zbMATH DE number 2119644 (Why is no real title available?) | 2004-11-29 | Paper |
| scientific article; zbMATH DE number 2119748 (Why is no real title available?) | 2004-11-29 | Paper |
Approximation algorithms for partial covering problems
Journal of Algorithms | 2004-11-12 | Paper |
Algorithms for minimizing response time in broadcast scheduling
Algorithmica | 2004-09-22 | Paper |
| scientific article; zbMATH DE number 2086938 (Why is no real title available?) | 2004-08-11 | Paper |
Capacitated vertex covering
Journal of Algorithms | 2004-03-14 | Paper |
| scientific article; zbMATH DE number 2038708 (Why is no real title available?) | 2004-02-08 | Paper |
On Local Search and Placement of Meters in Networks
SIAM Journal on Computing | 2003-06-19 | Paper |
The General Steiner Tree-Star problem.
Information Processing Letters | 2003-01-21 | Paper |
Improved methods for approximating node weighted Steiner trees and connected dominating sets.
Information and Computation | 2003-01-14 | Paper |
| scientific article; zbMATH DE number 1775420 (Why is no real title available?) | 2002-08-01 | Paper |
The budgeted maximum coverage problem
Information Processing Letters | 2002-07-25 | Paper |
An \(O(|V|^2)\) algorithm for single connectedness
Information Processing Letters | 2002-07-25 | Paper |
\(z\)-approximations
Journal of Algorithms | 2002-07-08 | Paper |
| scientific article; zbMATH DE number 1754596 (Why is no real title available?) | 2002-06-12 | Paper |
Algorithms for capacitated vehicle routing
SIAM Journal on Computing | 2002-04-23 | Paper |
| Algorithms for facility location problems with outliers. (Extended abstract) | 2002-01-30 | Paper |
| scientific article; zbMATH DE number 1563034 (Why is no real title available?) | 2001-09-18 | Paper |
| scientific article; zbMATH DE number 1263280 (Why is no real title available?) | 2001-08-28 | Paper |
Optimal collective dichotomous choice under partial order constraints
Mathematical Social Sciences | 2001-07-29 | Paper |
Centers of sets of pixels
Discrete Applied Mathematics | 2001-01-15 | Paper |
Approximation algorithms with bounded performance guarantees for the clustered traveling salesman problem
Algorithmica | 2000-11-14 | Paper |
| scientific article; zbMATH DE number 1305491 (Why is no real title available?) | 2000-10-17 | Paper |
Fault tolerant \(K\)-center problems
Theoretical Computer Science | 2000-08-21 | Paper |
| scientific article; zbMATH DE number 1263175 (Why is no real title available?) | 2000-08-03 | Paper |
The Capacitated K-Center Problem
SIAM Journal on Discrete Mathematics | 2000-07-20 | Paper |
On the parallel complexity of digraph reachability
Information Processing Letters | 2000-06-21 | Paper |
| scientific article; zbMATH DE number 1303608 (Why is no real title available?) | 2000-05-25 | Paper |
| scientific article; zbMATH DE number 1445307 (Why is no real title available?) | 2000-05-10 | Paper |
| scientific article; zbMATH DE number 1445319 (Why is no real title available?) | 2000-05-10 | Paper |
| scientific article; zbMATH DE number 1261809 (Why is no real title available?) | 2000-04-26 | Paper |
| scientific article; zbMATH DE number 1302021 (Why is no real title available?) | 2000-01-18 | Paper |
Greedy Strikes Back: Improved Facility Location Algorithms
Journal of Algorithms | 2000-01-09 | Paper |
The Loading Time Scheduling Problem
Journal of Algorithms | 2000-01-01 | Paper |
| scientific article; zbMATH DE number 1302025 (Why is no real title available?) | 1999-09-26 | Paper |
| scientific article; zbMATH DE number 1305527 (Why is no real title available?) | 1999-06-17 | Paper |
| scientific article; zbMATH DE number 1256696 (Why is no real title available?) | 1999-04-22 | Paper |
Facility location with dynamic distance functions
Journal of Combinatorial Optimization | 1999-03-28 | Paper |
| scientific article; zbMATH DE number 1163715 (Why is no real title available?) | 1998-10-01 | Paper |
Approximation algorithms for connected dominating sets
Algorithmica | 1998-09-08 | Paper |
| scientific article; zbMATH DE number 1003248 (Why is no real title available?) | 1997-08-03 | Paper |
Landmarks in graphs
Discrete Applied Mathematics | 1997-07-07 | Paper |
On strongly connected digraphs with bounded cycle length
Discrete Applied Mathematics | 1997-04-07 | Paper |
Efficient Minimum Cost Matching and Transportation Using the Quadrangle Inequality
Journal of Algorithms | 1996-11-04 | Paper |
Low-Degree Spanning Trees of Small Weight
SIAM Journal on Computing | 1996-11-03 | Paper |
Improved Approximation Algorithms for Uniform Connectivity Problems
Journal of Algorithms | 1996-10-16 | Paper |
Balancing minimum spanning trees and shortest-path trees
Algorithmica | 1996-03-11 | Paper |
Approximating the Minimum Equivalent Digraph
SIAM Journal on Computing | 1995-11-01 | Paper |
Biconnectivity approximations and graph carvings
Journal of the ACM | 1995-10-09 | Paper |
A simple randomized sieve algorithm for the closest-pair problem
Information and Computation | 1995-05-28 | Paper |
On-line algorithms for weighted bipartite matching and stable marriages
Theoretical Computer Science | 1995-02-09 | Paper |
A Primal-Dual Parallel Approximation Technique Applied to Weighted Set and Vertex Covers
Journal of Algorithms | 1994-11-30 | Paper |
| scientific article; zbMATH DE number 431512 (Why is no real title available?) | 1994-11-29 | Paper |
Designing multi-commodity flow trees
Information Processing Letters | 1994-05-03 | Paper |
Geometric Knapsack problems
Algorithmica | 1994-02-17 | Paper |
| scientific article; zbMATH DE number 437549 (Why is no real title available?) | 1994-01-02 | Paper |
Flow in planar graphs with vertex capacities
Algorithmica | 1994-01-01 | Paper |
The Lattice Structure of Flow in Planar Graphs
SIAM Journal on Discrete Mathematics | 1993-10-14 | Paper |
| scientific article; zbMATH DE number 176778 (Why is no real title available?) | 1993-05-18 | Paper |
| scientific article; zbMATH DE number 177546 (Why is no real title available?) | 1993-05-18 | Paper |
Approximation Algorithms for Graph Augmentation
Journal of Algorithms | 1993-05-16 | Paper |
| scientific article; zbMATH DE number 140477 (Why is no real title available?) | 1993-03-28 | Paper |
On independent spanning trees
Information Processing Letters | 1993-01-16 | Paper |
Processor Efficient Parallel Algorithms for the Two Disjoint Paths Problem and for Finding a Kuratowski Homeomorph
SIAM Journal on Computing | 1993-01-16 | Paper |
Efficient Parallel Algorithms for Testingkand Finding Disjoints-tPaths in Graphs
SIAM Journal on Computing | 1991-01-01 | Paper |
Planar graph coloring is not self-reducible, assuming P\(\neq NP\)
Theoretical Computer Science | 1991-01-01 | Paper |
Extending planar graph algorithms to \(K_{3,3}\)-free graphs
Information and Computation | 1990-01-01 | Paper |
On a triangle counting problem
Information Processing Letters | 1990-01-01 | Paper |
Coloring algorithms for \(K_ 5\)-minor free graphs
Information Processing Letters | 1990-01-01 | Paper |
On computing graph closures
Information Processing Letters | 1989-01-01 | Paper |
| scientific article; zbMATH DE number 4090822 (Why is no real title available?) | 1988-01-01 | Paper |
A network-flow technique for finding low-weight bounded-degree spanning trees
Journal of Algorithms | 0001-01-03 | Paper |
