( en | de | ru )

 

Disambiguation of "Fleischer, Lisa"

Author of the publication

copydeleteadd this publication to your clipboard
When the cut condition is enough: a complete characterization for multiflow problems in series-parallel networks.

, , and . STOC, page 19-26. ACM, (2012)

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

Polynomial-Time Separation of a Superclass of Simple Comb Inequalities., , and . Math. Oper. Res., 31 (4): 696-713 (2006)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)Separating Maximally Violated Comb Inequalities in Planar Graphs., and . IPCO, volume 1084 of Lecture Notes in Computer Science, page 475-489. Springer, (1996)A combinatorial strongly polynomial algorithm for minimizing submodular functions., , and . J. ACM, 48 (4): 761-777 (2001)Separating Maximally Violated Comb Inequalities in Planar Graphs., and . Math. Oper. Res., 24 (1): 130-148 (1999)Fast and simple approximation schemes for generalized flow., and . Math. Program., 91 (2): 215-238 (2002)Discrete Price Updates Yield Fast Convergence in Ongoing Markets with Finite Warehouses, , and . CoRR, (2010)A Stackelberg Strategy for Routing Flow over Time, , and . CoRR, (2010)A faster capacity scaling algorithm for minimum cost submodular flow., , and . Math. Program., 92 (1): 119-139 (2002)