Author of the publication

Domination in Cubic Graphs of Large Girth.

, and . KyotoCGGT, volume 4535 of Lecture Notes in Computer Science, page 186-190. Springer, (2007)

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

Partitioning Into Prescribed Number of Cycles and Mod k T-join With Slack., , , and . LAGOS, volume 195 of Procedia Computer Science, page 12-20. Elsevier, (2021)Non-Interfering Network Flows., , , and . SWAT, volume 621 of Lecture Notes in Computer Science, page 245-257. Springer, (1992)An Improved Algorithm for Finding Tree Decompositions of Small Width., and . WG, volume 1665 of Lecture Notes in Computer Science, page 148-154. Springer, (1999)Polychromatic Hamilton cycles., and . Discret. Math., 118 (1-3): 69-74 (1993)An (almost) Linear Time Algorithm for Odd Cyles Transversal., and . SODA, page 365-378. SIAM, (2010)Approximately covering by cycles in planar graphs., and . SODA, page 402-406. ACM/SIAM, (2001)Hadwiger's conjecture is decidable., and . STOC, page 445-454. ACM, (2009)Odd cycle packing., and . STOC, page 695-704. ACM, (2010)Approximate Min-max Relations for Odd Cycles in Planar Graphs., , , and . IPCO, volume 3509 of Lecture Notes in Computer Science, page 35-50. Springer, (2005)Properly 2-Colouring Linear Hypergraphs., and . APPROX-RANDOM, volume 4627 of Lecture Notes in Computer Science, page 395-408. Springer, (2007)