<= /h2>

<= span style=3D'font-size:11.0pt;mso-bidi-font-size:10.5pt;font-family:"Times New = Roman"; mso-ansi-language:EN-US;font-style:normal;mso-bidi-font-style:italic'>Educa= tion

When at the middle school the Cartesian coordinate system was discussed for the first time, I was so impressed by this elegant link between geometry and alg= ebra, that from that moment on there was only one choice for a follow up study. So, at 1990 I started my study on Applied mathematics at the Univer= sity of Twente. In 1990 I obtained my Masters degree. The title of the masters theis that I wrote under supervision of Frank Twilt is: The continuous Newton method in 3 dimensions.

From 1990 to 1994 I was a PhD student at the University of Amsterdam under supervision of Ale= xander Schrijver. The thesis I defended in 1994 was entitled Graphs and curves= on surfaces.

Current job

Currently I am Senior R&D engineer at Thales Nederland B.V., Division Land & Joint systems. Involved in various collaborative projec= ts with other companies and institutions (e.g. AAF, Easy Wireless). Ini= tiator and national and international project leader of the project Easy Wireless (where Thales collaborates with the University of Twente, TNO, Twente Insti= tute for Wireless and Mobile Communications in the area of routing algorithms in wireless networks. Since 2004 ‘Technical Specialist’ in the area of network communications. This title = is awarded by Thales for proven technical competence and added value with rega= rd to development of new systems.

<= o:p>

Previous work experience

1999 – 2005: Thales. Design leader of SOTAS-IP (extens= ion of ATM communication system with IP-technology), researcher into new communica= tion techniques (MPLS). Project leader UniSwitch (contributions of Thales to international UniAccess project), design leader IP-demonstration project, Project leader ‘Voi= ce over IP studies’ (international project involving Thales departments = in several countries).

1994 – 1998 KPN Research. Since 1995 projects on ATM technology. <= span class=3DGramE>Project leader ‘Quo Vadis’ where methods have been developed to guarantee the quality of connections in the ATM network of KPN= . The main challenge in this project was to guide the practical implementatio= n of the theoretical traffic management guidelines developed at KPN Research. Besides that, I was involved in the development of models for simulation of= TCP over ADSL and reliability calculations on telecommunication networks. =

Other things you might like to know

· = My favourite mathematical problem is the <= span class=3DSpellE>Cascetta-Haggkvist conjecture. This is the following problem: Given a graph D=3D (V,A), suppose each vertex has = outdegree k. Then D contains a directed cycle of length ≤ n/k (rounded up to an integer). Despite considerable research effort the general conjecture is still open.

· = My favourite mathematical theorem is the <= span class=3DSpellE>Farkas’ Lemma.

Publications

A mathematical analysis of the lifetime of OLSR networks, Jan-Maarte= n Verbree, Maurits de Graaf= and Johann Hurink, submitted to Med-Hoc-Net 2008.

R.J. Boucherie and M. de Graaf. An = average case analysis of the minimum spanning tree heuristic for the range assignme= nt problem. Memorandum, Department of Applied Mathematics, no. 1= 857, issn. 0169-2690 (200= 7) submitted to Annals of Applied probability).

M. de Graaf= and R.J. Boucherie and R. de = Haan and J.C.W. van Ommeren (with J.L. van den Berg, J.L. a= nd. Easy Wireless: broadband ad-hoc networking for emergency services. The Sixth = Annual Mediterranean Ad Hoc Networking Workshop, Corfu, Greece. Ionia= n University, p. 32-39, 2007.

T.J.M. Coenen and M. de Graaf and R.J. <= span class=3DSpellE>Boucherie. An upper bound on multi-hop wireless network performance. Proceedings International Teletraffic Congress, ITC-20 2007, Lecture Notes in Computer Science, 4516, issn. 0302-9743, p. 335-347.

M. de Graaf, Directed triangles in directed graphs, Discrete Mathema= tics 280 (1-3): 219-223 (2004)

M. de Graaf and A. Schrijver, Decompositions of gr= aphs on a surface, Journal of Combinator= ial Theory Series B, 70 (1997) 157-165.

M. de Graaf= and A. Schrijver, Making curve systems minimally crossing by= Reidemeister moves, Journal of Combinatorial Theory Series B, 70 (1997) 134-156.<= /p>

M. de Graaf= and A. Schrijver, Characterizing Homoto= py of Systems of Curves on a Compact Surface by Crossing Numbers, Linear Algebra and its applications<= /i>, 226 (1995) 519-52= 8.=

=

M. de Graaf= and A. Schrijver, Grid minors of graphs on the torus, Journal of Combinatorial Theory Series B= 61 (1994) 57-62

=

M. de Graaf, Edge-disjoint paths in graphs on surfaces. CWI Quarterly 6 (1993) 267-280

=

M. de Graaf= , A. Schrijver and P.D. Seymour, Directed triangles in dir= ected graphs, Discrete Math 110 (1992= ), 279--282.

=

PhD thesis

M. de Graaf, Graphs and curves on surfaces, thesis, Faculty of Mathematical scien= ces, University of Amsterdam, Amsterdam, The Netherlands, June 1994.<= /span>