Tuesday, April 22, 2014

dmanet Digest, Vol 74, Issue 21

Send dmanet mailing list submissions to
dmanet@zpr.uni-koeln.de

To subscribe or unsubscribe via the World Wide Web, visit
http://www.zaik.uni-koeln.de/mailman/listinfo/dmanet
or, via email, send a message with subject or body 'help' to
dmanet-request@zpr.uni-koeln.de

You can reach the person managing the list at
dmanet-owner@zpr.uni-koeln.de

When replying, please edit your Subject line so it is more specific
than "Re: Contents of dmanet digest..."


Today's Topics:

1. PhD position at LAMSADE, University Paris-Dauphine, Paris,
France (Vangelis Paschos)
2. Call for Participation: Workshop in honor of 65th birthday of
Tetsuo Asano (Yoshio Okamoto)
3. NetSys 2015: Call for Workshops and Tutorials (Andreas Paul)
4. PhD position at TU Berlin (Max Klimm)


----------------------------------------------------------------------

Message: 1
Date: Sun, 20 Apr 2014 14:24:12 +0200
From: Vangelis Paschos <paschos@lamsade.dauphine.fr>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] PhD position at LAMSADE, University Paris-Dauphine,
Paris, France
Message-ID:
<CAAvNmXqEKu03+tFSNHTtENp5mXEMdffCjBgvjDjf9eesP96vmA@mail.gmail.com>
Content-Type: text/plain; charset=ISO-8859-1

PhD position at LAMSADE, University Paris-Dauphine, Paris, France

An attractive PhD grant could be available at Laboratoire d'Analyse et
Mod?lisation de Syst?mes pour l'Aide ? la DEcision (LAMSADE), which is
a research center of the University Paris-Dauphine.
The position is within the Pole "Combinatorial Optimization,
Algorithms, Data" of LAMSADE and concerns "Stochastic Combinatorial
Optimization", one of the key thematics of the pole.

The successful candidates will obtain their PhD degree from the
University Paris-Dauphine.

Application must include:
- a curriculum vitae
- a motivation letter
- marks of the courses obtained by the applicant during the last two
years of her/his studies
- (optionally) support letters.

Applications must be sent by email to Cecile Murat and Vangelis
Paschos before Tuesday May 27, 2014.

To obtain further information please email
paschos@lamsade.dauphine.fr
murat@lamsade.dauphine.fr

Cecile Murat (murat@lamsade.dauphine.fr)
Vangelis Paschos (paschos@lamsade.dauphine.fr)

--
Vangelis Th. Paschos
LAMSADE, University Paris-Dauphine, CNRS and IUF
http://www.lamsade.dauphine.fr/~paschos/



------------------------------

Message: 2
Date: Tue, 22 Apr 2014 15:02:04 +0900
From: Yoshio Okamoto <okamotoy@uec.ac.jp>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] Call for Participation: Workshop in honor of 65th
birthday of Tetsuo Asano
Message-ID: <535605DC.5030601@uec.ac.jp>
Content-Type: text/plain; charset=UTF-8; format=flowed

*** Early Registration deadline (for SoCG) is May 10 ***.

++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
Workshop in honor of 65th birthday of Tetsuo Asano;
Growing Collaboration in Computational Geometry

in Computational Geometry Week 2014
Kyoto University, Japan. June 11 (Wed), 2014. 14:30-18:35

http://www.jaist.ac.jp/~otachi/tetsuo65/
++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++

This workshop aims to promote global collaboration in research on
computational geometry, bringing together researchers from diverse
geographic and academic areas, in celebration of the 65th birthday of
Tetsuo Asano. The workshop features scientific talks by top
researchers influenced by Tetsuo, demonstrating the importance of
cross-cultural collaborations, and looks ahead to future developments
and advances.

We have the following six invited talks in the workshop:
- Takeshi Tokuyama, A Mathematical Expedition into Zone Diagrams
- David Kirkpatrick, Efficient algorithms with small workspace:
shortest paths in grid graphs revisited
- John Hershberger, Geometric kth Shortest Paths: Life and Death in
the Parking Garage
- Danny Z. Chen, New Imaging Algorithms in Computational Geometry with
Applications
- Otfried Cheong, TBA
- Tetsuo Asano, Designing Algorithms with Limited Work Space

Registration is free for the registered participants of SOCG 2014.
Others should register from the SOCG webpage (1-day workshop
registration).
http://www.dais.is.tohoku.ac.jp/~socg2014/#registration

Organizers
- Takeshi Tokuyama (Tohoku University)
- Yota Otachi (JAIST)
- Yoshio Okamoto (University of Electro-Communications)
- Otfried Cheong (KAIST)


------------------------------

Message: 3
Date: Tue, 22 Apr 2014 09:38:56 +0200
From: Andreas Paul <andreas.paul@tu-cottbus.de>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] NetSys 2015: Call for Workshops and Tutorials
Message-ID: <53561C90.30105@TU-Cottbus.DE>
Content-Type: text/plain; charset=UTF-8; format=flowed

