Theory Announcements: March 2018

Saturday, March 31, 2018

[DMANET] Operations Research 2018: One month left to submit!

CALL FOR ABSTRACTS

Operations Research 2018

International Conference on Operations Research
Brussels, Belgium, September 12-14, 2018

https://www.or2018.be

Abstract submission deadline: April 30, 2018

We have the great pleasure to invite you to take part in the Operations
Research 2018 conference to be held in Brussels, Belgium, on September
12-14, 2018.

The Operations Research 2018 conference is the annual international
conference of the German Operations Research Society (GOR), co-organized
this year with the Belgian Operational Research Society (ORBEL) with the
support of Université libre de Bruxelles. OR2018 will take place from
September 12 to September 14, 2018 at the MCE Conference & Business
Centre in Brussels, Belgium.

CALL FOR ABSTRACTS AND SESSIONS

We invite practitioners and academics from mathematics, computer
science, business economics and other fields to participate at this
year's conference. The conference provides ample opportunities to
present all OR related topics containing both theoretical as well as
application-oriented research. Theoretical contributions mainly deal
with developing new mathematical techniques to solve all kind of
optimization problems. Practical applications may relate to all relevant
fields such as health care, transportation and logistics, finance, etc.
Following the format of recent years, the conference consists of plenary
and semi-plenary sessions as well as scientific sessions organized by
the streams announced at http://www.or2018.be/streams.

Please submit your abstract to one of these streams. Once your abstract
has been accepted, we provide the option to submit an extended abstract
for potential acceptance in Springer based conference proceedings.

Abstract submission system is available online, via the euro-online
system https://www.euro-online.org/conf/or2018.

Abstracts: max. 3000 characters; submission deadline: April 30, 2018.

Researchers who wish to organize an invited session should contact the
organizers of the relevant stream.

PLENARY SPEAKERS

- Ivana Ljubic, ESSEC Buisness School, France (EURO PLENARY SPEAKER)
- Holger Hoos, Leiden University, The Netherlands

IMPORTANT DATES

- Abstract submission opening: November 01, 2017
- Registration opening: April 15, 2018
- Abstract submission deadline: April 30, 2018
- Acceptance notification: May 30, 2018
- Early registration deadline: June 15, 2018
- First author registration deadline: June 30, 2018

COMMITTEES

Program Committee

- Bernard Fortz (Chair), Université libre de Bruxelles
- An Caris, UHasselt
- Yves Crama, Université de Liège
- Patrick De Causmaecker, KU Leuven
- Jan Fabian Ehmke, Otto-von-Guericke University, Magdeburg
- Alf Kimms, University Duisburg-Essen
- Natalia Kliewer, Freie Universität Berlin
- Martine Labbé, Université libre de Bruxelles
- Peter Letmathe, RWTH Aachen
- Stefan Nickel, KIT
- Anita Schöbel, University of Göttingen
- Jörn Schörnberger, TU Dresden
- Kenneth Sörensen, UAntwerp
- Frits Spieksma, TU Eindhoven
- Thomas Stützle, Université libre de Bruxelles

Organisation Committee

- Bernard Fortz (Chair), Université libre de Bruxelles
- Yves Crama, Université de Liège
- Jérôme De Boeck, Université libre de Bruxelles
- Guillerme Duvillié, Université libre de Bruxelles
- Martine Labbé, Université libre de Bruxelles
- Fränk Plein, Université libre de Bruxelles

CONTACT

Website: https://www.or2018.be
Email: or2018@euro-online dot org
Twitter: @OR2018Brussels
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

[DMANET] Post a call-fo-papers of ISAAC 2018

Title:
ISAAC 2018: call for papers

==============================================================
ISAAC 2018 - The 29th International Symposium on Algorithms and Computation

December 16-19, 2018

Jiaoxi, Yilan County, Taiwan

http://isaac2018.ie.nthu.edu.tw/
==============================================================

IMPORTANT DATES
-------------------------------------
Submission deadline: June 29, 2018 (Anywhere on Earth)
Acceptance notification: August 31, 2018
Camera-ready version: September 21, 2018
Early registration: October 5, 2018
Conference dates: December 16-19, 2018

CALL FOR PAPERS
-------------------------------------
The 29th International Symposium on Algorithms and Computation (ISAAC 2018)
will take place in Jiaoxi, Yilan County, Taiwan on December 16-19, 2018.
The symposium is intended to provide a forum for researchers working
in algorithms and theory of computation.

TOPICS
-------------------------------------
Papers presenting original research on all aspects of algorithms and
theory of computation are sought. The topics include, but are not limited
to:

Algorithmic game theory
Algorithms and data structures
Approximation algorithms
Combinatorial optimization
Computational biology
Computational complexity
Computational geometry
Cryptography
Experimental algorithmics
Graph drawing and graph algorithms
Internet algorithms
Online algorithms
Parallel and distributed algorithms
Quantum computing
Randomized algorithms

KEYNOTE SPEAKERS
-------------------------------------
Clifford Stein (Columbia University, USA)
Shang-Hua Teng (University of Southern California, USA)

SPECIAL WORKSHOP
-------------------------------------
In this year's ISAAC, we will organize a special workshop on Dec. 16
and invite several internationally renowned computer scientists
who were born in 1949 or earlier as special guest speakers.
The list of the invited speakers is as follows:

Tetsuo Asano (JAIST, Japan)
Fan Chung Graham (UC San Diego, USA)
Ronald Graham (UC San Diego, USA)
Leonidas Guibas (Stanford University, USA)
Kurt Mehlhorn (Max Planck, Germany)
Andrew Chi-Chih Yao (Tsinghua, Beijing, China)

SUBMISSIONS
-------------------------------------
Authors are invited to submit an extended abstract or full paper of at most
12 pages
(including references, but excluding the optional appendix). The submission
should
contain a scholarly exposition of ideas, techniques, and results, including
motivation
and a clear comparison with related work. Authors are encouraged to also
make
full versions of their submissions freely accessible in an online
repository such as
ArXiv, ECCC, etc. Papers must not be submitted simultaneously to another
conference
with refereed proceedings or to a journal. Drafts which contain essentially
the same
results as papers under review in other conferences or journals cannot be
submitted
to ISAAC 2018. At least one author of an accepted paper is required to
present
the paper at the conference as a registered participant. Only electronic
submission
will be allowed via Easychair at:
https://easychair.org/conferences/?conf=isaac2018

PROCEEDINGS
-------------------------------------
The ISAAC 2018 proceedings will be published in the Leibniz International
Proceedings
in Informatics (LIPIcs) series, based at Schloss Dagstuhl. Submissions
should be
formatted in the LIPIcs LaTeX style, which is available at:
http://drops.dagstuhl.de/styles/lipics-v2018/lipics-v2018-authors.tgz

Submissions failing to adhere to the guidelines will be rejected without
consideration
of their merits.

AWARDS
-------------------------------------
The Best Paper and the Best Student Paper will be awarded.
A paper is eligible for the Best Student Paper if all authors
are full-time students at the time of submission. To indicate
that a submission is eligible, please add the phrase
"Eligible for best student paper" in the web form on the
submission server as well as in the paper.

COMMITTEES
-------------------------------------
Conference Chair:
D. T. Lee (Academia Sinica, Taiwan)

