Tuesday, November 21, 2017

[DMANET] PhD Fast Track Stipends, Algorithmic Optimization, Trier Univ, Germany

The Research Training Group (RTG) Algorithmic Optimization, funded
by the Deutsche Forschungsgemeinschaft (DFG), is accepting
applications for Fast Track Stipends (800 EUR per month)
at the University of Trier for a period of one year beginning April 1, 2018.

The fast track stipends require the attendance of lectures or seminars in
the mathematical Master program of Trier University in the amount of at
least 40 credits as preparation for a PhD project. Upon positive evaluation
after completion of the stipend year, the successful candidate will be directly
accepted into the ALOP PhD program (83% TV-L E12, duration 3 years).
The ALOP research topics are devoted to all mathematical aspects of
algorithmic optimization with an emphasis on applications, in particular
in large and big data, as well as systems models from economics. The doctoral
research positions after the stipend phase do not involve teaching duties.

At the time of hiring, applicants must hold a BSc degree (or equivalent)
in mathematics or a closely related field. They should be able to
communicate in English and document their interest in the scientific goals
of the research program of the Research Training Group. Excellent programming
skills are a plus.

Applications should include:
- letter of motivation (no more than 2 pages)
- curriculum vitae
- a recent letter of reference to be sent directly to the address below
- contact information of at least one additional reference
- copies of degrees earned (in German or English translation)
- the bachelor thesis

Applications from researchers of all nationalities are welcome. Trier
University strives to increase the proportion of women in research and
strongly encourages women to apply. The university is certified as a
family-friendly employer. Provided equal qualifications are demonstrated,
applicants with disabilities will be preferred.

Please send all application materials as a single pdf-file via e-mail to:
alop@uni-trier.de
referencing the subject: RTG ALOP Fast Track

For full consideration, applications must be received no later than
Sunday, January 7, 2018; however, late applications will be considered
until the positions are filled.

For more information see: http://www.alop.uni-trier.de and
https://alop.uni-trier.de/job-opening/
**********************************************************
*
* 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] Ph.D. Position at TU Berlin

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

Call for applications

Ph.D. position (Wiss. Mitarbeiter)
TVL E13 -- 5 years

in the Discrete Mathematics group of TU Berlin.
The position comes with teaching obligations that are typically
fulfilled through work as a teaching assistant. Because the main
language of teaching is German, applicants should be proficient
in German or be willing to learn the language within
a short period of time.

Applicants should have a solid background in combinatorics
and graph theory. Candidates with an interest in
discrete geometry, planar graphs or posets
are particularly encouraged to apply.

A prior master's degree in mathematics or a closely related field is
required. It may also be possible to hire a person with a
Ph.D. degree. The position is paid according to level TVL E13 of the
German salary scale for public employees (the monthly gross salary is
likely to exceed 3500 euros).

The deadline for applications is December 1.

For the complete announcement see
http://tub.stellenticket.de/en/offers/42869 (English)
http://tub.stellenticket.de/de/offers/42866 (German)

For further informations
Stefan Felsner (felsner[at]math.tu-berlin.de)

----
Stefan Felsner
Institut fuer Mathematik, Sekr. MA 5-1
Technische Universitaet Berlin
Strasse des 17. Juni 136
10623 Berlin, Germany
**********************************************************

**********************************************************
*
* 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/
*
**********************************************************

Monday, November 20, 2017

[DMANET] SAT 2018 - Call for papers

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

CALL FOR PAPERS

Twenty-first International Conference on
THEORY AND APPLICATIONS OF SATISFIABILITY TESTING
--- SAT 2018 ---

Oxford, UK, 9 - 12 July 2018

http://sat2018.azurewebsites.net/

Abstract submission deadline: 31 January 2018, 23:59 AoE
Paper submission deadline: 07 February 2018, 23:59 AoE

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


The International Conference on Theory and Applications of Satisfiability
Testing (SAT) is the premier annual meeting for researchers focusing on the
theory and applications of the propositional satisfiability problem, broadly
construed. In addition to plain propositional satisfiability, it also includes
Boolean optimization (such as MaxSAT and Pseudo-Boolean (PB) constraints),
Quantified Boolean Formulas (QBF), Satisfiability Modulo Theories (SMT), and
Constraint Programming (CP) for problems with clear connections to
Boolean-level reasoning.

Many hard combinatorial problems can be tackled using SAT-based techniques
including problems that arise in Formal Verification, Artificial Intelligence,
Operations Research, Computational Biology, Cryptography, Data Mining, Machine
Learning, Mathematics, etc. Indeed, the theoretical and practical advances in
SAT research over the past twenty years have contributed to making SAT
technology an indispensable tool in a variety of domains.

SAT 2018 aims to further advance the field by soliciting original theoretical
and practical contributions in these areas with a clear connection to
satisfiability. Specifically, SAT 2018 invites scientific contributions
addressing different aspects of SAT interpreted in a broad sense, including
(but not restricted to) theoretical advances (such as exact algorithms, proof
complexity, and other complexity issues), practical search algorithms,
knowledge compilation, implementation-level details of SAT solvers and
SAT-based systems, problem encodings and reformulations, applications
(including both novel application domains and improvements to existing
approaches), as well as case studies and reports on findings based on rigorous
experimentation.

SAT 2018 will take place as part of the Federated Logic Conference (FLoC) in
Oxford, http://www.floc2018.org. As in previous years, SAT and FLoC host
several competitive events which run before the conference and whose results
are disclosed during FLoC. A list of affiliated workshops can be found on the
websites.

SCOPE
-----

SAT 2018 welcomes scientific contributions addressing different aspects of the
satisfiability problem, interpreted in a broad sense. Domains include MaxSAT
and Pseudo-Boolean (PB) constraints, Quantified Boolean Formulae (QBF),
Satisfiability Modulo Theories (SMT), as well as Constraint Satisfaction
Problems (CSP). Topics include, but are not restricted to:

- Theoretical advances (including algorithms, proof complexity, parameterized
complexity, and other complexity issues);
- Practical search algorithms;
- Knowledge compilation;
- Implementation-level details of SAT solving tools and SAT-based systems;
- Problem encodings and reformulations;
- Applications (including both novel applications domains and improvements to
existing approaches);
- Case studies and reports on insightful findings based on rigorous
experimentation.

OUT OF SCOPE
------------

Papers claiming to resolve a major long-standing open theoretical question in
Mathematics or Computer Science (such as those for which a Millennium Prize is
offered), are outside the scope of the conference because there is insufficient
time in the schedule to referee such papers; instead, such papers should be
submitted to an appropriate technical journal.

PAPER CATEGORIES
----------------

Submissions to SAT 2018 are solicited in three paper categories, describing
original contributions.

- Long papers (9 to 15 pages, excluding references)
- Short papers (up to 8 pages, excluding references)
- Tool papers (up to 6 pages, excluding references)

Long and short papers should contain original research, with sufficient detail
to assess the merits and relevance of the contribution. For papers reporting
experimental results, authors are strongly encouraged to make their data and
implementations available with their submission. Submissions reporting on case
studies are also encouraged, and should describe details, weaknesses, and
strengths in sufficient depth. Long and short papers will be evaluated with the
same quality standards, and are expected to contain a similar contribution per
page ratio.

The authors should choose between a long or a short paper depending on the
space they need to fully describe their contribution. The classification
between long and short papers is mainly a way to balance the workload of the
reviewing process among PC members. It also impacts the duration of the
presentation of the work during the conference. It is the responsibility of the
authors to make sure that their paper is self-contained in the chosen limit of
pages. There will be no requalification of the submissions by the PC.

Tool papers must obey to a specific content criteria. A tool paper should
describe the implemented tool and its novel features. Here "tools" are
interpreted in a broad sense, including descriptions of implemented solvers,
preprocessors, etc., as well as systems that exploit SAT solvers or their
extensions for use in interesting problem domains. A demonstration is expected
to accompany a tool presentation. Papers describing tools that have already
been presented previously are expected to contain significant and clear
enhancements to the tool.

SUBMISSIONS
-----------

Submissions should not be under review elsewhere nor be submitted elsewhere
while under review for SAT 2018, and should not consist of previously published
material.

Submissions not consistent with the above guidelines may be returned without
review.

Besides the paper itself, authors may submit a supplement consisting of one
file in the format of a gzipped tarball (.tar.gz or .tgz) or a gzipped file
(.gz) or a zip archive (.zip). Authors are encouraged to submit a supplement
when it will help reviewers evaluate the paper. Supplements will be treated
with the same degree of confidentiality as the paper itself. For example, the
supplement might contain detailed proofs, examples, software, detailed
experimental data, or other material related to the submission. Individual
reviewers may or may not consult the supplementary material; the paper itself
should be self-contained.

All papers submissions are done exclusively via EasyChair in Springer's LaTeX
llncs2e style.

One author of each accepted paper is expected to present it at the conference.

IMPORTANT DATES
---------------

All deadlines are 23.59 AoE (anywhere on earth)

31 Jan 2018: Abstract submission
7 Feb 2018: Paper submission
12-14 Mar 2018: Author response period
31 Mar 2018: Notification
9-12 Jul 2018: Conference

PROCEEDINGS
-----------

All accepted papers are expected to be published in the proceedings of the
conference, which will be published within the Springer LNCS series.

TRAVEL SUPPORT AND BEST PAPER AWARDS
------------------------------------

Long and short papers may be considered for a best paper award. If the main
author is a student, both in terms of work and writing, the paper may be
considered for a best student-paper award. Use the supplement to your
submission to state (in a brief cover letter) if the paper qualifies as a
student paper. Both the best paper award and the best student paper award are
sponsored by Springer.

The SAT association will provide partial travel support to students with
accepted papers to attend SAT 2018.


ORGANIZATION
------------

Program Chairs
--------------
- Olaf Beyersdorff, University of Leeds
- Christoph Wintersteiger, Microsoft

Workshop Chair
--------------
- Martina Seidl, Johannes Kepler University Linz

Program Committee
-----------------
- Gilles Audemard, CRIL
- Fahiem Bacchus, University of Toronto
- Armin Biere, Johannes Kepler University Linz
- Nikolaj Bjorner, Microsoft
- Nadia Creignou, Aix-Marseille Université
- Uwe Egly, TU Wien
- John Franco, University of Cincinnati
- Vijay Ganesh, University of Waterloo
- Serge Gaspers, UNSW Sydney and Data61, CSIRO
- Marijn Heule, The University of Texas at Austin
- Matti Järvisalo, University of Helsinki
- Mikolas Janota, University of Lisbon
- George Katsirelos, MIAT, INRA
- Oliver Kullmann, Swansea University
- Massimo Lauria, Sapienza University of Rome
- Daniel Le Berre, Université d'Artois
- Florian Lonsing, TU Wien
- Ines Lynce, INESC-ID, Universidade de Lisboa
- Joao Marques-Silva, University of Lisbon
- Ruben Martins, Carnegie Mellon University
- Stefan Mengel, CNRS, CRIL
- Alexander Nadel, Intel
- Jakob Nordström, KTH Royal Institute of Technology
- Markus N. Rabe, UC Berkeley
- Martina Seidl, Johannes Kepler University Linz
- Laurent Simon, Labri, Bordeaux Institute of Technology
- Carsten Sinz, Karlsruhe Institute of Technology
- Friedrich Slivovsky, TU Wien
- Takehide Soh, Kobe University
- Stefan Szeider, TU Wien
- Jacobo Torán, University of Ulm
- Ralf Wimmer, Albert-Ludwigs-Universität Freiburg
- Xishun Zhao, Sun Yat-Sen University


CONTACT
-------
sat2018@easychair.org<mailto:sat2018@easychair.org>

**********************************************************
*
* 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] ORBEL 32 - Call for Abstracts

ORBEL 32, 32nd annual conference of the Belgian Operational Research
Society

Liège, Belgium, February 1 – 2, 2018

https://www.orbel.be/orbel32/

We invite all researchers, practitioners, and students interested in
quantitative methods for decision making to attend the 32nd annual
conference of the Belgian Operational Research Society (ORBEL 32
<https://www.orbel.be/orbel32/index.php> ) on February 1 – 2, 2018 in
Liège.

ORBEL is the annual conference of the Belgian Operational Research (OR)
Society <https://www.orbel.be/> , a member of EURO
<http://www.euro-online.org/> , the association of European OR Societies,
and Belgian representative of IFORS <http://www.ifors.org/>
(International Federation of OR Societies). ORBEL 32 is organized by the
research centre QuantOM <http://www.quantom.hec.ulg.ac.be/> (Quantitative
Methods and Operations Management) of HEC Liège
<http://www.hec.ulg.ac.be/en/home> - Management School of the University
of Liège <https://www.uliege.be/cms/c_8699436/en/portail-uliege> .

The conference is intended as a meeting place for researchers and users of
OR, statistics, computer science, and related fields. It provides
managers, practitioners, and researchers with a unique opportunity to
exchange information on quantitative techniques for decision making. ORBEL
welcomes every year more than one hundred participants from Belgium and
from France, Germany, Luxembourg, and the Netherlands.

The confirmed keynote speakers of this edition are:

* Prof. Michel Bierlaire, EPFL Ecole Polytechnique Fédérale de
Lausanne
Title: Modeling advanced disaggregate demand as MILP
* Prof. Dominique Feillet, Ecole des Mines de Saint-Etienne and
LIMOS

Title: Vehicle routing problems with road-network information

* Prof. Martin Savelsbergh, H. Milton Stewart School of Industrial &
Systems Engineering, Georgia Tech

Title: Recent advances in criterion space search algorithms for
multi-objective mixed integer programming

TOPICS OF INTEREST:

We invite contributions in all fields of methodology and application:

* continuous, discrete or stochastic optimization, graphs and
networks, multicriteria decision making, decision theory, game theory,
simulation, queueing theory, complexity theory, data mining, ...;
* supply chain management, production planning, scheduling, project
management, transportation and traffic management, energy management, DEA
and performance management, financial modelling, ...;
* applications in industry, in the energy sector, in life sciences
and in bioinformatics, in public services, in engineering, in health care,
in banking, in telecommunications, in sports, in media and entertainment,
...;

IMPORTANT DATES:

ORBEL 32: February 1 – 2, 2018

Abstract submission deadline: December 22, 2017

End of early registration: January 22, 2018

SCIENTIFIC COMMITTEE:

* Aghezzaf, El Houssaine
* Arda, Yasemin
* Beliën Jeroen
* Bisdorff, Raymond
* Blondeel, Wouter
* Caris, An
* Chevalier, Philippe
* Crama, Yves
* David, Benoît
* De Baets, Bernard
* De Causmaecker, Patrick
* De Smet, Yves
* Fortz, Bernard
* Goossens, Dries
* Janssens, Gerrit
* Kunsch, Pierre
* Labbé, Martine
* Leus, Roel
* Mélot, Hadrien
* Pirlot, Marc
* Sartenaer, Annick
* Schyns, Michaël
* Sörensen, Kenneth
* Spieksma, Frits
* Vanden Berghe, Greet
* Vansteenwegen, Pieter
* Van Utterbeeck, Filip
* Van Vyve, Matthieu
* Wittevrongel, Sabine

ORGANISING COMMITTEE:

* Arda, Yasemin (Chair)
* Bay, Maud
* Crama, Yves
* Hoffait, Anne-Sophie
* Limbourg, Sabine
* Michelini, Stefano
* Paquay, Célia
* Pironet, Thierry
* Rodriguez Heck, Elisabeth
* Schyns, Michaël
* Smeulders, Bart

CONFERENCE VENUE:

The conference will take place in the main building of HEC Liège, in the
heart of the City of Liège, Belgium's third largest city and the largest
agglomeration of the French-speaking Walloon region. Liège is home to the
third inland port of Europe and the eighth freight airport in Europe.
Recognized for its quality of life and its rich historical patrimonium,
Liège is ideally situated within the Meuse-Rhin Euregio, 40 kilometers
from Maastricht (the Netherlands) and 60 kilometers from Aachen (Germany).
It is less than 1.5 hours away from Köln, 2.5 hours from Paris, and 4
hours from London by high-speed train (TGV) starting from the new
magnificent train station designed by the renowned architect Santiago
Calatrava.

In the name of the organizing committee,

Yasemin ARDA & Yves CRAMA


**********************************************************
*
* 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 - CP 2018

*Call for Papers – CP 2018*

The Twenty-Fourth Conference on Principles and Practice of Constraint
Programming <http://cp2018.a4cp.org/> will take place in Lille, France,
27-31 August 2018.

The CP conference series concerns all aspects of computing with
constraints, including: theory, algorithms, environments, languages,
models, systems, and applications.

The CP 2018 programme will include presentations of high-quality scientific
papers and tutorials on both theory and applications. Invited talks will
describe important topics relevant to the field. There are also workshops
and a doctoral program for students.

*Tracks*

The conference features a main Technical Track, an Applications Track, and
various thematic tracks, which include:

-

CP & Data Science
-

CP & Operations Research
-

CP & Music
-

Testing and Verification
-

Multiagent and Parallel CP
-

CP, Optimization, & Power System Management

Papers are submitted to individual tracks. They would normally relate to CP
technology, but submissions that deal with constraint solving and are of
potential interest to the CP community are also invited. The thematic
tracks, in particular, are intended to reach out to researchers beyond the
CP community. Each track has a dedicated chair and subcommittee to ensure
that reviewers have the relevant domain expertise.

*Submission*

Paper submission is via EasyChair, and reviewing is double blind. Please
see the conference website <http://cp2018.a4cp.org/> for further details
and a complete list of tracks.

*Important Dates*

-

*10 April 2018 - *Abstract submission
-

*16 April 2018 - *Paper submission
-

*15-19 May 2018 - *Author response period
-

*1 June 2017* - Notification
-

*15 June 2018 - *Camera-ready

**********************************************************
*
* 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] Conference "Tropical varieties and amoebas in higher dimension", KTH and IML Stockholm, April 16-20, 2018

This is the first announcement for the conference "Tropical varieties
and amoebas in higher dimension" which will take place at the KTH
Stockholm April 16-20, 2018. This is the final conference of the
programme "Tropical geometry, amoebas and polytopes" which will take
place at the Institute Mittag Leffler in spring 2018. As final
conference, it is intended to cover a broad range of topics that will
be of interest during the programme, in particular tropical algebra
and applications; combinatorics, polytopes, and complexity; moduli
spaces of curves and mirror symmetry; and tropical geometry and
amoebas in higher dimension.

Participation in the conference is open to everyone (and in particular
not restricted to participants in the programme).

Speakers include Dan Abramovich, Anders Björner (TBC), Erwan Brugallé,
Melody Chan, June Huh, Kiran Kedlaya (TBC), Diane Maclagan, Grigory
Mikhalkin, Johannes Nicaise, Sam Payne, Kristin Shaw, Frank Sottile,
Bernd Sturmfels, August Tsikh, Annette Werner, Jonathan Wise. More
speakers will be announced soon.

For more information, please check
http://www.mittag-leffler.se/Workshop-on-Tropical-varieties-and-amoebas-in-higher-dimension

To register, please use
https://docs.google.com/forms/d/e/1FAIpQLSe-7IzWvSktFJOLK6OSk4qtEAys3HK7gd9PXQpdOfNZxF6LHQ/viewform

For hotel booking, travel questions or any other administrative
matters please contact Ann-Britt Isaksson Öhman (annbritt@kth.se).

Please forward to potential participants.

Sandra Di Rocco, Jan Draisma, Anders Jensen, Hannah Markwig, Benjamin Nill

**********************************************************
*
* 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] European Chapter on Combinatorial Optimization (ECCO) 2018

*************************
European Chapter on Combinatorial Optimization (ECCO) 2018

To be held at the University of Fribourg, Switzerland
From June 14th to June 16th, 2018

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

The 31st Conference of the European Chapter on Combinatorial Optimization (ECCO) will be held at the University of fribourg (Switzerland) on June 14th to June 16th 2018.

ECCO is a working group of EURO (Association of European Operation Research Societies) that provides an excellent opportunity to discuss recent and important issues in Combinatorial Optimization and its applications.

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

Topics of interest

- theory and applications of combinatorial optimization
- exact solution algorithms, approximation algorithms, heuristics and meta-heurtistics for combinatorial optimization problems
- integer programming, global optimzation, stochastic integer programming, multi-objective programming, graph theory and network flows
- application areas include logistics and supply chain optimization, manufacturing, energy production and distribution, land consolidation, telecommunications, bioinformatics, finance, dicrete
  tomography, discrete and hybrid dynamical systems and other fields

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

Invited speakers

Yves Crama, HEC Liège
John B. Gauci, University of Malta
Christos H. Papadimitriou, University of California at Berkeley
Daniel Kuhn, Ecole Polytechnique Fédérale de Lausanne

************************
Important dates

Submissions: from January 15th to March 16th 2018
Notification of acceptance: April 9th 2018
Deadline for early registration: April 30th 2018
Deadline for author registration (for inclusion in the program): May 15th 2018
Deadline for late registration: May 31st 2018
Conference: From June 14th to June 16th 2018

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

Website: https://ecco2018.euro-online.org/index.html


----------------------------------------------------------------------------------
Bernard Ries - Associate Professor

University of Fribourg - Department of Informatics
Decision Support & Operations Research Group
Bd. de Pérolles 90, 1700 Fribourg

Phone : +41 26 300 83 33 - Fax: +41 26 300 97 26
Email: bernard.ries@unifr.ch
Homepage: http://diuf.unifr.ch/ds/bries
----------------------------------------------------------------------------------

**********************************************************
*
* 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: 4th ACM Cyber‐Physical System Security Workshop (ACM CPSS’18)

*** Apologies for multiple copies ***

C a l l F o r P a p e r s

