# Lisa Fleischer

According to our database

Collaborative distances:

^{1}, Lisa Fleischer authored at least 76 papers between 1994 and 2016.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### Homepage:

#### On csauthors.net:

## Bibliography

2016

A Simple and Efficient Algorithm for Computing Market Equilibria.

ACM Trans. Algorithms, 2016

2015

On the Uniqueness of Equilibrium in Atomic Splittable Routing Games.

Math. Oper. Res., 2015

Optimal Coordination Mechanisms for Unrelated Machine Scheduling.

Operations Research, 2015

Introduction to the Special Issue - Algorithmic Game Theory - STOC/FOCS/SODA 2011.

Games and Economic Behavior, 2015

A Stackelberg strategy for routing flow over time.

Games and Economic Behavior, 2015

2013

Online Mixed Packing and Covering.

Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

2012

Approximately Optimal Auctions for Selling Privacy when Costs are Correlated with Data

CoRR, 2012

Online Mixed Packing and Covering

CoRR, 2012

When the Cut Condition is Enough: A Complete Characterization for Multiflow Problems in Series-Parallel Networks

CoRR, 2012

When the cut condition is enough: a complete characterization for multiflow problems in series-parallel networks.

Proceedings of the 44th Symposium on Theory of Computing Conference, 2012

Approximately optimal auctions for selling privacy when costs are correlated with data.

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

Simpler sybil-proof mechanisms for multi-level marketing.

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

Simple sybil-proof mechanisms for multi-level marketing.

Proceedings of the 2012 Proceedings IEEE INFOCOM Workshops, 2012

2011

A competitive strategy for routing flow over time.

SIGecom Exchanges, 2011

Submodular Approximation: Sampling-based Algorithms and Lower Bounds.

SIAM J. Comput., 2011

Tight Approximation Algorithms for Maximum Separable Assignment Problems.

Math. Oper. Res., 2011

Lower Bound for Envy-Free and Truthful Makespan Approximation on Related Machines

CoRR, 2011

A Stackelberg Strategy for Routing Flow over Time.

Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

Lower Bound for Envy-Free and Truthful Makespan Approximation on Related Machines.

Proceedings of the Algorithmic Game Theory, 4th International Symposium, 2011

2010

Ordering by weighted number of wins gives a good ranking for weighted tournaments.

ACM Trans. Algorithms, 2010

Strict Cost Sharing Schemes for Steiner Forest.

SIAM J. Comput., 2010

Discrete Price Updates Yield Fast Convergence in Ongoing Markets with Finite Warehouses

CoRR, 2010

A Stackelberg Strategy for Routing Flow over Time

CoRR, 2010

The Price of Collusion in Series-Parallel Networks.

Proceedings of the Integer Programming and Combinatorial Optimization, 2010

Preference-constrained Oriented Matching.

Proceedings of the Seventh Workshop on Analytic Algorithmics and Combinatorics, 2010

Data Center Scheduling, Generalized Flows, and Submodularity.

Proceedings of the Seventh Workshop on Analytic Algorithmics and Combinatorics, 2010

2009

Equilibria of atomic flow games are not unique.

Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

2008

Storage optimization for large-scale distributed stream-processing systems.

TOS, 2008

Submodular approximation: sampling-based algorithms and lower bounds

CoRR, 2008

A Fast and Simple Algorithm for Computing Market Equilibria.

Proceedings of the Internet and Network Economics, 4th International Workshop, 2008

Fast-converging tatonnement algorithms for one-time and ongoing market problems.

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

Prompt Mechanisms for Online Auctions.

Proceedings of the Algorithmic Game Theory, First International Symposium, 2008

SODA: An Optimizing Scheduler for Large-Scale Stream-Based Distributed Computer Systems.

Proceedings of the Middleware 2008, 2008

Submodular Approximation: Sampling-based Algorithms and Lower Bounds.

Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science, 2008

2007

Quickest Flows Over Time.

SIAM J. Comput., 2007

Storage Optimization for Large-Scale Distributed Stream Processing Systems.

Proceedings of the 21th International Parallel and Distributed Processing Symposium (IPDPS 2007), 2007

2006

Polynomial-Time Separation of a Superclass of Simple Comb Inequalities.

Math. Oper. Res., 2006

Iterative rounding 2-approximation algorithms for minimum-cost vertex connectivity problems.

