Éva Tardos

CoRR, February, 2025

Learning in Markets with Heterogeneous Agents: Dynamics and Survival of Bayesian vs. No-Regret Learners.

[BibT_eX]

[DOI]

David A. Easley

Yoav Kolumbus

CoRR, February, 2025

Allocating Public Goods via Dynamic Max-Min Fairness: Long-Run Behavior and Competitive Equilibria.

[BibT_eX]

[DOI]

CoRR, January, 2025

2024

Dynamic Pricing Provides Robust Equilibria in Stochastic Ridesharing Networks.

[BibT_eX]

[DOI]

J. Massey Cashore

Peter I. Frazier

Math. Oper. Res., 2024

Learning in Budgeted Auctions with Spacing Objectives.

[BibT_eX]

[DOI]

CoRR, 2024

Paying to Do Better: Games with Payments between Learning Agents.

[BibT_eX]

[DOI]

Yoav Kolumbus

Joe Halpern

CoRR, 2024

Modeling reputation-based behavioral biases in school choice.

[BibT_eX]

[DOI]

Proceedings of the 25th ACM Conference on Economics and Computation, 2024

Calibrated Recommendations for Users with Decaying Attention.

[BibT_eX]

[DOI]

Emily Ryu

Proceedings of the Algorithmic Game Theory - 17th International Symposium, 2024

Incentives in Dominant Resource Fair Allocation Under Dynamic Demands.

[BibT_eX]

[DOI]

Rachit Agarwal

Proceedings of the Algorithmic Game Theory - 17th International Symposium, 2024

2023

The Price of Anarchy of Strategic Queuing Systems.

[BibT_eX]

[DOI]

J. ACM, June, 2023

Online Resource Sharing via Dynamic Max-Min Fairness: Efficiency, Robustness and Non-Stationarity.

[BibT_eX]

[DOI]

Siddhartha Banerjee

CoRR, 2023

Liquid Welfare Guarantees for No-Regret Learning in Sequential Budgeted Auctions.

[BibT_eX]

[DOI]

Proceedings of the 24th ACM Conference on Economics and Computation, 2023

Robust Pseudo-Markets for Reusable Public Resources.

[BibT_eX]

[DOI]

Siddhartha Banerjee

Proceedings of the 24th ACM Conference on Economics and Computation, 2023

Karma: Resource Allocation for Dynamic Demands.

[BibT_eX]

[DOI]

Proceedings of the 17th USENIX Symposium on Operating Systems Design and Implementation, 2023

Approximately Stationary Bandits with Knapsacks.

[BibT_eX]

[DOI]

Proceedings of the Thirty Sixth Annual Conference on Learning Theory, 2023

2022

Small-Loss Bounds for Online Learning with Partial Information.

[BibT_eX]

[DOI]

Karthik Sridharan

Math. Oper. Res., 2022

The EATCS Award 2022 - Laudatio for Patrick Cousot.

[BibT_eX]

[DOI]

Bull. EATCS, 2022

Ordered Submodularity and its Applications to Diversifying Recommendations.

[BibT_eX]

[DOI]

Emily Ryu

CoRR, 2022

Dynamic Pricing Provides Robust Equilibria in Stochastic Ride-Sharing Networks.

[BibT_eX]

[DOI]

J. Massey Cashore

Peter I. Frazier

Proceedings of the EC '22: The 23rd ACM Conference on Economics and Computation, Boulder, CO, USA, July 11, 2022

2021

Simple and Efficient Budget Feasible Mechanisms for Monotone Submodular Valuations.

[BibT_eX]

[DOI]

Pooya Jalaly

ACM Trans. Economics and Comput., 2021

Algorithms as Mechanisms: The Price of Anarchy of Relax and Round.

[BibT_eX]

[DOI]

Paul Dütting

Thomas Kesselheim

Math. Oper. Res., 2021

Invited Article Foreword.

[BibT_eX]

[DOI]

J. ACM, 2021

The EATCS Award 2022 - Call for Nominations.

[BibT_eX]

[DOI]

Bull. EATCS, 2021

Incentives in Resource Allocation under Dynamic Demands.

[BibT_eX]

[DOI]

Rachit Agarwal

CoRR, 2021