4th ACM Cyber‐Physical System Security Workshop (ACM CPSS'18)

Incheon, Korea, June 4, 2018 (in conjunction with ACM AsiaCCS'18)

http://jianying.5gbfree.com/cpss/CPSS2018/

Submission due: Jan 20, 2018 (GMT) – firm


Conference Outline:

Cyber-Physical Systems (CPS) consist of large-scale interconnected
systems of heterogeneous components interacting with their physical
environments. There are a multitude of CPS devices and applications
being deployed to serve critical functions in our lives. The security of
CPS becomes extremely important. This workshop will provide a platform
for professionals from academia, government, and industry to discuss how
to address the increasing security challenges facing CPS. Besides
invited talks, we also seek novel submissions describing theoretical and
practical security solutions to CPS. Papers that are pertinent to the
security of embedded systems, IoT, SCADA, smart grid, and critical
infrastructure networks are all welcome. Topics of interest include, but
are not limited to:

• Attack detection for CPS
• Authentication and access control for CPS
• Autonomous vehicle security
• Availability, recovery and auditing for CPS
• Data security and privacy for CPS
• Embedded systems security
• EV charging system security
• Industrial control system security
• IoT security
• Key management in CPS
• Legacy CPS system protection
• Lightweight crypto and security
• Maritime cyber security
• Risk assessment for CPS
• SCADA security
• Security architectures for CPS
• Security by design for CPS
• Smart grid security
• Threat modeling for CPS
• Urban transportation system security
• Vulnerability analysis for CPS
• Wireless sensor network security

Important Dates:

• Submission due: Jan 20, 2018 (GMT) - firm
• Notification: Mar 10, 2018
• Camera-ready due: Mar 31, 2018

Steering Committee:

• Dieter Gollmann (Hamburg University of Technology, Germany)
• Ravishankar Iyer (UIUC, USA)
• Douglas Jones (ADSC, Singapore)
• Javier Lopez (University of Malaga, Spain)
• Jianying Zhou (SUTD, Singapore) - Chair

Program Chairs:

• Dieter Gollmann (Hamburg University of Technology, Germany & NTU,
Singapore)
• Jianying Zhou (SUTD, Singapore)

Publicity Chair:

• Cristina Alcaraz (University of Malaga, Spain)

Publication/Web Chair:

• Ying Qiu (I2R, Singapore)

Program Committee:

• Kemal Akkaya (Florida International University, USA)
• Cristina Alcaraz (University of Malaga, Spain)
• Alvaro Cardenas (UT Dallas, USA)
• Lorenzo Cavallaro (RHUL, UK)
• Aldar Chan (University of Hong Kong, HK)
• Sudipta Chattopadhyay (SUTD, Singapore)
• Chen-Mou Cheng (Osaka University, Japan)
• Raymond Choo (UT San Antonio, USA)
• Mauro Conti (University of Padua, Italy)
• Marc Dacier (EURECOM, France)
• Herve Debar (Telecom SudParis, France)
• Yuval Elovici (Ben-Gurion University, Israel)
• Afonso Ferreira (IRIT, France)
• Aurelien Francillon (EURECOM, France)
• Jonathan Goh (ST Electronics, Singapore)
• Stefanos Gritzalis (University of the Aegean, Greece)
• Huaqun Guo (I2R, Singapore)
• Jinguang Han (University of Surrey, UK)
• Shao-Fei Huang (LTA, Singapore)
• Harshan Jagadeesh (IIT Delhi, India)
• Zbigniew Kalbarczyk (UIUC, USA)
• Sokratis Katsikas (NTNU, Norway)
• Huy Kang Kim (Korea University, Korea)
• Robert Kooij (TU Delft, Netherland)
• Marina Krotofil (FireEye, USA)
• Qi Li (Tsinghua University, China)
• Hoon Wei Lim (SingTel, Singapore)
• Xiapu Luo (Hong Kong Polytechnic University, HK)
• Michail Maniatakos (NYU-Abu Dhabi, UAE)
• Konstantinos Markantonakis (RHUL, UK)
• Ivan Martinovic (University of Oxford, UK)
• Weizhi Meng (DTU, Denmark)
• Martín Ochoa (SUTD, Singapore)
• Axel Poschmann (NXP, Germany)
• Rodrigo Roman (University of Malaga, Spain)
• Vinay Sachidananda (SUTD, Singapore)
• Biplab Sikdar (NUS, Singapore)
• Martin Strohmeier (University of Oxford, UK)
• Pawel Szalachowski (SUTD, Singapore)
• Qiang Tang (LIST, Luxembourg)
• William Temple (ADSC, Singapore)
• Nils Ole Tippenhauer (SUTD, Singapore)
• Ngoc Hong Tran (Vietnamese German Uni, Vietnam)
• Yi Wang (Continental Automotive, Singapore)
• Daphne Yao (Virginia Tech, USA)
• David Yau (SUTD, Singapore)
• Xin Ye (Ford Motor, USA)
• Chan Yeob Yeun (KUSTAR, UAE)
• Peng Zhou (CSIRO, Australia)
• Sencun Zhu (Pennsylvania State University, USA)
• Saman Zonouz (Rutgers University, USA)

Submission Instructions:

Submitted papers must not substantially overlap papers that have been
published or that are simultaneously submitted to a journal or a
conference with proceedings. All submissions should be appropriately
anonymized (i.e., papers should not contain author names or
affiliations, or obvious citations). Submissions must be in
double-column ACM SIG Proceedings format, and should not exceed 12
pages. Position papers and short papers of 6 pages describing the work
in progress are also welcome. Only pdf files will be accepted. Authors
of accepted papers must guarantee that their papers will be presented at
the workshop. At least one author of the paper must be registered at the
appropriate conference rate. Accepted papers will be published in the
ACM Digital Library. There will also be a best paper award.

Paper submission site: https://easychair.org/conferences/?conf=cpss18.

Contact:

Email: cpss2018@easychair.org
CPSS Home: http://jianying.5gbfree.com/cpss/
**********************************************************
*
* 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/
*
**********************************************************

Sunday, November 19, 2017

[DMANET] PhD positions in Mathematics at the University of Birmingham, UK

The School of Mathematics at the University of Birmingham has openings for PhD students.
In particular, we are keen to attract excellent students in the areas of Discrete Mathematics/Combinatorics
as well as at the interface of Combinatorics and Probability. For further information about the Combinatorics, Probability and Algorithms group see

http://web.mat.bham.ac.uk/combinatorics/

For further information about the PhD programme and application procedures see

https://www.birmingham.ac.uk/schools/mathematics/phd/phd-programme.aspx

Applicants are encouraged to apply as early as possible. Prospective applicants are advised to contact

Daniela Kuhn <d.kuhn@bham.ac.uk> or
Deryk Osthus <d.osthus@bham.ac.uk>

before submitting a formal application.


**********************************************************
*
* 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] Assistant Professor of Mathematics, LSE (London School of Economics) -- last call

Assistant Professor of Mathematics, LSE (London School of Economics) --
last call

The Department of Mathematics at LSE seeks to appoint an Assistant
Professor. For this post, we are particularly interested in candidates
with expertise in a subject area related to the Mathematics of
Operations Research. The successful candidate will have an established
track record or trajectory of research at a level of international
excellence, will be able to teach mathematics at undergraduate and
postgraduate level and will have a commitment to excellence in teaching.
They will contribute to the general work of the department, including
the teaching of a range of courses. They will maintain an active
programme of research in mathematics and will have a clear, well
developed, and viable strategy for future outstanding research. They
will have a PhD in a mathematical subject (or be close to completing
one) by the intended start date of 1 September 2018.

Salary is competitive with Departments at our peer institutions
worldwide and not less than £53,004 (GBP) per annum inclusive. For
further information about the post, benefits, shortlisting criteria, and
contact information for queries, please see http://tiny.cc/MathJobLSE
and its links to the "how to apply" document, job description, and
person specification. The closing date for receipt of applications is
**Sunday 26 November 2017** (23.59 UK time).
**********************************************************
*
* 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/
*
**********************************************************

Saturday, November 18, 2017

[DMANET] TCS faculty and postdoc positions in ITCS@SUFE, Shanghai

The Institute for Theoretical Computer Science (ITCS, http://itcs.shufe.edu.cn ) is a newly established academic unit at Shanghai University of Finance and Economics (SUFE), aimed at creating a world-class environment for research in broad areas of theoretical computer science. Shanghai University of Finance and Economics is a top-ranked research university specializing in economics, finance and business studies. In recent years, SUFE has been earnestly developing fundamental and closely related disciplines besides finance and economics, among which computer science is at the top of its list. ITCS is one of the key priorities of this high-level mission.

Currently, the institute already has five full time faculty members: Pinyan Lu (director), Nick Gravin, Bundit Laekhanukit, Yuan Lin and Zihe Wang, a few affiliated professors from other universities in Shanghai area including Yijia Chen, Xiaotie Deng and others who visit us in a regular base. We also have a team of roughly ten visiting professors including Xiaohui Bei, Jin-Yi Cai, Yang Cai, Jing Chen, Kai-Min Chung, Richard Peng, Lirong Xia, Shengyu Zhang and Yuan Zhou who spend at least one month at the institute each year. More information about the institute can be found in our website http://itcs.shufe.edu.cn

Within roughly five years, we plan to have 8-10 full time faculty members in ITCS. We invite applications from highly-qualified candidates for various position levels in broad areas of theoretical computer science including (but not limited to), Algorithms and Complexity, Algorithmic Game Theory, Machine Learning, Information Theory. Salary and compensation packages are attractive and competitive. Initial appointments are typically made for a six years fixed-term. Subsequent contract renewal, promotion and tenure follow standard international practices. There is no particular deadline for the application.

Besides tenure track faculty positions, each year the institute also offers two research fellowship positions. The appointment will be for two years with an annual salary of 300,000 RMB. More information can be found at http://itcs.shufe.edu.cn/recruitment/ .

If you are interested in joining us, please send your CV to itcs@mail.shufe.edu.cn


**********************************************************
*
* 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] FAW 2018 Call For Papers

The 12th International Frontiers of Algorithmics Workshop (FAW 2018<http://itcs.shufe.edu.cn/FAW2018/> , http://itcs.shufe.edu.cn/FAW2018) will be held on May 8-10, 2018 at Guangzhou, Guangdong Province, China. FAW 2018 will provide a focused forum on current trends of research on algorithms, discrete structures, operation research, combinatorial optimization and their applications, and will bring together international experts at the research frontiers in these areas to exchange ideas and to present significant new results.


Important Dates
Submission deadline

Dec. 29, 2017 (23:59 Beijing Time)

Author Notification of acceptance

Feb. 1, 2018

Final version due

Feb. 19, 2018

Conference Dates

May 8-10, 2018

Program Committee

Jianer Chen, co-chair
Pinyan Lu, co-chair
Hee-Kap Ahn
Georgios Barmpalias
Xiaohui Bei
Wenbin Chen
Yukun Cheng
Radu Curticapean
Ran Duan
Fedor Fomin
Mordecai J. Golin
Heng Guo
Xin Han
Iyad Kanj
Bundit Laekhanukit
Lap-Kei Lee
Minming Li
Bingkai Lin
Tian Liu
Neeldhara Misra
Kim Thang Nguyen
Pan Peng
Venkatesh Raman
Dominik Scheder
Dimitrios Thilikos
Changjun Wang
Ge Xia
Boting Yang
Chee Yap
Deshi Ye
Chihao Zhang
Jialin Zhang
Submission Guidelines and Publication Information
The submission deadline is December 29, 2017 (23:59 Beijing Time). All submissions are electronic via EasyChair, and the submission server is now available at https://easychair.org/conferences/?conf=faw2018. <https://easychair.org/conferences/?conf=faw2018>
Submissions must adhere to the following guidelines: Papers must be formatted using the LNCS style<http://www.springer.com/cn/computer-science/lncs/conference-proceedings-guidelines>, file without altering margins or the font point. A submission should not exceed 12 pages, including references, but excluding the optional appendix. Proofs omitted due to space constraints must be placed in an appendix to be read by the program committee members at their discretion. Papers that deviate from these guidelines risk being rejected without consideration of their merits.
The proceedings of the Conference will be published by Springer-Verlag in the Lecture Notes in Computer Science (LNCS)<http://www.springer.com/cn/computer-science/lncs>, Lecture Notes in Computer Science (LNCS) series, and will be available for distribution at the conference.
Selected high quality papers will be invited to a special issue in the journal of Theoretical Computer Science<https://www.journals.elsevier.com/theoretical-computer-science/>. The invited papers will go through the normal reviewing process.

**********************************************************
*
* 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/
*
**********************************************************

Friday, November 17, 2017

[DMANET] Research Assistant (PostDoc) at the Institute of Operations Research of the Karlsruhe Institute of Technology (KIT)

??A research assistant position - preferably as a PostDoc - is available in the research group Discrete Optimization and Logistics of Professor Nickel at the Institute of Operations of the Karlsruhe Institute of Technology (KIT), Germany, within the research project "Sequential Decision Making under System-inherent Uncertainty: Mathematical Optimization Methods for Time-dynamic Applications" funded by the Deutsche Forschungsgemeinschaft (DFG). The position is for three years and the remuneration is due to TV-L according to the qualification of the applicant. The position can be started as soon as possible.

Applicants must hold a master's degree, or equivalent in Mathematics, Computer Science, or a related discipline with a focus on Operations Research or optimization theory. Favourably, applicants also hold a doctoral degree (PhD) in one of these disciplines. Applicants should have a profound knowledge and interest in Discrete Optimization as well as Mathematical Programming. Also required are very good programming skills as well as knowledge in the design of optimization algorithms. Acquaintance with Stochastic Programming, Robust Optimization, and Online Optimization is advantageous.

The position focuses on research in the following subjects:
- Development of a generic framework for sequential decision making under incomplete information for a unified comprehension of optimization approaches under uncertainty (Stochastic Programming, Robust Optimization, and Online Optimization)
- Enhancements of distributional analysis methods for algorithm quality and integration of robustness measures
- Retrieval of an information pool for algorithm behaviour in basic applications
- Integration of optimization methods in simulation models

Please send your application - pereferably in electronic form - to Prof. Stefan Nickel (stefan.nickel at kit.edu, Institute of Operations Research, Discrete Optimization and Logistics, Kaiserstr. 12, 76131 Karlsruhe, Germany). The application should contain a cover letter, curriculum vitae, transcript of records, thesis, and doctoral thesis (if applicable).

For questions regarding the position, please contact Dr. Fabian Dunke (dunke at kit.edu, +49 721 608 46816). More information on the research group can be found under dol.ior.kit.edu.

KIT is an equal opportunity employer. Applicants with disabilities will be preferentially considered if equally qualified.

**********************************************************
*
* 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, November 16, 2017

[DMANET] 1 PhD Research Position in Next Generation Wireless Networks at Technical University of Berlin​

1 PhD Research Position in Next Generation Wireless Networks at Technical University of Berlin​

http://www.personalabteilung.tu-berlin.de/menue/jobs/stellenausschreibungen/parameter/en/
Re­ference num­ber: IV-554/17

Work­ing field:
The CCAN chair at the Tech­ni­sche Uni­ver­sität Ber­lin deals with dis­trib­uted con­trol in next gen­er­a­tion wire­less net­works. The future of wire­less com­mu­nic­a­tions is envi­sioned with ultra-dense net­works where a vari­ety of emer­ging tech­no­lo­gies such as machine-type/device-to-device com­mu­nic­a­tions and small cells coex­ist. Due to the dens­ity, dynam­icity and lack of inform­a­tion, the optimal con­trol of such net­works is very chal­len­ging. The prob­lem becomes aggrav­ated when the con­trol and optim­iz­a­tion has to be done in a dis­trib­uted man­ner. The main work­ing theme of this pos­i­tion is to address such chal­lenges using the­or­et­ical meth­ods from game the­ory, machine learn­ing, and dynamic pro­gram­ming. PhD thesis pre­par­a­tion is pos­sible and will be super­vised by Prof. Dr. Setareh Magh­sudi.
Require­ments:
Suc­cess­fully com­pleted uni­versity degree (Mas­ter, Dip­lom or equi­val­ent) in at least one of the fol­low­ing fields:

* elec­trical engin­eer­ing (with strong back­ground in wire­less com­mu­nic­a­tions),
* or math­em­at­ics (with strong back­ground in oper­a­tions research),
* or com­puter sci­ence (with strong back­ground in machine learn­ing),
* or eco­nom­ics (with strong back­ground in game the­ory).

Applic­ants must have strong back­ground in math­em­at­ical ana­lysis, and must be motiv­ated towards the­or­et­ical prob­lems with a strong math­em­at­ical fla­vor. Good pro­gram­ming skills (at least MAT­LAB or C++) and Eng­lish pro­fi­ciency are also required.
How to ap­ply:
Please send your applic­a­tion with the ref­er­ence num­ber and the lis­ted doc­u­ments

* a cur­riculum vitae, stat­ing clearly and pre­cisely their edu­ca­tion his­tory, earned degrees and pre­vi­ous aca­demic insti­tu­tions,
* let­ters of recom­mend­a­tion from aca­demic advisors, MSc thesis super­visors, aca­demic instruct­ors (up to 3 let­ters), together with con­tact inform­a­tion,
* if applic­able, pub­lished research work, includ­ing MSc thesis, in elec­tronic form
* a let­ter of motiv­a­tion and pur­pose, illus­trat­ing how the can­did­ate's know­ledge and back­ground fits in the afore­men­tioned research area;
* offi­cial grade tran­scripts with cer­ti­fied trans­la­tion in Eng­lish or Ger­man if the ori­ginal doc­u­ments are in a dif­fer­ent lan­guage

prefer­ably by e-mail to maghsudi@tu-berlin.de<mailto:maghsudi@tu-berlin.de> or in writ­ing to Tech­nis­che Uni­versität Ber­lin - Der Präsid­ent - Fak­ultät IV, Insti­tut für Telekom­munika­tionssysteme, FG Con­trol of Con­ver­gent Access Net­works (CCAN), Frau Prof. Dr.-Ing. Magh­sudi, Sekr. TEL 12-11, Ernst-Reu­ter-Platz 7, 10587 Ber­lin.

To ensure equal oppor­tun­it­ies between women and men, applic­a­tions by women with the required qual­i­fic­a­tions are expli­citly desired. Qual­i­fied indi­vidu­als with dis­ab­il­it­ies will be favored.

Please send cop­ies only. Ori­ginal doc­u­ments will not be returned.

Application deadline : 8 December 2017


**********************************************************
*
* 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] SECOND CALL: IEEE TCSS Special Issue on "Parallel and Distributed Processing for Computational Social Systems"

[Apologies if you receive multiple postings]
############################################################
############################
CALL FOR PAPERS
IEEE Transactions of Computational Social Systems Special Issue on
"Parallel and Distributed Processing for Computational Social Systems"

https://goo.gl/s8xQXm

Important Dates:
Submission deadline: *Dec. 05, 2017*
First round of reviews: Jan. 31, 2018
Revised papers due: Feb. 20, 2018
Final notification: Mar. 20, 2018
Final manuscript due: Apr. 5, 2018
Expected publication: Jun. or Sep. 2018
############################################################
#############################

*Scope of Special Issue:
Computational methods to represent, model and analyze problems using social
information have come a long way in the last decade. Computational methods,
such as social network analysis, have provided exciting insights into how
social information can be utilized to better understand social processes,
and model the evolution of social systems over time. Meanwhile, the
emergence of parallel architectures, in the form of multi-core/many-core
processors, and distributed platforms, have provided new approaches for
large-scale modeling and simulation, and new tools for analysis. This
special issue provides a platform to bring together interdisciplinary
researchers from areas, including computer science, applied mathematics,
social sciences, and computer engineering, to showcase innovative research
in computational social systems that leverage the emerging trends in
parallel and distributed processing, computational modeling, and high
performance computing.

The major topic areas covered by the special issue are:
1. Large-Scale Modeling and Simulation for Social Systems.
E.g. Social network based models, Models of social interactions/influence,
Complex Adaptive System (CAS) models, Models incorporating socio-cultural
factors, Agent based social modeling and simulation, Modeling with
uncertain/incomplete social data, real-time social modeling, social and
behavioral theories

2. Social Computing Algorithms for Parallel and Distributed Platforms
E.g. Analysis of massive social data, Algorithms for dynamic social data,
Analysis methods for incomplete, uncertain social data, Social computing on
new and emerging parallel/distributed architectures

3. Applications
E.g. Emergency management (in areas such as infrastructure resilience,
natural disaster management), National security, Health science, Social
media analytics

*Manuscript Submission:
Authors must ensure that the papers submitted to this special issue is
original and is not under consideration for publication in any other
journal or conference. Submission that are extensions of previously
published work must contain significant technical novelty and significant
new results. Manuscripts may be submitted via the IEEE TCSS submission
portal at https://mc.manuscriptcentral.com/tcss. The max page length of the
camera ready paper is 12, with a maximum cap of 2 over length pages, at
$175 per page. *IMPORTANT* In the cover letter, authors must mention the
special issue so that the manuscript is routed to the special issue
editors. The manuscripts should follow the IEEE formatting guidelines as
provided at http://ieeeauthorcenter.ieee.org/create-your-ieee-article/
use-authoring-tools-and-ieee-article-templates/ieee-
article-templates/templates-for-transactions/

*Special Issue Editors:

Dr. Eunice E. Santos, Ron Hochsprung Endowed Chair and Professor of
Computer Science, Illinois Institute of Technology, USA

Dr. John Korah, Research Assistant Professor, Illinois Institute of
Technology, USA

For inquiries, please contact the special issue editors via email to
parsocial@cs.iit.edu

<https://www.avast.com/sig-email?utm_medium=email&utm_source=link&utm_campaign=sig-email&utm_content=webmail&utm_term=icon>
Virus-free.
www.avast.com
<https://www.avast.com/sig-email?utm_medium=email&utm_source=link&utm_campaign=sig-email&utm_content=webmail&utm_term=link>
<#m_-583747942455653629_DAB4FAD8-2DD7-40BB-A1B8-4E2AA1F9FDF2>


**********************************************************
*
* 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: Search-Based Software Engineering - Genetic and Evolutionary Computation Conference (GECCO) 2018

Dear Colleague,

We invite you to submit original, high quality papers to the Search-Based Software Engineering (SBSE) track of the Genetic and Evolutionary Computation Conference (GECCO 2018).

After a few years as part of a combined track, SBSE is for the second consecutive year the subject of its own dedicated track at GECCO and we encourage you to continue supporting the track with your original contribution.

Note also this year GECCO invites shorter "poster-only" papers (2 pages) in addition to full-length technical papers (8 pages); see: http://gecco-2018.sigevo.org/index.html/Call+for+Papers for details. We encourage the community to submit short poster-only papers to present new ideas which are not fully empirically evaluated as well as new framework/tools for search-based software engineering.

All accepted papers will be published in the ACM Digital Library. Moreover, the authors of best selected papers accepted for the SBSE track will be invited to submit an extended version of their paper for a special section in the Elsevier Journal of Information and Software Technology (IST).

Please, find the full CfP below.

Kind regards,
Federica Sarro (f.sarro@ucl.ac.uk<mailto:f.sarro@ucl.ac.uk>), Associate Professor, CREST, University College London, United Kingdom
and
Giuliano Antoniol (antoniol@ieee.org<mailto:antoniol@ieee.org>), Professor of Software Engineering, Department of Computer and Software Engineering of the Polytechnique Montreal, Canada

======================================================================================================
CALL FOR PAPERS
Search-Based Software Engineering (SBSE) Track @ Genetic and Evolutionary Computation Conference (GECCO) 2018
http://gecco-2018.sigevo.org/

**********KEY DATES**********
Conference: 15-19 July 2018, Kyoto, Japan
Abstract Submission: 30th January 2018 (non-extensible)
Paper Submission: 6th February 2018 (non-extensible)

**********KEY LINKS**********
Track Details: http://gecco2018.sigevo.org/index.html/Program+Tracks#id_SBSE%20-%20Search-Based%20Software%20Engineering
Paper Submission General Information: http://gecco-2018.sigevo.org/index.html/Call+for+Papers
Paper Submission Instructions: http://gecco-2018.sigevo.org/index.html/Papers+Submission+Instructions

**********SBSE TRACK DESCRIPTION**********
Search-Based Software Engineering (SBSE) is the application of search algorithms and strategies to the solution of software engineering problems.
Evolutionary computation is a foundation of SBSE, and since 2002 the SBSE track at GECCO has provided the unique opportunity to present
SBSE research in the widest context of the evolutionary computation community. Last but not least, participating to the SBSE track and, more generally, to GECCO allows to be informed by advances in evolutionary computation, new cutting edge meta-heuristic ideas, novel search strategies, approaches and findings.

We invite papers that address problems in the software engineering domain through the use of heuristic search techniques.
We particularly encourage papers demonstrating novel search strategies or the application of SBSE techniques to new problems in software engineering. Papers may also address the use of methods and techniques for improving the applicability and efficacy of search-based techniques when applied to software engineering problems.
While empirical results are important, papers that do not contain strong empirical results - but instead present new sound approaches, concepts, or theory - are also very welcome.
Moreover, this year for the first time we encourage the submission of both full papers and poster-only papers describing negative results as well as industrial reports on the practical use of search-based approaches. Moreover poster-only papers presenting frameworks/tools for search-based software engineering are also welcomed.

**********SCOPE**********
As an indication of the wide scope of the field, search techniques include, but are not limited to: Ant Colony Optimization, Automatic Algorithm configuration and Parameter Tuning, Estimation of Distribution Algorithms, Evolutionary Computation, Hybrid and Memetic Algorithms, Hyper-heuristics, Iterated Local Search, Particle Swarm Optimization, Simulated Annealing, Tabu Search, Variable Neighbourhood Search.

The software engineering tasks to which they are applied are drawn from throughout the software lifecycle and include, but are not limited to:
Automated Software Design and Hyper-Heuristics; Automatic Algorithm Selection and Configuration; Configuring Cloud-Based Architectures; Creating Recommendation Systems to Support Life Cycle (Software Requirement, Design, Development, Evolution and Maintenance, etc.); Developing Dynamic Service-Oriented Systems; Enabling Self-Configuring/Self-Healing/Self-Optimizing Systems; Network Design and Monitoring; Optimizing Functional and Non-Functional Software Properties (Genetic Improvement); Predictive Modelling for Software Engineering Tasks; Project Management and Organization; Regression Test Optimization; Requirements Engineering; Software Evolution, Maintenance, Program Repair, Refactoring and Transformation; Software Security; System and Software Integration; Test Data Generation.

**********REVIEW PROCESS**********
Each paper submitted to the track will be rigorously evaluated in a double-blind review process. Paper evaluation at GECCO occurs on a per-track basis, ensuring high interest and expertise of the reviewers. Review criteria include significance of the work, technical soundness, novelty, clarity, writing quality, and sufficiency of information to permit replication, if applicable.

**********PROCEEDINGS**********
All accepted papers will be published in the ACM Digital Library.

**********SPECIAL SECTION IN THE INFORMATION AND SOFTWARE TECHNOLOGY JOURNAL FOR THE BEST PAPERS**********
The authors of best selected papers accepted in the SBSE track will be invited to submit an extended version of their paper for a special section in the Elsevier Journal of Information and Software Technology (IST).

GECCO is sponsored by the Association for Computing Machinery Special Interest Group for Genetic and Evolutionary Computation (ACM SIGEVO).
===================================================================================================================================================

--
Dr. Federica Sarro
Senior Lecturer (Associate Professor)
CREST, Department of Computer Science
University College London
Malet Place, London, WC1E 6BT, UK
http://www0.cs.ucl.ac.uk/staff/F.Sarro/

**********************************************************
*
* 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] [DEADLINE EXTENSION] Special Issue on Parallel and Distributed Data Mining