Program Committee:
Sang Won Bae (Kyonggi University, Korea)
Mark Bun (Princeton University, USA)
Hubert Chan (The University of Hong Kong, Hong Kong)
Danny Chen (University of Notre Dame, USA)
Ho-Lin Chen (National Taiwan University, Taiwan)
Kai-Min Chung (Academia Sinica, Taiwan)
Leah Epstein (University of Haifa, Israel)
MohammadTaghi Hajiaghayi (University of Maryland, USA)
Wing-Kai Hon (National Tsing Hua University, Taiwan)
Seok-Hee Hong (University of Sydney, Australia)
Sun-Yuan Hsieh (National Cheng Kung University, Taiwan)
Wen-Lian Hsu (Academia Sinica, Taiwan, Co-Chair)
Zhiyi Huang (The University of Hong Kong, Hong Kong)
Giuseppe F. Italiano (University of Rome Tor Vergata, Italy)
Naonori Kakimura (Keio University, Japan)
Ralf Klasing (CNRS and University of Bordeaux, France)
Dieter Kratsch (Universite de Lorraine, Metz, France)
Minming Li (City University of Hong Kong, Hong Kong)
Yi Li (Nanyang Technological University, Singapore)
Chung-Shou Liao (National Tsing Hua University, Taiwan, Co-Chair)
Pinyan Lu (Shanghai University of Finance and Economics, China)
Kazuhisa Makino (Kyoto University, Japan)
Petra Mutzel (TU Dortmund University, Germany)
Jesper Nederlof (Technische Universiteit Eindhoven, Netherlands)
Evanthia Papadopoulou (Università della Svizzera italiana, Switzerland)
Kunsoo Park (Seoul National University, Korea)
Seth Pettie (University of Michigan, USA)
Marcin Pilipczuk (University of Warsaw, Poland)
Kunihiko Sadakane (The University of Tokyo, Japan)
Rahul Shah (Louisiana State University, USA)
Tetsuo Shibuya (The University of Tokyo, Japan)
Xiaoming Sun (Chinese Academy of Sciences, China)
Shin-ichi Tanigawa (The University of Tokyo, Japan)
Takeshi Tokuyama (Tohoku University, Japan)
Rob van Stee (University of Siegen, Germany)
Dorothea Wagner (Karlsruhe Institute of Technology, Germany)
Haitao Wang (Utah State University, USA)
Gerhard Woeginger (RWTH Aachen, Germany)
Prudence Wong (The University of Liverpool, UK)
Hsu-Chun Yen (National Taiwan University, Taiwan)
Huacheng Yu (Harvard University, USA)
Christos Zaroliagis (University of Patras, Greece)
Guochuan Zhang (Zhejiang University, China)

Organizing Co-Chairs:
Ho-Lin Chen (National Taiwan University, Taiwan)
Wing-Kai Hon (National Tsing Hua University, Taiwan)

Additional information (about the venue and travel) can be found on the
conference website at:
http://isaac2018.ie.nthu.edu.tw/

**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

[DMANET] Postdoctoral position at INRIA Lille - Nord Europe

Title: Optimization of the mining of transactions within the Ethereum blockchain.

Duration: 18 months.

Contact: bernard.fortz@inria.fr

Job environment and objectives.

The postdoctoral research will be carried out within the partnership of the INOCS team and the start-up company Utocat specialist in blockchain management.

The objective of this project is to optimize the mining of transactions within the Ethereum blockchain, both in terms of processing time and costs.

Based on historical data extracted from the blockchain, the research aims at answering the two following questions:

For a fixed fee, what is the maximum time limit for a transaction to be undermined?

For a fixed maximum time limit, what is the amount of costs to be allocated (gasPrice)?

The researcher will combine machine learning techniques and robust and two-level optimization techniques to model the problem and develop efficient algorithms to solve it.

Scientific environment

The postdoctoral research will be carried out within the partnership of the INOCS team and the start-up company Utocat.

The researcher will be supervised by Luce Brotcorne (INOCS) and Bernard Fortz (INOCS).

Frequent meetings will be organized with Utocat.

INOCS:

The primal goal of INOCS is the study (modeling and methodological concerns) of optimization problems involving complex structures (CS). The INOCS team focuses on integrated models for problems with (CS) taking into account the whole structure of the problem and the development of solution methods taking explicitly into account the nature and the structure of the decisions as well as the properties of the problem. More information at https://team.inria.fr/inocs/

Utocat:

Utocat was created in October 2014 by Clément Francomme to help merchants accepting bitcoin payments and converting it directly in euros. In 2015, Utocat joined the EuraTechnologies acceleration program and pivoted to propose Blockchainiz : the dedicated access platform for Banks and Insurance companies..

As a Platform As A Service (PAAS), Blockchainiz is a blockchain solution for financial services that accompanies projects up to the production stage. Blockchainiz connects the functional processes to the blockchain. Data is not replicated on different IT systems anymore. Blockchain is used as a common repository for every part of the process. Hence, it enables to

limit the typing errors, to optimize the costs and delays while the customer experience is improved. More information at: https://www.blockchainiz.io

Now, they develop a new product : Catalizr, a connector between bank, investor and company that enables the automation of the management of unlisted securities between these three actors and facilitates investment in very small businesses (TPEs) and SMEs via a completely digital and secure process in the blockchain.

More information at : https://www.utocat.com/fr

Skills

Candidates should hold a PhD degree in Operations research, mathematics, computer science, or similar fields and should ideally have a solid background in discrete optimization, integer programming, decomposition techniques. Computer science skills in algorithmic and C/C++ development as well as basic knowledge of machine learning techniques and blockchain technology are also welcome.

Knowledge of French is not required, but good communication skills and a solid knowledge of English are essential.

Contact. If you are interested by the position, please send your CV and a motivation letter to bernard.fortz@inria.fr.

Friday, March 30, 2018

[DMANET] 2nd announcement: Symposium on Discrete Mathematics 2018

2nd announcement:

Symposium on Discrete Mathematics 2018
TU Graz, June 15-16, 2018

The Symposium on Discrete Mathematics, the biannual meeting of the
Discrete Mathematics Section of the DMV (German Mathematical Society),
will take place on June 15-16 at Graz University of Technology.

Plenary Speakers

Laszlo Babai (University of Chicago)
Amin Coja-Oghlan (Goethe University Frankfurt)
Ioannis Emiris (NK University of Athens)
Penny Haxell (University of Waterloo)
Martin Skutella (TU Berlin)

Invited Speakers

Stefan Glock (University of Birmingham)
Christoph Koch (University of Oxford)
Maximilian Merkert (University Erlangen-Nürnberg)
Frank Mousset (Tel Aviv University)
Kevin Schewior (Universidad de Chile)
Benjamin Schröter (TU Berlin)
Rainer Sinn (FU Berlin)
Michael Wallner (University of Bordeaux)

On the occasion of the symposium, the Richard-Rado-Prize 2018 for a
dissertation in Discrete Mathematics will be awarded. The prize is
funded by a donation of Springer-Verlag.

Executive committee of the Discrete Mathematics Section:
Mihyun Kang, Volker Kaibel, Tibor Szabo, Thorsten Theobald

Local organization:
Mihyun Kang, Jochen Resch (IT support), Sandra Wissler
(administrative support)

For more information see
https://www.math.tugraz.at/comb/sdm2018/
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

[DMANET] SMT 2018 Call for Papers

*****************************************************************************

SMT 2018 - Call For Papers

16th International Workshop on Satisfiability Modulo Theories

July 12 - 13, 2018, Oxford, UK

Affiliated with IJCAR 2018, part of FLoC 2018

http://smt-workshop.cs.uiowa.edu/2018/

***************************************************************************

Background

=========

Determining the satisfiability of first-order formulas modulo background
theories, known as the Satisfiability Modulo Theories (SMT) problem, has
proven to be an enabling technology for verification, synthesis, test
generation, compiler optimization, scheduling, and other areas. The
success of SMT techniques depends on the development of both
domain-specific decision procedures for each background theory (e.g.,
linear arithmetic, the theory of arrays, or the theory of bit-vectors)
and combination methods that allow one to obtain more versatile SMT
tools. These ingredients together make SMT techniques well-suited for
use in larger automated reasoning and verification efforts.

Aims and Scope

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

The aim of the workshop is to bring together researchers and users of
SMT tools and techniques. Relevant topics include but are not limited to:

* Decision procedures and theories of interest

* Combinations of decision procedures

* Novel implementation techniques

* Applications and case studies

* Benchmarks and evaluation methodologies

* Theoretical results

Papers on pragmatic aspects of implementing and using SMT tools, as well
as novel applications of SMT, in particular in the areas of machine
learning and statistical reasoning, are especially encouraged.

Important dates

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

* Abstract submission deadline: April 8, 2018

* Paper submission deadline: April 15, 2018

* Notification of acceptance: May 15, 2018

* Camera ready versions due: June 15, 2018

* Workshop: July 12-13, 2018

Paper submission and Proceedings

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

Three categories of submissions are invited:

* Extended abstracts: given the informal style of the workshop, we
strongly encourage the submission of preliminary reports of work in
progress. They may range in length from very short (a couple of pages)
to the full 10 pages and they will be judged based on the expected level
of interest for the SMT community. They will be included in the informal
proceedings.

* Original papers: contain original research (simultaneous submissions
are not allowed) and sufficient detail to assess the merits and
relevance of the submission. For papers reporting experimental results,
authors are strongly encouraged to make their data available.

* Presentation-only papers: describe work recently published or
submitted and will not be included in the proceedings. We see this as a
way to provide additional access to important developments that SMT
Workshop attendees may be unaware of.