Virtues of Patience in Strategic Queuing Systems.

[BibT_eX]

[DOI]

Proceedings of the EC '21: The 22nd ACM Conference on Economics and Computation, 2021

Polarization in Geometric Opinion Dynamics.

[BibT_eX]

[DOI]

Proceedings of the EC '21: The 22nd ACM Conference on Economics and Computation, 2021

Randomness and Fairness in Two-Sided Matching with Limited Interviews.

[BibT_eX]

[DOI]

Proceedings of the 12th Innovations in Theoretical Computer Science Conference, 2021

2020

The EATCS Award 2021 - Call for Nominations.

[BibT_eX]

[DOI]

Marta Kwiatkowska

Johan Håstad

Bull. EATCS, 2020

Stability and Learning in Strategic Queuing Systems.

[BibT_eX]

[DOI]

Proceedings of the EC '20: The 21st ACM Conference on Economics and Computation, 2020

Adversarial Perturbations of Opinion Dynamics in Networks.

[BibT_eX]

[DOI]

Proceedings of the EC '20: The 21st ACM Conference on Economics and Computation, 2020

Feedback graph regret bounds for Thompson Sampling and UCB.

[BibT_eX]

[DOI]

Drishti Wali

Proceedings of the Algorithmic Learning Theory, 2020

2019

Information Asymmetries in Common-Value Auctions with Discrete Signals.

[BibT_eX]

[DOI]

David Kempe

Math. Oper. Res., 2019

Invited Articles Foreword.

[BibT_eX]

[DOI]

J. ACM, 2019

The EATCS Award 2020 - Call for Nominations.

[BibT_eX]

[DOI]

Artur Czumaj

Marta Kwiatkowska

Bull. EATCS, 2019

Graph regret bounds for Thompson Sampling and UCB.

[BibT_eX]

[DOI]

Drishti Wali

CoRR, 2019

2017

The Price of Anarchy in Auctions.

[BibT_eX]

[DOI]

J. Artif. Intell. Res., 2017

Learning and Trust in Auction Markets.

[BibT_eX]

[DOI]

Pooya Jalaly

Denis Nekipelov

CoRR, 2017

Effect of selfish choices in deferred acceptance with short lists.

[BibT_eX]

[DOI]

Daniela Sabán

CoRR, 2017

Computing Equilibrium in Matching Markets.

[BibT_eX]

[DOI]

Saeed Alaei

Pooya Jalaly Khalilabadi

Proceedings of the 2017 ACM Conference on Economics and Computation, 2017

2016

Introduction.

[BibT_eX]

[DOI]

R. Preston McAfee

ACM Trans. Economics and Comput., 2016

Fast Convergence of Common Learning Algorithms in Games.

[BibT_eX]

[DOI]

CoRR, 2016

Learning and Efficiency in Games with Dynamic Population.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

Learning in Games: Robustness of Fast Convergence.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 29: Annual Conference on Neural Information Processing Systems 2016, 2016

2015

Maximizing the Spread of Influence through a Social Network.

[BibT_eX]

[DOI]

David Kempe

Theory Comput., 2015

Bounding the inefficiency of outcomes in generalized second price auctions.

[BibT_eX]

[DOI]

Ioannis Caragiannis

Christos Kaklamanis

Panagiotis Kanellopoulos

J. Econ. Theory, 2015

Introduction to computer science and economic theory.

[BibT_eX]

[DOI]

J. Econ. Theory, 2015

No-Regret Learning in Repeated Bayesian Games.

[BibT_eX]

[DOI]

Jason D. Hartline

CoRR, 2015

Effect of Strategic Grading and Early Offers in Matching Markets.

[BibT_eX]

[DOI]

Nishanth Dikkala

CoRR, 2015

Econometrics for Learning Agents.

[BibT_eX]

[DOI]

Denis Nekipelov

Proceedings of the Sixteenth ACM Conference on Economics and Computation, 2015

Smooth Online Mechanisms: A Game-Theoretic Problem in Renewable Energy Markets.

[BibT_eX]

[DOI]

Thomas Kesselheim

Robert D. Kleinberg

Proceedings of the Sixteenth ACM Conference on Economics and Computation, 2015

Brief Announcement: Effect of Strategic Grading and Early Offers in Matching Markets.

