| Publication | Date of Publication | Type |
|---|
| Bicriteria approximation algorithms for priority matroid median | 2025-01-14 | Paper |
| Independent sets in elimination graphs with a submodular objective | 2025-01-14 | Paper |
| Convergence to lexicographically optimal base in a (contra)polymatroid and applications to densest subgraph and tree packing | 2025-01-06 | Paper |
| Adaptive out-orientations with applications | 2024-11-28 | Paper |
| Approximation algorithms for network design in non-uniform fault models | 2024-11-14 | Paper |
| On submodular prophet inequalities and correlation gap | 2024-11-06 | Paper |
| Approximate representation of symmetric submodular functions via hypergraph cut functions | 2024-09-12 | Paper |
| LP relaxation and tree packing for minimum \(k\)-cuts | 2024-08-26 | Paper |
| Densest subgraph: supermodularity, iterative peeling, and flow | 2024-07-19 | Paper |
| Contention resolution for the \(\ell\)-fold union of a matroid via the correlation gap | 2024-05-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6147315 | 2024-01-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6090899 | 2023-11-20 | Paper |
| Min-max partitioning of hypergraphs and symmetric submodular functions | 2023-10-04 | Paper |
| Hypergraph k-Cut for Fixed k in Deterministic Polynomial Time | 2023-01-09 | Paper |
| Algorithms for covering multiple submodular constraints and applications | 2022-08-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5093404 | 2022-07-26 | Paper |
| Node-weighted Network Design in Planar and Minor-closed Families of Graphs | 2022-02-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5009501 | 2021-08-04 | Paper |
| Fast LP-based Approximations for Geometric Packing and Covering Problems | 2021-02-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5140849 | 2020-12-17 | Paper |
| Hypergraph $k$-cut for fixed $k$ in deterministic polynomial time | 2020-09-25 | Paper |
| \(\ell_1\)-sparsity approximation bounds for packing integer programs | 2020-08-28 | Paper |
| LP Relaxation and Tree Packing for Minimum $k$-Cut | 2020-07-30 | Paper |
| Submodular Function Maximization via the Multilinear Relaxation and Contention Resolution Schemes | 2020-05-31 | Paper |
| \(\ell_1\)-sparsity approximation bounds for packing integer programs | 2020-02-06 | Paper |
| Parallelizing greedy for submodular set function maximization in matroids and beyond | 2020-01-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5240417 | 2019-10-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5240415 | 2019-10-25 | Paper |
| Submodular Function Maximization in Parallel via the Multilinear Relaxation | 2019-10-15 | Paper |
| On Approximating (Sparse) Covering Integer Programs | 2019-10-15 | Paper |
| Poly-logarithmic Approximation for Maximum Node Disjoint Paths with Constant Congestion | 2019-05-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4633926 | 2019-05-06 | Paper |
| Minimum Cuts and Sparsification in Hypergraphs | 2018-12-05 | Paper |
| Edge-disjoint paths revisited | 2018-11-05 | Paper |
| Constant Congestion Routing of Symmetric Demands in Planar Directed Graphs | 2018-08-22 | Paper |
| Approximation Algorithms for Euler Genus and Related Problems | 2018-08-21 | Paper |
| Polynomial Bounds for the Grid-Minor Theorem | 2018-08-02 | Paper |
| Near-Linear Time Approximation Schemes for some Implicit Fractional Packing Problems | 2018-07-16 | Paper |
| A Fast Approximation for Maximum Weight Matroid Intersection | 2018-07-16 | Paper |
| Simple and Fast Rounding Algorithms for Directed and Node-weighted Multiway Cut | 2018-07-16 | Paper |
| Computing minimum cuts in hypergraphs | 2018-07-16 | Paper |
| Approximating Multicut and the Demand Graph | 2018-07-16 | Paper |
| Constant Factor Approximation for Subset Feedback Set Problems via a new LP relaxation | 2018-07-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4607903 | 2018-03-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4598139 | 2017-12-19 | Paper |
| On the set multi-cover problem in geometric settings | 2017-10-20 | Paper |
| Degree-3 Treewidth Sparsifiers | 2017-10-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5365101 | 2017-09-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5365098 | 2017-09-29 | Paper |
| On Multiplicative Weight Updates for Concave and Submodular Function Maximization | 2017-05-19 | Paper |
| Multicommodity flows and cuts in polymatroidal networks | 2016-10-07 | Paper |
| Performance guarantees for the TSP with a parameterized triangle inequality | 2016-06-16 | Paper |
| Centrality of trees for capacitated \(k\)-center | 2015-12-09 | Paper |
| The all-or-nothing flow problem in directed graphs with symmetric demand pairs | 2015-12-09 | Paper |
| On Element-Connectivity Preserving Graph Simplification | 2015-11-19 | Paper |
| Streaming Algorithms for Submodular Function Maximization | 2015-10-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501810 | 2015-08-14 | Paper |
| Multicommodity flows and cuts in polymatroidal networks | 2015-08-03 | Paper |
| Approximability of capacitated network design | 2015-07-10 | Paper |
| Polynomial bounds for the grid-minor theorem | 2015-06-26 | Paper |
| Algorithms for minimizing weighted flow time | 2015-02-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2934722 | 2014-12-18 | Paper |
| On the set multicover problem in geometric settings | 2014-12-05 | Paper |
| Edge-disjoint paths in Planar graphs with constant congestion | 2014-11-25 | Paper |
| A Graph Reduction Step Preserving Element-Connectivity and Packing Steiner Trees and Forests | 2014-09-26 | Paper |
| Set connectivity problems in undirected graphs and the directed steiner network problem | 2014-09-09 | Paper |
| Improved algorithms for orienteering and related problems | 2014-09-09 | Paper |
| Large-treewidth graph decompositions and applications | 2014-08-07 | Paper |
| Approximation Algorithms for Submodular Multiway Partition | 2014-07-30 | Paper |
| Submodular function maximization via the multilinear relaxation and contention resolution schemes | 2014-06-05 | Paper |
| The All-or-Nothing Flow Problem in Directed Graphs with Symmetric Demand Pairs | 2014-06-02 | Paper |
| Centrality of Trees for Capacitated k-Center | 2014-06-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5417700 | 2014-05-22 | Paper |
| The all-or-nothing multicommodity flow problem | 2013-11-14 | Paper |
| Node-Weighted Network Design in Planar and Minor-Closed Families of Graphs | 2013-08-12 | Paper |
| Maximum Edge-Disjoint Paths in k-Sums of Graphs | 2013-08-06 | Paper |
| Flow-cut gaps for integer and fractional multiflows | 2013-04-17 | Paper |
| Prize-Collecting Survivable Network Design in Node-Weighted Graphs | 2012-11-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3165952 | 2012-10-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3165953 | 2012-10-19 | Paper |
| Online scheduling to minimize maximum response time and maximum delay factor | 2012-09-27 | Paper |
| Pruning 2-connected graphs | 2012-04-26 | Paper |
| Maximizing a Monotone Submodular Function Subject to a Matroid Constraint | 2012-03-15 | Paper |
| Submodular Cost Allocation Problem and Applications | 2011-07-06 | Paper |
| Approximability of Capacitated Network Design | 2011-06-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3002787 | 2011-05-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3002769 | 2011-05-24 | Paper |
| Buy-at-Bulk Network Design with Protection | 2011-04-27 | Paper |
| New Models and Algorithms for Throughput Maximization in Broadcast Scheduling | 2011-02-15 | Paper |
| Disjoint bases in a polymatroid | 2010-11-09 | Paper |
| Approximation Algorithms for Nonuniform Buy-at-Bulk Network Design | 2010-11-04 | Paper |
| Multicommodity flow, well-linked terminals, and routing problems | 2010-08-16 | Paper |
| The all-or-nothing multicommodity flow problem | 2010-08-15 | Paper |
| Multi-processor scheduling to minimize flow time with ε resource augmentation | 2010-08-15 | Paper |
| Multicommodity demand flow in a tree and packing integer programs | 2010-08-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3579451 | 2010-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3579405 | 2010-08-06 | Paper |
| Approximation schemes for preemptive weighted flow time | 2010-08-05 | Paper |
| Longest Wait First for Broadcast Scheduling [Extended Abstract] | 2010-05-11 | Paper |
| Approximate Integer Decompositions for Undirected Network Design Problems | 2010-03-17 | Paper |
| Edge-Disjoint Paths in Planar Graphs with Constant Congestion | 2010-03-17 | Paper |
| Minimizing Maximum Response Time and Delay Factor in Broadcast Scheduling | 2009-10-29 | Paper |
| Truthful Mechanisms via Greedy Iterative Packing | 2009-10-28 | Paper |
| Unsplittable Flow in Paths and Trees and Column-Restricted Packing Integer Programs | 2009-10-28 | Paper |
| A note on multiflows and treewidth | 2009-08-27 | Paper |
| A Graph Reduction Step Preserving Element-Connectivity and Applications | 2009-07-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3546688 | 2008-12-21 | Paper |
| Algorithms for 2-Route Cut Problems | 2008-08-28 | Paper |
| Maximizing a Submodular Set Function Subject to a Matroid Constraint (Extended Abstract) | 2007-11-29 | Paper |
| An O(logn) Approximation Ratio for the Asymmetric Traveling Salesman Path Problem | 2007-08-28 | Paper |
| Approximation algorithms for the unsplittable flow problem | 2007-03-05 | Paper |
| Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques | 2006-07-07 | Paper |
| A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem | 2006-06-01 | Paper |
| Embedding k-Outerplanar Graphs into l1 | 2006-06-01 | Paper |
| The Steiner k-Cut Problem | 2006-06-01 | Paper |
| Building edge-failure resilient networks | 2006-03-21 | Paper |
| A greedy approximation algorithm for the group Steiner problem | 2006-01-10 | Paper |
| On a bidirected relaxation for the MULTIWAY CUT problem | 2005-09-28 | Paper |
| A Linear Programming Formulation and Approximation Algorithms for the Metric Labeling Problem | 2005-09-16 | Paper |
| Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2005-08-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3024765 | 2005-07-04 | Paper |
| On Multidimensional Packing Problems | 2005-02-21 | Paper |
| Incremental Clustering and Dynamic Information Retrieval | 2005-02-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737544 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4471340 | 2004-07-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4471352 | 2004-07-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4449175 | 2004-02-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4449192 | 2004-02-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4542528 | 2004-01-27 | Paper |
| A deterministic algorithm for the cost-distance problem | 2003-07-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4411277 | 2003-07-07 | Paper |
| An efficient approximation algorithm for minimizing makespan on uniformly related machines. | 2002-07-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4535067 | 2002-06-12 | Paper |
| Approximation algorithms for the metric labeling problem via a new linear programming formulation | 2002-03-24 | Paper |
| Approximation techniques for average completion time scheduling | 2001-06-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4527030 | 2001-02-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4952619 | 2001-01-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252288 | 2000-06-21 | Paper |
| Approximation Algorithms for Directed Steiner Problems | 2000-05-28 | Paper |
| Precedence constrained scheduling to minimize sum of weighted completion times on a single machine | 2000-01-17 | Paper |
| Fast Estimation of Diameter and Shortest Paths (Without Matrix Multiplication) | 1999-10-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4250182 | 1999-06-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252385 | 1999-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3840373 | 1998-08-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4875229 | 1996-04-28 | Paper |
