| Publication | Date of Publication | Type |
|---|
| Timeliness through telephones: approximating information freshness in vector clock models | 2024-05-14 | Paper |
| Approximation algorithms for Steiner tree augmentation problems | 2024-05-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6059160 | 2023-11-02 | Paper |
| Vertex downgrading to minimize connectivity | 2023-05-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5875455 | 2023-02-03 | Paper |
| Nonoverlapping local alignments (weighted independent sets of axis parallel rectangles) | 2022-12-16 | Paper |
| On small-depth tree augmentations | 2022-12-12 | Paper |
| Coloring down: 3/2-approximation for special cases of the weighted tree augmentation problem | 2022-12-12 | Paper |
| Service-constrained network design problems | 2022-12-09 | Paper |
| Approximation algorithms for replenishment problems with fixed turnover times | 2022-08-18 | Paper |
| Combinatorial Heuristics for Inventory Routing Problems | 2022-06-28 | Paper |
| Multicommodity Multicast, Wireless and Fast | 2022-05-11 | Paper |
| A simple proof of the Moore-Hodgson algorithm for minimizing the number of late jobs | 2022-03-11 | Paper |
| Approximation algorithm for the 2-stage stochastic matroid base problem | 2022-03-11 | Paper |
| A New System-Wide Diversity Measure for Recommendations with Efficient Algorithms | 2022-02-03 | Paper |
| Two-level hub Steiner trees | 2021-12-14 | Paper |
| On the Integrality Gap of the Prize-Collecting Steiner Forest LP | 2021-07-28 | Paper |
| A simple proof of the Moore-Hodgson Algorithm for minimizing the number of late jobs | 2021-04-13 | Paper |
| Local improvement algorithms for a path packing problem: a performance analysis based on linear programming | 2021-04-07 | Paper |
| An optimal rounding for half-integral weighted minimum strongly connected spanning subgraph | 2021-03-11 | Paper |
| Shorter tours and longer detours: uniform covers and a bit beyond | 2021-01-25 | Paper |
| The approximability of multiple facility location on directed networks with random arc failures | 2020-09-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5111689 | 2020-05-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5111735 | 2020-05-27 | Paper |
| Approximation algorithms for replenishment problems with fixed turnover times | 2020-02-12 | Paper |
| Plane gossip: approximating rumor spread in planar graphs | 2020-02-12 | Paper |
| Inventory Routing problem with facility location | 2020-01-16 | Paper |
| Algorithms for automatic ranking of participants and tasks in an anonymized contest | 2019-09-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5743496 | 2019-05-10 | Paper |
| Approximation Algorithms for Low-Distortion Embeddings into Low-Dimensional Spaces | 2019-03-12 | Paper |
| Bicriteria Network Design Problems | 2019-01-10 | Paper |
| Robust and MaxMin Optimization under Matroid and Knapsack Uncertainty Sets | 2018-10-30 | Paper |
| Minimum Makespan Multi-vehicle Dial-a-Ride | 2018-10-30 | Paper |
| LAST but not Least: Online Spanners for Buy-at-Bulk | 2018-07-16 | Paper |
| Optimal circuits for parallel multipliers | 2018-07-09 | Paper |
| Improving spanning trees by upgrading nodes | 2018-07-04 | Paper |
| Multiple facility location on a network with linear reliability order of edges | 2017-11-16 | Paper |
| Approximation Algorithms for Optimal Decision Trees and Adaptive TSP Problems | 2017-09-22 | Paper |
| Designing Overlapping Networks for Publish-Subscribe Systems | 2017-08-31 | Paper |
| Rumors Across Radio, Wireless, Telephone | 2017-07-13 | Paper |
| Algorithms for automatic ranking of participants and tasks in an anonymized contest | 2017-05-05 | Paper |
| Deliver or Hold: Approximation Algorithms for the Periodic Inventory Routing Problem | 2017-03-22 | Paper |
| A 9/7 -Approximation Algorithm for Graphic TSP in Cubic Bipartite Graphs | 2017-03-22 | Paper |
| Balls and Funnels: Energy Efficient Group-to-Group Anycasts | 2016-09-02 | Paper |
| A \(\frac{9}{7}\)-approximation algorithm for graphic TSP in cubic bipartite graphs | 2016-06-21 | Paper |
| The \(p\)-neighbor \(k\)-center problem | 2016-06-09 | Paper |
| Capacitated Vehicle Routing with Nonuniform Speeds | 2016-04-15 | Paper |
| Iterative Rounding Approximation Algorithms for Degree-Bounded Node-Connectivity Network Design | 2015-10-08 | Paper |
| Graph-TSP from Steiner Cycles | 2015-09-09 | Paper |
| Efficient cost-sharing mechanisms for prize-collecting problems | 2015-08-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501277 | 2015-08-03 | Paper |
| Many birds with one stone | 2015-05-07 | Paper |
| Running Errands in Time: Approximation Algorithms for Stochastic Orienteering | 2015-04-01 | Paper |
| Improved approximations for two-stage MIN-cut and shortest path problems under uncertainty | 2015-02-09 | Paper |
| Online and stochastic survivable network design | 2015-02-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2934689 | 2014-12-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2934710 | 2014-12-18 | Paper |
| Dial a ride from \(k\)-forest | 2014-11-18 | Paper |
| Dial a Ride from k -forest | 2014-11-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2921660 | 2014-10-13 | Paper |
| A matter of degree | 2014-09-26 | Paper |
| New approaches to multi-objective optimization | 2014-08-29 | Paper |
| Thresholded covering algorithms for robust and max-min optimization | 2014-08-29 | Paper |
| Approximation Algorithms for Correlated Knapsacks and Non-martingale Bandits | 2014-07-30 | Paper |
| Geometry of Online Packing Linear Programs | 2014-07-11 | Paper |
| Sending Secrets Swiftly: Approximation Algorithms for Generalized Multicast Problems | 2014-07-01 | Paper |
| Short Tours through Large Linear Forests | 2014-06-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5417728 | 2014-05-22 | Paper |
| Approximating max-min weighted \(T\)-joins | 2014-05-14 | Paper |
| Approximation Algorithms for Online Weighted Rank Function Maximization under Matroid Constraints | 2013-08-12 | Paper |
| Geometry of Online Packing Linear Programs | 2013-08-12 | Paper |
| An FPTAS for minimizing a class of low-rank quasi-concave functions over a convex set | 2013-05-14 | Paper |
| Online and Stochastic Survivable Network Design | 2013-03-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2920152 | 2012-10-24 | Paper |
| Solving the Capacitated Local Access Network Design Problem | 2012-07-28 | Paper |
| Approximation algorithms for distance constrained vehicle routing problems | 2012-06-18 | Paper |
| Technical Note—Approximation Algorithms for VRP with Stochastic Demands | 2012-06-18 | Paper |
| A near Pareto optimal auction with budget constraints | 2012-03-19 | Paper |
| Scheduling and Reliable Lead-Time Quotation for Orders with Availability Intervals and Lead-Time Sensitive Revenues | 2012-02-19 | Paper |
| Sampling and Cost-Sharing: Approximation Algorithms for Stochastic Optimization Problems | 2012-02-11 | Paper |
| Iterative Methods in Combinatorial Optimization | 2011-08-02 | Paper |
| The directed orienteering problem | 2011-07-01 | Paper |
| Capacitated Vehicle Routing with Non-uniform Speeds | 2011-06-24 | Paper |
| Approximation Algorithms for Multicommodity Facility Location Problems | 2011-04-15 | Paper |
| An FPTAS for minimizing the product of two non-negative linear cost functions | 2011-02-14 | Paper |
| Game-Theoretic Models of Information Overload in Social Networks | 2011-01-21 | Paper |
| An improved approximation algorithm for requirement cut | 2010-09-07 | Paper |
| Thresholded Covering Algorithms for Robust and Max-min Optimization | 2010-09-07 | Paper |
| Approximation Algorithms for Optimal Decision Trees and Adaptive TSP Problems | 2010-09-07 | Paper |
| Primal-dual meets local search | 2010-08-16 | Paper |
| Boosted sampling | 2010-08-15 | Paper |
| Simpler analysis of LP extreme points for traveling salesman and survivable network design problems | 2010-06-08 | Paper |
| A PTAS for the chance-constrained knapsack problem with random item sizes | 2010-06-08 | Paper |
| Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques | 2010-05-26 | Paper |
| Line-of-Sight Networks | 2010-04-23 | Paper |
| Approximation algorithms for requirement cut on graphs | 2010-02-23 | Paper |
| Iterative Rounding for Multi-Objective Optimization Problems | 2009-10-29 | Paper |
| Tractable Cases of Facility Location on a Network with a Linear Reliability Order of Links | 2009-10-29 | Paper |
| Minimum Makespan Multi-vehicle Dial-a-Ride | 2009-10-29 | Paper |
| Approximation Algorithms for Problems Combining Facility Location and Network Design | 2009-08-13 | Paper |
| FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science | 2009-08-06 | Paper |
| A linear-time algorithm to compute a MAD tree of an interval graph | 2009-07-09 | Paper |
| Delegate and Conquer: An LP-Based Approximation Algorithm for Minimum Degree MSTs | 2009-03-12 | Paper |
| Fixed Parameter Tractability of Binary Near-Perfect Phylogenetic Tree Reconstruction | 2009-03-12 | Paper |
| Poly-logarithmic Approximation Algorithms for Directed Vehicle Routing Problems | 2009-02-17 | Paper |
| Simple Reconstruction of Binary Near-Perfect Phylogenetic Trees | 2008-12-09 | Paper |
| The Directed Minimum Latency Problem | 2008-11-27 | Paper |
| Dial a Ride from k-Forest | 2008-09-25 | Paper |
| Pricing Tree Access Networks with Connected Backbones | 2008-09-25 | Paper |
| Matching Based Augmentations for Approximating Connectivity Problems | 2008-09-18 | Paper |
| LP Rounding Approximation Algorithms for Stochastic Network Design | 2008-05-27 | Paper |
| Pay Today for a Rainy Day: Improved Approximation Algorithms for Demand-Robust Min-Cut and Shortest Path Problems | 2008-03-19 | Paper |
| Approximating \(k\)-cuts using network strength as a Lagrangean relaxation | 2007-11-23 | Paper |
| STACS 2004 | 2007-10-01 | Paper |
| On Two-Stage Stochastic Minimum Spanning Trees | 2007-08-30 | Paper |
| Minimum Vehicle Routing with a Common Deadline | 2007-08-28 | Paper |
| Approximation algorithms for minimizing average distortion | 2006-10-25 | Paper |
| Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques | 2006-07-07 | Paper |
| Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques | 2006-07-07 | Paper |
| Hedging uncertainty: approximation algorithms for stochastic optimization problems | 2006-06-28 | Paper |
| Integer Programming and Combinatorial Optimization | 2005-12-23 | Paper |
| Primal-Dual Meets Local Search: Approximating MSTs With Nonuniform Degree Bounds | 2005-09-16 | Paper |
| Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2005-08-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3024801 | 2005-07-04 | Paper |
| Approximation algorithms for finding low-degree subgraphs | 2005-02-23 | Paper |
| Min-max tree covers of graphs. | 2005-01-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4828991 | 2004-11-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4829040 | 2004-11-29 | Paper |
| Approximation algorithms for a capacitated network design problem | 2004-09-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737529 | 2004-08-11 | Paper |
| Approximation algorithms for the test cover problem | 2004-03-11 | Paper |
| Semi-definite relaxations for minimum bandwidth and other vertex-ordering problems | 2004-01-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4411398 | 2003-07-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4796174 | 2003-03-02 | Paper |
| Erratum: An approximation algorithm for minimum-cost vertex-connectivity problems | 2002-12-01 | Paper |
| A Matter of Degree: Improved Approximation Algorithms for Degree-Bounded Minimum Spanning Trees | 2002-09-29 | Paper |
| On approximating planar metrics by tree metrics. | 2002-07-14 | Paper |
| Approximation algorithms for the covering Steiner problem | 2002-07-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4537744 | 2002-06-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2753737 | 2002-01-13 | Paper |
| Approximation algorithms for the multiple knapsack problem with assignment restrictions | 2001-02-06 | Paper |
| Approximation algorithms for degree-constrained minimum-cost network-design problems | 2001-01-01 | Paper |
| A Polylogarithmic Approximation Algorithm for the Group Steiner Tree Problem | 2000-11-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4938792 | 2000-09-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4494412 | 2000-08-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4234131 | 2000-08-03 | Paper |
| Semi-definite relaxations for minimum bandwidth and other vertex-ordering problems | 2000-06-04 | Paper |
| A Polynomial-Time Approximation Scheme for Minimum Routing Cost Spanning Trees | 2000-03-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4938770 | 2000-02-23 | Paper |
| A constant-factor approximation algorithm for the \(k\)-MST problem | 2000-02-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4250159 | 2000-02-09 | Paper |
| Improving Minimum Cost Spanning Trees by Upgrading Nodes | 2000-02-06 | Paper |
| Improving spanning trees by upgrading nodes | 2000-01-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4952636 | 2000-01-01 | Paper |
| Approximation algorithms for multiple sequence alignment under a fixed evolutionary tree | 1999-12-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4234152 | 1999-11-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4250189 | 1999-06-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4228499 | 1999-05-18 | Paper |
| Approximation algorithms for certain network improvement problems | 1999-03-28 | Paper |
| Bicriteria Network Design Problems | 1998-12-02 | Paper |
| Approximating Maximum Leaf Spanning Trees in Almost Linear Time | 1998-11-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4395331 | 1998-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4395332 | 1998-06-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3129923 | 1997-11-12 | Paper |
| Nonoverlapping local alignments (weighted independent sets of axis-parallel rectangles) | 1997-11-09 | Paper |
| An approximation algorithm for minimum-cost vertex-connectivity problems | 1997-10-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3128917 | 1997-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4886063 | 1996-08-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4886096 | 1996-08-22 | Paper |
| Spanning Trees—Short or Small | 1996-07-24 | Paper |
| An approximate max-flow min-cut relation for undirected multicommodity flow, with applications | 1996-04-16 | Paper |
| A Nearly Best-Possible Approximation Algorithm for Node-Weighted Steiner Trees | 1996-04-11 | Paper |
| When Trees Collide: An Approximation Algorithm for the Generalized Steiner Problem on Networks | 1995-07-26 | Paper |
| A primal-dual approximation algorithm for the Steiner forest problem | 1994-06-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4288579 | 1994-04-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4036610 | 1993-05-18 | Paper |
| Generalized vertex covering in interval graphs | 1993-01-16 | Paper |
| An optimal algorithm to solve the all-pair shortest path problem on interval graphs | 1992-06-28 | Paper |
