Yannis Manoussakis

According to our database1, Yannis Manoussakis authored at least 70 papers between 1989 and 2019.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

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

2018
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.
Electronic Notes in Discrete Mathematics, 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

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

Tropical matchings in vertex-colored graphs.
Electronic Notes in Discrete Mathematics, 2017

Proper Hamiltonian cycles in edge-colored multigraphs.
Discrete Mathematics, 2017

The complexity of tropical graph homomorphisms.
Discrete Applied Mathematics, 2017

Tropical Paths in Vertex-Colored Graphs.
Proceedings of the Combinatorial Optimization and Applications, 2017

2016
Partitioning a Graph into Highly Connected Subgraphs.
Journal of Graph Theory, 2016

Network Majority on Tree Topological Network.
Electronic Notes in Discrete Mathematics, 2016

Connected Tropical Subgraphs in Vertex-Colored Graphs.
Discrete Mathematics & Theoretical Computer Science, 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

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

2014
On degree sets and the minimum orders in bipartite graphs.
Discussiones Mathematicae Graph Theory, 2014

2012
Balance in Random Signed Graphs.
Internet Mathematics, 2012

Preface.
Discrete Mathematics, 2012

Proper connection of graphs.
Discrete Mathematics, 2012

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

2011
Proper Hamiltonian Paths in Edge-Colored Multigraphs.
Electronic Notes in Discrete Mathematics, 2011

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

Preface.
Eur. J. Comb., 2010

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

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

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

2008
Paths and Trails in Edge-Colored Graphs.
Proceedings of the LATIN 2008: Theoretical Informatics, 2008

2004
Upper bounds for the forwarding indices of communication networks.
Discrete Mathematics, 2004

2003
Bipartite Graphs and their Degree Sets.
Electronic Notes in Discrete Mathematics, 2003

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

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

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

Preface.
Theor. Comput. Sci., 2001

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

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

A sufficient condition for maximum cycles in bipartite digraphs.
Discrete Mathematics, 1999

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

1998
A Parallel Algorithm for Finding a Perfect Matching in a Planar Graph.
Parallel Processing Letters, 1998

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

Scheduling Independent Multiprocessor Tasks.
Proceedings of the Algorithms, 1997

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

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

Minimal colorings for properly colored subgraphs.
Graphs and Combinatorics, 1996

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

The Forwarding Index of Directed Networks.
Discrete Applied Mathematics, 1996

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

Alternating Paths in Edge-colored Complete Graphs.
Discrete Applied Mathematics, 1995

On the Parallel Complexity of the Alternating Hamiltonian Cycle Problem.
Proceedings of the Combinatorics and Computer Science, 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

1994
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.
Discrete Mathematics, 1994

Packing Problems in Edge-colored Graphs.
Discrete Applied Mathematics, 1994

Cycles Through k Vertices in Bipartite Tournaments.
Combinatorica, 1994

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

1993
A Parallel Reduction of Hamiltonian Cycle to Hamiltonian Path in Tournaments.
Proceedings of the PARLE '93, 1993

1992
Directed hamiltonian graphs.
Journal of 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.
Discrete Mathematics, 1992

The Forwarding Index of Communication Networks with Given Connectivity.
Discrete Applied Mathematics, 1992

A linear-time algorithm for finding Hamiltonian cycles in tournaments.
Discrete Applied Mathematics, 1992

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

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

k-Linked and k-cyclic digraphs.
J. Comb. Theory, Ser. B, 1990

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

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

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


  Loading...