| Publication | Date of Publication | Type |
|---|
| A faster combinatorial algorithm for maximum bipartite matching | 2024-11-28 | Paper |
| A new conjecture on hardness of 2-CSP's with implications to hardness of densest \(k\)-subgraph and other problems | 2024-09-25 | Paper |
| A distanced matching game, decremental APSP in expanders, and faster deterministic algorithms for graph cut problems | 2024-05-14 | Paper |
| A new deterministic algorithm for fully dynamic all-pairs shortest paths | 2024-05-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6138067 | 2024-01-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6147403 | 2024-01-15 | Paper |
| A subpolynomial approximation algorithm for graph crossing number in low-degree graphs | 2023-12-08 | Paper |
| Decremental all-pairs shortest paths in deterministic near-linear time | 2023-11-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6062157 | 2023-10-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5158500 | 2021-10-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5002709 | 2021-07-28 | Paper |
| Towards tight(er) bounds for the excluded grid theorem | 2021-02-03 | Paper |
| New Hardness Results for Routing on Disjoint Paths | 2021-01-13 | Paper |
| A new algorithm for decremental single-source shortest paths with applications to vertex-capacitated flow and cut problems | 2020-01-30 | Paper |
| Towards Tight(er) Bounds for the Excluded Grid Theorem | 2019-10-15 | Paper |
| Almost polynomial hardness of node-disjoint paths in grids | 2019-08-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5743436 | 2019-05-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4633902 | 2019-05-06 | Paper |
| On the approximability of some network design problems | 2018-11-05 | Paper |
| Approximation Algorithms and Hardness of the k -Route Cut Problem | 2018-10-30 | Paper |
| Polynomial Bounds for the Grid-Minor Theorem | 2018-08-02 | Paper |
| A Polylogarithmic Approximation Algorithm for Edge-Disjoint Paths with Congestion 2 | 2018-08-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4589020 | 2017-11-06 | Paper |
| Improved Bounds for the Flat Wall Theorem | 2017-10-05 | Paper |
| Degree-3 Treewidth Sparsifiers | 2017-10-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5365099 | 2017-09-29 | Paper |
| Improved approximation for node-disjoint paths in planar graphs | 2017-09-29 | Paper |
| On Approximating Node-Disjoint Paths in Grids | 2017-08-31 | Paper |
| New hardness results for routing on disjoint paths | 2017-08-17 | Paper |
| Routing in undirected graphs with constant congestion | 2016-09-02 | Paper |
| Improved Bounds for the Excluded Grid Theorem | 2016-02-08 | Paper |
| New hardness results for congestion minimization and machine scheduling | 2015-12-04 | Paper |
| Polynomial flow-cut gaps and hardness of directed cut problems | 2015-11-11 | Paper |
| Algorithmic aspects of bandwidth trading | 2015-09-02 | Paper |
| Excluded Grid Theorem | 2015-08-21 | Paper |
| Polynomial bounds for the grid-minor theorem | 2015-06-26 | Paper |
| Hardness of cut problems in directed graphs | 2014-11-25 | Paper |
| Approximating \(k\)-median with non-uniform capacities | 2014-10-13 | Paper |
| On the approximability of some network design problems | 2014-10-13 | Paper |
| Large-treewidth graph decompositions and applications | 2014-08-07 | Paper |
| On Allocating Goods to Maximize Fairness | 2014-07-25 | Paper |
| An O(k^3 log n)-Approximation Algorithm for Vertex-Connectivity Survivable Network Design | 2014-07-25 | Paper |
| An algorithm for the graph crossing number problem | 2014-06-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5417712 | 2014-05-22 | Paper |
| Approximation algorithms and hardness of integral concurrent flow | 2014-05-13 | Paper |
| Routing in undirected graphs with constant congestion | 2014-05-13 | Paper |
| On vertex sparsifiers with Steiner nodes | 2014-05-13 | Paper |
| Approximation algorithms for the directed \(k\)-Tour and \(k\)-Stroll problems | 2013-08-05 | Paper |
| Improved Hardness Results for Profit Maximization Pricing Problems with Unlimited Supply | 2012-11-02 | Paper |
| An \(O(k^3\log n)\)-approximation algorithm for vertex-connectivity survivable network design | 2012-09-27 | Paper |
| Inapproximability of edge-disjoint paths and low congestion routing on undirected graphs | 2011-12-19 | Paper |
| Approximation Algorithms for the Directed k-Tour and k-Stroll Problems | 2010-09-10 | Paper |
| Low-distortion embeddings of general metrics into the line | 2010-08-16 | Paper |
| New hardness results for congestion minimization and machine scheduling | 2010-08-15 | Paper |
| Asymmetric k-center is log * n -hard to approximate | 2010-08-15 | Paper |
| Resource Minimization Job Scheduling | 2009-10-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3601539 | 2009-02-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3549697 | 2009-01-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3549612 | 2009-01-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3549611 | 2009-01-05 | Paper |
| Asymmetric k -center is log * n -hard to approximate | 2008-12-21 | Paper |
| Approximation Algorithms for the Job Interval Selection Problem and Related Scheduling Problems | 2008-05-27 | Paper |
| The Hardness of Metric Labeling | 2007-10-22 | Paper |
| Covering Problems with Hard Capacities | 2007-05-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4449217 | 2004-02-08 | Paper |
