Friday, April 21, 2017

[DMANET] SAT 2017 Final Call for papers

FINAL
CALL FOR PAPERS

Twentieth International Conference on
THEORY AND APPLICATIONS OF SATISFIABILITY TESTING
--- SAT 2017 ---

Melbourne, Australia, 28 Aug - 01 Sep 2017
http://sat2017.gitlab.io/

Abstract submission deadline: 26 April 2017, 23:59 AoE
Paper submission deadline: 02 May 2017, 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 2017 aims to further advance the field by soliciting original
theoretical and practical contributions in these areas with a clear
connection to Satisfiability. Specifically, SAT 2017 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 2017 will take place alongside CP 2017 and ICLP 2017 in Melbourne the
week immediately following IJCAI 2017. As in previous years, the SAT
conference hosts several competitive events which run before the
conference and whose results are disclosed during the conference. A list
of affiliated workshops, to be held on 28 August 2017, can also be found
on the website.

SCOPE
-----

SAT 2017 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.

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

Submissions to SAT 2017 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 2017, 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)

26 Apr 2017: Abstract submission
2 May 2017: Paper submission
29-31 May 2017: Author response period
14 Jun 2017: Notification
28 Jun 2017: Camera ready deadline
28 Aug - 01 Sep 2017: 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 2017.


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

Program Chairs
--------------
- Serge Gaspers, UNSW Sydney and Data61, CSIRO
- Toby Walsh, UNSW Sydney and Data61, CSIRO

Local Chair
-----------
- Serge Gaspers, UNSW Sydney and Data61, CSIRO

Workshop Chair
--------------
- Stefan Rümmele, UNSW Sydney and University of Sydney

Organizing Committee
--------------------
- Serge Gaspers, UNSW Sydney and Data61, CSIRO
- Edward J. Lee, UNSW Sydney and Data61, CSIRO
- Kamran Najeebullah, UNSW Sydney and Data61, CSIRO
- Guido Tack, Monash University and Data61, CSIRO
- Tommaso Urli, Data61, CSIRO
- Toby Walsh, UNSW Sydney and Data61, CSIRO

Program Committee
-----------------
- Gilles Audemard, CRIL
- Fahiem Bacchus, University of Toronto
- Valeriy Balabanov, Mentor Graphics
- Bernd Becker, Albert-Ludwigs-University Freiburg
- Olaf Beyersdorff, University of Leeds
- Armin Biere, Johannes Kepler University Linz
- Nadia Creignou, Aix-Marseille Université
- Uwe Egly, TU Wien
- Serge Gaspers, UNSW Sydney and Data61, CSIRO
- Carla Gomes, Cornell University
- Marijn Heule, The University of Texas at Austin
- Alexey Ignatiev, University of Lisbon
- Mikolas Janota, University of Lisbon
- Michael Kaufmann, University of Tuebingen
- Chu-Min Li, Université de Picardie Jules Verne
- Florian Lonsing, TU Wien
- Ines Lynce, INESC-ID, Universidade de Lisboa
- Vasco Manquinho, INESC-ID, University of Lisbon
- Carlos Mencía, University of Oviedo
- Nina Narodytska, Samsung Research America
- Alessandro Previti, University of Helsinki
- Enric Rodríguez Carbonell, Technical University of Catalonia
- Vadim Ryvchin, Technion
- Bart Selman, Cornell University
- Laurent Simon, Labri, Bordeaux Institute of Technology
- Carsten Sinz, Karlsruhe Institute of Technology
- Friedrich Slivovsky, TU Wien
- Ofer Strichman, Technion
- Stefan Szeider, TU Wien
- Allen Van Gelder, University of California, Santa Cruz
- Toby Walsh, Data61, UNSW Sydney and Data61, CSIRO

CONTACT
-------
sat2017@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/
*
**********************************************************

Thursday, April 20, 2017

[DMANET] CfP: 11th Workshop on Reachability Problems 2017, London, UK

The 11th International Workshop on Reachability Problems (RP'17)
7 - 9 September 2017 | Royal Holloway, University of London, UK
http://rp17.cs.rhul.ac.uk

The 11th Workshop on Reachability Problems will be hosted at
Royal Holloway, University of London. The Reachability Workshop is
specifically aimed at gathering together scholars from diverse disciplines
interested in reachability problems that appear in algebraic structures,
computational models, hybrid systems, logic and verification.

Invited Speakers:

Hana Chockler, King's College London
Laurent Doyen, LSV - ENS Cachan
Raphaël Jungers, Université catholique de Louvain
Andreas Podelski, University of Freiburg

Submissions:

Authors are invited to submit a draft of a full paper with at most 12 pages (in
LaTeX, formatted according to LNCS guidelines) via Easychair. Proofs omitted
due to space constraints must be put into an appendix to be read by the program
committee members at their discretion. Submissions deviating from these
guidelines risk rejection. Electronic submissions should be formatted in pdf.
Simultaneous submission to other conferences or workshops with published
proceedings is not allowed.

Submission link: https://easychair.org/conferences/?conf=rp2017

Topics of interest include (but are not limited to): reachability problems in
infinite state systems, rewriting systems, dynamical and hybrid systems;
reachability problems in logic and verification; reachability analysis in
different computational models, counter timed/cellular/communicating automata;
Petri nets; computational aspects of algebraic structures (semigroups, groups
and rings); frontiers between decidable and undecidable reachability problems;
predictability in iterative maps and new computational paradigms.

Important Dates

Submission deadline: 10 May 2017 (AoE)
Notification to authors: 21 June 2017
Final version: 30 June 2017
Workshop: 7 - 9 September 2017

Presentation-Only Track

In addition to regular papers that will appear in our LNCS proceedings, we
invite researchers to apply to give a presentation at RP'17 without an
accompanying paper. Such presentations can be based on work that has appeared
(or which is going to appear) in the proceedings of another conference, or which
has not yet been submitted. These contributions will be judged solely on the
basis of their attractiveness to the workshop.

To apply to give such a presentation please submit a PDF file containing a short
abstract (up to two pages) by e-mail [ rp2017@easychair.org ] by August 2st
2017, with subject "RP2017 Informal Presentations". This abstract will not be
published in the conference proceedings. Notification for the presentation-only
track will be August 9th 2016.

Proceedings

The Conference Proceedings will be published as the volume of the Springer
Verlag LNCS (Lecture Notes in Computer Science) series and distributed at the
Conference. We plan also to publish selected papers in a special issue of a high
quality journal following the regular referee procedure.

RP'16 Program Committee:

Igor Potapov, University of Liverpool (co-chair)
Matthew Hague, Royal Holloway, University of London (co-chair)

Paul Bell, Liverpool John Moores University
Patricia Bouyer-Decitre, LSV, CNRS & ENS de Cachan
Aiswarya Cyriac, Chennai Mathematical Institute
Giorgio Delzanno, Universita Degli Studi Di Genova
Piotrek Hofman, University of Warsaw
Peter Lammich, Institut fuer Informatik, TU Munich
Martin Lange, University of Kassel
Salvatore La Torre, Università degli Studi di Salerno
Ranko Lazic, University of Warwick
Ondřej Lengál, Brno University of Technology
Jerome Leroux, Laboratoire Bordelais de Recherche en Informatique
Rupak Majumdar, Max Planck Institute for Software Systems
Ahmed Rezine, Linköping University
Tachio Terauchi, Japan Advanced Institute of Science and Technology
Hsu-Chun Yen, National Taiwan University

Previous Workshops :

2016: RP'16 in Aalborg, Denmark
LNCS proceedings, Volume 9899/2016, Springer Verlag
2015: RP'15 in Warsaw, Poland
LNCS proceedings, Volume 9328/2015, Springer Verlag
2014: RP'14 in Oxford, UK
LNCS proceedings, Volume 8762/2014, Springer Verlag
2013: RP'13 in Uppsala, Sweden
LNCS proceedings, Volume 8169/2013, Springer Verlag
2012: RP'12 in Bordeaux, France
LNCS proceedings, Volume 7550/2012, Springer Verlag
2011: RP'11 in Genova, Italy
LNCS proceedings, Volume 6945/2011, Springer Verlag
2010: RP'10 in Brno, Czech Republic
LNCS proceedings, Volume 6227/2010, Springer Verlag
2009: RP'09 in Palaiseau, France
LNCS proceedings, Volume 5797/2009, Springer Verlag
2008: RP'08 in Liverpool, UK
ENTCS proceedings, Volume 223, Elsevier
2007: RP'07 in Turku, Finland
TUCS General Publication Series, Volume 45,
Turku Centre for Computer Science

DBLP Reachability Problems: http://dblp.uni-trier.de/db/conf/rp/


**********************************************************
*
* 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] 2nd CfP Reachability Problems, RP 2017, London, UK