[BibT_eX]

[DOI]

Nishanth Dikkala

Proceedings of the Algorithmic Game Theory - 8th International Symposium, 2015

No-Regret Learning in Bayesian Games.

[BibT_eX]

[DOI]

Jason D. Hartline

Proceedings of the Advances in Neural Information Processing Systems 28: Annual Conference on Neural Information Processing Systems 2015, 2015

2014

Mechanism with unique learnable equilibria.

[BibT_eX]

[DOI]

Paul Dütting

Thomas Kesselheim

Proceedings of the ACM Conference on Economics and Computation, 2014

Strong Price of Anarchy, Utility Games and Coalitional Dynamics.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Game Theory - 7th International Symposium, 2014

2013

Network Formation in the Presence of Contagious Risk.

[BibT_eX]

[DOI]

ACM Trans. Economics and Comput., 2013

Notes from the EC'13 program chairs.

[BibT_eX]

[DOI]

R. Preston McAfee

SIGecom Exch., 2013

Interface of Computation, Game Theory, and Economics (Dagstuhl Seminar 13161).

[BibT_eX]

[DOI]

Sergiu Hart

Bernhard von Stengel

Dagstuhl Reports, 2013

Strong Price of Anarchy and Coalitional Dynamics.

[BibT_eX]

[DOI]

CoRR, 2013

Equilibrium in Combinatorial Public Projects.

[BibT_eX]

[DOI]

Proceedings of the Web and Internet Economics - 9th International Conference, 2013

Can Credit Increase Revenue?

[BibT_eX]

[DOI]

Nishanth Dikkala

Proceedings of the Web and Internet Economics - 9th International Conference, 2013

Composable and efficient mechanisms.

[BibT_eX]

[DOI]

Proceedings of the Symposium on Theory of Computing Conference, 2013

2012

The dining bidder problem: à la russe et à la française.

[BibT_eX]

[DOI]

SIGecom Exch., 2012

On the efficiency of equilibria in generalized second price auctions

[BibT_eX]

[DOI]

Ioannis Caragiannis

Christos Kaklamanis

Panagiotis Kanellopoulos

CoRR, 2012

On revenue in the generalized second price auction.

[BibT_eX]

[DOI]

Brendan Lucier

Proceedings of the 21st World Wide Web Conference 2012, 2012

Sequential auctions and externalities.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

Bayesian sequential auctions.

[BibT_eX]

[DOI]

Proceedings of the 13th ACM Conference on Electronic Commerce, 2012

The curse of simultaneity.

[BibT_eX]

[DOI]

Proceedings of the Innovations in Theoretical Computer Science 2012, 2012

2011

Stronger Bounds on Braess's Paradox and the Maximum Latency of Selfish Routing.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2011

Load balancing without regret in the bulletin board model.

[BibT_eX]

[DOI]

Robert Kleinberg

Georgios Piliouras

Distributed Comput., 2011

Beyond the Nash Equilibrium Barrier.

[BibT_eX]

[DOI]

Proceedings of the Innovations in Computer Science, 2011

Which Networks are Least Susceptible to Cascading Failures?

[BibT_eX]

[DOI]

Proceedings of the IEEE 52nd Annual Symposium on Foundations of Computer Science, 2011

2010

Facility location with hierarchical facility costs.

[BibT_eX]

[DOI]

Zoya Svitkina

ACM Trans. Algorithms, 2010

Pure and Bayes-Nash Price of Anarchy for Generalized Second Price Auction.

[BibT_eX]

[DOI]

Proceedings of the 51th Annual IEEE Symposium on Foundations of Computer Science, 2010

Globally optimal pixel labeling algorithms for tree metrics.

[BibT_eX]

[DOI]

Pedro F. Felzenszwalb

Gyula Pap

Ramin Zabih

Proceedings of the Twenty-Third IEEE Conference on Computer Vision and Pattern Recognition, 2010

2009

Approximating the smallest <i>k</i>-edge connected spanning subgraph by LP-rounding.

[BibT_eX]

[DOI]

Networks, 2009

Trading networks with price-setting agents.

[BibT_eX]

[DOI]

Games Econ. Behav., 2009

Quantifying Outcomes in Games.

