Sunday, January 31, 2016

[DMANET] CFP - SecMAS@AAMAS 2016 - Deadline Febr 15, 2016

Call for Papers - SecMAS workshop on Security and Multi-agent Systems

Deadline: Febr 15, 2016

------------------------------------------------------------------------------------------------------------------------
SecMAS 2016: Security and Multi-agent Systems Workshop
http://www-scf.usc.edu/~dkar/SecMAS2016/
Co-located
with AAMAS 2016 (http://sis.smu.edu.sg/aamas2016)
May 9-13, 2016, Singapore
(Workshop will be held either May 9 or May 10)
------------------------------------------------------------------------------------------------------------------------

The importance of research and applications related to security and multi-agent systems continues to increase in a broad variety of disciplines, including computer science, electrical engineering, economics, biology, political science, business, law, public policy, and many others. The focus of this workshop is to bring together the broad community working on Security and Multi-Agent Systems motivated by any of these domains.

Many large-scale real-world security problems have been successfully modeled as multi-agent security games, and highly scalable algorithmic solutions with software assistants implementing these have been developed and deployed. Perhaps the greatest advances have been in the domain of physical security, with examples including patrolling of seaports and airports, scheduling air marshals, ticket audit in transit systems. Remarkably, there have been a number of more recent developments that significantly broaden the applicability of security game approaches. For example, similar techniques have been used in important sustainability applications, such as fishery protection and prevention of illegal poaching. Moreover, game theoretic models have increasing applicability in cyber, as well as cyber-physical system (CPS) security, such as adversarial machine learning methods (for use, for example, in intrusion detection systems), resilient sensor placement and monitoring strategies, and privacy preserving data publishing and auditing systems.

While there has been significant progress, there still exist many major challenges facing the design of effective approaches to deal with the difficulties in real-world domains. These include building predictive behavioral models for the players, dealing with uncertainties in games, scaling up for large games, and applications of machine learning and multi-agent learning to security, particularly in the context of repeated or stochastic games. This workshop is structured to encourage a lively exchange of ideas to address the above challenges.

We invite full length research submissions from a broad range of researchers and practitioners, including (1) computer scientists applying their AI/MAS research to real-world security problems, (2) interdisciplinary researchers combining AI/MAS with various disciplines (e.g., game theory, operations research, social science, and psychology), and (3) engineers and scientists from private companies and public organizations performing security related research and development, as well as building real adversarial reasoning systems. We encourage all researchers working towards applying security and multi-agent systems concepts for real-world problems to submit to the workshop.

Topics of interest include, but are not limited to:

Real-world applications of game theory for security
Cybersecurity
Security applications of machine learning
Foundations of game theory for security
Adversarial/robust learning
Online learning
Learning in games
Algorithms for scaling to very large games
Economics of security
Behavioral game theory
Decision making under uncertainty
Agent/human interaction for preference elicitation and optimization
Protection against environmental crime
Risk analysis and modeling
Security applications of AI methods
Evaluation/lessons learned of deployed systems

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

Important Dates

Submission Deadline Extended : February 15, 2016
Notification: March 7, 2016
Camera-ready deadline: March 10, 2016

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

Organizing Committee

Debarun Kar, University of Southern California, USA
Yevgeniy Vorobeychik, Vanderbilt University, USA
Long Tran-Thanh, University of Southampton, UK

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

Program Committee

Michael Wellman, University of Michigan, MI, USA.
Christopher Kiekintveld, University of Texas at El Paso, TX, USA
Arunesh Sinha, University of Southern California, CA, USA
Branislav Bosansky, Czech Technical University, Prague, Czech Republic
Martin Short, Georgia Institute of Technology, GA, USA
Matthew Brown, University of Southern California, CA, USA
Zinovi Rabinovich, Mobileye
Paulo Shakarian, Arizona State University, AZ, USA
Fei Fang, University of Southern California, CA, USA
Aron Laszka, University of California Berkeley, CA, USA
Bo An, Nanyang technical University, Singapore
Praveen Paruchuri, IIIT Hyderabad, India
Georgios Piliouras, Singapore University of Technology, Singapore
Jose M. Such, Security lancaster, Lancaster University, UK
Vinh-Thong Ta, University of Central lancashire, UK
Francesco Maria Delle Fave, Disney Research, Boston, USA

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

Submission and Publication

Authors should submit original papers (maximum length 8 double-columned pages in AAMAS format)
in PDF through the Confmaster system:
https://secmas2016.confmaster.net

The most "visionary paper" will be published by Springer in a book under the
Lecture Notes in Artificial Intelligence (LNAI) - Hot Topics series. The book
will be a compilation of the most visionary papers of the AAMAS-2016 Workshops, where one paper will be selected from each AAMAS-2016 workshop.

Additionally, the "best paper" will be published by Springer in a book under the Communications in Computer and Information Science (CCIS) series. The book will be a compilation of the best papers of the AAMAS-2016 Workshops, where one paper will be selected from each AAMAS-2016 workshop. Authors of the selected most visionary paper and the best paper are expected to provide their latex files promptly upon request.

--------
Long Tran-Thanh
Lecturer
--
Agents, Interaction, and Complexity Group,
Electronics and Computer Science,
University of Southampton, SO17 1BJ
--
http://users.ecs.soton.ac.uk/ltt08r
tel: +44 (0) 2380593715

**********************************************************
*
* 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] Last Call for abstracts: PhDs in Logic VIII, Darmstadt, Germany, May 9-11, 2016

Dear logicians,

we would like to inform you about the following event :

Last Call for abstracts: PhDs in Logic VIII, Darmstadt, Germany, May 9-11,
2016

"PhDs in Logic" is an annual graduate conference organised by local graduate
students. This conference has an interdisciplinary character, welcoming
contributions to various topics in Mathematical Logic, Philosophical Logic,
and Logic in Computer Science. It involves tutorials by established
researchers as well as short presentations by PhD students on their
research.

We are happy to announce that the next edition of "PhDs in Logic" will
take place in Darmstadt, Germany, during May 9-11 2016, hosted by the
Logic research group of the Department of Mathematics, TU Darmstadt.

Confirmed tutorial speakers are :

Mirna Dzamonja (University of East Anglia, UK)

Nina Gierasimczuk (University of Amsterdam, the Netherlands)

Ulrich Kohlenbach (TU Darmstadt, Germany)

Piotr Kowalski (University of Wroclaw, Poland)

Martin Otto (TU Darmstadt, Germany)

Registration and abstract submission for interested PhD students are
open. We welcome contributions from any general field of Logic.
The deadline for abstract submission is February 7, 2016. For more
information please
see:http://www.mathematik.tu-darmstadt.de/fbereiche/logik/phdsinlogic2016/?site=home

Local organisers:

Julian Bitterlich, Felix Canavoi, Angeliki Koutsoukou-Argyraki,
Daniel Körnlein, Florian Steinberg

Technische Universität Darmstadt
Department of Mathematics
Logic Group <http://www3.mathematik.tu-darmstadt.de/en/ags/ag-logik/arbeitsgruppe-logik.html>

Schloßgartenstr. 7
64289 Darmstadt,

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

[DMANET] Workshop on Algorithms in Communication Complexity, Property Testing and Combinatorics, Moscow

Workshop on Algorithms in Communication Complexity, Property Testing and
Combinatorics.

Moscow, April 11-13, 2016

Workshop organizers: Ilan Newman, Nikolay Vereshchagin and Vladimir
Podolskii.

Keynote speaker: Madhu Sudan.

Confirmed speakers: Eli Ben-Sasson, Artur Czumaj, Sofia Raskhodnikova,
Amir Shpilka , Amir Yehudayoff, Sergey Yekhanin.

Tutorials: April 9-10, Topics will be announced later.

Workshop is a part of a Special Semester on Computational and Proof
Complexity.

Workshop website: http://math.ucsd.edu/~sbuss/SPB_Workshops/AlgCPTC_1.html

Semester website: http://en.chebyshev.spbu.ru/complexity2016/

If you have questions about the program and how to participate, please
contact the workshop organizers:

Vladimir Podolskii (Steklov Institute/Moscow; podolskii at mi.ras.ru)

Ilan Newman (University of Haifa; ilan at cs.haifa.ac.il)

Nikolay Vereshchagin (Moscow State University; ver at mech.math.msu.su)

If you need a visa to Russia, please contact the organizers as soon as
possible, especially if you are a citizen of non-Schengen country.

**********************************************************
*
* 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, January 29, 2016

[DMANET] ISCO 2016 - Second Call for Papers

