Y. Manoussakis

Most-cited papers

Proper connection of graphs
V. Borozan, S. Fujita, Aydın Gerek, C. Magnant +3 more
2012Discrete Mathematics136 citations Open access
Semantic Scholar
An asymptotic version of a conjecture by Enomoto and Ota
A. Abouelaoualim, K. Das, W. Fernandez de la Véga, M. Karpinski +3 more
201057 citations
Semantic Scholar
Paths and trails in edge-colored graphs
A. Abouelaoualim, K. Das, L. Faria, Y. Manoussakis +2 more
2008Theoretical Computer Science52 citations Open access
Semantic Scholar
Paths through fixed vertices in edge-colored graphs
Wun-Seng Chou, Y. Manoussakis, O. Megalakaki, M. Spyratos +1 more
199351 citations
Semantic Scholar
Minimal colorings for properly colored subgraphs
Y. Manoussakis, M. Spyratos, Z. Tuza, M. Voigt
1996Graphs Comb.43 citations
Semantic Scholar
Alternating Paths in Edge-colored Complete Graphs
Y. Manoussakis
1995Discrete Applied Mathematics39 citations Open access
Semantic Scholar
Cycles and paths of many lengths in bipartite digraphs
D. Amar, Y. Manoussakis
1990J. Comb. Theory B35 citations Open access
Semantic Scholar
On the Complexity of Some Hamiltonian and Eulerian Problems in Edge-Colored Complete Graphs
A. Benkouar, Y. Manoussakis, V. Paschos, R. Saad
1991International Symposium on Algorithms34 citations Open access
Semantic Scholar
Directed hamiltonian graphs
Y. Manoussakis
1992Journal of Graph Theory29 citations
Semantic Scholar
The Forwarding Index of Directed Networks
Y. Manoussakis, Z. Tuza
1996Discrete Applied Mathematics28 citations Open access
Semantic Scholar
A Polynomial Algorithm for Hamiltonian-Connectedness in Semicomplete Digraphs
J. Bang-Jensen, Y. Manoussakis, C. Thomassen
1992J. Algorithms28 citations
Semantic Scholar
Cycles and paths in edge‐colored graphs with given degrees
A. Abouelaoualim, K. Das, W. Fernandez de la Véga, M. Karpinski +3 more
2010Journal of Graph Theory26 citations Open access
Semantic Scholar
Hamiltonian problems in edge-colored complete graphs and Eulerian cycles in edge-colored graphs: some complexity results
A. Benkouar, Y. Manoussakis, V. Paschos, R. Saad
199625 citations Open access
Semantic Scholar
A linear-time algorithm for finding Hamiltonian cycles in tournaments
Y. Manoussakis
1992Discrete Applied Mathematics24 citations Open access
Semantic Scholar
Safe sets in graphs: Graph classes and structural parameters
Raquel Águeda, N. Cohen, S. Fujita, Sylvain Legay +9 more
2016Journal of combinatorial optimization23 citations Open access
Semantic Scholar
Polynomial Algorithms for Finding Cycles and Paths in Bipartite Tournaments
Y. Manoussakis, Z. Tuza
1990SIAM Journal on Discrete Mathematics20 citations
Semantic Scholar
Weakly Hamiltonian-Connected Vertices in Bipartite Tournaments
J. Bang-Jensen, Y. Manoussakis
1995J. Comb. Theory B17 citations Open access
Semantic Scholar
The Forwarding Index of Communication Networks with Given Connectivity
W. F. de la Vega, Y. Manoussakis
1992Discrete Applied Mathematics17 citations Open access
Semantic Scholar
Tropical Dominating Sets in Vertex-Coloured Graphs
Jean-Alexandre Anglès d'Auriac, Csilla Bujtás, A. El Maftouhi, M. Karpinski +6 more
2015Workshop on Algorithms and Computation14 citations Open access
Semantic Scholar
Balance in Random Signed Graphs
A. El Maftouhi, Y. Manoussakis, O. Megalakaki
2012Internet Mathematics14 citations Open access
Semantic Scholar
Connected Tropical Subgraphs in Vertex-Colored Graphs
J. A. d'Auriac, N. Cohen, Hakim El Mafthoui, Ararat Harutyunyan +2 more
2016Discrete Mathematics & Theoretical Computer Science13 citations Open access
Semantic Scholar
Safe sets, network majority on weighted trees
R. Bapat, S. Fujita, Sylvain Legay, Y. Manoussakis +3 more
2018Networks12 citations Open access
Semantic Scholar
Tropical paths in vertex-colored graphs
Johanne Cohen, G. Italiano, Y. Manoussakis, Thang Nguyen +1 more
2017Journal of combinatorial optimization12 citations
Semantic Scholar
Network Majority on Tree Topological Network
R. Bapat, S. Fujita, Sylvain Legay, Y. Manoussakis +3 more
2016Electron. Notes Discret. Math.12 citations
Semantic Scholar
Cycles of given color patterns
Y. Manoussakis, Michael Spyratos, Z. Tuza
1996Journal of Graph Theory12 citations
Semantic Scholar
Maximum colored trees in edge-colored graphs
V. Borozan, W. Fernandez de la Véga, Y. Manoussakis, C. Martinhon +3 more
2019European journal of combinatorics (Print)11 citations Open access
Semantic Scholar
Tropical matchings in vertex-colored graphs
Johanne Cohen, Y. Manoussakis, H. Pham, Z. Tuza
2017Electron. Notes Discret. Math.11 citations
Semantic Scholar
k-Linked and k-cyclic digraphs
Y. Manoussakis
1990J. Comb. Theory B10 citations Open access
Semantic Scholar
On the Number of Vertex-Disjoint Cycles in Digraphs
Yandong Bai, Y. Manoussakis
2018SIAM Journal on Discrete Mathematics9 citations Open access
Semantic Scholar
The complexity of tropical graph homomorphisms
F. Foucaud, Ararat Harutyunyan, P. Hell, Sylvain Legay +2 more
2016Discrete Applied Mathematics9 citations Open access
Semantic Scholar
Packing Problems in Edge-colored Graphs
P. Hell, Y. Manoussakis, Z. Tuza
1994Discrete Applied Mathematics9 citations Open access
Semantic Scholar
Partitioning a Graph into Highly Connected Subgraphs
V. Borozan, M. Ferrara, S. Fujita, Michitaka Furuya +3 more
2014Journal of Graph Theory8 citations
Semantic Scholar
Cycles throughk vertices in bipartite tournaments
J. Bang-Jensen, Y. Manoussakis
1994Comb.8 citations
Semantic Scholar
Links in edge-colored graphs
J. Bécu, M. Dah, Y. Manoussakis, Gervais Mendy
2010European journal of combinatorics (Print)7 citations Open access
Semantic Scholar
A sufficient condition for maximum cycles in bipartite digraphs
Y. Manoussakis, I. Milis
1999Discrete Mathematics7 citations Open access
Semantic Scholar
The number of 2-edge-colored complete graphs with unique hamiltonian alternating cycle
A. Benkouar, Y. Manoussakis, R. Saad
2003Discrete Mathematics6 citations Open access
Semantic Scholar
A comparison of heuristics for scheduling multiprocessor tasks on three dedicated processors
A. Amoura, E. Bampis, Y. Manoussakis, Z. Tuza
1999Parallel Computing6 citations
Semantic Scholar
Finding an Antidirected Hamiltonian Path Starting with a Forward Arc from a Given Vertex of a Tournament
E. Bampis, P. Hell, Y. Manoussakis, M. Rosenfeld
1995Conference on Computer and Communications Security6 citations
Semantic Scholar
Directed and antidirected Hamiltonian cycles and paths in bipartite graphs
N. Chakroun, M. Manoussakis, Y. Manoussakis
19896 citations Open access
Semantic Scholar
Grids in Random Graphs
W. F. de la Vega, Y. Manoussakis
1994Random Struct. Algorithms5 citations
Semantic Scholar
Computation of the forwarding index via flows: A note
W. Fernandez de le Vega, Y. Manoussakis
1994Networks5 citations
Semantic Scholar
A Parallel Reduction of Hamiltonian Cycle to Hamiltonian Path in Tournaments
E. Bampis, Mohamed Yacine El Haddad, Y. Manoussakis, M. Santha
1993J. Algorithms5 citations
Semantic Scholar
Longest Cycles in 3-connected Graphs with Given Independence Number
Y. Manoussakis
2009Graphs Comb.4 citations
Semantic Scholar
Ramsey numbers for tournaments
Y. Manoussakis, Z. Tuza
2001Theoretical Computer Science4 citations Open access
Semantic Scholar
Optimal routings in communication networks with linearly bounded forwarding index
Y. Manoussakis, Z. Tuza
1996Networks4 citations
Semantic Scholar
Maximum Colorful Cliques in Vertex-Colored Graphs
G. Italiano, Y. Manoussakis, Thang Nguyen, H. Pham
2018International Computing and Combinatorics Conference3 citations
Semantic Scholar
Proper Hamiltonian cycles in edge-colored multigraphs
Raquel Águeda, V. Borozan, R. Díaz, Y. Manoussakis +1 more
2014Discrete Mathematics3 citations Open access
Semantic Scholar
Upper bounds for the forwarding indices of communication networks
Mohamed Yacine El Haddad, Y. Manoussakis, R. Saad
2004Discrete Mathematics3 citations Open access
Semantic Scholar
NC Algorithms for Antidirected Hamiltonian Paths and Cycles in Tournaments (Extended Abstract)
E. Bampis, Y. Manoussakis, I. Milis
1994International Workshop on Graph-Theoretic Concepts in Computer Science3 citations
Semantic Scholar
The number of bipartite tournaments with a unique given factor
Manoussakis Manolis, Y. Manoussakis
1989Journal of Graph Theory3 citations
Semantic Scholar