Yann Verhoeven Born April 17, 1973 Married, 1 child

375 chemin de roquefort 06410 Biot Tel: +33 (0)6 92 74 72 80 e-mail : [email protected]

Working experience Nov. 2002 -

´ System and network administrator at the ESSI (Ecole Sup´erieure des Syst`emes Informatiques) The job consists in the installation of trouble ticket type software and their evaluation for an internal use in the ESSI site. More over I provide general help for the users. The environment is made of personnal computers with Windows or GNU/Linux.

2001-2002

Post-doctoral internship at the University of Rome “Tor Vergata” in the European Research and Training Network program ARACNE. I have been working on several algorithmic problems in ad-hoc wireless networks and more particulaly on the range assignment problem. An illustration of the current work can be found at the address http://www.mat.uniroma2.it/∼verhoeve. We developped some approximation algorithms based on the minimum spanning tree of the network graph. Moreover I coached a pre-doctorate student and administrated some of the project computers under Linux and Windows.

1999-2000

Military service in the french army in the simulation group of the EAABC of Saumur. I development of a module of the tank simulation program ROMULUS IV. Work done in Visual C++6. The module is a GUI for the creation of an exercise. By the time I leaved, the module was fully developped and documented so it could be further maintained.

Computer science knowledge Systems: Languages:

Method: Tools:

Unix, GNU/Linux (distributions Red Hat and Debian), Windows NT, 2000, XP, Pascal, C, C++, Java (swing, awt, J2SE, J2EE), Perl, Python, HTML, XML, UML, LATEX, Visual C++ 6, Apache.

Teaching experience

During my Ph.D. I participated to the following courses as a professor assistant, 2000-2001

1998-1999

1997-1998

Programing in Java at the University of Orsay. The end project was to develop a networking multiplayer “ tron ” like game. Java TER for the computer science students at the University of Orsay. They had to develop a networking multiplayer awal´e game. UML TER for the MIAGE at the University of Orsay. The students had to conceive and realise a networking chat program. CAML for first year students at the University of Orsay. Programing in java at the MIAGE of the University of Orsay. The end project was to develop a program to automatically analyse the complexity of algorithms. Using java in multimedia at the IUT of the University of Orsay. First course in java at the Ecole Polytechnique of Palaiseau. Programing in Pascal at the MIAGE of the University of Orsay.

Talks ECOTEL’01 ALEA 99 RAND-APX Workshop 98

Invited short talk titled ”On Galton-Watson trees” talk titled ”2-SAT al´eatoire et insatisfaisabilit´e” talk titled ”Random 2SAT and unsatisfiability”

Publications Random 2SAT and unsatisfiability, Information Processing Letters, 72, 1999. Quelques applications des arbres en combinatoire, Rapport de th`ese, Universit´e de Paris XI. A Performance Analysis of the MST-based Heuristic for the Energy-Efficient Broadcast Problem in Random Wireless Networks, submitted to InfoCom (avec A. Clementi, G. Huiban et G. Rossi). Some recent theoretical advances and open questions on energy consumption in ad-hoc wireless networks, accepted in ARACNE’02 (avec A. Clementi, G. Huiban, P. Penna et G. Rossi). Distributed Algorithm for the range assignment problem in ad-hoc wireless networks, submitted to Parallel Processing Letters (avec G. Huiban).

Education 1996-2001

1995-1996

Ph.D. in computer science in LRI (Orsay, France) under the supervision of Pr. W. Fernandez de la Vega “Some use of random trees in combinatorics”. In this thesis we study the success probability of width search algorithms in certain useful classes of random graphs. The obtained results enable us to deduce some structural properties of these graphs (such as the existence of connected components). That kind of knowledge might be useful for example in network scaling when links exist with a particular probability (e.g. a fault probability or an existing probability in a wireless network). In a related context, such approach have already been used for the repartition analysis of data in databases. 1996

1995

Graduate in computer science, LRI (Orsay, France) The internship was completed at the LRI under the supervision of Pr. Fernandez de la Vega and titled “Algorithmic theory of random graphs. Application to the bisection problem”. We first studied the results obtained in classical hard problems of computer science (belonging to the complexity class NP) with the help of methods originating from the spin glass theory in physics. In addition we proposed a polynomial time algorithm for the bisection problem, i.e. the partitionning of the set of nodes of a graph into two equally sized subsets such that the number of edges between those subsets is minimized. This problem appears in design of VLSI systems. Magist`ere in mathematics of Orsay Maitrise in mathematics in Orsay.