Yannis Manoussakis

According to our database, Yannis Manoussakis authored at least 71 papers between 1989 and 2021.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2021

Tropical paths in vertex-colored graphs.

Johanne Cohen, Giuseppe F. Italiano, Yannis Manoussakis, Kim Thang Nguyen, Hong Phong Pham

J. Comb. Optim., 2021

2019

On the Number of Vertex-Disjoint Cycles in Digraphs.

Yandong Bai, Yannis Manoussakis

SIAM J. Discret. Math., 2019

Maximum colored trees in edge-colored graphs.

Valentin Borozan, Wenceslas Fernandez de la Vega, Yannis Manoussakis, Carlos A. J. Martinhon, Rahul Muthu, Hong Phong Pham, Rachid Saad

Eur. J. Comb., 2019

2018

Safe sets, network majority on weighted trees.

Ravindra B. Bapat, Shinya Fujita, Sylvain Legay, Yannis Manoussakis, Yasuko Matsui, Tadashi Sakuma, Zsolt Tuza

Networks, 2018

Tropical dominating sets in vertex-coloured graphs.

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

J. Discrete Algorithms, 2018

Safe sets in graphs: Graph classes and structural parameters.

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

J. Comb. Optim., 2018

Maximum colorful independent sets in vertex-colored graphs.

Yannis Manoussakis, Hong Phong Pham

Electron. Notes Discret. Math., 2018

Maximum Colorful Cycles in Vertex-Colored Graphs.

Giuseppe F. Italiano, Yannis Manoussakis, Kim Thang Nguyen, Hong Phong Pham

Proceedings of the Computer Science - Theory and Applications, 2018

Maximum Colorful Cliques in Vertex-Colored Graphs.

Giuseppe F. Italiano, Yannis Manoussakis, Kim Thang Nguyen, Hong Phong Pham

Proceedings of the Computing and Combinatorics - 24th International Conference, 2018

2017

Proper Hamiltonian Paths in Edge-Coloured Multigraphs.

Raquel Águeda, Valentin Borozan, Marina Groshaus, Yannis Manoussakis, Gervais Mendy, Leandro Montero

Graphs Comb., 2017

Tropical matchings in vertex-colored graphs.

Johanne Cohen, Yannis Manoussakis, Hong Phong Pham, Zsolt Tuza

Electron. Notes Discret. Math., 2017

Proper Hamiltonian cycles in edge-colored multigraphs.

Raquel Águeda, Valentin Borozan, Raquel Díaz, Yannis Manoussakis, Leandro Montero

Discret. Math., 2017

The complexity of tropical graph homomorphisms.

Florent Foucaud, Ararat Harutyunyan, Pavol Hell, Sylvain Legay, Yannis Manoussakis, Reza Naserasr

Discret. Appl. Math., 2017

2016

Partitioning a Graph into Highly Connected Subgraphs.

Valentin Borozan, Michael Ferrara, Shinya Fujita, Michitaka Furuya, Yannis Manoussakis, Narayanan Narayanan, Derrick Stolee

J. Graph Theory, 2016

Network Majority on Tree Topological Network.

Ravindra B. Bapat, Shinya Fujita, Sylvain Legay, Yannis Manoussakis, Yasuko Matsui, Tadashi Sakuma, Zsolt Tuza

Electron. Notes Discret. Math., 2016

Connected Tropical Subgraphs in Vertex-Colored Graphs.

Jean-Alexandre Anglès d'Auriac, Nathann Cohen, Hakim El Mafthoui, Ararat Harutyunyan, Sylvain Legay, Yannis Manoussakis

Discret. Math. Theor. Comput. Sci., 2016

Tropical Dominating Sets in Vertex-Coloured Graphs.

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

Proceedings of the WALCOM: Algorithms and Computation - 10th International Workshop, 2016

Safe Sets in Graphs: Graph Classes and Structural Parameters.

Raquel Águeda, Nathann Cohen, Shinya Fujita, Sylvain Legay, Yannis Manoussakis, Yasuko Matsui, Leandro Montero, Reza Naserasr, Yota Otachi, Tadashi Sakuma, Zsolt Tuza, Renyu Xu

Proceedings of the Combinatorial Optimization and Applications, 2016

2015

Weak Balance in Random Signed Graphs.

Abdelhakim El Maftouhi, Ararat Harutyunyan, Yannis Manoussakis

Internet Math., 2015

2014

On degree sets and the minimum orders in bipartite graphs.

Yannis Manoussakis, H. P. Patil

Discuss. Math. Graph Theory, 2014

2012

Balance in Random Signed Graphs.

