PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Haeupler, Bernhard"

Author of the publication

copydeleteadd this publication to your clipboard
Finding a feasible flow in a strongly connected network.

, and . Oper. Res. Lett., 36 (4): 397-398 (2008)

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.

Dr. rer. nat. Bernhard Schulz University of Stuttgart

Bernhard Schopfer University of Stuttgart

Prof. Dr. Bernhard Hauer University of Stuttgart

Hon. -Prof. Dr. Bernhard Scheuble University of Stuttgart

Univ. -Prof. Dr. -Ing. Bernhard Mitschang University of Stuttgart

 

Other publications of authors with the same name

Deterministic Algorithms for the Lovász Local Lemma., , and . SIAM J. Comput., 42 (6): 2132-2155 (2013)Finding a feasible flow in a strongly connected network., and . Oper. Res. Lett., 36 (4): 397-398 (2008)Self-adjusting grid networks to minimize expected path length., , , and . Theor. Comput. Sci., (2015)Tight Bounds on Vertex Connectivity Under Vertex Sampling., , , , and . SODA, page 2006-2018. SIAM, (2015)Bridging the Capacity Gap Between Interactive and One-Way Communication., and . SODA, page 2123-2142. SIAM, (2017)Synchronization Strings: Channel Simulations and Interactive Coding for Insertions and Deletions., , and . ICALP, volume 107 of LIPIcs, page 75:1-75:14. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, (2018)Online Stochastic Weighted Matching: Improved Approximation Algorithms., , and . WINE, volume 7090 of Lecture Notes in Computer Science, page 170-181. Springer, (2011)Incremental Cycle Detection, Topological Ordering, and Strong Component Maintenance., , , , and . ACM Trans. Algorithms, 8 (1): 3:1-3:33 (2012)A Bound on the Throughput of Radio Networks, , and . CoRR, (2013)Tighter Worst-Case Bounds on Algebraic Gossip. CoRR, (2012)