Special Issue on Parallel and Distributed Data Mining
Information Sciences, Elsevier

Submission deadline: February 1st, 2018


The sheer volume of new data, which is being generated at an increasingly fast pace, has already produced an anticipated data deluge that is difficult to challenge. We are in the presence of an overwhelming vast quantity of data, owing to how easy is to produce or derive digital data. Even the storage of this massive amount of data is becoming a highly demanding task, outpacing the current development of hardware and software infrastructure. Nonetheless, this effort must be undertaken now for the preservation, organization and long-term maintenance of these precious data. However, the collected data is useless without our ability fully understand and make use of it. Therefore, we need new algorithms to address this challenge.

Data mining techniques and algorithms to process huge amount of data in order to extract useful and interesting information have become popular in many different contexts. Algorithms are required to make sense of data automatically and in efficient ways. Nonetheless, even though sequential computer systems performance is improving, they are not suitable to keep up with the increase in the demand for data mining applications and the data size. Moreover, the main memory of sequential systems may not be enough to hold all the data related to current applications.

This Special Issue takes into account the increasing interest in the design and implementation of parallel and distributed data mining algorithms. Parallel algorithms can easily address both the running time and memory requirement issues, by exploiting the vast aggregate main memory and processing power of processors and accelerators available on parallel computers. Anyway, parallelizing existing algorithms in order to achieve good performance and scalability with regard to massive datasets is not trivial. Indeed, it is of paramount importance a good data organization and decomposition strategy in order to balance the workload while minimizing data dependences. Another concern is related to minimizing synchronization and communication overhead. Finally, I/O costs should be minimized as well. Creating breakthrough parallel algorithms for high-performance data mining applications requires addressing several key computing problems which may lead to novel solutions and new insights in interdisciplinary applications.