[BibT_eX]

[DOI]

Proceedings of the Internet and Network Economics, 5th International Workshop, 2009

Approximate Pure Nash Equilibria via Lovász Local Lemma.

[BibT_eX]

[DOI]

Thành Nguyen

Proceedings of the Internet and Network Economics, 5th International Workshop, 2009

Multiplicative updates outperform generic no-regret learning in congestion games: extended abstract.

[BibT_eX]

[DOI]

Robert Kleinberg

Georgios Piliouras

Proceedings of the 41st Annual ACM Symposium on Theory of Computing, 2009

2008

Near-Optimal Network Design with Selfish Agents.

[BibT_eX]

[DOI]

Theory Comput., 2008

Strategic network formation with structural holes.

[BibT_eX]

[DOI]

SIGecom Exch., 2008

Special Issue on Foundations of Computer Science.

[BibT_eX]

Irit Dinur

SIAM J. Comput., 2008

The Price of Stability for Network Design with Fair Cost Allocation.

[BibT_eX]

[DOI]

SIAM J. Comput., 2008

Cost-Sharing Mechanisms for Network Design.

[BibT_eX]

[DOI]

Anupam Gupta

Aravind Srinivasan

Algorithmica, 2008

Balanced outcomes in social exchange networks.

[BibT_eX]

[DOI]

Proceedings of the 40th Annual ACM Symposium on Theory of Computing, 2008

Parallel Imaging Problem.

[BibT_eX]

[DOI]

Thành Nguyen

Proceedings of the Algorithms, 2008

2007

Frugal path mechanisms.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2007

A network pricing game for selfish traffic.

[BibT_eX]

[DOI]

Ara Hayrapetyan

Tom Wexler

Distributed Comput., 2007

Approximately maximizing efficiency and revenue in polyhedral environments.

[BibT_eX]

[DOI]

Thành Nguyen

Proceedings of the Proceedings 8th ACM Conference on Electronic Commerce (EC-2007), 2007

07471 Abstracts Collection - Equilibrium Computation.

[BibT_eX]

[DOI]

P. Jean-Jacques Herings

Proceedings of the Equilibrium Computation, 18.11. - 23.11.2007, 2007

07271 Abstracts Collection - Computational Social Systems and the Internet .

[BibT_eX]

[DOI]

Proceedings of the Computational Social Systems and the Internet, 1.7. - 6.7.2007, 2007

07271 Summary - Computational Social Systems and the Internet.

[BibT_eX]

[DOI]

Proceedings of the Computational Social Systems and the Internet, 1.7. - 6.7.2007, 2007

2006

The effect of collusion in congestion games.

[BibT_eX]

[DOI]

Ara Hayrapetyan

Tom Wexler

Proceedings of the 38th Annual ACM Symposium on Theory of Computing, 2006

Algorithm design.

[BibT_eX]

Addison-Wesley, ISBN: 978-0-321-37291-8, 2006

2005

Primal-Dual-Based Algorithms for a Directed Network Design Problem.

[BibT_eX]

[DOI]

Vardges Melkonian

INFORMS J. Comput., 2005

Network design for information networks.

[BibT_eX]

[DOI]

Ara Hayrapetyan

Chaitanya Swamy

Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

Braess's Paradox, Fibonacci Numbers, and Exponential Inapproximability.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 32nd International Colloquium, 2005

Influential Nodes in a Diffusion Model for Social Networks.

[BibT_eX]

[DOI]

David Kempe

Proceedings of the Automata, Languages and Programming, 32nd International Colloquium, 2005

2004

Algorithms for a network design problem with crossing supermodular demands.

[BibT_eX]

[DOI]

Vardges Melkonian

Networks, 2004

Bounding the inefficiency of equilibria in nonatomic congestion games.

[BibT_eX]

[DOI]

Games Econ. Behav., 2004

Network games.

[BibT_eX]

[DOI]

Proceedings of the 36th Annual ACM Symposium on Theory of Computing, 2004

A stronger bound on Braess's Paradox.

[BibT_eX]

[DOI]

Henry C. Lin

Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

Approximate classification via earthmover metrics.

[BibT_eX]

[DOI]

Jittat Fakcharoenphol

Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

Min-Max Multiway Cut.

