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
Weighted coloring on planar, bipartite and split graphs: Complexity and approximation.

, , , , and . Discrete Applied Mathematics, 157 (4): 819-832 (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.

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

Differential approximation of min sat., and . European Journal of Operational Research, 181 (2): 620-633 (2007)Simple and Fast Reoptimizations for the Steiner Tree Problem., , and . Algorithmic Operations Research, 4 (2): 86-94 (2009)Strategic Coloring of a Graph., , and . Internet Mathematics, 8 (4): 424-455 (2012)Probabilistic graph-coloring in bipartite and split graphs., , , , and . J. Comb. Optim., 17 (3): 274-311 (2009)Approximation of the Quadratic Set Covering problem., and . Discrete Optimization, 4 (3-4): 378-386 (2007)Proving completeness by logic., and . Int. J. Comput. Math., 82 (2): 151-161 (2005)Parameterized Power Vertex Cover., , , and . CoRR, (2018)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)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)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)