CALL FOR PAPERS
4th International Symposium on Combinatorial Optimization
(ISCO 2016) May 16-18, 2016

SPRING SCHOOL ON:
"Extended formulations for Combinatorial Optimization"
May 19-20, 2016

Vietri sul Mare (Salerno), Italy
www.isco2016.it

ISCO is a biennial symposium with its first issue held in Hammamet,
Tunisia in March 2010, its second one in Athens, Greece in April 2012
and its third one in Lisbon, Portugal in March 2014. ISCO 2016 symposium
aims to bring together researchers from communities related to
combinatorial optimization, including algorithms and complexity,
mathematical programming and operations research. It is intended to be a
forum for presenting original research in these areas and especially in
their intersections. Quality papers on all aspects of combinatorial
optimization, from mathematical foundations and theory of algorithms, to
computational studies and practical applications, are solicited.

CONFIRMED CONFERENCE KEYNOTE SPEAKERS
Volker Kaibel (Otto von Guericke University Magdeburg)
Adam Letchford (Lancaster University)
Ramamoorthi Ravi (Carnegie Mellon University)

SPRING SCHOOL
ISCO 2016 will be followed by a spring school on "Extended Formulations
for Combinatorial Optimization". Volker Kaibel and Samuel Fiorini will
give 16 hours of lectures on May 19 and 20, 2016.

CONFERENCE IMPORTANT DATES
Submissions deadline: February 15, 2016
Notification to authors: March 20, 2016
Early registration deadline: April 5, 2016

Conference Days: May 16-18, 2016

SPRING SCHOOL IMPORTANT DATES
Early registration deadline for Spring School: April 5, 2016
Spring School Days: May 19-20, 2016


TOPICS OF INTEREST
Papers presenting original unpublished results in all areas of
combinatorial optimization and its applications are welcome. Topics of
interest include, but are not limited to:
- Approximation algorithms
- Branch-and-bound algorithms
- Branch-and-cut-and-price algorithms
- Computational biology
- Computational complexity
- Computational geometry
- Constraint Programming
- Cutting plane algorithms
- Exact and parameterized algorithms
- Graph and network algorithms
- Interior point methods
- Linear and nonlinear integer programming
- Local search algorithms
- Metaheuristics
- On-line algorithms
- Polyhedral combinatorics
- Randomized algorithms
- Scheduling algorithms
- Game theory
- Multiobjective optimization

The submission deadline is February 15, 2016. Simultaneous submissions
to other conferences with published proceedings or journals are not
allowed. Paper submission and reviewing will be handled only via
Easychair. More information about the submission procedure is available
on the web site.

TYPE OF SUBMISSIONS
There will be two types of submissions:

a) Regular papers

Regular papers cannot exceed 12 pages (including front matter and
bibliography). The post-conference proceedings will be published in a
special Lecture Notes in Computer Science (LNCS) volume. For an accepted
paper to be included in the post-conference proceedings, it should be
presented at the conference by one of the authors. The authors of
accepted regular papers will have to prepare their camera-ready version
two weeks after the end of ISCO 2016.

b) Short papers
Short papers cannot exceed one page (maximum 3000 characters, including
spaces). Accepted short papers will be in the abstracts booklet which
will be distributed during the conference.

SPECIAL ISSUES
Authors of accepted papers (both regular and short papers) for
presentation at ISCO 2016 will be invited to submit their work for
possible publication on a special issue of Networks and of Journal of
Combinatorial Optimization.
Details about the submission process to these special issues will be
published on the conference web site soon.

COMMITTEES

CONFERENCE CHAIRS
Raffaele Cerulli (University of Salerno, Italy)
Satoru Fujishige (RIMS, Kyoto University, Japan)
Ridha Mahjoub (University Paris-Dauphine, France)

STEERING COMMITTEE
Mourad Baïou (Université Blaise Pascal, Clermont-Ferrand, France)
Pierre Fouilhoux (University Pierre & Marie Curie, Paris, France)
Luis Gouveia (CIO, University of Lisbon, Portugal)
Nelson Maculan (Federal University of Rio de Janeiro, Brasil)
Ridha Mahjoub (University Paris-Dauphine, Paris, France)
Vangelis Paschos (University Paris-Dauphine, Paris, France)
Giovanni Rinaldi (IASI, Rome, Italy)

PROGRAM COMMITTEE
http://www.isco2016.it/committees

ORGANIZING COMMITTEE
Raffaele Cerulli (University of Salerno, Italy)
Francesco Carrabs (University of Salerno, Italy)
Monica Gentili (University of Salerno, Italy)
Andrea Raiconi (University of Salerno, Italy)
Carmine Cerrone (University of Salerno, Italy)
Ciriaco D'Ambrosio (University of Salerno, Italy)
Rosa Pentangelo (University of Salerno, Italy)
Selene Silvestri (University of Salerno, Italy)

--
The Organizing Committee - ISCO 2016
**********************************************************
*
* 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 Algorithms, FSU Jena

Applications are invited for a

PhD Position in Algorithms

at the research group "Theoretical Computer Science II" (
http://theinf2.informatik.uni-jena.de/) at the Friedrich-Schiller
University Jena, Germany.


Applicants should have an interest in at least one of the following topics:


- Algorithm Engineering

- Machine Learning

- Optimization


Candidates must hold an excellent Master's degree in computer science,
mathematics or a related area. Excellent programming skills in C++ and/or
Python are mandatory.


Teaching (discussion groups, seminars) in GERMAN is a must.


The position will be full time for three years and is equipped with a very
competitive salary (TV-L 13) and generous travel support.


Applicants should send their application including a cover letter,
curriculum vitae, a copy of their Master's thesis, and the names and e-mail
addresses of two references (including thesis advisor) as a single pdf file
by


February 14th, 2016


to Soeren Laue (soeren.laue@uni-jena.de).

For further information please contact:

Soeren Laue (soeren.laue@uni-jena.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] CFP: SCOR2016 - 2nd Ann. - Nottingham, 5th Student Conference on Operational Research

*** SCOR 2016 : 2nd ANNOUNCEMENT ***

**************************************************
CALL FOR PAPERS
5th Student Conference on Operational Research
SCOR 2016
April 8-10 2016, University of Nottingham, UK
www.scor16.com
**************************************************

We are pleased to announce the official launch of the PhD Student
Conference on Operational Research (SCOR 2016), now back for its
fifth instalment. We invite you to join us once again, at the
beautiful University of Nottingham campus the 8-10 April 2016.

The conference takes place just after the NATCOR course, which will
also be held in Nottingham.

PhD students from all European Universities studying Operational
Research, Management Science or a related field are kindly invited to
submit an abstract for presentation at the conference. As some
presenters may still be on an early stage of in their careers, the
work presented does not need to be fully developed or thoroughly
explored as of yet. The purpose of SCOR 2016 is to provide a friendly
environment for the next generation of Operational Researchers to
receive constructive feedback on their work and to meet people with
similar interests.

The scope of the conference includes, but is not limited to:

Big Data and Analytics * Data Envelopment Analysis * Decision Making
under Risk and Uncertainty * Defence and Security * Disaster Management
* Energy and Climate Change * Forecasting * Healthcare * Mathematical
Programming * Metaheuristics * Multiple Criteria Decision Analysis *
Operations Management * Optimisation * Revenue Management * Safety and
Reliability Analysis * Simulation * Stochastic Modelling * Supply Chain
Management * System Dynamics * Transportation and Logistics * Vehicle
Routing.

**** Deadline for abstracts (250 words) submission: ****
**** Friday 19th February 2016 ****

A notification of acceptance will be sent shortly after this
deadline. In order to encourage a wide range of students to attend, an
affordable conference fee will cover accommodation, a full social
program and full catering provided.

Presenters are also invited to submit a paper (no more than 10 pages) on
their work to be published electronically as part of the SCOR 2016
proceedings. This will be available in the Dagstuhl OpenAccess Series in
Informatics (OASIcs). Paper submissions will undergo a selection
process based on refereeing by the Committee. This gives doctoral
candidates a chance to experience the peer-review process and to enhance
their technical writing skills. Although it is not mandatory, it is
again, highly recommended. To get an idea on the paper standards please
visit the SCOR2014 proceedings at
http://drops.dagstuhl.de/opus/portals/oasics/index.php?semnr=14008 .

**** Deadline for papers (max 10 pages) submission: ****
**** Friday 25th March 2016 ****

See you in Nottingham!!!

**********************************************
Follow us on

www.scor16.com

www.facebook.com/scor2016

www.twitter.com/scor2016

www.linkedin.com/company/scor-2016
**********************************************

**********************************************************
*
* 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] computational optimization

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