Abdelhakim El Maftouhi, Yannis Manoussakis, O. Megalakaki

Internet Math., 2012

Preface.

Hao Li, Yannis Manoussakis

Discret. Math., 2012

Proper connection of graphs.

Valentin Borozan, Shinya Fujita, Aydin Gerek, Colton Magnant, Yannis Manoussakis, Leandro Montero, Zsolt Tuza

Discret. Math., 2012

Sufficient conditions for the existence of spanning colored trees in edge-colored graphs.

Raquel Águeda, Valentin Borozan, Yannis Manoussakis, Gervais Mendy, Rahul Muthu

Discret. Math., 2012

2011

Proper Hamiltonian Paths in Edge-Colored Multigraphs.

Raquel Águeda, Valentin Borozan, Marina Groshaus, Yannis Manoussakis, Gervais Mendy, Leandro Montero

Electron. Notes Discret. Math., 2011

2010

Cycles and paths in edge-colored graphs with given degrees.

Abdelfattah Abouelaoualim, Kinkar Chandra Das, Wenceslas Fernandez de la Vega, Marek Karpinski, Yannis Manoussakis, Carlos A. J. Martinhon, Rachid Saad

J. Graph Theory, 2010

Preface.

Yannis Manoussakis

Eur. J. Comb., 2010

Links in edge-colored graphs.

J. M. Becu, M. Dah, Yannis Manoussakis, Gervais Mendy

Eur. J. Comb., 2010

2009

Longest Cycles in 3-connected Graphs with Given Independence Number.

Yannis Manoussakis

Graphs Comb., 2009

Colored Trees in Edge-Colored Graphs.

Abdelfattah Abouelaoualim, Valentin Borozan, Yannis Manoussakis, Carlos A. J. Martinhon, Rahul Muthu, Rachid Saad

Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2009

2008

Paths and trails in edge-colored graphs.

Abdelfattah Abouelaoualim, Kinkar Chandra Das, Luérbio Faria, Yannis Manoussakis, Carlos A. J. Martinhon, Rachid Saad

Theor. Comput. Sci., 2008

2004

Upper bounds for the forwarding indices of communication networks.

Mohamed El Haddad, Yannis Manoussakis, Rachid Saad

Discret. Math., 2004

2003

Bipartite Graphs and their Degree Sets.

Yannis Manoussakis, H. P. Patil

Electron. Notes Discret. Math., 2003

The number of 2-edge-colored complete graphs with unique hamiltonian alternating cycle.

A. Benkouar, Yannis Manoussakis, Rachid Saad

Discret. Math., 2003

2002

On max cut in cubic graphs.

Tiziana Calamoneri, Irene Finocchi, Yannis Manoussakis, Rossella Petreschi

Parallel Algorithms Appl., 2002

Scheduling Independent Multiprocessor Tasks.

Abdel Krim Amoura, Evripidis Bampis, Claire Kenyon, Yannis Manoussakis

Algorithmica, 2002

2001

Ramsey numbers for tournaments.

Yannis Manoussakis, Zsolt Tuza

Theor. Comput. Sci., 2001

Preface.

Gerard J. Chang, Michel Deza, Yannis Manoussakis, Jean-Marc Steyaert

Theor. Comput. Sci., 2001

2000

Perfect Matching in General vs. Cubic Graphs: A Note on the Planar and Bipartite Cases.

Evripidis Bampis, Aristotelis Giannakos, Alexander V. Karzanov, Yannis Manoussakis, Ioannis Milis

RAIRO Theor. Informatics Appl., 2000

1999

On the parallel complexity of the alternating Hamiltonian cycle problem.

Evripidis Bampis, Yannis Manoussakis, Ioannis Milis

RAIRO Oper. Res., 1999

A comparison of heuristics for scheduling multiprocessor tasks on three dedicated processors.

Abdel Krim Amoura, Evripidis Bampis, Yannis Manoussakis, Zsolt Tuza

Parallel Comput., 1999

A sufficient condition for maximum cycles in bipartite digraphs.

Yannis Manoussakis, Ioannis Milis

Discret. Math., 1999

A Parallel Approximation Algorithm for the Max Cut Problem on Cubic Graphs.

Tiziana Calamoneri, Irene Finocchi, Yannis Manoussakis, Rossella Petreschi

Proceedings of the Advances in Computing Science, 1999

1998

A Parallel Algorithm for Finding a Perfect Matching in a Planar Graph.

Evripidis Bampis, Alexander V. Karzanov, Yannis Manoussakis, Ioannis Milis

Parallel Process. Lett., 1998

1997

