Home page of Y. Manoussakis

- USF, Universitaires sans frontières/ AAB, Academics across borders -

- Sine Sole Soleo (Without the sun I remain silent) -

Yannis Manoussakis, Distinguished Professor in Computer Science
Hdr, Phd, MSc Computer Science

Mailing address:
Yannis Manoussakis
University Paris-Sud, Orsay
LRI, Bât. 650,
91405 Orsay cedex
FRANCE

E-mail: yannis@lri:fr
Office : +33(0)169156676, 0169338643, 0169336117
Fax : +33(0)169156586
Cell/France : +33(0)602503894
Home : +33(0)145411581
Greece : +302821073715
Cell/Greece : +306976942820

Phd or Post-doc positions: If you are looking for such position on any of my research domains, please do not hesitate to contact me. Here you may find two research subjects in English or en Français

Studies

Undergraduate studies in Electrical and Electronic Engineering at the National Technical University of Athens, Greece. (Diploma, June 1982; Project Supervisor: Prof. C. Papadimitriou).

Graduate Studies in Computer Science at University of Paris XI, Orsay:
- M.A., 1983; Project supervisor: Prof. J.C. Bermond
- Ph.D.(Thèse 3eme cycle), 1985; Supervisor: Prof. J.C. Bermond; Thesis: "Existence de cycles et chaînes dans les graphes orientés ou non en liaison avec des parametres de graphes (connexité, degré, etc.)" ;
- Ph.D.(Nouvelle Thèse), 1987; Supervisor: Prof. A. Germa; Thesis: "Problèmes extrémaux dans des graphes orientés".
- Habilitation diploma attributed in 1991 by C. Berge (President), A. Bondy, D. Gouyou-Beauchamps, P. Hell, W. Fernandez de la Vega, M. Plummer and C. Payan. Thesis: " Cycles et chaînes dans des graphes: Conditions suffisantes et algorithmes".

Positions

- 1985-1988, Assistant Professor (Maître de Conférences), Ecole Nationale Supérieure des Télécommunications, Sup-Télécom, Paris
- 1988-1991, Assistant professor (Maître de Conférences) University Paris XII, Créteil
- Since 1991, Full Professor at the computer science department of University Paris XI, Orsay. Head of LRI .

As a past permanent member of the French Superior Film Technical Commission ( CST), I was regulary participating to the activities of the Cannes International Film Festival .

Research domain

Discrete mathematics and foundations of computer science with emphasis on graph theory, combinatorial optimisation, networks, scheduling technics, design and analysis of combinatorial sequential, random and parallel algorithms. Also interested on digital cinema, broadcast technologies, and internet applications related to education.

Courses

Has taught undergraduate and graduate courses on:

Data structures,
Algorithms and complexity,
Theory of languages and compilers,
Theory of interconnexion networks,
Combinatorics and graph theory,
Computational geometry,
Cryptography,
Computer architectures,
Parallel & randomized algorithms,
Java, Javascript, HTML,
C, C++,Pascal, Assembly
Data base systems,
Distributed data bases,
Multimedia systems, CD-Roms technologies,
Image processing technologies,
Broadcast internet technologies,

Editorial Bords

Supervisor Post-Doctorals/Researchers

Current

Past

Johanna Luviano
Narayanan Potty, Assistant professor, India
Ararat Harutyunyan, post Doc Ens Lyon
Rahul Muthu , Assistant professor, India.
Mohamed-Yahya Ould-Mohamed Salem, Assistant professor, Mauritania.
Carlos Martinhon ,(co-advised with L. Ferandez de la Vega) Assistant professor, Brazil,
Kinkar Chandra Das, Researcher, India
Wun-Seng Chou , Research Fellow and Deputy Director, Dept. of Mathematics, Academia Sinica, Taiwan
Yannis Milis, Associate Professor, Athens University of Economics and Business, Greece.
H.P. Patil, Professor & Head, Dept. of Mathematics, Pondichery University, India

PhD students

Current

Past