[BibT_eX]

[DOI]

Zoya Svitkina

Proceedings of the Approximation, 2004

2003

Scheduling data transfers in a network and the set scheduling problem.

[BibT_eX]

[DOI]

Ashish Goel

Monika Rauch Henzinger

J. Algorithms, 2003

An Approximate Truthful Mechanism for Combinatorial Auctions with Single Parameter Agents.

[BibT_eX]

[DOI]

Christos H. Papadimitriou

Kunal Talwar

Internet Math., 2003

Group Strategyproof Mechanisms via Primal-Dual Algorithms.

[BibT_eX]

[DOI]

Martin Pál

Proceedings of the 44th Symposium on Foundations of Computer Science (FOCS 2003), 2003

Approximation Algorithms and Network Games.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2003

2002

A Constant-Factor Approximation Algorithm for the k-Median Problem.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2002

How bad is selfish routing?

[BibT_eX]

[DOI]

J. ACM, 2002

Approximation algorithms for classification problems with pairwise relationships: metric labeling and Markov random fields.

[BibT_eX]

[DOI]

J. ACM, 2002

2001

Fairness in Routing and Load Balancing.

[BibT_eX]

[DOI]

Yuval Rabani

J. Comput. Syst. Sci., 2001

Facility Location with Nonuniform Hard Capacities.

[BibT_eX]

[DOI]

Martin Pál

Tom Wexler

Proceedings of the 42nd Annual Symposium on Foundations of Computer Science, 2001

Truthful Mechanisms for One-Parameter Agents.

[BibT_eX]

[DOI]

Proceedings of the 42nd Annual Symposium on Foundations of Computer Science, 2001

2000

Allocating Bandwidth for Bursty Connections.

[BibT_eX]

[DOI]

Yuval Rabani

SIAM J. Comput., 2000

The Quickest Transshipment Problem.

[BibT_eX]

[DOI]

Bruce Hoppe

Math. Oper. Res., 2000

A constant factor approximation algorithm for a class of classification problems.

[BibT_eX]

[DOI]

Anupam Gupta

Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, 2000

1999

Separating Maximally Violated Comb Inequalities in Planar Graphs.

[BibT_eX]

[DOI]

Lisa Fleischer

Math. Oper. Res., 1999