Call for Papers

9th International Workshop on Computational Optimization (WCO 2016)
Gdansk, Poland, September 11 - 14, 2016)

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

http://www.fedcsis.org/

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

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

* unconstrained and constrained optimization
* combinatorial optimization
* continues optimization
* global optimization
* multiobjective optimization
* optimization in dynamic and/or noisy environments
* large scale optimization
* parallel and distributed approaches in optimization
* random search algorithms, simulated annealing, tabu search and other
derivative free optimization methods
* nature inspired optimization methods (evolutionary algorithms, ant
colony optimization, particle swarm optimization, immune artificial
systems etc)
* hybrid optimization algorithms involving natural computing
techniques and other global and local optimization methods
*computational biology and optimization
* distance geometry and applications
* optimization methods for learning processes and data mining
* application of optimization methods on real life and industrial problems
* computational optimization methods in statistics, econometrics,
finance, physics, chemistry, biology, medicine, engineering etc.

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

Important dates:

18.04.2016 (April 18, 2016) – Full paper submission

30.05.2016 (May 30, 2016) - Position paper submission

13.06.2016 (June 13, 2016) – Notification of acceptance

04.07.2016 (July 04, 2016) – Camera-ready version of the accepted paper

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

Submission and Publication


* Authors should submit draft papers as PDF.
* The total length of a paper should not exceed 10 pages for full
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 paper will be published in the Conference
Proceedings and included in the IEEE Xplore database (pending) and
indexed in the DBLP.
* Extended versions of selected papers presented during the conference
will be published as Special Issue(s) of Springer Studies of
Computational Intelligence.
====================

If you have any question do not hesitate to send a mail to wco2016@fedcsis.org .

Organizing Committee

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

-
Assoc. Prof. Stefka Fidanova
IICT-BAS
Acad. G. Bonchev str. bl.25A
1113 Sofia Bulgaria
Ph. +359-2-9796642

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

[DMANET] PhD Position in Operations Research at Maastricht University

PhD Position in Operations Research at Maastricht University
--------------------------------------------------------------------

The Operations Research Group at Maastricht University is seeking applications for a 3-year PhD position, starting on September 1st 2016.
The OR group is part of the School of Business and Economics and currently has six faculty members, who conduct research in the areas of:

* Combinatorial Optimization,
* Approximation and Online Algorithms,
* Algorithmic Game Theory, and
* Computational Social Choice.

We encourage candidates with a MSc in Mathematics, Computer Science or Operations Research and a strong background in Discrete Optimization, Theoretical Computer Science, or Algorithmic Game Theory to apply.

The position is funded by the Graduate School of Business and Economics. More details about the Research School and the PhD programme can be found at:
http://www.maastrichtuniversity.nl/web/Faculties/SBE/TargetGroup/Research/PhDProgrammes.htm

Please send your application, including a CV, a motivation letter (which also includes details about your field of interest and research ideas to pursue in this field), a list of grades of your master's studies, and two letters of reference to André Berger (a.berger@maastrichtuniversity.nl) before February 11th 2016.


**********************************************************
*
* 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] Funded Doctoral Positions in Computer Science in Austria (LogiCS)

