dblp.uni-trier.dewww.uni-trier.de

Yannis Manoussakis Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

*2009
40EEA. Abouelaoualim, V. Borozan, Yannis Manoussakis, Carlos A. J. Martinhon, R. Muthu, Rachid Saad: Colored Trees in Edge-Colored Graphs. CTW 2009: 115-119
2008
39EEA. Abouelaoualim, Kinkar Chandra Das, L. Faria, Yannis Manoussakis, Carlos A. J. Martinhon, Rachid Saad: Paths and Trails in Edge-Colored Graphs. LATIN 2008: 723-735
38EEA. Abouelaoualim, Kinkar Chandra Das, L. Faria, Yannis Manoussakis, Carlos A. J. Martinhon, Rachid Saad: Paths and trails in edge-colored graphs. Theor. Comput. Sci. 409(3): 497-510 (2008)
2004
37EEMohamed El Haddad, Yannis Manoussakis, Rachid Saad: Upper bounds for the forwarding indices of communication networks. Discrete Mathematics 286(3): 233-240 (2004)
2003
36EEA. Benkouar, Yannis Manoussakis, Rachid Saad: The number of 2-edge-colored complete graphs with unique hamiltonian alternating cycle. Discrete Mathematics 263(1-3): 1-10 (2003)
2002
35EEAbdel Krim Amoura, Evripidis Bampis, Claire Kenyon, Yannis Manoussakis: Scheduling Independent Multiprocessor Tasks. Algorithmica 32(2): 247-261 (2002)
34EETiziana Calamoneri, Irene Finocchi, Yannis Manoussakis, Rossella Petreschi: On max cut in cubic graphs. Parallel Algorithms Appl. 17(3): 165-183 (2002)
2001
33EEGerard J. Chang, Michel Deza, Yannis Manoussakis, Jean-Marc Steyaert: Preface. Theor. Comput. Sci. 263(1-2): 1 (2001)
32EEYannis Manoussakis, Zsolt Tuza: Ramsey numbers for tournaments. Theor. Comput. Sci. 263(1-2): 75-85 (2001)
2000
31 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. ITA 34(2): 87-98 (2000)
1999
30EETiziana Calamoneri, Irene Finocchi, Yannis Manoussakis, Rossella Petreschi: A Parallel Approximation Algorithm for the Max Cut Problem on Cubic Graphs. ASIAN 1999: 27-36
29EEYannis Manoussakis, Ioannis Milis: A sufficient condition for maximum cycles in bipartite digraphs. Discrete Mathematics 207(1-3): 161-171 (1999)
28 Abdel Krim Amoura, Evripidis Bampis, Yannis Manoussakis, Zsolt Tuza: A comparison of heuristics for scheduling multiprocessor tasks on three dedicated processors. Parallel Computing 25(1): 49-61 (1999)
1998
27 Evripidis Bampis, Alexander V. Karzanov, Yannis Manoussakis, Ioannis Milis: A Parallel Algorithm for Finding a Perfect Matching in a Planar Graph. Parallel Processing Letters 8(3): 399-405 (1998)
1997
26EEAbdel Krim Amoura, Evripidis Bampis, Claire Kenyon, Yannis Manoussakis: Scheduling Independent Multiprocessor Tasks. ESA 1997: 1-12
25 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. Algorithmica 17(1): 67-87 (1997)
1996
24 Michel Deza, Reinhardt Euler, Yannis Manoussakis: Combinatorics and Computer Science, 8th Franco-Japanese and 4th Franco-Chinese Conference, Brest, France, July 3-5, 1995, Selected Papers Springer 1996
23EEYannis Manoussakis, Zsolt Tuza: The Forwarding Index of Directed Networks. Discrete Applied Mathematics 68(3): 279-291 (1996)
22EEAlexander V. Karzanov, Yannis Manoussakis: Minimum (2, r)-Metrics and Integer Multiflows. Eur. J. Comb. 17(2-3): 223-232 (1996)
21EEYannis Manoussakis, Zsolt Tuza: Optimal routings in communication networks with linearly bounded forwarding index. Networks 28(4): 177-180 (1996)
1995
20 Evripidis Bampis, Yannis Manoussakis, Ioannis Milis: On the Parallel Complexity of the Alternating Hamiltonian Cycle Problem. Combinatorics and Computer Science 1995: 367-377
19 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. Combinatorics and Computer Science 1995: 67-73
18EEYannis Manoussakis: Alternating Paths in Edge-colored Complete Graphs. Discrete Applied Mathematics 56(2-3): 297-309 (1995)
17 Evripidis Bampis, Mohamed El Haddad, Yannis Manoussakis, Miklos Santha: A Parallel Reduction of Hamiltonian Cycle to Hamiltonian Path in Tournaments. J. Algorithms 19(3): 432-440 (1995)
16EEJørgen Bang-Jensen, Yannis Manoussakis: Weakly Hamiltonian-Connected Vertices in Bipartite Tournaments. J. Comb. Theory, Ser. B 63(2): 261-280 (1995)
1994
15EEEvripidis Bampis, Yannis Manoussakis, Ioannis Milis: NC Algorithms for Antidirected Hamiltonian Paths and Cycles in Tournaments (Extended Abstract). WG 1994: 387-394
14 Jørgen Bang-Jensen, Yannis Manoussakis: Cycles Through k Vertices in Bipartite Tournaments. Combinatorica 14(2): 243-246 (1994)
13EEPavol Hell, Yannis Manoussakis, Zsolt Tuza: Packing Problems in Edge-colored Graphs. Discrete Applied Mathematics 52(3): 295-306 (1994)
12EEKe Min Zhang, Yannis Manoussakis, Zeng Min Song: Complementary cycles containing a fixed arc in diregular bipartite tournaments. Discrete Mathematics 133(1-3): 325-328 (1994)
11 Wenceslas Fernandez de la Vega, Yannis Manoussakis: Grids in Random Graphs. Random Struct. Algorithms 5(2): 329-336 (1994)
1993
10EEEvripidis Bampis, Mohamed El Haddad, Yannis Manoussakis, Miklos Santha: A Parallel Reduction of Hamiltonian Cycle to Hamiltonian Path in Tournaments. PARLE 1993: 553-560
1992
9EEYannis Manoussakis: A linear-time algorithm for finding Hamiltonian cycles in tournaments. Discrete Applied Mathematics 36(2): 199-201 (1992)
8EEWenceslas Fernandez de la Vega, Yannis Manoussakis: The Forwarding Index of Communication Networks with Given Connectivity. Discrete Applied Mathematics 37/38: 147-155 (1992)
7EEYannis Manoussakis, Denise Amar: Hamiltonian paths and cycles, number of arcs and independence number in digraphs. Discrete Mathematics 105(1-3): 157-172 (1992)
6 Jørgen Bang-Jensen, Yannis Manoussakis, Carsten Thomassen: A Polynomial Algorithm for Hamiltonian-Connectedness in Semicomplete Digraphs. J. Algorithms 13(1): 114-127 (1992)
1991
5 A. Benkouar, Yannis Manoussakis, Vangelis Th. Paschos, Rachid Saad: On the Complexity of Some Hamiltonian and Eulerian Problems in Edge-Colored Complete Graphs. ISA 1991: 190-198
1990
4EEYannis Manoussakis: k-Linked and k-cyclic digraphs. J. Comb. Theory, Ser. B 48(2): 216-226 (1990)
3EEDenise Amar, Yannis Manoussakis: Cycles and paths of many lengths in bipartite digraphs. J. Comb. Theory, Ser. B 50(2): 254-264 (1990)
2 Yannis Manoussakis, Zsolt Tuza: Polynomial Algorithms for Finding Cycles and Paths in Bipartite Tournaments. SIAM J. Discrete Math. 3(4): 537-543 (1990)
1989
1 Roland Häggkvist, Yannis Manoussakis: Cicles and paths in bipartite tournaments with spanning configurations. Combinatorica 9(1): 33-38 (1989)

