Yannis Manoussakis

81 papers A 1B 3C 2Misc 2Journal 66Unranked 6
YearRankTypeTitle / Venue / Authors
2025 J jnl
Properly colored cycles in edge-colored complete graphs.
Discret. Math.
Tianjiao Dai, Hao Li, Yannis Manoussakis, Qiancheng Ouyang
2021 J jnl
Tropical paths in vertex-colored graphs.
J. Comb. Optim.
Johanne Cohen, Giuseppe F. Italiano, Yannis Manoussakis, Kim Thang Nguyen, Hong Phong Pham
2019 J jnl
Maximum colored trees in edge-colored graphs.
Eur. J. Comb.
Valentin Borozan, Wenceslas Fernandez de la Vega, Yannis Manoussakis, Carlos A. J. Martinhon, Rahul Muthu, Hong Phong Pham, Rachid Saad
2019 J jnl
On the Number of Vertex-Disjoint Cycles in Digraphs.
SIAM J. Discret. Math.
Yandong Bai, Yannis Manoussakis
2018 Misc conf
Maximum Colorful Cliques in Vertex-Colored Graphs.
COCOON
Giuseppe F. Italiano, Yannis Manoussakis, Kim Thang Nguyen, Hong Phong Pham
2018 Misc conf
Maximum Colorful Cycles in Vertex-Colored Graphs.
CSR
Giuseppe F. Italiano, Yannis Manoussakis, Kim Thang Nguyen, Hong Phong Pham
2018 J jnl
Maximum colorful independent sets in vertex-colored graphs.
Electron. Notes Discret. Math.
Yannis Manoussakis, Hong Phong Pham
2018 J jnl
Safe sets in graphs: Graph classes and structural parameters.
J. Comb. Optim.
Raquel Águeda, Nathann Cohen, Shinya Fujita, Sylvain Legay, Yannis Manoussakis, Yasuko Matsui, Leandro Montero, Reza Naserasr, Hirotaka Ono, Yota Otachi, Tadashi Sakuma, Zsolt Tuza, Renyu Xu
2018 J jnl
Safe sets, network majority on weighted trees.
Networks
Ravindra B. Bapat, Shinya Fujita, Sylvain Legay, Yannis Manoussakis, Yasuko Matsui, Tadashi Sakuma, Zsolt Tuza
2018 J jnl
Tropical dominating sets in vertex-coloured graphs.
J. Discrete Algorithms
Jean-Alexandre Anglès d'Auriac, Csilla Bujtás, Abdelhakim El Maftouhi, Marek Karpinski, Yannis Manoussakis, Leandro Montero, N. Narayanan, Laurent Rosaz, Johan Thapper, Zsolt Tuza
2017 J jnl
Proper Hamiltonian Paths in Edge-Coloured Multigraphs.
Graphs Comb.
Raquel Águeda, Valentin Borozan, Marina Groshaus, Yannis Manoussakis, Gervais Mendy, Leandro Montero
2017 J jnl
Proper Hamiltonian cycles in edge-colored multigraphs.
Discret. Math.
Raquel Águeda, Valentin Borozan, Raquel Díaz, Yannis Manoussakis, Leandro Montero
2017 J jnl
The complexity of tropical graph homomorphisms.
Discret. Appl. Math.
Florent Foucaud, Ararat Harutyunyan, Pavol Hell, Sylvain Legay, Yannis Manoussakis, Reza Naserasr
2017 — conf
Tropical Paths in Vertex-Colored Graphs.
COCOA (2)
Johanne Cohen, Giuseppe F. Italiano, Yannis Manoussakis, Kim Thang Nguyen, Hong Phong Pham
2017 J jnl
Tropical matchings in vertex-colored graphs.
Electron. Notes Discret. Math.
Johanne Cohen, Yannis Manoussakis, Hong Phong Pham, Zsolt Tuza
2016 J jnl
Connected Tropical Subgraphs in Vertex-Colored Graphs.
Discret. Math. Theor. Comput. Sci.
Jean-Alexandre Anglès d'Auriac, Nathann Cohen, Hakim El Mafthoui, Ararat Harutyunyan, Sylvain Legay, Yannis Manoussakis
2016 J jnl
Network Majority on Tree Topological Network.
Electron. Notes Discret. Math.
Ravindra B. Bapat, Shinya Fujita, Sylvain Legay, Yannis Manoussakis, Yasuko Matsui, Tadashi Sakuma, Zsolt Tuza
2016 J jnl
Partitioning a Graph into Highly Connected Subgraphs.
J. Graph Theory
Valentin Borozan, Michael Ferrara, Shinya Fujita, Michitaka Furuya, Yannis Manoussakis, Narayanan Narayanan, Derrick Stolee
2016 C conf
Safe Sets in Graphs: Graph Classes and Structural Parameters.
COCOA
Raquel Águeda, Nathann Cohen, Shinya Fujita, Sylvain Legay, Yannis Manoussakis, Yasuko Matsui, Leandro Montero, Reza Naserasr, Yota Otachi, Tadashi Sakuma, Zsolt Tuza, Renyu Xu
2016 J jnl
The complexity of tropical graph homomorphisms.
CoRR
Florent Foucaud, Ararat Harutyunyan, Pavol Hell, Sylvain Legay, Yannis Manoussakis, Reza Naserasr
2016 B conf
Tropical Dominating Sets in Vertex-Coloured Graphs.
WALCOM
Jean-Alexandre Anglès d'Auriac, Csilla Bujtás, Hakim El Maftouhi, Marek Karpinski, Yannis Manoussakis, Leandro Montero, Narayanan Narayanan, Laurent Rosaz, Johan Thapper, Zsolt Tuza
2015 J jnl
Tropical Dominating Sets in Vertex-Coloured Graphs.
CoRR
Jean-Alexandre Anglès d'Auriac, Csilla Bujtás, Hakim El Maftouhi, Marek Karpinski, Yannis Manoussakis, Leandro Montero, N. Narayanan, Laurent Rosaz, Johan Thapper, Zsolt Tuza
2015 J jnl
Weak Balance in Random Signed Graphs.
Internet Math.
Abdelhakim El Maftouhi, Ararat Harutyunyan, Yannis Manoussakis
2014 J jnl
On degree sets and the minimum orders in bipartite graphs.
Discuss. Math. Graph Theory
Yannis Manoussakis, H. P. Patil
2014 J jnl
Proper Hamiltonian Cycles in Edge-Colored Multigraphs.
CoRR
Raquel Águeda, Valentin Borozan, Raquel Díaz, Yannis Manoussakis, Leandro Montero
2014 J jnl
Proper Hamiltonian Paths in Edge-Coloured Multigraphs.
CoRR
Raquel Águeda, Valentin Borozan, Marina Groshaus, Yannis Manoussakis, Gervais Mendy, Leandro Montero
2012 J jnl
Balance in Random Signed Graphs.
Internet Math.
Abdelhakim El Maftouhi, Yannis Manoussakis, O. Megalakaki
2012 J jnl
Preface.
Discret. Math.
Hao Li, Yannis Manoussakis
2012 J jnl
Proper connection of graphs.
Discret. Math.
Valentin Borozan, Shinya Fujita, Aydin Gerek, Colton Magnant, Yannis Manoussakis, Leandro Montero, Zsolt Tuza
2012 J jnl
Sufficient conditions for the existence of spanning colored trees in edge-colored graphs.
Discret. Math.
Raquel Águeda, Valentin Borozan, Yannis Manoussakis, Gervais Mendy, Rahul Muthu
2011 J jnl
Proper Hamiltonian Paths in Edge-Colored Multigraphs.
Electron. Notes Discret. Math.
Raquel Águeda, Valentin Borozan, Marina Groshaus, Yannis Manoussakis, Gervais Mendy, Leandro Montero
2010 J jnl
Cycles and paths in edge-colored graphs with given degrees.
J. Graph Theory
Abdelfattah Abouelaoualim, Kinkar Chandra Das, Wenceslas Fernandez de la Vega, Marek Karpinski, Yannis Manoussakis, Carlos A. J. Martinhon, Rachid Saad
2010 J jnl
Links in edge-colored graphs.
Eur. J. Comb.
J. M. Becu, M. Dah, Yannis Manoussakis, Gervais Mendy
2010 J jnl
Preface.
Eur. J. Comb.
Yannis Manoussakis
2009 C conf
Colored Trees in Edge-Colored Graphs.
CTW
Abdelfattah Abouelaoualim, Valentin Borozan, Yannis Manoussakis, Carlos A. J. Martinhon, Rahul Muthu, Rachid Saad
2009 J jnl
Longest Cycles in 3-connected Graphs with Given Independence Number.
Graphs Comb.
Yannis Manoussakis
2008 B conf
Paths and Trails in Edge-Colored Graphs.
LATIN
Abdelfattah Abouelaoualim, Kinkar Chandra Das, Luérbio Faria, Yannis Manoussakis, Carlos A. J. Martinhon, Rachid Saad
2008 J jnl
Paths and trails in edge-colored graphs.
Theor. Comput. Sci.
Abdelfattah Abouelaoualim, Kinkar Chandra Das, Luérbio Faria, Yannis Manoussakis, Carlos A. J. Martinhon, Rachid Saad
2004 J jnl
Upper bounds for the forwarding indices of communication networks.
Discret. Math.
Mohamed El Haddad, Yannis Manoussakis, Rachid Saad
2003 J jnl
Bipartite Graphs and their Degree Sets.
Electron. Notes Discret. Math.
Yannis Manoussakis, H. P. Patil
2003 J jnl
The number of 2-edge-colored complete graphs with unique hamiltonian alternating cycle.
Discret. Math.
A. Benkouar, Yannis Manoussakis, Rachid Saad
2002 J jnl
On max cut in cubic graphs.
Parallel Algorithms Appl.
Tiziana Calamoneri, Irene Finocchi, Yannis Manoussakis, Rossella Petreschi
2002 J jnl
Scheduling Independent Multiprocessor Tasks.
Algorithmica
Abdel Krim Amoura, Evripidis Bampis, Claire Kenyon, Yannis Manoussakis
2001 J jnl
Preface.
Theor. Comput. Sci.
Gerard J. Chang, Michel Deza, Yannis Manoussakis, Jean-Marc Steyaert
2001 J jnl
Ramsey numbers for tournaments.
Theor. Comput. Sci.
Yannis Manoussakis, Zsolt Tuza
2000 J jnl
Perfect Matching in General vs. Cubic Graphs: A Note on the Planar and Bipartite Cases.
RAIRO Theor. Informatics Appl.
Evripidis Bampis, Aristotelis Giannakos, Alexander V. Karzanov, Yannis Manoussakis, Ioannis Milis
1999 — conf
A Parallel Approximation Algorithm for the Max Cut Problem on Cubic Graphs.
ASIAN
Tiziana Calamoneri, Irene Finocchi, Yannis Manoussakis, Rossella Petreschi
1999 J jnl
A comparison of heuristics for scheduling multiprocessor tasks on three dedicated processors.
Parallel Comput.
Abdel Krim Amoura, Evripidis Bampis, Yannis Manoussakis, Zsolt Tuza
1999 J jnl
A sufficient condition for maximum cycles in bipartite digraphs.
Discret. Math.
Yannis Manoussakis, Ioannis Milis
1999 J jnl
On the parallel complexity of the alternating Hamiltonian cycle problem.
RAIRO Oper. Res.
Evripidis Bampis, Yannis Manoussakis, Ioannis Milis
1998 J jnl
A Parallel Algorithm for Finding a Perfect Matching in a Planar Graph.
Parallel Process. Lett.
Evripidis Bampis, Alexander V. Karzanov, Yannis Manoussakis, Ioannis Milis
1997 J jnl
Parallel Algorithms for the Hamiltonian Cycle and Hamiltonian Path Problems in Semicomplete Bipartite Digraphs.
Algorithmica
Jørgen Bang-Jensen, Mohamed El Haddad, Yannis Manoussakis, Teresa M. Przytycka
1997 A conf
Scheduling Independent Multiprocessor Tasks.
ESA
Abdel Krim Amoura, Evripidis Bampis, Claire Kenyon, Yannis Manoussakis
1996 — ed.
Combinatorics and Computer Science, 8th Franco-Japanese and 4th Franco-Chinese Conference, Brest, France, July 3-5, 1995, Selected Papers
Combinatorics and Computer Science
Michel Deza, Reinhardt Euler, Yannis Manoussakis
1996 J jnl
Cycles of given color patterns.
J. Graph Theory
Yannis Manoussakis, Michael Spyratos, Zsolt Tuza
1996 J jnl
Minimal colorings for properly colored subgraphs.
Graphs Comb.
Yannis Manoussakis, Michael Spyratos, Zsolt Tuza, Margit Voigt
1996 J jnl
Minimum (2, r)-Metrics and Integer Multiflows.
Eur. J. Comb.
Alexander V. Karzanov, Yannis Manoussakis
1996 J jnl
Optimal routings in communication networks with linearly bounded forwarding index.
Networks
Yannis Manoussakis, Zsolt Tuza
1996 J jnl
The Forwarding Index of Directed Networks.
Discret. Appl. Math.
Yannis Manoussakis, Zsolt Tuza
1995 J jnl
A Parallel Reduction of Hamiltonian Cycle to Hamiltonian Path in Tournaments.
J. Algorithms
Evripidis Bampis, Mohamed El Haddad, Yannis Manoussakis, Miklos Santha
1995 J jnl
Alternating Paths in Edge-colored Complete Graphs.
Discret. Appl. Math.
Yannis Manoussakis
1995 — conf
Finding an Antidirected Hamiltonian Path Starting with a Forward Arc from a Given Vertex of a Tournament.
Combinatorics and Computer Science
Evripidis Bampis, Pavol Hell, Yannis Manoussakis, Moshe Rosenfeld
1995 — conf
On the Parallel Complexity of the Alternating Hamiltonian Cycle Problem.
Combinatorics and Computer Science
Evripidis Bampis, Yannis Manoussakis, Ioannis Milis
1995 J jnl
Weakly Hamiltonian-Connected Vertices in Bipartite Tournaments.
J. Comb. Theory B
Jørgen Bang-Jensen, Yannis Manoussakis
1994 J jnl
Complementary cycles containing a fixed arc in diregular bipartite tournaments.
Discret. Math.
Ke Min Zhang, Yannis Manoussakis, Min Song Zeng
1994 J jnl
Computation of the forwarding index via flows: A note.
Networks
Wenceslas Fernandez de la Vega, Yannis Manoussakis
1994 J jnl
Cycles Through
Comb.
Jørgen Bang-Jensen, Yannis Manoussakis
1994 J jnl
Grids in Random Graphs.
Random Struct. Algorithms
Wenceslas Fernandez de la Vega, Yannis Manoussakis
1994 B conf
NC Algorithms for Antidirected Hamiltonian Paths and Cycles in Tournaments (Extended Abstract).
WG
Evripidis Bampis, Yannis Manoussakis, Ioannis Milis
1994 J jnl
Packing Problems in Edge-colored Graphs.
Discret. Appl. Math.
Pavol Hell, Yannis Manoussakis, Zsolt Tuza
1993 — conf
A Parallel Reduction of Hamiltonian Cycle to Hamiltonian Path in Tournaments.
PARLE
Evripidis Bampis, Mohamed El Haddad, Yannis Manoussakis, Miklos Santha
1992 J jnl
A Polynomial Algorithm for Hamiltonian-Connectedness in Semicomplete Digraphs.
J. Algorithms
Jørgen Bang-Jensen, Yannis Manoussakis, Carsten Thomassen
1992 J jnl
A linear-time algorithm for finding Hamiltonian cycles in tournaments.
Discret. Appl. Math.
Yannis Manoussakis
1992 J jnl
Directed hamiltonian graphs.
J. Graph Theory
Yannis Manoussakis
1992 J jnl
Hamiltonian paths and cycles, number of arcs and independence number in digraphs.
Discret. Math.
Yannis Manoussakis, Denise Amar
1992 J jnl
The Forwarding Index of Communication Networks with Given Connectivity.
Discret. Appl. Math.
Wenceslas Fernandez de la Vega, Yannis Manoussakis
1991 — conf
On the Complexity of Some Hamiltonian and Eulerian Problems in Edge-Colored Complete Graphs.
ISA
A. Benkouar, Yannis Manoussakis, Vangelis Th. Paschos, Rachid Saad
1990 J jnl
Cycles and paths of many lengths in bipartite digraphs.
J. Comb. Theory B
Denise Amar, Yannis Manoussakis
1990 J jnl
Polynomial Algorithms for Finding Cycles and Paths in Bipartite Tournaments.
SIAM J. Discret. Math.
Yannis Manoussakis, Zsolt Tuza
1989 J jnl
Cicles and paths in bipartite tournaments with spanning configurations.
Comb.
Roland Häggkvist, Yannis Manoussakis
1989 J jnl
The number of bipartite tournaments with a unique given factor.
J. Graph Theory
Manoussakis Manolis, Yannis Manoussakis