Position for PhD student at TU Eindhoven (Netherlands)

[Otfried Cheong]

%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%                                                                    %
%                OPENING for a PhD POSITION                          %
%                                                                    %
%                         on the project                             %
%                                                                    %
%                Similarity of Graph Drawings			     %
%                                                                    %
%               at the TU EINDHOVEN (THE NETHERLANDS)                %
%                                                                    %
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%




PROJECT DESCRIPTION
-------------------

Computational geometry has studied the matching and analysis of
geometric shapes from a theoretical perspective, and developed
efficient algorithms measuring the similarity of geometric objects.
Two objects are similar if they do not differ much geometrically.  The
goal of this project is to extend and generalize this work to a model
where patterns are considered drawings of planar graphs, and to
develop algorithms measuring the similarity of graph drawings. This
will have to take into account not only the geometry of the shapes,
but also their topological or combinatorial structure.  Such a model
captures some practical pattern recognition problems better than a
purely geometric definition - recognizing logos, Egyptian
hieroglyphics, Chinese characters, or electronic components in a
circuit diagram are typical examples where this is the case.  The goal
of the project is to give suitable definitions for the similarity of
graph drawings, to find asymptotically efficient algorithms measuring
the similarity of two given drawings, and to design data structures
for storing large sets of graph drawings such that the one most
closely matching a given drawing can be retrieved quickly.



THE ALGORITHMS GROUP AT THE TU EINDHOVEN
----------------------------------------

The Algorithms group is a new research group at the TU Eindhoven,
established in late 2002.  One of the focal points of the group is
computational geometry.  The group consists of prof.dr. Mark de Berg,
dr. Otfried Cheong, dr. Bettina Speckmann (permanent staff members),
dr. Joachim Gudmundsson (postdoc), and Micha Streppel (PhD
student). It is expected that the group will grow in the future to
several postdocs and PhD students.

The webpage of the group is at "http://www.win.tue.nl/algo/"



THE CANDIDATE
-------------

The candidate should have a masters degree in computer science or
mathematics, with a firm background in algorithms.



BEING A PhD STUDENT IN THE NETHERLANDS
--------------------------------------

In the Netherlands, every PhD student gets paid a salary;
no additional grants are needed. Moreover, although PhD students
sometimes take courses, there is no minimum requirement.
Hence, PhD students are more like employees than like students.
Indeed, the Dutch word for PhD student translates to "research trainee".

The work of a PhD student may include assisting in courses
of BSc or MSc programs of the department. This amounts
to at most 20% of the time; the remaining time is spent on
research and research-related activities.

Foreign PhD students need not speak Dutch: it is easy to get by
with English, not only at the university but also in everyday life.



WE OFFER
--------

* A research position in a young, enthousiastic, and internationally
  oriented research group.
* A four-year position with an evaluation after one year.
* A salary of 1526 euro/month in the first year, increasing to 2063 euro/month
  in the final year.
* Well organized support for your personal development and career policy.
* Excellent fringe benefits: reimbursement of the PhD thesis' costs up to
  1800 euro, outstanding sporting facilities, children's day care, company
  savings.



MORE INFORMATION
----------------

If you want to know more about the project or how to apply, please
contact Otfried Cheong (o.cheong at tue.nl) or Mark de Berg
(m.t.d.berg at tue.nl).


====================================================================


-------------
The compgeom mailing lists: see
http://netlib.bell-labs.com/netlib/compgeom/readme.html
or send mail to compgeom-request at research.bell-labs.com with the line:
send readme
Now archived at http://www.uiuc.edu/~sariel/CG/compgeom/maillist.html.