Papers in all three categories will be peer-reviewed. Papers should not
exceed 10 pages and should be in standard-conforming PDF. Technical
details may be included in an appendix to be read at the reviewers'
discretion. Final versions should be prepared in LaTeX using the
easychair.cls class file. (The 10 pages do not include the references.)

To submit a paper, go to the EasyChair SMT page
<http://www.easychair.org/conferences/?conf=smt2018> and follow the
instructions there.

Program Committee

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

* Erika Ábrahám (RWTH Aachen)

* Aws Albarghouthi (University of Wisconsin-Madison)

* Leonardo Alt (IBM)

* Maria Paola Bonacina (Università degli Studi di Verona)

* Bruno Dutertre (SRI International)

* Liana Hadarean (Synopsys)

* Guy Katz (Stanford University)

* Zachary Kincaid (Princeton University)

* Tim King (Google)

* Ruben Martins (Carnegie Mellon University)

* David Monniaux (VERIMAG)

* Alexander Nadel (Intel)

* Aina Niemetz (Stanford University)

* Marie Pelleau (Université Nice Sophia Antipolis)

* Andrew Reynolds (University of Iowa)

* Philipp Rümmer (Uppsala University)

* Thomas Sturm (CNRS)

* Margus Veanes (Microsoft Research)

Program Chairs

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

Rayna Dimitrova (University of Leicester)

Vijay D'Silva (Google Inc.)

*
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

[DMANET] WADT 2018 - 2nd Call for Papers

======================================================================
SECOND CALL FOR PAPERS – Submission is now open!

WADT 2018
24th International Workshop on Algebraic Development Techniques
http://wadt18.cs.rhul.ac.uk
July 2–5, 2018, Royal Holloway University of London, Egham, UK
======================================================================

AIMS AND SCOPE

The algebraic approach to system specification encompasses many aspects of the formal design of software systems. Originally born as a formal method for reasoning about abstract data types, it now covers new specification frameworks and programming paradigms (such as object-oriented, aspect-oriented, agent-oriented, logic and higher-order functional programming) as well as a wide range of application areas (including information systems, concurrent, distributed and mobile systems). The workshop will provide an opportunity to present recent and ongoing work, to meet colleagues, and to discuss new ideas and future trends.

TOPICS OF INTEREST

Typical, but not exclusive topics of interest are:
– Foundations of algebraic specification
– Other approaches to formal specification, including process calculi and models of concurrent, distributed, and cyber-physical systems
– Specification languages, methods, and environments
– Semantics of conceptual modelling methods and techniques
– Model-driven development
– Graph transformations, term rewriting, and proof systems
– Integration of formal specification techniques
– Formal testing and quality assurance, validation, and verification
– Algebraic approaches to cognitive sciences, including computational creativity

WORKSHOP FORMAT AND LOCATION