Funded Doctoral Positions in Computer Science [http://logic-cs.at/phd/]

TU Wien, TU Graz, and JKU Linz are seeking exceptionally talented and
motivated students for their joint doctoral program LogiCS. The LogiCS
doctoral college focuses on interdisciplinary research topics covering

(i) computational logic, and applications of logic to
(ii) databases and artificial intelligence as well as to
(iii) computer-aided verification.

THE PROGRAM

LogiCS is a doctoral college focusing on logic and its applications in
computer science. Successful applicants will work with and be
supervised by leading researchers in the fields of computational
logic, databases and knowledge representation, and computer-aided
verification.

FACULTY MEMBERS

M. Baaz A. Biere R. Bloem A. Ciabattoni
U. Egly T. Eiter C. Fermueller R. Grosu
A. Leitsch M. Ortiz R. Pichler S. Szeider
H. Tompits H. Veith G. Weissenbacher

The LogiCS faculty comprises 15 renowned researchers with strong records
in research, teaching and advising, complemented by 12 associated
members who further strengthen the research and teaching activities of
the college.

Details are provided on http://logic-cs.at/faculty/

POSITIONS AND FUNDING

We are looking for 1 doctoral students per faculty member, where 30%
of the positions are reserved for highly qualified female
candidates. The doctoral positions are funded for a period of 3 years
according to the funding scheme of the Austrian Science Fund
(details: http://www.fwf.ac.at/de/forschungsfoerderung/personalkostensaetze/)
The funding can be extended for one additional year contingent on a
placement at one of our international partner institutions.

CURRENT RESEACH AREAS

At the moment we are particularly looking for people in the following areas:

* Automated reasoning and symbolic computation
* Formal Verification of hybrid systems
* Model Checking


HOW TO APPLY

Detailed information about the application process is available on the
LogiCS web-page

http://logic-cs.at/phd/

The applicants are expected to have completed an excellent diploma or
master's degree in computer science, mathematics, or a related
field. Candidates with comparable achievements will be considered on a
case-by-case basis. Applications by the candidates need to be
submitted electronically.

Next application Deadline: March 1, 2016.

LOGIC IN AUSTRIA

Austria has a highly active and successful logic in computer science community.
Recent activities include:

vsl2014.at
Vienna Summer of Logic, the Largest Conference in the History of Logic

www.arise.or.at
Austrian Research Network in Rigorous Systems Engineering

vcla.at
Vienna Center for Logic and Algorithms

kgs.logic.at
International Kurt Goedel Society

HIGHEST QUALITY OF LIFE

The Austrian cities Vienna, Graz, and Linz, located close to the Alps
and surrounded by beautiful nature, provide an exceptionally high
quality of life, with a vibrant cultural scene, numerous cultural
events, world-famous historical sites, a large international
community, a varied cuisine and famous coffee houses.

For further information please contact:
info@logic-cs.at

**********************************************************
*
* 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, January 28, 2016

[DMANET] Discrete algorithms and applications - Summer School in Mathematics, June 6 - 10, Budapest

First Announcement

The Institute of Mathematics of the Eotvos University Budapest is
organizing a summer school between June 6-10 entitled

"DISCRETE ALGORITHMS AND APPLICATIONS".

There will be 9 minicourses:

- Finding nearest neighbors among molecular fingerprints
- Hundred thousand dollars for a prime number
- Pseudorandom binary sequences and lattices
- Permutation group algorithms
- LEMON: Library for Efficient Modeling and Optimization in Networks
- Graph algorithms and LP duality
- Recent techniques in algorithm design
- Scheduling problems and algorithms
- Modeling propagation processes on networks by using differential equations

The early bird registration closes on April 30.

Poster of the summer school is available at
http://www.math.elte.hu/summerschool/2016/egyeb/poster.pdf

For details, see
http://www.math.elte.hu/summerschool/


Kristof Berczi
Egervary Research Group
Eotvos Lorand University, Budapest
berkri@cs.elte.hu

**********************************************************
*
* 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, January 27, 2016

[DMANET] 2nd CfP - 13th ESICUP Meeting & Cutting and Packing Stream at EURO 2016

Dear Colleague,

This is the 2nd Call for Submissions for the:

13th ESICUP Meeting

Ibiza, Spain, from May 18 to 20, 2016.

<http://www.fe.up.pt/esicup/extern/esicup-13thMeeting>
http://www.fe.up.pt/esicup/extern/esicup-13thMeeting

Submission deadline: February 15, 2016

Cutting and Packing Stream at EURO 2016

28th European Conference on Operational Research

Poznan, Poland, July 3-6, 2016

<http://www.euro2016.poznan.pl> http://www.euro2016.poznan.pl

Stream organizers: A. Miguel Gomes and Jose F. Oliveira (Porto,

Portugal)

Submission deadline: February 15, 2016

Further details are available below.

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

EURO 2016 - 28th European Conference on Operational Research

Poznan, Poland, July 3-6, 2016

<http://www.euro2016.poznan.pl> http://www.euro2016.poznan.pl

Stream organizers:

A. Miguel Gomes and Jose F. Oliveira (Porto, Portugal)

This stream invites contributions in the broad area of Cutting and

Packing. If you would like to present your work in this stream, please

send the following information:

- Title of the talk

- Name and email of the first author

to <mailto:esicup@gmail.com> esicup@gmail.com until February 15, 2016

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

CALL FOR SUBMISSIONS: 13th ESICUP Meeting

Ibiza, Spain, May 18 - 20, 2016

co-hosted by ESICUP - The EURO Special Interest Group on Cutting, EURO,

INESC TEC and University of Southampton.

<http://www.fe.up.pt/esicup/extern/esicup-13thMeeting>
http://www.fe.up.pt/esicup/extern/esicup-13thMeeting

The 2016 edition is the 13th regular meeting of the ESICUP. It provides

a forum for researchers and practitioners from all over the world who

are interested in presenting their research results and in learning

about the latest developments in the field of Cutting & Packing. The

meeting will take place in Beijing, China. It follows meetings in

Wittenberg (Germany), Southampton (United Kingdom), Porto (Portugal),

Tokyo (Japan), L'Aquila (Italy), Valencia (Spain), Buenos Aires

(Argentina), Copenhagen (Denmark), La Laguna (Spain), Lille (France),

Beijing (China), and Portsmouth (UK). This year edition will be held

at the University of the Balearic Islands in Ibiza (Centre of Ibiza

and Formentera, located close to city centre).

Local Organising Committee

A. Martinez Sykora (Chair), University of Southampton

António Galrão Ramos, INESC TEC and School of Engineering,

Polytechnic of Porto

Elsa Silva, INESC TEC

Margalida Homar, UIBCongrés, University of the Balearic Islands

Program Committee

Ramón Alvarez-Valdes (Chair), University of Valencia

Julia Bennell, University of Southampton

Gerhard Wäscher, Otto-von-Guericke-Universität Magdeburg

José Fernando Oliveira, University of Porto

A. Miguel Gomes, University of Porto

A. Martinez Sykora, University of Southampton

Topics of Interest

Contributions dealing with any aspect of Cutting and Packing are

invited. This includes theoretical achievements, model formulations,

development of algorithms and real-world implementations. Typical - but

not exclusive - topics of interest are:

* One-dimensional problems

* Two-dimensional rectangular problems

* Packing of irregular shapes, nesting

* Three-dimensional packing, container loading

* Bin packing problems

* Knapsack problems

* Typologies

* Problem generators, benchmark problem instances

* Variants and extensions of cutting and packing problems

* Industrial applications

Presentations on other problems which are closely related to Cutting

and Packing are also welcomed.

Abstract Submission

As for the submission of abstracts, please follow the procedure

described in the "Abstract Submission" section on the meeting website

(see below). Authors of accepted papers will be notified by March 15,

2016 and their abstracts will be published (if registered for the

conference) in the abstract book of the 13th ESICUP Meeting which will

be available for download. No further conference proceedings will be

published.

Conference Fees

Early registration fee (until March 15, 2016): 130 Euro

Late registration fee (after March 15, 2016): 160 Euro

Important Dates

February 15, 2016: Deadline for abstract submission

March 15, 2016: Notification of acceptance

April 15, 2016: Deadline for early registration and authors

registration

May 18-20, 2016: 13th ESICUP Meeting

Website

<http://www.fe.up.pt/esicup/extern/esicup-13thMeeting>
http://www.fe.up.pt/esicup/extern/esicup-13thMeeting

---

ESICUP ( <http://www.fe.up.pt/esicup> http://www.fe.up.pt/esicup)

EURO Special Interest Group on Cutting and Packing


**********************************************************
*
* 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] ETAPS 2017 call for satellite events

20th European Joint Conferences on Theory and Practice of Software
ETAPS 2017
Uppsala, Sweden, 23-29 April 2017
http://www.etaps.org/2017/

Call for Satellite Events


-- ABOUT ETAPS --

The European Joint Conferences on Theory and Practice of Software
(ETAPS) is the primary European forum for academic and industrial
researchers working on topics relating to Software Science. It is an
annual event held in Europe each spring since 1998. Its twentieth
edition, ETAPS 2017, will take place 23-29 April 2017 in Uppsala,
Sweden.

ETAPS 2017 main conferences, scheduled for 25-28 April, are:

* ESOP: European Symposium on Programming
* FASE: Fundamental Approaches to Software Engineering
* FOSSACS: Foundations of Software Science and
Computation Structures
* POST: Principles of Security and Trust
* TACAS: Tools and Algorithms for the Construction and
Analysis of Systems

-- SATELLITE EVENTS --

The ETAPS 2017 organizing committee invites proposals for satellite
events (workshops) that will complement the main conferences. They
should fall within the scope of ETAPS. This encompasses all aspects of
the system development process, including specification, design,
implementation, analysis and improvement, as well as the languages,
methodologies and tools which support these activities, covering a
spectrum from practically-motivated theory to soundly-based
practice. Satellite events provide an opportunity to discuss and
report on emerging research approaches and practical experience
relevant to theory and practice of software.

ETAPS 2017 satellite events will be held immediately before and after
the main conferences, on 23-24 April and 29 April.

-- ARRANGEMENTS FOR SATELLITE EVENTS --

The organizers of an ETAPS 2017 satellite are expected to:

* create and maintain a website for the event,
* form a PC, produce a call for papers for the event (if appropriate),
* advertise the event through specialist mailing lists etc. to
complement the publicity of ETAPS,
* review the submissions received and make acceptance decisions,
* prepare an informal (pre)proceedings for the event (if appropriate),
* prepare the event's program complying with any scheduling
constraints defined by the ETAPS 2017 organizing committee,
* prepare and organize the publication of a formal (post)proceedings
(if desired).

The ETAPS 2017 organizing committee will:

* promote the event on the website and in the publicity material of
ETAPS 2017,
* integrate the event's program into the overall program of the
conference,
* arrange registration for the event as a component of registration
for ETAPS,
* collect a participation fee from the registrants,
* produce a compilation USB memory stick of the informal
(pre)proceedings of the satellite events of ETAPS 2017 and
distribute this to the registrants,
* provide the event with a meeting room of an appropriate size, A/V
equipment, coffee breaks and possibly lunch(es).

As a rule, ETAPS will not contribute toward the travel or
accommodation costs of invited speakers or organizers of satellite
events.

-- SUBMISSION OF SATELLITE EVENT PROPOSALS --

Researchers and practitioners wishing to organize satellite events are
invited to submit proposals to the workshop co-chairs Konstantinos
Sagonas and Mohamed Faouzi Atig using the web form at
http://www.etaps.org/2017/call-for-workshops .

The following information is requested:

* the name and acronym of the satellite event
* the names and contact information of the organizers
* the duration of the event: one or two days
* the preferred period: 23 April, 24 April, 23-24 April or 29 April
* the expected number of participants
* a brief description (120 words approximately) of the event topic for
the website and publicity material of ETAPS 2017
* a brief explanation of the event topic and its relevance to ETAPS
* an explanation of the selection procedure of contributions to the
event, the PC chair and members, if known already, information about
past editions of the event, if applicable
* any other relevant information, like a special event format, invited
speakers, demo sessions, special space requirements, etc.
* a tentative schedule for paper submission, notification of
acceptance and final versions for the (informal pre-)proceedings
(the ETAPS 2017 organizing committee will need the final files by
the end of Feb. 2017)
* the plans for formal publication (no formal publication, formal
proceedings ready by the event, formal post-proceedings, publication
venue - EPTCS or elsewhere)

The proposals will be evaluated by the ETAPS 2017 organizing committee
on the basis of their assessed benefit for prospective participants of
ETAPS 2017. Prospective organizers may wish to consult the web pages
of previous satellite events as examples:

ETAPS 2016: http://www.etaps.org/2016/workshops
ETAPS 2015: http://www.etaps.org/2015/workshops
ETAPS 2014: http://www.etaps.org/2014/workshops
ETAPS 2013: http://www.etaps.org/2013/workshops
ETAPS 2012: http://www.etaps.org/2012/workshops

-- IMPORTANT DATES --

Satellite event proposals deadline: 14 March 2016

Notification of acceptance: early April 2016

-- HOST CITY --

Uppsala has a rich history, having for long periods been the
political, religious and academic center of Sweden. Uppsala
University is over 500 years old, is consistently ranked among the top
100 in the world, and has been the home of many great scientists over
the years, for instance Carl von Linne, Anders Celsius and Anders
Jonas Ångström.

Uppsala is 60 kms from Stockholm and is well connected to Stockholm
Arlanda airport.

-- FURTHER INFORMATION AND ENQUIRIES --

Please contact the workshop co-chairs, Konstantinos Sagonas,
kostis@it.uu.se, and Mohamed Faouzi Atig,
mohamed_faouzi.atig@it.uu.se.

**********************************************************
*
* 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, January 26, 2016

[DMANET] FUN 2016 - Call for Papers

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

FUN 2016 - Call for Papers

8th International Conference on Fun with Algorithms
June 8-10, 2016. La Maddalena, Maddalena Islands, Italy

========================================================================
Submission deadline: Feb 21, 2016
http://www2.idsia.ch/cms/fun16/
========================================================================

SCOPE

FUN is dedicated to the use, design and analysis of algorithms and
data structures, focusing on results that provide amusing, witty but
nonetheless original and scientifically profound contributions to the
area. The topics of interest include (but are not limited to):
FUN with biological algorithms
FUN with combinatorial algorithms
FUN with cryptographic algorithms
FUN with distributed algorithms
FUN with game-theoretic algorithms
FUN with geometrical algorithms
FUN with graph algorithms
FUN with mobile algorithms
FUN with Internet algorithms
FUN with parallel algorithms
FUN with optimization algorithms
FUN with randomized algorithms
FUN with robotics algorithms
FUN with space-conscious algorithms
FUN with string algorithms
FUN with visualization of algorithms

SUBMISSIONS

Contributors must submit their papers using the Easychair system.
Submissions should not exceed 12 pages including front page and references.
Additionally, if full details of proofs do not fit into the page
limit, a clearly marked appendix containing the remaining details must
be included; this appendix will not be regarded as part of the
submission and will be considered only at the discretion of the
program committee. Submissions deviating substantially from this format
risk rejection without consideration of their merits.

Papers submitted for review should represent original, previously
unpublished work. At the time the paper is submitted to the conference,
and for the entire review period, the paper (or essentially the same
paper) must not be under review by any other conference with published
proceedings or by a scientific journal.
At least one author of every accepted paper is required to register
and present the paper at the symposium.


IMPORTANT DATES

Submission deadline: Feb 21, 2016
Author notification: April 1, 2016
Symposium: June 8-10, 2016


SPECIAL ISSUE

Authors of selected papers will be invited to submit an extended
versions of their work to a special issue of Theoretical Computer
Science.


PROGRAM COMMITTEE

Oswin Aichholzer, T. U. Graz, Austria
Michael Bender, SUNY Stony Brook, USA
Vincenzo Bonifaci, IASI, Italy
Jaroslaw Byrka, U. Wroclaw, Poland
Parinya Chalermsook, MPII, Germany
Mirela Damian, Villanova U., USA
Erik Demaine (Co-Chair), MIT, USA
Matthias Englert, U. Warwick, England
David Eppstein, U. California Irvine, USA
Jeff Erickson, U. Illinois, Urbana-Champaign, USA
Irene Finocchi, U. Sapienza, Italy
Fedor Fomin, U. Bergen, Norway
Pierre Fraigniaud, Paris Diderot, France
Fabrizio Grandoni (Co-Chair), IDSIA, Switzerland
Roberto Grossi, U. Pisa, Italy
Robert Hearn, USA
John Iacono, NYU Engineering, USA
Stefan Langerman, U. Libre Bruxelles, Belgium
Joseph Mitchell, SUNY Stony Brook, USA
Ian Munro, U. Waterloo, Canada
Mohit Singh, Microsoft, USA
Kavitha Telikepalli, TIFR, India
Ryuhei Uehara, JAIST, Japan
Yushi Uno, Osaka Prefecture U., Japan
Giovanni Viglietta, U. Ottawa, Canada
Sebastiano Vigna, U. Milano, Italy
Peter Widmayer, ETH, Switzerland
Virginia Vassilevska Williams, Stanford, USA

ORGANIZING COMMITTEE

- Linda Pagli, University of Pisa
- Giuseppe Prencipe, University of Pisa


STEERING COMMITTEE

- Elena Lodi, University of Siena
- Linda Pagli, University of Pisa
- Nicola Santoro, Carleton Univ
**********************************************************
*
* 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: BIGCOM 2016

************************* Apologize if you receive multiple copies of this
CFP **************************

*** Abstract Submission deadline: Feb 15, 2016, 11:59 PM Pacific Standard
Time***
** Full Paper Submission deadline: Feb 25, 2016, 11:59 PM Pacific Standard
Time **

------------- Call for Papers -------------------------
The 2nd International Conference on Big Data Computing and Communication
(BIGCOM 2016)
July 29-31, 2016, Shenyang, Liaoning, China
http://conf.neu.edu.cn/bigcom2016/

Big Data promises to reshape tomorrow's knowledge, society and economy. The
technologies that are used to generate, collect, process, compute and
communicate Big Data have made significant progresses in the past few
years. Such a disruptive technology inevitably poses a number of
significant challenges on the underlying system design. The International
Conference on Big Data Computing and Communications (BigCom 2016), which is
to be held on July 29-31, Shenyang, Liaoning, China, aims to address these
challenges. The conference is targeted to attract researchers and
practitioners who are interested in Big Data analytics, management,
security and privacy, communication and high performance computing in its
broadest sense. We welcome original, unpublished research papers that
emphasize theoretical foundations, modeling, algorithmic methodologies, and
data-driven applications. We also welcome visionary papers on new and
emerging topics. The related topics include but not limited to the
following:

Computing
· Data-intensive Parallel and Distributed Computing (Clouds, Clusters,
Grids, P2P)
· Sampling and Pre-processing for Big Data
· Data Streams Computing Techniques
· Heterogeneous Source Computing
· Scalability and Elasticity in Big Data Environments
· Performance Analysis of Big Data Tools and Applications
· Computing on Network Edge
Mining
· Modeling and Algorithms for Big Data Analytics and Data Mining
· Knowledge Mining from Big data
· Network and Graph Mining
· High Dimensional Data Mining
· Data Mining Techniques for Sensor Data
· Data Mining Techniques for Social Networks
Communication
· Next Generation Mobile Network
· Heterogeneous Wireless Networks
· Pervasive/Ubiquitous Networks
· Cooperative and Cognitive Networks
· Communications Patterns and User Experiences Analysis
· Big Data Analytics for Communication Service Providers
· Fault-tolerance and Reliability in Big Data Environments
Security
· Security and Legal Issue in Mobile Applications/Apps
· Privacy of Open Data
· Access Control and Authentication
· Pricing modeling and policy
· Reliability and Security of Content and Data
· Usability of Security Technologies and Services
· Trust and Privacy Issues in Mobile Commerce Environment
· Cryptographic Protocols
Management
· Big Data Storage, Indexing, Searching and Querying
· Big Data Quality Management
· Heterogeneous Data Management
· Knowledge Management and Ontology Engineering
· Unstructured Data Modeling
· Scheduling and Resource Management in Big Data Environments
· Spatial, Temporal, Multimedia and Scientific Databases
· Database and Data Warehouse Technologies for Big data
Applications
· Infrastructures and Frameworks of Data- driven Applications
· Mobile Device Apps based on Big Data
· Big Data for Crowd-sourcing
· Big Data for Advanced Manufacturing
· Big Data for Open Government
· Big Data for Healthcare
· Big Data for Bioinformatics
· Big Data for Intelligence Transportation
· Big Data for Smart City
· Big Data for Business Intelligence
· Big Data for Geo Intelligence
· Big Data for Logistics
· Big Data for Virtual Metrology

Paper Submission
All paper submissions will be handled electronically via easychair at the
submission site (http://conf.neu.edu.cn/bigcom2016/CFP.html). Submitted
papers must be original work, and it must neither be already published nor
be currently under review for publication in any other venue. Any papers
that do not adhere to the following guidelines will be immediately rejected:
· Submitted in PDF format
· Maximum of 10 pages
· Font size no smaller than 10 points
· Fit properly on US letter-sized paper (8.5 inches x 11 inches)

The conference proceeding will be published by Springer and indexed by EI.
Selected papers will be recommended to publish at SCI-indexed journals such
as Sensors (MDPI) and Tsinghua Science and Technology.

Keynote Speakers
The conference features two keynote speakers: Lixin Gao (University of
Massachusetts, USA) and Jianzhong Li (Harbin Institute of Technology,
China), who will highlight the recent advances in big data computing and
communications.

Best Paper Award
All papers will be considered for the Best Paper Award. The program
committee will select a number of candidates for the award among accepted
papers. The winner will be selected at the conference.

Important Dates
· All deadlines are at 11:59 PM Pacific Standard Time.
· Abstracts submission: Feb 15, 2016
· Paper submission: Feb 25, 2016
· Paper notification: May 1, 2016
· Camera Ready Submission: May 15, 2016
· Conference date: July 29-31, 2016

Organizing Committee
Honorary Chair: Jinkuan Wang (Northeastern University, China)
General Co-Chairs: Ge Yu (Northeastern University, China), Yu Wang
(University of North Carolina at Charlotte, USA)
TPC Co-Chairs: Yanyong Zhang (Rutgers University, USA), Zhu Han
(University of Houston, USA), Guoren Wang (Northeastern University, China)

Contact
If you have any questions, please contact: bigcom2016@mail.neu.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] CFP - Algorithms MDPI - Special Issue on Parallel Algorithms for Combinatorial Optimization Problems

Call for Papers

MDPI Algorithms Journal

Special Issue on Parallel Algorithms for Combinatorial Optimization Problems
(http://www.mdpi.com/journal/algorithms/special_issues/parallel_algorithms)

Scope

Combinatorial optimization problems model most of the application scenarios
frequently arising in practice. Unfortunately, optimal solutions to these
problems are hard to obtain, with most of them having high computational
complexity. Even in the case of problems admitting polynomial time
solutions, e.g., the classical shortest path problem, the relevant
applications should now work on very large input instances or should cope
with a large number of concurrent users. Thus, faster solution methods are
clearly needed for achieving real time responses for problems previously
considered as easy ones. The same also holds for most heuristic methods or
approximation algorithms that have been proposed for obtaining approximate
solutions for hard optimization problems in acceptable execution times. For
large-scale problems, these techniques are inadequate, and much faster
algorithmic techniques are needed again.

Due to the aforementioned limitations, parallelism has been considered a
means of deriving faster algorithmic solutions. Parallel computation is
virtually ubiquitous nowadays and can be found in all modern computing
platforms. Although the concept of parallel execution is simple, its
application on combinatorial optimization problems is not straightforward,
due to the inherently irregular control flow that the algorithms for this
kind of problem commonly have. In this Special Issue, we solicit
contributions that will propose new methodologies for solving problems in
combinatorial optimization using parallel computation, either in
shared-memory systems (e.g., multi-core/many-core processors, GPUs, etc.) or
in distributed-memory systems (e.g., clusters, cloud architectures, etc.).
Topics of interest include, but are not limited to:

- Parallel exact algorithms: e.g., divide-and-conquer, dynamic programming,
etc.

- Parallel approximation algorithms- Parallel fixed parameter algorithms

- Parallel heuristics/metaheuristics for combinatorial optimization
problems: e.g., local search, simulated annealing, evolutionary computation,
swarm intelligence computation, etc.

- Parallel techniques in integer linear programming: e.g., parallelization
of branch-and-bound, column generation, and cutting plane methods or their
combinations (i.e., branch-and-cut or branch-and-price).

- Parallel algorithms for multi-objective optimization problems.

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

Manuscript submission deadline: February 29, 2016


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

Guest Editor

Dr. Charalampos Konstantopoulos

Department of Informatics

University of Piraeus, Greece (konstant@unipi.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] DEADLINE EXTENSION FOR ABSTRACTS - EngOpt 2016. Iguassu Falls, Brazil - 5th Int. Conf. on Engineering Optimization

Dear colleague,

Due to many requests received, the deadline for Abstract Submission has been extended
to 31st January 2016.

Please submit your abstract in our site: www.engopt.org

•31st January 2016 - Is the new deadline for the short abstract, to be included in the
proceedings
book of the conference (Up to 3200 characters including spaces, written in plain text,
without mathematical formulas).

•Notification for paper acceptance: 15 days after submission

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

"EngOpt 2016", the 5th International Conference on Engineering Optimization"

will take place at Iguassu Falls, Brazil, from 19th to 23rd June 2016.

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

______________________________________________________________________

UPDATED INFORMATION ABOUT ACOMODATIONS IS NOW AVAILABLE IN OUR SITE

EngOpt 2016 obtained special rates for the participants of the Conference
at Rafain Palace Hotel & Convention.These rates are for a limited number of rooms.

Since Iguassu Falls is a very important touristic destination, we advise participants to

make reservations as soon as possible.

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

About Rafain Palace Hotel & Convention Center:

Featuring tennis and soccer courts, 3 pools and a hot tub, Rafain Palace Hotel &
Convention Center is at 5 km from the Paraguayan border and 20 km
from Iguassu Falls. Itaipu Hydroelectric Plant is 7 km away, and parking is free.

With a rich selection of breads, hot dishes and fruits, buffet breakfast is served
daily at Itamuri Restaurant. À la carte dishes from Brazilian and international
cuisines are served throughout the day. American Bar and the pool bar serve drinks,
snacks and ice-creams.

Children can have fun at the playground or with the entertainment staff. Other hotel
amenities include a gym, sauna and gift shop.

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

About registration fees:

Participant Fees include: Conference proceedings, attendance at all scientific
sessions, coffee breaks, self-service buffet lunch the four days of the conference,
welcome reception and banquet.

Full time Student Fees include: Conference proceedings, attendance at all scientific
sessions, coffee breaks, self-service buffet lunch the four days of the conference and
welcome reception

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

EngOpt: A forum for Engineers, Mathematicians and Computer Scientists to share
research and innovations, promoting interdisciplinary activities in all
fields of Engineering Optimization.
_______________________________________________________________________

Engopt 2016 is organized by:

Federal University of Rio de Janeiro

________________________________________________________________________

As in previous editions, EngOpt is endorsed by:

EUROPT - EURO Working Group on Continuous Optimization

ISSMO - International Society for Structural and Multidisciplinary
       Optimization

IFORS - International Federation of Operational Research Societies

MOS - Mathematical Optimization Society

________________________________________________________________________

Please visit our website: www.engopt.org and make yor Fast Pre-registration.

_________________________________________________________________________

With my best wishes,

Jose Herskovits
COPPE/Federal University of Rio de Janeiro
engopt@optimize.ufrj.br


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

?==============================================
CALL FOR PARTICIPATION
3rd German Day on Computational Game Theory
March 4th, 2016
RWTH Aachen University
URL: http://www.oms.rwth-aachen.de/cms/OMS/Studium/~jzfv/3rd-German-Day-on-Computational-Game-The/lidx/1/
==============================================

The 3rd German Day on Computational Game Theory will take place on
Friday, March 4th, 2016 at RWTH Aachen.
The event will be preceded by a reception and an open problem
session in the afternoon of Thursday, the 3rd of March.

The goal of the workshop is to provide an opportunity to
present research, exchange ideas and foster collaboration
among researchers interested in computational aspects of game theory,
social choice, and related areas, at an informal level.

The scientific program will start at 9 am on Friday and consist of two invited lectures plus
8 contributed 15-minutes presentations.
The two invited lectures are given by
Rahul Savani (University of Liverpool) and Paul Dütting (ETH Zürich).

There is no registration fee.
For organizational purposes, please register on the workshop webpage
by February 21.


To submit a talk, please send an email including title and short
abstract to daniel.schmand@oms.rwth-aachen.de<mailto:daniel.schmand@oms.rwth-aachen.de>
no later than February 14.

Sincerely,
Britta Peis (RWTH Aachen University) and Alexander Skopalis (University of Paderborn)

**********************************************************
*
* 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 on Experimental Algorithms (SEA 2016): deadline for abstract submission is today

(This is just to remind you that the deadline for abstract submission
is today (January 26))

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

Call for Papers

15th International Symposium on Experimental Algorithms (SEA 2016)

June 5-8, 2016, St. Petersburg, Russia

http://logic.pdmi.ras.ru/sea2016/

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

SEA (Symposium on Experimental Algorithms), previously known as WEA
(Workshop on Experimental Algorithms),
is an international forum for researchers in the area of design,
analysis, and experimental evaluation and
engineering of algorithms, as well as in various aspects of
computational optimization and its applications.
The preceding symposia were held in Riga, Monte Verità, Rio de
Janeiro, Santorini, Menorca Island, Rome,
Cape Cod, Dortmund, Ischia Island, Crete, Bordeaux, Rome, Copenhagen
and Paris. SEA aims to attract papers
from both the CS and the OR/Mathematical Programming communities.

The main theme of the symposium is the role of experimentation and of
algorithm engineering techniques in
the design and evaluation of algorithms and data structures.
Submissions should present significant contributions
supported by experimental evaluation, methodological issues in the
design and interpretation of experiments,
the use of (meta-) heuristics, or application-driven case studies that
deepen the understanding of the complexity
of a problem.

IMPORTANT DATES

Times AoE (Anywhere on Earth):
Abstract submission: January 26, 2016.
Full paper submission: February 2, 2016.
Acceptance notification: March 11, 2016.
Camera-ready version: March 25, 2016.
Conference dates: June 5-8, 2016.

TOPICS
Contributions solicited cover a variety of topics including but not limited to:

Algorithm Engineering
Algorithmic Libraries
Algorithmic Mechanism Design
Analysis of Algorithms
Algorithms for Memory Hierarchies
Approximation Techniques
Bioinformatics
Branch-and-Bound Algorithms
Combinatorial and Irregular Problems
Combinatorial Structures and Graphs
Communication Networks
Complex Networks
Computational Geometry
Computational Learning Theory
Computational Optimization
Computer Systems
Cryptography and Security
Data Streams
Data Structures
Distributed and Parallel Algorithms
Evaluation of Algorithms for Realistic Environments
Experimental Techniques and Statistics
Graph Drawing
Heuristics for Combinatorial Optimization
Implementation, Testing, Evaluation and Fine-tuning
Information Retrieval
Integer Programming
Logistics and Operations Management
Machine Learning and Data Mining
Mathematical Programming
Metaheuristic Methodologies
Multiple Criteria Decision Making
Network Analysis
Novel Applications of Algorithms in Other Disciplines
Online Problems
Parallel Algorithms and Computing
Railway Optimization using Algorithmic Methods
Randomized Techniques
Robotics
Semidefinite Programming
Simulation
Software Repositories and Platforms for using Algorithms
Telecommunications and Networking
World-Wide-Web Algorithms


INVITED SPEAKERS

To be announced

PROGRAM COMMITTEE

Ittai Abraham
Maxim Babenko
Daniel Bienstock
Daniel Delling
Paola Festa
Stefan Funke
Andrew V. Goldberg — chair
Dan Halperin
Michael Junger
Alberto Marchetti-Spaccamela
Petra Mutzel
Tomasz Radzik
Ilya Razenshteyn
Rajeev Raman
Mauricio G. C. Resende
Peter Sanders
David B. Shmoys
Daniele Vigo
Neal Young

ORGANIZERS

Steklov Institute of Mathematics at St. Petersburg of the Russian
Academy of Sciences

SUBMISSIONS

Authors are invited to submit an extended abstract or a full paper of
at most 12 pages, not including references,
in the LNCS format (LaTeX, as pdf; final version with source);
instructions are here:

http://www.stage.sgw.springer.com/computer/lncs?SGWID=0-164-6-793341-0

Proofs and other material omitted due to space constraints are to be
put into a clearly marked appendix to be read
at discretion of the referees. Papers must present original (and not
previously published) research. Simultaneous
submission to journals or to other conferences with published
proceedings is not allowed. The proceedings of the
symposium will be published in Springer's LNCS series.

Submissions should be uploaded to the EasyChair Conference system:
https://easychair.org/conferences/?conf=sea2016

OTHER EVENTS IN ST. PETERSBURG

A Special Semester on Computational and Proof Complexity, April - June, 2016

* Workshop on Proof Complexity, May 17 - 20, 2016
* Workshop on Low-Depth Complexity, May 23 - 25, 2016

The 11th International Computer Science Symposium in Russia, June
9–13, 2016, St. Petersburg, Russia


FURTHER INFORMATION AND CONTACTS

Web: http://logic.pdmi.ras.ru/sea2016/
Email: sea2016info@gmail.com

**********************************************************
*
* 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, January 25, 2016

[DMANET] ThRaSH 2016 Lyngby, Denmark - 2nd Call for Participation

Call for Abstracts and Participation


The 10th Workshop on Theory of Randomized Search Heuristics (ThRaSH
2016) 18-19 March 2016, Lyngby (Copenhagen), Denmark

https://www.imm.dtu.dk/~cgie/thrash2016/

Contact: thrash@compute.dtu.dk

Deadline for abstract submission: 18 February, 2016 Notification of
accepted talks: 25 February, 2016 Deadline for registration: 29
February, 2016

Abstract submission and registration (no fee) by e-mail to
thrash@compute.dtu.dk

The 10th Theory of Randomized Search Heuristics workshop continues the
tradition of discussing theoretical aspects of randomised search
heuristics such as evolutionary algorithms, ant colony optimisation,
particle swarm optimisation, simulated annealing, and other heuristics
inspired by natural or physical processes. It provides a forum to
discuss novel and ongoing work, new trends and ideas, and aims at
stimulating interactions within the research field and between related
disciplines. The tenth workshop of the series will take place in Lyngby
(Greater Copenhagen), Denmark on the 18th and 19th of March, 2016;
details about the venue as well as all other information pertaining to
the workshop can be found on the workshop homepage
https://www.imm.dtu.dk/~cgie/thrash2016/.

We invite researchers working on theoretical aspects of randomized
search heuristics who would like to present and discuss their work to
submit a short abstract (a single page, either in plain text or pdf). As
always at ThRaSH, the primary focus is on discussing recent ideas and
detecting challenging topics for future work, rather than on the
presentation of final results.

Registration to the workshop is free. However, we ask participants to
register by the registration deadline. Please let us know if you have
any dietary requirements so that we can take this into account in the
organization.

Carsten Witt and Christian Gießen (Technical University of Denmark)
**********************************************************
*
* 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] HEUREKA 2017 Call (in German)

Sehr geehrte Dame, sehr geehrter Herr,

mit dieser Nachricht möchte ich Sie auf die folgende Konferenz und den
zugehörigen Call for Papers hinweisen:

HEUREKA 2017
Am 22. und 23. März 2017 findet die nächste HEUREKA Konferenz in Stuttgart
statt. Die HEUREKA sucht forschungs- und anwendungsorientierte Beiträge zu
Entscheidungs- und Optimierungsverfahren aus allen Bereichen des Verkehrs
(Intermodaler Verkehr, Individualverkehr, Öffentlicher Verkehr,
Güterverkehr). Einsendeschluss für die Einreichung von Beiträgen ist der

08. Juli 2016,

weitere Informationen entnehmen Sie bitte der folgenden Seite:

http://www.fgsv.de/fileadmin/Veranstaltungen/2017/2017XX_Heureka/HEUREKA_2017_call-for-papers.png

Abschließend habe ich noch zwei kleine Bitten: Leiten Sie bitte den Call
for Papers auch an Kollegen und/oder Mitarbeiter weiter, von denen Ihnen
aktuelle Aktivitäten aus den genannten Bereichen bekannt sind - und bitte
sehen Sie mir etwaiges "cross-posting" mit anderen einschlägigen
Mail-Verteilern nach. ;-)

Mit freundlichen Grüßen
Christian Liebchen
S-Bahn Berlin GmbH
**********************************************************
*
* 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 approaching: 71st (German) Workshop on Algorithms and Complexity [in German]

Liebe Kolleginnen und Kollegen,

wir möchten daran erinnern, dass in einer Woche die Deadline für
Einreichungen zum

**** 71. Workshop über Algorithmen und Komplexität *****

am *** 15. und 16. Februar 2016 *** (Montag und Dienstag)

an der TU Dortmund ist.

Wir laden Sie herzlich zu diesem Workshop ein und Sie bitten, in Ihren Gruppen auf ihn hinzuweisen.

Aktuelle Informationen finden Sie jeweils unter http://tt71.cs.tu-dortmund.de/.

(Leider haben wir unsere Webseiten gerade erst erneuert und es könnte sein, dass Ihr Browser dieser Seite nicht vertraut)

Wir würden uns freuen, wenn Sie mit einem Vortrag zum Programm des Workshops beitragen könnten. Teilen Sie uns dies gegebenfalls bitte mit und senden Sie bis zum *** 1. Februar 2016*** einen Abstract per Email an theorietag@ls1.cs.tu-dortmund.de. Statt eines Abstracts können Sie auch einen maximal 5-seitigen Artikel einreichen.

Das Programm wird auch einen eingeladenen Vortrag von Martin Grohe (RWTH Aachen) umfassen.

Wenn Sie teilnehmen wollen ohne einen Vortrag zu halten, melden Sie sich bitte bis zum ***8.2.2016*** an, damit wir genügend viele Heiß- und Kaltgetränke bereit stellen können.

Der Workshop soll am 15.2.. gegen Mittag beginnen und am 16.2. gegen Mittag enden.

Zusammengefasst sind die „important dates" also:

- 1.2.: Anmeldung Vorträge (und Einreichung Abstracts/Papers)
- 8.2.: Anmeldung Teilnehmer
- 15./16.2.: Workshop

Mit freundlichen Grüßen

Beate Bollig
Johannes Fischer
Thomas Schwentick
Christian Sohler
Nils Vortmeier


PS: Falls Sie dauerhaft Interesse an dieser Workshopreihe haben, können Sie sich über die Webseite http://www.thi.uni-hannover.de/theorietag-workshop.html in die Mailingliste eintragen.


**********************************************************
*
* 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, January 24, 2016

[DMANET] CFP: 2016 Genetic and Evolutionary Computation Conference (GECCO 2016)

** Final Call for Papers **

2016 Genetic and Evolutionary Computation Conference (GECCO 2016)
July 20-24, 2016, Denver, Colorado, USA
http://gecco-2016.sigevo.org/

The Genetic and Evolutionary Computation Conference (GECCO 2016) will present
the latest high-quality results in genetic and evolutionary computation.
Topics include: genetic algorithms, genetic programming, evolution strategies,
evolutionary programming, memetic algorithms, hyper heuristics, real-world
applications, evolutionary machine learning, evolvable hardware, artificial
life, adaptive behavior, ant colony optimization, swarm intelligence,
biological applications, evolutionary robotics, coevolution, artificial immune
systems, and more.

The GECCO 2016 Program Committee invites the submission of technical papers
describing your best work in genetic and evolutionary computation. Abstracts
need to be submitted by January 27, 2016. Full papers are due by the
non-extensible deadline of February 3, 2016.

Each paper submitted to GECCO will be rigorously evaluated in a double-blind
review process. The evaluation is 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. All accepted papers will
be published in the ACM Digital Library. Researchers are invited to submit
abstracts of their work recently published in top-tier conferences and
journals to the Hot Off the Press track. Contributions will be selected based
on quality and interest to the GECCO community.

By submitting a paper, the author(s) agree that, if their paper is accepted,
they will:

- Submit a final, revised, camera-ready version to the publisher on or
before the camera ready deadline
- Register at least one author to attend the conference on or before
the advance registration deadline
- Attend the conference (at least one author)
- Present the accepted paper at the conference

Important Dates:

Abstract Deadline: January 27, 2016
Submission of Full Papers: February 3, 2016
Conference: 20-24 July, 2016

Please note that abstracts can still be modified in the final paper submission.

********

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


**********************************************************
*
* 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] Sao Paulo School on Algorithms, Combinatorics and Optimization

