Get started
Author

Yannis Manoussakis

Proper connection of graphs
2011 · Valentin Borozan, Shinya Fujita, et al. · Discrete Mathematics · 119
PDF
Scheduling independent multiprocessor tasks
1997 · A. K. Amoura, E. Bampis, et al. · Lecture notes in computer science · 72
Cycles and paths in bipartite tournaments with spanning configurations
1989 · R. Häggkvist, Y. Manoussakis · COMBINATORICA · 56
Paths and trails in edge-colored graphs
2008 · A. Abouelaoualim, K.Ch. Das, et al. · Theoretical Computer Science · 46
PDF
Paths through fixed vertices in edge-colored graphs
1994 · Wanxi Chou, Yannis Manoussakis, et al. · SZTAKI Publication Repository (Hungarian Academy of Sciences) · 44
Minimal colorings for properly colored subgraphs
1996 · Y. Manoussakis, M. Spyratos, et al. · Graphs and Combinatorics · 38
Alternating paths in edge-colored complete graphs
1995 · Y. Manoussakis · Discrete Applied Mathematics · 33
PDF
Cycles and paths of many lengths in bipartite digraphs
1990 · Denise Amar, Yannis Manoussakis · Journal of Combinatorial Theory Series B · 31
Hamiltonian problems in edge-colored complete graphs and eulerian cycles in edge-colored graphs : some complexity results
1996 · A. Benkouar, Y. Manoussakis, et al. · RAIRO - Operations Research · 27
PDF
Directed hamiltonian graphs
1992 · Yannis Manoussakis · Journal of Graph Theory · 27
Cycles and paths in edge‐colored graphs with given degrees
2009 · A. Abouelaoualim,, K. Ch. Das, et al. · Journal of Graph Theory · 25
The forwarding index of directed networks
1996 · Yannis Manoussakis, Zsolt Tuza · Discrete Applied Mathematics · 24
PDF
A linear-time algorithm for finding Hamiltonian cycles in tournaments
1992 · Y. Manoussakis · Discrete Applied Mathematics · 23
PDF
Safe sets in graphs: Graph classes and structural parameters
2017 · Raquel Águeda, Nathann Cohen, et al. · Journal of Combinatorial Optimization · 21
A polynomial algorithm for hamiltonian-connectedness in semicomplete digraphs
1992 · Jørgen Bang-Jensen, Yannis Manoussakis, et al. · Journal of Algorithms · 21
On the complexity of some Hamiltonian and Eulerian problems in edge-colored complete graphs: Extended abstract
1991 · A. Benkouar, Y. G. Manoussakis, et al. · Lecture notes in computer science · 19
Safe sets, network majority on weighted trees
2017 · Ravindra B. Bapat, Shinya Fujita, et al. · Networks · 16
Safe Sets in Graphs: Graph Classes and Structural Parameters
2016 · Raquel Águeda, Nathann Cohen, et al. · Lecture notes in computer science · 16
The forwarding index of communication networks with given connectivity
1992 · W.Fernandez de la Vega, Y. Manoussakis · Discrete Applied Mathematics · 16
Polynomial Algorithms for Finding Cycles and Paths in Bipartite Tournaments
1990 · Y. Manoussakis, Z. Tuza · SIAM Journal on Discrete Mathematics · 16
Tropical matchings in vertex-colored graphs
2017 · J. Cohen, Y. Manoussakis, et al. · Electronic Notes in Discrete Mathematics · 15
Tropical paths in vertex-colored graphs
2019 · Johanne Cohen, Giuseppe F. Italiano, et al. · Journal of Combinatorial Optimization · 13
Tropical dominating sets in vertex-coloured graphs
2018 · J.-A. Anglès d'Auriac, Cs. Bujtás, et al. · Journal of Discrete Algorithms · 12
PDF
Network Majority on Tree Topological Network
2016 · Ravindra B. Bapat, Shinya Fujita, et al. · Electronic Notes in Discrete Mathematics · 12
Connected Tropical Subgraphs in Vertex-Colored Graphs
2016 · Jean-Alexandre Anglès d'Auriac, Nathann Cohen, et al. · Discrete Mathematics & Theoretical Computer Science · 12
PDF
Works count: 98
Citation count: 1,009
H-index: 16
I10-index: 33
Year
Topic
Type