The 11th International Workshop on Reachability Problems (RP'17)

7 - 9 September 2017 | Royal Holloway, University of London, UK
http://rp17.cs.rhul.ac.uk

The 11th Workshop on Reachability Problems will be hosted at
Royal Holloway, University of London.

The Reachability Workshop is specifically aimed at gathering together scholars
from diverse disciplines interested in reachability problems that appear in
algebraic structures, computational models, hybrid systems, logic and
verification.

Invited Speakers:

Hana Chockler, King's College London
Laurent Doyen, LSV - ENS Cachan
Raphaël Jungers, Université catholique de Louvain
Andreas Podelski, University of Freiburg

Submissions:

Authors are invited to submit a draft of a full paper with at most 12 pages (in
LaTeX, formatted according to LNCS guidelines) via Easychair. Proofs omitted
due to space constraints must be put into an appendix to be read by the program
committee members at their discretion. Submissions deviating from these
guidelines risk rejection. Electronic submissions should be formatted in pdf.
Simultaneous submission to other conferences or workshops with published
proceedings is not allowed.

Submission link: https://easychair.org/conferences/?conf=rp2017

Topics of interest include (but are not limited to): reachability problems in
infinite state systems, rewriting systems, dynamical and hybrid systems;
reachability problems in logic and verification; reachability analysis in
different computational models, counter timed/cellular/communicating automata;
Petri nets; computational aspects of algebraic structures (semigroups, groups
and rings); frontiers between decidable and undecidable reachability problems;
predictability in iterative maps and new computational paradigms.

Important Dates

Submission deadline: 10 May 2017 (AoE)
Notification to authors: 21 June 2017
Final version: 30 June 2017
Workshop: 7 - 9 September 2017

Presentation-Only Track

In addition to regular papers that will appear in our LNCS proceedings, we
invite researchers to apply to give a presentation at RP'17 without an
accompanying paper. Such presentations can be based on work that has appeared
(or which is going to appear) in the proceedings of another conference, or which
has not yet been submitted. These contributions will be judged solely on the
basis of their attractiveness to the workshop.

To apply to give such a presentation please submit a PDF file containing a short
abstract (up to two pages) by e-mail [ rp2017@easychair.org ] by August 2st
2017, with subject "RP2017 Informal Presentations". This abstract will not be
published in the conference proceedings. Notification for the presentation-only
track will be August 9th 2016.

Proceedings

The Conference Proceedings will be published as the volume of the Springer
Verlag LNCS (Lecture Notes in Computer Science) series and distributed at the
Conference. We plan also to publish selected papers in a special issue of a high
quality journal following the regular referee procedure.

RP'16 Program Committee:

Igor Potapov, University of Liverpool (co-chair)
Matthew Hague, Royal Holloway, University of London (co-chair)

Paul Bell, Liverpool John Moores University
Patricia Bouyer-Decitre, LSV, CNRS & ENS de Cachan
Aiswarya Cyriac, Chennai Mathematical Institute
Giorgio Delzanno, Universita Degli Studi Di Genova
Piotrek Hofman, University of Warsaw
Peter Lammich, Institut fuer Informatik, TU Munich
Martin Lange, University of Kassel
Salvatore La Torre, Università degli Studi di Salerno
Ranko Lazic, University of Warwick
Ondřej Lengál, Brno University of Technology
Jerome Leroux, Laboratoire Bordelais de Recherche en Informatique
Rupak Majumdar, Max Planck Institute for Software Systems
Ahmed Rezine, Linköping University
Tachio Terauchi, Japan Advanced Institute of Science and Technology
Hsu-Chun Yen, National Taiwan University

Previous Workshops :

2016: RP'16 in Aalborg, Denmark
LNCS proceedings, Volume 9899/2016, Springer Verlag
2015: RP'15 in Warsaw, Poland
LNCS proceedings, Volume 9328/2015, Springer Verlag
2014: RP'14 in Oxford, UK
LNCS proceedings, Volume 8762/2014, Springer Verlag
2013: RP'13 in Uppsala, Sweden
LNCS proceedings, Volume 8169/2013, Springer Verlag
2012: RP'12 in Bordeaux, France
LNCS proceedings, Volume 7550/2012, Springer Verlag
2011: RP'11 in Genova, Italy
LNCS proceedings, Volume 6945/2011, Springer Verlag
2010: RP'10 in Brno, Czech Republic
LNCS proceedings, Volume 6227/2010, Springer Verlag
2009: RP'09 in Palaiseau, France
LNCS proceedings, Volume 5797/2009, Springer Verlag
2008: RP'08 in Liverpool, UK
ENTCS proceedings, Volume 223, Elsevier
2007: RP'07 in Turku, Finland
TUCS General Publication Series, Volume 45,
Turku Centre for Computer Science

DBLP Reachability Problems: http://dblp.uni-trier.de/db/conf/rp/


**********************************************************
*
* 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] IEEE CIM: Special Issue on Computational Intelligence Techniques in Bioinformatics and Bioengineering (Submission Deadline 15th November 2017)

** Apologies for multiple postings **

#####################################################################

Special Issue in the IEEE Computational Intelligence Magazine (IEEE CIM)
on Computational Intelligence Techniques in Bioinformatics and
Bioengineering

https://tinyurl.com/IEEE-CIM-SI-CITBB2018
#####################################################################


*Aims and scope*

The focus of the special issue is on emerging topics at the interface of
computational intelligence, Bioinformatics and Bioengineering.

This is a rich area that includes important and diverse problems, such as
protein structure prediction, systems and synthetic biology, visualization
of large-scale biological data sets, epigenomics, as well as touches on a
vast range of topics in biomedical engineering, bioprocessing and
healthcare informatics, such as biomedical imaging/data modelling and
mining, biomarker discovery, development of personalized medicine and
treatment, mining of big healthcare dataset, biopharmaceutical manufacture
and computer-assisted closed-loop problems.

The computational intelligence community in bioinformatics and
bioengineering is fragmented and large. The aim of the special issue will
be to capture some of the ongoing interdisciplinary research that draws
upon joint expertise in the domains of optimization and learning via
computational intelligence techniques and bioinformatics and
bioengineering. The focus is to provide both breadth in the diversity of
selected problems and depth in state-of-the-art techniques for selected
problems.

*Topics of Interest include (but are not limited to)*

· Evolution, phylogeny, comparative genomics

· Gene expression array analysis

· Metabolic pathway analysis

· MicroRNA analysis

· Molecular sequence alignment and analysis

· Pattern recognition/data mining/optimization methods in
Bioinformatics

· Visualization of large biological data sets

· Systems and synthetic biology

· Structure prediction and folding

· Modelling, simulation, and optimization of biological systems

· Biological network reconstruction/robustness/evolvability

· Epigenomics

· Medical imaging and pattern recognition

· Biomedical data modelling/data mining/model parametrization

· Parallel/high performance computing

· Big data analysis and tools for biological and medical data

· Biomarker discovery and development

· Health data acquisition/analysis/mining

· Healthcare information systems/knowledge representation/reasoning

· Personalized medicine and treatment optimization

· Biopharmaceutical manufacturing

· Closed-loop optimization methods/platforms

*Submission Process*