The workshop will take place over four days, Monday to Thursday, at Royal Holloway University of London in Egham, UK (https://www.royalholloway.ac.uk).
Presentations will be selected on the basis of submitted abstracts.

INVITED SPEAKERS

Artur d'Avila Garcez (City, University of London, UK)
Rolf Hennicker (LMU Munich, Germany)
Kai-Uwe Kühnberger (Osnabrück University, Germany)
Fernando Orejas (Technical University of Catalonia, Spain)

IMPORTANT DATES

Submission deadline for abstracts: April 27th, 2018
Notification of acceptance: May 18th, 2018
Early registration: June 1st, 2018
Final abstract due: June 1st, 2018
Workshop: July 2–5, 2018

SUBMISSIONS

The scientific programme of the workshop will include presentations of recent results or ongoing research as well as invited talks. The presentations will be selected by the Steering Committee on the basis of submitted abstracts according to originality, significance and general interest. Abstracts must not exceed two pages including references; if a longer version of the contribution is available, it can be made accessible on the web and referenced in the abstract.

Abstracts have to be submitted electronically via the EasyChair system at https://easychair.org/conferences/?conf=wadt18.

PROCEEDINGS

After the workshop, authors will be invited to submit full papers for the refereed proceedings. All submissions will be reviewed by the Programme Committee. Selection will be based on originality, soundness, and significance of the presented ideas and results. The proceedings will be published as a volume of Lecture Notes in Computer Science (Springer).

The deadline for submissions will be September 3, 2018, with notifications by October 29. Camera-ready versions will be required by November 11.

SPONSORSHIP

The workshop takes place under the auspices of IFIP WG 1.3.

WADT STEERING COMMITTEE

Andrea Corradini (Italy)
José Fiadeiro (UK) [co-chair]
Rolf Hennicker (Germany)
Hans-Jörg Kreowski (Germany)
Till Mossakowski (Germany)
Fernando Orejas (Spain)
Markus Roggenbach (UK)
Grigore Roșu (United States)

PROGRAMME COMMITEE

Paolo Baldan (Italy)
Andrea Corradini (Italy)
Artur d'Avila Garcez (UK)
Răzvan Diaconescu (Romania)
José Fiadeiro (UK) [co-chair]
Fabio Gadducci (Italy)
Reiko Heckel (UK)
Rolf Hennicker (Germany)
Alexander Knapp (Germany)
Barbara König (Germany)
Antónia Lopes (Portugal)
Narciso Marti-Oliet (Spain)
Till Mossakowski (Germany)
Fernando Orejas (Spain)
Leila Ribeiro (Brazil)
Markus Roggenbach (UK)
Pierre-Yves Schobbens (Belgium)
Lutz Schröder (Germany)
Pawel Sobocinski (UK)
Ionuț Țuțu (UK) [co-chair]
Martin Wirsing (Germany)

ORGANIZING COMMITTEE

Claudia Chiriță (UK)
José Fiadeiro (UK)
Ionuț Țuțu (UK)

CONTACT INFORMATION

Email: wadt18@cs.rhul.ac.uk
Homepage: http://wadt18.cs.rhul.ac.uk

**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

Thursday, March 29, 2018

[DMANET] PhD position in Computational Social Choice at TU Berlin

A PhD position is available in the research group of Prof. Markus Brill (www.algo.tu-berlin.de) at TU Berlin in Germany.

The position is for 3 years with the possibility of extension. The successful applicant will work within the DFG funded Emmy Noether project Foundations of Interactive Democracy (http://www.algo.tu-berlin.de/fid). The project has sufficient travel money available to support conference and workshop attendance as well as research visits to other groups internationally. There are no teaching obligations.

The main research themes of the group are computational social choice and algorithmic game theory. Therefore, applicants must have a strong background in discrete mathematics and algorithms. Research experience in (algorithmic) game theory and/or (computational) social choice is beneficial. Fluency in written and spoken English is required.

The starting date is negotiable; we are interested in filling the position as soon as possible. The position is full-time and paid according to salary grade 100% TV-L E 13 (the standard rate for junior scientific staff at German universities; salary depends on experience and amounts to at least 2200 Euro net per month).

Berlin has been repeatedly voted one of the world's most livable cities and offers a vibrant, creative, and international living environment. Berlin's scientific landscape with three leading universities offers plenty of collaboration opportunities, for example in the context of the Weizenbaum Institute for the Networked Society, the Einstein Center Digital Future, the DFG research center MATHEON, the Berlin Mathematical School (BMS), or the DFG research training group Facets of Complexity.

The official job advertisement (including application instructions) can be found at https://stellenticket.de/47445/

The deadline for applications is 4 May 2018.

For informal inquiries please contact Markus Brill.

[DMANET] Deadline extension: Symposium on Rail Transport Demand Management – RTDM 2018

Symposium on Rail Transport Demand Management – RTDM 2018
Strategies, Methods and Digitalization across all Disziplines
October 24th – 25th, 2018
Darmstadt, Germany

Scope and Topics
Efficient rail traffic management and high customer satisfaction do not
only need an optimization of train operations but also a control of
transport demand. Besides long-term and mid-term strategies to influence
the demand, e.g. by ticketing and pricing strategies, also short-term
measures are needed in cases of incidents to avoid overcrowded trains
and to guide passengers towards the most suitable connection. The
symposium addresses both, passenger and freight transport. The focus of
this symposium is on (but not limited to) the following
interdisciplinary topics related to Rail Transport Demand Management:

Collection of travel demand data
- Methods to model and forecast rail transport demand
- Methods and technologies to collect train occupancy data

Strategies and measures
- Strategies for long-term and mid-term control of demand
- Strategies for cases of incidents
- Pricing strategies, traveller information systems and other measures
to control demand
- Impacts of specific measures on demand
- Approaches to influence the decision-making behaviour of passengers

Acceptance of route suggestions
- Factors influencing the acceptance
- Modelling acceptance and traveller behaviour
- Influences of information quality and information media on acceptance
- Dependence of acceptance rates on traveller characteristics and
situation characteristics

Digital transformation in rail transport
- Big data driven innovation of business models
- Artificial intelligence, autonomous driving and their influence on demand

Data driven services
- Technological advances, value creation and benefits for demand management
- Information systems and their influence on demand

Target audience
The symposium addresses researchers and practitioners concerned with the
manifold aspects of rail transport demand management and interested in
discussing scientific and application-oriented approaches. Relevant
disciplines are transport planning, railway engineering, information
technology, economics, marketing, psychology and many others.
Politicians, managers and representatives of public authorities are
invited to benefit from the symposium as a platform for
knowledge-exchange and transfer. During the two-day symposium,
distinguished speakers will address selected interdisciplinary topics in
key notes. Designated innovative research and practice approaches will
be presented in 20-minute talks during parallel sessions. In addition,
the best overall contributions to the symposium will be awarded as
wellas the best (post-)graduate student contribution. Furthermore,
there is plenty of opportunity to network, especially at the symposium
dinner which will be hosted at the end of the first symposium day.

Call for Abstracts
We are pleased to announce the Call for Abstracts for this
interdisciplinary symposium jointly hosted by Technische Universität
Darmstadt and German Rail. RTDM 2018 will be held in Darmstadt, Germany.
The symposium will start at 10 a.m. on Wednesday October 24th, 2018 and
will continue until 4 p.m. October 25th, 2018 on Thursday.

Experts from research and practice with experience in the relevant
fields of rail transport demand management are invited to submit their
contributions. They are requested to submit a short abstract until 1st
April, 2018. Online submission is possible from January 31st, 2018
(www.rtdm2018.de). These short abstracts should contain no more than 500
words. The short abstracts will be reviewed by the Scientific Committee
by means of a single-blind procedure until May 31st, 2018. By this date,
the authors will be informed about the acceptance of their contribution.
For authors with accepted abstracts, symposium registration will be
requested by 30 June 2018 (early bird rate). The deadline for submission
of the extended abstracts, with a maximum length of 1500 words, is
September 15th, 2018. The language of the abstracts has to be English.

Templates and guidelines for submitting extended abstracts will be
available on the symposium website www.rtdm2018.de.

The selected extended abstracts will be made available for all attendees
in a symposium proceeding. On the symposium, a presentation by the
authors of selected abstracts is expected. We welcome submissions from
advanced experts in this field but at the same time encourage
(post-)graduate students to contribute to a successful symposium.

We are looking forward to receiving your outstanding abstract and having
the opportunity to welcome you in Darmstadt!

Registration and Fees
Online registration for the RTDM 2018 is possible from January 31st,
2018 up to September 30th, 2018 only through our website. The rates
below, covering all expenses incl. taxes, apply:

Target Group Early Bird Regular Late Bird
Students 100 € 150 € 200 €
Others 250 € 350 € 450 €

These rates do not include expenses for travel and accommodation.

The early bird discount is available until June 30th, 2018. The regular
rate is available until September 15th, 2018. The late bird rate applies
for registrations after this date and on site. For refunds before
September 30th, 2018 a fee of 85 € is charged. Please note that there
will be no refunding for cancellations after September 30th, 2018. We
accept payment by credit card and bank transfer.

Venue and Accommodation
The conference venue is the Maritim Konferenzhotel Darmstadt, centrally
located at the main railway station.

The Maritim Konferenzhotel offers single bed rooms as well as double bed
rooms.
Due to its central location you can also choose to stay in one of the
other hotels located nearby:

B&B Hotel (350 m) Zweifalltorweg 4,64293 Darmstadt
Best Western Plus Plaza Hotel (400 m) Am Kavalleriesand 6, 64293 Darmstadt
Intercity Hotel (550 m) Poststraße 12, 64293 Darmstadt
Ibis Hotel (1,0 km) Kasinostraße 4, 64293 Darmstadt

Chairmen of the Organisation Committee
Prof. Dr.-Ing. Manfred Boltze (Chair), Technische Universität Darmstadt,
Chair of Transport Planning and Traffic Engineering
Prof. Dr. Peter Buxmann (Co-Chair), Technische Universität Darmstadt,
Chair of Software Business & Information Management
Prof. Dr. Karsten Weihe (Co-Chair), Technische Universität Darmstadt,
Chair of Algorithmics

Scientific Committee
Prof. Dr. Kay W. Axhausen, Eidgenössische Technische Hochschule Zürich,
Institute for Transport Planning and Systems, Switzerland
Prof. Dr.-Ing. Manfred Boltze (Chair), Technische Universität Darmstadt,
Institute of Transport Planning and Traffic Engineering, Germany
Prof. Dr. Ralf Borndörfer, ZIB – Zuse Institut Berlin, Mathematical
Optimization and Scientific Information, Germany
Prof. Dr. Peter Buxmann (Co-Chair), Technische Universität Darmstadt,
Information Systems, Germany
Prof. Dr. Francesco Corman, Eidgenössische Technische Hochschule Zürich,
Institute for Transport Planning and Systems, Switzerland
Prof. Dennis Huisman, Erasmus University Rotterdam, Department of
Econometrics, The Netherlands
Prof. Dr. Eng. Bhargab Maitra, Indian Institute of Technology Kharagpur,
Civil Engineering Department, India
Prof. Dr.-Ing. Ullrich Martin, Universität Stuttgart, Institute of
Railway and Transportation Engineering, Germany
Prof. Dr. Fumihiko Nakamura, Yokohama National University, Faculity of
Engineering, Japan
Prof. Dr.-Ing. Andreas Oetting, Technische Universität Darmstadt,
Institute of Railway Engineering, Germany
Dr. Joaquim Rodriguez, IFSTTAR, Villeneuve d'Ascq Cedex, Evaluation of
Automated Transport Systems and their Safety Laboratory, France
Prof. Dr. Bernhard Schlag, Technische Universität Dresden, Chair of
Traffic and Transportation Psychology Germany
Prof. Dr. Anita Schöbel, Universität Göttingen, Institute for Numerical
and Applied Mathematics, Germany
Prof. Dr. Karsten Weihe (Co-Chair), Technische Universität Darmstadt,
Field of Algorithmics, Germany

Contact
Symposium on Rail Transport Demand Management RTDM 2018
Technische Universität Darmstadt
AG Connected Mobility
c/o Verkehrsplanung und Verkehrstechnik
Tobias Monzert
Otto-Berndt-Str. 2
64287 Darmstadt, Germany
Tel: +49 (0) 6151 16-22500
Fax: +49 (0) 6151 16-22502
E-Mail: rtdm@verkehr.tu-darmstadt.de
Web: www.rtdm2018.de

Prof. Dr. Ralf Borndoerfer

Zuse Institute Berlin, Optimization
Freie Universität Berlin, Mathematics
Takustrasse 7, 14195 Berlin, Germany
Fon: +49.30.84185-243
Sec: -209
Fax: -269
E-mail: mailto:borndoerfer@zib.de
WWW: http://www.zib.de/borndoerfer

[DMANET] CFP Computational Optimization

Call for Papers

11th International Workshop on Computational Optimization (WCO18)
Poznan, Poland, September 9-12, 2018

organized in the framework of FEDERATED CONFERENCE ON COMPUTER SCIENCE
AND INFORMATION SYSTEMS
FedCSIS - 2018

IEEE CS is a technical co-sponsor of FedCSIS 2018

https://fedcsis.org/2018/wco

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

We invite original contributions related to both theoretical and
practical aspects of optimization methods. The list of topics
includes, but is not limited to:

* combinatorial and continuous global optimization
* unconstrained and constrained optimization
* multiobjective and robust optimization
* optimization in dynamic and/or noisy environments
* optimization on graphs
* large-scale optimization, in parallel and distributed computational
environments
* meta-heuristics for optimization, nature-inspired approaches and any
other derivative-free methods
* exact/heuristic hybrid methods, involving natural computing
techniques and other global and local optimization methods

The applications of interest are included in the list below, but are
not limited to:

* classical operational research problems (knapsack, traveling salesman, etc)
* computational biology and distance geometry
* data mining and knowledge discovery
* human motion simulations; crowd simulations
* industrial applications
* optimization in statistics, econometrics, finance, physics,
chemistry, biology, medicine, and engineering.

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

Best paper award

The best WCO18 paper will be awarded during the social dinner of FedCSIS2018.
The best paper will be selected by WCO18 co-Chairs by taking into
consideration the scores suggested by the reviewers, as well as the
quality of the given oral presentation.

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

Submission and Publication

* Authors should submit draft papers in PDF format.
* The total length of a paper should not exceed 10 pages for regular
paper and 4 pages for short papers (IEEE style). IEEE style templates
are available at http://www.fedcsis.org/.
* Papers will be refereed and accepted on the basis of their
scientific merit and relevance to the workshop.
* Accepted and presented papers will be published in the Conference
Proceedings and included in the IEEE Xplore database and submitted for
different indexations (Communication and Position papers will only
appear in the conference proceedings).
* Extended versions of selected papers presented at WCO18 will be
published in edited books of the series "Studies of Computational
Intelligence", Springer.

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

Important dates:

Paper submission (sharp / no extensions) : May 10th, 2018
Position paper submission : May 15th, 2018
Author notification : June 12th, 2018
Final paper submission and registration : July 03, 2018
Conference date : September 9-12, 2018

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

Organizing Committee

Stefka Fidanova, Bulgarian Academy of Science, Bulgaria
Antonio Mucherino, IRISA, University of Rennes 1, France
Daniela Zaharie, West University of Timisoara, Romania

If you have any question do not hesitate to send an email to :
wco2018@fedcsis.org

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

--
Prof. Stefka Fidanova
IICT-BAS
Acad. G. Bonchev str. bl.25A
1113 Sofia Bulgaria
Ph. +359-2-9796642
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

[DMANET] CFP Numerical Search and Optimization

Dear Colleagues,

On behalf of the Organizing Committee, we invite you to participate in
the special session (workshop) on "Numerical Search and Optimization"
at the
9th Conference on Numerical Methods and Applications NM&A'18,
to be held 20-24 August 2018 in Borovets, Bulgaria.
The session is organized by:
Prof. Stefka Fidanova (stefka@parallel.bas.bg)
from the Institute of Information and Communication Technologies,
Bulgarian Academy of Sciences
Prof. Gabriel Luque (gabriel@lcc.uma.es) from University of Malaga, Spain, and
Prof. Kalin Penev, (kalin.penev@solent.ac.uk) School Media Arts and
Technology, Southampton Solent University, UK.

Topics

The list of topics includes, but is not limited to:

- unconstrained and constrained optimization
- combinatorial optimization
- global optimization
- multi-objective optimization
- optimization in dynamic and/or noisy environments
- large scale optimization
- Scalable search and optimization methods
- Scalable numerical tests
- parallel and distributed approaches in optimization
- random search algorithms
- adaptive search algorithms
- nature inspired optimization methods
- hybrid optimization algorithms involving natural computing
techniques and other global and local optimization methods
- optimization methods for learning processes and data mining
-classical operational research problems (knapsack, traveling salesman, etc)
-computational biology and distance geometry
-data mining and knowledge discovery
-human motion simulations; crowd simulations
-industrial applications
- computational optimization methods in statistics, econometrics,
finance, physics, medicine, biology, engineering etc

Proceedings
The refereed and presented papers will be published as a special
volume of Springer Lecture Notes in Computer Science (LNCS).

Important deadlines
Deadline for submission of abstracts
April 15, 2018
Notification of acceptance of the talks on the basis of the
submitted abstract
April 30, 2018
Deadline for submission of full papers
June 10, 2018
Notification of acceptance of full papers
July 10, 2018
Submission of accommodation forms
July 15, 2018
Final version of paper submission
September 30, 2018

Abstracts and contributed papers
The abstracts (up to 1 page stating clearly the originality of the
results) are to be written in standard LaTeX. The length of the
contributed papers is limited up to 8 pages. It is assumed that one
participant will present not more than one talk.

Send the abstracts to special session organizers and conference
organizers, indicating the name of the special session. After sending
the abstract go to the conference web page and fill in the
registration form (personal data of the participants, minimum one per
paper, and the name of the special session).

Paper submission, notification, and reviews will be realized through
the Springer OCS (Online Conference Service).
OCS for NM&A'18 is already set up on:

https://ocs.springer.com/ocs/home/NMA2018

Information about abstract and paper preparation, accommodation,
transportation, registration form and conference location you can find
at the conference web page http://nma18.fmi.uni-sofia.bg/

Special session organizers
Prof. S. Fidanova (stefka@parallel.bas.bg) , Institute of Information
and Communication Technologies, Bulgarian Academy of Science.
Prof. Gabriel Luque (gabriel@lcc.uma.es), University of Malaga, Spain.
Prof. Kalin Penev (penev@solent.ac.uk), School Media Arts and
Technology, Southampton Solent University, UK.

Wednesday, March 28, 2018

[DMANET] RANDOM / APPROX 2nd call for papers

Call For Papers:
RANDOM 2018 - The 22nd International Conference on Randomization and
Computation

and

APPROX 2018 - The 21st International Conference on Approximation
Algorithms for Combinatorial Optimization Problems

20-22 August, 2018

Princeton University, New Jersey

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

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

IMPORTANT DATES:

Submissions: April 20, 2018

Notifications: June 1, 2018

Camera ready: June 11, 2018

SCOPE:

The 22nd International Conference on Randomization and Computation
(RANDOM'2018) and the 21st International Conference on Approximation
Algorithms for Combinatorial Optimization Problems (APPROX'2018) will be
held on August 20-22, 2018 at Princeton University, New Jersey.
RANDOM'2018 focuses on applications of randomness to computational and
combinatorial problems while APPROX'2018 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
* Smoothed analysis
* Property testing
* Computational learning theory

APPROX
* Design and analysis of approximation algorithms
* Hardness of approximation
* Small space, sub-linear time and streaming algorithms
* Embeddings and metric space methods
* Mathematical programming methods
* Combinatorial problems in graphs and networks
* Algorithmic game theory and economics
* Computational geometric problems
* Approximate learning
* Online algorithms
* Approaches that go beyond worst-case analysis
* Other applications

SUBMISSIONS:

Abstract Format: Electronic submissions are solicited. Please consult
the following servers:

For submission of APPROX papers:
http://www.easychair.org/conferences/?conf=approx2018

For submission of RANDOM papers:
http://www.easychair.org/conferences/?conf=random2018

Note: You will be asked to login using an EasyChair account. Directions
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:00pm (PDT) of April 20th 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
one-paragraph summary 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. Further detail will be available early January at the
conference website. Previous proceedings of APPROX appeared as LNCS
1444, 1671, 1913, 2129, 2462, 2764, 3122, 3624, 4110 and 4627 while
previous proceedings of RANDOM appeared as LNCS 1269, 1518, 1671, 2129,
2483, 2764, 3122, 3624, 4110, and as Proceedings in Informatics 8.

PROGRAM CHAIRS:

RANDOM

Eric Blais
University of Waterloo, Canada
eric.blais@uwaterloo.ca

APPROX

David Steurer
Cornell University, USA
dsteurer@cs.cornell.edu

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

Eric Blais U. Waterloo
Joshua Brody Swarthmore College
Xi Chen Columbia U.
Gil Cohen Princeton and Tel Aviv U.
Andrew Drucker U. Chicago
Tom Gur UC Berkeley
Daniel Kane UCSD
Pravesh Kothari Princeton U. and IAS
Reut Levi Weizmann Institute
Aleksandar Nikolov U. Toronto
Lev Reyzin U. Illinois Chicago
Noga Ron-Zewi Haifa U.
Ron Rosenthal Technion
Atri Rudra U. Buffalo
Or Sheffet U. Alberta
Thomas Watson U. Memphis
Yuichi Yoshida NII

APPROX

Parinya Chalermsook Aalto U.
Alina Ene BU
Fabrizio Grandoni IDSIA
Anupam Gupta CMU
Pravesh Kothari Princeton U. and IAS
Lap Chi Lau U. Waterloo
Euiwoong Lee Simons Institute
James Lee UW
Edo Liberty Amazon
Yury Makarychev TTI
Neil Olver Amsterdam U.
Yuval Rabani HUJI
Tselil Schramm Harvard and MIT
Roy Schwartz Technion
Noah Stephens-Davidowitz Princeton U.
David Steurer ETH
Inbal Talgam-Cohen HUJI
Aravindan Vijayaraghavan Northwestern U.
Justin Ward Queens Mary U.
Tony Wirth Melbourne U.
Grigory Yaroslavtsev U. Indiana
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

[DMANET] [GECCO CFP] [GECCO 2018] Extended Deadline - hot off the press track

********** REVISED AND EXTENDED DEADLINE **********

************** FINAL CALL FOR PAPERS ***************

Hot Off the Press (HOP) track to be held as part of the

2018 Genetic and Evolutionary Computation Conference (GECCO 2018)

Kyoto, JAPAN

July 15-19, 2018

http://gecco-2018.sigevo.org/

Track URL:
http://gecco-2018.sigevo.org/index.html/tiki-index.php?page=Call%20for%20Hot%20Off%20the%20Press

IMPORTANT DATES

Submission Deadline: 3-Apr-18 (no further extensions)

Reviews Due: 6-Apr-18

Notification: 10-Apr-18

Camera-Ready: 17-Apr-18

*** DESCRIPTION ***

The Hot Off the Press (HOP) track offers authors of recent papers the

opportunity to present their work to the GECCO community, both by

giving a talk on one of the three main days of the conference and by

having a 2-page abstract appear in the Proceedings Companion, in which

also the workshop papers, late-breaking abstracts, and tutorials

appear. We invite researchers to submit summaries of their own work

recently published in top-tier conferences and journals. Contributions

are selected based on their scientific quality and their relevance to

the GECCO community. Typical contributions include (but are not

limited to) evolutionary computation papers appeared at venues

different from GECCO, papers comparing different heuristics and

optimization methods that appeared at a general heuristics or

optimization venue, papers describing applications of evolutionary

methods that appeared at venues of this application domain, or papers

describing methods with relevance to the GECCO community that appeared

at a venue centred around this methods domain. In any case, it is the

authors responsibility to make clear why this work is relevant for the

GECCO community, and to present the results in a language accessible

to the GECCO community.

*** ACCEPTANCE CRITERIA ***

* The HOP paper must be of significant interest to the GECCO

community for whatever reason.

* The HOP paper must have appeared in a well-respected journal or

conference proceeding. For journal publications, it suffices that the

paper is finally accepted and available on the publishers web page.

* The HOP paper must not have been published in its final form

earlier than 2017.

* The core of the paper must not have been presented at a GECCO

conference before.

*** PUBLICATION ***

Submitters to the HOP track have the choice between only giving a talk

at the conference or giving both a talk and having their abstract

appear in the GECCO Proceedings Companion. The track is equally happy

with both formats. Acceptance/rejection of the submission will only be

based on the acceptance criteria described above, not on the

submission type.

*** SUBMISSION ***

A submission that aims at becoming a 2-page paper in the GECCO

Proceedings Companion must follow relatively strict rules. It must

consist of the 2-page paper that shall appear in the proceedings and a

compulsory appendix with additional details. The paper part should

give a concise description of the main results of the work in a

language understood by the GECCO community. Where not obvious from the

result, the particular interest to the GECCO audience must be clearly

explained. The abstract of the 2-page paper must clearly indicate the

original paper it is based on. This part of the paper at the moment of

submission must be in the form the authors propose it to appear in the

Proceedings Companion. The compulsory appendix (which will be only

used for reviewing purposes) may contain any additional information

the authors want to give to the reviewers. It must contain a complete

description in what way the results have been presented at previous

GECCO conferences. It must also contain a direct link to the original

paper in PDF format. If the original paper appeared at a venue the

reviewers might be unfamiliar with, then an explanation of its

reputation is desirable. Any other arguments in favour of the paper

should be given as well. The appendix should be brief. Apart from

these rules, the same formatting rules apply as for the late-breaking

abstracts
(http://gecco-2018.sigevo.org/index.html/Call+for+Late-Breaking+Abstracts).

If authors of an original paper prefer to only present their result at

GECCO without a 2-page paper appearing in the Proceedings Companion,

then their submission does not need to follow the above

rules. However, still requires are (i) a short summary of the results

accessible to reviewers with a typical GECCO background, (ii) an

indication why the results are particularly interesting for the GECCO

audience, (iii) a declaration to what extent they have been presented

at previous GECCOs, (iv) and a link to the paper.

Link to the submission site:

https://ssl.linklings.net/conferences/gecco/

(select category "Hot Off the Press" in the submission form)

The submission deadline is Tuesday, March 27, 2018, 23:59 (Anywhere on

Earth), and the notification of acceptance is Tuesday, April 10, 2018.

*** COPYRIGHT ***

Submitters of a 2-page paper have to ensure that there is no copyright

conflict with the original submission. We do not expect greater

problems here. One the one hand, a HOP paper is an excellent

advertisement for the original paper, so it is clearly not in the

interest of a publisher to make HOP submissions difficult. On the

other hand, a good HOP submission, to optimally address the GECCO

audience with 2 pages only, in almost all cases will contain a

significant amount of new text. Nevertheless, it remains the authors'

duty to take care of the copyright situation. This includes the

reproduction of original artwork, for which a consent of the original

publisher might be required. Authors retain the copyright of the HOP

abstract, so there is no problem from the ACM or GECCO side.

*** ACCEPTED PAPERS AND PRESENTATIONS ***

At least one author of an accepted presentation or paper is required

to register for the conference (deadline to be announced) and present

the result at the conference.

*** MORE INFORMATION ***

For more information, contact the Hot Off the Press Chair, Grant Dick:

grant.dick@otago.ac.nz <mailto:grant.dick@otago.ac.nz>

[DMANET] Vacancy at University of Antwerp: optimization methods for on-demand planning of public buses

The University of Antwerp Operations Research Group (ANT/OR) is hiring at
least two full-time researchers on the topic of "optimization methods for
on-demand planning of public buses". Both pre-doctoral and post-doctoral
researchers can apply.

These vacancies are part of a research project called "the future of pubic
transport: towards a fully on-demand public bus system". Even though many
obstacles still need to be overcome, the ubiquity of mobile devices would
for the first time in human history allow for a large-scale shift to
on-demand public transport. However: the operational and tactical
foundations that are required to implement an on-demand transportation
system are still lacking. Even though a large majority of people now has
the technological means to determine exactly where they are and transmit
exactly where they want to go, the tools to plan all of these
transportation requests have not been developed. Such a system would demand
carrying out optimization on a scale never seen before, and will require
not only modelling all the intricacies of an on-demand scheduling of
passengers, but to develop new optimization algorithms and software
components that can coordinate such a massive fleet of vehicles and vast
number of passengers. The development of these algorithms and software
components is the main aim of this project.

The ideal candidate has a master's degree in computer science, mathematics,
statistics, civil/business engineering or other related field of study.
He/she has a strong background in operations research and statistics,
computer simulation, as well as excellent programming and software
development skills, and an excellent command of the English language.
Previous experience with (meta)heuristic algorithms, discrete event
simulation, and statistical modelling/analysis is highly valued.
Post-doctoral applicants should have obtained a relevant PhD recently.

For pre-doctoral candidates, the successful candidate will receive a
tax-free scholarship (of approximately 1900 euros per month) for a 4-year
period, subject to yearly evaluation. He/she will enroll in the doctoral
program of the Faculty of Applied Economics (Department of Engineering
Management) and is expected to obtain a PhD degree by the end of the fourth
year. There is a sizeable budget available for attending international
conferences, advanced workshops and other courses. Although the focus of
the position is mainly on research, the candidate might be asked to take
part in some teaching activities. Post-doctoral candidates may be hired for
shorter periods of time and will receive a somewhat higher wage.

The ANT/OR <http://antor.uantwerpen.be> research group is a young and
dynamic team that focuses on the development of optimization methods to
solve decision-making problems in a wide variety of fields, ranging from
logistics and supply chain, transportation and production planning, to
humanitarian logistics and digital music. The group works in close
collaboration with several industrial partners, non-profit organizations
and other international research institutions. The University of Antwerp
<https://www.uantwerpen.be/en/> is home to around 20,000 students, of which
18% come from overseas. It is currently ranked number 10 in the "top 50
under 50", i.e., universities in the world less than 50 years old. Antwerp
<https://www.youtube.com/watch?v=gYcuYIKiGyU> is the second largest city in
Belgium. It has one of the busiest ports in Europe and is the largest
diamond trade centre in the world. This vibrant city is famous for its
history, fashion industry, delicious food (beer, chocolate, fries, waffles
,…) and excellent quality of life.

Interested? Then please send the following documents (in a single zip file
with your full name as the filename) by email to
kenneth.sorensen@uantwerpen.be: (1) a motivation letter, (2) a one-page
document describing your views on the topic of "models and methods for
on-demand planning of public buses", and (3) a detailed CV. The deadline
for application is May 31, 2018. You might be invited for an interview
(either through videoconferencing, or in person) during the month of June
2018. The expected starting date is 1 October, 2018, but this is negotiable.

For more information about this position, you are welcome to contact
Kenneth Sörensen (kenneth.sorensen@uantwerpen.be).

[DMANET] junior teaching position at VU Amsterdam

Junior Lecturer in Business Analytics and/or Data Science at VU Amsterdam

The Department of Mathematics of the Faculty of Science, Vrije Universiteit Amsterdam, is looking for a Junior Lecturer in Business Analytics and/or Data Science. The position may specifically be of interest for candidates with affinity for education. Candidates that are about to finish a PhD or Master degree are also welcome to apply.

For more information, please visit:

https://www.vu.nl/en/employment/vacancies/2018/18097juniorlecturerjuniordocentinbusinessanalyticsandordatascience.aspx

Tuesday, March 27, 2018

[DMANET] Postdoc positions in TCS at KTH Royal Institute of Technology

The Theory Group at KTH Royal Institute of Technology invites applications for postdoctoral positions in theoretical computer science.

KTH Royal Institute of Technology is the leading technical university in Sweden. The Theoretical Computer Science Group at KTH (http://www.kth.se/tcs) offers a strong research environment spanning a wide range of research topics such as complexity theory and approximation algorithms, computer and network security, cryptography, formal methods and natural language processing. We have one of Europe's most prominent groups in algorithms and complexity theory, and the research conducted here has attracted numerous international awards and grants in recent years.

The postdoc positions are in the area of computational complexity theory. Current research in the group focuses mostly on approximation algorithms/hardness of approximation, subexponential algorithms, and proof complexity, but excellent researchers in neighbouring areas such as, e.g., communication complexity, circuit complexity, algebraic complexity, and harmonic analysis are also warmly welcome to apply.

This research project is led by Johan Hastad, Per Austrin, and Jakob Nordstrom, and is financed by grants from the Knut and Alice Wallenberg Foundation, the European Research Council, and the Swedish Research Council.

In addition to the PIs, the research project is planned to involve a total of 4-5 postdocs and 4-5 PhD students. Thus, this will be a unique opportunity to explore new connections between different subareas of complexity theory within a vibrant and growing research environment.

Within the overall framework sketched above, the postdoc will be expected and encouraged to contribute to and influence the research agenda. Taking part in teaching graduate seminar courses is encouraged but not required. Travel funding is included, and the group also receives short-term and long-term visitors on a regular basis.

These postdoc positions are full-time employed positions for one year with a possible (and expected) one-year extension. The expected starting date is in August-September 2018, although this is to some extent negotiable.

The application deadline is April 22, 2018. See http://apc.eecs.kth.se/J-2018-0433-Eng.php for the full announcement with more information and instructions for how to apply. Informal enquiries are welcome and may be sent to apc@csc.kth.se.

[DMANET] PhD positions in TCS at KTH Royal Institute of Technology

The Theory Group at KTH Royal Institute of Technology invites applications for PhD positions in theoretical computer science.

The PhD positions are in the area of computational complexity theory, focusing on questions at the intersection of approximation algorithms, subexponential algorithms, and proof complexity. Examples of topics of particular interest are the use of linear and semidefinite programming to solve hard combinatorial problems, or of proof complexity to prove that the problems are beyond the reach of such methods. Exciting recent developments have identified the so-called sums of squares hierarchy as a unifying theme for these questions, and one aim of our research is to build and expand on this theme. However, we will also freely explore whatever other methods turn out to be helpful for attacking these and other topics of interest in algorithms and complexity theory. The overarching goal is to understand fundamental properties of efficient computation by proving mathematical theorems about the power and limitations of different computational models.

In addition to the PIs and the announced PhD positions, the research project will also involve 3-4 existing PhD students and 4-5 postdocs. Thus, this will be a unique opportunity to explore new connections between different subareas of complexity theory within a vibrant and growing research environment.

These are four-year full-time employed positions, but PhD positions usually (though not necessarily) include 20% teaching, in which case they are prolonged for one more year. The successful candidates are expected to start at the latest in August-September 2018, although this is to some extent negotiable. The positions are fully funded and come with a competitive salary.

The application deadline is April 22, 2018. See http://apc.eecs.kth.se/J-2018-0292-Eng.php for the full announcement with more information and instructions how to apply. Informal enquiries about this position are welcome and may be sent to apc@csc.kth.se .

[DMANET] Summer School on Algorithms and Lower Bounds - July 6-9, 2018 - Prague, Czech Republic

Summer School on Algorithms and Lower Bounds 2018

The program of the school will consist of two tutorial series related to
algorithms and lower bounds. The problems addressed are related by
fine-grained complexity. The school will run from Friday to Sunday with a
follow-up workshop on Monday afternoon. The workshop is a satellite ICALP
workshop devoted to presentations of own research by selected participants
of the school. We expect the talks to include a fair amount of technical
details. The school will also include plenty of time for discussions.

Tutorial speakers

Barna Saha (University of Massachusetts Amherst): Algorithms for edit distance and related problems
Omri Weinstein (Columbia University): Data structure lower bounds

Date and location

Date: July 6-9, 2018, lectures start on Friday morning and end by the afternoon
session on Sunday.

Location: Sporthotel Brve Hostivice (near Prague, Czech Republic)

The follow-up workshop will take place at Charles University in Mala Strana on
Monday afternoon, July 9, 2018.

Organizers (contact person): Michal Koucky (Charles University).

Participation

We expect about 45 participants. A limited amount of funding is available
to support the stay of junior participans at the school. Interested
graduate students and postdocs are invited to apply to attend the school
by April 20, 2018. They should send their name, affiliation, status
(student/postdoc) by email to koucky@iuuk.mff.cuni.cz and arrange with
their supervisor to send a supporting letter to the above address.
Questions should be directed to the same address.

Web-page: http://iuuk.mff.cuni.cz/~koucky/LBCAD/lwbds-school-2018.html
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

[DMANET] 12 Research Positions available within the Marie-Curie ITN MINOA on mixed-integer non-linear optimisation

The MINOA (Mixed-Integer Non-Linear Optimisation: Algorithms and
Applications) consortium is seeking highly motivated and qualified
Early-Stage Researchers (ESRs) that are looking for obtaining a PhD
degree in applied mathematics, operations research, and computer
science.

Once recruited, you will study relevant applications in areas such as
energy, logistics, engineering, analytics, and natural sciences. You
will be trained through an innovative training programme based on
individual research projects motivated by these applications. As special
challenges, you will work on dynamic aspects and optimisation in real
time, optimisation under uncertainty, multilevel optimisation or on
non-commutativity in quantum computing.

More information can be found here:

http://admin.euraxess.org/jobs/291084
www.minoa-itn.fau.de

[DMANET] Faculty Positions in Computer Science at NIIT University, Rajasthan, India

NIIT University, Neemrana, Rajasthan, India invites applications for faculty positions in Computer Science and Engineering. Candidates in all areas of Computer Science and Engineering may apply but those with specialization in the areas of AI, Computer Security, Cloud Computing, Data Sciences, Information Security, Data Analytics will be given preference. Positions remain open until filled.

Candidates must have earned (or expect shortly) a Ph.D for Assistant Professor, Ph.D with 6 years of experience for Associate Professor, Ph.D with 10 years of experience for Professor in the above disciplines. Candidates must have a good publication record; proven ability to establish an independent research program; demonstrate flair for innovation; be open to participate in developing new interdisciplinary programs of study; have the commitment to excel both in research and teaching and establish strong linkages with industry. Industry experience and/or post-doctoral experience will be considered an asset.

The NIIT University campus is nestled in the Aravalli range in Rajasthan, considered to be the oldest fold mountain range in the world. The University is located about 100 Kms from New Delhi Airport. The University provides an intellectual environment and is committed to academic excellence. The four core principles of NIIT University, namely, Industry-linked, Research-driven, Technology-based, and Seamless define the DNA of the University. For more information, please visit the university website www.niituniversity.in

NIIT University offers a competitive compensation at par with the best academic institutions in India. In addition, NU provides a start up research grant at the time of joining, travel support for presenting papers in reputed International Conferences and Workshops. NU provides research incentives, such as monetary award for refereed Journal publications. In line with the Industry-linked as a core principle, the university will enable faculty to consult with industry in India and abroad.

Interested applicants are invited to submit their curriculum vitae including employment history, a statement outlining research and teaching interests, list of consultancies and projects undertaken and names of at least three referees.

Applications may be sent electronically in PDF format to
HR Manager, ritwik.rituraj@niituniversity.in or the
Area Director, prosenjit.gupta@niituniversity.in

Phone: +91-9251083130

NIIT University is committed to principles of fair employment & is an equal opportunity employer. We will extend equal opportunity to all individuals based on merit without regard for race, religion, sex, national origin or age.

Visit us at: http://www.niituniversity.in
-------------------------------------------------------------------------------------------------------------
DISCLAIMER This email and any files transmitted with it are confidential and are solely for the use of the individual or entity to which it is addressed. Any use, distribution, copying or disclosure by any other person is strictly prohibited. If you receive this transmission in error, please notify the sender by reply email and then destroy the message. Opinions, conclusions and other information in this message that do not relate to official business of the company shall be understood to be neither given nor endorsed by NIIT University. Any information contained in this email, when addressed to Clients is subject to the terms and conditions in governing client contract.

[DMANET] PhD position in Algorithms

Universität Hamburg invites applications for a Research Associate in accordance with Section 28 subsection 1 of the Hamburg higher education act (Hamburgisches Hochschulgesetz, HmbHG). The position commences on June 1th, 2018.

It is remunerated at the salary level TV-L 13 and calls for 100% of standard work hours per week.*

The fixed-term nature of this contract is based upon Section 2 of the academic fixed-term labor contract act (Gesetz über befristete Arbeitsverträge in der Wissenschaft, WissZeitVG). The initial fixed term is three years.

The University aims to increase the number of women in research and teaching and explicitly encourages women to apply. Equally qualified female applicants will receive preference in accordance with the Hamburg act on gender equality (Hamburgisches Gleichstellungsgesetz, HmbGleiG).

Responsibilities:
Associates will be expected primarily to teach and conduct research. The associate will also have the opportunity to pursue further academic qualifications, in particular a doctoral dissertation. At least one-third of set working hours will be made available for the associate's own academic work.

Specific Duties:
The working area of Petra Berenbrink is the analysis of randomised algorithms and processes. The job holder is free to choose her/his research area. The teaching load is 4 LVS (4 hours per week).

Requirements:
A university degree in a relevant field.

Severely disabled applicants will receive preference over equally qualified non-disabled applicants.

For further information, please contact Prof. Dr. Petra Berenbrink,
petra.berenbrink@informatik.uni-hamburg.de <mailto:petra.berenbrink@informatik.uni-hamburg.de> or consult our website at www.inf.uni-hamburg.de/de/inst/ab/art.html <http://www.inf.uni-hamburg.de/de/inst/ab/art.html>.

Applications should include a cover letter, curriculum vitae, and copies of degree certificate(s). The application deadline is April 30th, 2018. Please send applications to: University of Hamburg, Department of Computerscience, Arbeitsbereich ART, Prof. Dr. Petra Berenbrink, Vogt-Kölln-Straße 30, 22527 Hamburg, or Berenbrink@informatik.uni-hamburg.de <mailto:Berenbrink@informatik.uni-hamburg.de>.
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

[DMANET] [Call for Papers] RSFF'18 - Robust Solutions for Fire Fighting

======================================================================
RSFF'18: Second Call for Papers
======================================================================

International workshop on
ROBUST SOLUTIONS FOR FIRE FIGHTING

July 19-20, 2018, L'Aquila, Italy

http://geosafe.univaq.it

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

RSFF (Robust Solutions for Fire Fighting), is an international workshop
that intends to be a platform of exchange between researchers and
practitioners interested in emergency management, in particular bushfires.
The workshop welcomes participation of researchers from the area of
algorithms and practitioners both working on emergency management issues.

The main focus of the workshop is robustness, seen as an approach
to simplifying and securing solutions with the aim of making processes
less affected by disruptions.

The workshop is organized within the Work Package WP3 of the European
Project GEOSAFE (H2020-MSCA-RISE project n. 691161).

Registration is free for all GEOSAFE members and for authors of the
accepted papers.

TOPICS
===================

Solicited contributions cover a variety of topics including but not limited to:

Analysis of Algorithms
Approximation Algorithms
Combinatorial Optimization
Diffusion and Propagation Models
Disaster Management
Distributed and Parallel Algorithms
Emergency OR
Evacuation Models
Exact and Parameterized Algorithms
Heuristics and Metaheuristics
Integer Programming
Inverse Combinatorial Optimization
Mathematical Programming
Multiple Criteria Decision Making
Network Algorithms
Online Algorithms
Probabilistic Combinatorial Optimization
Randomized Algorithms
Robust Optimization
Simulation
Stochastic Optimization
Wildfire Management

SUBMISSION
===================

Submitting papers:

RSFF papers must be formatted according to the CEUR-WS one column style,
with a maximum length of 12 pages, including figures and references.
All proposed papers must be submitted in electronic form, in PDF format,
via the submission.geosafe@univaq.it mail.

Review process:

RSFF welcomes the submission of original research papers not published
elsewhere relevant to the topics listed in the call for papers. All
submitted papers will undergo a thorough review process.
Each contribution will be refereed by at least two experts in the field.

Publication:

Accepted papers will be included in the RSFF Proceedings published on
the CEUR-WS website. At least one of the authors will be required to
register and attend RSFF to present the paper in order to have it
included in the workshop proceedings.

IMPORTANT DATES
===================

Paper submission deadline : April 29th, 2018

Notification of acceptance : June 1st, 2018

Camera ready papers : June 15th, 2018

Registration : June 22nd, 2018

Workshop dates : July 19-20th, 2018

PROGRAM COMMITTEE
===================

Christian Artigues - LAAS-CNRS - FRANCE
Serafino Cicerone - University of L'Aquila - ITALY
Marc Demange - RMIT - AUSTRALIA
Gabriele Di Stefano - University of L'Aquila - ITALY (co-Chair)
Leszek Gasieniec - University of Liverpool, UNITED KINGDOM
Cecile Murat - Paris Dauphine University - FRANCE
Alfredo Navarra - University of Perugia - ITALY (co-Chair)
Petrica Pop Sitar - Technical University of Cluj-Napoca, ROMANIA
Pierpaolo Vittorini - University of L'Aquila - ITALY

CONTACTS
===================

Gabriele Di Stefano - University of L'Aquila - ITALY
Alfredo Navarra - University of Perugia - ITALY
Pierpaolo Vittorini - University of L'Aquila - ITALY

Email: RSFF18.geosafe@univaq.it
Web: http://geosafe.univaq.it

Theory Announcements

Saturday, March 31, 2018

[DMANET] Operations Research 2018: One month left to submit!

[DMANET] Post a call-fo-papers of ISAAC 2018

[DMANET] Postdoctoral position at INRIA Lille - Nord Europe

Friday, March 30, 2018

[DMANET] 2nd announcement: Symposium on Discrete Mathematics 2018

[DMANET] SMT 2018 Call for Papers

[DMANET] WADT 2018 - 2nd Call for Papers

Thursday, March 29, 2018

[DMANET] PhD position in Computational Social Choice at TU Berlin

[DMANET] Deadline extension: Symposium on Rail Transport Demand Management – RTDM 2018

[DMANET] CFP Computational Optimization

[DMANET] CFP Numerical Search and Optimization

Wednesday, March 28, 2018

[DMANET] RANDOM / APPROX 2nd call for papers

[DMANET] [GECCO CFP] [GECCO 2018] Extended Deadline - hot off the press track

[DMANET] Vacancy at University of Antwerp: optimization methods for on-demand planning of public buses

[DMANET] junior teaching position at VU Amsterdam

Tuesday, March 27, 2018

[DMANET] Postdoc positions in TCS at KTH Royal Institute of Technology

[DMANET] PhD positions in TCS at KTH Royal Institute of Technology

[DMANET] Summer School on Algorithms and Lower Bounds - July 6-9, 2018 - Prague, Czech Republic

[DMANET] 12 Research Positions available within the Marie-Curie ITN MINOA on mixed-integer non-linear optimisation

[DMANET] Faculty Positions in Computer Science at NIIT University, Rajasthan, India

[DMANET] PhD position in Algorithms

[DMANET] [Call for Papers] RSFF'18 - Robust Solutions for Fire Fighting

Mailing Lists

Search This Blog

Blog Archive

Saturday, March 31, 2018

Friday, March 30, 2018

Thursday, March 29, 2018

Wednesday, March 28, 2018

Tuesday, March 27, 2018

Mailing Lists

Subscribe To

Search This Blog

Blog Archive