FIRST CALL: São Paulo School of Advanced Science on Algorithms, Combinatorics and Optimization, July 2016, Brazil

The São Paulo School of Advanced Science on Algorithms, Combinatorics and Optimization (SPSAS-ACO) will be held from 18 to 29 July 2016, at the University of São Paulo, Brazil.

http://sp-school2016.ime.usp.br

The school is aimed at Master's students, PhD students, and young researchers. Exceptional undergraduate students may also qualify.

COURSES:

- Robert Kleinberg (Cornell), Combinatorial stochastic search and selection

- Yoshiharu Kohayakawa (USP), The regularity method and blow-up lemmas for sparse graphs

- Alexandr Kostochka (UIUC), Coloring sparse graphs with few colors

- Daniel Král' (Warwick), Graph limits and their applications in extremal combinatorics

- Cláudio L. Lucchesi (UFMS), The perfect matching polytope, solid bricks and the perfect matching lattice

- Flávio K. Miyazawa (UNICAMP) and Fernando Mário de Oliveira Filho (USP), Geometric packing

- Rob Morris (IMPA), The method of hypergraph containers

- Sinai Robins (USP), Harmonic analysis on polytopes and cones

- Levent Tunçel (Waterloo), Semidefinite programming techniques in combinatorial optimization

- Eli Upfal (Brown), Sample complexity and uniform convergence

