( en | de | ru )

 

Disambiguation of "Fleischer, Lisa"

Author of the publication

copydeleteadd this publication to your clipboard
A Stackelberg strategy for routing flow over time.

, , and . Games Econ. Behav., (2015)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Gaëlle Lisack

Oleg Lisagor

Hamel Lisa

Jacob Lisakafu

Tautvydas Lisauskas

 

Other publications of authors with the same name

Submodular Approximation: Sampling-based Algorithms and Lower Bounds., and . SIAM J. Comput., 40 (6): 1715-1737 (2011)Strengthening integrality gaps for capacitated network design and covering problems., , , and . SODA, page 106-115. ACM/SIAM, (2000)Ordering by weighted number of wins gives a good ranking for weighted tournaments., , and . SODA, page 776-782. ACM Press, (2006)Separating Maximally Violated Comb Inequalities in Planar Graphs., and . Math. Oper. Res., 24 (1): 130-148 (1999)A faster capacity scaling algorithm for minimum cost submodular flow., , and . Math. Program., 92 (1): 119-139 (2002)Separating Maximally Violated Comb Inequalities in Planar Graphs., and . IPCO, volume 1084 of Lecture Notes in Computer Science, page 475-489. Springer, (1996)Building Chain and Cactus Representations of All Minimum Cuts from Hao-Orlin in the Same Asymptotic Run Time.. IPCO, volume 1412 of Lecture Notes in Computer Science, page 294-309. Springer, (1998)Universally Maximum Flow with Piecewise-Constant Capacities.. IPCO, volume 1610 of Lecture Notes in Computer Science, page 151-165. Springer, (1999)Introduction to the Special Issue - Algorithmic Game Theory - STOC/FOCS/SODA 2011., , , and . Games Econ. Behav., (2015)Fast and simple approximation schemes for generalized flow., and . Math. Program., 91 (2): 215-238 (2002)