J. Comput. Syst. Sci., 2006

Simple cost sharing schemes for multicommodity rent-or-buy and stochastic Steiner tree.

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

Tight approximation algorithms for maximum general assignment problems.

Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

Ordering by weighted number of wins gives a good ranking for weighted tournaments.

Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

2005

Linear tolls suffice: New bounds and algorithms for tolls in single source networks.

Theor. Comput. Sci., 2005

Efficient Algorithms for Separated Continuous Linear Programs: The Multicommodity Flow Problem with Holding Costs and Extensions.

Math. Oper. Res., 2005

Ordering by weighted number of wins gives a good ranking for weighted tournaments

Electronic Colloquium on Computational Complexity (ECCC), 2005

2004

A fast approximation scheme for fractional covering problems with variable upper bounds.

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

Linear Tolls Suffice: New Bounds and Algorithms for Tolls in Single Source Networks.

Proceedings of the Automata, Languages and Programming: 31st International Colloquium, 2004

Further Improvements in Competitive Guarantees for QoS Buffering.

Proceedings of the Automata, Languages and Programming: 31st International Colloquium, 2004

Tolls for Heterogeneous Selfish Users in Multicommodity Networks and Generalized Congestion Games.

Proceedings of the 45th Symposium on Foundations of Computer Science (FOCS 2004), 2004

2003

A push-relabel framework for submodular function minimization and applications to parametric optimization.

Discrete Applied Mathematics, 2003

Minimum cost flows over time without intermediate storage.

Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003

Approximately optimal control of fluid networks.

Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003

Networks and Flows.

Proceedings of the Handbook of Graph Theory., 2003

2002

Fast and simple approximation schemes for generalized flow.

Math. Program., 2002

A faster capacity scaling algorithm for minimum cost submodular flow.

Math. Program., 2002

The Quickest Multicommodity Flow Problem.

Proceedings of the Integer Programming and Combinatorial Optimization, 2002

2001

Faster Algorithms for the Quickest Transshipment Problem.

SIAM Journal on Optimization, 2001

Universally maximum flow with piecewise-constant capacities.

Networks, 2001

A combinatorial strongly polynomial algorithm for minimizing submodular functions.

J. ACM, 2001

A 2-Approximation for Minimum Cost {0, 1, 2} Vertex Connectivity.

Proceedings of the Integer Programming and Combinatorial Optimization, 2001

An Iterative Rounding 2-Approximation Algorithm for the Element Connectivity Problem.

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

2000

Optimal Rounding of Instantaneous Fractional Flows Over Time.

SIAM J. Discrete Math., 2000

Approximating Fractional Multicommodity Flow Independent of the Number of Commodities.

SIAM J. Discrete Math., 2000

A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions.

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

Improved algorithms for submodular function minimization and submodular flow.

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

Strengthening integrality gaps for capacitated network design and covering problems.

Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

On Identifying Strongly Connected Components in Parallel.

Proceedings of the Parallel and Distributed Processing, 2000

1999

Separating Maximally Violated Comb Inequalities in Planar Graphs.

Math. Oper. Res., 1999

Building Chain and Cactus Representations of All Minimum Cuts from Hao-Orlin in the Same Asymptotic Run Time.

J. Algorithms, 1999

Faster Approximation Algorithms for Generalized Flow.

Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

Universally Maximum Flow with Piecewise-Constant Capacities.

Proceedings of the Integer Programming and Combinatorial Optimization, 1999

Approximating Fractional Multicommodity Flow Independent of the Number of Commodities.

Proceedings of the 40th Annual Symposium on Foundations of Computer Science, 1999

1998

Efficient continuous-time dynamic network flow algorithms.

Oper. Res. Lett., 1998

Faster Algorithms for the Quickest Transshipment Problem with Zero Transit Times.

Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 1998

Building Chain and Cactus Representations of All Minimum Cuts from Hao-Orlin in the Same Asymptotic Run Time.

Proceedings of the Integer Programming and Combinatorial Optimization, 1998

1996

Separating Maximally Violated Comb Inequalities in Planar Graphs.

Proceedings of the Integer Programming and Combinatorial Optimization, 1996

1994

Scheduling Parallelizable Tasks to Minimize Average Response Time.

Proceedings of the 6th Annual ACM Symposium on Parallel Algorithms and Architectures, 1994