# Lisa Fleischer

According to our database

Collaborative distances:

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

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### Online presence:

#### On csauthors.net:

## Bibliography

2016

ACM Trans. Algorithms, 2016

2015

Math. Oper. Res., 2015

Oper. Res., 2015

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

Games Econ. Behav., 2015

Games Econ. Behav., 2015

2013

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

2012

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

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

Proceedings of the 2012 Proceedings IEEE INFOCOM Workshops, 2012

2011

SIGecom Exch., 2011

SIAM J. Comput., 2011

Math. Oper. Res., 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

SIAM J. Comput., 2010

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

CoRR, 2010

Proceedings of the Integer Programming and Combinatorial Optimization, 2010

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

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

2009

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

2008

ACM Trans. Storage, 2008

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

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

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

2007

SIAM J. Comput., 2007

2006

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

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

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

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.

Discret. Appl. Math., 2003

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

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

Proceedings of the Handbook of Graph Theory., 2003

2002

Math. Program., 2002

Math. Program., 2002

Proceedings of the Integer Programming and Combinatorial Optimization, 2002

2001

SIAM J. Optim., 2001

Networks, 2001

A combinatorial strongly polynomial algorithm for minimizing submodular functions.

J. ACM, 2001

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

SIAM J. Discret. Math., 2000

Approximating Fractional Multicommodity Flow Independent of the Number of Commodities.

SIAM J. Discret. 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

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

Proceedings of the Parallel and Distributed Processing, 2000

1999

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

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

1998

Oper. Res. Lett., 1998

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

1994

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