Author of the publication

Constructing fair round robin tournaments with a minimum number of breaks.

, , and . Oper. Res. Lett., 38 (6): 592-596 (2010)

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.

 

Other publications of authors with the same name

Graph classes and Ramsey numbers., , , , and . Discrete Applied Mathematics, (2014)Characterizing graphs of small carving-width., , , , and . Discrete Applied Mathematics, 161 (13-14): 1888-1893 (2013)Obtaining a Bipartite Graph by Contracting Few Edges., , , and . SIAM J. Discrete Math., 27 (4): 2143-2156 (2013)Minimal dominating sets in graph classes: Combinatorial bounds and enumeration., , , and . Theor. Comput. Sci., (2013)Exploiting structure to cope with NP-hard graph problems : polynomial and exponential time exact algorithms.. Durham University, UK, (2010)British Library, EThOS.Maximal Induced Matchings in Triangle-Free Graphs., , , , and . WG, volume 8747 of Lecture Notes in Computer Science, page 93-104. Springer, (2014)Hadwiger Number of Graphs with Small Chordality., , , and . WG, volume 8747 of Lecture Notes in Computer Science, page 201-213. Springer, (2014)Computing Role Assignments of Proper Interval Graphs in Polynomial Time., , and . IWOCA, volume 6460 of Lecture Notes in Computer Science, page 167-180. Springer, (2010)Minimal Dominating Sets in Graph Classes: Combinatorial Bounds and Enumeration., , , and . SOFSEM, volume 7147 of Lecture Notes in Computer Science, page 202-213. Springer, (2012)Contracting chordal graphs and bipartite graphs to paths and trees., , , and . Electron. Notes Discret. Math., (2011)