The SCEAS System
| |||||||

## Search the dblp DataBase
Yannis Manoussakis:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Tiziana Calamoneri, Irene Finocchi, Yannis Manoussakis, Rossella Petreschi
**A Parallel Approximation Algorithm for the Max Cut Problem on Cubic Graphs.**[Citation Graph (0, 0)][DBLP] ASIAN, 1999, pp:27-36 [Conf] - 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.**[Citation Graph (0, 0)][DBLP] Combinatorics and Computer Science, 1995, pp:67-73 [Conf] - Evripidis Bampis, Yannis Manoussakis, Ioannis Milis
**On the Parallel Complexity of the Alternating Hamiltonian Cycle Problem.**[Citation Graph (0, 0)][DBLP] Combinatorics and Computer Science, 1995, pp:367-377 [Conf] - Abdel Krim Amoura, Evripidis Bampis, Claire Kenyon, Yannis Manoussakis
**Scheduling Independent Multiprocessor Tasks.**[Citation Graph (0, 0)][DBLP] ESA, 1997, pp:1-12 [Conf] - A. Benkouar, Yannis Manoussakis, Vangelis Th. Paschos, Rachid Saad
**On the Complexity of Some Hamiltonian and Eulerian Problems in Edge-Colored Complete Graphs.**[Citation Graph (0, 0)][DBLP] ISA, 1991, pp:190-198 [Conf] - Evripidis Bampis, Mohamed El Haddad, Yannis Manoussakis, Miklos Santha
**A Parallel Reduction of Hamiltonian Cycle to Hamiltonian Path in Tournaments.**[Citation Graph (0, 0)][DBLP] PARLE, 1993, pp:553-560 [Conf] - Evripidis Bampis, Yannis Manoussakis, Ioannis Milis
**NC Algorithms for Antidirected Hamiltonian Paths and Cycles in Tournaments (Extended Abstract).**[Citation Graph (0, 0)][DBLP] WG, 1994, pp:387-394 [Conf] - Abdel Krim Amoura, Evripidis Bampis, Claire Kenyon, Yannis Manoussakis
**Scheduling Independent Multiprocessor Tasks.**[Citation Graph (0, 0)][DBLP] Algorithmica, 2002, v:32, n:2, pp:247-261 [Journal] - 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.**[Citation Graph (0, 0)][DBLP] Algorithmica, 1997, v:17, n:1, pp:67-87 [Journal] - Jørgen Bang-Jensen, Yannis Manoussakis
**Cycles Through**[Citation Graph (0, 0)][DBLP]*k*Vertices in Bipartite Tournaments. Combinatorica, 1994, v:14, n:2, pp:243-246 [Journal] - Roland Häggkvist, Yannis Manoussakis
**Cicles and paths in bipartite tournaments with spanning configurations.**[Citation Graph (0, 0)][DBLP] Combinatorica, 1989, v:9, n:1, pp:33-38 [Journal] - Pavol Hell, Yannis Manoussakis, Zsolt Tuza
**Packing Problems in Edge-colored Graphs.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 1994, v:52, n:3, pp:295-306 [Journal] - Yannis Manoussakis
**Alternating Paths in Edge-colored Complete Graphs.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 1995, v:56, n:2-3, pp:297-309 [Journal] - Yannis Manoussakis, Zsolt Tuza
**The Forwarding Index of Directed Networks.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 1996, v:68, n:3, pp:279-291 [Journal] - Wenceslas Fernandez de la Vega, Yannis Manoussakis
**The Forwarding Index of Communication Networks with Given Connectivity.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 1992, v:37, n:, pp:147-155 [Journal] - A. Benkouar, Yannis Manoussakis, Rachid Saad
**The number of 2-edge-colored complete graphs with unique hamiltonian alternating cycle.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2003, v:263, n:1-3, pp:1-10 [Journal] - Mohamed El Haddad, Yannis Manoussakis, Rachid Saad
**Upper bounds for the forwarding indices of communication networks.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2004, v:286, n:3, pp:233-240 [Journal] - Alexander V. Karzanov, Yannis Manoussakis
**Minimum (2, r)-Metrics and Integer Multiflows.**[Citation Graph (0, 0)][DBLP] Eur. J. Comb., 1996, v:17, n:2-3, pp:223-232 [Journal] - 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.**[Citation Graph (0, 0)][DBLP] ITA, 2000, v:34, n:2, pp:87-98 [Journal] - Evripidis Bampis, Mohamed El Haddad, Yannis Manoussakis, Miklos Santha
**A Parallel Reduction of Hamiltonian Cycle to Hamiltonian Path in Tournaments.**[Citation Graph (0, 0)][DBLP] J. Algorithms, 1995, v:19, n:3, pp:432-440 [Journal] - Jørgen Bang-Jensen, Yannis Manoussakis, Carsten Thomassen
**A Polynomial Algorithm for Hamiltonian-Connectedness in Semicomplete Digraphs.**[Citation Graph (0, 0)][DBLP] J. Algorithms, 1992, v:13, n:1, pp:114-127 [Journal] - Denise Amar, Yannis Manoussakis
**Cycles and paths of many lengths in bipartite digraphs.**[Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 1990, v:50, n:2, pp:254-264 [Journal] - Jørgen Bang-Jensen, Yannis Manoussakis
**Weakly Hamiltonian-Connected Vertices in Bipartite Tournaments.**[Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 1995, v:63, n:2, pp:261-280 [Journal] - Yannis Manoussakis
[Citation Graph (0, 0)][DBLP]*k*-Linked and*k*-cyclic digraphs. J. Comb. Theory, Ser. B, 1990, v:48, n:2, pp:216-226 [Journal] - Yannis Manoussakis, Zsolt Tuza
**Optimal routings in communication networks with linearly bounded forwarding index.**[Citation Graph (0, 0)][DBLP] Networks, 1996, v:28, n:4, pp:177-180 [Journal] - Tiziana Calamoneri, Irene Finocchi, Yannis Manoussakis, Rossella Petreschi
**On max cut in cubic graphs.**[Citation Graph (0, 0)][DBLP] Parallel Algorithms Appl., 2002, v:17, n:3, pp:165-183 [Journal] - Abdel Krim Amoura, Evripidis Bampis, Yannis Manoussakis, Zsolt Tuza
**A comparison of heuristics for scheduling multiprocessor tasks on three dedicated processors.**[Citation Graph (0, 0)][DBLP] Parallel Computing, 1999, v:25, n:1, pp:49-61 [Journal] - Evripidis Bampis, Alexander V. Karzanov, Yannis Manoussakis, Ioannis Milis
**A Parallel Algorithm for Finding a Perfect Matching in a Planar Graph.**[Citation Graph (0, 0)][DBLP] Parallel Processing Letters, 1998, v:8, n:3, pp:399-405 [Journal] - Wenceslas Fernandez de la Vega, Yannis Manoussakis
**Grids in Random Graphs.**[Citation Graph (0, 0)][DBLP] Random Struct. Algorithms, 1994, v:5, n:2, pp:329-336 [Journal] - Yannis Manoussakis, Zsolt Tuza
**Polynomial Algorithms for Finding Cycles and Paths in Bipartite Tournaments.**[Citation Graph (0, 0)][DBLP] SIAM J. Discrete Math., 1990, v:3, n:4, pp:537-543 [Journal] - Gerard J. Chang, Michel Deza, Yannis Manoussakis, Jean-Marc Steyaert
**Preface.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2001, v:263, n:1-2, pp:1- [Journal] - Yannis Manoussakis, Zsolt Tuza
**Ramsey numbers for tournaments.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2001, v:263, n:1-2, pp:75-85 [Journal] - Yannis Manoussakis, Ioannis Milis
**A sufficient condition for maximum cycles in bipartite digraphs.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1999, v:207, n:1-3, pp:161-171 [Journal] - Yannis Manoussakis, Denise Amar
**Hamiltonian paths and cycles, number of arcs and independence number in digraphs.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1992, v:105, n:1-3, pp:157-172 [Journal] - Ke Min Zhang, Yannis Manoussakis, Zeng Min Song
**Complementary cycles containing a fixed arc in diregular bipartite tournaments.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1994, v:133, n:1-3, pp:325-328 [Journal] **Paths and Trails in Edge-Colored Graphs.**[Citation Graph (, )][DBLP]**Colored Trees in Edge-Colored Graphs.**[Citation Graph (, )][DBLP]**A linear-time algorithm for finding Hamiltonian cycles in tournaments.**[Citation Graph (, )][DBLP]**Preface.**[Citation Graph (, )][DBLP]**Links in edge-colored graphs.**[Citation Graph (, )][DBLP]
Search in 0.004secs, Finished in 0.006secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |