( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Approximation Schemes for Minimum 2-Connected Spanning Subgraphs in Weighted Planar Graphs.

, , , и . ESA, том 3669 из Lecture Notes in Computer Science, стр. 472-483. Springer, (2005)

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.

André Berger

André Berger

Ernst-Christian André

Helmut André

Achim André

 

Другие публикации лиц с тем же именем

The k-Constrained Bipartite Matching Problem: Approximation Algorithms and Applications to Wireless Networks., , и . INFOCOM, стр. 2043-2051. IEEE, (2010)Characterizing implementable allocation rules in multi-dimensional environments., , и . Social Choice and Welfare, 48 (2): 367-383 (2017)A PTAS for the Cluster Editing Problem on Planar Graphs., , и . WAOA, том 10138 из Lecture Notes in Computer Science, стр. 27-39. Springer, (2016)Linear Time Algorithms for Generalized Edge Dominating Set Problems., и . Algorithmica, 50 (2): 244-254 (2008)Location, pricing and the problem of Apollonius., , , и . Optim. Lett., 11 (8): 1797-1805 (2017)Approximation Schemes for Minimum 2-Connected Spanning Subgraphs in Weighted Planar Graphs., , , и . ESA, том 3669 из Lecture Notes in Computer Science, стр. 472-483. Springer, (2005)How to Cut a Graph into Many Pieces., , и . TAMC, том 6648 из Lecture Notes in Computer Science, стр. 184-194. Springer, (2011)Path Trading: Fast Algorithms, Smoothed Analysis, and Hardness Results., , и . SEA, том 6630 из Lecture Notes in Computer Science, стр. 43-53. Springer, (2011)Distance- and curvature-constrained shortest paths and an application in mission planning., , и . ACM Southeast Regional Conference, стр. 766-767. ACM, (2006)Erratum to: Linear Time Algorithms for Generalized Edge Dominating Set Problems., и . Algorithmica, 62 (1-2): 633-634 (2012)