( en | de | ru )

 

Disambiguation

From post

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

, и . ICALP, том 4596 из Lecture Notes in Computer Science, стр. 90-101. Springer, (2007)

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)Approximation Schemes for Minimum 2-Connected Spanning Subgraphs in Weighted Planar Graphs., , , и . ESA, том 3669 из Lecture Notes in Computer Science, стр. 472-483. Springer, (2005)Location, pricing and the problem of Apollonius., , , и . Optim. Lett., 11 (8): 1797-1805 (2017)Erratum to: Linear Time Algorithms for Generalized Edge Dominating Set Problems., и . Algorithmica, 62 (1-2): 633-634 (2012)Linear Time Algorithms for Generalized Edge Dominating Set Problems., и . WADS, том 3608 из Lecture Notes in Computer Science, стр. 233-243. Springer, (2005)A time- and space-optimal algorithm for the many-visits TSP., , , и . SODA, стр. 1770-1782. SIAM, (2019)Internet routing between autonomous systems: Fast algorithms for path trading., , и . Discret. Appl. Math., (2015)