| 2013 | SODA | Online Mixed Packing and Covering. | Yossi Azar, Umang Bhaskar, Lisa Fleischer, Debmalya Panigrahi |
| 2012 | INFOCOM | Simple sybil-proof mechanisms for multi-level marketing. | Fabio Drucker, Lisa Fleischer |
| 2012 | STOC | When the cut condition is enough: a complete characterization for multiflow problems in series-parallel networks. | Amit Chakrabarti, Lisa Fleischer, Christophe Weibel |
| 2011 | SODA | A Stackelberg Strategy for Routing Flow over Time. | Umang Bhaskar, Lisa Fleischer, Elliot Anshelevich |
| 2011 | SAGT | Lower Bound for Envy-Free and Truthful Makespan Approximation on Related Machines. | Lisa Fleischer, Zhenghui Wang |
| 2010 | IPCO | The Price of Collusion in Series-Parallel Networks. | Umang Bhaskar, Lisa Fleischer, Chien-Chung Huang |
| 2009 | SODA | Equilibria of atomic flow games are not unique. | Umang Bhaskar, Lisa Fleischer, Darrell Hoy, Chien-Chung Huang |
| 2008 | FOCS | Submodular Approximation: Sampling-based Algorithms and Lower Bounds. | Zoya Svitkina, Lisa Fleischer |
| 2008 | Middleware | SODA: An Optimizing Scheduler for Large-Scale Stream-Based Distributed Computer Systems. | Joel L. Wolf, Nikhil Bansal, Kirsten Hildrum, Sujay S. Parekh, Deepak Rajan, Rohit Wagle, Kun-Lung Wu, Lisa Fleischer |
| 2008 | STOC | Fast-converging tatonnement algorithms for one-time and ongoing market problems. | Richard Cole, Lisa Fleischer |
| 2008 | SAGT | Prompt Mechanisms for Online Auctions. | Richard Cole, Shahar Dobzinski, Lisa Fleischer |
| 2006 | SODA | Ordering by weighted number of wins gives a good ranking for weighted tournaments. | Don Coppersmith, Lisa Fleischer, Atri Rudra |
| 2006 | SODA | Tight approximation algorithms for maximum general assignment problems. | Lisa Fleischer, Michel X. Goemans, Vahab S. Mirrokni, Maxim Sviridenko |
| 2006 | STOC | Simple cost sharing schemes for multicommodity rent-or-buy and stochastic Steiner tree. | Lisa Fleischer, Jochen Knemann, Stefano Leonardi, Guido Schfer |
| 2004 | FOCS | Tolls for Heterogeneous Selfish Users in Multicommodity Networks and Generalized Congestion Games. | Lisa Fleischer, Kamal Jain, Mohammad Mahdian |
| 2004 | ICALP | Further Improvements in Competitive Guarantees for QoS Buffering. | Nikhil Bansal, Lisa Fleischer, Tracy Kimbrel, Mohammad Mahdian, Baruch Schieber, Maxim Sviridenko |
| 2004 | ICALP | Linear Tolls Suffice: New Bounds and Algorithms for Tolls in Single Source Networks. | Lisa Fleischer |
| 2004 | SODA | A fast approximation scheme for fractional covering problems with variable upper bounds. | Lisa Fleischer |
| 2003 | SODA | Approximately optimal control of fluid networks. | Lisa Fleischer, Jay Sethuraman |
| 2003 | SODA | Minimum cost flows over time without intermediate storage. | Lisa Fleischer, Martin Skutella |
| 2002 | IPCO | The Quickest Multicommodity Flow Problem. | Lisa Fleischer, Martin Skutella |
| 2001 | FOCS | An Iterative Rounding 2-Approximation Algorithm for the Element Connectivity Problem. | Lisa Fleischer, Kamal Jain, David P. Williamson |
| 2001 | IPCO | A 2-Approximation for Minimum Cost {0, 1, 2} Vertex Connectivity. | Lisa Fleischer |
| 2000 | SODA | Strengthening integrality gaps for capacitated network design and covering problems. | Robert D. Carr, Lisa Fleischer, Vitus J. Leung, Cynthia A. Phillips |
| 2000 | STOC | Improved algorithms for submodular function minimization and submodular flow. | Lisa Fleischer, Satoru Iwata |
| 2000 | STOC | A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions. | Satoru Iwata, Lisa Fleischer, Satoru Fujishige |
| 1999 | FOCS | Approximating Fractional Multicommodity Flow Independent of the Number of Commodities. | Lisa Fleischer |
| 1999 | IPCO | Universally Maximum Flow with Piecewise-Constant Capacities. | Lisa Fleischer |
| 1999 | SODA | Faster Approximation Algorithms for Generalized Flow. | Kevin D. Wayne, Lisa Fleischer |
| 1998 | IPCO | Building Chain and Cactus Representations of All Minimum Cuts from Hao-Orlin in the Same Asymptotic Run Time. | Lisa Fleischer |
| 1998 | SODA | Faster Algorithms for the Quickest Transshipment Problem with Zero Transit Times. | Lisa Fleischer |
| 1996 | IPCO | Separating Maximally Violated Comb Inequalities in Planar Graphs. | Lisa Fleischer, va Tardos |
| 1994 | SPAA | Scheduling Parallelizable Tasks to Minimize Average Response Time. | John Turek, Walter Ludwig, Joel L. Wolf, Lisa Fleischer, Prasoon Tiwari, Jason Glasgow, Uwe Schwiegelshohn, Philip S. Yu |