Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Yannis Manoussakis
2010 – today
- 2012
[j45]- [j44]Valentin Borozan, Shinya Fujita, Aydin Gerek, Colton Magnant, Yannis Manoussakis, Leandro P. Montero, Zsolt Tuza: Proper connection of graphs. Discrete Mathematics 312(17): 2550-2560 (2012)
- [j43]Raquel Águeda, Valentin Borozan, Yannis Manoussakis, Gervais Mendy, R. Muthu: Sufficient conditions for the existence of spanning colored trees in edge-colored graphs. Discrete Mathematics 312(17): 2694-2699 (2012)
- [j42]A. E. L. Maftouhi, Yannis Manoussakis, O. Megalakaki: Balance in Random Signed Graphs. Internet Mathematics 8(4): 364-380 (2012)
- 2011
- [j41]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
- [j40]
- [j39]J. M. Becu, M. Dah, Yannis Manoussakis, Gervais Mendy: Links in edge-colored graphs. Eur. J. Comb. 31(2): 442-460 (2010)
- [j38]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)
2000 – 2009
- 2009
- [j37]Yannis Manoussakis: Longest Cycles in 3-connected Graphs with Given Independence Number. Graphs and Combinatorics 25(3): 377-384 (2009)
- [c9]A. Abouelaoualim, Valentin Borozan, Yannis Manoussakis, Carlos A. J. Martinhon, R. Muthu, Rachid Saad: Colored Trees in Edge-Colored Graphs. CTW 2009: 115-119
- 2008
- [j36]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)
- [c8]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
- 2004
- [j35]Mohamed El Haddad, Yannis Manoussakis, Rachid Saad: Upper bounds for the forwarding indices of communication networks. Discrete Mathematics 286(3): 233-240 (2004)
- 2003
- [j34]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)
- [j33]Yannis Manoussakis, H. P. Patil: Bipartite Graphs and their Degree Sets. Electronic Notes in Discrete Mathematics 15: 125 (2003)
- 2002
- [j32]Abdel Krim Amoura, Evripidis Bampis, Claire Kenyon, Yannis Manoussakis: Scheduling Independent Multiprocessor Tasks. Algorithmica 32(2): 247-261 (2002)
- [j31]Tiziana Calamoneri, Irene Finocchi, Yannis Manoussakis, Rossella Petreschi: On max cut in cubic graphs. Parallel Algorithms Appl. 17(3): 165-183 (2002)
- 2001
- [j30]Gerard J. Chang, Michel Deza, Yannis Manoussakis, Jean-Marc Steyaert: Preface. Theor. Comput. Sci. 263(1-2): 1 (2001)
- [j29]Yannis Manoussakis, Zsolt Tuza: Ramsey numbers for tournaments. Theor. Comput. Sci. 263(1-2): 75-85 (2001)
- 2000
- [j28]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)
1990 – 1999
- 1999
- [j27]Yannis Manoussakis, Ioannis Milis: A sufficient condition for maximum cycles in bipartite digraphs. Discrete Mathematics 207(1-3): 161-171 (1999)
- [j26]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)
- [j25]Evripidis Bampis, Yannis Manoussakis, Ioannis Milis: On the parallel complexity of the alternating Hamiltonian cycle problem. RAIRO - Operations Research 33(4): 421-437 (1999)
- [c7]Tiziana Calamoneri, Irene Finocchi, Yannis Manoussakis, Rossella Petreschi: A Parallel Approximation Algorithm for the Max Cut Problem on Cubic Graphs. ASIAN 1999: 27-36
- 1998
- [j24]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
- [j23]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)
- [c6]Abdel Krim Amoura, Evripidis Bampis, Claire Kenyon, Yannis Manoussakis: Scheduling Independent Multiprocessor Tasks. ESA 1997: 1-12
- 1996
- [j22]Yannis Manoussakis, Zsolt Tuza: The Forwarding Index of Directed Networks. Discrete Applied Mathematics 68(3): 279-291 (1996)
- [j21]Alexander V. Karzanov, Yannis Manoussakis: Minimum (2, r)-Metrics and Integer Multiflows. Eur. J. Comb. 17(2-3): 223-232 (1996)
- [j20]Yannis Manoussakis, M. Spyratos, Zsolt Tuza, Margit Voigt: Minimal colorings for properly colored subgraphs. Graphs and Combinatorics 12(1): 345-360 (1996)
- [j19]Yannis Manoussakis, M. Spyratos, Zsolt Tuza: Cycles of given color patterns. Journal of Graph Theory 21(2): 153-162 (1996)
- [j18]Yannis Manoussakis, Zsolt Tuza: Optimal routings in communication networks with linearly bounded forwarding index. Networks 28(4): 177-180 (1996)
- [e1]Michel Deza, Reinhardt Euler, Yannis Manoussakis (Eds.): Combinatorics and Computer Science, 8th Franco-Japanese and 4th Franco-Chinese Conference, Brest, France, July 3-5, 1995, Selected Papers. Lecture Notes in Computer Science 1120, Springer 1996, ISBN 3-540-61576-8
- 1995
- [j17]Yannis Manoussakis: Alternating Paths in Edge-colored Complete Graphs. Discrete Applied Mathematics 56(2-3): 297-309 (1995)
- [j16]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)
- [j15]Jørgen Bang-Jensen, Yannis Manoussakis: Weakly Hamiltonian-Connected Vertices in Bipartite Tournaments. J. Comb. Theory, Ser. B 63(2): 261-280 (1995)
- [c5]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
- [c4]Evripidis Bampis, Yannis Manoussakis, Ioannis Milis: On the Parallel Complexity of the Alternating Hamiltonian Cycle Problem. Combinatorics and Computer Science 1995: 367-377
- 1994
- [j14]Jørgen Bang-Jensen, Yannis Manoussakis: Cycles Through k Vertices in Bipartite Tournaments. Combinatorica 14(2): 243-246 (1994)
- [j13]Pavol Hell, Yannis Manoussakis, Zsolt Tuza: Packing Problems in Edge-colored Graphs. Discrete Applied Mathematics 52(3): 295-306 (1994)
- [j12]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)
- [j11]Wenceslas Fernandez de la Vega, Yannis Manoussakis: Computation of the forwarding index via flows: A note. Networks 24(5): 273-276 (1994)
- [j10]Wenceslas Fernandez de la Vega, Yannis Manoussakis: Grids in Random Graphs. Random Struct. Algorithms 5(2): 329-336 (1994)
- [c3]Evripidis Bampis, Yannis Manoussakis, Ioannis Milis: NC Algorithms for Antidirected Hamiltonian Paths and Cycles in Tournaments (Extended Abstract). WG 1994: 387-394
- 1993
- [c2]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
- [j9]Yannis Manoussakis: A linear-time algorithm for finding Hamiltonian cycles in tournaments. Discrete Applied Mathematics 36(2): 199-201 (1992)
- [j8]Wenceslas Fernandez de la Vega, Yannis Manoussakis: The Forwarding Index of Communication Networks with Given Connectivity. Discrete Applied Mathematics 37/38: 147-155 (1992)
- [j7]Yannis Manoussakis, Denise Amar: Hamiltonian paths and cycles, number of arcs and independence number in digraphs. Discrete Mathematics 105(1-3): 157-172 (1992)
- [j6]Jørgen Bang-Jensen, Yannis Manoussakis, Carsten Thomassen: A Polynomial Algorithm for Hamiltonian-Connectedness in Semicomplete Digraphs. J. Algorithms 13(1): 114-127 (1992)
- [j5]
- 1991
- [c1]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
- [j4]
- [j3]Denise Amar, Yannis Manoussakis: Cycles and paths of many lengths in bipartite digraphs. J. Comb. Theory, Ser. B 50(2): 254-264 (1990)
- [j2]Yannis Manoussakis, Zsolt Tuza: Polynomial Algorithms for Finding Cycles and Paths in Bipartite Tournaments. SIAM J. Discrete Math. 3(4): 537-543 (1990)
1980 – 1989
- 1989
- [j1]Roland Häggkvist, Yannis Manoussakis: Cicles and paths in bipartite tournaments with spanning configurations. Combinatorica 9(1): 33-38 (1989)
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-05-07 17:55 CEST by the dblp team