- David Williamson (Cornell), Recent progress in approximation algorithms for the traveling salesman problem (to be confirmed)

Additionally, there will be a series of talks on advanced research topics and participants will be invited to present their work in poster sessions. The school will provide a congenial environment for participant interactions.

Participants may choose the courses they will attend, but are expected to stay for the whole duration of the school (arrival date: 17 July; departure date: 30 July). We expect to have around 85 students and young researchers.

COSTS AND FELLOWSHIPS:

Local expenses of all participants will be fully covered. Help towards travelling expenses will also be provided to most participants.

APPLICATION:

Funding applications sent by March 28 will receive full consideration.

An online application form will soon be available at http://sp-school2016.ime.usp.br

SPONSOR

The school is financed by the São Paulo Research Foundation (FAPESP), under the SPSAS program: http://espca.fapesp.br/home

**********************************************************
*
* 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, January 23, 2016

[DMANET] iFMCloud'16 2nd CfP: 1st Int'l Workshop on Formal Methods for and on the Cloud

[We apologize if you receive multiple copies of this Call for Papers.]


============================ Call for Papers =============================

iFMCloud 2016

1st International
Workshop on Formal Methods for and on the
Cloud

https://ifmcloud2016.nntb.no/

co-located with iFM 2016, 1-4 June 2016,
Reykjavik, Iceland
=====================================================================

