| Publication | Date of Publication | Type |
|---|
| 2-approximation for prize-collecting Steiner forest | 2024-11-28 | Paper |
| Dynamic algorithms for matroid submodular maximization | 2024-11-28 | Paper |
| Power of posted-price mechanisms for prophet inequalities | 2024-11-28 | Paper |
| Prophet secretary for combinatorial auctions and matroids | 2024-11-20 | Paper |
| Weighted edit distance computation: strings, trees, and Dyck | 2024-05-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6126324 | 2024-04-09 | Paper |
| Brief Announcement: Improved Consensus in Quantum Networks | 2024-03-26 | Paper |
| Improved communication complexity of fault-tolerant consensus | 2023-12-08 | Paper |
| Approximating Edit Distance in Truly Subquadratic Time: Quantum and MapReduce | 2022-12-08 | Paper |
| Approximating longest common subsequence in linear time: beating the \(\sqrt{n}\) barrier | 2022-08-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5075750 | 2022-05-11 | Paper |
| Fair allocation of indivisible goods: beyond additive valuations | 2022-03-02 | Paper |
| Lower bounds for external memory integer sorting via network coding | 2021-10-18 | Paper |
| Fair allocation of indivisible goods: improvement | 2021-09-14 | Paper |
| Greedy algorithms for online survivable network design | 2021-07-28 | Paper |
| Brief announcement: MapReduce algorithms for massive trees | 2021-07-28 | Paper |
| Massively Parallel Computation of Matching and MIS in Sparse Graphs | 2021-01-20 | Paper |
| Stochastic matching with few queries: (1-ε) approximation | 2021-01-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5111458 | 2020-05-27 | Paper |
| From duels to battlefields: computing equilibria of Blotto and other games | 2020-04-30 | Paper |
| Tight bounds for planar strongly connected Steiner subgraph with fixed number of terminals (and extensions) | 2020-03-27 | Paper |
| Approximation algorithms for connected maximum cut and related problems | 2020-03-12 | Paper |
| Computing Stackelberg equilibria of large general-sum games | 2020-02-04 | Paper |
| Stochastic matching on uniformly sparse graphs | 2020-02-04 | Paper |
| \(1+\varepsilon\) approximation of tree edit distance in quadratic time | 2020-01-30 | Paper |
| Lower bounds for external memory integer sorting via network coding | 2020-01-30 | Paper |
| Stochastic Matching with Few Queries: New Algorithms and Tools | 2019-10-15 | Paper |
| Approximating LCS in Linear Time: Beating the √n Barrier | 2019-10-15 | Paper |
| Massively parallel approximation algorithms for edit distance and longest common subsequence | 2019-10-15 | Paper |
| Polynomial-time approximation scheme for minimum \(k\)-cut in planar and minor-free graphs | 2019-10-15 | Paper |
| Disjoint-path facility location: theory and practice | 2019-09-12 | Paper |
| Fast algorithms for knapsack via convolution and prediction | 2019-08-22 | Paper |
| A Constant Factor Approximation Algorithm for Fault-Tolerant k-Median | 2019-06-20 | Paper |
| Tight bounds for planar strongly connected Steiner subgraph with fixed number of terminals (and extensions) | 2019-06-20 | Paper |
| Fixed-parameter tractability of directed multiway cut parameterized by the size of the cutset | 2019-05-10 | Paper |
| A polynomial-time approximation scheme for planar multiway cut | 2019-05-10 | Paper |
| Assignment problem in content distribution networks: unsplittable hard-capacitated facility location | 2019-05-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4633931 | 2019-05-06 | Paper |
| Streaming algorithms for estimating the matching size in planar graphs and beyond | 2019-03-28 | Paper |
| Fair Allocation of Indivisible Goods to Asymmetric Agents | 2019-01-18 | Paper |
| Ordinal embeddings of minimum relaxation: general properties, trees, and ultrametrics | 2018-11-05 | Paper |
| Oblivious routing on node-capacitated and directed graphs | 2018-11-05 | Paper |
| A constant factor approximation algorithm for fault-tolerant \(k\)-median | 2018-11-05 | Paper |
| Approximation algorithms for movement repairmen | 2018-11-05 | Paper |
| Node-weighted Steiner tree and group Steiner tree in planar graphs | 2018-10-30 | Paper |
| Minimizing movement: fixed-parameter tractability | 2018-10-30 | Paper |
| Kernelization via Sampling with Applications to Finding Matchings and Related Problems in Dynamic Graph Streams | 2018-07-16 | Paper |
| Online degree-bounded Steiner network design | 2018-07-16 | Paper |
| Improved approximation algorithms for (budgeted) node-weighted Steiner problems | 2018-07-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4608059 | 2018-03-15 | Paper |
| From battlefields to elections: winning strategies of Blotto and auditing games | 2018-03-15 | Paper |
| Prophet secretary for combinatorial auctions and matroids | 2018-03-15 | Paper |
| Approximating edit distance in truly subquadratic time: quantum and MapReduce | 2018-03-15 | Paper |
| Beating ratio 0.5 for weighted oblivious matching problems | 2018-03-02 | Paper |
| Bicovering: covering edges with two small subsets of vertices | 2017-12-19 | Paper |
| Online weighted degree-bounded Steiner networks via novel online mixed packing/covering | 2017-12-19 | Paper |
| Price of Competition and Dueling Games | 2017-12-19 | Paper |
| Bi-covering: covering edges with two small subsets of vertices | 2017-12-11 | Paper |
| On maximum leaf trees and connections to connected maximum cut problems | 2017-10-18 | Paper |
| Streaming Algorithms for Estimating the Matching Size in Planar Graphs and Beyond | 2017-10-05 | Paper |
| Parameterized Streaming: Maximal Matching and Vertex Cover | 2017-10-05 | Paper |
| Capacitated metric labeling | 2017-09-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5365098 | 2017-09-29 | Paper |
| Low-dimensional embedding with extra information | 2017-09-29 | Paper |
| A PTAS for planar group Steiner tree via spanner bootstrapping and prize collecting | 2017-09-29 | Paper |
| A greedy approximation algorithm for minimum-gap scheduling | 2017-09-01 | Paper |
| Beating \(1-\frac{1}{e}\) for ordered prophets | 2017-08-17 | Paper |
| Prophet secretary | 2017-08-14 | Paper |
| Online Node-weighted Steiner Forest and Extensions via Disk Paintings | 2017-05-30 | Paper |
| A tight algorithm for strongly connected Steiner subgraph on two terminals with demands | 2017-05-02 | Paper |
| Designing FPT algorithms for cut problems using randomized contractions | 2016-08-16 | Paper |
| On fixed cost \(k\)-flow problems | 2016-03-21 | Paper |
| Subexponential parameterized algorithms on bounded-genus graphs and \(H\)-minor-free graphs | 2015-12-04 | Paper |
| Revenue maximization for selling multiple correlated items | 2015-11-19 | Paper |
| Prophet secretary | 2015-11-19 | Paper |
| Approximation algorithms for connected maximum cut and related problems | 2015-11-19 | Paper |
| A Tight Algorithm for Strongly Connected Steiner Subgraph on Two Terminals with Demands (Extended Abstract) | 2015-09-15 | Paper |
| Fixed-parameter algorithms for ( k , r )-center in planar graphs and map graphs | 2015-09-02 | Paper |
| Equivalence of local treewidth and linear local treewidth and its algorithmic applications | 2015-08-03 | Paper |
| Subexponential parameterized algorithms on graphs of bounded-genus and \(H\)-minor-free graphs | 2015-08-03 | Paper |
| On a local protocol for concurrent file transfers | 2015-01-19 | Paper |
| Network Cournot competition | 2015-01-07 | Paper |
| Randomized revenue monotone mechanisms for online advertising | 2015-01-07 | Paper |
| Correction: ``Basic network creation games | 2014-12-22 | Paper |
| Approximation algorithms for node-weighted buy-at-bulk network design | 2014-12-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2934606 | 2014-12-18 | Paper |
| Minimizing movement | 2014-12-18 | Paper |
| Semi-oblivious routing: lower bounds | 2014-12-18 | Paper |
| Submodular secretary problem and extensions | 2014-12-05 | Paper |
| Prize-collecting steiner network problems | 2014-12-05 | Paper |
| Minimizing movement | 2014-11-18 | Paper |
| Dial a ride from \(k\)-forest | 2014-11-18 | Paper |
| Dial a ride from \(k\)-forest | 2014-11-18 | Paper |
| Bidimensionality: new connections between FPT algorithms and PTASs | 2014-10-13 | Paper |
| Graphs excluding a fixed minor have grids as large as treewidth, with combinatorial and algorithmic applications through bidimensionality | 2014-10-13 | Paper |
| Ordinal embeddings of minimum relaxation, general properties, trees, and ultrametrics | 2014-10-13 | Paper |
| Online client-server load balancing without global information | 2014-10-13 | Paper |
| Oblivious routing on node-capacitated and directed graphs | 2014-10-13 | Paper |
| Assignment problem in content distribution networks, unsplittable hard-capacitated facility location | 2014-09-09 | Paper |
| The price of anarchy in network creation games | 2014-09-09 | Paper |
| On fixed cost \(k\)-flow problems | 2014-09-02 | Paper |
| Approximation schemes for Steiner forest on planar graphs and graphs of bounded treewidth | 2014-08-13 | Paper |
| Improved Approximation Algorithms for PRIZE-COLLECTING STEINER TREE and TSP | 2014-07-25 | Paper |
| Near-optimal online algorithms for prize-collecting Steiner problems | 2014-07-01 | Paper |
| Online stochastic reordering buffer scheduling | 2014-07-01 | Paper |
| Contraction decomposition in \(h\)-minor-free graphs and algorithmic applications | 2014-06-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5417628 | 2014-05-22 | Paper |
| The price of anarchy in network creation games | 2014-03-13 | Paper |
| Approximation Schemes for Steiner Forest on Planar Graphs and Graphs of Bounded Treewidth | 2014-02-17 | Paper |
| Scheduling to minimize gaps and power consumption | 2014-02-05 | Paper |
| Fixed-Parameter and Approximation Algorithms: A New Look | 2013-12-10 | Paper |
| Fixed-parameter tractability of directed multiway cut parameterized by the size of the cutset | 2013-11-14 | Paper |
| Scheduling a cascade with opposing influences | 2013-10-23 | Paper |
| The online stochastic generalized assignment problem | 2013-10-04 | Paper |
| Approximation algorithms for movement repairmen | 2013-10-04 | Paper |
| Basic network creation games | 2013-09-26 | Paper |
| Directed Subset Feedback Vertex Set is fixed-parameter tractable | 2013-08-12 | Paper |
| Improved approximation algorithms for (budgeted) node-weighted Steiner problems | 2013-08-06 | Paper |
| A greedy approximation algorithm for minimum-gap scheduling | 2013-06-07 | Paper |
| Approximation algorithms via contraction decomposition | 2013-04-05 | Paper |
| Scheduling to minimize staleness and stretch in real-time data warehouses | 2012-12-10 | Paper |
| Local search algorithms for the red-blue median problem | 2012-12-06 | Paper |
| The checkpoint problem | 2012-10-11 | Paper |
| Euclidean prize-collecting Steiner forest | 2012-04-26 | Paper |
| The price of anarchy in cooperative network creation games | 2012-04-24 | Paper |
| AdCell: ad allocation in cellular networks | 2011-09-16 | Paper |
| Improved approximation algorithms for label cover problems | 2011-08-16 | Paper |
| Improved approximation algorithms for prize-collecting Steiner tree and TSP | 2011-07-29 | Paper |
| Approximation algorithms for nonuniform buy-at-bulk network design | 2010-11-04 | Paper |
| Submodular secretary problem and extensions | 2010-09-10 | Paper |
| The checkpoint problem | 2010-09-10 | Paper |
| The cooperative game theory foundations of network bargaining games | 2010-09-07 | Paper |
| Budgeted red-blue median and its generalizations | 2010-09-06 | Paper |
| Improved lower and upper bounds for universal TSP in planar metrics | 2010-08-16 | Paper |
| Oblivious network design | 2010-08-16 | Paper |
| Improved approximation algorithms for minimum-weight vertex separators | 2010-08-16 | Paper |
| New lower bounds for oblivious routing in undirected graphs | 2010-08-16 | Paper |
| Combination can be hard | 2010-08-16 | Paper |
| Oblivious routing in directed graphs with random demands | 2010-08-16 | Paper |
| Prize-collecting Steiner network problems | 2010-06-22 | Paper |
| Prize-collecting Steiner networks via iterative rounding | 2010-04-27 | Paper |
| Euclidean Prize-Collecting Steiner Forest | 2010-04-27 | Paper |
| An \(O(\sqrt n)\)-approximation algorithm for directed sparsest cut | 2009-12-18 | Paper |
| A note on the subadditive network design problem | 2009-11-17 | Paper |
| Minimizing Movement: Fixed-Parameter Tractability | 2009-10-29 | Paper |
| Improved Approximation Algorithms for Label Cover Problems | 2009-10-29 | Paper |
| Combination Can Be Hard: Approximability of the Unique Coverage Problem | 2009-08-20 | Paper |
| Node-Weighted Steiner Tree and Group Steiner Tree in Planar Graphs | 2009-07-14 | Paper |
| Approximation Algorithms via Structural Results for Apex-Minor-Free Graphs | 2009-07-14 | Paper |
| Algorithmic graph minor theory: Improved grid minor bounds and Wagner's contraction | 2009-06-22 | Paper |
| Hat Guessing Games | 2009-06-11 | Paper |
| Hat Guessing Games | 2009-05-27 | Paper |
| Approximating buy-at-bulk and shallow-light \(k\)-Steiner trees | 2009-05-13 | Paper |
| LATIN 2004: Theoretical Informatics | 2009-05-07 | Paper |
| Improved Approximation Algorithms for Minimum Weight Vertex Separators | 2009-04-30 | Paper |
| Stochastic Steiner Tree with Non-uniform Inflation | 2009-02-17 | Paper |
| Plane embeddings of planar graph metrics | 2009-02-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3549721 | 2009-01-05 | Paper |
| Ordinal Embedding: Approximation Algorithms and Dimensionality Reduction | 2008-11-27 | Paper |
| Linearity of grid minors in treewidth with applications through bidimensionality | 2008-10-21 | Paper |
| Dial a Ride from k-Forest | 2008-09-25 | Paper |
| Localized Client-Server Load Balancing without Global Information | 2008-08-14 | Paper |
| Algorithmic Graph Minor Theory: Improved Grid Minor Bounds and Wagner’s Contraction | 2008-04-24 | Paper |
| Plane embeddings of planar graph metrics | 2008-01-04 | Paper |
| Power Optimization for Connectivity Problems | 2007-08-30 | Paper |
| Approximating Buy-at-Bulk and Shallow-Light k-Steiner Trees | 2007-08-28 | Paper |
| Subgraph isomorphism, log-bounded fragmentation, and graphs of (locally) bounded treewidth | 2007-05-30 | Paper |
| Fast approximation schemes for K3, 3-minor-free or K5-minor-free graphs | 2007-05-29 | Paper |
| The Bidimensional Theory of Bounded-Genus Graphs | 2007-05-22 | Paper |
| Power optimization for connectivity problems | 2007-04-19 | Paper |
| Quickly deciding minor-closed parameters in general graphs | 2006-12-07 | Paper |
| Low-dimensional embedding with extra information | 2006-12-06 | Paper |
| On the Max-flow min-cut ratio for directed multicommodity flows | 2006-03-24 | Paper |
| Graph Drawing | 2005-12-07 | Paper |
| Bidimensional Parameters and Local Treewidth | 2005-09-16 | Paper |
| Mathematical Foundations of Computer Science 2004 | 2005-08-22 | Paper |
| Balanced vertex-orderings of graphs | 2005-05-04 | Paper |
| Exponential speedup of fixed-parameter algorithms for classes of graphs excluding single-crossing graphs as minors | 2005-04-29 | Paper |
| Diameter and treewidth in minor-closed graph families, revisited | 2005-02-11 | Paper |
| Characterization of networks supporting multi-dimensional linear interval routing schemes | 2005-01-11 | Paper |
| Approximation algorithms for classes of graphs excluding single-crossing graphs as minors | 2004-10-01 | Paper |
| Random MAX SAT, random MAX CUT, and their phase transitions | 2004-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4471319 | 2004-07-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4449223 | 2004-02-08 | Paper |
| A note on the bounded fragmentation property and its applications in network reliability | 2003-11-16 | Paper |
| The Satisfiability Threshold of Random 3-SAT Is at Least 3.52 | 2003-10-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4425961 | 2003-09-14 | Paper |
| The facility location problem with general cost functions | 2003-08-20 | Paper |
| Palindrome recognition using a multidimensional tape. | 2003-08-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4411278 | 2003-07-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4708579 | 2003-06-18 | Paper |
| A note on the consecutive ones submatrix problem. | 2003-01-21 | Paper |
| Length-constrained path-matchings in graphs | 2002-09-29 | Paper |
