Yannis Manoussakis

From MaRDI portal
Revision as of 12:42, 28 January 2024 by Import240128110107 (talk | contribs) (Created automatically from import240128110107)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:442365

Available identifiers

zbMath Open manoussakis.yannis-gMaRDI QIDQ442365

List of research outcomes

PublicationDate of PublicationType
NC algorithms for antidirected hamiltonian paths and cycles in tournaments2024-01-05Paper
Scheduling independent multiprocessor tasks2021-12-20Paper
Tropical paths in vertex-colored graphs2021-11-25Paper
Weak Balance in Random Signed Graphs2021-04-26Paper
On the Number of Vertex-Disjoint Cycles in Digraphs2019-12-11Paper
Safe sets, network majority on weighted trees2019-08-12Paper
Safe sets in graphs: graph classes and structural parameters2018-12-06Paper
Maximum colorful cycles in vertex-colored graphs2018-11-28Paper
Maximum colorful independent sets in vertex-colored graphs2018-10-11Paper
Maximum colorful cliques in vertex-colored graphs2018-10-04Paper
Tropical dominating sets in vertex-coloured graphs2018-05-09Paper
Tropical matchings in vertex-colored graphs2018-04-09Paper
Tropical paths in vertex-colored graphs2018-03-26Paper
Proper Hamiltonian paths in edge-coloured multigraphs2017-10-11Paper
The complexity of tropical graph homomorphisms2017-07-27Paper
Proper Hamiltonian cycles in edge-colored multigraphs2017-05-22Paper
Network majority on tree topological network2017-02-13Paper
Safe Sets in Graphs: Graph Classes and Structural Parameters2017-02-01Paper
https://portal.mardi4nfdi.de/entity/Q28165162016-08-23Paper
Partitioning a Graph into Highly Connected Subgraphs2016-08-12Paper
Tropical dominating sets in vertex-coloured graphs2016-05-03Paper
On degree sets and the minimum orders in bipartite graphs2014-05-16Paper
Proper Hamiltonian paths in edge-coloured multigraphs2013-11-01Paper
Balance in Random Signed Graphs2013-02-15Paper
Proper connection of graphs2012-08-10Paper
Sufficient conditions for the existence of spanning colored trees in edge-colored graphs2012-08-10Paper
Links in edge-colored graphs2010-04-27Paper
Longest cycles in 3-connected graphs with given independence number2009-12-09Paper
Bipartite Graphs and their Degree Sets2007-05-29Paper
Further results on degree sets for graphs2005-05-03Paper
On max cut in cubic graphs2003-06-29Paper
The number of 2-edge-colored complete graphs with unique Hamiltonian alternating cycle2003-04-09Paper
Scheduling independent multiprocessor tasks2002-03-07Paper
Ramsey numbers for tournaments2001-08-20Paper
Perfect Matching in General vs. Cubic Graphs: A Note on the Planar and Bipartite Cases2001-04-26Paper
https://portal.mardi4nfdi.de/entity/Q45015712001-03-07Paper
On the parallel complexity of the alternating Hamiltonian cycle problem2000-08-24Paper
A sufficient condition for maximum cycles in bipartite digraphs2000-03-02Paper
A comparison of heuristics for scheduling multiprocessor tasks on three dedicated processors: Short communication: Special issue on task sheduling problems on parallel and distributed systems1999-04-28Paper
https://portal.mardi4nfdi.de/entity/Q43444521997-07-15Paper
Minimal colorings for properly colored subgraphs1997-02-11Paper
https://portal.mardi4nfdi.de/entity/Q48923361997-01-28Paper
Hamiltonian problems in edge-colored complete graphs and eulerian cycles in edge-colored graphs : some complexity results1997-01-07Paper
The forwarding index of directed networks1996-10-09Paper
Minimum \((2,r)\)-metrics and integer multiflows1996-07-03Paper
https://portal.mardi4nfdi.de/entity/Q48655231996-02-25Paper
Weakly hamiltonian-connected vertices in bipartite tournaments1995-07-02Paper
Alternating paths in edge-colored complete graphs1995-05-04Paper
Packing problems in edge-colored graphs1995-02-14Paper
https://portal.mardi4nfdi.de/entity/Q43206871995-02-02Paper
Computation of the forwarding index via flows: A note1994-09-05Paper
Cycles through \(k\) vertices in bipartite tournaments1994-08-11Paper
Grids in random graphs1994-07-20Paper
Complementary cycles containing a fixed arc in diregular bipartite tournaments1994-01-01Paper
The forwarding index of communication networks with given connectivity1993-01-16Paper
Hamiltonian paths and cycles, number of arcs and independence number in digraphs1993-01-16Paper
A linear-time algorithm for finding Hamiltonian cycles in tournaments1992-09-27Paper
https://portal.mardi4nfdi.de/entity/Q40007961992-09-26Paper
A polynomial algorithm for hamiltonian-connectedness in semicomplete digraphs1992-06-28Paper
Directed hamiltonian graphs1992-06-28Paper
\(k\)-linked and \(k\)-cyclic digraphs1990-01-01Paper
Cycles and paths of many lengths in bipartite digraphs1990-01-01Paper
Polynomial Algorithms for Finding Cycles and Paths in Bipartite Tournaments1990-01-01Paper
Cycles and paths in bipartite tournaments with spanning configurations1989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32010961989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q34874121988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37942011988-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Yannis Manoussakis