| Publication | Date of Publication | Type |
|---|
| On the complexity of nucleolus computation for bipartite \(b\)-matching games | 2024-04-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6090900 | 2023-11-20 | Paper |
| Scalable timing-aware network design via Lagrangian decomposition | 2023-07-10 | Paper |
| Approximating stable matchings with ties of bounded size | 2022-12-21 | Paper |
| A general framework for computing the nucleolus via dynamic programming | 2022-12-21 | Paper |
| On the complexity of nucleolus computation for bipartite \(b\)-matching games | 2022-06-01 | Paper |
| On the Integrality Gap of the Prize-Collecting Steiner Forest LP | 2021-07-28 | Paper |
| Travelling on graphs with small highway dimension | 2021-04-19 | Paper |
| Computing the nucleolus of weighted cooperative matching games in polynomial time | 2020-08-28 | Paper |
| Travelling on graphs with small highway dimension | 2020-02-24 | Paper |
| Computing the nucleolus of weighted cooperative matching games in polynomial time | 2020-02-06 | Paper |
| Vehicle routing with subtours | 2019-11-28 | Paper |
| Additive stabilizers for unstable graphs | 2019-06-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5743501 | 2019-05-10 | Paper |
| An elementary integrality proof of Rothblum's stable matching formulation | 2019-01-15 | Paper |
| Distributed weighted vertex cover via maximal matchings | 2018-11-05 | Paper |
| A $(1+\varepsilon)$-Embedding of Low Highway Dimension Graphs into Bounded Treewidth Graphs | 2018-09-18 | Paper |
| Fast Approximation Algorithms for the Generalized Survivable Network Design Problem | 2018-04-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4607935 | 2018-03-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5369505 | 2017-10-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2969617 | 2017-03-22 | Paper |
| Stable marriage with general preferences | 2017-02-01 | Paper |
| On the equivalence of the bidirected and hypergraphic relaxations for Steiner tree | 2016-11-25 | Paper |
| Lehman's Theorem and the Directed Steiner Tree Problem | 2016-01-15 | Paper |
| Network bargaining: using approximate blocking sets to stabilize unstable instances | 2016-01-13 | Paper |
| Finding small stabilizers for unstable graphs | 2015-12-09 | Paper |
| Approximate Deadline-Scheduling with Precedence Constraints | 2015-11-19 | Paper |
| A $$(1+{\varepsilon })$$ ( 1 + ε ) -Embedding of Low Highway Dimension Graphs into Bounded Treewidth Graphs | 2015-10-27 | Paper |
| Sharing the cost more efficiently | 2015-09-02 | Paper |
| Efficient cost-sharing mechanisms for prize-collecting problems | 2015-08-31 | Paper |
| Primal-dual based distributed algorithms for vertex cover with semi-hard capacities | 2015-03-10 | Paper |
| Stable Marriage with General Preferences | 2015-01-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2934710 | 2014-12-18 | Paper |
| Simple cost sharing schemes for multicommodity rent-or-buy and stochastic Steiner tree | 2014-11-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2921719 | 2014-10-13 | Paper |
| Social exchange networks with distant bargaining | 2014-10-06 | Paper |
| A matter of degree | 2014-09-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3191865 | 2014-09-25 | Paper |
| Finding Small Stabilizers for Unstable Graphs | 2014-06-02 | Paper |
| Linear Programming Hierarchies Suffice for Directed Steiner Tree | 2014-06-02 | Paper |
| On generalizations of network design problems with degree bounds | 2013-11-11 | Paper |
| The school bus problem on trees | 2013-11-11 | Paper |
| Network Bargaining with General Capacities | 2013-09-17 | Paper |
| Better Approximation Algorithms for Technology Diffusion | 2013-09-17 | Paper |
| Social Exchange Networks with Distant Bargaining | 2013-06-11 | Paper |
| Network bargaining: using approximate blocking sets to stabilize unstable instances | 2013-03-13 | Paper |
| The School Bus Problem on Trees | 2011-12-16 | Paper |
| Strict Cost Sharing Schemes for Steiner Forest | 2011-04-04 | Paper |
| A unified approach to approximating partial covering problems | 2011-03-30 | Paper |
| Primal-dual meets local search | 2010-08-16 | Paper |
| On generalizations of network design problems with degree bounds | 2010-06-22 | Paper |
| On Column-Restricted and Priority Covering Integer Programs | 2010-06-22 | Paper |
| Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques | 2010-05-26 | Paper |
| Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques | 2010-05-26 | Paper |
| FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science | 2009-08-06 | Paper |
| A Primal-Dual Bicriteria Distributed Algorithm for Capacitated Vertex Cover | 2009-06-22 | Paper |
| On the integrality ratio for tree augmentation | 2009-03-04 | Paper |
| A Group-Strategyproof Cost Sharing Mechanism for the Steiner Forest Game | 2008-10-28 | Paper |
| Cut Problems in Graphs with a Budget Constraint | 2008-09-18 | Paper |
| Faster and Simpler Algorithms for Multicommodity Flow and Other Fractional Packing Problems | 2008-04-22 | Paper |
| A Unified Approach to Approximating Partial Covering Problems | 2008-03-11 | Paper |
| Cut problems in graphs with a budget constraint | 2007-10-30 | Paper |
| Computing and Combinatorics | 2006-01-11 | Paper |
| Automata, Languages and Programming | 2006-01-10 | Paper |
| Primal-Dual Meets Local Search: Approximating MSTs With Nonuniform Degree Bounds | 2005-09-16 | Paper |
| Approximating \(k\)-hop minimum-spanning trees | 2005-08-25 | Paper |
| Approximating the degree-bounded minimum diameter spanning tree problem | 2005-02-21 | Paper |
| Min-max tree covers of graphs. | 2005-01-11 | Paper |
| An approximation algorithm for the edge-dilation \(k\)-center problem. | 2005-01-11 | Paper |
| Non-clairvoyant scheduling for minimizing mean slowdown | 2004-11-05 | Paper |
| Improved approximations for tour and tree covers | 2004-09-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3046493 | 2004-08-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4471338 | 2004-07-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4418655 | 2003-08-11 | Paper |
| A Matter of Degree: Improved Approximation Algorithms for Degree-Bounded Minimum Spanning Trees | 2002-09-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2753739 | 2002-01-06 | Paper |
