Author of the publication

On the Hardness and Approximability of Planar Biconnectivity Augmentation.

, , and . COCOON, volume 5609 of Lecture Notes in Computer Science, page 249-257. Springer, (2009)

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.

 

Other publications of authors with the same name

Improved Steiner tree algorithms for bounded treewidth., , and . J. Discrete Algorithms, (2012)Improved Steiner Tree Algorithms for Bounded Treewidth., , and . IWOCA, volume 7056 of Lecture Notes in Computer Science, page 374-386. Springer, (2011)ILP formulations for the two-stage stochastic Steiner tree problem.. CoRR, (2016)Stochastic Survivable Network Design Problems., , and . Electron. Notes Discret. Math., (2013)On the Hardness and Approximability of Planar Biconnectivity Augmentation., , and . COCOON, volume 5609 of Lecture Notes in Computer Science, page 249-257. Springer, (2009)An Exact Algorithm for the Steiner Forest Problem., , and . ESA, volume 112 of LIPIcs, page 70:1-70:14. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, (2018)Parameterized Algorithms for Stochastic Steiner Tree Problems., , and . MEMICS, volume 7721 of Lecture Notes in Computer Science, page 143-154. Springer, (2012)Solving Two-Stage Stochastic Steiner Tree Problems by Two-Stage Branch-and-Cut., , , , , and . ISAAC (1), volume 6506 of Lecture Notes in Computer Science, page 427-439. Springer, (2010)Planar Biconnectivity Augmentation with Fixed Embedding., , and . IWOCA, volume 5874 of Lecture Notes in Computer Science, page 289-300. Springer, (2009)MIP Formulations for the Steiner Forest Problem., , and . CoRR, (2017)