Sylvain LEGAY Private
Hong Phong PHAM Assistant Professor, Vietnam
Renyu XU Assistant Professor, China
Jean-Alexandre Anglès d'Auriac
Leandro Montero, Post Doc Paris South
Gervais Mendy, Assistant Professor, University of Dakar, Senegal
Valentin Borozan, Lecturer (ATER) Ensiie
A. Abouelaoualim,
K. Amoura (co-advisor E. Bampis), Industrial R&D
A. Benkouar,
A. Deza, (Paris/Tokyo), Professor, McMaster University, Canada
M. El Haddad, Professor & Head, Dept. of Maths & CS, Technical University of Tanger, Morocco
H. El Maftouhi, (co-advisor L.Fernandez de la Vega)
D. Goularas Associate professor, Yeditepe University, Turkey
R.Saad (co-advisor L. Fernandez de la Vega)

Publications

Newspapers

For articles published in Greek and French daily newspapers, please see here.

Editorials

Special issue of Discrete Mathematics, (H. Li and Y. Manoussakis Eds) Discrete Mathematics 312(17): 2531 (2012), Elsevier Science.
Combinatorics and Geometry, (Y. Manoussakis Ed) Special Issue of the European Journal of Combinatorics, Volume 31, 2010, Elsevier Science.
Combinatorics and Optimisation (M.Deza, Y. Manoussakis and J.M. Steyaert Eds) Special Issue of Theoretical Computer Sciences, Volume 235, Issue 2, 2001, Elsevier Science.
Combinatorics and Computer Sciences (G. Chang, M. Deza, Y. Manoussakis and J.M. Steyaert Eds) Special Issue of Theoretical Computer Sciences, Volume 263, Issue:1-2, July 28, 2001, Elsevier Science.
Combinatorics and Computer Science, (M. Deza, I. Manoussakis and R. Euler eds.) Lecture Notes in Computer Science, Volume 1120, 1996, Springer-Verlag.

Selected publications

