( en | de | ru )

 

Disambiguation of "Woeginger, Gerhard J."

Author of the publication

copydeleteadd this publication to your clipboard
Partitioning Perfect Graphs into Stars.

, , , , , , and . J. Graph Theory, 85 (2): 297-335 (2017)

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.

Gerhard J Gröbner

Gerhard J Fraune

Heinrich J J Mieschendahl

Norbert J J Bock

J J M Ramakers

 

Other publications of authors with the same name

Getting the Best Response for Your Erg., , and . SWAT, volume 3111 of Lecture Notes in Computer Science, page 14-25. Springer, (2004)Sometimes Travelling is Easy: The Master Tour Problem., , and . ESA, volume 979 of Lecture Notes in Computer Science, page 128-141. Springer, (1995)An Approximation Scheme for Cake Division with a Linear Number of Cuts.. ESA, volume 2461 of Lecture Notes in Computer Science, page 896-901. Springer, (2002)When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)?. INFORMS J. Comput., 12 (1): 57-74 (2000)Bilevel Knapsack with Interdiction Constraints., , , and . INFORMS J. Comput., 28 (2): 319-333 (2016)Robust balanced optimization., , and . EURO J. Comput. Optim., 6 (3): 239-266 (2018)Sometimes Travelling is Easy: The Master Tour Problem., , and . SIAM J. Discret. Math., 11 (1): 81-93 (1998)The Alcuin Number of a Graph and Its Connections to the Vertex Cover Number., , and . SIAM J. Discret. Math., 24 (3): 757-769 (2010)A Study on the Computational Complexity of the Bilevel Knapsack Problem., , , and . SIAM J. Optimization, 24 (2): 823-838 (2014)The geometric maximum traveling salesman problem., , , , , and . J. ACM, 50 (5): 641-664 (2003)