The IEEE CIM requires all prospective authors to submit their manuscripts
in electronic format, as a PDF file. The maximum length for papers is
typically 20 double-spaced typed pages with 12 point font, including
figures and references. Submitted manuscript must be typewritten in English
in single column format. Authors of papers should specify on the first page
of their submitted manuscript up to 5 keywords. Additional information
about submission guidelines and information for authors is provided at the IEEE
CIM website
<http://cis.ieee.org/ieee-computational-intelligence-magazine/134-ieee-computational-intelligence-magazine-paper-submission-guidelines-and-information-for-authors.html>
.

Please submit your paper via
https://easychair.org/conferences/?conf=ieeecimcitbb2018.


*Important dates*


15th November, 2017: Submission of manuscript

15th January, 2018: Notification of review results

15th February, 2018: Submission of revised manuscript

15th March, 2018: Submission of final manuscript

*August 2018: Publication*


*Guest Editors*

Richard Allmendinger

University of Manchester, UK

e-mail: richard.allmendinger@manchester.ac.uk

Daniel Ashlock

University of Guelph, Canada

Email: dashlock@uoguelph.ca

Sansanee Auephanwiriyakul

Chiang Mai University, Thailand

email: sansanee@eng.cmu.ac.th

**********************************************************
*
* 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] PhD + Postdoc positions Theoretical Computer Science

The Algorithms & Theory group at the Computer Science Institute of
the University of Tartu, Estonia, is looking for candidates for

* 2 fully funded PhD positions
* 1 postdoc position (1 year; extension possible)

All positions are in _Theoretical_ Computer Science: the sole research
work is PROVING THEOREMS.

One of the PhD positions is in the theory of machine learning; for the
other PhD project and the postdoc, all (theory) areas are welcome.


Qualifications/Requirements
===========================

For PhD positions:

* Excellent command of the English language
* Strong background in mathematics or theoretical computer science
* Master's degree in mathematics or computer science

For Postdoc position:

* Excellent command of the English language
* Strong research record in any area of Theoretical Computer Science
* PhD in mathematics or computer science.


Remuneration
============

* PhD positions: 1200 Euro (after tax)
* Postdoc position: up to 1700 Euro (after tax; negotiable)
* For comparison: Average after tax income in Estonia: 930 Euro.

(Health insurance is free in Estonia.)


Teaching
========

PhD positions:

* TA-ing possible (increases salary)

Postdoc position:

* 1 course per year (on PhD-level, or negotiable) = 1/2 per semester.
* Co-supervise PhD students
* Supervising Master's Students


The Work Place
==============

The CS institute

* Strong international research focus.
* English is the working language in the CS institute.
* All teaching on graduate level is in English.
* A large portion of the faculty are expats.

The university

* Highly ranked, up-and-coming
* See QS university overview:
www.topuniversities.com/universities/university-tartu.

Tartu

* Picturesque student city (= cafes, bars, restaurants, nightlife,
tons of ERASMUS students), ~100,000 inhabitants plus ~17,000
students.
* Climate:
5 months party in the streets (summer)
5 months party in the sauna (winter).
* www.lonelyplanet.com/estonia/southeastern-estonia/tartu .

Estonia

* Eurozone since 2011
* Bustling economy
* Language similar to Finnish ...
* ... no need to learn it though: English works everywhere.


How To Apply
============

Please send your informal inquiries to:

Dr. Dirk Oliver Theis
Associate Professor
dotheis [at] ut [dot] ee
**********************************************************
*
* 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/
*
**********************************************************

Wednesday, April 19, 2017

[DMANET] GHENT GRAPH THEORY WORKSHOP on STRUCTURE and ALGORITHMS

GHENT GRAPH THEORY WORKSHOP
on
STRUCTURE and ALGORITHMS

You are cordially invited to attend the Ghent Graph Theory Workshop on
Structure and Algorithms, to be held on Wednesday through Friday, 16-18
August 2017 at Ghent University, Belgium. Speakers include:

Brendan McKay (Australian National University)
János Pach (École Polytechnique Fédérale de Lausanne, Switzerland)
Carsten Thomassen (Technical University of Denmark)

The website of the workshop is:
ttp://www.ggtw.ugent.be/

If you wish to attend, please register at:
http://www.ggtw.ugent.be/index.php?page=registration

For further questions, please e-mail us at:
ggtw@ugent.be

Kind regards,
Jan Goedgebeur
Nico Van Cleemput
Carol Zamfirescu
**********************************************************
*
* 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. positions in Operations Research (OR) and OR/Machine Learning in Montreal

We invite applications for fully funded Ph.D. positions in Montreal in the
domain of Operations Research, as well as in the intersection between
Operations Research and Machine Learning. These positions aim at advancing
our collective capabilities to solve hard optimization problems and our
understanding of how external data sources and real-time data can be used
to improve the decision-making process. Earliest starting dates are
September 2017 and January 2018.

* Research Topics
Research topics may be aligned with the interests of the students. Several
pre-defined research projects are also available (some of them in
collaboration with industrial partners). Topics may generally include the
following:
- Large-scale optimization for dynamic (combinatorial) planning problems
(e.g. Benders decomposition, Column Generation, Lagrangian Relaxation)
- Optimization under uncertainty (e.g. stochastic programming, robust
optimization, improvement of uncertainty sets and scenario generation
through external data)
- Improvement of (à priori and real-time) planning through integration of
external data sources via machine learning
- Development of Operations Research based algorithms to efficiently solve
machine learning problems

Research may be fundamental, applied, or a mix of both. Applications may
include domains such as Logistics and Transportation (e.g., vehicle sharing
systems, facility location, traffic management), Telecommunications and
Revenue Management (e.g., assortment planning).

* Research supervision and environment
The students will work under the supervision of Dr. Sanjay Dominik Jena,
professor at the Department of Management and Technology (
mantech.esg.uqam.ca) at the Management School of Université du Québec à
Montréal (École des Science de la Gestion, UQAM). Sanjay Dominik Jena is
also member of the worldwide renowed, Montreal-based research center
CIRRELT (www.cirrelt.ca) and the Canada Exellence Research Chair in Data
Science for Real-time Decision-making (www.cerc-datascience.polymtl.ca).
Students may be co-supervised by other members of these research centers
and will be registered either at the joint Ph.D. program in Management
(including ESG UQAM, HEC Montréal, McGill and Concordia) or at the
respective university of the other supervisor(s).

Montreal is a dynamic Metropolis, located in the province of Québec,
Canada. The city is bilingual (French/English) and known for its
international atmosphere. Montreal is known for its vibrate research
environment, hosting five major universities and several research centers
in the domains of Operations Research and Machine Learning. The successful
candidates will be working in one of the above-mentioned research centers.

* Candidate profile
Students are expected to carry out top-level research. They will develop
efficient solution algorithms to difficult planning problems such as those
in the above-listed domains. Candidates should have a Masters degree (or
equivalent) in Computer Science, Operations Research, Applied Mathematics,
or a related field. They should demonstrate good programming skills.
Experience in mathematical programming, machine learning, or data analysis
is an asset. Candidates should possess a good level of written and oral
English. Even though they may eventually learn French during their stay,
French knowledge is not obligatory.

* Application procedure
Interested candidates should send their application package electronically
to Sanjay Dominik Jena (sanjay.jena@cirrelt.ca). The application should
contain the following documents:
- Cover letter explaining the motivation to perform a Ph.D. in one of the
domains mentioned above in Montreal, your research interests, as well as
your preferred starting date
- Detailed curriculum vitae with list of publications (if any)
- Grade records of Bachelor and Master programs
- Reference letters or contact details of references (one of them should be
the supervisor of the candidate's Master studies)

If you have further questions regarding these positions, possible research
topics, etc., please contact Sanjay Dominik Jena (sanjay.jena@cirrelt.ca).
Positions will remain available until filled.
**********************************************************
*
* 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] Final Reminder for Workshop on Random Graphs and Random Processes - King's College London

A final reminder for next week's one-day Workshop on Random Graphs and Random Processes at King's College, London on Tuesday the 25th April. The workshop will include talks by the following speakers;