Moreover, increasingly the data is spread among different geographically distributed sites. Centralized processing of this data is very inefficient and expensive. In some cases, it may even be impractical and subject to security risks. Therefore, processing the data minimizing the amount of data being exchanged whilst guaranteeing at the same time correctness and efficiency is an extremely important challenge. Distributed data mining performs data analysis and mining in a fundamentally distributed manner paying careful attention to resource constraints, in particular bandwidth limitation, privacy concerns and computing power.

The focus of this Special Issue is on all forms of advances in high-performance and distributed data mining algorithms and applications. The topics relevant to the Special Issue include (but are not limited to) the following.

TOPICS OF INTEREST

Scalable parallel data mining algorithms using message-passing, shared-memory or hybrid programming paradigms

Exploiting modern parallel architectures including FPGA, GPU and many-core accelerators for parallel data mining applications

Middleware for high-performance data mining on grid and cloud environments

Benchmarking and performance studies of high-performance data mining applications

Novel programming paradigms to support high-performance computing for data mining

Performance models for high-performance data mining applications and middleware

Programming models, tools, and environments for high-performance computing in data mining

Map-reduce based parallel data mining algorithms

Caching, streaming, pipelining, and other optimization techniques for data management in high-performance computing for data mining

Novel distributed data mining algorithms