A Constant-Factor Approximation Algorithm for the <i>k</i>-Median Problem (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, 1999

Approximation Algorithms for Some Clustering and Classification Problems.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 10th International Symposium, 1999

Approximation Algorithms for a Directed Network Design Problem.

[BibT_eX]

[DOI]

Vardges Melkonian

Proceedings of the Integer Programming and Combinatorial Optimization, 1999

1998

Efficient continuous-time dynamic network flow algorithms.

[BibT_eX]

[DOI]

Lisa Fleischer

Oper. Res. Lett., 1998

Approximations for the Disjoint Paths Problem in High-Diameter Planar Networks.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1998

Simple Generalized Maximum Flow Algorithms.

[BibT_eX]

[DOI]

Kevin D. Wayne

Proceedings of the Integer Programming and Combinatorial Optimization, 1998

1997

Approximation Algorithms for Steiner and Directed Multicuts.

[BibT_eX]

[DOI]

J. Algorithms, 1997

Approximation Algorithms for Facility Location Problems (Extended Abstract).

[BibT_eX]

[DOI]

Karen I. Aardal

Proceedings of the Twenty-Ninth Annual ACM Symposium on the Theory of Computing, 1997

1996

Distributed Packet Switching in Arbitrary Networks.

[BibT_eX]

[DOI]

Yuval Rabani

Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, 1996

1995

Fast Approximation Algorithms for Fractional Packing and Covering Problems.

[BibT_eX]

[DOI]

Math. Oper. Res., 1995

Fast Approximation Algorithms for Multicommodity Flow Problems.

[BibT_eX]

[DOI]

Frank Thomson Leighton

J. Comput. Syst. Sci., 1995

Improved Bounds on the Max-Flow Min-Cut Ratio for Multicommodity Flows.

[BibT_eX]

[DOI]

Comb., 1995

Disjoint Paths in Densely Embedded Graphs.

[BibT_eX]

[DOI]

Proceedings of the 36th Annual Symposium on Foundations of Computer Science, 1995

1994

Faster Approximation Algorithms for the Unit Capacity Concurrent Flow Problem with Applications to Routing and Finding Sparse Cuts.

[BibT_eX]

[DOI]

SIAM J. Comput., 1994

A Faster Parametric Minimum-Cut Algorithm.

[BibT_eX]

[DOI]

Dan Gusfield

Algorithmica, 1994

Polynomial Time Algorithms for Some Evacuation Problems.

[BibT_eX]

[DOI]

Bruce Hoppe

Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms. 23-25 January 1994, 1994

Improved Approximation Algorithms for Network Design Problems.

[BibT_eX]

[DOI]

Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms. 23-25 January 1994, 1994

1993

An approximation algorithm for the generalized assignment problem.

[BibT_eX]

[DOI]

Math. Program., 1993

Polynomial dual network simplex algorithms.

[BibT_eX]

[DOI]

James B. Orlin

Math. Program., 1993

Improved Bounds for the Max-Flow Min-Multicut Ratio for Planar and K_r, r-Free Graphs.

[BibT_eX]

[DOI]

Vijay V. Vazirani

Inf. Process. Lett., 1993

Scheduling Unrelated Machines with Costs.

[BibT_eX]

[DOI]

Proceedings of the Fourth Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1993

1992

Using Interior-Point Methods for Fast Parallel Algorithms for Bipartite Matching and Related Problems.

[BibT_eX]

[DOI]

SIAM J. Comput., 1992

Using Separation Algorithms in Fixed Dimension.

[BibT_eX]

[DOI]

Carolyn Haibt Norton

J. Algorithms, 1992

Algorithms for Routing around a Rectangle.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1992

1991

Combinatorial Algorithms for the Generalized Circulation Problem.

[BibT_eX]

[DOI]

Andrew V. Goldberg

Math. Oper. Res., 1991

1990

Approximation Algorithms for Scheduling Unrelated Parallel Machines.

[BibT_eX]

[DOI]

Jan Karel Lenstra

Math. Program., 1990

An intersection theorem for supermatroids.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1990

Leighton-Rao Might Be Practical: Faster Approximation Algorithms for Concurrent Flow with Uniform Capacities

[BibT_eX]

[DOI]

Philip N. Klein

Clifford Stein

Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, 1990

Improved Dual Network Simplex.

[BibT_eX]

[DOI]

Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms, 1990

1989

Note on Weintraub's Minimum-Cost Circulation Algorithm.

[BibT_eX]

[DOI]

Francisco Barahona

SIAM J. Comput., 1989

On fractional multicommodity flows and distance functions.

[BibT_eX]

[DOI]

Cor A. J. Hurkens

Alexander Schrijver

Discret. Math., 1989

Interior-Point Methods in Parallel Computation

[BibT_eX]

[DOI]

Proceedings of the 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October, 1989

1988

Generalized polymatroids and submodular flows.

[BibT_eX]

[DOI]

András Frank

Math. Program., 1988

An O(n²(m + n log n)log n) min-cost flow algorithm.

[BibT_eX]

[DOI]

Zvi Galil

J. ACM, 1988

The gap between monotone and non-monotone circuit complexity is exponential.

[BibT_eX]

[DOI]

Comb., 1988

1987

An application of simultaneous Diophantine approximation in combinatorial optimization.

[BibT_eX]

[DOI]

András Frank

Comb., 1987

1986

Sensitivity theorems in integer linear programming.

[BibT_eX]

[DOI]

Math. Program., 1986

Layered Augmenting Path Algorithms.

[BibT_eX]

[DOI]

Craig A. Tovey

Michael A. Trick

Math. Oper. Res., 1986

A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs.

[BibT_eX]

[DOI]

Oper. Res., 1986

An O(n^2 (m + n log n) log n) Min-Cost Flow Algorithm

[BibT_eX]

[DOI]

Zvi Galil

Proceedings of the 27th Annual Symposium on Foundations of Computer Science, 1986

1985

A strongly polynomial minimum cost circulation algorithm.

[BibT_eX]

[DOI]

Comb., 1985

An Application of Simultaneous Approximation in Combinatorial Optimization

[BibT_eX]

[DOI]

András Frank