Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

Home Page

* | 2009 | |
---|---|---|

45 | EE | Umang Bhaskar, Lisa Fleischer, Darrell Hoy, Chien-Chung Huang: Equilibria of atomic flow games are not unique. SODA 2009: 748-757 |

2008 | ||

44 | EE | Zoya Svitkina, Lisa Fleischer: Submodular Approximation: Sampling-based Algorithms and Lower Bounds. FOCS 2008: 697-706 |

43 | EE | 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: 306-325 |

42 | EE | Richard Cole, Shahar Dobzinski, Lisa Fleischer: Prompt Mechanisms for Online Auctions. SAGT 2008: 170-181 |

41 | EE | Richard Cole, Lisa Fleischer: Fast-converging tatonnement algorithms for one-time and ongoing market problems. STOC 2008: 315-324 |

40 | EE | Lisa Fleischer, Rahul Garg, Sanjiv Kapoor, Rohit Khandekar, Amin Saberi: A Fast and Simple Algorithm for Computing Market Equilibria. WINE 2008: 19-30 |

39 | EE | Zoya Svitkina, Lisa Fleischer: Submodular approximation: sampling-based algorithms and lower bounds CoRR abs/0805.1071: (2008) |

38 | EE | Kirsten Hildrum, Fred Douglis, Joel L. Wolf, Philip S. Yu, Lisa Fleischer, Akshay Katta: Storage optimization for large-scale distributed stream-processing systems. TOS 3(4): (2008) |

2007 | ||

37 | EE | 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: 1-8 |

36 | EE | Lisa Fleischer, Martin Skutella: Quickest Flows Over Time. SIAM J. Comput. 36(6): 1600-1630 (2007) |

2006 | ||

35 | EE | Lisa Fleischer, Michel X. Goemans, Vahab S. Mirrokni, Maxim Sviridenko: Tight approximation algorithms for maximum general assignment problems. SODA 2006: 611-620 |

34 | EE | Don Coppersmith, Lisa Fleischer, Atri Rudra: Ordering by weighted number of wins gives a good ranking for weighted tournaments. SODA 2006: 776-782 |

33 | EE | 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: 663-670 |

32 | EE | Lisa Fleischer, Kamal Jain, David P. Williamson: Iterative rounding 2-approximation algorithms for minimum-cost vertex connectivity problems. J. Comput. Syst. Sci. 72(5): 838-867 (2006) |

31 | EE | Lisa Fleischer, Adam N. Letchford, Andrea Lodi: Polynomial-Time Separation of a Superclass of Simple Comb Inequalities. Math. Oper. Res. 31(4): 696-713 (2006) |

2005 | ||

30 | EE | Don Coppersmith, Lisa Fleischer, Atri Rudra: Ordering by weighted number of wins gives a good ranking for weighted tournaments Electronic Colloquium on Computational Complexity (ECCC)(131): (2005) |

29 | EE | 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): 916-938 (2005) |

28 | EE | Lisa Fleischer: Linear tolls suffice: New bounds and algorithms for tolls in single source networks. Theor. Comput. Sci. 348(2-3): 217-225 (2005) |

2004 | ||

27 | EE | Lisa Fleischer, Kamal Jain, Mohammad Mahdian: Tolls for Heterogeneous Selfish Users in Multicommodity Networks and Generalized Congestion Games. FOCS 2004: 277-285 |

26 | EE | Nikhil Bansal, Lisa Fleischer, Tracy Kimbrel, Mohammad Mahdian, Baruch Schieber, Maxim Sviridenko: Further Improvements in Competitive Guarantees for QoS Buffering. ICALP 2004: 196-207 |

25 | EE | Lisa Fleischer: Linear Tolls Suffice: New Bounds and Algorithms for Tolls in Single Source Networks. ICALP 2004: 544-554 |

24 | EE | Lisa Fleischer: A fast approximation scheme for fractional covering problems with variable upper bounds. SODA 2004: 1001-1010 |

2003 | ||

