Lisa Fleischer

	2012
62		Fabio Drucker, Lisa Fleischer: Simple sybil-proof mechanisms for multi-level marketing. INFOCOM Workshops 2012: 163
61		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
60		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)
59		Umang Bhaskar, Lisa Fleischer: Online Mixed Packing and Covering CoRR abs/1203.6695: (2012)
58		Lisa Fleischer, Yu-Han Lyu: Approximately Optimal Auctions for Selling Privacy when Costs are Correlated with Data CoRR abs/1204.4031: (2012)
	2011
57		Lisa Fleischer, Zhenghui Wang: Lower Bound for Envy-Free and Truthful Makespan Approximation on Related Machines. SAGT 2011: 166-177
56		Umang Bhaskar, Lisa Fleischer, Elliot Anshelevich: A Stackelberg Strategy for Routing Flow over Time. SODA 2011: 192-201
55		Lisa Fleischer, Zhenghui Wang: Lower Bound for Envy-Free and Truthful Makespan Approximation on Related Machines CoRR abs/1107.2957: (2011)
54		Zoya Svitkina, Lisa Fleischer: Submodular Approximation: Sampling-based Algorithms and Lower Bounds. SIAM J. Comput. 40(6): 1715-1737 (2011)
53		Umang Bhaskar, Lisa Fleischer, Elliot Anshelevich: A competitive strategy for routing flow over time. SIGecom Exchanges 10(2): 23-28 (2011)
	2010
52		Umang Bhaskar, Lisa Fleischer, Chien-Chung Huang: The Price of Collusion in Series-Parallel Networks. IPCO 2010: 313-326
51		Don Coppersmith, Lisa Fleischer, Atri Rudra: Ordering by weighted number of wins gives a good ranking for weighted tournaments. ACM Transactions on Algorithms 6(3): (2010)
50		Umang Bhaskar, Lisa Fleischer, Elliot Anshelevich: A Stackelberg Strategy for Routing Flow over Time CoRR abs/1010.3034: (2010)
49		Richard Cole, Lisa Fleischer, Ashish Rastogi: Discrete Price Updates Yield Fast Convergence in Ongoing Markets with Finite Warehouses CoRR abs/1012.2124: (2010)
48		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)
	2009
47		Umang Bhaskar, Lisa Fleischer, Darrell Hoy, Chien-Chung Huang: Equilibria of atomic flow games are not unique. SODA 2009: 748-757
	2008
46		Zoya Svitkina, Lisa Fleischer: Submodular Approximation: Sampling-based Algorithms and Lower Bounds. FOCS 2008: 697-706
45		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
44		Richard Cole, Shahar Dobzinski, Lisa Fleischer: Prompt Mechanisms for Online Auctions. SAGT 2008: 170-181
43		Richard Cole, Lisa Fleischer: Fast-converging tatonnement algorithms for one-time and ongoing market problems. STOC 2008: 315-324
42		Lisa Fleischer, Rahul Garg, Sanjiv Kapoor, Rohit Khandekar, Amin Saberi: A Fast and Simple Algorithm for Computing Market Equilibria. WINE 2008: 19-30
41		Zoya Svitkina, Lisa Fleischer: Submodular approximation: sampling-based algorithms and lower bounds CoRR abs/0805.1071: (2008)
40		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
39		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
38		Lisa Fleischer, Martin Skutella: Quickest Flows Over Time. SIAM J. Comput. 36(6): 1600-1630 (2007)
	2006
37		Lisa Fleischer, Michel X. Goemans, Vahab S. Mirrokni, Maxim Sviridenko: Tight approximation algorithms for maximum general assignment problems. SODA 2006: 611-620
36		Don Coppersmith, Lisa Fleischer, Atri Rudra: Ordering by weighted number of wins gives a good ranking for weighted tournaments. SODA 2006: 776-782
35		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
34		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)
33		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
32		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)
31		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)
30		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
29		Lisa Fleischer, Kamal Jain, Mohammad Mahdian: Tolls for Heterogeneous Selfish Users in Multicommodity Networks and Generalized Congestion Games. FOCS 2004: 277-285
28		Nikhil Bansal, Lisa Fleischer, Tracy Kimbrel, Mohammad Mahdian, Baruch Schieber, Maxim Sviridenko: Further Improvements in Competitive Guarantees for QoS Buffering. ICALP 2004: 196-207
27		Lisa Fleischer: Linear Tolls Suffice: New Bounds and Algorithms for Tolls in Single Source Networks. ICALP 2004: 544-554
26		Lisa Fleischer: A fast approximation scheme for fractional covering problems with variable upper bounds. SODA 2004: 1001-1010
	2003
25		Lisa Fleischer, Jay Sethuraman: Approximately optimal control of fluid networks. SODA 2003: 56-65
24		Lisa Fleischer, Martin Skutella: Minimum cost flows over time without intermediate storage. SODA 2003: 66-75
23		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
22		Lisa Fleischer, Martin Skutella: The Quickest Multicommodity Flow Problem. IPCO 2002: 36-53
21		Lisa Fleischer, Satoru Iwata, S. Thomas McCormick: A faster capacity scaling algorithm for minimum cost submodular flow. Math. Program. 92(1): 119-139 (2002)
	2001
