Lisa Fleischer

78 papers A* 24A 2B 9Journal 35Unranked 7

Year	Rank	Type	Title / Venue / Authors
2021	—	`conf`	Impact of the COVID-19 Crisis on Digital Business Models - Contactless Payments. KES-AMSTA Ralf-Christian Härting, Kevin Bilge, Lisa Fleischer, Nadja Landgraf, Feride Özcakir, Marcel Wicher
2021	—	`conf`	Potentials of Digital Business Models in Tourism - A Quantitative Study. KES-AMSTA Ralf-Christian Härting, Marcel Bäuerle, Kevin Bilge, Lisa Fleischer, Nadja Landgraf, Marcel Wicher
2016	J	`jnl`	A Simple and Efficient Algorithm for Computing Market Equilibria. ACM Trans. Algorithms Lisa Fleischer, Rahul Garg, Sanjiv Kapoor, Rohit Khandekar, Amin Saberi
2015	J	`jnl`	A Stackelberg strategy for routing flow over time. Games Econ. Behav. Umang Bhaskar, Lisa Fleischer, Elliot Anshelevich
2015	J	`jnl`	Introduction to the Special Issue - Algorithmic Game Theory - STOC/FOCS/SODA 2011. Games Econ. Behav. Shuchi Chawla, Lisa Fleischer, Jason D. Hartline, Tim Roughgarden
2015	J	`jnl`	On the Uniqueness of Equilibrium in Atomic Splittable Routing Games. Math. Oper. Res. Umang Bhaskar, Lisa Fleischer, Darrell Hoy, Chien-Chung Huang
2015	J	`jnl`	Optimal Coordination Mechanisms for Unrelated Machine Scheduling. Oper. Res. Yossi Azar, Lisa Fleischer, Kamal Jain, Vahab S. Mirrokni, Zoya Svitkina
2013	A*	`conf`	Online Mixed Packing and Covering. SODA Yossi Azar, Umang Bhaskar, Lisa Fleischer, Debmalya Panigrahi
2012	J	`jnl`	Approximately Optimal Auctions for Selling Privacy when Costs are Correlated with Data CoRR Lisa Fleischer, Yu-Han Lyu
2012	A*	`conf`	Approximately optimal auctions for selling privacy when costs are correlated with data. EC Lisa Fleischer, Yu-Han Lyu
2012	J	`jnl`	Online Mixed Packing and Covering CoRR Umang Bhaskar, Lisa Fleischer
2012	—	`conf`	Simple sybil-proof mechanisms for multi-level marketing. INFOCOM Workshops Fabio Drucker, Lisa Fleischer
2012	A*	`conf`	Simpler sybil-proof mechanisms for multi-level marketing. EC Fabio Drucker, Lisa Fleischer
2012	J	`jnl`	When the Cut Condition is Enough: A Complete Characterization for Multiflow Problems in Series-Parallel Networks CoRR Amit Chakrabarti, Lisa Fleischer, Christophe Weibel
2012	A*	`conf`	When the cut condition is enough: a complete characterization for multiflow problems in series-parallel networks. STOC Amit Chakrabarti, Lisa Fleischer, Christophe Weibel
2011	A*	`conf`	A Stackelberg Strategy for Routing Flow over Time. SODA Umang Bhaskar, Lisa Fleischer, Elliot Anshelevich
2011	J	`jnl`	A competitive strategy for routing flow over time. SIGecom Exch. Umang Bhaskar, Lisa Fleischer, Elliot Anshelevich
2011	J	`jnl`	Lower Bound for Envy-Free and Truthful Makespan Approximation on Related Machines CoRR Lisa Fleischer, Zhenghui Wang
2011	B	`conf`	Lower Bound for Envy-Free and Truthful Makespan Approximation on Related Machines. SAGT Lisa Fleischer, Zhenghui Wang
2011	J	`jnl`	Submodular Approximation: Sampling-based Algorithms and Lower Bounds. SIAM J. Comput. Zoya Svitkina, Lisa Fleischer
2011	J	`jnl`	Tight Approximation Algorithms for Maximum Separable Assignment Problems. Math. Oper. Res. Lisa Fleischer, Michel X. Goemans, Vahab S. Mirrokni, Maxim Sviridenko
2010	J	`jnl`	A Stackelberg Strategy for Routing Flow over Time CoRR Umang Bhaskar, Lisa Fleischer, Elliot Anshelevich
2010	—	`conf`	Data Center Scheduling, Generalized Flows, and Submodularity. ANALCO Lisa Fleischer
2010	J	`jnl`	Discrete Price Updates Yield Fast Convergence in Ongoing Markets with Finite Warehouses CoRR Richard Cole, Lisa Fleischer, Ashish Rastogi
2010	J	`jnl`	Ordering by weighted number of wins gives a good ranking for weighted tournaments. ACM Trans. Algorithms Don Coppersmith, Lisa Fleischer, Atri Rudra
2010	—	`conf`	Preference-constrained Oriented Matching. ANALCO Lisa Fleischer, Zoya Svitkina
2010	J	`jnl`	Strict Cost Sharing Schemes for Steiner Forest. SIAM J. Comput. Lisa Fleischer, Jochen Könemann, Stefano Leonardi, Guido Schäfer
2010	B	`conf`	The Price of Collusion in Series-Parallel Networks. IPCO Umang Bhaskar, Lisa Fleischer, Chien-Chung Huang
2009	A*	`conf`	Equilibria of atomic flow games are not unique. SODA Umang Bhaskar, Lisa Fleischer, Darrell Hoy, Chien-Chung Huang
2008	—	`conf`	A Fast and Simple Algorithm for Computing Market Equilibria. WINE Lisa Fleischer, Rahul Garg, Sanjiv Kapoor, Rohit Khandekar, Amin Saberi
2008	A*	`conf`	Fast-converging tatonnement algorithms for one-time and ongoing market problems. STOC Richard Cole, Lisa Fleischer
2008	B	`conf`	Prompt Mechanisms for Online Auctions. SAGT Richard Cole, Shahar Dobzinski, Lisa Fleischer
2008	A	`conf`	SODA: An Optimizing Scheduler for Large-Scale Stream-Based Distributed Computer Systems. Middleware Joel L. Wolf, Nikhil Bansal, Kirsten Hildrum, Sujay S. Parekh, Deepak Rajan, Rohit Wagle, Kun-Lung Wu, Lisa Fleischer
2008	J	`jnl`	Storage optimization for large-scale distributed stream-processing systems. ACM Trans. Storage Kirsten Hildrum, Fred Douglis, Joel L. Wolf, Philip S. Yu, Lisa Fleischer, Akshay Katta
2008	A*	`conf`	Submodular Approximation: Sampling-based Algorithms and Lower Bounds. FOCS Zoya Svitkina, Lisa Fleischer
2008	J	`jnl`	Submodular approximation: sampling-based algorithms and lower bounds CoRR Zoya Svitkina, Lisa Fleischer
2007	J	`jnl`	Quickest Flows Over Time. SIAM J. Comput. Lisa Fleischer, Martin Skutella
2007	A	`conf`	Storage Optimization for Large-Scale Distributed Stream Processing Systems. IPDPS Kirsten Hildrum, Fred Douglis, Joel L. Wolf, Philip S. Yu, Lisa Fleischer, Akshay Katta
2006	J	`jnl`	Iterative rounding 2-approximation algorithms for minimum-cost vertex connectivity problems. J. Comput. Syst. Sci. Lisa Fleischer, Kamal Jain, David P. Williamson
2006	A*	`conf`	Ordering by weighted number of wins gives a good ranking for weighted tournaments. SODA Don Coppersmith, Lisa Fleischer, Atri Rudra
2006	J	`jnl`	Polynomial-Time Separation of a Superclass of Simple Comb Inequalities. Math. Oper. Res. Lisa Fleischer, Adam N. Letchford, Andrea Lodi
2006	A*	`conf`	Simple cost sharing schemes for multicommodity rent-or-buy and stochastic Steiner tree. STOC Lisa Fleischer, Jochen Könemann, Stefano Leonardi, Guido Schäfer
2006	A*	`conf`	Tight approximation algorithms for maximum general assignment problems. SODA Lisa Fleischer, Michel X. Goemans, Vahab S. Mirrokni, Maxim Sviridenko
2005	J	`jnl`	Efficient Algorithms for Separated Continuous Linear Programs: The Multicommodity Flow Problem with Holding Costs and Extensions. Math. Oper. Res. Lisa Fleischer, Jay Sethuraman
2005	J	`jnl`	Linear tolls suffice: New bounds and algorithms for tolls in single source networks. Theor. Comput. Sci. Lisa Fleischer
2005	J	`jnl`	Ordering by weighted number of wins gives a good ranking for weighted tournaments Electron. Colloquium Comput. Complex. Don Coppersmith, Lisa Fleischer, Atri Rudra
2004	A*	`conf`	A fast approximation scheme for fractional covering problems with variable upper bounds. SODA Lisa Fleischer
2004	A*	`conf`	Further Improvements in Competitive Guarantees for QoS Buffering. ICALP Nikhil Bansal, Lisa Fleischer, Tracy Kimbrel, Mohammad Mahdian, Baruch Schieber, Maxim Sviridenko
2004	A*	`conf`	Linear Tolls Suffice: New Bounds and Algorithms for Tolls in Single Source Networks. ICALP Lisa Fleischer
2004	A*	`conf`	Tolls for Heterogeneous Selfish Users in Multicommodity Networks and Generalized Congestion Games. FOCS Lisa Fleischer, Kamal Jain, Mohammad Mahdian
2003	J	`jnl`	A push-relabel framework for submodular function minimization and applications to parametric optimization. Discret. Appl. Math. Lisa Fleischer, Satoru Iwata
2003	A*	`conf`	Approximately optimal control of fluid networks. SODA Lisa Fleischer, Jay Sethuraman
2003	A*	`conf`	Minimum cost flows over time without intermediate storage. SODA Lisa Fleischer, Martin Skutella
2003	—	`ch.`	Networks and Flows. Handbook of Graph Theory Clifford Stein, Lisa Fleischer, Douglas R. Shier, Prakash Mirchandani, David Simchi-Levi
2002	J	`jnl`	A faster capacity scaling algorithm for minimum cost submodular flow. Math. Program. Lisa Fleischer, Satoru Iwata, S. Thomas McCormick
2002	J	`jnl`	Fast and simple approximation schemes for generalized flow. Math. Program. Lisa Fleischer, Kevin D. Wayne
2002	B	`conf`	The Quickest Multicommodity Flow Problem. IPCO Lisa Fleischer, Martin Skutella
2001	B	`conf`	A 2-Approximation for Minimum Cost {0, 1, 2} Vertex Connectivity. IPCO Lisa Fleischer
2001	J	`jnl`	A combinatorial strongly polynomial algorithm for minimizing submodular functions. J. ACM Satoru Iwata, Lisa Fleischer, Satoru Fujishige
2001	A*	`conf`	An Iterative Rounding 2-Approximation Algorithm for the Element Connectivity Problem. FOCS Lisa Fleischer, Kamal Jain, David P. Williamson
2001	J	`jnl`	Faster Algorithms for the Quickest Transshipment Problem. SIAM J. Optim. Lisa Fleischer
2001	J	`jnl`	Universally maximum flow with piecewise-constant capacities. Networks Lisa Fleischer
2000	A*	`conf`	A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions. STOC Satoru Iwata, Lisa Fleischer, Satoru Fujishige
2000	J	`jnl`	Approximating Fractional Multicommodity Flow Independent of the Number of Commodities. SIAM J. Discret. Math. Lisa Fleischer
2000	A*	`conf`	Improved algorithms for submodular function minimization and submodular flow. STOC Lisa Fleischer, Satoru Iwata
2000	—	`conf`	On Identifying Strongly Connected Components in Parallel. IPDPS Workshops Lisa Fleischer, Bruce Hendrickson, Ali Pinar
2000	J	`jnl`	Optimal Rounding of Instantaneous Fractional Flows Over Time. SIAM J. Discret. Math. Lisa Fleischer, James B. Orlin
2000	A*	`conf`	Strengthening integrality gaps for capacitated network design and covering problems. SODA Robert D. Carr, Lisa Fleischer, Vitus J. Leung, Cynthia A. Phillips
1999	A*	`conf`	Approximating Fractional Multicommodity Flow Independent of the Number of Commodities. FOCS Lisa Fleischer
1999	J	`jnl`	Building Chain and Cactus Representations of All Minimum Cuts from Hao-Orlin in the Same Asymptotic Run Time. J. Algorithms Lisa Fleischer
1999	A*	`conf`	Faster Approximation Algorithms for Generalized Flow. SODA Kevin D. Wayne, Lisa Fleischer
1999	J	`jnl`	Separating Maximally Violated Comb Inequalities in Planar Graphs. Math. Oper. Res. Lisa Fleischer, Éva Tardos
1999	B	`conf`	Universally Maximum Flow with Piecewise-Constant Capacities. IPCO Lisa Fleischer
1998	B	`conf`	Building Chain and Cactus Representations of All Minimum Cuts from Hao-Orlin in the Same Asymptotic Run Time. IPCO Lisa Fleischer
1998	J	`jnl`	Efficient continuous-time dynamic network flow algorithms. Oper. Res. Lett. Lisa Fleischer, Éva Tardos
1998	A*	`conf`	Faster Algorithms for the Quickest Transshipment Problem with Zero Transit Times. SODA Lisa Fleischer
1996	B	`conf`	Separating Maximally Violated Comb Inequalities in Planar Graphs. IPCO Lisa Fleischer, Éva Tardos
1994	B	`conf`	Scheduling Parallelizable Tasks to Minimize Average Response Time. SPAA John Turek, Walter Ludwig, Joel L. Wolf, Lisa Fleischer, Prasoon Tiwari, Jason Glasgow, Uwe Schwiegelshohn, Philip S. Yu