Fabio Caccioli (UCL), Alan Frieze (CMU), Leslie Ann Goldberg (Oxford), Reimer Kuehn (KCL), Riccardo Margiotta (KCL), Nicolas Rivera (KCL), Thomas Sauerwald (Cambridge), Fiona Skerman (Bristol), Gregory Sorkin (LSE) and Andrew Wade (Durham).

Attendance is free, but if you plan to attend, it would be helpful if you could register at our website, where further details are available;

https://workshoponrandomgraphs.eventbrite.co.uk/<https://emea01.safelinks.protection.outlook.com/?url=https%3A%2F%2Fworkshoponrandomgraphs.eventbrite.co.uk%2F&data=01%7C01%7Ccolin.cooper%40kcl.ac.uk%7C7d39052ee8e246c3d81008d4647ab0fc%7C8370cf1416f34c16b83c724071654356%7C0&sdata=RFb5dyhI0kSWtvINo1g9E3O1NgAAMMg%2Fcg6%2FEuR%2BI4Q%3D&reserved=0>

Please note that the talks will take place in the Harvard lecture theatre in Bush house, not the Anatomy lecture theatre as previously advertised.

Thanks to support from the LMS, we will be able to provide some support towards travel costs for UK-based research students. For enquiries contact Andrew McDowell (andrew.mcdowell@kcl.ac.uk<mailto:andrew.mcdowell@kcl.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/
*
**********************************************************

[DMANET] PLS 11 Last Call

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

PLS11: THE ELEVENTH PANHELLENIC LOGIC SYMPOSIUM

July 12-16, 2017, Delphi, Greece

The National and Kapodistrian University of Athens and

the National Technical University of Athens.

The University of Cyprus will help in the organization.

http://pls11.cs.ntua.gr/

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

IMPORTANT DATES

Deadline for submission: Sunday, April 30, 2017 (EXTENDED)

Notification: Friday, May 26, 2017

Final copy due: Friday, June 16, 2017

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

INVITED TALKS

- Zoé Chatzidakis, Ecole Normale Supérieure, Paris

- Hannes Leitgeb, Ludwig-Maximilians-Universität München

- Yiannis Moschovakis, University of California, Los Angeles

- Andrea Sorbi, Università di Siena

- Wolfgang Thomas, Rheinisch-Westfälische Technische Hochschule, Aachen

- Timothy Williamson, University of Oxford

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

TUTORIALS

- Valentina Harizanov, George Washington University

"Computable Model Theory"

- Ya'acov Peterzil, University of Haifa,

"O-minimality"

- Anand Pillay, University of Notre Dame

"Model Theory"

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

SPECIAL SESSIONS:

Computability Theory (Organizer: Alexandra Soskova)

- Damir Dzhafarov, University of Connecticut

- Ekaterina Fokina, Vienna University of Technology

- Andy Lewis-Pye, London School of Economics

- Joseph Miller, University of Wisconsin, Madison

- Antonio Montalban, University of California, Berkeley

- Paul Shafer, University of Gent

Model Theory (Organizers: Pantelis Eleftheriou, Rizos Sklinos)

- Artem Chernikov, University of California, Los Angeles

- Amador Martin-Pizarro, Université Lyon 1

- Sergei Starchenko, University of Notre Dame, TBC

- Frank Wagner, Université Lyon 1

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

LAST CALL FOR PAPERS

The Scientific Committee cordially invites all researchers in the

area of the conference to submit their papers until April 30, 2017

(in PDF-format, in English, at most 6 pages) for presentation at

PLS11 to htps://www.easychair.org/conferences/?conf=pls11.

Papers should be prepared using the EasyChair class style

from http://www.easychair.org/publications/?page=1594225690).

All submitted papers will be reviewed by the Scientific Committee

of the symposium, who will make final decisions on acceptance.

During the symposium, each accepted paper will be presented

(a twenty minutes talk) by one of its authors, with five extra

minutes for questions.

If possible, each submitted paper should be classified in one of

the following areas:

- Ancient Logic

- Computability Theory

- History and Philosophy of Logic

- Logic in Computer Science

- Model Theory

- Nonclassical and Modal Logics

- Proof Theory

- Set Theory

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

POSTER SESSION

Graduate students and young researchers are invited to submit a short

abstract on work in progress. Authors of accepted abstracts will have

an opportunity to present their results in poster form in a special

poster session. Interested students and young researchers should

submit abstracts of no more than one page in PDF form by June 2, 2017,

by sending them by e-mail to: pls11@softlab.ntua.gr

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

GRANTS

ASL Student Travel Grants:

PLS11 is sponsored by the Association for Symbolic Logic. All student

members of the ASL can apply for travel funding. To be considered for

a Travel Award, please (1) send a letter of application, and (2) ask

your thesis supervisor to send a brief recommendation letter. The

application letter should be brief (preferably one page) and should

include: (1) your name; (2) your home institution; (3) your thesis

supervisor's name; (4) a one-paragraph description of your studies and

work in logic, and a paragraph explaining why it is important to

attend the meeting; (5) your estimate of the travel expenses you will

incur; (6) (for citizens or residents of the USA) citizenship or visa

status; and (7) (voluntary) indication of your gender and minority

status. Women and members of minority groups are strongly encouraged

to apply. Applications should be sent to asl@vassar.edu before April

12, 2017.

EMS grants for Young Researchers:

Thanks to the generous support from European Mathematical Society,

PLS11 is glad to be able to offer free registration for Masters and

PhD students in Logic and young early career researchers for

participating at PLS 11. In order to apply for grants please send a CV

to pls11@softlab.ntua.gr until April 30, 2017.

Preference will be given to researchers who submitted a paper.

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

REGISTRATION

Participants will be asked to pay a registration fee. The fee can be

paid at the reception, upon receiving the badge and the other

materials of the symposium. Alternative ways of payment will be

announced in due time.

The registration fee covers:

- Symposium attendance

- Symposium proceedings

- Coffee breaks and joint lunches (1 or 2) that will be offered at

the Delphi center

- Excursion, including dinner

- Transportation to and from Athens' airport with a scheduled bus

(details will be announced in due time)

Registration fees

- Normal registration fee (for participants who will reclaim it from

professional/academic sources): 150€

- Normal student registration fee (for students who will reclaim it

from professional/academic sources): 100€

- Reduced registration fee (for participants who will cover it from

own sources): 70€

- Reduced student registration fee (for students and also for

unemployed): 35€

Student or unemployed participants are expected to provide proof of

studentship or unemployment upon registration.

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

SCIENTIFIC COMMITTEE

- Costas Dimitracopoulos, National and Kapodistrian University of Athens

- Pantelis Eleftheriou, Universität Konstanz

- Vassilis Gregoriades, Università di Torino

- Antonis Kakas, University of Cyprus

- Lefteris Kirousis, National and Kapodistrian University of Athens

- Nikolaos Papaspyrou, National Technical University of Athens

- Thanases Pheidas, University of Crete

- Rizos Sklinos, Université Lyon 1

- Alexandra Soskova, Sofia University, Chair

- George Tourlakis, York University, Canada

- Stathis Zachos, National Technical University of Athens

ORGANIZING COMMITTEE

- Antonis Kakas, University of Cyprus, Chair

- Nikolaos Papaspyrou, National Technical University of Athens

- Panos Rondogiannis, National and Kapodistrian University of Athens

- Petros Stefaneas, National Technical University of Athens

- Yannis Stephanou, National and Kapodistrian University of Athens

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

SYMPOSIUM WEBPAGE: http://pls11.cs.ntua.gr/

E-MAIL: pls11@softlab.ntua.gr

CONTACTS:

- Alexandra Soskova <asoskova@fmi.uni-sofia.bg>

Chair of the Scientific Committee

- Antonis Kakas <antonis@ucy.ac.cy>

Chair of the Organizing Committee

**********************************************************
*
* 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] PhD position: Order structures in bi-partite data, (at University of Kassel)

The International Centre for Higher Education Research (INCHER-Kassel)
is opening a new

PhD position (salary scale TV-H E13, 100%)