23 | EE | Lisa Fleischer, Jay Sethuraman: Approximately optimal control of fluid networks. SODA 2003: 56-65 |

22 | EE | Lisa Fleischer, Martin Skutella: Minimum cost flows over time without intermediate storage. SODA 2003: 66-75 |

21 | EE | Lisa Fleischer, Satoru Iwata: A push-relabel framework for submodular function minimization and applications to parametric optimization. Discrete Applied Mathematics 131(2): 311-322 (2003) |

2002 | ||

20 | EE | Lisa Fleischer, Martin Skutella: The Quickest Multicommodity Flow Problem. IPCO 2002: 36-53 |

2001 | ||

19 | Lisa Fleischer, Kamal Jain, David P. Williamson: An Iterative Rounding 2-Approximation Algorithm for the Element Connectivity Problem. FOCS 2001: 339-347 | |

18 | EE | Lisa Fleischer: A 2-Approximation for Minimum Cost {0, 1, 2} Vertex Connectivity. IPCO 2001: 115-129 |

17 | EE | Satoru Iwata, Lisa Fleischer, Satoru Fujishige: A combinatorial strongly polynomial algorithm for minimizing submodular functions. J. ACM 48(4): 761-777 (2001) |

16 | EE | Lisa Fleischer: Universally maximum flow with piecewise-constant capacities. Networks 38(3): 115-125 (2001) |

2000 | ||

15 | EE | Lisa Fleischer, Bruce Hendrickson, Ali Pinar: On Identifying Strongly Connected Components in Parallel. IPDPS Workshops 2000: 505-511 |

14 | EE | Robert D. Carr, Lisa Fleischer, Vitus J. Leung, Cynthia A. Phillips: Strengthening integrality gaps for capacitated network design and covering problems. SODA 2000: 106-115 |

13 | EE | Lisa Fleischer, Satoru Iwata: Improved algorithms for submodular function minimization and submodular flow. STOC 2000: 107-116 |

12 | EE | Satoru Iwata, Lisa Fleischer, Satoru Fujishige: A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions. STOC 2000: 97-106 |

11 | EE | Lisa Fleischer, James B. Orlin: Optimal Rounding of Instantaneous Fractional Flows Over Time. SIAM J. Discrete Math. 13(2): 145-153 (2000) |

10 | EE | Lisa Fleischer: Approximating Fractional Multicommodity Flow Independent of the Number of Commodities. SIAM J. Discrete Math. 13(4): 505-520 (2000) |

1999 | ||

9 | EE | Lisa Fleischer: Approximating Fractional Multicommodity Flow Independent of the Number of Commodities. FOCS 1999: 24-31 |

8 | EE | Lisa Fleischer: Universally Maximum Flow with Piecewise-Constant Capacities. IPCO 1999: 151-165 |

7 | EE | Kevin D. Wayne, Lisa Fleischer: Faster Approximation Algorithms for Generalized Flow. SODA 1999: 981-982 |

6 | Lisa Fleischer: Building Chain and Cactus Representations of All Minimum Cuts from Hao-Orlin in the Same Asymptotic Run Time. J. Algorithms 33(1): 51-72 (1999) | |

1998 | ||

5 | EE | Lisa Fleischer: Building Chain and Cactus Representations of All Minimum Cuts from Hao-Orlin in the Same Asymptotic Run Time. IPCO 1998: 294-309 |

4 | Lisa Fleischer: Faster Algorithms for the Quickest Transshipment Problem with Zero Transit Times. SODA 1998: 147-156 | |

3 | EE | Lisa Fleischer, Éva Tardos: Efficient continuous-time dynamic network flow algorithms. Oper. Res. Lett. 23(3-5): 71-80 (1998) |

1996 | ||

2 | EE | Lisa Fleischer, Éva Tardos: Separating Maximally Violated Comb Inequalities in Planar Graphs. IPCO 1996: 475-489 |

1994 | ||

1 | EE | 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: 200-209 |