The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Lisa Fleischer: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Lisa Fleischer
    Approximating Fractional Multicommodity Flow Independent of the Number of Commodities. [Citation Graph (0, 0)][DBLP]
    FOCS, 1999, pp:24-31 [Conf]
  2. 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]
  3. 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]
  4. 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]
  5. 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]
  6. Lisa Fleischer
    A 2-Approximation for Minimum Cost {0, 1, 2} Vertex Connectivity. [Citation Graph (0, 0)][DBLP]
    IPCO, 2001, pp:115-129 [Conf]
  7. 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]
  8. Lisa Fleischer
    Universally Maximum Flow with Piecewise-Constant Capacities. [Citation Graph (0, 0)][DBLP]
    IPCO, 1999, pp:151-165 [Conf]
  9. Lisa Fleischer, Martin Skutella
    The Quickest Multicommodity Flow Problem. [Citation Graph (0, 0)][DBLP]
    IPCO, 2002, pp:36-53 [Conf]
  10. Lisa Fleischer, Éva Tardos
    Separating Maximally Violated Comb Inequalities in Planar Graphs. [Citation Graph (0, 0)][DBLP]
    IPCO, 1996, pp:475-489 [Conf]
  11. 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]
  12. 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]
  13. 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]
  14. 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]
  15. Lisa Fleischer
    Faster Algorithms for the Quickest Transshipment Problem with Zero Transit Times. [Citation Graph (0, 0)][DBLP]
    SODA, 1998, pp:147-156 [Conf]
  16. 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]
  17. Lisa Fleischer, Jay Sethuraman
    Approximately optimal control of fluid networks. [Citation Graph (0, 0)][DBLP]
    SODA, 2003, pp:56-65 [Conf]
  18. Lisa Fleischer, Martin Skutella
    Minimum cost flows over time without intermediate storage. [Citation Graph (0, 0)][DBLP]
    SODA, 2003, pp:66-75 [Conf]
  19. Kevin D. Wayne, Lisa Fleischer
    Faster Approximation Algorithms for Generalized Flow. [Citation Graph (0, 0)][DBLP]
    SODA, 1999, pp:981-982 [Conf]
  20. 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]
  21. Lisa Fleischer, Satoru Iwata
    Improved algorithms for submodular function minimization and submodular flow. [Citation Graph (0, 0)][DBLP]
    STOC, 2000, pp:107-116 [Conf]
  22. 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]
  23. 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]
  24. 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]
  25. 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]
  26. 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]
  27. 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]
  28. 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]
  29. Lisa Fleischer
    Universally maximum flow with piecewise-constant capacities. [Citation Graph (0, 0)][DBLP]
    Networks, 2001, v:38, n:3, pp:115-125 [Journal]
  30. 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]
  31. 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]
  32. 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]
  33. 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]
  34. 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]
  35. 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]

  36. Submodular Approximation: Sampling-based Algorithms and Lower Bounds. [Citation Graph (, )][DBLP]


  37. The Price of Collusion in Series-Parallel Networks. [Citation Graph (, )][DBLP]


  38. SODA: An Optimizing Scheduler for Large-Scale Stream-Based Distributed Computer Systems. [Citation Graph (, )][DBLP]


  39. Equilibria of atomic flow games are not unique. [Citation Graph (, )][DBLP]


  40. Fast-converging tatonnement algorithms for one-time and ongoing market problems. [Citation Graph (, )][DBLP]


  41. A Fast and Simple Algorithm for Computing Market Equilibria. [Citation Graph (, )][DBLP]


  42. Prompt Mechanisms for Online Auctions. [Citation Graph (, )][DBLP]


  43. Submodular approximation: sampling-based algorithms and lower bounds [Citation Graph (, )][DBLP]


Search in 0.013secs, Finished in 0.015secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002