default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLisa Fleischer
Person information
- affiliation: Dartmouth College, Hanover, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[c42]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: 143-153- [c41]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: 311-321
2010 – 2019
- 2016
- [j27]Lisa Fleischer, Rahul Garg, Sanjiv Kapoor, Rohit Khandekar, Amin Saberi:
A Simple and Efficient Algorithm for Computing Market Equilibria. ACM Trans. Algorithms 12(3): 34:1-34:15 (2016) - 2015
- [j26]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: 228-231 (2015) - [j25]Umang Bhaskar, Lisa Fleischer, Elliot Anshelevich
:
A Stackelberg strategy for routing flow over time. Games Econ. Behav. 92: 232-247 (2015) - [j24]Yossi Azar, Lisa Fleischer, Kamal Jain, Vahab S. Mirrokni, Zoya Svitkina:
Optimal Coordination Mechanisms for Unrelated Machine Scheduling. Oper. Res. 63(3): 489-500 (2015) - [j23]Umang Bhaskar, Lisa Fleischer, Darrell Hoy, Chien-Chung Huang:
On the Uniqueness of Equilibrium in Atomic Splittable Routing Games. Math. Oper. Res. 40(3): 634-654 (2015) - 2013
- [c40]Yossi Azar, Umang Bhaskar, Lisa Fleischer, Debmalya Panigrahi:
Online Mixed Packing and Covering. SODA 2013: 85-100 - 2012
- [c39]Fabio Drucker, Lisa Fleischer:
Simple sybil-proof mechanisms for multi-level marketing. INFOCOM Workshops 2012: 163 - [c38]Fabio Drucker, Lisa Fleischer:
Simpler sybil-proof mechanisms for multi-level marketing. EC 2012: 441-458 - [c37]Lisa Fleischer, Yu-Han Lyu:
Approximately optimal auctions for selling privacy when costs are correlated with data. EC 2012: 568-585 - [c36]Amit Chakrabarti, Lisa Fleischer, Christophe Weibel:
When the cut condition is enough: a complete characterization for multiflow problems in series-parallel networks. STOC 2012: 19-26 - [i8]Amit Chakrabarti, Lisa Fleischer, Christophe Weibel:
When the Cut Condition is Enough: A Complete Characterization for Multiflow Problems in Series-Parallel Networks. CoRR abs/1203.4041 (2012) - [i7]Umang Bhaskar, Lisa Fleischer:
Online Mixed Packing and Covering. CoRR abs/1203.6695 (2012) - [i6]Lisa Fleischer, Yu-Han Lyu:
Approximately Optimal Auctions for Selling Privacy when Costs are Correlated with Data. CoRR abs/1204.4031 (2012) - 2011
- [j22]Lisa Fleischer, Michel X. Goemans, Vahab S. Mirrokni, Maxim Sviridenko:
Tight Approximation Algorithms for Maximum Separable Assignment Problems. Math. Oper. Res. 36(3): 416-431 (2011) - [j21]Zoya Svitkina, Lisa Fleischer:
Submodular Approximation: Sampling-based Algorithms and Lower Bounds. SIAM J. Comput. 40(6): 1715-1737 (2011) - [j20]Umang Bhaskar, Lisa Fleischer, Elliot Anshelevich:
A competitive strategy for routing flow over time. SIGecom Exch. 10(2): 23-28 (2011) - [c35]Lisa Fleischer, Zhenghui Wang:
Lower Bound for Envy-Free and Truthful Makespan Approximation on Related Machines. SAGT 2011: 166-177 - [c34]Umang Bhaskar, Lisa Fleischer, Elliot Anshelevich:
A Stackelberg Strategy for Routing Flow over Time. SODA 2011: 192-201 - [i5]Lisa Fleischer, Zhenghui Wang:
Lower Bound for Envy-Free and Truthful Makespan Approximation on Related Machines. CoRR abs/1107.2957 (2011) - 2010
- [j19]Lisa Fleischer, Jochen Könemann, Stefano Leonardi, Guido Schäfer:
Strict Cost Sharing Schemes for Steiner Forest. SIAM J. Comput. 39(8): 3616-3632 (2010) - [j18]Don Coppersmith, Lisa Fleischer, Atri Rudra:
Ordering by weighted number of wins gives a good ranking for weighted tournaments. ACM Trans. Algorithms 6(3): 55:1-55:13 (2010) - [c33]Lisa Fleischer:
Data Center Scheduling, Generalized Flows, and Submodularity. ANALCO 2010: 56-65 - [c32]Lisa Fleischer, Zoya Svitkina:
Preference-constrained Oriented Matching. ANALCO 2010: 66-73 - [c31]Umang Bhaskar, Lisa Fleischer, Chien-Chung Huang:
The Price of Collusion in Series-Parallel Networks. IPCO 2010: 313-326 - [i4]Umang Bhaskar, Lisa Fleischer, Elliot Anshelevich:
A Stackelberg Strategy for Routing Flow over Time. CoRR abs/1010.3034 (2010) - [i3]Richard Cole, Lisa Fleischer, Ashish Rastogi:
Discrete Price Updates Yield Fast Convergence in Ongoing Markets with Finite Warehouses. CoRR abs/1012.2124 (2010)
2000 – 2009
- 2009
- [c30]Umang Bhaskar, Lisa Fleischer, Darrell Hoy, Chien-Chung Huang:
Equilibria of atomic flow games are not unique. SODA 2009: 748-757 - 2008
- [j17]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): 5:1-5:28 (2008) - [c29]Zoya Svitkina, Lisa Fleischer:
Submodular Approximation: Sampling-based Algorithms and Lower Bounds. FOCS 2008: 697-706 - [c28]Joel L. Wolf, Nikhil Bansal, Kirsten Hildrum, Sujay S. 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 - [c27]Richard Cole, Shahar Dobzinski, Lisa Fleischer:
Prompt Mechanisms for Online Auctions. SAGT 2008: 170-181 - [c26]Richard Cole, Lisa Fleischer:
Fast-converging tatonnement algorithms for one-time and ongoing market problems. STOC 2008: 315-324 - [c25]Lisa Fleischer, Rahul Garg, Sanjiv Kapoor, Rohit Khandekar, Amin Saberi:
A Fast and Simple Algorithm for Computing Market Equilibria. WINE 2008: 19-30 - [i2]Zoya Svitkina, Lisa Fleischer:
Submodular approximation: sampling-based algorithms and lower bounds. CoRR abs/0805.1071 (2008) - 2007
- [j16]Lisa Fleischer, Martin Skutella:
Quickest Flows Over Time. SIAM J. Comput. 36(6): 1600-1630 (2007) - [c24]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 - 2006
- [j15]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) - [j14]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) - [c23]Lisa Fleischer, Michel X. Goemans, Vahab S. Mirrokni, Maxim Sviridenko:
Tight approximation algorithms for maximum general assignment problems. SODA 2006: 611-620 - [c22]Don Coppersmith, Lisa Fleischer, Atri Rudra:
Ordering by weighted number of wins gives a good ranking for weighted tournaments. SODA 2006: 776-782 - [c21]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 - 2005
- [j13]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) - [j12]Lisa Fleischer:
Linear tolls suffice: New bounds and algorithms for tolls in single source networks. Theor. Comput. Sci. 348(2-3): 217-225 (2005) - [i1]Don Coppersmith, Lisa Fleischer, Atri Rudra:
Ordering by weighted number of wins gives a good ranking for weighted tournaments. Electron. Colloquium Comput. Complex. TR05 (2005) - 2004
- [c20]Lisa Fleischer, Kamal Jain, Mohammad Mahdian:
Tolls for Heterogeneous Selfish Users in Multicommodity Networks and Generalized Congestion Games. FOCS 2004: 277-285 - [c19]Nikhil Bansal, Lisa Fleischer, Tracy Kimbrel, Mohammad Mahdian, Baruch Schieber, Maxim Sviridenko:
Further Improvements in Competitive Guarantees for QoS Buffering. ICALP 2004: 196-207 - [c18]Lisa Fleischer:
Linear Tolls Suffice: New Bounds and Algorithms for Tolls in Single Source Networks. ICALP 2004: 544-554 - [c17]Lisa Fleischer:
A fast approximation scheme for fractional covering problems with variable upper bounds. SODA 2004: 1001-1010 - 2003
- [j11]Lisa Fleischer, Satoru Iwata:
A push-relabel framework for submodular function minimization and applications to parametric optimization. Discret. Appl. Math. 131(2): 311-322 (2003) - [c16]Lisa Fleischer, Jay Sethuraman:
Approximately optimal control of fluid networks. SODA 2003: 56-65 - [c15]Lisa Fleischer, Martin Skutella:
Minimum cost flows over time without intermediate storage. SODA 2003: 66-75 - [p1]Clifford Stein, Lisa Fleischer, Douglas R. Shier, Prakash Mirchandani, David Simchi-Levi:
Networks and Flows. Handbook of Graph Theory 2003: 1074-1142 - 2002
- [j10]Lisa Fleischer, Kevin D. Wayne:
Fast and simple approximation schemes for generalized flow. Math. Program. 91(2): 215-238 (2002) - [j9]Lisa Fleischer, Satoru Iwata, S. Thomas McCormick:
A faster capacity scaling algorithm for minimum cost submodular flow. Math. Program. 92(1): 119-139 (2002) - [c14]Lisa Fleischer, Martin Skutella:
The Quickest Multicommodity Flow Problem. IPCO 2002: 36-53 - 2001
- [j8]Satoru Iwata, Lisa Fleischer, Satoru Fujishige:
A combinatorial strongly polynomial algorithm for minimizing submodular functions. J. ACM 48(4): 761-777 (2001) - [j7]Lisa Fleischer:
Universally maximum flow with piecewise-constant capacities. Networks 38(3): 115-125 (2001) - [j6]Lisa Fleischer:
Faster Algorithms for the Quickest Transshipment Problem. SIAM J. Optim. 12(1): 18-35 (2001) - [c13]Lisa Fleischer, Kamal Jain, David P. Williamson:
An Iterative Rounding 2-Approximation Algorithm for the Element Connectivity Problem. FOCS 2001: 339-347 - [c12]Lisa Fleischer:
A 2-Approximation for Minimum Cost {0, 1, 2} Vertex Connectivity. IPCO 2001: 115-129 - 2000
- [j5]Lisa Fleischer, James B. Orlin:
Optimal Rounding of Instantaneous Fractional Flows Over Time. SIAM J. Discret. Math. 13(2): 145-153 (2000) - [j4]Lisa Fleischer:
Approximating Fractional Multicommodity Flow Independent of the Number of Commodities. SIAM J. Discret. Math. 13(4): 505-520 (2000) - [c11]Lisa Fleischer, Bruce Hendrickson, Ali Pinar:
On Identifying Strongly Connected Components in Parallel. IPDPS Workshops 2000: 505-511 - [c10]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 - [c9]Satoru Iwata, Lisa Fleischer, Satoru Fujishige:
A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions. STOC 2000: 97-106 - [c8]Lisa Fleischer, Satoru Iwata:
Improved algorithms for submodular function minimization and submodular flow. STOC 2000: 107-116
1990 – 1999
- 1999
- [j3]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) - [j2]Lisa Fleischer, Éva Tardos:
Separating Maximally Violated Comb Inequalities in Planar Graphs. Math. Oper. Res. 24(1): 130-148 (1999) - [c7]Lisa Fleischer:
Approximating Fractional Multicommodity Flow Independent of the Number of Commodities. FOCS 1999: 24-31 - [c6]Lisa Fleischer:
Universally Maximum Flow with Piecewise-Constant Capacities. IPCO 1999: 151-165 - [c5]Kevin D. Wayne, Lisa Fleischer:
Faster Approximation Algorithms for Generalized Flow. SODA 1999: 981-982 - 1998
- [j1]Lisa Fleischer, Éva Tardos:
Efficient continuous-time dynamic network flow algorithms. Oper. Res. Lett. 23(3-5): 71-80 (1998) - [c4]Lisa Fleischer:
Building Chain and Cactus Representations of All Minimum Cuts from Hao-Orlin in the Same Asymptotic Run Time. IPCO 1998: 294-309 - [c3]Lisa Fleischer:
Faster Algorithms for the Quickest Transshipment Problem with Zero Transit Times. SODA 1998: 147-156 - 1996
- [c2]Lisa Fleischer, Éva Tardos:
Separating Maximally Violated Comb Inequalities in Planar Graphs. IPCO 1996: 475-489 - 1994
- [c1]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
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 21:23 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
