| Publication | Date of Publication | Type |
|---|
| Dynamic pricing provides robust equilibria in stochastic ridesharing networks | 2024-11-07 | Paper |
| Small-Loss Bounds for Online Learning with Partial Information | 2022-09-26 | Paper |
| Algorithms as Mechanisms: The Price of Anarchy of Relax and Round | 2021-06-03 | Paper |
| Virtues of Patience in Strategic Queuing Systems | 2020-11-19 | Paper |
| Simple and efficient budget feasible mechanisms for monotone submodular valuations | 2020-06-18 | Paper |
| Information Asymmetries in Common-Value Auctions with Discrete Signals | 2020-04-30 | Paper |
| Stability and Learning in Strategic Queuing Systems | 2020-03-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5743443 | 2019-05-10 | Paper |
| Separating maximally violated comb inequalities in planar graphs | 2019-01-11 | Paper |
| Learning and Efficiency in Games with Dynamic Population | 2018-07-16 | Paper |
| The Price of Anarchy in Auctions | 2017-06-08 | Paper |
| The curse of simultaneity | 2016-10-07 | Paper |
| A constant-factor approximation algorithm for the \(k\)-median problem (extended abstract) | 2016-09-29 | Paper |
| Scheduling data transfers in a network and the set scheduling problem | 2016-09-29 | Paper |
| Approximation algorithms for classification problems with pairwise relationships | 2015-12-07 | Paper |
| How bad is selfish routing? | 2015-10-30 | Paper |
| Frugal path mechanisms | 2015-09-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2941641 | 2015-08-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501276 | 2015-08-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501372 | 2015-08-03 | Paper |
| Improved bounds on the max-flow min-cut ratio for multicommodity flows | 2015-05-07 | Paper |
| A network pricing game for selfish traffic | 2015-03-10 | Paper |
| Bounding the inefficiency of outcomes in generalized second price auctions | 2015-02-13 | Paper |
| Introduction to computer science and economic theory | 2015-02-13 | Paper |
| Multiplicative updates outperform generic no-regret learning in congestion games | 2015-02-04 | Paper |
| Strong Price of Anarchy, Utility Games and Coalitional Dynamics | 2015-01-14 | Paper |
| Can Credit Increase Revenue? | 2015-01-12 | Paper |
| Equilibrium in Combinatorial Public Projects | 2015-01-12 | Paper |
| The effect of collusion in congestion games | 2014-11-25 | Paper |
| Facility location with hierarchical facility costs | 2014-11-18 | Paper |
| Network design for information networks | 2014-10-13 | Paper |
| Approximating the smallest \(k\)-edge connected spanning subgraph by LP-rounding | 2014-10-13 | Paper |
| A constant factor approximation algorithm for a class of classification problems | 2014-09-26 | Paper |
| Composable and efficient mechanisms | 2014-08-07 | Paper |
| Which Networks are Least Susceptible to Cascading Failures? | 2014-07-30 | Paper |
| Load balancing without regret in the bulletin board model | 2014-07-23 | Paper |
| A network pricing game for selfish traffic | 2013-06-20 | Paper |
| Primal-dual-based algorithms for a directed network design problem | 2012-06-08 | Paper |
| Stronger Bounds on Braess's Paradox and the Maximum Latency of Selfish Routing | 2012-03-15 | Paper |
| Load balancing without regret in the bulletin board model | 2012-02-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3002793 | 2011-05-24 | Paper |
| Approximating the smallest k -edge connected spanning subgraph by LP-rounding | 2010-11-24 | Paper |
| Facility location with hierarchical facility costs | 2010-08-16 | Paper |
| Near-optimal network design with selfish agents | 2010-08-16 | Paper |
| Network games | 2010-08-15 | Paper |
| Trading networks with price-setting agents | 2009-08-27 | Paper |
| The Price of Stability for Network Design with Fair Cost Allocation | 2009-08-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3549713 | 2009-01-05 | Paper |
| Parallel Imaging Problem | 2008-11-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3524726 | 2008-09-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3524728 | 2008-09-12 | Paper |
| Cost-sharing mechanisms for network design | 2008-02-18 | Paper |
| Automata, Languages and Programming | 2006-01-10 | Paper |
| Automata, Languages and Programming | 2006-01-10 | Paper |
| Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2005-08-25 | Paper |
| Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2005-08-25 | Paper |
| An Approximate Truthful Mechanism for Combinatorial Auctions with Single Parameter Agents | 2005-04-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4829039 | 2004-11-29 | Paper |
| Bounding the inefficiency of equilibria in nonatomic congestion games | 2004-10-28 | Paper |
| Algorithms for a network design problem with crossing supermodular demands | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4471296 | 2004-07-28 | Paper |
| Scheduling data transfers in a network and the set scheduling problem | 2004-03-14 | Paper |
| A constant-factor approximation algorithm for the \(k\)-median problem | 2003-05-04 | Paper |
| Fairness in routing and load balancing | 2002-02-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4234048 | 2002-02-03 | Paper |
| Separating maximally violated comb inequalities in planar graphs | 2001-11-26 | Paper |
| The quickest transshipment problem | 2001-11-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2729096 | 2001-10-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4527034 | 2001-03-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4526991 | 2001-02-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4263723 | 2000-11-27 | Paper |
| Allocating Bandwidth for Bursty Connections | 2000-10-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4228490 | 2000-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4231910 | 2000-04-26 | Paper |
| Efficient continuous-time dynamic network flow algorithms | 1999-12-19 | Paper |
| Approximations for the disjoint paths problem in high-diameter planar networks | 1999-01-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3840368 | 1998-08-10 | Paper |
| Approximation Algorithms for Steiner and Directed Multicuts | 1997-07-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3128880 | 1997-04-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3128904 | 1997-04-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4886085 | 1996-10-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4871777 | 1996-08-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4871788 | 1996-04-08 | Paper |
| Improved bounds on the max-flow min-cut ratio for multicommodity flows | 1996-03-11 | Paper |
| Fast Approximation Algorithms for Fractional Packing and Covering Problems | 1995-09-17 | Paper |
| Fast approximation algorithms for multicommodity flow problems | 1995-07-05 | Paper |
| An approximation algorithm for the generalized assignment problem | 1995-01-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3138913 | 1994-09-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3138915 | 1994-09-19 | Paper |
| A faster parametric minimum-cut algorithm | 1994-09-11 | Paper |
| Faster Approximation Algorithms For the Unit Capacity Concurrent Flow Problem with Applications to Routing and Finding Sparse Cuts | 1994-08-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3140449 | 1993-12-15 | Paper |
| Polynomial dual network simplex algorithms | 1993-12-06 | Paper |
| Improved bounds for the max-flow min-multicut ratio for planar and \(K_{r,r}\)-free graphs | 1993-10-17 | Paper |
| Algorithms for routing around a rectangle | 1993-05-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4011249 | 1992-09-27 | Paper |
| Using separation algorithms in fixed dimension | 1992-06-28 | Paper |
| Using Interior-Point Methods for Fast Parallel Algorithms for Bipartite Matching and Related Problems | 1992-06-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3977426 | 1992-06-25 | Paper |
| The gap between monotone and non-monotone circuit complexity is exponential | 1992-06-25 | Paper |
| Combinatorial Algorithms for the Generalized Circulation Problem | 1991-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3352816 | 1990-01-01 | Paper |
| Approximation algorithms for scheduling unrelated parallel machines | 1990-01-01 | Paper |
| An intersection theorem for supermatroids | 1990-01-01 | Paper |
| An application of submodular flows | 1989-01-01 | Paper |
| Note on Weintraub’s Minimum-Cost Circulation Algorithm | 1989-01-01 | Paper |
| On fractional multicommodity flows and distance functions | 1989-01-01 | Paper |
| Generalized polymatroids and submodular flows | 1988-01-01 | Paper |
| An O (n 2 (m + N log n )log n ) min-cost flow algorithm | 1988-01-01 | Paper |
| An application of simultaneous diophantine approximation in combinatorial optimization | 1987-01-01 | Paper |
| Sensitivity theorems in integer linear programming | 1986-01-01 | Paper |
| Layered Augmenting Path Algorithms | 1986-01-01 | Paper |
| A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3682243 | 1985-01-01 | Paper |
| A strongly polynomial minimum cost circulation algorithm | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3737443 | 1985-01-01 | Paper |
| Covering directed and odd cuts | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3678944 | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3688403 | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3682499 | 1984-01-01 | Paper |