as part of the ELBHA-Project. The position is supervised by Prof. Dr.
Gerd Stumme at the Knowledge
and Data Engineering Group of the Unversity of Kassel. The successful
candidate will research and
develop methods and algorithms to discover order structures in
bi-partite data.

The position is part of the graduate school "Elitereproduktion im
Wandel? Die Bedeutung der
Hochschulausbildung für Karriereverläufe in verschiedenen
Gesellschaftsbereichen (ELBHA)", which was
introduced by the University of Kassel in order to sharpen and increase
the research quality for young
academics.

We welcome talented and highly motivated candidates with interest in
data mining, knowledge
representation and mathematics, as well as applications in economics and
the social sciences. The
position requires a very good knowledge in discrete structures.
Furthermore, a high social competency,
good programming skills, as well as a very good command of the English
language.
Applicants to the PhD position must have a relevant Master's degree in
Computer Science,
Mathematics, Physics or a related field.

The position is (at first) limited to 3 years (cf.
"Qualifikationsstelle" gem. § 65 HHG i. V. m. § 2 Abs. 1
Satz 1 WissZeitVG; Promotionsmöglichkeit). Applications are accepted as
of now until 2017-05-02.

The University of Kassel is an equal opportunity employer. A significant
increase in the proportion of
women in research and teaching is being sought. Qualified women are
therefore expressly invited
to apply. In case of equal qualification, persons with disabilities who
are severely handicapped will
be given preferential consideration. Please send your complete
application (including all necessary
documents and a letter of intent) to kde-office@cs.uni-kassel.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] PhD position in Eindhoven on formal verification and GPU computing

The Model Driven Software Engineering section at Eindhoven University of Technology (TU/e) offers one PhD position on the development of GPU accelerated symbolic model checking techniques, within the NWO TOP project:

GEARS: GPU Enabled Accelerated Reasoning about System designs


Starting date of the position: as soon as possible.

DESCRIPTION

The development of complex hard- and software systems is error-prone and costly. One technique that can provide very valuable feedback on the correctness of system designs is model checking. It involves exhaustively analysing a system design to determine whether it satisfies desirable functional properties. However, it is computationally very demanding.

The GEARS project is led by dr.ing. Anton Wijs. At the TU/e, he develops model checking techniques that are accelerated by the use of graphics processing units (GPUs). GPUs offer great potential for parallel computation, while keeping power consumption low. However, not all types of computation can trivially be performed on GPUs, sometimes the algorithms need to be entirely redesigned. Currently, he has an explicit-state model checker, called GPUexplore, that can run hundreds of times faster than conventional model checking approaches.

Regarding symbolic model checking techniques, IC3 is currently state-of-the-art; it can analyse large designs in reasonable time, but its limitations still mean that it is not used very commonly for the design of systems today. IC3 uses SAT solving, or the solving of Boolean or propositional satisfiability problems, as a subroutine.

In the GEARS project, the candidate will investigate whether GPUs can be employed for IC3. First of all, the candidate will investigate how SAT solving can be accelerated using GPUs, specifically focussing on SAT problems that stem from model checking. Second of all, (s)he will investigate how IC3 can benefit from using GPUs. IC3 is reportedly parallelisable, but how GPUs can be used to do so most effectively is still an open question.

The project potentially has an enormous impact, since IC3 is currently state-of-the-art in symbolic model checking, and SAT solving is used not only for model checking, but in many different application domains.

The research will be conducted in the Model Driven Software Engineering section of the Computer Science department at TU/e. This section consists of two research groups, Formal System Analysis (FSA) and Software Engineering and Technology (SET). The FSA group studies techniques to model and analyse discrete system behaviour in a mathematically rigorous way, while the SET group develops methods and tools for time- and cost-efficient evolution of high-quality software systems.

REQUIREMENTS

We are looking for candidates that meet the following requirements:

- MSc in Computer Science;
- Experience in, and enthusiasm for, programming (not necessarily parallel programming);
- Good communicative skills in English, both in speaking and writing. Candidates should be prepared to prove their English language skills.

Besides the above requirements, the candidate should also fit at least one of the two following profiles:

1. The candidate has knowledge of formal verification and experience in the involved algorithms, and is interested in programming GPU applications to speed up model checking. This includes having an interest in learning about the hardware characteristics of GPUs, and how to optimise applications that run on them.

2. The candidate has knowledge of parallel programming / high performance computing (not necessarily GPU programming in particular), and is interested in learning about formal verification. This includes learning the theory of model checking and SAT solving. At TU/e, the MDSE section provides courses on these topics that can be attended by the candidate.

Candidates that fit both profiles are particularly encouraged to apply.

WORKING CONDITIONS:

We offer:
• full-time employment as a PhD-candidate for a period of 4 years;
• a gross salary of € 2.191 per month in the first year increasing up to €2.801 in the fourth year;
• annually 8% holiday allowance and 8.3% end of year allowance;
• support with your personal development and career planning including courses, summer schools, conference visits etc.;
• a broad package of fringe benefits (including an excellent technical infrastructure, child care, moving expenses, savings schemes, coverage of costs of publishing the dissertation and excellent sports facilities).

INFORMATION AND APPLYING

For more information about the project, please contact dr.ing. Anton Wijs, e-mail: A.J.Wijs@tue.nl<mailto:A.J.Wijs@tue.nl>

For information about employment conditions, please contact Pim Hertogs LLM MSc (HR advisor), e-mail: pzwin@tue.nl<mailto:pzwin@tue.nl>

The application should consist of the following parts:
• a motivation letter;
• a Curriculum Vitae;
• copies of your diplomas together with the list of grades, and other relevant certificates;
• names and addresses of two referees;
• proof of English language skills (if applicable);
• a 2-page research statement about the project topics.

Please apply by submitting the above documents via this website:
http://jobs.tue.nl/en/vacancy/phd-position-project-gears-311483.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] CSR 2017: Call for Participation

CALL FOR PARTICIPATION - CSR 2017

12th International Computer Science Symposium in Russia
June 8-12, 2017, Kazan, Russia

Organized by Kazan Federal University
http://csr2017.kpfu.ru/

*** WE STRONGLY ADVISE TO REGISTER BEFORE APRIL 25 ***

CSR 2017 is the twelfth conference in a series of regular events spanning all areas of computer science. This year it is mainly focused on its theoretical aspects.

The program of CSR 2017 consists of an opening lecture, 5 invited lectures and 22 contributed papers.

Opening lecture by
Thierry Coquand (Chalmers)

Invited lectures by
Javier Esparza (Munich)
Elham Kashefi (Paris and Edinburgh)
Andrew McGregor (Amherst)
Ronitt Rubinfeld (MIT)
Marc Zeitoun (Bordeaux)

The list of accepted papers and preliminary schedule can be found on the conference web site.

Two workshops are organized in conjunction with CSR-2017, one in Kazan and one in Moscow:

-- A pre-conference Workshop on Computation and cryptography with qu-bits will be held in Kazan on June 7. It will be dedicated to the discussion of different topics of theory of computation, computational complexity and cryptography.

-- The Workshop "Complexity of Computation, Communication, Descriptions and Proofs" is organized in Moscow on June 14. It may be convenient to attend it right after CSR-2017: https://cs.hse.ru/big-data/tcs-lab/cccdp/ .
For this workshop, please contact its organizers directly: Vladimir Podolskii vpodolskii@hse.ru .

The early registration fee for CSR-2017 of 265 euros (170 euros for students) should be paid before April 25, 2017. The late registration fee is 350 euros (220 euros for students).

The online registration form is provided by Monomax PCO. You can use this form to:
-- Pay the registration fee.
-- Request visa support. We strongly recommend to start preparing Russian visa documents as soon as possible (for some countries, it takes a few months to get a visa). See detailed visa instructions.
-- Book a hotel. The online registration form provides a number of hotels within walking distance from the conference venue.
In the online form, first select all required services and then pay for everything (either by a card or via a bank transfer; see available payment options). In case of any questions concerning the online registration form, please contact Monomax PCO (email: csr2017@onlinereg.ru, phone: +7 812 335 20 55, ext. 201). See also the frequently asked questions.

