Yannis Manoussakis

Publication Activity (10 Years)

Years Active: 1989-2021
Publications (10 Years): 20

Top Topics

Bipartite Graph

Hamiltonian Cycle

Highly Connected

Maximum Cardinality

Top Venues

Electron. Notes Discret. Math.

Publications

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