( en | de | ru )

 

Disambiguation of "Manoussakis, Yannis"

Author of the publication

copydeleteadd this publication to your clipboard
Proper Hamiltonian cycles in edge-colored multigraphs.

, , , , and . Discret. Math., 340 (8): 1897-1902 (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.

Yannis Bres

Yannis Dimitriadis

Yannis Kalfoglou

Nikolaus Manoussakis

Yannis Metaxas

 

Other publications of authors with the same name

Finding an Antidirected Hamiltonian Path Starting with a Forward Arc from a Given Vertex of a Tournament., , , and . Combinatorics and Computer Science, volume 1120 of Lecture Notes in Computer Science, page 67-73. Springer, (1995)NC Algorithms for Antidirected Hamiltonian Paths and Cycles in Tournaments (Extended Abstract)., , and . WG, volume 903 of Lecture Notes in Computer Science, page 387-394. Springer, (1994)Tropical Paths in Vertex-Colored Graphs., , , , and . COCOA (2), volume 10628 of Lecture Notes in Computer Science, page 291-305. Springer, (2017)On max cut in cubic graphs., , , and . Parallel Algorithms Appl., 17 (3): 165-183 (2002)A Parallel Approximation Algorithm for the Max Cut Problem on Cubic Graphs., , , and . ASIAN, volume 1742 of Lecture Notes in Computer Science, page 27-36. Springer, (1999)Alternating Paths in Edge-colored Complete Graphs.. Discret. Appl. Math., 56 (2-3): 297-309 (1995)On the Complexity of Some Hamiltonian and Eulerian Problems in Edge-Colored Complete Graphs., , , and . ISA, volume 557 of Lecture Notes in Computer Science, page 190-198. Springer, (1991)A Parallel Reduction of Hamiltonian Cycle to Hamiltonian Path in Tournaments., , , and . PARLE, volume 694 of Lecture Notes in Computer Science, page 553-560. Springer, (1993)Maximum Colorful Cliques in Vertex-Colored Graphs., , , and . COCOON, volume 10976 of Lecture Notes in Computer Science, page 480-491. Springer, (2018)Cycles and paths of many lengths in bipartite digraphs., and . J. Comb. Theory B, 50 (2): 254-264 (1990)