The SCEAS System
| |||||||

## Search the dblp DataBase
Lisa Fleischer:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Lisa Fleischer
**Approximating Fractional Multicommodity Flow Independent of the Number of Commodities.**[Citation Graph (0, 0)][DBLP] FOCS, 1999, pp:24-31 [Conf] - Lisa Fleischer, Kamal Jain, Mohammad Mahdian
**Tolls for Heterogeneous Selfish Users in Multicommodity Networks and Generalized Congestion Games.**[Citation Graph (0, 0)][DBLP] FOCS, 2004, pp:277-285 [Conf] - Lisa Fleischer, Kamal Jain, David P. Williamson
**An Iterative Rounding 2-Approximation Algorithm for the Element Connectivity Problem.**[Citation Graph (0, 0)][DBLP] FOCS, 2001, pp:339-347 [Conf] - Nikhil Bansal, Lisa Fleischer, Tracy Kimbrel, Mohammad Mahdian, Baruch Schieber, Maxim Sviridenko
**Further Improvements in Competitive Guarantees for QoS Buffering.**[Citation Graph (0, 0)][DBLP] ICALP, 2004, pp:196-207 [Conf] - Lisa Fleischer
**Linear Tolls Suffice: New Bounds and Algorithms for Tolls in Single Source Networks.**[Citation Graph (0, 0)][DBLP] ICALP, 2004, pp:544-554 [Conf] - Lisa Fleischer
**A 2-Approximation for Minimum Cost {0, 1, 2} Vertex Connectivity.**[Citation Graph (0, 0)][DBLP] IPCO, 2001, pp:115-129 [Conf] - Lisa Fleischer
**Building Chain and Cactus Representations of All Minimum Cuts from Hao-Orlin in the Same Asymptotic Run Time.**[Citation Graph (0, 0)][DBLP] IPCO, 1998, pp:294-309 [Conf] - Lisa Fleischer
**Universally Maximum Flow with Piecewise-Constant Capacities.**[Citation Graph (0, 0)][DBLP] IPCO, 1999, pp:151-165 [Conf] - Lisa Fleischer, Martin Skutella
**The Quickest Multicommodity Flow Problem.**[Citation Graph (0, 0)][DBLP] IPCO, 2002, pp:36-53 [Conf] - Lisa Fleischer, Éva Tardos
**Separating Maximally Violated Comb Inequalities in Planar Graphs.**[Citation Graph (0, 0)][DBLP] IPCO, 1996, pp:475-489 [Conf] - Lisa Fleischer, Bruce Hendrickson, Ali Pinar
**On Identifying Strongly Connected Components in Parallel.**[Citation Graph (0, 0)][DBLP] IPDPS Workshops, 2000, pp:505-511 [Conf] - Robert D. Carr, Lisa Fleischer, Vitus J. Leung, Cynthia A. Phillips
**Strengthening integrality gaps for capacitated network design and covering problems.**[Citation Graph (0, 0)][DBLP] SODA, 2000, pp:106-115 [Conf] - Don Coppersmith, Lisa Fleischer, Atri Rudra
**Ordering by weighted number of wins gives a good ranking for weighted tournaments.**[Citation Graph (0, 0)][DBLP] SODA, 2006, pp:776-782 [Conf] - Lisa Fleischer
**A fast approximation scheme for fractional covering problems with variable upper bounds.**[Citation Graph (0, 0)][DBLP] SODA, 2004, pp:1001-1010 [Conf] - Lisa Fleischer
**Faster Algorithms for the Quickest Transshipment Problem with Zero Transit Times.**[Citation Graph (0, 0)][DBLP] SODA, 1998, pp:147-156 [Conf] - Lisa Fleischer, Michel X. Goemans, Vahab S. Mirrokni, Maxim Sviridenko
**Tight approximation algorithms for maximum general assignment problems.**[Citation Graph (0, 0)][DBLP] SODA, 2006, pp:611-620 [Conf] - Lisa Fleischer, Jay Sethuraman
**Approximately optimal control of fluid networks.**[Citation Graph (0, 0)][DBLP] SODA, 2003, pp:56-65 [Conf] - Lisa Fleischer, Martin Skutella
**Minimum cost flows over time without intermediate storage.**[Citation Graph (0, 0)][DBLP] SODA, 2003, pp:66-75 [Conf] - Kevin D. Wayne, Lisa Fleischer
**Faster Approximation Algorithms for Generalized Flow.**[Citation Graph (0, 0)][DBLP] SODA, 1999, pp:981-982 [Conf] - 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.**[Citation Graph (0, 0)][DBLP] SPAA, 1994, pp:200-209 [Conf] - Lisa Fleischer, Satoru Iwata
**Improved algorithms for submodular function minimization and submodular flow.**[Citation Graph (0, 0)][DBLP] STOC, 2000, pp:107-116 [Conf] - Lisa Fleischer, Jochen Könemann, Stefano Leonardi, Guido Schäfer
**Simple cost sharing schemes for multicommodity rent-or-buy and stochastic Steiner tree.**[Citation Graph (0, 0)][DBLP] STOC, 2006, pp:663-670 [Conf] - Satoru Iwata, Lisa Fleischer, Satoru Fujishige
**A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions.**[Citation Graph (0, 0)][DBLP] STOC, 2000, pp:97-106 [Conf] - Lisa Fleischer, Satoru Iwata
**A push-relabel framework for submodular function minimization and applications to parametric optimization.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2003, v:131, n:2, pp:311-322 [Journal] - Don Coppersmith, Lisa Fleischer, Atri Rudra
**Ordering by weighted number of wins gives a good ranking for weighted tournaments**[Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:131, pp:- [Journal] - Satoru Iwata, Lisa Fleischer, Satoru Fujishige
**A combinatorial strongly polynomial algorithm for minimizing submodular functions.**[Citation Graph (0, 0)][DBLP] J. ACM, 2001, v:48, n:4, pp:761-777 [Journal] - Lisa Fleischer
**Building Chain and Cactus Representations of All Minimum Cuts from Hao-Orlin in the Same Asymptotic Run Time.**[Citation Graph (0, 0)][DBLP] J. Algorithms, 1999, v:33, n:1, pp:51-72 [Journal] - Lisa Fleischer, Kamal Jain, David P. Williamson
**Iterative rounding 2-approximation algorithms for minimum-cost vertex connectivity problems.**[Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 2006, v:72, n:5, pp:838-867 [Journal] - Lisa Fleischer
**Universally maximum flow with piecewise-constant capacities.**[Citation Graph (0, 0)][DBLP] Networks, 2001, v:38, n:3, pp:115-125 [Journal] - Lisa Fleischer, Éva Tardos
**Efficient continuous-time dynamic network flow algorithms.**[Citation Graph (0, 0)][DBLP] Oper. Res. Lett., 1998, v:23, n:3-5, pp:71-80 [Journal] - Lisa Fleischer, Martin Skutella
**Quickest Flows Over Time.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 2007, v:36, n:6, pp:1600-1630 [Journal] - Lisa Fleischer
**Approximating Fractional Multicommodity Flow Independent of the Number of Commodities.**[Citation Graph (0, 0)][DBLP] SIAM J. Discrete Math., 2000, v:13, n:4, pp:505-520 [Journal] - Lisa Fleischer, James B. Orlin
**Optimal Rounding of Instantaneous Fractional Flows Over Time.**[Citation Graph (0, 0)][DBLP] SIAM J. Discrete Math., 2000, v:13, n:2, pp:145-153 [Journal] - Lisa Fleischer
**Linear tolls suffice: New bounds and algorithms for tolls in single source networks.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2005, v:348, n:2-3, pp:217-225 [Journal] - Kirsten Hildrum, Fred Douglis, Joel L. Wolf, Philip S. Yu, Lisa Fleischer, Akshay Katta
**Storage Optimization for Large-Scale Distributed Stream Processing Systems.**[Citation Graph (0, 0)][DBLP] IPDPS, 2007, pp:1-8 [Conf] **Submodular Approximation: Sampling-based Algorithms and Lower Bounds.**[Citation Graph (, )][DBLP]**The Price of Collusion in Series-Parallel Networks.**[Citation Graph (, )][DBLP]**SODA: An Optimizing Scheduler for Large-Scale Stream-Based Distributed Computer Systems.**[Citation Graph (, )][DBLP]**Equilibria of atomic flow games are not unique.**[Citation Graph (, )][DBLP]**Fast-converging tatonnement algorithms for one-time and ongoing market problems.**[Citation Graph (, )][DBLP]**A Fast and Simple Algorithm for Computing Market Equilibria.**[Citation Graph (, )][DBLP]**Prompt Mechanisms for Online Auctions.**[Citation Graph (, )][DBLP]**Submodular approximation: sampling-based algorithms and lower bounds**[Citation Graph (, )][DBLP]
Search in 0.006secs, Finished in 0.009secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |