Lisa Fleischer

Publication Activity (10 Years)

Years Active: 1994-2021
Publications (10 Years): 3

Top Topics

Approximately Optimal

Business Models

Coordination Mechanisms

Top Venues

Games Econ. Behav.

Publications

Ralf-Christian Härting, Marcel Bäuerle, Kevin Bilge, Lisa Fleischer, Nadja Landgraf, Marcel Wicher
Potentials of Digital Business Models in Tourism - A Quantitative Study. KES-AMSTA (2021)
Ralf-Christian Härting, Kevin Bilge, Lisa Fleischer, Nadja Landgraf, Feride Özcakir, Marcel Wicher
Impact of the COVID-19 Crisis on Digital Business Models - Contactless Payments. KES-AMSTA (2021)
Lisa Fleischer, Rahul Garg, Sanjiv Kapoor, Rohit Khandekar, Amin Saberi
A Simple and Efficient Algorithm for Computing Market Equilibria. ACM Trans. Algorithms 12 (3) (2016)
Yossi Azar, Lisa Fleischer, Kamal Jain, Vahab S. Mirrokni, Zoya Svitkina
Optimal Coordination Mechanisms for Unrelated Machine Scheduling. Oper. Res. 63 (3) (2015)
Umang Bhaskar, Lisa Fleischer, Darrell Hoy, Chien-Chung Huang
On the Uniqueness of Equilibrium in Atomic Splittable Routing Games. Math. Oper. Res. 40 (3) (2015)
Umang Bhaskar, Lisa Fleischer, Elliot Anshelevich
A Stackelberg strategy for routing flow over time. Games Econ. Behav. 92 (2015)
Shuchi Chawla, Lisa Fleischer, Jason D. Hartline, Tim Roughgarden
Introduction to the Special Issue - Algorithmic Game Theory - STOC/FOCS/SODA 2011. Games Econ. Behav. 92 (2015)
Yossi Azar, Umang Bhaskar, Lisa Fleischer, Debmalya Panigrahi
Online Mixed Packing and Covering. SODA (2013)
Umang Bhaskar, Lisa Fleischer
Online Mixed Packing and Covering CoRR (2012)
Amit Chakrabarti, Lisa Fleischer, Christophe Weibel
When the Cut Condition is Enough: A Complete Characterization for Multiflow Problems in Series-Parallel Networks CoRR (2012)
Amit Chakrabarti, Lisa Fleischer, Christophe Weibel
When the cut condition is enough: a complete characterization for multiflow problems in series-parallel networks. STOC (2012)
Lisa Fleischer, Yu-Han Lyu
Approximately optimal auctions for selling privacy when costs are correlated with data. EC (2012)
Lisa Fleischer, Yu-Han Lyu
Approximately Optimal Auctions for Selling Privacy when Costs are Correlated with Data CoRR (2012)
Fabio Drucker, Lisa Fleischer
Simpler sybil-proof mechanisms for multi-level marketing. EC (2012)
Fabio Drucker, Lisa Fleischer
Simple sybil-proof mechanisms for multi-level marketing. INFOCOM Workshops (2012)
Lisa Fleischer, Zhenghui Wang
Lower Bound for Envy-Free and Truthful Makespan Approximation on Related Machines CoRR (2011)
Umang Bhaskar, Lisa Fleischer, Elliot Anshelevich
A Stackelberg Strategy for Routing Flow over Time. SODA (2011)
Lisa Fleischer, Michel X. Goemans, Vahab S. Mirrokni, Maxim Sviridenko
Tight Approximation Algorithms for Maximum Separable Assignment Problems. Math. Oper. Res. 36 (3) (2011)
Lisa Fleischer, Zhenghui Wang
Lower Bound for Envy-Free and Truthful Makespan Approximation on Related Machines. SAGT (2011)
Zoya Svitkina, Lisa Fleischer
Submodular Approximation: Sampling-based Algorithms and Lower Bounds. SIAM J. Comput. 40 (6) (2011)
Umang Bhaskar, Lisa Fleischer, Elliot Anshelevich
A competitive strategy for routing flow over time. SIGecom Exch. 10 (2) (2011)
Umang Bhaskar, Lisa Fleischer, Chien-Chung Huang
The Price of Collusion in Series-Parallel Networks. IPCO (2010)
Umang Bhaskar, Lisa Fleischer, Elliot Anshelevich
A Stackelberg Strategy for Routing Flow over Time CoRR (2010)
Don Coppersmith, Lisa Fleischer, Atri Rudra
Ordering by weighted number of wins gives a good ranking for weighted tournaments. ACM Trans. Algorithms 6 (3) (2010)
Lisa Fleischer, Zoya Svitkina
Preference-constrained Oriented Matching. ANALCO (2010)
Richard Cole, Lisa Fleischer, Ashish Rastogi
Discrete Price Updates Yield Fast Convergence in Ongoing Markets with Finite Warehouses CoRR (2010)
Lisa Fleischer, Jochen Könemann, Stefano Leonardi, Guido Schäfer
Strict Cost Sharing Schemes for Steiner Forest. SIAM J. Comput. 39 (8) (2010)
Lisa Fleischer
Data Center Scheduling, Generalized Flows, and Submodularity. ANALCO (2010)
Umang Bhaskar, Lisa Fleischer, Darrell Hoy, Chien-Chung Huang
Equilibria of atomic flow games are not unique. SODA (2009)
Richard Cole, Shahar Dobzinski, Lisa Fleischer
Prompt Mechanisms for Online Auctions. SAGT (2008)
Kirsten Hildrum, Fred Douglis, Joel L. Wolf, Philip S. Yu, Lisa Fleischer, Akshay Katta
Storage optimization for large-scale distributed stream-processing systems. ACM Trans. Storage 3 (4) (2008)
Richard Cole, Lisa Fleischer
Fast-converging tatonnement algorithms for one-time and ongoing market problems. STOC (2008)
Lisa Fleischer, Rahul Garg, Sanjiv Kapoor, Rohit Khandekar, Amin Saberi
A Fast and Simple Algorithm for Computing Market Equilibria. WINE (2008)
Joel L. Wolf, Nikhil Bansal, Kirsten Hildrum, Sujay Parekh, Deepak Rajan, Rohit Wagle, Kun-Lung Wu, Lisa Fleischer
SODA: An Optimizing Scheduler for Large-Scale Stream-Based Distributed Computer Systems. Middleware (2008)
Zoya Svitkina, Lisa Fleischer
Submodular Approximation: Sampling-based Algorithms and Lower Bounds. FOCS (2008)
Zoya Svitkina, Lisa Fleischer
Submodular approximation: sampling-based algorithms and lower bounds CoRR (2008)
Lisa Fleischer, Martin Skutella
Quickest Flows Over Time. SIAM J. Comput. 36 (6) (2007)
Kirsten Hildrum, Fred Douglis, Joel L. Wolf, Philip S. Yu, Lisa Fleischer, Akshay Katta
Storage Optimization for Large-Scale Distributed Stream Processing Systems. IPDPS (2007)
Lisa Fleischer, Kamal Jain, David P. Williamson
Iterative rounding 2-approximation algorithms for minimum-cost vertex connectivity problems. J. Comput. Syst. Sci. 72 (5) (2006)
Lisa Fleischer, Michel X. Goemans, Vahab S. Mirrokni, Maxim Sviridenko
Tight approximation algorithms for maximum general assignment problems. SODA (2006)
Lisa Fleischer, Jochen Könemann, Stefano Leonardi, Guido Schäfer
Simple cost sharing schemes for multicommodity rent-or-buy and stochastic Steiner tree. STOC (2006)
Lisa Fleischer, Adam N. Letchford, Andrea Lodi
Polynomial-Time Separation of a Superclass of Simple Comb Inequalities. Math. Oper. Res. 31 (4) (2006)
Don Coppersmith, Lisa Fleischer, Atri Rudra
Ordering by weighted number of wins gives a good ranking for weighted tournaments. SODA (2006)
Don Coppersmith, Lisa Fleischer, Atri Rudra
Ordering by weighted number of wins gives a good ranking for weighted tournaments Electron. Colloquium Comput. Complex. (131) (2005)
Lisa Fleischer, Jay Sethuraman
Efficient Algorithms for Separated Continuous Linear Programs: The Multicommodity Flow Problem with Holding Costs and Extensions. Math. Oper. Res. 30 (4) (2005)
Lisa Fleischer
Linear tolls suffice: New bounds and algorithms for tolls in single source networks. Theor. Comput. Sci. 348 (2-3) (2005)
Nikhil Bansal, Lisa Fleischer, Tracy Kimbrel, Mohammad Mahdian, Baruch Schieber, Maxim Sviridenko
Further Improvements in Competitive Guarantees for QoS Buffering. ICALP (2004)
Lisa Fleischer
A fast approximation scheme for fractional covering problems with variable upper bounds. SODA (2004)
Lisa Fleischer, Kamal Jain, Mohammad Mahdian
Tolls for Heterogeneous Selfish Users in Multicommodity Networks and Generalized Congestion Games. FOCS (2004)
Lisa Fleischer
Linear Tolls Suffice: New Bounds and Algorithms for Tolls in Single Source Networks. ICALP (2004)
Lisa Fleischer, Satoru Iwata
A push-relabel framework for submodular function minimization and applications to parametric optimization. Discret. Appl. Math. 131 (2) (2003)
Lisa Fleischer, Martin Skutella
Minimum cost flows over time without intermediate storage. SODA (2003)
Lisa Fleischer, Jay Sethuraman
Approximately optimal control of fluid networks. SODA (2003)
Lisa Fleischer, Satoru Iwata, S. Thomas McCormick
A faster capacity scaling algorithm for minimum cost submodular flow. Math. Program. 92 (1) (2002)
Lisa Fleischer, Martin Skutella
The Quickest Multicommodity Flow Problem. IPCO (2002)
Lisa Fleischer, Kevin D. Wayne
Fast and simple approximation schemes for generalized flow. Math. Program. 91 (2) (2002)
Lisa Fleischer, Kamal Jain, David P. Williamson
An Iterative Rounding 2-Approximation Algorithm for the Element Connectivity Problem. FOCS (2001)
Satoru Iwata, Lisa Fleischer, Satoru Fujishige
A combinatorial strongly polynomial algorithm for minimizing submodular functions. J. ACM 48 (4) (2001)
Lisa Fleischer
Faster Algorithms for the Quickest Transshipment Problem. SIAM J. Optim. 12 (1) (2001)
Lisa Fleischer
Universally maximum flow with piecewise-constant capacities. Networks 38 (3) (2001)
Lisa Fleischer
A 2-Approximation for Minimum Cost {0, 1, 2} Vertex Connectivity. IPCO (2001)
Lisa Fleischer
Approximating Fractional Multicommodity Flow Independent of the Number of Commodities. SIAM J. Discret. Math. 13 (4) (2000)
Lisa Fleischer, Bruce Hendrickson, Ali Pinar
On Identifying Strongly Connected Components in Parallel. IPDPS Workshops (2000)
Lisa Fleischer, Satoru Iwata
Improved algorithms for submodular function minimization and submodular flow. STOC (2000)
Satoru Iwata, Lisa Fleischer, Satoru Fujishige
A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions. STOC (2000)
Robert D. Carr, Lisa Fleischer, Vitus J. Leung, Cynthia A. Phillips
Strengthening integrality gaps for capacitated network design and covering problems. SODA (2000)
Lisa Fleischer, James B. Orlin
Optimal Rounding of Instantaneous Fractional Flows Over Time. SIAM J. Discret. Math. 13 (2) (2000)
Lisa Fleischer
Building Chain and Cactus Representations of All Minimum Cuts from Hao-Orlin in the Same Asymptotic Run Time. J. Algorithms 33 (1) (1999)
Lisa Fleischer
Approximating Fractional Multicommodity Flow Independent of the Number of Commodities. FOCS (1999)
Lisa Fleischer
Universally Maximum Flow with Piecewise-Constant Capacities. IPCO (1999)
Lisa Fleischer, Éva Tardos
Separating Maximally Violated Comb Inequalities in Planar Graphs. Math. Oper. Res. 24 (1) (1999)
Kevin D. Wayne, Lisa Fleischer
Faster Approximation Algorithms for Generalized Flow. SODA (1999)
Lisa Fleischer
Building Chain and Cactus Representations of All Minimum Cuts from Hao-Orlin in the Same Asymptotic Run Time. IPCO (1998)
Lisa Fleischer
Faster Algorithms for the Quickest Transshipment Problem with Zero Transit Times. SODA (1998)
Lisa Fleischer, Éva Tardos
Efficient continuous-time dynamic network flow algorithms. Oper. Res. Lett. 23 (3-5) (1998)
Lisa Fleischer, Éva Tardos
Separating Maximally Violated Comb Inequalities in Planar Graphs. IPCO (1996)
John Turek, Walter Ludwig, Joel L. Wolf, Lisa Fleischer, Prasoon Tiwari, Jason Glasgow, Uwe Schwiegelshohn, Philip S. Yu
Scheduling Parallelizable Tasks to Minimize Average Response Time. SPAA (1994)