**** Apologies if you receive multiple copies of this message ****

========================================================================
CALL FOR WORKSHOPS AND TUTORIALS

NetSys 2015
2nd International Conference on Networked Systems
http://www.netsys2015.com

Cottbus, Germany, March 9-13, 2015
========================================================================

The Conference on Networked Systems (NetSys?15) provides an
international forum for engineers and scientists in academia, and
industry to discuss recent innovations in the realm of networked
systems - including aspects of distributed systems, networking,
communications, middleware, and applications.

NetSys?15 offers the opportunity for arranging work-shops and
presenting tutorials on current topics in networked systems at the
conference venue before and after the main conference.

*WORKSHOPS*

Workshops at NetSys?15 should provide a platform to present current
research activities on a special topic related to communications and
distributed systems. Workshops can be held on Thursday, March 12th,
2015 afternoon (half-day workshops) as well as Friday, March 13th, 2015
(half or full-day).

Workshop proceedings can be included in the conference proceedings
(archived in IEEE Xplore (R) - approval pending) if the workshop
organizers can meet the following criteria:

- Review process needs to be equivalent to the NetSys? reviewing
process, i.e.: 3 independent reviews per paper,
- TPC of the workshops need to be submitted with the workshop proposal
(only TPC members that have already been accepted to serve on the TPC
shall be named),
- Camera-ready papers need to be delivered at the same date as the main
conference papers and need to stick to the same formatting guidelines.

If an inclusion in the IEEE conference proceedings is not requested,
workshop organizers will be free to organize the acceptance / review
process for their workshops as well as their deadlines and submission
procedures without restriction.

*TUTORIALS*

The organizing committee of Netsys?15 invites proposals for tutorials
to be held on March 09th, 2015 in Cottbus.

*SUBMISSION GUIDELINES*

Detailed instructions for the submission of proposals for either
workshops or tutorials can be found online:

https://www.netsys2015.com/calls/call-for-workshops-tutorials/

--
------------------------------------------------------------------
Andreas Paul Computer Networks Group
Research Assistant Brandenburg University of Technology
Cottbus - Senftenberg

P.O.Box 10 13 44 Phone: +49 (0) 3 55 / 69 20 36
D-03013 Cottbus Fax: +49 (0) 3 55 / 69 21 27
GERMANY E-Mail: andreas.paul@tu-cottbus.de
------------------------------------------------------------------


------------------------------

Message: 4
Date: Tue, 22 Apr 2014 09:39:57 +0200
From: Max Klimm <klimm@math.tu-berlin.de>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] PhD position at TU Berlin
Message-ID: <53561CCD.1010104@math.TU-Berlin.DE>
Content-Type: text/plain; charset=windows-1252; format=flowed

Institute of Mathematics
Technische Universit?t Berlin

PhD position in Algorithms/Theory
with a focus on Graph Exploration and Algorithmic Game Theory.
Research Assistant (100% TV-L 13) for three years starting August 1,
2014, or later.

A PhD position is available in the ?Combinatorial Optimization and Graph
Algorithms Group" at TU Berlin (www.coga.tu-berlin.de), founded by the
newly established DFG Priority Programme "Algorithms for Big Data". The
task of the successful applicant is to develop new theoretical insights
and algorithms for the exploration of large graphs by teams of
cooperating and/or competing agents.

Candidates should have an excellent academic degree in mathematics,
computer science or a related area, and must have very good knowledge in
graph theory and algorithms. Experience in algorithmic game theory
and/or graph exploration is welcome. Good communication skills and solid
English writing skills are expected.

Besides its many cultural attractions, Berlin offers a strong scientific
landscape including three major universities, the international graduate
program BERLIN MATHEMATICAL SCHOOL
(www.math-berlin.de), promoted by the German Excellence Initiative, the
DFG research training group "Methods for Discrete Structures?
(www.math.tu-berlin.de/MDS) and the DFG research center MATHEON
(www.matheon.de); these offer opportunities for joint research and
support for PhD students and postdocs (e.g., meetings, lecture series,
summer schools etc.).

Applicants should send their application as *a single pdf* file
containing:
- cover and motivation letter
- curriculum vitae
- copies of diplomas
- short summary of thesis (max. 3 pages in English or German)
- names and contact details of two referees (including thesis advisor)

by
June 15, 2014
to
Yann Disser (disser@math.tu-berlin.de) or
Max Klimm (klimm@math.tu-berlin.de)



------------------------------

Subject: Digest Footer

_______________________________________________
dmanet mailing list
dmanet@zpr.uni-koeln.de
http://www.zaik.uni-koeln.de/mailman/listinfo/dmanet


------------------------------

End of dmanet Digest, Vol 74, Issue 21
**************************************

No comments:

Post a Comment