SUBMISSION GUIDELINES

All manuscripts and any supplementary material should be submitted electronically through Elsevier Editorial System (EES) at http://ees.elsevier.com/ins (http://ees.elsevier.com/ins). The authors must select as "SI:PDDM" when they reach the "Article Type" step in the submission process.

A detailed submission guideline is available as "Guide to Authors" at: http://www.elsevier.com/journals/information-sciences/0020-0255/guide-for-authors.

IMPORTANT DATES

Submission deadline: February 1st, 2018
First round notification: May 1st, 2018
Revised version due: July 1st, 2018
Final notification: August 1st, 2018
Camera-ready due: September 15th, 2018
Publication tentative date: December 2018

Guest editors:

Massimo Cafaro, Email: massimo.cafaro@unisalento.it
University of Salento, Italy and Euro-Mediterranean Centre on Climate Change, Foundation

Italo Epicoco, Email: italo.epicoco@unisalento.it
University of Salento, Italy and Euro-Mediterranean Centre on Climate Change, Foundation

Marco Pulimeno, Email: marco.pulimeno@unisalento.it
University of Salento, Italy


-

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

Massimo Cafaro, Ph.D.
Associate Professor
Dept. of Engineering for Innovation
University of Salento, Lecce, Italy
Via per Monteroni
73100 Lecce, Italy
Voice/Fax +39 0832 297371
Web http://sara.unisalento.it/~cafaro
E-mail massimo.cafaro@unisalento.it
cafaro@ieee.org
cafaro@acm.org

CMCC Foundation
Euro-Mediterranean Center on Climate Change
Via Augusto Imperatore, 16 - 73100 Lecce
massimo.cafaro@cmcc.it

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

**********************************************************
*
* 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] Symposium GRAPHS - Conference ICNAAM 2018

FIRST CALL FOR PARTICIPATION

Symposium GRAPHS, ICNAAM 2018 (International Conference
of Numerical Analysis and Applied Mathematics 2018),
13-18 September 2018, Sheraton Hotel, Rhodes, Greece

Organizer: Vojislav Petrovic (DMI Novi Sad)

Topics:

- scores in graphs and digraphs

- Eulerian and Hamiltonian graphs and digraphs

- planar graphs

- graph factors and decompositions

- graph colorings

- extremal graphs

- graph spectra

- tournaments and hypertournaments

- graph algorithms


Email to vojpet@dmi.uns.ac.rs or vojpet@gmail.com to announce
registration.

For further information

vojpet@dmi.uns.ac.rs or vojpet@gmail.com

or visit

http://www.icnaam.org/


Vojislav Petrovic
**********************************************************
*
* 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: 6th International Conference on Variable Neighborhood Search, (ICVNS 2018)

***********************************
First Call for Papers
***********************************

6th International Conference on Variable Neighborhood Search, (ICVNS 2018)
Sithonia, Halkidiki, Greece, October 4-7, 2018

http://vns2018.uom.gr

Scope and Objectives:
***********************************
The 6th International Conference on Variable Neighborhood Search will be
held in Sithonia, Halkidiki, Greece (Porto Carras Meliton Hotel) October
4-7, 2018. The ICVNS 2018 will be co-organized by the EURO Working Group
on Metaheuristics (EWG EU/ME) and, the Computational Methodologies &
Operations Research (CMOR Lab) and the Department of Applied Informatics,
School of Information Sciences, of the University of Macedonia. VNS is a
metaheuristic based on systematic changes in the neighborhood structure
within a search, for solving optimization problems and related tasks. The
main goal of the ICVNS 2018 is to provide a stimulating environment in
which researchers coming from various scientific fields can share and
discuss their knowledge, expertise and ideas related to the VNS
Metaheuristic and its applications.

Conference Proceedings and Book of Abstracts:
***********************************
All accepted papers will be published by Springer as a post-proceedings
volume in its Lecture Notes in Computer Science series. Participants are
also allowed to send just abstract of their presentation. If accepted,
they will be published in the Book of abstracts.
Paper submission site: https://ocs.springer.com/ocs/home/ICVNS2018

Publication in Special Issues:
***********************************
- Journal of Global Optimization, Springer (I.F.: 1.733, SJR: 1.48)
- Optimization Letters, Springer (I.F.: 1.310, SJR: 0.92)
- Yugoslav Journal of Operations Research (SJR: 0.32)

Conference Chairs:
***********************************
- Pierre Hansen, GERAD and HEC Montreal, Canada (Honorary Chair of the
Conference)
- Nenad Mladenovic, Mathematical Institute, Serbian Academy of Sciences
and Arts, Serbia (General Chair)
- Angelo Sifaleras, University of Macedonia, Greece (Conference Chair)

Plenary speakers:
***********************************
- Panos M. Pardalos, University of Florida, USA
- Abraham Duarte, Universidad Rey Juan Carlos, Spain
- Daniel Aloise, Polytechnique Montreal, Canada

Venue:
***********************************
The conference activities will take place at Porto Carras Meliton Hotel,
Sithonia, 63081, Halikidiki, Greece. Porto Carras Grand Resort is located
only 120km away from the city of Thessaloniki (the second largest city in
Greece) and 75 minutes drive from Thessaloniki's International Airport
"Macedonia" (SKG).

Important Dates:
***********************************
Submission deadline: May 15, 2018
Notification to authors: July 02, 2018
Early registration deadline: July 31, 2018
Preliminary program: September 04, 2018
Conference date: October 4-7, 2018
Camera-ready due: October 31, 2018

Contact: vns2018@uom.edu.gr

**********************************************************
*
* 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-doc position in Combinatorics / Discrete Mathematics at Tel Aviv University

The School of Mathematical Sciences at Tel Aviv University invites applications for Post-doctoral Fellowships in Combinatorics and Discrete Mathematics for one year, with a possibility of extension for an additional year, starting October 1, 2018 (the starting date is negotiable).

The School of Mathematical Sciences is a leading international research institution in mathematics. It has a large and very active research group in Combinatorics (five faculty members, two post-docs, and many research students), with a weekly research seminar.

Further information about the School, including a list of our faculty, is available on our web site http://www.math.tau.ac.il <http://www.math.tau.ac.il/>.

We welcome applications from candidates specializing in Combinatorics, who have completed a Ph. D. degree in Mathematics or Computer Science by September 30, 2018 (but not earlier than October 1, 2014). Preference will be given to applicants whose research interests are compatible with those of the relevant faculty in the School.

Post-doctoral Fellowships are strictly research positions and do not carry any teaching responsibilities.

