DMANET: DISCRETE MATHEMATICS AND ALGORITHMS: dmanet Digest, Vol 96, Issue 26

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 Positions in Experimental Algorithms (TU Berlin) (Yann Disser)
2. 2-year PostDoc Position in Optimization at Edinburgh
University (KALCSICS Joerg)
3. RANDOM / APPROX call for papers (Kim-Manuel Klein)

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

Message: 1
Date: Fri, 19 Feb 2016 11:19:09 +0100
From: Yann Disser <disser@math.tu-berlin.de>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] PhD Positions in Experimental Algorithms (TU Berlin)
Message-ID:
<1bf3906db5d98d8a6296fce6a428dd3e.squirrel@webmail.math.tu-berlin.de>
Content-Type: text/plain;charset=utf-8

Institute of Mathematics
TU Berlin

Two PhD positions in Experimental Algorithms
with a focus on algorithms for optimizing large real-world logistic networks.
Research Assistant (100% TV-L 13) for three years starting April 1, 2016,
or later.

Two PhD positions are available in the "Combinatorial Optimization and
Graph Algorithms Group" at TU Berlin (www.coga.tu-berlin.de) within the
project LogiScale, funded by the European Regional Development Fund
(ERDF). The objective in the project is to develop and analyze scalable
algorithms and data structures for multi-commodity flow optimization
problems in very large logistic networks, in close collaboration with our
industrial partner 4flow AG.

Candidates should have an excellent academic degree in mathematics,
computer science or a related area, and must have very good skills and
experience in programming and algorithm analysis. 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 Mathematics School, promoted by the German Excellence
Initiative, the research center MATHEON, and the Einstein Center for
Mathematics; 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
March 6, 2016
to
Yann Disser (disser@math.tu-berlin.de) or
Max Klimm (klimm@math.tu-berlin.de) or
Martin Skutella (skutella@math.tu-berlin.de)

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

Message: 2
Date: Fri, 19 Feb 2016 10:28:28 +0000
From: KALCSICS Joerg <Joerg.Kalcsics@ed.ac.uk>
To: "dmanet@zpr.uni-koeln.de" <dmanet@zpr.uni-koeln.de>
Subject: [DMANET] 2-year PostDoc Position in Optimization at Edinburgh
University
Message-ID:
<DB5PR05MB109461D5E3765C2A01915D9BB3A00@DB5PR05MB1094.eurprd05.prod.outlook.com>

Content-Type: text/plain; charset="iso-8859-1"

The following opportunity has arisen at the University of Edinburgh. Apart from the contact points provided, informal enquiries to joerg.kalcsics@ed.ac.uk<mailto:joerg.kalcsics@ed.ac.uk> are also welcome.

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

Postdoctoral Research Associate in Optimization

at the School of Mathematics, Edinburgh University

Salary: 31,656 to 37,768 GBP (U07 level)

For more information, see:

https://www.vacancies.ed.ac.uk/pls/corehrrecruit/erq_jobspec_version_4.jobspec?p_id=035541

Applications are invited for a 2-year postdoctoral position in the area of optimization with a particular focus on practical methods used in financial mathematics.

A successful candidate will join a team of four mathematicians:

Sergio García Quiles, Jacek Gondzio, Joerg Kalcsics and Sotirios Sabanis who bridge between the Edinburgh Research Group in Optimization http://www.maths.ed.ac.uk/ERGO/ and the Probability Group http://www.maths.ed.ac.uk/research/psa.

The project is funded by the EPSRC Impact Acceleration Account and Standard Life Investments http://www.standardlifeinvestments.com/

and initially will involve research in the area of optimization-based approaches for risk concentration measurement.

Its first step will involve using a tailored branch-and-bound procedure to solve an optimization problem which corresponds to identifying independent factors in a set of highly correlated assets.

Applicants will have completed a PhD in Optimization, or a related field of computational mathematics, and will demonstrate outstanding research potential. An ideal candidate will have a documented expertise and research record in combinatorial optimization techniques, provable understanding of probability and financial mathematics, and will demonstrate good programming skills. Prior experience in development of efficient optimization techniques such as tailored branch-and-bound and branch-and-cut algorithms would be an advantage.

Application Procedure:

All applicants should apply online.

Please upload a CV and a research statement under optional documents and arrange for at least two referees to send letters of recommendation

directly to hr@maths.ed.ac.uk<mailto:hr@maths.ed.ac.uk> by the closing date.

The closing date is 5pm GMT on 23 March 2015.

We anticipate interviews will be held on 28-29 April.

With best regards,

Sergio García Quiles,

Jacek Gondzio,

Joerg Kalcsics,

Sotirios Sabanis

----------------------------------------------
Joerg Kalcsics
Lecturer in Operational Research
School of Mathematics
University of Edinburgh

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

Message: 3
Date: Fri, 19 Feb 2016 11:38:44 +0100
From: Kim-Manuel Klein <kmk@informatik.uni-kiel.de>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] RANDOM / APPROX call for papers
Message-ID: <9aa4b8718a0016b933b9b3e36faf9666@informatik.uni-kiel.de>
Content-Type: text/plain; charset=UTF-8; format=flowed

