| Publication | Date of Publication | Type |
|---|
| Algorithms for maximum social welfare of online random trading | 2024-06-20 | Paper |
| Packing Feedback Arc Sets in Tournaments Exactly | 2024-03-05 | Paper |
| Bounding Residence Times for Atomic Dynamic Routings | 2023-01-09 | Paper |
| On weak Pareto optimality of nonatomic routing networks | 2022-10-04 | Paper |
| Mechanisms for dual-role-facility location games: truthfulness and approximability | 2022-09-16 | Paper |
| Atomic Dynamic Flow Games: Adaptive vs. Nonadaptive Agents | 2022-02-16 | Paper |
| Algorithms for the metric ring star problem with fixed edge-cost ratio | 2021-11-25 | Paper |
| Tight efficiency lower bounds for strategy-proof mechanisms in two-opposite-facility location game | 2021-03-11 | Paper |
| The efficiency of Nash equilibria in the load balancing game with a randomizing scheduler | 2020-09-01 | Paper |
| Sequential Location Game on Continuous Directional Star Networks | 2020-07-20 | Paper |
| The price of anarchy for the load balancing game with a randomizing scheduler | 2020-05-13 | Paper |
| Ranking tournaments with no errors. II: Minimax relation | 2020-04-07 | Paper |
| Ranking tournaments with no errors. I: Structural description | 2020-01-15 | Paper |
| Densities, Matchings, and Fractional Edge-Colorings | 2019-02-08 | Paper |
| The equilibrium existence of a robust routing game under interval uncertainty | 2018-11-08 | Paper |
| Mechanism design for two-opposite-facility location games with penalties on distance | 2018-11-08 | Paper |
| Embedding games with strategic complements into games with strategic substitutes | 2018-10-26 | Paper |
| Covering triangles in edge-weighted graphs | 2018-08-03 | Paper |
| Algorithms for the ring star problem | 2018-03-26 | Paper |
| Finding connected \(k\)-subgraphs with high density | 2017-09-28 | Paper |
| Continuous Firefighting on Infinite Square Grids | 2017-05-19 | Paper |
| Approximation algorithms for pricing with negative network externalities | 2017-02-22 | Paper |
| Network characterizations for excluding Braess's paradox | 2017-02-01 | Paper |
| Total Dual Integrality of Triangle Covering | 2017-02-01 | Paper |
| Sufficient Conditions for Tuza’s Conjecture on Packing and Covering Triangles | 2016-09-29 | Paper |
| Network Topologies for Weakly Pareto Optimal Nonatomic Selfish Routing | 2016-09-02 | Paper |
| A Polyhedral Description of Kernels | 2016-08-10 | Paper |
| Copula-based randomized mechanisms for truthful scheduling on two unrelated machines | 2016-01-13 | Paper |
| Approximation for the minimum cost doubly resolving set problem | 2015-12-11 | Paper |
| Excluding Braess’s Paradox in Nonatomic Selfish Routing | 2015-11-04 | Paper |
| Finding Connected Dense $$k$$-Subgraphs | 2015-09-30 | Paper |
| Balancing Load via Small Coalitions in Selfish Ring Routing Games | 2015-04-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2923563 | 2014-11-03 | Paper |
| Schedules for marketing products with negative externalities | 2014-10-06 | Paper |
| Approximability of the Minimum Weighted Doubly Resolving Set Problem | 2014-09-26 | Paper |
| Risk models for the prize collecting Steiner tree problems with interval data | 2014-08-29 | Paper |
| Stability vs. optimality in selfish ring routing | 2014-06-11 | Paper |
| Reducing price of anarchy of selfish task allocation with more selfishness | 2014-01-16 | Paper |
| Maximizing the minimum load: the cost of selfishness | 2014-01-09 | Paper |
| Copula-Based Randomized Mechanisms for Truthful Scheduling on Two Unrelated Machines | 2013-10-23 | Paper |
| How to Schedule the Marketing of Products with Negative Externalities | 2013-06-11 | Paper |
| Total Dual Integrality in Some Facility Location Problems | 2013-01-04 | Paper |
| The Maximum-Weight Stable Matching Problem: Duality and Efficiency | 2013-01-04 | Paper |
| Efficiency of Dual Equilibria in Selfish Task Allocation to Selfish Machines | 2012-11-02 | Paper |
| Pairwise cooperations in selfish ring routing for minimax linear latency | 2012-08-13 | Paper |
| Packing cycles exactly in polynomial time | 2012-05-23 | Paper |
| Bonds with parity constraints | 2012-05-11 | Paper |
| A Characterization of Box-Mengerian Matroid Ports | 2011-04-27 | Paper |
| A Unified Approach to Box-Mengerian Hypergraphs | 2011-04-27 | Paper |
| Deterministic risk control for cost-effective network connections | 2011-01-28 | Paper |
| Reducing the Maximum Latency of Selfish Ring Routing via Pairwise Cooperations | 2011-01-10 | Paper |
| Cost-effective designs of fault-tolerant access networks in communication systems | 2010-11-24 | Paper |
| Efficient Algorithms for the Prize Collecting Steiner Tree Problems with Interval Data | 2010-07-20 | Paper |
| The price of atomic selfish ring routing | 2010-06-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3640350 | 2009-11-11 | Paper |
| A polynomial solvable minimum risk spanning tree problem with interval data | 2009-06-30 | Paper |
| Approximation algorithms for soft-capacitated facility location in capacitated network design | 2009-06-17 | Paper |
| The box-TDI system associated with 2-edge connected spanning subgraphs | 2009-03-04 | Paper |
| On the Minimum Risk-Sum Path Problem | 2009-03-03 | Paper |
| The Minimum Risk Spanning Tree Problem | 2009-03-03 | Paper |
| A new model for path planning with interval data | 2009-02-12 | Paper |
| On the restricted forwarding index problem in communication networks | 2009-01-27 | Paper |
| Inapproximability and approximability of minimal tree routing and coloring | 2008-08-08 | Paper |
| A Min-Max Theorem on Tournaments | 2008-06-19 | Paper |
| A Min-Max Relation on Packing Feedback Vertex Sets | 2008-05-27 | Paper |
| Algorithms and Computation | 2006-11-14 | Paper |
| Inapproximability and approximability of maximal tree routing and coloring | 2006-08-14 | Paper |
| An efficient algorithm for finding maximum cycle packings in reducible flow graphs | 2006-06-14 | Paper |
| Computing and Combinatorics | 2006-01-11 | Paper |
| Algorithms and Computation | 2005-12-22 | Paper |
| Algorithmic Applications in Management | 2005-11-30 | Paper |
| Perfect circular arc coloring | 2005-10-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4463367 | 2004-05-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4545983 | 2002-08-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2721689 | 2001-07-10 | Paper |
