Yannis Manoussakis

	2011
47		Raquel Águeda, Valentin Borozan, Marina Groshaus, Yannis Manoussakis, Gervais Mendy, Leandro P. Montero: Proper Hamiltonian Paths in Edge-Colored Multigraphs. Electronic Notes in Discrete Mathematics 38: 5-10 (2011)
	2010
46		Yannis Manoussakis: Preface. Eur. J. Comb. 31(2): 419-422 (2010)
45		J. M. Becu, M. Dah, Yannis Manoussakis, Gervais Mendy: Links in edge-colored graphs. Eur. J. Comb. 31(2): 442-460 (2010)
44		A. Abouelaoualim, Kinkar Chandra Das, Wenceslas Fernandez de la Vega, Marek Karpinski, Yannis Manoussakis, Carlos A. J. Martinhon, Rachid Saad: Cycles and paths in edge-colored graphs with given degrees. Journal of Graph Theory 64(1): 63-86 (2010)
	2009
43		A. Abouelaoualim, Valentin Borozan, Yannis Manoussakis, Carlos A. J. Martinhon, R. Muthu, Rachid Saad: Colored Trees in Edge-Colored Graphs. CTW 2009: 115-119
42		Yannis Manoussakis: Longest Cycles in 3-connected Graphs with Given Independence Number. Graphs and Combinatorics 25(3): 377-384 (2009)
	2008
41		A. Abouelaoualim, Kinkar Chandra Das, Luerbio Faria, Yannis Manoussakis, Carlos A. J. Martinhon, Rachid Saad: Paths and Trails in Edge-Colored Graphs. LATIN 2008: 723-735
40		A. Abouelaoualim, Kinkar Chandra Das, Luerbio 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
39		Mohamed El Haddad, Yannis Manoussakis, Rachid Saad: Upper bounds for the forwarding indices of communication networks. Discrete Mathematics 286(3): 233-240 (2004)
	2003
38		A. 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)
37		Yannis Manoussakis, H. P. Patil: Bipartite Graphs and their Degree Sets. Electronic Notes in Discrete Mathematics 15: 125 (2003)
	2002
36		Abdel Krim Amoura, Evripidis Bampis, Claire Kenyon, Yannis Manoussakis: Scheduling Independent Multiprocessor Tasks. Algorithmica 32(2): 247-261 (2002)
35		Tiziana Calamoneri, Irene Finocchi, Yannis Manoussakis, Rossella Petreschi: On max cut in cubic graphs. Parallel Algorithms Appl. 17(3): 165-183 (2002)
	2001
34		Gerard J. Chang, Michel Deza, Yannis Manoussakis, Jean-Marc Steyaert: Preface. Theor. Comput. Sci. 263(1-2): 1 (2001)
33		Yannis Manoussakis, Zsolt Tuza: Ramsey numbers for tournaments. Theor. Comput. Sci. 263(1-2): 75-85 (2001)
	2000
32		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
31		Tiziana Calamoneri, Irene Finocchi, Yannis Manoussakis, Rossella Petreschi: A Parallel Approximation Algorithm for the Max Cut Problem on Cubic Graphs. ASIAN 1999: 27-36
30		Yannis Manoussakis, Ioannis Milis: A sufficient condition for maximum cycles in bipartite digraphs. Discrete Mathematics 207(1-3): 161-171 (1999)
29		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
28		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
27		Abdel Krim Amoura, Evripidis Bampis, Claire Kenyon, Yannis Manoussakis: Scheduling Independent Multiprocessor Tasks. ESA 1997: 1-12
26		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
25		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
24		Yannis Manoussakis, Zsolt Tuza: The Forwarding Index of Directed Networks. Discrete Applied Mathematics 68(3): 279-291 (1996)
23		Alexander V. Karzanov, Yannis Manoussakis: Minimum (2, r)-Metrics and Integer Multiflows. Eur. J. Comb. 17(2-3): 223-232 (1996)
22		Yannis Manoussakis, M. Spyratos, Zsolt Tuza, Margit Voigt: Minimal colorings for properly colored subgraphs. Graphs and Combinatorics 12(1): 345-360 (1996)
21		Yannis 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
18		Yannis 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)
16		Jørgen Bang-Jensen, Yannis Manoussakis: Weakly Hamiltonian-Connected Vertices in Bipartite Tournaments. J. Comb. Theory, Ser. B 63(2): 261-280 (1995)
	1994
15		Evripidis 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)
13		Pavol Hell, Yannis Manoussakis, Zsolt Tuza: Packing Problems in Edge-colored Graphs. Discrete Applied Mathematics 52(3): 295-306 (1994)
12		Ke 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
10		Evripidis Bampis, Mohamed El Haddad, Yannis Manoussakis, Miklos Santha: A Parallel Reduction of Hamiltonian Cycle to Hamiltonian Path in Tournaments. PARLE 1993: 553-560
	1992
9		Yannis Manoussakis: A linear-time algorithm for finding Hamiltonian cycles in tournaments. Discrete Applied Mathematics 36(2): 199-201 (1992)
8		Wenceslas Fernandez de la Vega, Yannis Manoussakis: The Forwarding Index of Communication Networks with Given Connectivity. Discrete Applied Mathematics 37/38: 147-155 (1992)
7		Yannis 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
4		Yannis Manoussakis: k-Linked and k-cyclic digraphs. J. Comb. Theory, Ser. B 48(2): 216-226 (1990)
3		Denise 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

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

Colors in the list of coauthors

Last update Sun Jun 3 16:06:10 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page