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. Ph.D. position, School of Computing, Clemson University
(Ilya Safro)
2. School on parameterized algorithms in Osaka (Rémy Belmonte)
3. Postdoc Position in Algorithms, TU Munich (Susanne Albers)
4. CFP: AAAC 2016 (Chung-Shou Liao)
5. Lectureship in Computer Science at Durham U., UK (Andrei Krokhin)
6. CFP: 27th International Conference on Probabilistic,
Combinatorial, and Asymptotic Methods for the Analysis of
Algorithms (Mark Daniel Ward)
7. EURO28: Optimization in Public Transport (Leo Kroon)
----------------------------------------------------------------------
Message: 1
Date: Wed, 20 Jan 2016 17:04:14 -0500
From: Ilya Safro <isafro@g.clemson.edu>
To: DMANET@zpr.uni-koeln.de
Subject: [DMANET] Ph.D. position, School of Computing, Clemson
University
Message-ID:
<CAF3gMM_HUSBzzg0sGeo8oiP4L+dJUA40QvEQsYAstyN8BKjs-w@mail.gmail.com>
Content-Type: text/plain; charset=UTF-8
We are looking for an excellent candidate for a Ph.D. position in the
School of Computing at Clemson University beginning Fall 2016. The
candidate will work under the supervision of Dr. Ilya Safro on
combinatorial scientific computing, and large-scale discrete optimization.
Some projects will include collaboration with national labs.
The ideal candidate should have a solid background in
- theoretical computer science, discrete mathematics, algorithms
- numerical methods (in particular, in linear algebra)
- C/C++
Some experience in the following areas will be considered as an advantage
(not mandatory)
- HPC and parallel programming/MPI/OpenMP/Hadoop
- multigrid
- scientific computing libraries (such as PETSc)
Please apply online at
http://www.clemson.edu/graduate/admissions/apply/application.html
The School of Computing has 42 faculty members, more than 400 undergraduate
majors, and over 200 graduate students collectively across its three
divisions: Computer Science, Visual Computing, and Human-Centered
Computing. Clemson University is located in Clemson, South Carolina, a
college town on beautiful Lake Hartwell at the foothills of the Blue Ridge
Mountains, conveniently situated within a 2hr drive from both Atlanta and
Charlotte. Clemson has an enrollment of approximately 20,000. U.S. News &
World Report has ranked Clemson in the Top 20 nationally among public
universities, and Clemson ranks number 5 among U.S. universities in
supercomputing.
--
Ilya Safro
School of Computing
Clemson University
http://www.cs.clemson.edu/~isafro
------------------------------
Message: 2
Date: Thu, 21 Jan 2016 14:49:13 +0900
From: Rémy Belmonte <remybelmonte@gmail.com>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] School on parameterized algorithms in Osaka
Message-ID:
<CANoQ38ari_tKi1okN3edJVNqgG752UWet_A09MNqmLzfgVaOCQ@mail.gmail.com>
Content-Type: text/plain; charset=UTF-8
Dear colleagues,
We are glad to invite you to the ELC School on Parameterized Algorithms
which will be held in Osaka, Japan, from March 17th until Sunday 20th,
2016. The lectures will cover introductory notions, accessible to
beginners, as well as more recent and advanced results.
The school is primarily intended for graduate students and young
researchers who wish to get acquainted with and further their knowledge of
this rapidly growing field.
Lecturers:
- Daniel Lokshtanov, University of Bergen, Norway,
- Michał Pilipczuk, University of Warsaw, Poland.
You can find more information at
http://www.al.ics.saitama-u.ac.jp/elc/blog/elc-school-on-parameterized, or
contact us at remybelmonte@gmail.com with any question you may have.
We hope you will be able to accept this invitation and attend the school,
and are looking forward to seeing you in Osaka!
Best regards,
Local organizers:
Rémy Belmonte
Naoki Katoh
------------------------------
Message: 3
Date: Thu, 21 Jan 2016 10:46:50 +0100
From: Susanne Albers <albers@in.tum.de>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] Postdoc Position in Algorithms, TU Munich
Message-ID: <mailman.2.1453460402.5172.dmanet@zpr.uni-koeln.de>
Content-Type: text/plain; charset=utf-8; format=flowed
Postdoctoral Position in Algorithms
TU Munich
A postdoctoral position in the area of efficient algorithms is available in
the research group of Prof. Susanne Albers, Department of Computer Science,
Technical University Munich (TU Munich).
The postdoc may pursue his/her own line of research but a research interest
in approximation and online algorithms, algorithmic game theory or algorithm
engineering is very welcome. More information about Susanne Albers and
the research group can be found at http://wwwalbers.in.tum.de/index.html.en
The position is supported by a grant of the German Research Foundation and
provides a competitive 12 month salary with standard benefits. The
appointment
is for a period of 12 months. The expected start date of the position is
summer/fall 2016.
The successful candidate should have a PhD degree in computer science or
mathematics. Furthermore, he/she should be interested in collaborating with
PhD students and participating in the teaching activities of the group.
The application material should include (1) a cover letter describing the
interest in the position, (2) a CV and list of publications, (3) a short
research summary, and (4) the names and contact information of at least
two references. The material should be sent electronically to
<albers@in.tum.de>.
Applications will be reviewed starting from February 20, 2016.
Susanne Albers
Department of Computer Science
Technical University Munich
Boltzmannstr. 3
85748 Garching (near Munich), Germany
E-mail: albers@in.tum.de
------------------------------
Message: 4
Date: Thu, 21 Jan 2016 22:01:27 +0800
From: Chung-Shou Liao <csliao@ie.nthu.edu.tw>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] CFP: AAAC 2016
Message-ID:
<CAJHuNBC6aGk3+ZtmdhrxUfd1AbPpfiU0W6-K2CbHVKXdeHvGMA@mail.gmail.com>
Content-Type: text/plain; charset=UTF-8
AAAC 2016
The 9th Annual Meeting of Asian Association for Algorithms and Computation
May 14-16, 2016, Taipei, Taiwan
FIRST CALL FOR PAPERS
----------------------------------------------------------------------
We invite submissions of abstracts presenting original research or surveys
in theoretical computer science.
TOPICS OF INTEREST
----------------------------------------------------------------------
All areas of theoretical computer science, especially design and analysis
of algorithms and complexity theory
SUBMISSION DETAILS
----------------------------------------------------------------------
Authors are invited to submit one-page (A4) abstracts (in pdf format) that
can be based on original results or survey of existing results. Informal
working notes including the one-page abstracts will be distributed at the
meeting, which does not prevent any form of future publication of the same
work. All submissions should be made electronically. Papers are now being
accepted through the EasyChair Conference System.
http://easychair.org/conferences/?conf=aaac2016
IMPORTANT DATES
----------------------------------------------------------------------
One-page abstract submission due: Feb 26, 2016
Notification: March 25, 2016
Early Registration due: April 1, 2016
Conference Dates: May 14(Sat)-16(Mon), 2016
KEYNOTE SPEECHES & TUTORIALS
----------------------------------------------------------------------
Keynote Speeches:
-------------------
Dorothea Wagner (Karlsruhe Institute of Technology, Germany)
Title: Route Planning Algorithms – New Results and Challenges
Fan Chung Graham (University of California, San Diego, USA)
Title: Higher Cheeger Inequalities and Clustering Algorithms
Tutorials:
-------------------
Ke Yi (The Hong Kong University of Science and Technology)
Title: Random Sampling in Database Systems: Techniques and Applications
Kai-Min Chung (Academia Sinica, Taiwan)
Title: Toward Cryptography for Modern Parallel Architecture
MEETING FORMAT
----------------------------------------------------------------------
The meeting consists of two keynote talks, two tutorials, and parallel
contributed talks, of which possibly 8-10 will be accepted as long talks.
20-30 minutes will be given to each accepted talk. The two tutorials will
be scheduled in the afternoons of May 14 (Saturday) and 16 (Monday),
respectively. Other talks start around 9 a.m. on May 15 (Sunday) and end
around 5 p.m. on 16 (Monday). There will be a welcome reception in the
evening of May 14 and a conference dinner banquet in the evening of May 15.
COMMITTEES
----------------------------------------------------------------------
Conference Chair:
Der-Tsai Lee (Academia Sinica, National Taiwan University)
Program Committee:
Hee-Kap Ahn (Pohang University of Science and Technology)
Leizhen Cai (The Chinese University of Hong Kong)
Mao-Cheng Cai (Institute of Systems Science)
Siu-Wing Cheng (The Hong Kong University of Science and Technology, Chair)
Otfried Cheong (Korea Advanced Institute of Science and Technology)
Francis Chin (The University of Hong Kong)
Kyung-Yong Chwa (Korea Advanced Institute of Science and Technology)
Xiaotie Deng (Shanghai Jiao Tong University)
Wen-Lian Hsu (Academia Sinica, co-Chair)
Xiaodong Hu (Chinese Academy of Sciences)
Kazuo Iwama (Kyoto University)
Sung Kwon Kim (Chung-Ang University)
Der-Tsai Lee (Academia Sinica, National Taiwan University)
Chung-Shou Liao (National Tsing Hua University, co-Chair)
Zhiyong Liu (Institute of Computing Technology)
Chi-Jen Lu (Academia Sinica)
Kazuhisa Makino (The University of Tokyo)
Kunsoo Park (Seoul National University)
Kunihiko Sadakane (The University of Tokyo)
Chuan-Yi Tang (Providence University, co-Chair)
Takeshi Tokuyama (Tohoku University)
Osamu Watanabe (Tokyo Institute of Technology)
Frances Yao (City University of Hong Kong)
Guochuan Zhang (Zhejiang University)
Hong Zhu (Fudan University)
Contact:
Chung-Shou Liao (National Tsing Hua University)
Additional (travel and accommodation) information can be found on the
conference webpage:
http://aaac2016.ie.nthu.edu.tw/
------------------------------
Message: 5
Date: Thu, 21 Jan 2016 16:39:57 +0000
From: Andrei Krokhin <andrei.krokhin@durham.ac.uk>
To: <dmanet@zpr.uni-koeln.de>
Subject: [DMANET] Lectureship in Computer Science at Durham U., UK
Message-ID: <mailman.3.1453460402.5172.dmanet@zpr.uni-koeln.de>
Content-Type: text/plain; charset="utf-8"; format=flowed
The School of Engineering and Computing Sciences at Durham University,
UK, invites applications for a Lectureship in Computer Science.
The School has a strong Algorithms and Complexity research group
(http://community.dur.ac.uk/algorithms.complexity/).
The academic position of Lecturer in the UK is equivalent to Assistant
Professor in the US.
For more information, see the official advert with application link
below (the application deadline is February 19th, 2016):
http://www.jobs.ac.uk/job/AMU711/lecturer-in-computer-science/
------------------------------
Message: 6
Date: Thu, 21 Jan 2016 09:20:35 -0500
From: Mark Daniel Ward <mdw@purdue.edu>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] CFP: 27th International Conference on Probabilistic,
Combinatorial, and Asymptotic Methods for the Analysis of Algorithms
Message-ID: <mailman.4.1453460402.5172.dmanet@zpr.uni-koeln.de>
Content-Type: text/plain; charset=utf-8; format=flowed
Dear Colleagues,
The CFP for the 27th International Conference on Probabilistic,
Combinatorial, and Asymptotic Methods for the Analysis of Algorithms is
available. The conference takes place July 4-8, 2016, in Krakow, Poland.
The conference website is here: http://www.aofa2016.meetings.pl/
It aims at studying discrete objects that appear as data structures or
algorithms (including graphs, networks etc.) by mathematical methods, in
particular by probabilistic, combinatorial and asymptotic methods.
Important dates:
Submission deadline: February 12, 2016.
Notification: April 22, 2016.
Final version: May 13, 2016.
Early registration: May 13, 2016.
Confirmed keynote speakers:
Jean Bertoin, Zurich Univ., Switzerland
Paweł Błasiak, Polish Academy of Sciences, Krakow, Poland
Hsien-Kuei Hwang, Academia Sinica, Taipeh, Taiwan
Bob Sedgewick, Princeton Univ., USA - FLAJOLET LECTURE
Wojtek Szpankowski, Purdue Univ., USA
Nick Wormald, Monash Univ., Australia
Scope. Analysis of algorithms is a scientific basis for computation,
providing a link between abstract algorithms and the performance
characteristics of their implementations in the real world. The general
effort to precisely predict the performance of algorithms has come to
involve research in analytic combinatorics, the analysis of random
discrete structures, asymptotic analysis, exact and limiting
distributions, and other fields of inquiry in computer science,
probability theory, and enumerative combinatorics. See:
http://aofa.cs.purdue.edu/
We invite papers in
• analytic algorithmics and combinatorics,
• probabilistic analysis of algorithms,
• randomized algorithms.
We also welcome papers addressing problems such as: combinatorial
algorithms, string searching and pattern matching, sublinear algorithms
on massive data sets, network algorithms, graph algorithms, caching and
memory hierarchies, indexing, data mining, data compression, coding and
information theory, and computational finance. Papers are also welcome
that address bridges to research in related fields such as statistical
physics, computational biology, computational geometry, and simulation.
------------------------------
Message: 7
From: Leo Kroon <lkroon@rsm.nl>
To: "'dmanet@zpr.uni-koeln.de'" <dmanet@zpr.uni-koeln.de>
Subject: [DMANET] EURO28: Optimization in Public Transport
Message-ID: <mailman.5.1453460402.5172.dmanet@zpr.uni-koeln.de>
Content-Type: text/plain; charset="iso-8859-1"
Second Call for Sessions and Papers within the Stream
===== Optimization in PUBLIC TRANSPORT =====
at the 28th EURO Conference
July 3-6, 2016 in Poznan, Poland
http://www.euro2016.poznan.pl/
Following the success of the Public Transport stream at the previous EURO conferences, EURO 2016 will again offer a stream "Optimization in Public Transport" organized by Leo Kroon and Anita Schöbel.
We are now looking for session organizers and for papers fitting in this stream.
Are you interested to organize a session of 4 talks within this stream?
This task involves choosing the specific topic, contacting speakers, and handling their submissions in the online system of the conference, to which you will get access then.
Usually, but not necessarily, the session organizer is also session speaker and/or session chair.
If you are interested, please let us know soon.
In case you want to present a paper within the stream, but do not want to organize a full session, please let us know as well.
We will be glad to send you a session code such that you may submit your paper in an invited session.
We are looking forward to a successful Public Transportation stream at EURO 2016 and to meeting you in Poznan!
Anita Schöbel
University of Göttingen
schoebel@math.uni-goettingen.de
Leo Kroon
NS Reizigers, and
Rotterdam School of Management
lkroon@rsm.nl
------------------------------
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 95, Issue 20
**************************************
No comments:
Post a Comment