Symposium chair: Farid Ablayev (Kazan Federal University).

Further information and contacts:
 Web: http://csr2017.kpfu.ru/
 Email: csr2017@onlinereg.ru

UNSUBSCRIPTION: If you do not wish to receive any news
regarding CSR conferences, please reply to this mail
and we will remove you from the mailing list.
**********************************************************
*
* 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 - 10th International Workshop on Computational Optimization

Call for Papers

10th International Workshop on Computational Optimization (WCO17)
Prague, Czech Republic, September 4-7, 2017

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

IEEE CS is a technical co-sponsor of FedCSIS 2017

https://fedcsis.org/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 WCO17 paper will be awarded during the social dinner of FedCSIS2017.
The best paper will be selected by WCO17 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 (Position paper will only appear in the
conference proceedings).
* Extended versions of selected papers presented at WCO17 will be
published in edited books of the series "Studies of Computational
Intelligence", Springer.

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

Important dates:

Paper submission (sharp / no extensions) : May 10th, 2017
Position paper submission : May 31th, 2017
Author notification : June 14th, 2017
Final paper submission and registration : June 28, 2017
Conference date : September 4-7, 2017

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

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 :
wco2017@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/
*
**********************************************************

Tuesday, April 18, 2017

[DMANET] CALL FOR CONTRIBUTED TALKS - Workshop on Algorithms and Structure

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

CALL FOR CONTRIBUTED TALKS

Workshop on Algorithms and Structure

for Sparse Graphs

July 14, 2017

University of Warsaw, Poland

URL: http://sparsity2017.mimuw.edu.pl/

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


The Workshop on Algorithms and Structure for Sparse Graphs will take place on Friday, July 14, 2017 at University of Warsaw, Poland as a satellite event of ICALP 2017 (July 10-13, 2017).


The goal of the workshop is to provide an opportunity to present research, exchange ideas and foster collaboration among researchers interested in algorithmic graph structure theory, structure theory of sparse graphs and logic in computer science.


The scientific program will consist of three invited lectures, three contributed presentations and an open problem session.


If you would like to contribute with a 25 minute talk, please send an email with the subject "Workshop on Algorithms and Structure" with your title and short abstract to siebertz@mimuw.edu.pl until April 25. Since the number of contributed talks is limited, we will notify all potential speakers on whether their talk is accepted by May 5.



Invited Lectures:


Dan Král', University of Warwick, England

Stephan Kreutzer, Technical University Berlin, Germany

Felix Reidl, North Carolina State University, USA


Registration is via the conference website of ICALP http://icalp17.mimuw.edu.pl/


The registration fee will be about 50Eur, and covers lunch and coffee breaks.



The organizers,


Michał Pilipczuk, University of Warsaw (michal.pilipczuk@mimuw.edu.pl)

Sebastian Siebertz, University of Warsaw (siebertz@mimuw.edu.pl)

**********************************************************
*
* 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, April 17, 2017

[DMANET] CG: YRF - deadline extended to April 21

The deadline for CG:YRF has been extended to Friday, April 21,
23:59 Honolulu time.

-----------

Computational Geometry: Young Researchers Forum -- Final Call
=============================================================

The 33rd Symposium on Computational Geometry (SoCG) will take place July 4-7, 2017 in Brisbane, Australia. It brings together the global community of researchers who work on a large variety of aspects that combine geometry, algorithms and applications. To allow a broad audience to actively participate in the community's major scientific event, this year SoCG will again be accompanied by a series of satellite events, which together constitute "CG Week 2017". See http://socg2017.smp.uq.edu.au/ for details.

One of these satellite events will be the "Computational Geometry: Young Researchers Forum" (CG:YRF), which is aimed at current and recent students. The active involvement by students and recent graduates in research, discussions, and social events has been longstanding tradition in the CG community. Participation in a top-level event such as SoCG can be educating, motivating, and useful for networking, both with other students and with more senior scientists.

The YRF presents young researchers (defined as not having received a formal doctorate before 2015) an opportunity to present their work (in progress as well as finished results) to the CG community in a friendly, open setting. Just like in the main event, presentations will be given in the form of talks. A pre-screening (but no formal review process) will ensure appropriate quality control.

Submission guidelines:
----------------------
- The idea of the event is for young researchers to present new and ongoing work. Therefore, the work should not have appeared in print in a formally reviewed proceedings volume or journal by the time of submission, and at least one author must be young researcher.
- Topics must fit into the general context of SoCG, as described in the call for SoCG submissions.
- A submission must be in the form of a 2-page abstract, formatted according to a style file provided at the SoCG web page and submitted via easychair at
https://easychair.org/conferences/?conf=cgyrf2017
- Accepted abstracts will be compiled in a booklet of abstracts that will be distributed among the participants; this should not be considered a formal publication. In particular, participants are encouraged to submit (an extended version of) their presented work to a conference with formal proceedings and/or to a journal.
- The work must be presented at CG:YRF by an author who is a young researcher, else it will be removed from the program.

We will employ a two-phase screening process. After the first review phase, there will be a notification of either rejection (if the result is clearly out of context, or technically incorrect), or conditional acceptance, accompanied with a description of required changes to be made (either with respect to content or format). In the second phase, we will check whether the changes have been implemented satisfactorily. The screening process is intended to ensure the technical quality of the presented work. Submissions that are not well written risk rejection, irrespective of correctness. Authors are requested to have their submissions proofread by their advisor or another experienced scientist.

Important dates (deadlines are 23:59 Honolulu time):
----------------------------------------------------
- April 21, 2017 (extended!): Deadline for submissions
- May 12, 2017: Notification of conditional acceptance
- May 19, 2017: Deadline for revisions
- May 26, 2017: Notification of acceptance
- July 3-7, 2017: CG-Week 2017

YRF Program Committee
---------------------
Therese Biedl, University of Waterloo, Canada (chair)
Arijit Bishnu, Indian Statistical Institute, India
Stephane Durocher, University of Manitoba, Canada
Seok-hee Hong, University of Sydney, Australia
John Iacono, New York University, USA
Clement Maria, University of Queensland, Australia
David Mount, University of Maryland, USA
Yoshio Okamoto, The University of Electro-Communications, Japan
**********************************************************
*
* 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 2017] S3: SIGEVO SUMMER SCHOOL

***************************************************************
*** S I G E V O S U M M E R S C H O O L
***
*** For GECCO students!
*** We have grants to ease your participation!
***************************************************************
.......... Held along with ACM GECCO 2017 Conference ..........

July 14-20-21 (plus activities in July 15-19) BERLIN

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

>>> Only 30 positions are available for students: tell us on your
participation during the registration process of GECCO 2017 <<<

*** Call for Participation***


SIGEVO is a special interest group of ACM always looking for new ways to
improve the research and learning on genetic and evolutionary computation.

In this quest for disseminating the knowledge and making activities in
this domain we will organize, for the first time, a Summer School around
GECCO 2017 in Berlin: S3 (Sigevo Summer School).


We seek for PhD students to participate in this great event, offering:

1. One day before GECCO (July 14th), with lectures and interactions to
world class researchers in this domain.

2. Two days after GECCO (July 20th and 21st) of discussions,
presentations, and joint works.

3. Oriented interactions and learning in tutorials and sessions of GECCO.

4. Great networking opportunities and up to 6 awards to recognize
outstanding performance.


The many appealing activities during S3 will include:

- A first day (get together) where students will meet each other, form
groups, and listen to short lessons. An assignment will be done to
students and links for a close interaction to mentors will be created
for the whole school and conference duration.

- Questions, competitions and awards (economic plus diploma prizes) will
be offered to the students who perform the best, granted at the end of
the summer school. We have up to 6 awards in different categories: come
and participate!

- Opportunities to attend a big number of high quality GECCO tutorials
plus continuous interaction to the summer school staff and mentors, what
will raise the abilities and vision of students: don't miss this.

