PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Feldmann, Andreas Emil"

Author of the publication

copydeleteadd this publication to your clipboard
Improving the H k -Bound on the Price of Stability in Undirected Shapley Network Design Games.

, , , and . CIAC, volume 7878 of Lecture Notes in Computer Science, page 158-169. Springer, (2013)

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.

Emil Andreas University of Stuttgart

Prof. Dr. Emil Roduner University of Stuttgart

Prof. Dr. Andreas Hotho

Ontology-based Text Document Clustering., , and . KI, 16 (4): 48-54 (2002)
Ontology-based Text Document Clustering., , and . KI, 16 (4): 48-54 (2002)Clustern mit Hintergrundwissen.. Karlsruhe Institute of Technology, (2004)

Junior-Prof. Dr.-Ing. Andreas Pott

Andreas Kaufmann

 

Other publications of authors with the same name

Fast Approximation Algorithms for the Generalized Survivable Network Design Problem., , , and . ISAAC, volume 64 of LIPIcs, page 33:1-33:12. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, (2016)Fixed Parameter Approximations for k-Center Problems in Low Highway Dimension Graphs.. ICALP (2), volume 9135 of Lecture Notes in Computer Science, page 588-600. Springer, (2015)A Tight Lower Bound for Steiner Orientation., and . CSR, volume 10846 of Lecture Notes in Computer Science, page 65-77. Springer, (2018)The Complexity Landscape of Fixed-Parameter Directed Steiner Network Problems., and . CoRR, (2017)An O(n4) Time Algorithm to Compute the Bisection Width of Solid Grid Graphs., and . Algorithmica, 71 (1): 181-200 (2015)Corner cuts are close to optimal: From solid grids to polygons and back., , and . Discrete Applied Mathematics, 161 (7-8): 970-998 (2013)Balanced Partitions of Trees and Applications., and . STACS, volume 14 of LIPIcs, page 100-111. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2012)Improving the Hk-bound on the price of stability in undirected Shapley network design games., , , and . Theor. Comput. Sci., (2015)Computing Approximate Nash Equilibria in Network Congestion Games., , and . SIROCCO, volume 5058 of Lecture Notes in Computer Science, page 209-220. Springer, (2008)Travelling on Graphs with Small Highway Dimension., , , and . WG, volume 11789 of Lecture Notes in Computer Science, page 175-189. Springer, (2019)