20		Lisa Fleischer, Kamal Jain, David P. Williamson: An Iterative Rounding 2-Approximation Algorithm for the Element Connectivity Problem. FOCS 2001: 339-347
19		Lisa Fleischer: A 2-Approximation for Minimum Cost {0, 1, 2} Vertex Connectivity. IPCO 2001: 115-129
18		Satoru Iwata, Lisa Fleischer, Satoru Fujishige: A combinatorial strongly polynomial algorithm for minimizing submodular functions. J. ACM 48(4): 761-777 (2001)
17		Lisa Fleischer: Universally maximum flow with piecewise-constant capacities. Networks 38(3): 115-125 (2001)
16		Lisa Fleischer: Faster Algorithms for the Quickest Transshipment Problem. SIAM Journal on Optimization 12(1): 18-35 (2001)
	2000
15		Lisa Fleischer, Bruce Hendrickson, Ali Pinar: On Identifying Strongly Connected Components in Parallel. IPDPS Workshops 2000: 505-511
14		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		Lisa Fleischer, Satoru Iwata: Improved algorithms for submodular function minimization and submodular flow. STOC 2000: 107-116
12		Satoru Iwata, Lisa Fleischer, Satoru Fujishige: A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions. STOC 2000: 97-106
11		Lisa Fleischer, James B. Orlin: Optimal Rounding of Instantaneous Fractional Flows Over Time. SIAM J. Discrete Math. 13(2): 145-153 (2000)
10		Lisa Fleischer: Approximating Fractional Multicommodity Flow Independent of the Number of Commodities. SIAM J. Discrete Math. 13(4): 505-520 (2000)
	1999
9		Lisa Fleischer: Approximating Fractional Multicommodity Flow Independent of the Number of Commodities. FOCS 1999: 24-31
8		Lisa Fleischer: Universally Maximum Flow with Piecewise-Constant Capacities. IPCO 1999: 151-165
7		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		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		Lisa Fleischer, Éva Tardos: Efficient continuous-time dynamic network flow algorithms. Oper. Res. Lett. 23(3-5): 71-80 (1998)
	1996
2		Lisa Fleischer, Éva Tardos: Separating Maximally Violated Comb Inequalities in Planar Graphs. IPCO 1996: 475-489
	1994
1		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

1	Elliot Anshelevich	[50] [53] [56]
2	Nikhil Bansal	[28] [45]
3	Umang Bhaskar	[47] [50] [52] [53] [56] [59]
4	Robert D. Carr	[14]
5	Amit Chakrabarti	[60] [61]
6	Richard Cole	[43] [44] [49]
7	Don Coppersmith	[32] [36] [51]
8	Shahar Dobzinski	[44]
9	Fred Douglis	[39] [40]
10	Fabio Drucker	[62]
11	Satoru Fujishige	[12] [18]
12	Rahul Garg	[42]
13	Jason Glasgow	[1]
14	Michel X. Goemans	[37]
15	Bruce Hendrickson	[15]
16	Kirsten Hildrum (Kris Hildrum)	[39] [40] [45]
17	Darrell Hoy	[47]
18	Chien-Chung Huang	[47] [52]
19	Satoru Iwata	[12] [13] [18] [21] [23]
20	Kamal Jain	[20] [29] [34]
21	Sanjiv Kapoor	[42]
22	Akshay Katta	[39] [40]
23	Rohit Khandekar	[42]
24	Tracy Kimbrel	[28]
25	Jochen Könemann	[35] [48]
26	Stefano Leonardi	[35] [48]
27	Adam N. Letchford	[33]
28	Vitus J. Leung	[14]
29	Andrea Lodi	[33]
30	Walter Ludwig	[1]
31	Yu-Han Lyu	[58]
32	Mohammad Mahdian	[28] [29]
33	S. Thomas McCormick	[21]
34	Vahab S. Mirrokni (Seyed Vahab Mirrokni)	[37]
35	James B. Orlin	[11]
36	Sujay Parekh	[45]
37	Cynthia A. Phillips	[14]
38	Ali Pinar	[15]
39	Deepak Rajan	[45]
40	Ashish Rastogi	[49]
41	Atri Rudra	[32] [36] [51]
42	Amin Saberi	[42]
43	Guido Schäfer	[35] [48]
44	Baruch Schieber	[28]
45	Uwe Schwiegelshohn	[1]
46	Jay Sethuraman	[25] [31]
47	Martin Skutella	[22] [24] [38]
48	Maxim Sviridenko	[28] [37]
49	Zoya Svitkina	[41] [46] [54]
50	Éva Tardos	[2] [3]
51	Prasoon Tiwari	[1]
52	John Turek	[1]
53	Rohit Wagle	[45]
54	Zhenghui Wang	[55] [57]
55	Kevin D. Wayne	[7]
56	Christophe Weibel	[60] [61]
57	David P. Williamson	[20] [34]
58	Joel L. Wolf	[1] [39] [40] [45]
59	Kun-Lung Wu	[45]
60	Philip S. Yu	[1] [39] [40]

Colors in the list of coauthors

Last update Wed May 30 22:34:44 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page