Stipends for a one year fellowship are approximately 137,000 Israeli Shekels and are commensurable with entry level academic salaries in Israel. Additional funds for research related travel will also be available.

Candidates should arrange the following application materials to be sent to Ms. Nurit Liberman at nuritl@tauex.tau.ac.il <mailto:nuritl@tauex.tau.ac.il> (with a cc sent to asafico@post.tau.ac.il <mailto:asafico@post.tau.ac.il> and samotij@post.tau.ac.il <mailto:samotij@post.tau.ac.il>):

- CV
- List of Publications
- Research statement
- Three letters of recommendation

The deadline for applications is December 31, 2017.

Applications received after the deadline will be considered if positions remain open.

--
Noga Alon, Michael Krivelevich, Doron Puder, Wojciech Samotij, and Asaf Shapira


**********************************************************
*
* 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] Assistant Professor Position in Theoretical Computer Science/Discrete Mathematics at Charles University in Prague

Assistant professor position
Computer Science Institute of Charles University
Prague, Czech Republic


The Computer Science Institute (CSI) of Charles University, Prague, Czech
Republic, invites applications for a faculty position at the rank of an
assistant professor in the area of theoretical computer science and
discrete mathematics. The expected starting date is between July 1, 2018,
and October 1, 2018, and is negotiable.

We are looking for candidates that would complement and/or strengthen
existing research areas in our group (which currently include structural
graph theory, computational complexity, computational and combinatorial
geometry, and approximation algorithms). Strong candidates from all areas
of theoretical computer science and discrete mathematics will be
considered. For further information about our research group at CSI and at
the closely related Department of Applied Mathematics see
http://iuuk.mff.cuni.cz/ and http://kam.mff.cuni.cz/. Informal inquiries
are welcome and may be sent to Michal Koucky <koucky@iuuk.mff.cuni.cz>.

A successful candidate is expected to pursue an active research program,
teach advanced and introductory classes and possibly supervise
undergraduate and graduate students. Candidates are expected to have a
proven international research record and postdoctoral experience. A PhD in
computer science, discrete mathematics or a closely related field is
required.

The contract duration is three years. Potentially, the position is
renewable; also a habilitation (associate professor promotion) and a
permanent position is a possibility (subject to a separate review
process).

A signed application, accompanied by a curriculum vitae, a proof of
education, a list of publications, an overview of citations (e.g., from
Web of Science or MathSciNet), and a description of pedagogical experience
should be sent by e-mail to <konkurzy@dekanat.mff.cuni.cz> by February 28,
2018. The candidate should also arrange for two letters of recommendation
to be sent to the same address.


The application deadline is: February 28, 2018.
Application and recommendation letters to: <konkurzy@dekanat.mff.cuni.cz>
Announcement: https://www.mff.cuni.cz/to.en/fakulta/prace/201710-iuuk.htm

**********************************************************
*
* 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] NEW TERMS AND DATES - Postdoctoral Fellowship(s) of Algorithms at Postdoctoral Fellowship(s) of Algorithms Department of Computer Science, Faculty of Science at University of Copenhagen

Postdoctoral Fellowship(s) of Algorithms

Department of Computer Science, Faculty of Science at University of
Copenhagen (DIKU) is offering Postdoctoral Fellowship(s) in algorithms
expected to commence 1 August 2018 or as soon as possible thereafter.

The Algorithms Group at DIKU is headed by Professors Mikkel Thorup and
Stephen Alstrup. The group is prolific at the topmost conferences like
SODA, STOC, and FOCS, e.g. with 10 papers accepted for SODA'18. Adding to
the excitement, we have just started the new center Basic Algorithms
Research Copenhagen (BARC, cf. barc.ku.dk). BARC is located at DIKU and
organized in collaboration with the IT University of Copenhagen. The aim is
to attract top talent from around the world to an ambitious, creative,
collaborative, and fun environment. Using the power of mathematics, we
strive to create fundamental breakthroughs in algorithmic thinking,
typically disseminated in top venues such as STOC, FOCS, and SODA. While
the focus of BARC is algorithms theory, we do have a track record of
surprising algorithmic discoveries leading to major industrial
applications. Finally, it should be mentioned that Computer Science and
Engineering at University of Copenhagen was 11th in the 2017 Shanghai
Ranking, and 3rd outside the US.

The duties of the postdoctoral researcher will include research within
algorithms as well as research-based teaching. The post may also include
performance of other duties.

Further information on the Department is linked at
http://www.science.ku.dk/english/about-the-faculty/organisation/.

Inquiries about the position can be made to Professor Mikkel Thorup,
Department of Computer Science, E-mail mthorup@di.ku.dk, Direct Phone: +45
21179123.

The University wishes our staff to reflect the diversity of society and
thus welcomes applications from all qualified candidates regardless of
personal background.

*Requirements *
The candidates must have

- a PhD degree in Computer Science, Mathematics, or equivalent.
- demonstrated strength within algorithm with a solid publication record
at the top conferences STOC, FOCS, and SODA.

*Terms of employment *
The position is covered by the Memorandum on Job Structure for Academic
Staff.
Terms of appointment and payment accord to the agreement between the
Ministry of Finance and The Danish Confederation of Professional
Associations on Academics in the State.

Depending on seniority, the gross basic salary range for Postdoctoral
Fellows is DKK 32,745 to DKK 34,476 per month (level 6 to 8) (about EUR
4,100 to 4,400 per month). A supplement could be negotiated, dependent on
the candidate's experience and qualifications. An additional 17.1 % monthly
contribution to pension will be paid by the employer.

Potential applicants from outside of Denmark can find information about
life in Denmark, including on taxation and health care at http://ism.ku.dk.
For most non-Danish citizens, health care is free and reduced taxation
available.

The application, in English, must be submitted electronically by clicking
APPLY NOW below.

*Please include *

- Curriculum vita
- Diplomas (Master and PhD degree or a statement from your supervisor,
which confirms that you will submit and defend your PhD before you start
employment)
- Complete publication list and links to author pages with DBLP and with
Google Scholar citations
- Separate reprints of 3 particularly relevant papers

*The deadline for applications is 15 December 2017, 23:59 GMT +1. *

After the expiry of the deadline for applications, the authorized
recruitment manager selects applicants for assessment on the advice of the
Interview Committee.

You can read about the recruitment process at
http://employment.ku.dk/faculty/recruitment-process/.


*APPLY NOW
<https://candidate.hr-manager.net/ApplicationInit.aspx?cid=1307&ProjectId=146113&DepartmentId=18970&MediaId=4636&SkipAdvertisement=true>*

Part of the International Alliance of Research Universities (IARU), and
among Europe's top-ranking universities, the University of Copenhagen
promotes research and teaching of the highest international standard. Rich
in tradition and modern in outlook, the University gives students and staff
the opportunity to cultivate their talent in an ambitious and informal
environment. An effective organisation – with good working conditions and a
collaborative work culture – creates the ideal framework for a successful
academic career.

**********************************************************
*
* 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] 5th German Day on Computational Game Theory

First announcement: 5th German Day on Computational Game Theory


Dear colleagues,

I would like to draw your attention to the upcoming

5th German Day on Computational Game Theory,

to be held on

February 8-9, 2018, at the Department of Mathematics, University of Augsburg.

You can find a preliminary web page with important dates and additional information at

https://www.math.uni-augsburg.de/prof/opt/mitarbeiter/harks/Tagungen/5-GDCGT_2018/

This workshop will bring together researchers in Computer Science, Operations Research and Economics, who are interested in algorithmic or computational aspects of game theory, social choice and related areas. It provides an opportunity to foster collaboration, present research and exchange ideas at an informal and relaxed level.

Confirmed Plenary Speakers:

- Michal Feldman (Blavatnik School of Computer Science, Tel-Aviv University)
- Giorgos Christodoulou (Dept. of Computer Science, University of Liverpool)

Participation in the workshop is free of charge and lunch and coffee will be provided.

For registration, please send an email to

gdcgt2018@math.uni-augsburg.de,

no later than January 15th, 2018, if you plan to attend.

With best regards,

Tobias Harks

---------------------------------------------------------------
Prof. Dr. Tobias Harks
Institut fuer Mathematik
Universitaet Augsburg
86135 Augsburg
Tel.: 0821 598 2220 or 2212
E-Mail: gdcgt2018@math.uni-augsburg.de
https://www.math.uni-augsburg.de/prof/opt/mitarbeiter/harks/Tagungen/5-GDCGT_2018/
---------------------------------------------------------------
**********************************************************
*
* 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/
*
**********************************************************