RANDOM 2016 The 20th International Workshop on Randomization and
Computation
and
APPROX 2016 The 19th International Workshop on Approximation Algorithms
for Combinatorial Optimization Problems

http://cui.unige.ch/tcs/random-approx/

September 7-9, 2016
Institut Henri Poincaré, Paris

CFP - CALL FOR PAPERS
SCOPE:

The 20th International Workshop on Randomization and Computation
(RANDOM'2016) and the 19th International Workshop on Approximation
Algorithms for Combinatorial Optimization Problems (APPROX'2016) will
be held on September 7-9, 2016 at the Institut Henri Poincaré, Paris,
organized by IRIF (CNRS and Université Paris Diderot).
RANDOM'2016 focuses on applications of randomness to computational and
combinatorial problems while APPROX'2016 focuses on algorithmic and
complexity theoretic issues relevant to the development of efficient
approximate solutions to computationally difficult problems.

TOPICS:
Papers are solicited in all research areas related to randomization and
approximation, including but not limited to:

RANDOM:

* design and analysis of randomized algorithms
* randomized complexity theory
* pseudorandomness and derandomization
* random combinatorial structures
* random walks/Markov chains
* expander graphs and randomness extractors
* probabilistic proof systems
* random projections and embeddings
* error-correcting codes
* average-case analysis
* property testing
* computational learning theory

APPROX

* approximation algorithms
* hardness of approximation
* small space, sub-linear time and streaming algorithms online
algorithms
* approaches that go beyond worst case analysis
* distributed and parallel approximation
* embeddings and metric space methods
* mathematical programming methods
* spectral methods
* combinatorial optimization in graphs and networks
* algorithmic game theory, mechanism design and economics
* computational geometric problems
* approximate learning

IMPORTANT DATES:
Submissions deadline: TUESDAY, APRIL 19 , 2016
Notifications: Wednesday, June 22 ,2016
Camera ready: Friday, July 1, 2016

SUBMISSIONS:
Abstract Format: Electronic submissions are solicited. Please consult
the following servers:
For submission of APPROX papers:
http://www.easychair.org/conferences/?conf=approx2016 [1]
For submission of RANDOM papers:
http://www.easychair.org/conferences/?conf=random2016 [2]
Note: You will be asked to login using an EasyChair account.
Instructions on how to register for such an account are available at the
submission servers (you may also have an old account from a previous
conference submission).
The submission must be received by 15:00 (PDT) of April 19 for your
submission to be considered.
Submission Format: Submissions should start with the title of the paper,
each author's name, affiliation, and e-mail address, followed by a brief
abstract of the results to be presented. This should then be followed by
a technical exposition on single-spaced pages on letter-size paper,
using reasonable margins and at least 11-point font. The first 10 pages
should contain the main ideas and techniques used to achieve the results
including motivation and a clear comparison with related work (not
including the references). There is no page limit but any material
beyond the first 10 pages will be read at the sole discretion of the
program committee.
Simultaneous submission to other conferences with published proceedings
is not allowed.

PROCEEDINGS:
Accepted papers will be published in the online proceedings of the
conference in the Leibniz International Proceedings in Informatics
(LIPIcs) series, based at Schloss Dagstuhl. This guarantees perennial,
free and easy electronic access, while the authors retain the rights
over their work.

PROGRAM CHAIRS:
RANDOM
Chris Umans - Caltech email: umans@cms.caltech.edu
APPROX
Claire Matthieu – (CNRS and ENS Paris)
email: clairemmathieu@gmail.com
WORKSHOP CHAIRS:
José Rolim - University of Geneva
e-mail: jose.rolim@unige.ch
Klaus Jansen - University of Kiel
e-mail: kj@informatik.uni-kiel.de

PROGRAM COMMITTEES:
RANDOM 2016:
Chris Umans (Caltech, Chair)
Mahdi Cheraghchi (Imperial College, London)
Elena Grigorescu (Purdue)
Neeraj Kayal (MSR Bangalore)
Adam Klivans (Austin)
Swastik Kopparty (Rutgers)
Ravi Kumar (Google)
Dana Moshkovitz (MIT)
Ashwin Nayak (Waterloo)
Ryan O'Donnell (CMU)
Asaf Shapira (Tel Aviv)
Ronen Shaltiel (Haifa)
Alexander Sherstov (UCLA)
Thomas Thierauf (Aalen)
Eric Vigoda (Georgia Tech)

APPROX 2016:
Claire Mathieu (CNRS and ENS Paris, Chair)
Anna Adamaszek (University of Copenhagen)
Shiri Chechik (Tel-Aviv University)
Anne Driemel (TU Eindhoven)
Lee-Ad Gottlieb (Ariel University)
Varun Kanade (University of Oxford)
Nitish Korula (Google Research)
Stefano Leonardi (Sapienza University of Rome)
Daniel Lokshtanov (University of Bergen)
Nicole Megow (TU Munich)
Tobias Moemke (Saarland University)
Shayan Oveis Gharan (University of Washington)
Debmalya Panigrahi (Duke University)
Richard Georgia Peng (Institute of Technology)
Ely Bar Porat (Ilan University)
Adi Rosén (CNRS and Université Paris Diderot)
Adrian Vetta (McGill University)
Rico Zenklusen (ETH Zurich)