| Publication | Date of Publication | Type |
|---|
| Scalable auction algorithms for bipartite maximum matching problems | 2025-01-14 | Paper |
| On the cost of essentially fair clusterings | 2023-02-03 | Paper |
| Designing multi-commodity flow trees | 2023-01-18 | Paper |
| Facility location with dynamic distance functions | 2022-12-09 | Paper |
| LP-based approximation for uniform capacitated facility location problem | 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 | 2021-02-02 | Paper |
| On scheduling coflows | 2020-11-11 | Paper |
| Select and permute: an improved online framework for scheduling to minimize weighted completion time | 2020-02-12 | Paper |
| Min-max correlation clustering via multicut | 2020-02-06 | Paper |
| Analyzing the Optimal Neighborhood: Algorithms for Partial and Budgeted Connected Dominating Set Problems | 2020-01-17 | Paper |
| Approximation algorithms for graph augmentation | 2019-12-04 | Paper |
| Select and permute: an improved online framework for scheduling to minimize weighted completion time | 2019-10-18 | Paper |
| A Min-Edge Cost Flow Framework for Capacitated Covering Problems | 2019-09-12 | Paper |
| Analyzing the Optimal Neighborhood: Algorithms for Budgeted and Partial Connected Dominating Set Problems | 2019-06-20 | Paper |
| Revisiting connected dominating sets: an almost optimal local information algorithm | 2019-05-17 | Paper |
| A Network-Flow Technique for Finding Low-Weight Bounded-Degree Spanning Trees | 2019-01-11 | Paper |
| Graphbots: Mobility in discrete spaces | 2019-01-10 | Paper |
| Facility location with red-blue demands | 2018-09-28 | Paper |
| Scheduling distributed clusters of parallel machines : primal-dual and LP-based approximation algorithms | 2018-07-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4636441 | 2018-04-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4606340 | 2018-03-02 | Paper |
| LP rounding and combinatorial algorithms for minimizing active and busy time | 2018-02-28 | Paper |
| Approximation algorithms for connected dominating sets | 2017-12-05 | Paper |
| The capacitated K-center problem | 2017-12-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5365023 | 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 | 2017-07-13 | Paper |
| Low degree spanning trees of small weight | 2016-09-01 | Paper |
| Addendum to ``An \(O(|V|^{2})\) algorithm for single connectedness | 2016-06-16 | Paper |
| New approximation results for resource replication problems | 2016-04-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501365 | 2015-08-03 | Paper |
| A model for minimizing active processor time | 2015-01-19 | Paper |
| Approximation algorithms for data placement on parallel disks | 2014-11-18 | Paper |
| Achieving anonymity via clustering | 2014-11-18 | Paper |
| Broadcast scheduling | 2014-09-09 | Paper |
| To fill or not to fill | 2014-09-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5417714 | 2014-05-22 | Paper |
| Optimal Batch Schedules for Parallel Machines | 2013-08-12 | Paper |
| Set Cover Revisited: Hypergraph Cover with Hard Capacities | 2013-08-12 | Paper |
| New Approximation Results for Resource Replication Problems | 2012-11-02 | Paper |
| A model for minimizing active processor time | 2012-09-25 | Paper |
| Performance tradeoffs in structured peer to peer streaming | 2012-07-13 | Paper |
| The load-distance balancing problem | 2012-06-18 | Paper |
| Improved approximation algorithms for data migration | 2012-04-26 | Paper |
| Relay placement for fault tolerance in wireless networks in higher dimensions | 2011-03-25 | Paper |
| Energy efficient monitoring in sensor networks | 2011-03-02 | Paper |
| New Models and Algorithms for Throughput Maximization in Broadcast Scheduling | 2011-02-15 | Paper |
| A robust maximum completion time measure for scheduling | 2010-08-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3579403 | 2010-08-06 | Paper |
| Broadcasting on networks of workstations | 2010-05-28 | Paper |
| Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques | 2010-05-26 | Paper |
| Algorithms - ESA 2003 | 2010-03-03 | Paper |
| FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science | 2009-08-06 | Paper |
| On Finding Dense Subgraphs | 2009-07-14 | Paper |
| Dependent rounding and its applications to approximation algorithms | 2008-12-21 | Paper |
| Streaming Algorithms for k-Center Clustering with Outliers and with Anonymity | 2008-11-27 | Paper |
| An Optimal Incremental Algorithm for Minimizing Lateness with Rejection | 2008-11-25 | Paper |
| To Fill or Not to Fill: The Gas Station Problem | 2008-09-25 | Paper |
| Computing most probable worlds of action probabilistic logic programs: scalable estimation for \(10^{30,000}\) worlds | 2008-04-21 | Paper |
| Energy Efficient Monitoring in Sensor Networks | 2008-04-15 | Paper |
| Improved Algorithms for Data Migration | 2007-08-28 | Paper |
| Broadcasting in heterogeneous networks | 2007-07-19 | Paper |
| Data migration on parallel disks: Algorithms and evaluation | 2007-06-21 | Paper |
| Approximating the minimal sensor selection for supervisory control | 2006-11-17 | Paper |
| Algorithms for non-uniform size data placement on parallel disks | 2006-10-05 | Paper |
| Approximation algorithms for channel allocation problems in broadcast networks | 2006-09-12 | Paper |
| On generalized gossiping and broadcasting | 2006-06-30 | Paper |
| Algorithms – ESA 2005 | 2006-06-27 | Paper |
| An improved approximation algorithm for vertex cover with hard capacities | 2006-01-10 | Paper |
| Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2005-08-25 | Paper |
| Algorithms – ESA 2004 | 2005-08-18 | Paper |
| Algorithms for Data Migration with Cloning | 2005-02-21 | Paper |
| Equivalence of two linear programming relaxations for broadcast scheduling. | 2005-01-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4828915 | 2004-11-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4829023 | 2004-11-29 | Paper |
| Approximation algorithms for partial covering problems | 2004-11-12 | Paper |
| Algorithms for minimizing response time in broadcast scheduling | 2004-09-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737543 | 2004-08-11 | Paper |
| Capacitated vertex covering | 2004-03-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4449173 | 2004-02-08 | Paper |
| On Local Search and Placement of Meters in Networks | 2003-06-19 | Paper |
| The General Steiner Tree-Star problem. | 2003-01-21 | Paper |
| Improved methods for approximating node weighted Steiner trees and connected dominating sets. | 2003-01-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4542553 | 2002-08-01 | Paper |
| The budgeted maximum coverage problem | 2002-07-25 | Paper |
| An \(O(|V|^2)\) algorithm for single connectedness | 2002-07-25 | Paper |
| \(z\)-approximations | 2002-07-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4535021 | 2002-06-12 | Paper |
| Algorithms for capacitated vehicle routing | 2002-04-23 | Paper |
| Algorithms for facility location problems with outliers. (Extended abstract) | 2002-01-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4761320 | 2001-09-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4234153 | 2001-08-28 | Paper |
| Optimal collective dichotomous choice under partial order constraints | 2001-07-29 | Paper |
| Centers of sets of pixels | 2001-01-15 | Paper |
| Approximation algorithms with bounded performance guarantees for the clustered traveling salesman problem | 2000-11-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252380 | 2000-10-17 | Paper |
| Fault tolerant \(K\)-center problems | 2000-08-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4234045 | 2000-08-03 | Paper |
| The Capacitated K-Center Problem | 2000-07-20 | Paper |
| On the parallel complexity of digraph reachability | 2000-06-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4250234 | 2000-05-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4952620 | 2000-05-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4952634 | 2000-05-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4231912 | 2000-04-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4247262 | 2000-01-18 | Paper |
| Greedy Strikes Back: Improved Facility Location Algorithms | 2000-01-09 | Paper |
| The Loading Time Scheduling Problem | 2000-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4247267 | 1999-09-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252419 | 1999-06-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4228432 | 1999-04-22 | Paper |
| Facility location with dynamic distance functions | 1999-03-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4395328 | 1998-10-01 | Paper |
| A Network-Flow Technique for Finding Low-Weight Bounded-Degree Spanning Trees | 1998-09-20 | Paper |
| Approximation algorithms for connected dominating sets | 1998-09-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4335208 | 1997-08-03 | Paper |
| Landmarks in graphs | 1997-07-07 | Paper |
| On strongly connected digraphs with bounded cycle length | 1997-04-07 | Paper |
| Efficient Minimum Cost Matching and Transportation Using the Quadrangle Inequality | 1996-11-04 | Paper |
| Low-Degree Spanning Trees of Small Weight | 1996-11-03 | Paper |
| Improved Approximation Algorithms for Uniform Connectivity Problems | 1996-10-16 | Paper |
| Balancing minimum spanning trees and shortest-path trees | 1996-03-11 | Paper |
| Approximating the Minimum Equivalent Digraph | 1995-11-01 | Paper |
| Biconnectivity approximations and graph carvings | 1995-10-09 | Paper |
| A simple randomized sieve algorithm for the closest-pair problem | 1995-05-28 | Paper |
| On-line algorithms for weighted bipartite matching and stable marriages | 1995-02-09 | Paper |
| A Primal-Dual Parallel Approximation Technique Applied to Weighted Set and Vertex Covers | 1994-11-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3138288 | 1994-11-29 | Paper |
| Designing multi-commodity flow trees | 1994-05-03 | Paper |
| Geometric Knapsack problems | 1994-02-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3140426 | 1994-01-02 | Paper |
| Flow in planar graphs with vertex capacities | 1994-01-01 | Paper |
| The Lattice Structure of Flow in Planar Graphs | 1993-10-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4037416 | 1993-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4036608 | 1993-05-18 | Paper |
| Approximation Algorithms for Graph Augmentation | 1993-05-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4028895 | 1993-03-28 | Paper |
| On independent spanning trees | 1993-01-16 | Paper |
| Processor Efficient Parallel Algorithms for the Two Disjoint Paths Problem and for Finding a Kuratowski Homeomorph | 1993-01-16 | Paper |
| Efficient Parallel Algorithms for Testingkand Finding Disjoints-tPaths in Graphs | 1991-01-01 | Paper |
| Planar graph coloring is not self-reducible, assuming P\(\neq NP\) | 1991-01-01 | Paper |
| Extending planar graph algorithms to \(K_{3,3}\)-free graphs | 1990-01-01 | Paper |
| On a triangle counting problem | 1990-01-01 | Paper |
| Coloring algorithms for \(K_ 5\)-minor free graphs | 1990-01-01 | Paper |
| On computing graph closures | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3817629 | 1988-01-01 | Paper |
