Author of the publication

Pricing Network Edges to Cross a River.

, , , , and . WAOA, volume 3351 of Lecture Notes in Computer Science, page 140-153. Springer, (2004)

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.

Alexander Verl

On the Dynamics and Emergency Stop Behavior of Cable-Driven Parallel Robots, , and . ROMANSY 21 - Robot Design, Dynamics and Control, volume 569 of CISM International Centre for Mechanical Sciences, page 431--438. Switzerland, Springer Verlag and Springer International Publishing, (2016)
 

Other publications of authors with the same name

On the minimum corridor connection problem and other generalized geometric problems., , , , , and . Comput. Geom., 42 (9): 939-951 (2009)Location, pricing and the problem of Apollonius., , , and . Optimization Letters, 11 (8): 1797-1805 (2017)A Framework for the Complexity of High-Multiplicity Scheduling Problems., , , and . J. Comb. Optim., 9 (3): 313-323 (2005)Connected Feedback Vertex Set in Planar Graphs., and . WG, volume 5911 of Lecture Notes in Computer Science, page 143-153. (2009)Pricing Network Edges to Cross a River., , , , and . WAOA, volume 3351 of Lecture Notes in Computer Science, page 140-153. Springer, (2004)On the Minimum Corridor Connection Problem and Other Generalized Geometric Problems., , , , , and . WAOA, volume 4368 of Lecture Notes in Computer Science, page 69-82. Springer, (2006)Dispersing Obnoxious Facilities on a Graph., , , and . STACS, volume 126 of LIPIcs, page 33:1-33:11. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, (2019)Optimal bundle pricing for homogeneous items., , , , and . CTW, page 57-60. University of Twente, (2007)Price strategy implementation., , and . Computers & OR, 38 (2): 420-426 (2011)Tree-width and large grid minors in planar graphs.. Discrete Mathematics & Theoretical Computer Science, 13 (1): 13-20 (2011)