| Publication | Date of Publication | Type |
|---|
The smoothed number of Pareto-optimal solutions in bicriteria integer optimization
Mathematical Programming. Series A. Series B | 2023-05-25 | Paper |
| scientific article; zbMATH DE number 7053320 (Why is no real title available?) | 2019-05-10 | Paper |
A universally-truthful approximation scheme for multi-unit auctions
Games and Economic Behavior | 2019-03-29 | Paper |
Primal beats dual on online packing LPs in the random-order model
SIAM Journal on Computing | 2018-11-07 | Paper |
Smoothed analysis of the 2-Opt algorithm for the general TSP
ACM Transactions on Algorithms | 2018-11-05 | Paper |
A packet routing protocol for arbitrary networks
STACS 95 | 2017-12-04 | Paper |
Truthful mechanism design via correlated tree rounding
Mathematical Programming. Series A. Series B | 2017-05-15 | Paper |
From static to dynamic routing: efficient transformations of store-and-forward protocols
Proceedings of the thirty-first annual ACM symposium on Theory of Computing | 2016-09-29 | Paper |
How asymmetry helps load balancing
Journal of the ACM | 2015-11-12 | Paper |
On the impact of combinatorial structure on congestion games
Journal of the ACM | 2015-11-11 | Paper |
Economical caching
ACM Transactions on Computation Theory | 2015-09-24 | Paper |
Tight bounds for worst-case equilibria
ACM Transactions on Algorithms | 2015-09-02 | Paper |
Computing equilibria for a service provider game with (Im)perfect information
ACM Transactions on Algorithms | 2015-09-02 | Paper |
| Computing equilibria for congestion games with (im)perfect information | 2015-08-03 | Paper |
| Probabilistic analysis of knapsack core algorithms | 2015-08-03 | Paper |
Primal beats dual on online packing LPs in the random-order model
Proceedings of the forty-sixth annual ACM symposium on Theory of computing | 2015-06-26 | Paper |
Adaptive routing with stale information
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing | 2015-03-10 | Paper |
Almost optimal permutation routing on hypercubes
Proceedings of the thirty-third annual ACM symposium on Theory of computing | 2015-02-27 | Paper |
| Worst case and probabilistic analysis of the 2-Opt algorithm for the TSP (extended abstract) | 2014-12-18 | Paper |
Fast convergence to Wardrop equilibria by adaptive sampling methods
Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing | 2014-11-25 | Paper |
Balanced allocations: the heavily loaded case
Proceedings of the thirty-second annual ACM symposium on Theory of computing | 2014-09-26 | Paper |
Comparative study of approximation algorithms and heuristics for SINR scheduling with power control
Theoretical Computer Science | 2014-09-18 | Paper |
Online capacity maximization in wireless networks
Journal of Scheduling | 2014-08-18 | Paper |
Oblivious interference scheduling
Proceedings of the 28th ACM symposium on Principles of distributed computing | 2014-07-23 | Paper |
Thorp shuffling, butterflies, and non-Markovian couplings
Automata, Languages, and Programming | 2014-07-01 | Paper |
Online independent set beyond the worst-case: secretaries, prophets, and periods
Automata, Languages, and Programming | 2014-07-01 | Paper |
Worst case and probabilistic analysis of the 2-Opt algorithm for the TSP
Algorithmica | 2014-03-25 | Paper |
An optimal online algorithm for weighted bipartite matching and extensions to combinatorial auctions
Lecture Notes in Computer Science | 2013-09-17 | Paper |
Approximating Wardrop equilibria with finitely many agents
Distributed Computing | 2013-07-04 | Paper |
Online mechanism design (randomized rounding on the fly)
Automata, Languages, and Programming | 2012-11-01 | Paper |
Randomized mechanisms for multi-unit auctions (extended abstract)
Automata, Languages, and Programming | 2012-11-01 | Paper |
Online packing with gradually improving capacity estimations and applications to network lifetime maximization
Automata, Languages, and Programming | 2012-11-01 | Paper |
Computing approximate Nash equilibria in network congestion games
Networks | 2012-09-21 | Paper |
| Economical caching | 2012-04-24 | Paper |
Approximation techniques for utilitarian mechanism design
SIAM Journal on Computing | 2012-03-15 | Paper |
Improved algorithms for latency minimization in wireless networks
Theoretical Computer Science | 2011-06-07 | Paper |
Uncoordinated two-sided matching markets
SIAM Journal on Computing | 2011-05-17 | Paper |
Scheduling and power assignments in the physical model
Monographs in Theoretical Computer Science. An EATCS Series | 2011-04-05 | Paper |
Fast convergence to Wardrop equilibria by adaptive sampling methods
SIAM Journal on Computing | 2011-04-04 | Paper |
Selfish Traffic Allocation for Server Farms
SIAM Journal on Computing | 2010-11-04 | Paper |
Distributed contention resolution in wireless networks
Lecture Notes in Computer Science | 2010-09-10 | Paper |
Random knapsack in expected polynomial time
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing | 2010-08-16 | Paper |
Approximation techniques for utilitarian mechanism design
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing | 2010-08-16 | Paper |
Typical properties of winners and losers in discrete optimization
Proceedings of the thirty-sixth annual ACM symposium on Theory of computing | 2010-08-15 | Paper |
Selfish traffic allocation for server farms
Proceedings of the thiry-fourth annual ACM symposium on Theory of computing | 2010-08-05 | Paper |
A unified approach to congestion games and two-sided markets
Internet Mathematics | 2010-07-09 | Paper |
Who should pay for forwarding packets?
Internet Mathematics | 2010-07-09 | Paper |
Economical Caching with Stochastic Prices
Stochastic Algorithms: Foundations and Applications | 2009-11-19 | Paper |
Approximability of OFDMA Scheduling
Lecture Notes in Computer Science | 2009-10-29 | Paper |
Adaptive routing with stale information
Theoretical Computer Science | 2009-08-21 | Paper |
Improved Algorithms for Latency Minimization in Wireless Networks
Automata, Languages and Programming | 2009-07-14 | Paper |
Management of Variable Data Streams in Networks
Algorithmics of Large and Complex Networks | 2009-07-09 | Paper |
Pure Nash equilibria in player-specific and weighted congestion games
Theoretical Computer Science | 2009-04-29 | Paper |
| scientific article; zbMATH DE number 5485547 (Why is no real title available?) | 2009-01-05 | Paper |
| Selfish load balancing | 2008-09-12 | Paper |
Approximating Wardrop Equilibria with Finitely Many Agents
Lecture Notes in Computer Science | 2008-09-02 | Paper |
Computing Approximate Nash Equilibria in Network Congestion Games
Structural Information and Communication Complexity | 2008-07-10 | Paper |
Mathematical Foundations of Computer Science 2003
Lecture Notes in Computer Science | 2007-12-07 | Paper |
The Smoothed Number of Pareto Optimal Solutions in Bicriteria Integer Optimization
Integer Programming and Combinatorial Optimization | 2007-11-29 | Paper |
Smoothed Analysis of Integer Programming
Integer Programming and Combinatorial Optimization | 2007-08-30 | Paper |
Decision-making based on approximate and smoothed Pareto curves
Theoretical Computer Science | 2007-07-09 | Paper |
An experimental study of random knapsack problems
Algorithmica | 2007-06-21 | Paper |
On the structure and complexity of worst-case equilibria
Theoretical Computer Science | 2007-06-13 | Paper |
Smoothed analysis of integer programming
Mathematical Programming. Series A. Series B | 2007-04-19 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2006-11-14 | Paper |
Balanced Allocations: The Heavily Loaded Case
SIAM Journal on Computing | 2006-06-01 | Paper |
Typical Properties of Winners and Losers [0.2ex in Discrete Optimization]
SIAM Journal on Computing | 2006-06-01 | Paper |
Algorithms – ESA 2004
Lecture Notes in Computer Science | 2005-08-18 | Paper |
Algorithms – ESA 2004
Lecture Notes in Computer Science | 2005-08-18 | Paper |
| scientific article; zbMATH DE number 2119691 (Why is no real title available?) | 2004-11-29 | Paper |
Random knapsack in expected polynomial time
Journal of Computer and System Sciences | 2004-11-18 | Paper |
| scientific article; zbMATH DE number 2090659 (Why is no real title available?) | 2004-08-12 | Paper |
| scientific article; zbMATH DE number 2089215 (Why is no real title available?) | 2004-08-12 | Paper |
| scientific article; zbMATH DE number 2086681 (Why is no real title available?) | 2004-08-11 | Paper |
Randomized Pursuit-Evasion in Graphs
Combinatorics, Probability and Computing | 2004-06-18 | Paper |
Tail Bounds and Expectations for Random Arc Allocation and Applications
Combinatorics, Probability and Computing | 2004-06-18 | Paper |
| scientific article; zbMATH DE number 1775423 (Why is no real title available?) | 2004-01-27 | Paper |
| scientific article; zbMATH DE number 1936537 (Why is no real title available?) | 2004-01-03 | Paper |
| scientific article; zbMATH DE number 1759986 (Why is no real title available?) | 2002-11-06 | Paper |
Data management in networks: Experimental evaluation of a provably good strategy
Theory of Computing Systems | 2002-06-27 | Paper |
Improved routing and sorting on multibutterflies
Algorithmica | 2001-07-03 | Paper |
| scientific article; zbMATH DE number 1559567 (Why is no real title available?) | 2001-02-28 | Paper |
| scientific article; zbMATH DE number 1522943 (Why is no real title available?) | 2000-10-30 | Paper |
From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols
SIAM Journal on Computing | 2000-10-18 | Paper |
| scientific article; zbMATH DE number 1445331 (Why is no real title available?) | 2000-05-10 | Paper |
Shortest-Path Routing in Arbitrary Networks
Journal of Algorithms | 2000-01-09 | Paper |
| scientific article; zbMATH DE number 1376303 (Why is no real title available?) | 1999-12-08 | Paper |
| scientific article; zbMATH DE number 1256753 (Why is no real title available?) | 1999-10-04 | Paper |
Universal continuous routing strategies
Theory of Computing Systems | 1998-09-27 | Paper |
