PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Bourgeois, Nicolas"

Author of the publication

copydeleteadd this publication to your clipboard
Approximating the Max Edge-Coloring Problem.

, , , and . IWOCA, volume 5874 of Lecture Notes in Computer Science, page 83-94. Springer, (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.

Nicolas Dumerat University of Stuttgart

Nicolas Möbs University of Stuttgart

Nicolas Huber University of Stuttgart

Nicolas Kroneberg University of Stuttgart

Nicolas Schneider University of Stuttgart

 

Other publications of authors with the same name

Probabilistic graph-coloring in bipartite and split graphs., , , , and . J. Comb. Optim., 17 (3): 274-311 (2009)Approximating the max-edge-coloring problem., , , and . Theor. Comput. Sci., 411 (34-36): 3055-3067 (2010)Approximation of max independent set, min vertex cover and related problems by moderately exponential algorithms., , and . Discrete Applied Mathematics, 159 (17): 1954-1970 (2011)Exponential approximation schemata for some network design problems., , , and . J. Discrete Algorithms, (2013)Average-case complexity of a branch-and-bound algorithm for maximum independent set, under the $G(n, p)$ random model., , , and . CoRR, (2015)Fast algorithms for min independent dominating set, , and . CoRR, (2009)The max quasi-independent set problem., , , , , and . J. Comb. Optim., 23 (1): 94-117 (2012)A Bottom-Up Method and Fast Algorithms for max independent set., , , and . SWAT, volume 6139 of Lecture Notes in Computer Science, page 62-73. Springer, (2010)Fast Algorithms for min independent dominating set., , and . SIROCCO, volume 6058 of Lecture Notes in Computer Science, page 247-261. Springer, (2010)Exact Algorithms for Dominating Clique Problems., , , and . ISAAC, volume 5878 of Lecture Notes in Computer Science, page 4-13. Springer, (2009)