PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Escoffier, Bruno"

Author of the publication

copydeleteadd this publication to your clipboard
Parameterized Power Vertex Cover.

, , , and . WG, volume 9941 of Lecture Notes in Computer Science, page 97-108. (2016)

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.

Univ. -Prof. Piero Bruno University of Stuttgart

Dr. Bruno Gompf University of Stuttgart

Bruno Ohngemach University of Stuttgart

apl. Prof. Dr. -Ing. Bruno Braun University of Stuttgart

 

Other publications of authors with the same name

Strategic Coloring of a Graph., , and . Internet Mathematics, 8 (4): 424-455 (2012)A 0.821-Ratio Purely Combinatorial Algorithm for Maximum k-vertex Cover in Bipartite Graphs., , , and . LATIN, volume 9644 of Lecture Notes in Computer Science, page 235-248. Springer, (2016)Adapting Parallel Algorithms to the W-Stream Model, with Applications to Graph Problems., , , and . MFCS, volume 4708 of Lecture Notes in Computer Science, page 194-205. Springer, (2007)Weighted Coloring: Further Complexity and Approximability Results., , and . ICTCS, volume 3701 of Lecture Notes in Computer Science, page 205-214. Springer, (2005)Differential Approximation of min sat, max sat and Related Problems., and . ICCSA (4), volume 3483 of Lecture Notes in Computer Science, page 192-201. Springer, (2005)Reoptimization of Minimum and Maximum Traveling Salesman's Tours., , , and . SWAT, volume 4059 of Lecture Notes in Computer Science, page 196-207. Springer, (2006)Parameterized Power Vertex Cover., , , and . CoRR, (2018)Designing Budget-Balanced Best-Response Mechanisms for Network Coordination Games., , , and . SAGT, volume 8146 of Lecture Notes in Computer Science, page 207-218. Springer, (2013)Weighted Coloring on Planar, Bipartite and Split Graphs: Complexity and Improved Approximation., , , , and . ISAAC, volume 3341 of Lecture Notes in Computer Science, page 896-907. Springer, (2004)Proving completeness by logic., and . Int. J. Comput. Math., 82 (2): 151-161 (2005)