- The first day after GECCO, students will discuss with mentors, so as
to finish their assignments. Also, the staff in S3 will evaluate during
this day the solution to the questions made the first day and offer, on
the very last day, the results and winners.

- The last day of the summer school (two days after GECCO) students will
present their assignments to the whole board of mentors. Enjoy this
boosting to your knowledge, your PhD thesis, and your networking to this
community!


STUDENTS ARE EXPECTED TO:
--------------------------------------------
- Attend *ALL* the 1+2 days of S3, plus attending some tutorials and
sessions of GECCO 2017.

- Have a valid registration to GECCO itself, plus a small fee of 100
euros to participate in the school.

- Fulfill an assignment, participate in the school challenges, and
follow the standards of proper social and research behavior.


Students of the S3 will be eligible for travel, register and lodging
grants of GECCO.

See the special section on S3 that will appear soon in the web page of
GECCO: http://gecco-2017.sigevo.org/index.html/Summer+School

Any comments or questions on the school organization, please contact
Prof. Enrique Alba (eat@lcc.uma.es).

Cheers,

Prof. Enrique Alba
University of Malaga
SPAIN

--
Javier Ferrer
E.T.S. Ingeniería Informática
University of Málaga
Tel: +34 95213 2815
Fax: +34 95213 1397
ferrer [at] lcc.uma.es
http://neo.lcc.uma.es/staff/javi/

*********************************
Publicity Chair for GECCO 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] PostDoc positions in Approximation Algorithms at IDSIA, University of Lugano, Switzerland

The Algorithms and Complexity Group of IDSIA, University of Lugano
(Switzerland), opens one PostDoc position in approximation algorithms.
This position is supported by the
Swiss National Foundation Grant "Approximation Algorithms for Network Problems".

The appointment is for one year, with tentative starting date on 1st
November 2017.
The gross salary is roughly 80.000 CHF per year (low taxes, around 15%).
There are no teaching duties and there is generous travel support.
The ideal candidate should hold (or be close to obtaining) a Ph.D. in
Computer Science, and should have a solid
publication record in the area of algorithms and complexity (possibly
in approximation algorithms). Top conferences in this area include
STOC, FOCS, SODA, ICALP, and ESA.

Team members will have the opportunity to cooperate with the
Algorithms and Complexity group at IDSIA, which currently counts 7
researchers. The current research interests of the group include:
- network design;
- resource allocation and scheduling problems;
- geometric packing problems;
- "fast" approximation algorithms.

IDSIA offers an international working environment. Lugano is a tidy
and lively town, with a wonderful view on Ceresio lake and mountains
around. Ticino Canton offers many opportunities for hiking, biking,
skiing, etc. Local restaurants serve very good (Italian style!) food.

Further details about the project can be found at:
http://people.idsia.ch/~grandoni/SNF2015.html

The interested candidates should email
- a detailed CV, including a list of publications and 2-3 references, and
- a short summary of past and current research interests
to:
fabrizio@idsia.ch

Applications should be sent as soon as possible, and in any case no
later than May 15th, 2017.
For any question, do not hesitate to contact:

Prof. Fabrizio Grandoni
fabrizio@idsia.ch
http://people.idsia.ch/~grandoni/
**********************************************************
*
* 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, April 16, 2017

[DMANET] Call-for-Papers: 17th Haifa Workshop on Graphs, Combinatorics and Algorithms June 5-8, 2017

Reminder:
Call-for-Papers

17th Haifa Workshop on Interdisciplinary Applications of
Graphs, Combinatorics and Algorithms

June 5-8, 2017, University of Haifa, Israel

The last two days will be held together with a
60th Birthday Theory Conference for Ilan Newman on June 7-8, 2017

CONFIRMED INVITED GRAPH SPEAKERS
Steve Chaplick, Frederic Maffray, Myriam Preissmann,
Dieter Rautenbach, Bernard Ries, Gyorgy Turan

CONFIRMED INVITED THEORY SPEAKERS
Noga Alon, Hagit Attiya, Harry Buhrman, Michael Elkin, Michael
Krivelevich,
Nati Linial, Yishay Mansour, Noam Nisan, Yuval Rabani, Alex Samorodnitsky

*** Call For SUBMISSIONS ***

The Haifa Graph Workshop emphasizes the diversity of the use of combinatorial
algorithms and graph theory in application areas.
Examples of such areas of interest include:

Randomized Algorithms
Networking
Graph Algorithms
Internet Congestion and Patterns
Graphs and Patterns in Computational Biology
Applied Combinatorics
Web Applications
Geometric Graphs and Computation
Optimization
Graph Theoretic Models

The workshop is non-archival and has no proceedings; accepted abstracts
will be available online. Papers that have been accepted to recent top
international conferences are particularly welcome, and should be so
indicated in the submission.

Please submit abstracts (1-2 pages) to haifagraph2017@gmail.com
IMPORTANT DATES:
Submission Deadline: May 1, 2017
Notification: May 11, 2017
Workshop: June 5-8, 2017

Haifa Graph Workshop
General Chair: Martin Golumbic
Program Chair: Vadim Levit
Committee: Eugen Mandrescu, Michal Stern, Deepak Rajendraprasad

Ilan@60 Theory Conference
General Chair: Yuri Rabinovich
Committee: Oren Ben-Zwi, Oded Lachish, Deepak Rajendraprasad,
Guy Wolfovitz

SPECIAL SESSIONS
Proposals to organize a Special Session can be sent to
Martin Golumbic <golumbic@cs.haifa.ac.il> .

REGISTRATION: The registration site will open mid-May.

IMPORTANT DATES:
Submission Deadline: May 1, 2017
Notification: May 11, 2017
Workshop: June 5-8, 2017

For further inquiries, please contact the CRI coordinator:

Mr. Tamir Gadot <tgadot@univ.haifa.ac.il>
Tel: +972-4-8288337; Fax: +972-4-8288181

**********************************************************
*
* 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, April 14, 2017

[DMANET] 2nd Call for Participation: Highlights of Algorithms 2017, Berlin, Germany

-------------------------------------------------------------------
Highlights of Algorithms - HALG 2017
June 9-11, 2017, Berlin, Germany
highlightsofalgorithms.org
-------------------------------------------------------------------

The Highlights of Algorithms conference is designed to be a forum for presenting the highlights of recent developments in algorithms and for discussing potential further advances in this area. The conference will provide a broad picture of the latest research in algorithms through a series of survey and invited talks, as well as possibility for all researchers and students to present their recent results through a series of short talks and poster presentations. Attending the Highlights of Algorithms conference will also be an opportunity for networking and meeting leading researchers in algorithms.

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

PROGRAM

The conference will begin on Friday, June 9, at 8:45 and end on Sunday, June 11, at 17:45. On Friday evening at 18:00 there will be a poster session with reception. On Saturday evening at 18:00 there will be another poster session and at 19:00 the Business Meeting will take place.

A detailed schedule and a list of all accepted posters can be found at: highlightsofalgorithms.org

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

REGISTRATION

Please register on our webpage highlightsofalgorithms.org by choosing the menu item "Registration" and following the instructions there. We have done our best to keep registration fees at a minimum:

Early registration (by April 30, 2017)
- academic rate (incl. postdocs): 150€
- student rate: 110€

Regular registration (by May 31, 2017)
- academic rate (incl. postdocs): 190€
- student rate: 150€

On-site registration: 250€

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

CONFERENCE VENUE

The symposium will take place at TU Berlin (Str. des 17. Juni 136, 10623 Berlin, Germany) in the heart of the city close to the Tiergarten park.

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

INVITED SPEAKERS

Survey Speakers:

- Sanjeev Arora, Princeton University
- László Babai, University of Chicago
- Nikhil Bansal, TU Eindhoven
- Claire Mathieu, École normale supérieure
- Tim Roughgarden, Stanford University


Invited Speakers:

- Karl Bringmann, MPI for Informatics
- Constantinos Daskalakis, MIT
- Ilias Diakonikolas, USC
- Zachary Friggstad, U Alberta
- Mohsen Ghaffari, MIT
- Bart M. P. Jansen, TU Eindhoven
- David Karger, MIT
- Sanjeev Khanna, U Penn
- Mathias Bæk T. Knudsen, U Copenhagen
- Simon MacKenzie, U New South Wales
- Aleksander Madry, MIT
- Marco Mondelli, ETH
- Renato Paes-Leme, Google
- Merav Parter, MIT
- Ilya P. Razenshteyn, MIT
- Aviad Rubenstein, Berkeley
- Ami Paz, Technion
- Sushant Sachdeva, Google
- Aravind Srinivasan, U Maryland
- Gregory Valiant, Stanford
- S. Matthew Weinberg, Princeton

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


**********************************************************
*
* 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] Fundamentals of Computation Theory (FCT 2017) – 2nd CFP

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

*** Second Call for Papers ***

FCT 2017

21st International Symposium on
Fundamentals of Computation Theory

September 11-13, 2017
Bordeaux, France

http://fct2017.labri.fr/


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

*** The submission server at
*** https://easychair.org/conferences/?conf=fct2017
*** is now open.

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

Authors are invited to submit original research papers in all areas
related to the Foundations of Computer Science (algorithms, formal
methods, emerging fields of study).


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

Abstract Registration: May 1, 2017 (AoE)
Paper Submission: May 6, 2017 (AoE)
Notification to authors: June 16, 2017
Camera-ready submission: June 28, 2017
Symposium: September 11-13, 2017


=========
ABOUT FCT
=========

The Symposium on Fundamentals of Computation Theory (FCT) was
established in
1977 for researchers interested in all aspects of theoretical computer
science,
and in particular algorithms, complexity, formal and logical methods.
FCT is a
biennial conference. The last preceding Symposia were held in Gdansk,
Liverpool,
Oslo, Wrocław, Budapest, Lübeck.

FCT 2017 will take place in Bordeaux, which is located in the South
West of France.
The region is famous for its wines and its gastronomy. The city centre
of Bordeaux
is classified at the Unesco World Heritage.


================
INVITED SPEAKERS
================

There will be four invited talks at FCT 2017. The invited speakers are:
Thomas Colcombet, Martin Dietzfelbinger, Juraj Hromkovic and Anca
Muscholl.

There will also be one invited talk in memoriam of Zoltan Esik given by
Jean-Eric Pin.


=====
SCOPE
=====

The program committee is soliciting original and significant research
contributions to the Fundamentals of Computation Theory, including (but
not limited to):


Algorithms:

- algorithm design and optimization
- approximation, randomized, and heuristic methods
- circuits and boolean functions
- combinatorics and analysis of algorithms
- computational algebra
- computational and parameterized complexity
- computational geometry
- distributed and parallel computing
- online algorithms
- streaming algorithms

Formal methods:

- algebraic and categorical methods
- automata and formal languages
- computability and nonstandard computing models
- database theory
- foundations of concurrency and distributed systems
- logic and model checking
- models of reactive, hybrid and stochastic systems
- principles of programming languages
- program analysis and transformation
- security
- specification, refinement and verification
- type systems

Emerging fields:

- ad hoc, dynamic and evolving systems
- algorithmic game theory
- computational biology
- foundations of cloud computing and ubiquitous systems
- quantum information and quantum computing


===========
PROCEEDINGS
===========

Conference proceedings will be published in the ARCoSS subline of the
Springer "Lecture Notes in Computer Science" series.


=============
SPECIAL ISSUE
=============

Selected papers will be invited to a special issue of the "Journal of
Computer and System Sciences", devoted to FCT 2017.
(https://www.journals.elsevier.com/journal-of-computer-and-system-sciences/)


======
AWARDS
======

Awards will be given to the best paper and the best student paper. To be
eligible for the best student paper award, at least one of the paper
authors
must be a full-time student at the time of submission, and the student(s)
must have made a significant contribution to the paper.


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

Authors are invited to submit high-quality manuscripts reporting original
unpublished research in the topics related to the symposium. Simultaneous
submission to other conferences or workshops with published proceedings
is not allowed. It is required that each accepted paper be presented at
the conference by one of its authors.

Submissions must not exceed 12 pages formatted according to LNCS
style plus an optional, clearly marked appendix of reasonable length
(to be read at the program committee's discretion). The first page
must include an indication of whether the paper is eligible for the
best student paper award.

The submission system can be accessed via http://fct2017.labri.fr/.


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

Parosh Aziz Abdulla (Uppsala University, Sweden)
Petra Berenbrink (Universität Hamburg, Germany)
Nathalie Bertrand (Inria Rennes, France)
Benedikt Bollig (CNRS & ENS Cachan, France)
Patricia Bouyer (CNRS & ENS Cachan, France)
Véronique Bruyère (University of Mons, Belgium)
Arnaud Casteigts (University of Bordeaux, France)
Hubie Chen (Universidad del País Vasco and
Ikerbasque,Spain)
Colin Cooper (King's College London, UK)
Kevin P. Costello (University of California at Riverside, USA)
Jurek Czyzowicz (Université du Quebec en Outaouais, Canada)
Martin Dietzfelbinger (Technische Universität Ilmenau, Germany)
Robert Elsässer (University of Salzburg, Austria)
Thomas Erlebach (University of Leicester, UK)
Paola Flocchini (University of Ottawa, Canada)
Pierre Fraigniaud (CNRS and University Paris Diderot, France)
Luisa Gargano (Università di Salerno, Italy)
Sun-Yuan Hsieh (National Cheng Kung University, Taiwan)
Stefan Kiefer (University of Oxford, UK)
Ralf Klasing (co-Chair) (CNRS and University of Bordeaux, France)
Dieter Kratsch (Université de Lorraine - Metz, France)
Manfred Kufleitner (University of Stuttgart, Germany)
Fabian Kuhn (University of Freiburg, Germany)
Thierry Lecroq (University of Rouen, France)
Jérôme Leroux (Bordeaux University, France)
Leo Liberti (LIX, Ecole Polytechnique, France)
Markus Lohrey (University of Siegen, Germany)
Frédéric Magniez (CNRS and University Paris Diderot, France)
Wim Martens (Universität Bayreuth, Germany)
Pierre McKenzie (Universite de Montreal, Canada)
Madhavan Mukund (Chennai Mathematical Institute, India)
Nicolas Nisse (Université Côte d'Azur, Inria, CNRS,
I3S, France)
Vangelis Th. Paschos (University Paris-Dauphine, France)
Joseph G. Peters (Simon Fraser University, Canada)
Guido Proietti (University of L'Aquila, Italy)
Tomasz Radzik (King's College London, UK)
R. Ramanujam (Institute of Mathematical Sciences,
Chennai, India)
Jean-François Raskin (Université Libre de Bruxelles, Belgium)
José Rolim (University of Geneva, Switzerland)
Sylvain Salvati (University of Lille, France)
Maria José Serna Iglesias (Universitat Politecnica de Catalunya, Spain)
Jean-Marc Talbot (Aix-Marseille University, France)
Laurent Viennot (Inria Rocquencourt, France)
Gerhard Woeginger (Aachen University, Germany)
Marc Zeitoun (co-Chair) (University of Bordeaux, France)


==================
STEERING COMMITTEE
==================

Bogdan Chlebus (University of Colorado, USA)
Marek Karpinski (chair) (University of Bonn, Germany)
Andrzej Lingas (Lund University, Sweden)
Miklos Santha (CNRS and University Paris Diderot, France)
Eli Upfal (Brown University, USA)


====================
ORGANIZING COMMITTEE
====================

Arnaud Casteigts (co-Chair) (University of Bordeaux, France)
Ralf Klasing (co-Chair) (CNRS and University of Bordeaux, France)
Sofian Maabout (University of Bordeaux, France)
Yessin M. Neggaz (University of Bordeaux, France)
Marc Zeitoun (University of Bordeaux, France)
Akka Zemmari (University of Bordeaux, France)


=======
CONTACT
=======

For further information, please send an e-mail to fct2017@labri.fr.

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