Jean-Alexandre Anglès d'Auriac, Csilla Bujtás, Hakim El Maftouhi, Marek Karpinski, Yannis Manoussakis, Leandro Montero, Narayanan Narayanan, Laurent Rosaz, Johan Thapper, Zsolt Tuza: Tropical Dominating Sets in Vertex-Coloured Graphs. WALCOM 2016: 17-27
Abdelhakim El Maftouhi, Ararat Harutyunyan, Yannis Manoussakis: Weak Balance in Random Signed Graphs. Internet Mathematics 11(2): 143-154 (2015)
Yannis Manoussakis, H. P. Patil: On degree sets and the minimum orders in bipartite graphs. Discussiones Mathematicae Graph Theory 34(2): 383-390 (2014)
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) (2012) 2694-2699.
V. Borozan, S. Fujita, A. Gerek, C. Magnant, Y. Manoussakis, L. Montero, Z. Tuza, Proper connection of graphs, Discrete mathematics, 312(17) (2012) 2550-2560. pdf
A. El Maftouhi, Y. Manoussakis and O. Megalakaki, Balance in random signed graphs, Internet Mathematics 8(4) (2012) 364-380. pdf
V. Borozan, W. Fernandez de la Vega, Y. Manoussakis, C. A. Martinhon, R. Muthu and R. Saad, Maximum Colored Trees in Edge-Colored Graphs, submitted. pdf
A. Abouelaoualim, K. Ch. Das, W. Fernandez de la Vega, M. Karpinski, Y. Manoussakis, C. A. Martinhon and R. Saad, Cycles and Paths in Edge-Colored Graphs with Given Degrees. J. of Graph Theory 64(1) (2010) 63-86. pdf
J.M. Becu, M. Dah, Y. Manoussakis and G. Mendy, Links in edge-colored graphs, European Journal of Combinatorics 31 (2010) 442-460. pdf
V. Borozan, W. Fernandez de la Vega, Y. Manoussakis, C. A. Martinhon, R. Muthu and R. Saad, Colored Trees in Edge-Colored Graphs, 8th CTW09, Paris, June 2009 pdf
Y. Manoussakis, Longets cycles in 3-connected graphs, Graphs and Combinatorics, 25(3) (2009) 377-384.
A. Abouelaoualim, K. Ch. Das, L.Faria, Y. Manoussakis, C.A. Martinhon and R. Saad, Paths and Trails in Edge-Colored Graphs, Theoretical Computer Sciences 409/3 (2008) 497-510. pdf
M. El Haddad, V. Fragopoulou, Y. Manoussakis and R. Saad, The Forwarding Index of Antisymmetric Routings, J. Combinatorial Mathematics And Combinatorial Computing 60 (2007) 203-222.
M. Dah, Y. Manoussakis and K. Tanaka, A game on graphs with many non-centralized defenders, (EURO XXII) 22nd European Conference on Operations Research, July 8-11, 2007, Prague.
C. Cosenza, K. Djemal, D. Goularas and Y. Manoussakis, Adaptive Triangulation Method for Management of the Topology Changes in 3D boundary Reconstruction, Proceeeding of the 4th IEEE Conference on Systems Signals and Devices, March 19-22, 2007, Hammamet, Tynisia.
C. Cosenza, K. Djemal, D. Goularas and Y. Manoussakis, Specific 3D Treatement in orthodontic domain, International Symposium on Robotics and Automation (ISRA 2006), ISBN: 970-769-070-4, August 2006, Mexico.
M. El Haddad, Y. Manoussakis and R. Saad, Upper bounds for the forwarding indices of communication network, Discrete Mathematics 286(3) (2005) 233-240.
C. Cosenza, K. Djemal, D. Goularas and Y. Manoussakis, DIVITOR Client/Server Application (DIgitalization, VIsualisation and Treatment in ORthodontics), Fifth International Network Conference (INC 2005) 5-7 July 2005, Samos, Greece.
Y. Manoussakis, H.P. Patil, and V. Sankar, Further results on degree sets for graphs, Int. J. Graphs Comb. 1 (2004) 77-82.
Y. Manoussakis, M. El Haddad, R. Saad, Upper bounds for the forwarding indices of communication networks. Discrete Mathematics 286 (2004) 233-240.
A. Benkouar, Y. Manoussakis and R. Saad, The number of edge-colored complete graphs with unique alternating hamiltonian cycles, Discrete Mathematics 263 (2003) 1-10.
K. Amoura, E. Bampis, C. Kenyon and Y. Manoussakis, Scheduling independent multiprocessor tasks, Algorithmica 32(2) (2002) 247-261.
Y. Manoussakis and H.P. Patil, Bipartite graphs and their Degree Sets, R.C. Bose Centenary Symposium on Discrete mathematics and Applications, Kolkata India, 15-21 Dec. 2002.
Y. Manoussakis and Zs Tuza, Ramsey numbers in tournaments, Theoretical Computer Science, 263 (2001) 75-85.
Y. Manoussakis, H.P. Patil, V. Sankar, Further results on Degree sets for graphs, Mano I.J.M.S. 1(2) (2001) 1-6.
T. Calamoneri , I.Finocchi , Y. Manoussakis and R. Petreschi, On max-cut in cubic graphs, Journal on Parallel Algorithms and Applications, 17(3) (2001) 165-183
T. Giannakos, E. Bampis, A. Karzanov, Y. Manoussakis and Y. Milis, Perfect matchings in general vs cubic graphs: a note on the planar and bipartite cases, RAIRO Informatique Theorique 34 (2000) 87-98.
Y. Manoussakis, Stereoscopy and virtual reality, -state of the art, 2000 Taiwan-France Joint Conference on Information Science and Technologies, November 2000, National Chiao-Tung University, Hsinchu, Taiwan.
K. Amoura, E. Bampis, Y. Manoussakis and Zs. Tuza, A comparison of heuristics for scheduling multiprocessor tasks on three dedicated processors, Parallel Computing 25 (1) (1999) 49-61.
Y. Manoussakis and Y.Milis, A sufficient condition for maximum cycles in bipartite digraphs, Discrete Mathematics 207 (1999) 161-171.
E. Bampis, Y. Manoussakis et Y. Milis, On the parallel complexity of the alternating hamiltonian cycle problem, RAIRO on Operations Research 33(4) (1999) 421-437.
T.Calamoneri, I.Finocchi, Y. Manoussakis and R.Petreschi, Parallel generation of large subgraphs in cubic graphs, pp.175-186, Proceedings of Argentinian Workshop on Theoretical Computer Science, Buenos Aires, Argentina,1999.
T.Calamoneri, I.Finocchi, Y. Manoussakis eand R.Petreschi, A parallel approximation algorithm for the max-cut problem on cubic graphs, LNCS 1742- Advances in Computing Science - ASIAN'99 (5th Asian Computing Science Conference), 27-36, Pucket, Thailand, 1999
T. Giannakos, E. Bampis, A. Karzanov, Y. Manoussakis and Y. Milis, A parallel algorithm for finding perfect matchings in planar graphs, Parallel Processing Letters 8 (3) (1998) 399-405.
J. Bang-Jensen, M. El Haddad, Y. Manoussakis and T. Przytycka, A polylog parallel algorithm for finding hamiltonian cycles in bipartite tournaments, Algorithmica 17(1) (1997) 67-87
K.Amoura, E. Bampis, Y. Manoussakis and C. Kenyon, Scheduling independent multiprocessor tasks, Proceedings of ESA'97, LNCS 1284 (1997) 1-12.
A. Karzanov and Y. Manoussakis (2,r)-metrics and related flow problems, European Journal on Combinatorics 17(2/3) (1996) 223-232.
Y. Manoussakis and Zs.Tuza The forwarding index of directed networks, Discrete Applied Mathematics Vol. 68 (1996) 279-291.
Y. Manoussakis, M. Spyratos, Zs. Tuza, Cycles and paths with given color patterns, Journal of Graph Theory Vol. 21 No 2 (1996)153-162.
Y. Manoussakis, A. Benkouar, V. Paschos, R.Saad On the complexity of Hamiltonian and Eulerian problems in edge-colored complete graphs, RAIRO Journal On Operations Research Vol. 30 No 4 (1996) 417-438.
Y. Manoussakis, M. Spyratos, Zs. Tuza and M.Voight, Minimal Colorings for Properly Colored Subgraphs, Graphs and Combinatorics Vol 11 (1996) 1-18.
E. Bampis, Y. Manoussakis and Y.Milis, NC algorithms for antidirected hamiltonian paths and cycles in tournaments, JCMCC 21 (1996) 223-234.
Y. Manoussakis and Zs.Tuza, Optimal routings in communication networks with linearly bounded capacity, Networks Vol 28 (1996) 185-196.
E. Bampis, P. Hell, Y. Manoussakis and M. Rosenfeld, Finding an antidirected hamiltonian path starting with a forward arc from a given vertex of a tournament, LNCS Vol 1120 (1996) 67-73.
E. Bampis, Y. Manoussakis and Y.Milis, On the parallel complexity of the alternating hamiltonian cycle problem, LNCS Vol 1120 (1996) 367-377.
M. El Haddad, E. Babis Y. Manoussakis and M. Santha, A parallel reduction of hamiltonian cycle to hamiltonian path in tournaments, Journal of Algorithms 1 (1995) 432-440.
Y. Manoussakis, Alternating paths in edge-colored complete graphs, Discrete Applied Mathematics, 56 (1995) 297-309.
Y. Manoussakis and J. Bang-Jensen Weakly hamiltonian connected vertices in bipartite tournaments, Journal of Combinatorial Theory series B, Vol 63, No 2 (1995) 261-280.
E. Bampis, Y. Mannoussakis and I. Milis, NC Algorithms for Antidirected Hamiltonian Paths and Cycles in Tournaments, Ernst W. Mayr, Gunther Schmidt, Gottfried Tinhofer (Eds.): Graph-Theoretic Concepts in Computer Science, 20th International Workshop, WG '94, Herrsching, Germany, June 16-18, 1994, Proceedings. LNCS 903 Springer (1995) 387-394
Y. Manoussakis, W. Fernandez de la Vega, Grids in random graphs, Journal of Random Sructures and Algorithms 5(2) (1994) 329-336
P. Hell, Y. Manoussakis and Zs. Tuza, Packing problems in edge-colored complete graphs, Discrete Applied Mathematics, 14(53) (1994) 295-306.
J. Bang-Jensen and Y. Manoussakis, Cycles through k vertices and k arcs in bipartite tournaments, Combinatorica 14(2) (1994) 243-246.
Y. Manoussakis, W. Fernandez de la Vega, Computation of the forwarding index via flows -a note, Networks Vol. 24 (1994) 273-276.
A. Benkouar, Y. Manoussakis and R. Saad, Alternating cycles through given vertices in edge-colored graphs, Journal of Combinatorial Mathematics and Combinatorial Computing,16 (1994) 199-207.
Y. Manoussakis, W. Fernandez de la Vega, Grids in random graphs, Journal of Random Sructures and Algorithms Vol. 5 No 2 (1994) 329-336.
Y. Manoussakis, O. Megalakaki, M. Spyratos, Zs. Tuza and Wun-Seng Chou, Alternating paths through given vertices in edge-colored graphs, Mathématiques, Informatique et Sciences Humaines No 127 Vol 32 (1994) 49-58.
Y. Manoussakis, K.M. Zhang and Z.M. Song, Complementary cycles containing a fixed arc in diregular bipartite tournaments, Discrete Mathematics 133 (1994) 325-328.
J. Bang-Jensen, Y. Manoussakis and C. Thomassen, A polynomial algorithm for Hamiltonian- connectedness in semi-complete digraphs, J. of Algorithms 13 (1992) 114-127.
Y. Manoussakis, Directed hamiltonian graphs, J. of Graph Theory Vol. 16 No 1 (1992) 51-59.
D. Amar and Y. Manoussakis, Hamiltonian paths and cycles, number of arcs and independence number in digraphs, Discrete Mathematics Vol. 105 (1992) 157-192.
Y. Manoussakis, A linear algorithm for finding hamiltonian cycles in tournaments, Discrete Applied Mathematics Vol. 36 No 2 (1992) 199-201.
Y. Manoussakis, W. Fernandez de la Vega, On the forwarding-index of communication networks with given connectivity, Discrete Applied Mathematics 37/38 (1992) 147-155.
Y. Manoussakis and M. Manoussakis, Some cyclic properties in bipartite digraphs with given number of arcs, Ars Combinatoria Vol. 33 (1991) 301-310.
A. Benkouar, Y. Manoussakis, V. Paschos and R.Saad, On the complexity of Hamiltonian and Eulerian problems in edge-colored complete graphs, Lecture Notes in Computer Sciences, Springer Verlang (W.L. Hsu and R.C.T. Lee Editors) Vol. 557 (1991) 190-198).
D. Amar and Y. Manoussakis, Cycles and paths of many lengths in bipartite digraphs, Journal of Combinatorial Theory series B (50) No 2 (1990) 254-264.
Y. Manoussakis and Zs. Tuza, Polynomial algorithms for finding cycles and paths in bipartite tournaments, SIAM Journal on Discrete Mathematics Vol. 3 No 2 (1990) 537-543.
Y. Manoussakis, k-linked and k-cyclic digraphs, Journal of Combinatorial Theory series B 48 (1990) 111-121.
Y. Manoussakis and Zs. Tuza, Polynomial algorithms for finding cycles and paths in bipartite tournaments, SIAM Journal on Discrete Mathematics 3(2) (1990) 537-543.
R. Haggkvist and Y. Manoussakis, Cycles and paths in bipartite tournaments with spanning configurations, Combinatorica 9(1) (1989) 51-56.
Y. Manoussakis and M. Manoussakis, The number of bipartite tournaments with a unique given factor, Journal of Graph Theory Vol. 13 (1989) 143-151.
N. Chakroun, Y. Manoussakis and M. Manoussakis Directed and antidirected hamiltonian cycles in bipartite digraphs, Combinatorics and Graph Theory, Volume 25 (1989) 39-46, (Eds. Z. Scupien and M. Borowieski), Polish Scientific Publishers.
N. Chakroun an Y. Manoussakis, Degrees, diameter and structure of oriented graphs, Ars Combinatoria Vol. 25 (1988) 81-96.
Y. Manoussakis and M. Manoussakis, Cycles in bipartite digraphs with given number of arcs, Colloquia Mathematica Societatis Janos Bolyai 52, Combinatorics, Hungary (1987) 393-404.

Photo Album

Quizz: Which is the last capital in the world still divided into two parts by a wall?

Updated on December 15, 2015