Parallel Algorithms for the Hamiltonian Cycle and Hamiltonian Path Problems in Semicomplete Bipartite Digraphs.

Jørgen Bang-Jensen, Mohamed El Haddad, Yannis Manoussakis, Teresa M. Przytycka

Algorithmica, 1997

1996

Optimal routings in communication networks with linearly bounded forwarding index.

Yannis Manoussakis, Zsolt Tuza

Networks, 1996

Cycles of given color patterns.

Yannis Manoussakis, Michael Spyratos, Zsolt Tuza

J. Graph Theory, 1996

Minimal colorings for properly colored subgraphs.

Yannis Manoussakis, Michael Spyratos, Zsolt Tuza, Margit Voigt

Graphs Comb., 1996

Minimum (2, r)-Metrics and Integer Multiflows.

Alexander V. Karzanov, Yannis Manoussakis

Eur. J. Comb., 1996

The Forwarding Index of Directed Networks.

Yannis Manoussakis, Zsolt Tuza

Discret. Appl. Math., 1996

1995

Weakly Hamiltonian-Connected Vertices in Bipartite Tournaments.

Jørgen Bang-Jensen, Yannis Manoussakis

J. Comb. Theory B, 1995

A Parallel Reduction of Hamiltonian Cycle to Hamiltonian Path in Tournaments.

Evripidis Bampis, Mohamed El Haddad, Yannis Manoussakis, Miklos Santha

J. Algorithms, 1995

Alternating Paths in Edge-colored Complete Graphs.

Yannis Manoussakis

Discret. Appl. Math., 1995

Finding an Antidirected Hamiltonian Path Starting with a Forward Arc from a Given Vertex of a Tournament.

Evripidis Bampis, Pavol Hell, Yannis Manoussakis, Moshe Rosenfeld

Proceedings of the Combinatorics and Computer Science, 1995

1994

Grids in Random Graphs.

Wenceslas Fernandez de la Vega, Yannis Manoussakis

Random Struct. Algorithms, 1994

Computation of the forwarding index via flows: A note.

Wenceslas Fernandez de la Vega, Yannis Manoussakis

Networks, 1994

Complementary cycles containing a fixed arc in diregular bipartite tournaments.

Ke Min Zhang, Yannis Manoussakis, Zeng Min Song

Discret. Math., 1994

Packing Problems in Edge-colored Graphs.

Pavol Hell, Yannis Manoussakis, Zsolt Tuza

Discret. Appl. Math., 1994

Cycles Through <i>k</i> Vertices in Bipartite Tournaments.

Jørgen Bang-Jensen, Yannis Manoussakis

Comb., 1994

NC Algorithms for Antidirected Hamiltonian Paths and Cycles in Tournaments (Extended Abstract).

Evripidis Bampis, Yannis Manoussakis, Ioannis Milis

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1994

1992

Directed hamiltonian graphs.

Yannis Manoussakis

J. Graph Theory, 1992

A Polynomial Algorithm for Hamiltonian-Connectedness in Semicomplete Digraphs.

Jørgen Bang-Jensen, Yannis Manoussakis, Carsten Thomassen

J. Algorithms, 1992

Hamiltonian paths and cycles, number of arcs and independence number in digraphs.

Yannis Manoussakis, Denise Amar

Discret. Math., 1992

The Forwarding Index of Communication Networks with Given Connectivity.

Wenceslas Fernandez de la Vega, Yannis Manoussakis

Discret. Appl. Math., 1992

A linear-time algorithm for finding Hamiltonian cycles in tournaments.

Yannis Manoussakis

Discret. Appl. Math., 1992

1991

On the Complexity of Some Hamiltonian and Eulerian Problems in Edge-Colored Complete Graphs.

A. Benkouar, Yannis Manoussakis, Vangelis Th. Paschos, Rachid Saad

Proceedings of the ISA '91 Algorithms, 1991

1990

Polynomial Algorithms for Finding Cycles and Paths in Bipartite Tournaments.

Yannis Manoussakis, Zsolt Tuza

SIAM J. Discret. Math., 1990

<i>k</i>-Linked and <i>k</i>-cyclic digraphs.

Yannis Manoussakis

J. Comb. Theory B, 1990

Cycles and paths of many lengths in bipartite digraphs.

Denise Amar, Yannis Manoussakis

J. Comb. Theory B, 1990

1989

The number of bipartite tournaments with a unique given factor.

Manoussakis Manolis, Yannis Manoussakis

J. Graph Theory, 1989

Cicles and paths in bipartite tournaments with spanning configurations.

Roland Häggkvist, Yannis Manoussakis

Comb., 1989