Yannis Manoussakis

Follow

Generating author description...

All published works
Action Title Year Authors
+ Properly colored cycles in edge-colored complete graphs 2025 Tianjiao Dai
Hao Li
Yannis Manoussakis
Qiancheng Ouyang
+ Minimum colored Maximum Matchings in vertex-colored Graphs 2024 Johanne Cohen
Yannis Manoussakis
Jonas SĂ©nizergues
+ Further Results on Degree sets for Graphs 2020 Yannis Manoussakis
H.P. Patil
V. Sankar
S. Arumugam
+ PDF Chat On the Number of Vertex-Disjoint Cycles in Digraphs 2019 Yandong Bai
Yannis Manoussakis
+ Maximum colorful independent sets in vertex-colored graphs 2018 Yannis Manoussakis
Hong Phong Pham
+ PDF Chat Tropical dominating sets in vertex-coloured graphs 2018 Jean-Alexandre AnglĂšs d'Auriac
Csilla BujtĂĄs
A. El Maftouhi
MichaƂ KarpiƄski
Yannis Manoussakis
LuĂ­s A. Montero
N. Narayanan
Laurent Rosaz
Johan Thapper
Zs. Tuza
+ Maximum Colorful Cycles in Vertex-Colored Graphs 2018 Giuseppe F. Italiano
Yannis Manoussakis
Nguyễn Kim TháșŻng
Hong Phong Pham
+ On the number of vertex-disjoint cycles in digraphs 2018 Yandong Bai
Yannis Manoussakis
+ Maximum Colorful Cliques in Vertex-Colored Graphs 2018 Giuseppe F. Italiano
Yannis Manoussakis
Nguyen Kim Thang
Hong Phong Pham
+ Trees in Edge-Colored Graphs 2018 Yannis Manoussakis
Valentin Borozan
Rahul Muthu
Wenceslas Fernandez de la Vega
Hong-Phong Pham
+ PDF Chat The complexity of tropical graph homomorphisms 2017 Florent Foucaud
Ararat Harutyunyan
Pavol Hell
Sylvain Legay
Yannis Manoussakis
Reza Naserasr
+ PDF Chat Proper Hamiltonian Paths in Edge-Coloured Multigraphs 2017 Raquel Águeda
Valentin Borozan
Marina Groshaus
Yannis Manoussakis
Gervais Mendy
Leandro Montero
+ Proper Hamiltonian cycles in edge-colored multigraphs 2017 Raquel Águeda
Valentin Borozan
Raquel DĂ­az
Yannis Manoussakis
Leandro Montero
+ PDF Chat Partitioning a Graph into Highly Connected Subgraphs 2015 Valentin Borozan
Michael Ferrara
Shinya Fujita
Michitaka Furuya
Yannis Manoussakis
N. Narayanan
Derrick Stolee
+ Hamiltonian Cycles in Edge-Colored Graphs 2015 Yannis Manoussakis
Raquel DĂ­az
Raquel Águeda
Leandro Montero
+ Proper Hamiltonian Cycles in Edge-Colored Multigraphs 2014 Raquel Águeda
Valentin Borozan
Raquel DĂ­az
Yannis Manoussakis
Leandro Montero
+ PDF Chat Weak Balance in Random Signed Graphs 2014 Yannis Manoussakis
Ararat Harutyunyan
A. El Maftouhi
+ Proper Hamiltonian Paths in Edge-Coloured Multigraphs 2014 Raquel Águeda
Valentin Borozan
Marina Groshaus
Yannis Manoussakis
Gervais Mendy
Leandro Montero
+ Partitioning a graph into highly connected subgraphs 2014 Valentin Borozan
Michael Ferrara
Shinya Fujita
Michitaka Furuya
Yannis Manoussakis
N. Narayanan
Derrick Stolee
+ On degree sets and the minimum orders in bipartite graphs 2014 Yannis Manoussakis
H.P. Patil
+ Proper Hamiltonian Cycles in Edge-Colored Multigraphs 2014 Raquel Águeda
Valentin Borozan
Raquel DĂ­az
Yannis Manoussakis
Leandro Montero
+ Partitioning a graph into highly connected subgraphs 2014 Valentin Borozan
Michael S. Ferrara
Shinya Fujita
Michitaka Furuya
Yannis Manoussakis
N. Narayanan
Derrick Stolee
+ Proper Hamiltonian Paths in Edge-Coloured Multigraphs 2014 Raquel Águeda
Valentin Borozan
Marina Groshaus
Yannis Manoussakis
Gervais Mendy
Leandro Montero
+ PDF Chat Balance in Random Signed Graphs 2012 A. El Maftouhi
Yannis Manoussakis
Olga MĂ©galakaki
+ Sufficient conditions for the existence of spanning colored trees in edge-colored graphs 2012 Raquel Águeda
Valentin Borozan
Yannis Manoussakis
Gervais Mendy
Rahul Muthu
+ Proper connection of graphs 2011 Valentin Borozan
Shinya Fujita
Aydin Gerek
Colton Magnant
Yannis Manoussakis
Leandro Montero
Ćčsolt Tuza
+ Cycles and paths in edge‐colored graphs with given degrees 2009 A. Abouelaoualim
Kinkar Ch. Das
W. Fernandez de la VĂ©ga
Marek KarpiƄski
Yannis Manoussakis
Carlos A. Martinhon
Rachid Saad
+ Longest Cycles in 3-connected Graphs with Given Independence Number 2009 Yannis Manoussakis
+ Links in edge-colored graphs 2009 J.M. Becu
M. Dah
Yannis Manoussakis
Gervais Mendy
+ Bipartite Graphs and their Degree Sets 2003 Yannis Manoussakis
H. P. Patil
+ The number of 2-edge-colored complete graphs with unique hamiltonian alternating cycle 2003 A. Benkouar
Yannis Manoussakis
Rachid Saad
+ Ramsey numbers for tournaments 2001 Yannis Manoussakis
Ćčsolt Tuza
+ PDF Chat Perfect Matching in General vs. Cubic Graphs: A Note on the Planar and Bipartite Cases 2000 Evripidis Bampis
Aristotelis Giannakos
A. V. Karzanov
Yannis Manoussakis
Ioannis Milis
+ Minimal colorings for properly colored subgraphs 1996 Yannis Manoussakis
M. Spyratos
Zs. Tuza
Margit Voigt
+ The forwarding index of directed networks 1996 Yannis Manoussakis
Zsolt Tuza
+ PDF Chat On the parallel complexity of the alternating Hamiltonian cycle problem 1996 Evripidis Bampis
Yannis Manoussakis
Ioannis Milis
+ PDF Chat Hamiltonian problems in edge-colored complete graphs and eulerian cycles in edge-colored graphs : some complexity results 1996 A. Benkouar
Yannis Manoussakis
Vangélis Th. Paschos
Rachid Saad
+ Weakly Hamiltonian-Connected Vertices in Bipartite Tournaments 1995 Jþrgen Bang‐Jensen
Yannis Manoussakis
+ Alternating paths in edge-colored complete graphs 1995 Yannis Manoussakis
+ Packing problems in edge-colored graphs 1994 Pavol Hell
Yannis Manoussakis
Zs. Tuza
+ Hamiltonian paths and cycles, number of arcs and independence number in digraphs 1992 Yannis Manoussakis
Denise Amar
+ Directed hamiltonian graphs 1992 Yannis Manoussakis
+ A polynomial algorithm for hamiltonian-connectedness in semicomplete digraphs 1992 Jþrgen Bang‐Jensen
Yannis Manoussakis
Carsten Thomassen
+ On the complexity of some Hamiltonian and Eulerian problems in edge-colored complete graphs 1991 A. Benkouar
Yannis Manoussakis
Vangélis Th. Paschos
Rachid Saad
+ Cycles and paths of many lengths in bipartite digraphs 1990 Denise Amar
Yannis Manoussakis
+ k-Linked and k-cyclic digraphs 1990 Yannis Manoussakis
+ PDF Chat Directed and antidirected Hamiltonian cycles and paths in bipartite graphs 1989 N. Chakroun
M. Manoussakis
Yannis Manoussakis
+ ProblÚmes extrémaux dans les graphes orientés 1987 Yannis Manoussakis
+ Existence de cycles et chaines dans des graphes orientés ou non en liaison avec des paramÚtres de ces graphes (connexité, stabilité, degré) 1985 Yannis Manoussakis
Common Coauthors
Commonly Cited References
Action Title Year Authors # of times referenced
+ PDF Chat Alternating Hamiltonian cycles 1976 BĂ©la BollobĂĄs
P. ErdƑs
9
+ PDF Chat Hamiltonian problems in edge-colored complete graphs and eulerian cycles in edge-colored graphs : some complexity results 1996 A. Benkouar
Yannis Manoussakis
Vangélis Th. Paschos
Rachid Saad
8
+ None 2006 Jinfeng Feng
Hans‐Erik Giesen
Yubao Guo
Gregory Gutin
Tommy R. Jensen
Arash Rafiey
5
+ Alternating paths in edge-colored complete graphs 1995 Yannis Manoussakis
5
+ PDF Chat Cycles in digraphs– a survey 1981 J.-C. Bermond
Carsten Thomassen
4
+ Packing problems in edge-colored graphs 1994 Pavol Hell
Yannis Manoussakis
Zs. Tuza
4
+ PDF Chat The complexity of tropical graph homomorphisms 2017 Florent Foucaud
Ararat Harutyunyan
Pavol Hell
Sylvain Legay
Yannis Manoussakis
Reza Naserasr
4
+ Edge bounds in nonhamiltonian <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:mi>k</mml:mi></mml:math>-connected graphs 2006 Owen Byer
Deirdre Smeltzer
4
+ PDF Chat Characterization of edge‐colored complete graphs with properly colored Hamilton paths 2006 Jinfeng Feng
Hans‐Erik Giesen
Yubao Guo
Gregory Gutin
Tommy R. Jensen
Arash Rafiey
4
+ Cycles and paths in edge‐colored graphs with given degrees 2009 A. Abouelaoualim
Kinkar Ch. Das
W. Fernandez de la VĂ©ga
Marek KarpiƄski
Yannis Manoussakis
Carlos A. Martinhon
Rachid Saad
3
+ Upper and lower bounds for finding connected motifs in vertex-colored graphs 2010 Michael R. Fellows
Guillaume Fertin
Danny Hermelin
Stéphane Vialette
3
+ A Generalization of the Gallai–Roy Theorem 2001 Hao Li
3
+ None 2010 3
+ PDF Chat Geometrical constraints on Bennett's predictions of chromosome order 1987 Dietmar Dorninger
Werner Timischl
2
+ On the complexity of some Hamiltonian and Eulerian problems in edge-colored complete graphs 1991 A. Benkouar
Yannis Manoussakis
Vangélis Th. Paschos
Rachid Saad
2
+ PDF Chat On the notion of balance of a signed graph. 1953 Frank Harary
2
+ A note on graphs without k-connected subgraphs. 2003 Raphael Yuster
2
+ Proper Hamiltonian Paths in Edge-Coloured Multigraphs 2014 Raquel Águeda
Valentin Borozan
Marina Groshaus
Yannis Manoussakis
Gervais Mendy
Leandro Montero
2
+ PDF Chat Disjoint Directed Cycles 1996 Noga Alon
2
+ Packing directed circuits 1996 Bruce Reed
Neil Robertson
Paul Seymour
Robin Thomas
2
+ PDF Chat On restricted colourings ofK n 1984 MiklĂłs Simonovits
Vera T. SĂłs
2
+ Finding a Longest Alternating Cycle in a 2-edge-coloured Complete Graph is in RP 1996 Rachid Saad
2
+ PDF Chat On the structure of linear graphs 1946 Paul ErdƑs
A. H. Stone
2
+ Long paths and cycles in oriented graphs 1981 Bill Jackson
2
+ Vertex-disjoint directed and undirected cycles in general digraphs 2014 Jþrgen Bang‐Jensen
Matthias Kriesell
Alessandro Maddaloni
Sven Simonsen
2
+ Updating the hamiltonian problem—A survey 1991 Ronald J. Gould
2
+ Decomposition of large uniform hypergraphs 1985 Zbigniew Lonc
MirosƂaw TruszczyƄski
2
+ None 2008 Maria Axenovich
André E. Kézdy
Ryan R. Martin
2
+ Alternating cycles in edge-partitioned graphs 1983 Jerrold W. Grossman
Roland HĂ€ggkvist
2
+ Recent Advances on the Hamiltonian Problem: Survey III 2013 Ronald J. Gould
2
+ None 2008 Anders Johansson
Jeff Kahn
Van Vu
2
+ PDF Chat A Step toward the Bermond–Thomassen Conjecture about Disjoint Cycles in Digraphs 2009 Nicolas Lichiardopol
Attila PĂłr
Jean‐SĂ©bastien Sereni
2
+ Disjoint 3‐Cycles in Tournaments: A Proof of The Bermond–Thomassen Conjecture for Tournaments 2013 Jþrgen Bang‐Jensen
Stéphane Bessy
Stéphan Thomassé
2
+ Decompositions of partially ordered sets into chains and antichains of given size 1988 Yair Caro
Ćčsolt Tuza
2
+ Some Conditions For Digraphs to Be Hamiltonian 1984 Denise Amar
I. Fournier
Anne Germa
2
+ Proof of a Conjecture of Henning and Yeo on Vertex-Disjoint Directed Cycles 2014 Nicolas Lichiardopol
2
+ On digraphs with no two disjoint directed cycles 1987 Carsten Thomassen
2
+ PDF Chat Packing directed circuits exactly 2011 Bertrand Guenin
Robin Thomas
2
+ Conditions for families of disjoint<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" display="inline" overflow="scroll"><mml:mi>k</mml:mi></mml:math>-connected subgraphs in a graph 2013 Michael Ferrara
Colton Magnant
Paul S. Wenger
2
+ PDF Chat Factors and Factorizations of Graphs 2011 Jin Akiyama
Mikio Kanƍ
2
+ Partition of graphs with condition on the connectivity and minimum degree 1983 Peter I. Hajnal
2
+ Extending cycles in graphs 1990 George R. T. Hendry
1
+ The CSP Dichotomy Holds for Digraphs with No Sources and No Sinks (A Positive Answer to a Conjecture of Bang-Jensen and Hell) 2009 Libor Barto
Marcin Kozik
Todd Niven
1
+ PDF Chat Energy Landscape of Social Balance 2009 Seth A. Marvel
Steven H. Strogatz
Jon Kleinberg
1
+ PDF Chat Social balance on networks: The dynamics of friendship and enmity 2006 Tibor Antal
P. L. Krapivsky
S. Redner
1
+ PDF Chat A Dirac Type Condition for Properly Coloured Paths and Cycles 2013 Allan Lo
1
+ Forwarding indices of k-connected graphs 1992 Marie-Claude Heydemann
Jean Meyer
Jaroslav OpatrnĂœ
Dominique Sotteau
1
+ Bipartite Graphs and their Degree Sets 2003 Yannis Manoussakis
H. P. Patil
1
+ On forwarding indices of networks 1989 Marie-Claude Heydemann
Jean Meyer
Dominique Sotteau
1
+ PDF Chat Paths and cycles in tournaments 1986 Andrew Thomason
1