Person:442365

Available identifiers

zbMath Open manoussakis.yannis-gMaRDI QIDQ442365

List of research outcomes

Publication	Date of Publication	Type
Finding an antidirected Hamiltonian path starting with a forward arc from a given vertex of a tournament	2024-07-05	Paper
On the parallel complexity of the alternating Hamiltonian cycle problem	2024-07-05	Paper
NC algorithms for antidirected hamiltonian paths and cycles in tournaments	2024-01-05	Paper
Scheduling independent multiprocessor tasks	2021-12-20	Paper
Tropical paths in vertex-colored graphs	2021-11-25	Paper
Weak Balance in Random Signed Graphs	2021-04-26	Paper
On the Number of Vertex-Disjoint Cycles in Digraphs	2019-12-11	Paper
Safe sets, network majority on weighted trees	2019-08-12	Paper
Safe sets in graphs: graph classes and structural parameters	2018-12-06	Paper
Maximum colorful cycles in vertex-colored graphs	2018-11-28	Paper
Maximum colorful independent sets in vertex-colored graphs	2018-10-11	Paper
Maximum colorful cliques in vertex-colored graphs	2018-10-04	Paper
Tropical dominating sets in vertex-coloured graphs	2018-05-09	Paper
Tropical matchings in vertex-colored graphs	2018-04-09	Paper
Tropical paths in vertex-colored graphs	2018-03-26	Paper
Proper Hamiltonian paths in edge-coloured multigraphs	2017-10-11	Paper
The complexity of tropical graph homomorphisms	2017-07-27	Paper
Proper Hamiltonian cycles in edge-colored multigraphs	2017-05-22	Paper
Network majority on tree topological network	2017-02-13	Paper
Safe Sets in Graphs: Graph Classes and Structural Parameters	2017-02-01	Paper
https://portal.mardi4nfdi.de/entity/Q2816516	2016-08-23	Paper
Partitioning a Graph into Highly Connected Subgraphs	2016-08-12	Paper
Tropical dominating sets in vertex-coloured graphs	2016-05-03	Paper
On degree sets and the minimum orders in bipartite graphs	2014-05-16	Paper
Proper Hamiltonian paths in edge-coloured multigraphs	2013-11-01	Paper
Balance in Random Signed Graphs	2013-02-15	Paper
Proper connection of graphs	2012-08-10	Paper
Sufficient conditions for the existence of spanning colored trees in edge-colored graphs	2012-08-10	Paper
Links in edge-colored graphs	2010-04-27	Paper
Longest cycles in 3-connected graphs with given independence number	2009-12-09	Paper
Bipartite Graphs and their Degree Sets	2007-05-29	Paper
Further results on degree sets for graphs	2005-05-03	Paper
On max cut in cubic graphs	2003-06-29	Paper
The number of 2-edge-colored complete graphs with unique Hamiltonian alternating cycle	2003-04-09	Paper
Scheduling independent multiprocessor tasks	2002-03-07	Paper
Ramsey numbers for tournaments	2001-08-20	Paper
Perfect Matching in General vs. Cubic Graphs: A Note on the Planar and Bipartite Cases	2001-04-26	Paper
https://portal.mardi4nfdi.de/entity/Q4501571	2001-03-07	Paper
On the parallel complexity of the alternating Hamiltonian cycle problem	2000-08-24	Paper
A sufficient condition for maximum cycles in bipartite digraphs	2000-03-02	Paper
A comparison of heuristics for scheduling multiprocessor tasks on three dedicated processors: Short communication: Special issue on task sheduling problems on parallel and distributed systems	1999-04-28	Paper
https://portal.mardi4nfdi.de/entity/Q4344452	1997-07-15	Paper
Minimal colorings for properly colored subgraphs	1997-02-11	Paper
https://portal.mardi4nfdi.de/entity/Q4892336	1997-01-28	Paper
Hamiltonian problems in edge-colored complete graphs and eulerian cycles in edge-colored graphs : some complexity results	1997-01-07	Paper
The forwarding index of directed networks	1996-10-09	Paper
Minimum \((2,r)\)-metrics and integer multiflows	1996-07-03	Paper
https://portal.mardi4nfdi.de/entity/Q4865523	1996-02-25	Paper
Weakly hamiltonian-connected vertices in bipartite tournaments	1995-07-02	Paper
Alternating paths in edge-colored complete graphs	1995-05-04	Paper
Packing problems in edge-colored graphs	1995-02-14	Paper
https://portal.mardi4nfdi.de/entity/Q4320687	1995-02-02	Paper
Computation of the forwarding index via flows: A note	1994-09-05	Paper
Cycles through \(k\) vertices in bipartite tournaments	1994-08-11	Paper
Grids in random graphs	1994-07-20	Paper
Complementary cycles containing a fixed arc in diregular bipartite tournaments	1994-01-01	Paper
The forwarding index of communication networks with given connectivity	1993-01-16	Paper
Hamiltonian paths and cycles, number of arcs and independence number in digraphs	1993-01-16	Paper
A linear-time algorithm for finding Hamiltonian cycles in tournaments	1992-09-27	Paper
https://portal.mardi4nfdi.de/entity/Q4000796	1992-09-26	Paper
A polynomial algorithm for hamiltonian-connectedness in semicomplete digraphs	1992-06-28	Paper
Directed hamiltonian graphs	1992-06-28	Paper
\(k\)-linked and \(k\)-cyclic digraphs	1990-01-01	Paper
Cycles and paths of many lengths in bipartite digraphs	1990-01-01	Paper
Polynomial Algorithms for Finding Cycles and Paths in Bipartite Tournaments	1990-01-01	Paper
Cycles and paths in bipartite tournaments with spanning configurations	1989-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3201096	1989-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3487412	1988-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3794201	1988-01-01	Paper

Research outcomes over time

This page was built for person: Yannis Manoussakis