Coauthor Index

1A. Abouelaoualim [38] [39] [40]
2Denise Amar [3] [7]
3Abdel Krim Amoura [26] [28] [35]
4Evripidis Bampis [10] [15] [17] [19] [20] [26] [27] [28] [31] [35]
5Jørgen Bang-Jensen [6] [14] [16] [25]
6A. Benkouar [5] [36]
7V. Borozan [40]
8Tiziana Calamoneri [30] [34]
9Gerard J. Chang [33]
10Kinkar Chandra Das [38] [39]
11Michel Deza [24] [33]
12Reinhardt Euler [24]
13L. Faria [38] [39]
14Irene Finocchi [30] [34]
15Aristotelis Giannakos [31]
16Mohamed El Haddad [10] [17] [25] [37]
17Roland Häggkvist [1]
18Pavol Hell [13] [19]
19Alexander V. Karzanov [22] [27] [31]
20Carlos A. J. Martinhon [38] [39] [40]
21Claire Mathieu (Claire Kenyon, Claire Kenyon-Mathieu) [26] [35]
22Ioannis Milis [15] [20] [27] [29] [31]
23R. Muthu [40]
24Vangelis Th. Paschos [5]
25Rossella Petreschi [30] [34]
26Teresa M. Przytycka [25]
27Moshe Rosenfeld [19]
28Rachid Saad [5] [36] [37] [38] [39] [40]
29Miklos Santha [10] [17]
30Zeng Min Song [12]
31Jean-Marc Steyaert [33]
32Carsten Thomassen [6]
33Zsolt Tuza [2] [13] [21] [23] [28] [32]
34Wenceslas Fernandez de la Vega [8] [11]
35Ke Min Zhang [12]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)