Yannis Manoussakis

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

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.



In proceedings 
PhD thesis 


On csauthors.net:


Tropical paths in vertex-colored graphs.
J. Comb. Optim., 2021

On the Number of Vertex-Disjoint Cycles in Digraphs.
SIAM J. Discret. Math., 2019

Maximum colored trees in edge-colored graphs.
Eur. J. Comb., 2019

Safe sets, network majority on weighted trees.
Networks, 2018

Tropical dominating sets in vertex-coloured graphs.
J. Discrete Algorithms, 2018

Safe sets in graphs: Graph classes and structural parameters.
J. Comb. Optim., 2018

Maximum colorful independent sets in vertex-colored graphs.
Electron. Notes Discret. Math., 2018

Maximum Colorful Cycles in Vertex-Colored Graphs.
Proceedings of the Computer Science - Theory and Applications, 2018

Maximum Colorful Cliques in Vertex-Colored Graphs.
Proceedings of the Computing and Combinatorics - 24th International Conference, 2018

Proper Hamiltonian Paths in Edge-Coloured Multigraphs.
Graphs Comb., 2017

Tropical matchings in vertex-colored graphs.
Electron. Notes Discret. Math., 2017

Proper Hamiltonian cycles in edge-colored multigraphs.
Discret. Math., 2017

The complexity of tropical graph homomorphisms.
Discret. Appl. Math., 2017

Partitioning a Graph into Highly Connected Subgraphs.
J. Graph Theory, 2016

Network Majority on Tree Topological Network.
Electron. Notes Discret. Math., 2016

Connected Tropical Subgraphs in Vertex-Colored Graphs.
Discret. Math. Theor. Comput. Sci., 2016

Tropical Dominating Sets in Vertex-Coloured Graphs.
Proceedings of the WALCOM: Algorithms and Computation - 10th International Workshop, 2016

Safe Sets in Graphs: Graph Classes and Structural Parameters.
Proceedings of the Combinatorial Optimization and Applications, 2016

Weak Balance in Random Signed Graphs.
Internet Math., 2015

On degree sets and the minimum orders in bipartite graphs.
Discuss. Math. Graph Theory, 2014

Balance in Random Signed Graphs.
Internet Math., 2012

Discret. Math., 2012

Proper connection of graphs.
Discret. Math., 2012

Sufficient conditions for the existence of spanning colored trees in edge-colored graphs.
Discret. Math., 2012

Proper Hamiltonian Paths in Edge-Colored Multigraphs.
Electron. Notes Discret. Math., 2011

Cycles and paths in edge-colored graphs with given degrees.
J. Graph Theory, 2010

Eur. J. Comb., 2010

Links in edge-colored graphs.
Eur. J. Comb., 2010

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

Colored Trees in Edge-Colored Graphs.
Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2009

Paths and trails in edge-colored graphs.
Theor. Comput. Sci., 2008

Upper bounds for the forwarding indices of communication networks.
Discret. Math., 2004

Bipartite Graphs and their Degree Sets.
Electron. Notes Discret. Math., 2003

The number of 2-edge-colored complete graphs with unique hamiltonian alternating cycle.
Discret. Math., 2003

On max cut in cubic graphs.
Parallel Algorithms Appl., 2002

Scheduling Independent Multiprocessor Tasks.
Algorithmica, 2002

Ramsey numbers for tournaments.
Theor. Comput. Sci., 2001

Theor. Comput. Sci., 2001

Perfect Matching in General vs. Cubic Graphs: A Note on the Planar and Bipartite Cases.
RAIRO Theor. Informatics Appl., 2000

On the parallel complexity of the alternating Hamiltonian cycle problem.
RAIRO Oper. Res., 1999

A comparison of heuristics for scheduling multiprocessor tasks on three dedicated processors.
Parallel Comput., 1999

A sufficient condition for maximum cycles in bipartite digraphs.
Discret. Math., 1999

A Parallel Approximation Algorithm for the Max Cut Problem on Cubic Graphs.
Proceedings of the Advances in Computing Science, 1999

A Parallel Algorithm for Finding a Perfect Matching in a Planar Graph.
Parallel Process. Lett., 1998

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

Optimal routings in communication networks with linearly bounded forwarding index.
Networks, 1996

Cycles of given color patterns.
J. Graph Theory, 1996

Minimal colorings for properly colored subgraphs.
Graphs Comb., 1996

Minimum (2, r)-Metrics and Integer Multiflows.
Eur. J. Comb., 1996

The Forwarding Index of Directed Networks.
Discret. Appl. Math., 1996

Weakly Hamiltonian-Connected Vertices in Bipartite Tournaments.
J. Comb. Theory, Ser. B, 1995

A Parallel Reduction of Hamiltonian Cycle to Hamiltonian Path in Tournaments.
J. Algorithms, 1995

Alternating Paths in Edge-colored Complete Graphs.
Discret. Appl. Math., 1995

Finding an Antidirected Hamiltonian Path Starting with a Forward Arc from a Given Vertex of a Tournament.
Proceedings of the Combinatorics and Computer Science, 1995

Grids in Random Graphs.
Random Struct. Algorithms, 1994

Computation of the forwarding index via flows: A note.
Networks, 1994

Complementary cycles containing a fixed arc in diregular bipartite tournaments.
Discret. Math., 1994

Packing Problems in Edge-colored Graphs.
Discret. Appl. Math., 1994

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

NC Algorithms for Antidirected Hamiltonian Paths and Cycles in Tournaments (Extended Abstract).
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1994

Directed hamiltonian graphs.
J. Graph Theory, 1992

A Polynomial Algorithm for Hamiltonian-Connectedness in Semicomplete Digraphs.
J. Algorithms, 1992

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

The Forwarding Index of Communication Networks with Given Connectivity.
Discret. Appl. Math., 1992

A linear-time algorithm for finding Hamiltonian cycles in tournaments.
Discret. Appl. Math., 1992

On the Complexity of Some Hamiltonian and Eulerian Problems in Edge-Colored Complete Graphs.
Proceedings of the ISA '91 Algorithms, 1991

Polynomial Algorithms for Finding Cycles and Paths in Bipartite Tournaments.
SIAM J. Discret. Math., 1990

<i>k</i>-Linked and <i>k</i>-cyclic digraphs.
J. Comb. Theory, Ser. B, 1990

Cycles and paths of many lengths in bipartite digraphs.
J. Comb. Theory, Ser. B, 1990

The number of bipartite tournaments with a unique given factor.
J. Graph Theory, 1989

Cicles and paths in bipartite tournaments with spanning configurations.
Comb., 1989