Important Dates

Abstract submission deadline: February 13, 2016
Paper submission deadline: February 20, 2016
Author notifications: March 25, 2016
Camera-ready copies: April 10, 2016
Workshop date: June 4, 2016


Keynote Speaker

Gul Agha (University of Illinois at Urbana-Champaign, USA)

Motivation

Cloud solutions are increasingly used for a plethora of purposes, including
solving memory-intensive and computation-intensive problems. Ensuring the
reliability, availability, scalability, and security of cloud solutions, as
networked distributed systems with properties such as dynamic reallocation
of resources, is a challenging problem that requires rigorous modeling,
analysis, and verification tools. Such tools can be devised using the
techniques provided by the formal methods community. On the other hand,
many
formal analysis and verification tools are memory-intensive and
computation-intensive solutions, which can benefit from the cloud
technology.


The goal of the iFMCloud workshop is to identify and better understand
challenges of using formal and semi-formal methods for modeling and
verification of Cloud-based systems and computer and communication
networks,
as well as challenges and opportunities in providing formal analysis and
verification as services on the Cloud. We aim to reach these goals by
bringing together researchers and practitioners from these, and other
related fields.


Topics

We particularly encourage position papers and experience reports, which
identify and structure open challenges and research questions. We are
interested in all topics related to synergies between the fields of formal
and semi-formal methods and the fields of cloud computing and computer and
communication networks, including but not limited to:

* Formal and semi-formal methods for modeling, analysis, and verification
of Cloud-based systems and computer and communication networks:
- Methods for analysis and design of cloud infrastructures
- Methods for analysis and design of cloud applications
- Modeling and verification of networked systems, in particular
SDN-based systems
- Runtime analysis, monitoring, and performance evaluation
* Formal analysis and verification as services on the Cloud
- Opportunities and challenges of providing formal analysis and
verification as services on the Cloud
- Distributed algorithms for analysis and verification
* Testing as a service on the Cloud
* Case studies and experience reports
* Position statements setting a research agenda for collaboration between
the formal methods community, the cloud computing community, and other
related fields


Submission guidelines

Authors are invited to submit position papers and experience reports (max 8
pages) in
EPTCS proceedings format. Submissions must be original, and will be
selected based on
the relevance to the workshop topics and the suitability to trigger
discussions. All
submissions will be reviewed by at least three members of the program
committee.
Accepted papers will be published in an EPTCS volume. Papers should be
submitted via
Easychair at:
https://easychair.org/conferences/?conf=ifmcloud16


Contact Information

To contact the organizers, please send an email to:
iFMCloud16-organizers@googlegroups.com


Organizing Committee

Razieh Behjati, Simula Research Laboratory, Norway
Ahmed Elmokashfi, Simula Research Laboratory, Norway


Program Committee

Eva Darulova, MPI-SWS, Germany
Fatemeh Ghassemi, University of Tehran, Iran
Arnaud Gotlieb, Simula Research Laboratory, Norway
Ernst Gunnar Gran, Simula Research Laboratory, Norway
Hossein Hojjat, Cornell University, USA
Geir Horn, University of Oslo, Norway
Andreas Kassler, Karlstad University, Sweden
Steven Latre, University of Antwerp - iMinds, Belgium
Meriem Ouederni, IRIT/INPT Toulouse, France
Rosario Pugliese, University of Florence, Italy
Sven-Arne Reinemo, Fabriscale Technologies, Norway
Hamideh Sabouri, Shahid Beheshti University, Iran
Jesus Escudero Sahuquillo, Technical University of Valencia, Spain
Sagar Sen, Simula Research Laboratory, Norway
Marjan Sirjani, Reykjavik University, Iceland
Martin Steffen, University of Oslo, Norway
Amirhossein Taherkordi, University of Oslo, Norway

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