FAPER2020 workshop at ICPR2020
*** UPDATES in relation to COVID-19 (Coronavirus) ***
/// SUBMISSION DEADLINE POSTPONED TO OCTOBER 10TH, 2020 \\\
---===== Apologies for cross-postings =====---
Please distribute this call to interested parties
_______________________________________________________________________
International Workshop on Fine Art Pattern Extraction and Recognition
F A P E R 2 0 2 0
workshop in conjunction with the
25th International Conference on Pattern Recognition (ICPR2020)
Milan, Italy, January 10-15, 2021
>>> https://sites.google.com/view/faper-workshop/ <<<
*** Submission deadline: October 15, 2020 ***
- Submission link: https://easychair.org/conferences/?conf=faper2020 -
_______________________________________________________________________
=== UPDATES in relation to COVID-19 (Coronavirus) ===
Given the COVID-19 situation in Italy and all over the globe, the ICPR
2020 Chairs have decided to shift the Conference schedule, including
FAPER2020, to the beginning of January 2021.
FAPER2020 submission deadline has been postponed as well to October
10th, 2020.
=== Aim & Scope ===
Cultural heritage, in particular fine art, has invaluable importance for
the cultural, historic, and economic growth of our societies. Fine art
is developed primarily for aesthetic purposes, and it is mainly
concerned with paintings, sculptures, and architectures. In the last few
years, due to technology improvements and drastically declining costs, a
large-scale digitization effort has been made, leading to a growing
availability of large digitized fine art collections. This availability,
along with the recent advancements in pattern recognition and computer
vision, has opened new opportunities for computer science researchers to
assist the art community with automatic tools to analyse and further
understand fine arts. Among the other benefits, a deeper understanding
of fine arts has the potential to make them more accessible to a wider
population, both in terms of fruition and creation, thus supporting the
spread of culture.
The ability to recognize meaningful patterns in fine art inherently
falls within the domain of human perception, and this perception can be
extremely hard to conceptualize. Thus, visual-related features, such as
those automatically learned by deep learning models, can be the key to
tackling problems of extracting useful representations from low-level
colour and texture features. These representations can assist in various
art-related tasks, ranging from object detection in paintings to
artistic style categorization, useful for examples in museum and art
gallery websites.
The aim of the workshop is to provide an international forum for those
who wish to present advancements in the state of the art, innovative
research, ongoing projects, and academic and industrial reports on the
application of visual pattern extraction and recognition for the better
understanding and fruition of fine arts. The workshop solicits
contributions from diverse areas such as pattern recognition, computer
vision, artificial intelligence and image processing.
=== Topics ===
Topics of interest include, but are not limited to:
- Application of machine learning and deep learning to cultural heritage
- Computer vision and multimedia data
- Generative adversarial networks for artistic data
- Augmented and virtual reality for cultural heritage
- 3D reconstruction of historical artifacts
- Historical document analysis
- Content-based retrieval in the art domain
- Speech, audio and music analysis from historical archives
- Digitally enriched museum visits
- Smart interactive experiences in cultural sites
- Projects, products or prototypes for cultural heritage restoration,
preservation and fruition
=== Important Dates ===
- October 10th, 2020 - workshop submission deadline
- November 10th, 2020 - author notification
- November 15th, 2020 - camera-ready submission
- December 1st, 2020 - finalized workshop program
=== Submission guidelines ===
Submissions must be formatted in accordance with the Springer's Computer
Science Proceedings guidelines. The following paper categories are welcome:
- Full papers (12-15 pages, including references)
- Short papers (6-8 pages, including references)
Accepted manuscripts will be included in the ICPR 2020 Workshop
Proceedings Springer volume. Once accepted, at least one author is
expected to attend the event and orally present the paper. Authors of
selected papers will be invited to extend and improve their
contributions for a Special Issue of the Journal of Imaging (MDPI).
=== Organizing committee ===
Gennaro Vessio (University of Bari, Italy)
Giovanna Castellano (University of Bari, Italy)
Fabio Bellavia (University of Palermo, Italy)
=== Venue ===
The workshop will be hosted at Milan Congress Center (Mi.Co.), which is
located in Piazzale Carlo Magno 1, Milan, Italy.
_______________________________________________________________________
Contacts: gennaro.vessio@uniba.it
giovanna.castellano@uniba.it
fabio.bellavia@unipa.it
Workshop: https://sites.google.com/view/faper-workshop/
ICPR2020: https://www.micc.unifi.it/icpr2020/
**********************************************************
*
* 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 6, 2020
[DMANET] TOMORROW: NCN Online Colloquium--Maria Chudnovsky
*We hope you will join us tomorrow for the next Virtual Combinatorics
Colloquium of the Northeastern Combinatorics Network!*
Colloquium of the Northeastern Combinatorics Network!*
Please join us for the following up-coming Virtual Combinatorics
Colloquium. Individuals and viewing party groups from anywhere in the
world can "attend" these online talks and interact with the speaker and
other attendees remotely via Zoom.
*Zoom link: https://smcvt.zoom.us/j/831984515
<https://smcvt.zoom.us/j/831984515> *
*Date: *Tuesday, 7 April 2020
*Time*: 2:00 p.m. (14:00) Eastern Daylight Time
*Speaker: *Maria Chudnovsky, Princeton University
*Title:* RECENT PROGRESS ON THE ERDOS-HAJNAL CONJECTURE
*Abstract: *What is the effect of excluding an induced subgraph on the
global structure of a graph? While there do not seem to be general
structural consequences, a conjecture of Erdos and Hajnal states that
graphs with forbidden induced subgraphs behave very differently from
general graphs; more precisely they contain much larger cliques or stable
sets. This conjecture is still open. In this talk we will discuss the
history of this problem and some recent theorems related to it.
Click on the given link to join. Depending on your set-up, there may be a
very brief download, but we are using the Zoom platform, so it should be
pretty minimal. Past VCC events have gone very smoothly.
Here are quick instructions for joining a Zoom meeting:
https://support.zoom.us/hc/en-us/articles/201362193-How-Do-I-Join-A-Meeting-
The talk will start at the given time, but the invitation will be open 30
minutes so that anyone who wants to can call in early and get a sense of
how the platform works (how to mute/unmute, share screens, shared
whiteboard, raise hand, chat, etc.). It is very similar in feel to many
other like products, but takes a bit to figure out where Zoom puts the
buttons.
*To avoid the possibility of distraction and feedback noise, please keep
your mic muted unless you or someone in your group has something particular
to say.*
The *Northeast Combinatorics Network* (NCN) is funded by the US National
Science Foundation.
Activities, including *Discrete Math Days in the Northeast* (DMD), *Summer
Combo in Vermont*, and the *Virtual Combinatorics Colloquium* (VCC), are
detailed on the NCN website:
Google Sites: Northeast Combinatorics Network
<https://sites.google.com/view/northeastcombinatoricsnetwork/home>
Email: northeastcombinatoricsnetwork@gmail.com
YouTube Channel: Northeast Combinatorics Network
<https://www.youtube.com/channel/UCQYSxI_EL0nhE9E6aZZra5Q>
Some VCC tips:
For reporting purposes, we appreciate knowing who is attending and the
institution/location of the attendees. Please provide this information in
the chat feature of Zoom when you sign in.
Callers may find it helpful to use headphones if possible, as this reduces
feedback issues.
The default will be for the audience to be muted (again to reduce feedback
issues), but participants can unmute themselves, or use the 'raise hand'
button, if they have questions. Participants should keep microphones muted
unless someone wants to raise a hand and ask a question. If feedback
occurs, turn off your volume to ask the question, then turn it back on to
hear the answer.
The talk will be recorded, so participants should consider this in choosing
whether or not to use identifying features such as video and chat.
*Jo*
Jo Ellis-Monaghan
Chair, Department of Mathematics and Statistics (on sabbatical 2019-2020)
Editor-in-Chief, PRIMUS
Saint Michael's College
One Winooski Park
Colchester, VT 05439
office: Jeanmarie 279
website: http://academics.smcvt.edu/jellis-monaghan/
phone: 802 654 2660
fax: 802 654 2960
e-mail: je <jellis-monaghan@smcvt.edu>llismonaghan@gmail.com
<llismonaghan@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/
*
**********************************************************
[DMANET] Optimization 2020 - Cancelled
Dear Colleagues
Due to the uncertainty motivated by Covid-19 and the implications on international travel and gatherings,
we have decided to cancel the 10th Optimization Conference.
At this time we are considering several options for reschedulling the conference.
As this is an evolving situation we will be monitoring
the situation over the next few months and can hopefully make a decision by mid/late summer.
?
We hope that you will be able to join us on the reschedulled dates.
Stay healthy, Agostinho Agra and Luis Gouveia?
**********************************************************
*
* 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/
*
**********************************************************
Due to the uncertainty motivated by Covid-19 and the implications on international travel and gatherings,
we have decided to cancel the 10th Optimization Conference.
At this time we are considering several options for reschedulling the conference.
As this is an evolving situation we will be monitoring
the situation over the next few months and can hopefully make a decision by mid/late summer.
?
We hope that you will be able to join us on the reschedulled dates.
Stay healthy, Agostinho Agra and Luis Gouveia?
**********************************************************
*
* 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] MFCS 2020 - deadline update
MFCS 2020 - Updated Call for Papers
The 45th International Symposium on Mathematical Foundations of Computer
Science
August 24-28, 2020, Prague, Czech Republic
CORONAVIRUS STATEMENT
The coronavirus pandemics is causing a major disruption in lives of many
members of our community. To accommodate those members we decided to postpone
the submission deadline from April 20 to May 4 and the notification from June
15 to June 29. With the notification we will ask all authors how likely they
are to come for a physical meeting to Prague as originally planned. Based on
this feedback the conference will be either held physically (with an option of
remote participation and a reduced conference fee for those who cannot attend)
or completely virtually. Either way the publication of the conference
proceedings will go forward as usual.
CALL FOR PAPERS
The MFCS conference series has been organized since 1972. Traditionally,
the conference moved between the Czech Republic, Slovakia, and Poland,
while since 2013, the conference travels around Europe. In 2020, it will
come back to Prague, Czech Republic. MFCS is a high quality venue for
original research in all branches of theoretical computer science.
INVITED SPEAKERS
Nathalie Bertrand (INRIA, Rennes)
Sergio Cabello (Ljubljana)
Subhash Khot (NYU)
Parthasarathy Madhusudan (UIUC)
Mary Wootters (Stanford)
IMPORTANT DATES
Submission Deadline: Monday, May 4, 2020 (AoE)
Notification: Monday, June 29, 2020
Conference: Monday August 24 to Friday August 28, 2020
Workshops: Friday August 30 to Saturday August 31, 2020
SUBMISSION GUIDELINES
Papers should be submitted electronically through EasyChair at
https://easychair.org/conferences/?conf=mfcs2020
Submissions should be be formatted using the LIPIcs style with length
not exceeding 12 pages (excluding references and an optional appendix).
References and an optional appendix can go beyond the 12 pages (the
appendix will be consulted at the discretion of the program committee).
It is mandatory to use the LIPIcs style for submissions.
No prior publication or simultaneous submission to other conferences or
journals are allowed (except preprint repositories such as arXiv or
workshops without formal published proceedings).
PUBLICATION
MFCS 2020 proceedings will be published in LIPIcs (Leibniz International
Proceedings in Informatics) under an open source license (as in previous
years).
LIST OF TOPICS
We encourage submission of original research papers in all areas of
theoretical computer science, including (but not limited to) the following:
- algebraic and co-algebraic methods in computer science - algorithms and
data structures - automata and formal languages - bioinformatics -
combinatorics on words, trees, and other structures - computational
complexity (structural and model-related) - computational geometry -
computer-aided verification - computer-assisted reasoning - concurrency
theory - cryptography and security - databases and knowledge-based systems
- formal specifications and program development - foundations of computing
- logics in computer science - mobile computing - models of computation -
networks - parallel and distributed computing - quantum computing -
semantics and verification of programs - theoretical issues in artificial
intelligence and machine learning - types in computer science
COMMITTEES
PROGRAM COMMITTEE
Mohamed Faouzi Atig (Uppsala)
Giorgio Bacci (Aalborg)
Christel Baier (TU Dresden)
Paolo Baldan (Padova)
Michael Blondin (Sherbrooke)
Broňa Brejová (Comenius University)
Krishnendu Chatterjee (IST Austria)
Mahdi Cheraghchi (Imperial)
Thomas Colcombet (IRIF, Paris)
Wojciech Czerwiński (Warsaw)
Matthias Englert (Warwick)
Javier Esparza (TU Munich, co-chair)
Felix Fischer (QMUL)
Fedor Fomin (Bergen)
Marco Gaboardi (Boston University)
Jakub Gajarský (TU Berlin)
Heng Guo (Edinburgh)
Matthew Hague (RHUL)
Pavel Hubáček (Charles University)
Artur Jeż (Wroclaw)
Naoki Kobayashi (Tokyo)
Barbara König (Duisburg-Essen)
Lukasz Kowalik (Warsaw)
Dan Kráľ (Masaryk University and Warwick, co-chair)
Stefan Mengel (CNRS, CRIL)
Dirk Nowotka (Christian-Albrechts-Universität zu Kiel)
Zuzana Patáková (IST Austria)
Thomas Place (LaBRI, Bordeaux)
Gabriele Puppis (Udine)
Mickael Randour (FNRS, Mons)
Albert Rubio (UPC Barcelona)
Krishna S (IIT Bombay)
Marie-France Sagot (INRIA Lyon)
Sylvain Schmitz (IRIF Paris)
Sebastian Siebertz (Bremen)
Bettina Speckmann (Eindhoven)
Till Tantau (Lübeck)
Iddo Tzameret (RHUL)
László Végh (LSE)
Mahesh Viswanathan (UIUC)
Bartosz Walczak (Jagiellonian University)
Georg Zetzsche (MPI-SWS)
Stanislav Živný (Oxford)
ORGANIZING COMMITTEE
Andreas Feldmann, Michal Koucky (chair), Michal Opler, and CONFORG, s.r.o.
VENUE
The conference will be held in the Computer Science Building of Charles
University in the historic center of Prague.
WEBSITE
http://mfcs.mff.cuni.cz/2020/
**********************************************************
*
* 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 Call For Papers #CFP The 31st International Conference on Concurrency Theory – CONCUR 2020 — ONLINE (Vienna, Austria) — September 1-4, 2020
(Please distribute to interested parties **** Apologies for cross-posting)
-------------------------------------------------------------
FINAL CALL FOR PAPERS
31st International Conference on Concurrency Theory (CONCUR 2020)
September 1-4, 2020
ONLINE / VIRTUAL (Vienna, Austria)
https://easychair.org/cfp/CONCUR20
-------------------------------------------------------------
The purpose of CONCUR 2020, the 31st International Conference on Concurrency Theory, is to bring together researchers, developers, and students in order to advance the theory of concurrency, and promote its applications.
CONCUR 2020 is part of the umbrella conference QONFEST 2020 comprising the joint international 2020 meetings CONCUR, FMICS, FORMATS, QEST, alongside with several workshops and tutorials.
Amid the recent COVID-19 situation, the organization committee decided that QONFEST 2020, and thus also CONCUR 2020 will be organized online. Accepted papers will be published as planned, by September 2020, but no physical meeting/presentations will take place. We plan that the authors will record their talks and discuss them with the conference participants online. All CONCUR 2020 deadlines have been adjusted with two weeks dead-line extensions.
-------------------------------------------------------------
TOPICS
Submissions are solicited in semantics, logics, verification and analysis of concurrent systems. The principal topics include (but are not limited to):
-Basic models of concurrency such as abstract machines, domain-theoretic models, game-theoretic models, process algebras, graph transformation systems, Petri nets, hybrid systems, mobile and collaborative systems, probabilistic systems, real-time systems, biology-inspired systems, and synchronous systems;
-Logics for concurrency such as modal logics, probabilistic and stochastic logics, temporal logics, and resource logics;
-Verification and analysis techniques for concurrent systems such as abstract interpretation, atomicity checking, model checking, race detection, preorder and equivalence checking, run-time verification, state-space exploration, static analysis, syn-thesis, testing, theorem proving, type systems, and security analysis;
-Distributed algorithms and data structures: design, analysis, complexity, correctness, fault tolerance, reliability, availability, consistency, self-organization, self-stabilization, protocols;
-Theoretical foundations of architectures, execution environments, and software development for concurrent systems such as georeplicated systems, communication networks, multiprocessor and multi-core architectures, shared and transactional memory, resource management and awareness, compilers and tools for concurrent programming, programming models such as component-based, object- and service-oriented.
-------------------------------------------------------------
PAPER SUBMISSION
-CONCUR 2020 solicits high quality papers reporting research results and/or experience re-lated to the topics mentioned below.
-All papers must be original, unpublished, and not submitted for publication elsewhere. Each paper will undergo a thorough review process. The paper may be supplemented with a clearly marked appendix, which will be reviewed at the discretion of the program committee.
-The CONCUR 2020 proceedings will be published by LIPIcs.
-Papers must be submitted electronically as PDF files via EasyChair. Papers must not exceed 14 pages (excluding references and clearly marked appendices) using the LIPIcs style.
-------------------------------------------------------------
IMPORTANT DATES
All dates are AoE, extended because of COVID-19.
-Abstract submission: April 28, 2020
-Paper submission: May 6, 2020
-Notification: June 28, 2020
-Camera ready copy: July 17, 2020
-Conference: September 1-4, 2020
-------------------------------------------------------------
SPECIAL ISSUE
A special issue dedicated to selected papers from CONCUR 2020 will appear in Logical Methods in Computer Science.
-------------------------------------------------------------
ORGANIZATION COMMITTEE
Program Co-chairs
Igor Konnov - Informal Systems, Austria
Laura Kovacs - TU Wien, Austria
Workshop Chair
Florian Zuleger - TU Wien, Austria
Webmaster
Thanh-Hai Tran - TU Wien, Austria
-------------------------------------------------------------
PROGRAM COMMITTEE
Alessandro Abate, University of Oxford
Elvira Albert, Universidad Complutense de Madrid
Giovanni Bacci, Aalborg University
Filippo Bonchi, University of Pisa
Patricia Bouyer, CNRS
Yu-Fang Chen, Academia Sinica
Veronique Cortier, CNRS, Loria
Pedro R. D'Argenio, Universidad Nacional de Córdoba – CONICET
Michael Emmi, Amazon Web Services
Bernd Finkbeiner, Saarland University
Silvio Ghilardi, Università degli Studi di Milano
Roberto Giacobazzi, University of Verona
Rob van Glabbeek, Data61 – CSIRO
Alberto Griggio, Fondazione Bruno Kessler
Ichiro Hasuo, National Institute of Informatics
Sophia Knight, University of Minnesota
Igor Konnov, INRIA Nancy (LORIA)
Laura Kovacs, TU Wien
Antonin Kucera, Masaryk University
Marijana Lazic, TU Munich
Karoliina Lehtinen, University of Liverpool
Kuldeep S. Meel, National University of Singapore
Jan Otop, University of Wroclaw
Joel Ouaknine, Max Planck Institute for Software Systems (MPI-SWS)
Jorge A. Pérez, University of Groningen
Tatjana Petrov, University of Konstanz
Nir Piterman, University of Gothenburg
Giselle Reis, Carnegie Mellon University
Philipp Ruemmer, Uppsala University
Lutz Schröder, Friedrich-Alexander-Universität Erlangen-Nürnberg
Alexandra Silva, University College London
Ana Sokolova, University of Salzburg
Jun Sun, Singapore Management University
Max Tschaikowski, Aalborg University
Valeria Vignudelli, CNRS/ENS Lyon
Yakir Vizel, The Technion
Nobuko Yoshida, Imperial College London
Lijun Zhang, Institute of Software, Chinese Academy of Sciences
-------------------------------------------------------------
STEERING COMMITTEE
Javier Esparza, TU München, Germany, chair
Pedro D'Argenio, National University of Cordoba, Argentina
Wan Fokkink, Vrije Universiteit Amsterdam, The Netherlands
Joost-Pieter Katoen, RWTH, Germany
Catuscia Palamidessi, INRIA and Ecole Polytechnique, France
Davide Sangiorgi, University of Bologna, Italy
Jiri Srba, Aalborg University, 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/
*
**********************************************************
-------------------------------------------------------------
FINAL CALL FOR PAPERS
31st International Conference on Concurrency Theory (CONCUR 2020)
September 1-4, 2020
ONLINE / VIRTUAL (Vienna, Austria)
https://easychair.org/cfp/CONCUR20
-------------------------------------------------------------
The purpose of CONCUR 2020, the 31st International Conference on Concurrency Theory, is to bring together researchers, developers, and students in order to advance the theory of concurrency, and promote its applications.
CONCUR 2020 is part of the umbrella conference QONFEST 2020 comprising the joint international 2020 meetings CONCUR, FMICS, FORMATS, QEST, alongside with several workshops and tutorials.
Amid the recent COVID-19 situation, the organization committee decided that QONFEST 2020, and thus also CONCUR 2020 will be organized online. Accepted papers will be published as planned, by September 2020, but no physical meeting/presentations will take place. We plan that the authors will record their talks and discuss them with the conference participants online. All CONCUR 2020 deadlines have been adjusted with two weeks dead-line extensions.
-------------------------------------------------------------
TOPICS
Submissions are solicited in semantics, logics, verification and analysis of concurrent systems. The principal topics include (but are not limited to):
-Basic models of concurrency such as abstract machines, domain-theoretic models, game-theoretic models, process algebras, graph transformation systems, Petri nets, hybrid systems, mobile and collaborative systems, probabilistic systems, real-time systems, biology-inspired systems, and synchronous systems;
-Logics for concurrency such as modal logics, probabilistic and stochastic logics, temporal logics, and resource logics;
-Verification and analysis techniques for concurrent systems such as abstract interpretation, atomicity checking, model checking, race detection, preorder and equivalence checking, run-time verification, state-space exploration, static analysis, syn-thesis, testing, theorem proving, type systems, and security analysis;
-Distributed algorithms and data structures: design, analysis, complexity, correctness, fault tolerance, reliability, availability, consistency, self-organization, self-stabilization, protocols;
-Theoretical foundations of architectures, execution environments, and software development for concurrent systems such as georeplicated systems, communication networks, multiprocessor and multi-core architectures, shared and transactional memory, resource management and awareness, compilers and tools for concurrent programming, programming models such as component-based, object- and service-oriented.
-------------------------------------------------------------
PAPER SUBMISSION
-CONCUR 2020 solicits high quality papers reporting research results and/or experience re-lated to the topics mentioned below.
-All papers must be original, unpublished, and not submitted for publication elsewhere. Each paper will undergo a thorough review process. The paper may be supplemented with a clearly marked appendix, which will be reviewed at the discretion of the program committee.
-The CONCUR 2020 proceedings will be published by LIPIcs.
-Papers must be submitted electronically as PDF files via EasyChair. Papers must not exceed 14 pages (excluding references and clearly marked appendices) using the LIPIcs style.
-------------------------------------------------------------
IMPORTANT DATES
All dates are AoE, extended because of COVID-19.
-Abstract submission: April 28, 2020
-Paper submission: May 6, 2020
-Notification: June 28, 2020
-Camera ready copy: July 17, 2020
-Conference: September 1-4, 2020
-------------------------------------------------------------
SPECIAL ISSUE
A special issue dedicated to selected papers from CONCUR 2020 will appear in Logical Methods in Computer Science.
-------------------------------------------------------------
ORGANIZATION COMMITTEE
Program Co-chairs
Igor Konnov - Informal Systems, Austria
Laura Kovacs - TU Wien, Austria
Workshop Chair
Florian Zuleger - TU Wien, Austria
Webmaster
Thanh-Hai Tran - TU Wien, Austria
-------------------------------------------------------------
PROGRAM COMMITTEE
Alessandro Abate, University of Oxford
Elvira Albert, Universidad Complutense de Madrid
Giovanni Bacci, Aalborg University
Filippo Bonchi, University of Pisa
Patricia Bouyer, CNRS
Yu-Fang Chen, Academia Sinica
Veronique Cortier, CNRS, Loria
Pedro R. D'Argenio, Universidad Nacional de Córdoba – CONICET
Michael Emmi, Amazon Web Services
Bernd Finkbeiner, Saarland University
Silvio Ghilardi, Università degli Studi di Milano
Roberto Giacobazzi, University of Verona
Rob van Glabbeek, Data61 – CSIRO
Alberto Griggio, Fondazione Bruno Kessler
Ichiro Hasuo, National Institute of Informatics
Sophia Knight, University of Minnesota
Igor Konnov, INRIA Nancy (LORIA)
Laura Kovacs, TU Wien
Antonin Kucera, Masaryk University
Marijana Lazic, TU Munich
Karoliina Lehtinen, University of Liverpool
Kuldeep S. Meel, National University of Singapore
Jan Otop, University of Wroclaw
Joel Ouaknine, Max Planck Institute for Software Systems (MPI-SWS)
Jorge A. Pérez, University of Groningen
Tatjana Petrov, University of Konstanz
Nir Piterman, University of Gothenburg
Giselle Reis, Carnegie Mellon University
Philipp Ruemmer, Uppsala University
Lutz Schröder, Friedrich-Alexander-Universität Erlangen-Nürnberg
Alexandra Silva, University College London
Ana Sokolova, University of Salzburg
Jun Sun, Singapore Management University
Max Tschaikowski, Aalborg University
Valeria Vignudelli, CNRS/ENS Lyon
Yakir Vizel, The Technion
Nobuko Yoshida, Imperial College London
Lijun Zhang, Institute of Software, Chinese Academy of Sciences
-------------------------------------------------------------
STEERING COMMITTEE
Javier Esparza, TU München, Germany, chair
Pedro D'Argenio, National University of Cordoba, Argentina
Wan Fokkink, Vrije Universiteit Amsterdam, The Netherlands
Joost-Pieter Katoen, RWTH, Germany
Catuscia Palamidessi, INRIA and Ecole Polytechnique, France
Davide Sangiorgi, University of Bologna, Italy
Jiri Srba, Aalborg University, 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] EATCS-IPEC Nerode Prize - Final Call for Nominations
EATCS-IPEC Nerode Prize - Call for Nominations
Deadline: April 15, 2020
The EATCS-IPEC Nerode Prize for outstanding papers in the area of multivariate algorithmics, is presented annually with the presentation taking place at IPEC (International Symposium on Parameterized and Exact Computation). IPEC 2020 takes place within ISAAC 2020, December 14-16, 2020, Hong Kong. The Prize is named in honor of Anil Nerode in recognition of his major contributions to mathematical logic, theory of automata, computability and complexity theory.
Award Committee
The winning paper(s) will be selected by the EATCS-IPEC Nerode Prize Award Committee. This year's committee consists of the following people.
Hans L. Bodlaender (Chair, Utrecht University, h.l.bodlaender@uu.nl),
Anuj Dawar (University of Cambridge, anuj.dawar@cl.cam.ac.uk)
Virgi V. Williams (MIT, virgi@mit.edu).
Deadline for Nominations: April 15, 2020. (Original deadline: March 15, 2020.)
Decision: June 15, 2020.
The Award Committee is solely responsible for the selection of the winner of the award which may be shared by more than one paper or series of papers. The Award Committee reserves the right to declare no winner at all.
Eligibility
Any research paper or series of research papers by a single author or by a team of authors published in a recognized refereed journal. The research work nominated for the award should be in the area of multivariate algorithms and complexity meant in a broad sense, and encompasses, but is not restricted to those areas covered by IPEC. The Award Committee has the ultimate authority to decide on the eligibility of a nomination. Papers authored by a member of the Award Committee are not eligible for nomination.
Note that the past restrictions that require a certain number of years before/after the publication of the nominated papers have been removed.
Nominations
Nominations may be made by any member of the scientific community including the members of the Award Committee. A nomination should contain a brief summary of the technical content of each nominated paper and a brief explanation of its significance. Nominations are done by an email to the Award Committee Chair with copies to the members of the committee. The Subject line of the nomination E-mail should contain the group of words "Nerode Prize Nomination".
**********************************************************
*
* 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/
*
**********************************************************
Deadline: April 15, 2020
The EATCS-IPEC Nerode Prize for outstanding papers in the area of multivariate algorithmics, is presented annually with the presentation taking place at IPEC (International Symposium on Parameterized and Exact Computation). IPEC 2020 takes place within ISAAC 2020, December 14-16, 2020, Hong Kong. The Prize is named in honor of Anil Nerode in recognition of his major contributions to mathematical logic, theory of automata, computability and complexity theory.
Award Committee
The winning paper(s) will be selected by the EATCS-IPEC Nerode Prize Award Committee. This year's committee consists of the following people.
Hans L. Bodlaender (Chair, Utrecht University, h.l.bodlaender@uu.nl),
Anuj Dawar (University of Cambridge, anuj.dawar@cl.cam.ac.uk)
Virgi V. Williams (MIT, virgi@mit.edu).
Deadline for Nominations: April 15, 2020. (Original deadline: March 15, 2020.)
Decision: June 15, 2020.
The Award Committee is solely responsible for the selection of the winner of the award which may be shared by more than one paper or series of papers. The Award Committee reserves the right to declare no winner at all.
Eligibility
Any research paper or series of research papers by a single author or by a team of authors published in a recognized refereed journal. The research work nominated for the award should be in the area of multivariate algorithms and complexity meant in a broad sense, and encompasses, but is not restricted to those areas covered by IPEC. The Award Committee has the ultimate authority to decide on the eligibility of a nomination. Papers authored by a member of the Award Committee are not eligible for nomination.
Note that the past restrictions that require a certain number of years before/after the publication of the nominated papers have been removed.
Nominations
Nominations may be made by any member of the scientific community including the members of the Award Committee. A nomination should contain a brief summary of the technical content of each nominated paper and a brief explanation of its significance. Nominations are done by an email to the Award Committee Chair with copies to the members of the committee. The Subject line of the nomination E-mail should contain the group of words "Nerode Prize Nomination".
**********************************************************
*
* 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 5, 2020
[DMANET] Permanent Lecturer Position at Freie Universität Berlin
The Department of Computer Science at Freie Universität Berlin announces
one lecturer position (100% TV-L E13, permanent)
in theoretical computer science.
The main tasks are
- to teach basic Bachelor classes in mathematics for computer science
(discrete mathematics and probability theory, analysis, linear algebra)
and in computer science for majors in other fields (bioinformatics,
business informatics, mathematics, physics, etc)
- to advise Bachelor and Master theses in computer science
- to participate in administrative tasks
The main requirements are
- a PhD and research experience in Computer Science or a related field
- experience in teaching undergraduate computer science
- fluency in German (all undergraduate teaching at FU Berlin takes place
in German)
The detailed announcement with instructions for the application can be
found here (in German):
https://www.fu-berlin.de/universitaet/beruf-karriere/jobs/wiss/19_fb-mathematik-und-informatik/MI-DauerWiMi1_Inf_2020_-DauerWimi2_Inf_2020.html
If you have further questions about the position, please send an email
to mulzer[at]inf.fu-berlin.de .
The application deadline is 27. April 2020.
**********************************************************
*
* 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] QBF 2020 - Call for papers
CALL FOR PAPERS
QBF 2020
--------
International Workshop on
Quantified Boolean Formulas and Beyond
Alghero, Italy, July 5, 2020
https://www.ac.tuwien.ac.at/qbf2020
Affiliated to and co-located with:
Int. Conf. on Theory and Applications
of Satisfiability Testing (SAT 2020)
July 5-9, 2020, Alghero, Italy
** The workshop/conference organization is monitoring the COVID-19
situation, and we hope to do our best to support the form of dialogue
that this workshop aims to promote. For now, we would encourage those
interested in submitting to the workshop to proceed in doing so; given
the situation, we plan to give authors of accepted works a chance to
confirm their willingness to participate prior to finalizing this.
-------------------------------------------------------------
Quantified Boolean formulas (QBF) are an extension of propositional
logic which allows for explicit quantification over propositional
variables. The decision problem of QBF is PSPACE-complete, compared to
the NP-completeness of the decision problem of propositional logic (SAT).
Many problems from application domains such as model checking, formal
verification or synthesis are PSPACE-complete, and hence could be
encoded in QBF in a natural way. Considerable progress has been made
in QBF solving throughout the past years. However, in contrast to SAT,
QBF is not yet widely applied to practical problems in academic or
industrial settings. For example, the extraction and validation of
models of (un)satisfiability of QBFs has turned out to be
challenging, given that state-of-the-art solvers implement different
solving paradigms.
The goal of the International Workshop on Quantified Boolean Formulas
(QBF Workshop) is to bring together researchers working on theoretical
and practical aspects of QBF solving. In addition to that, it
addresses (potential) users of QBF in order to reflect on the
state-of-the-art and to consolidate on immediate and long-term
research challenges.
The workshop also welcomes work on reasoning with quantifiers in
related problems, such as dependency QBF (DQBF), quantified constraint
satisfaction problems (QCSP), and satisfiability modulo theories (SMT)
with quantifiers.
===============
IMPORTANT DATES
===============
April 24: Submission
May 12: Notification of acceptance
May 28: Final versions of accepted papers due
July 5: Workshop
Please see the workshop webpage for any updates:
https://www.ac.tuwien.ac.at/qbf2020
======================
CALL FOR CONTRIBUTIONS
======================
The workshop is concerned with all aspects of current research on all
formalisms enriched by quantifiers, and in particular QBF. The topics
of interest include (but are not limited to):
Applications, encodings and benchmarks with quantifiers
QBF Proof theory and complexity results
Experimental evaluations of solvers or related tools
Case studies illustrating the power of quantifiers
Certificates and proofs for QBF, QCSP, SMT with quantifiers, etc.
Formats of proofs and certificates
Implementations of proof checkers and verifiers
Decision procedures
Calculi and their relationships
Data structures, implementation details and heuristics
Pre- and inprocessing techniques
Structural reasoning
==========
SUBMISSION
==========
Submissions of extended abstracts are invited and will be managed via
Easychair:
https://easychair.org/conferences/?conf=qbf2020
In particular, we invite the submission of extended abstracts on work
that has been published already, novel unpublished work, or work in
progress.
The following forms of submissions are solicited:
- Proposals for short tutorial presentations on topics related to the
workshop. Tutorial proposals will be reviewed by the PC. The number
of accepted tutorials depends on the overall number of accepted
papers and talks, with the aim to set up a balanced workshop
program.
- Talk abstracts reporting on already published work. Such an abstract
should include an outline of the planned talk, and pointers to
relevant bibliography.
- Talk proposals presenting work that is unpublished or in progress.
- Submissions which describe novel applications of QBF or related
formalisms in various domains are particularly welcome.
Additionally, this call comprises known applications which have been
shown to be hard for QBF solvers in the past as well as new
applications for which present QBF solvers might lack certain
features still to be identified.
Each submission should have an overall length of 1-4 pages in LNCS
format. Authors may decide to include an appendix with additional
material. Appendices will be considered at the reviewers' discretion.
The accepted extended abstracts will be published on the workshop
webpage. The workshop does not have formal proceedings.
Authors of accepted contributions are expected to give a talk at the
workshop.
=======
CONTACT
=======
=================
PROGRAM COMMITTEE
=================
Hubie Chen, Birbeck, University of London (co-chair)
Friedrich Slivovsky, Vienna University of Technology (co-chair)
Joshua Blinkhorn, Friedrich-Schiller-Universität Jena
Mikolas Janota, INESC-ID/IST, University of Lisbon
Paqui Lucio, University of the Basque Country
Stefan Mengel, CNRS, CRIL
Tomáš Peitl, Friedrich-Schiller-Universität Jena
Ralf Wimmer, Concept Engineering GmbH & Albert-Ludwigs-Universität Freiburg
**********************************************************
*
* 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 3, 2020
[DMANET] The Highlights of Logic, Games, and Automata community mailing list
Dear all,
A few months ago we created a mailing list for the Highlights of Logic,
Games, and Automata community:
highlights_community@diff.u-bordeaux.fr
This is the place to post about job openings (including PhD studentships
and research internships), calls for events, and other announcements
relevant to the research community working on Logic, Games, and Automata,
broadly construed.
The list is already more than a hundred members strong.
*Please consider signing up here:*
https://diff.u-bordeaux.fr/sympa/info/highlights_community
or by sending an email to sympa@diff.u-bordeaux.fr with subject line:
subscribe highlights_community Firstname Lastname
The list is moderated to make sure that the emails are pertinent. It is not
meant to be a discussion forum, so only "announcements" will be
disseminated. There are several features offered by the sympa manager,
including: publicly available archives, digests, RSS.
**********************************************************
*
* 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/
*
**********************************************************
A few months ago we created a mailing list for the Highlights of Logic,
Games, and Automata community:
highlights_community@diff.u-bordeaux.fr
This is the place to post about job openings (including PhD studentships
and research internships), calls for events, and other announcements
relevant to the research community working on Logic, Games, and Automata,
broadly construed.
The list is already more than a hundred members strong.
*Please consider signing up here:*
https://diff.u-bordeaux.fr/sympa/info/highlights_community
or by sending an email to sympa@diff.u-bordeaux.fr with subject line:
subscribe highlights_community Firstname Lastname
The list is moderated to make sure that the emails are pertinent. It is not
meant to be a discussion forum, so only "announcements" will be
disseminated. There are several features offered by the sympa manager,
including: publicly available archives, digests, RSS.
**********************************************************
*
* 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 studentship in Security, Privacy and Trust, in Luxembourg
Dear colleague,
University of Luxembourg is seeking candidates to fill a PhD studentship broadly in the research area of ``Security and Trust of Software Systems.'' Candidates should hold a master degree in computer science or mathematics.
Start date: From 15 June 2020, negotiable
Terms: full time and fully funded for duration of study
Apply here (CV + research statement required): http://emea3.mrted.ly/2g9oy
This studentship will be conducted in the Security and Trust of Software Systems (SaToSS) group, led by Prof Sjouke Mauw, with co-supervision from an experienced researcher within the research group. The SaToSS group has a track record in producing outstanding researchers, for example the most recent PhD graduate, Jorge Toro-Pozo, received the award for the best thesis of the year in computer science at University of Luxembourg and is now a researcher at ETH Zurich.
More info on SaToSS: https://satoss.uni.lu/members/
PhD thesis topics are not limited to:
1. Privacy in: social networks, ePassports, ePayments, eVoting, blockchains, location-aware services, etc.
2. Security of: multiparty protocols, distance bounding protocols (preventing relay attacks), fair exchange protocols (agreeing on terms of transactions), threat and trust models, Android security, GNSS security, adversarial examples and bias in neural networks and language, hardware-isolation using virtualization, etc.
3. Cyber security risk assessment: using attack trees, of cyber-physical and socio-technical systems, of New Space architectures (e.g., satellite constellations), etc.
The methodology typically applied in the group is to harness (formal) methods and tools to analyse topical security and trust problems such as the above. Methods employed are not limited to various strands of symbolic analysis, concurrency theory, logic, graph theory, and game theory. A master degree in computer science with an security element helps; however a student comfortable proving theorems can generally convert to such topics, if research in security is a new. Specific topics can be provided on request, and can be matched to a strong student's background and interests.
The University of Luxembourg offers highly competitive salaries and is an equal opportunity employer.
For further information, and to discuss the suitability of topics and potential supervisors, please contact Dr. Ross Horne, at ross.horne@uni.lu, or Prof. Dr. Sjouke Mauw, at sjouke.mauw@uni.lu.
**********************************************************
*
* 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/
*
**********************************************************
University of Luxembourg is seeking candidates to fill a PhD studentship broadly in the research area of ``Security and Trust of Software Systems.'' Candidates should hold a master degree in computer science or mathematics.
Start date: From 15 June 2020, negotiable
Terms: full time and fully funded for duration of study
Apply here (CV + research statement required): http://emea3.mrted.ly/2g9oy
This studentship will be conducted in the Security and Trust of Software Systems (SaToSS) group, led by Prof Sjouke Mauw, with co-supervision from an experienced researcher within the research group. The SaToSS group has a track record in producing outstanding researchers, for example the most recent PhD graduate, Jorge Toro-Pozo, received the award for the best thesis of the year in computer science at University of Luxembourg and is now a researcher at ETH Zurich.
More info on SaToSS: https://satoss.uni.lu/members/
PhD thesis topics are not limited to:
1. Privacy in: social networks, ePassports, ePayments, eVoting, blockchains, location-aware services, etc.
2. Security of: multiparty protocols, distance bounding protocols (preventing relay attacks), fair exchange protocols (agreeing on terms of transactions), threat and trust models, Android security, GNSS security, adversarial examples and bias in neural networks and language, hardware-isolation using virtualization, etc.
3. Cyber security risk assessment: using attack trees, of cyber-physical and socio-technical systems, of New Space architectures (e.g., satellite constellations), etc.
The methodology typically applied in the group is to harness (formal) methods and tools to analyse topical security and trust problems such as the above. Methods employed are not limited to various strands of symbolic analysis, concurrency theory, logic, graph theory, and game theory. A master degree in computer science with an security element helps; however a student comfortable proving theorems can generally convert to such topics, if research in security is a new. Specific topics can be provided on request, and can be matched to a strong student's background and interests.
The University of Luxembourg offers highly competitive salaries and is an equal opportunity employer.
For further information, and to discuss the suitability of topics and potential supervisors, please contact Dr. Ross Horne, at ross.horne@uni.lu, or Prof. Dr. Sjouke Mauw, at sjouke.mauw@uni.lu.
**********************************************************
*
* 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] Online Colloquium--Maria Chudnovsky
*We hope you will join us for the next *Northeast Combinatorics
Network* Virtual
Combinatorics Colloquium!*
Network* Virtual
Combinatorics Colloquium!*
Please join us for the following up-coming Virtual Combinatorics
Colloquium. Individuals anywhere in the world can "attend" these online
talks and interact with the speaker and other attendees remotely via Zoom.
*Zoom link: https://smcvt.zoom.us/j/831984515
<https://smcvt.zoom.us/j/831984515> *
*Date: *Tuesday, 7 April 2020
*Time*: 2:00 p.m. (14:00) Eastern Daylight Time
*Speaker: *Maria Chudnovsky, Princeton University
*Title:* RECENT PROGRESS ON THE ERDOS-HAJNAL CONJECTURE
*Abstract: *What is the effect of excluding an induced subgraph on the
global structure of a graph? While there do not seem to be general
structural consequences, a conjecture of Erdos and Hajnal states that
graphs with forbidden induced subgraphs behave very differently from
general graphs; more precisely they contain much larger cliques or stable
sets. This conjecture is still open. In this talk we will discuss the
history of this problem and some recent theorems related to it.
Click on the given link to join. Depending on your set-up, there may be a
very brief download, but we are using the Zoom platform, so it should be
pretty minimal. Past VCC events have gone very smoothly.
Here are quick instructions for joining a Zoom meeting:
https://support.zoom.us/hc/en-us/articles/201362193-How-Do-I-Join-A-Meeting-
The talk will start at the given time, but the invitation will be open 30
minutes so that anyone who wants to can call in early and get a sense of
how the platform works (how to mute/unmute, share screens, shared
whiteboard, raise hand, chat, etc.). It is very similar in feel to many
other like products, but takes a bit to figure out where Zoom puts the
buttons.
*To avoid the possibility of distraction and feedback noise, please keep
your mic muted unless you or someone in your group has something particular
to say.*
The *Northeast Combinatorics Network* (NCN) is funded by the US National
Science Foundation.
Activities, including *Discrete Math Days in the Northeast* (DMD), *Summer
Combo in Vermont*, and the *Virtual Combinatorics Colloquium* (VCC), are
detailed on the NCN website:
Google Sites: Northeast Combinatorics Network
<https://sites.google.com/view/northeastcombinatoricsnetwork/home>
Email: northeastcombinatoricsnetwork@gmail.com
YouTube Channel: Northeast Combinatorics Network
<https://www.youtube.com/channel/UCQYSxI_EL0nhE9E6aZZra5Q>
Some VCC tips:
For reporting purposes, we appreciate knowing who is attending and the
institution/location of the attendees. Please provide this information in
the chat feature of Zoom when you sign in.
Callers may find it helpful to use headphones if possible, as this reduces
feedback issues.
Participants should keep microphones muted unless someone wants to raise a
hand and ask a question. If feedback occurs, turn off your volume to ask
the question, then turn it back on to hear the answer.
The default will be for the audience to be muted (again to reduce feedback
issues), but participants can unmute themselves, or use the 'raise hand'
button, if they have questions.
*Jo*
Jo Ellis-Monaghan
Chair, Department of Mathematics and Statistics (on sabbatical 2019-2020)
Editor-in-Chief, PRIMUS
Saint Michael's College
One Winooski Park
Colchester, VT 05439
office: Jeanmarie 279
website: http://academics.smcvt.edu/jellis-monaghan/
phone: 802 654 2660
fax: 802 654 2960
e-mail: je <jellis-monaghan@smcvt.edu>llismonaghan@gmail.com
<llismonaghan@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/
*
**********************************************************
[DMANET] PhD position Operations Research, University of Duisburg-Essen
The Operations Research group of Professor Kimms at the Mercator School of M=
anagement, University of Duisburg-Essen, Germany, is looking for a PhD candi=
date with strong OR skills. Our research focus is on math programming, graph=
theory or cooperative game theory approaches for problems in Logistics, Sup=
ply Chain Management, Revenue Management, or Disaster Management. Further de=
tails can be found on our website: https://www.log.msm.uni-due.de/startseite=
/
To be able to receive a PhD at our Management School the candidate is requir=
ed to have at least some basic knowledge in business administration or econo=
mics, i.e. "pure" mathematicians are not a good fit. The position has teachi=
ng obligations. Hence, a good command of German or English is a must. The of=
ficial announcement of the position (in German) can be found here:
https://www.log.msm.uni-due.de/fileadmin/Dateien/Logistics/Dokumente/Stellen=
ausschreibungen/aus_775-19_ii_wiss._mit._kimms__pluemacher_.pdf
Please feel free to send your application via email to alf.kimms@uni-due.de s=
ince our post office has reduced opening hours these days. Please send in al=
l the application material that is common in Germany (- just a CV won't be s=
ufficient). Our team is looking forward to receive your application.=
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
anagement, University of Duisburg-Essen, Germany, is looking for a PhD candi=
date with strong OR skills. Our research focus is on math programming, graph=
theory or cooperative game theory approaches for problems in Logistics, Sup=
ply Chain Management, Revenue Management, or Disaster Management. Further de=
tails can be found on our website: https://www.log.msm.uni-due.de/startseite=
/
To be able to receive a PhD at our Management School the candidate is requir=
ed to have at least some basic knowledge in business administration or econo=
mics, i.e. "pure" mathematicians are not a good fit. The position has teachi=
ng obligations. Hence, a good command of German or English is a must. The of=
ficial announcement of the position (in German) can be found here:
https://www.log.msm.uni-due.de/fileadmin/Dateien/Logistics/Dokumente/Stellen=
ausschreibungen/aus_775-19_ii_wiss._mit._kimms__pluemacher_.pdf
Please feel free to send your application via email to alf.kimms@uni-due.de s=
ince our post office has reduced opening hours these days. Please send in al=
l the application material that is common in Germany (- just a CV won't be s=
ufficient). Our team is looking forward to receive your application.=
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
[DMANET] Open PhD Position: Algorithms for Constraint Satisfaction
Linköping University advertises up to two (2) positions as
PhD student in Computer Science formally based at the Department
of Computer and Information Science (IDA) within the Wallenberg AI,
Autonomous Systems and Software Program (WASP). WASP is Sweden's
largest individual research program ever, and provides a platform for
academic research and education, fostering interaction with Sweden's
leading technology companies.
The PhD student(s) will join a research project on constraint satisfaction
problems (CSP) directed by prof. Peter Jonsson. This project is within
the WASP program for mathematical foundations of AI, and students within
this project will be part of the WASP graduate school. CSPs are a well-known and
important class of computational problems with a wide range of applications
within computer science, artificial intelligence, and mathematics. An instance
of the constraint satisfaction problem consists of a set of variables, a set
of possible variable values (known as the domain), and a set of constraints
which impose restrictions on value assignments to the variables. To solve
such a problem, a value has to be found for each variable so that all the
constraints are satisfied. The computational complexity of CSP problems has been
intensively studied during the last decades, and several breakthrough results have
recently been presented for the finite-domain case. These results are to a large
extent based on utilising methods from universal algebra and mathematical logic.
This project aims at developing new mathematical methods for analysing the
computational complexity of infinite-domain CSP problems---such problems have very interesting applications within computer science and AI (such as spatiotemporal reasoning, machine learning, scheduling, and bioinformatics). The project aim at constructing new algorithms with significantly better complexity than current algorithms. The work within this project
includes the construction of new algorithms, analysing their complexity, and identifiying general methods for the algorithm construction and analysis.
The application deadline is May 1, 2020.
For further information visit
https://liu.se/jobba-pa-liu/lediga-jobb?rmpage=job&rmjob=13594&rmlang=SE
or contact Peter Jonsson
peter.jonsson@liu.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/
*
**********************************************************
PhD student in Computer Science formally based at the Department
of Computer and Information Science (IDA) within the Wallenberg AI,
Autonomous Systems and Software Program (WASP). WASP is Sweden's
largest individual research program ever, and provides a platform for
academic research and education, fostering interaction with Sweden's
leading technology companies.
The PhD student(s) will join a research project on constraint satisfaction
problems (CSP) directed by prof. Peter Jonsson. This project is within
the WASP program for mathematical foundations of AI, and students within
this project will be part of the WASP graduate school. CSPs are a well-known and
important class of computational problems with a wide range of applications
within computer science, artificial intelligence, and mathematics. An instance
of the constraint satisfaction problem consists of a set of variables, a set
of possible variable values (known as the domain), and a set of constraints
which impose restrictions on value assignments to the variables. To solve
such a problem, a value has to be found for each variable so that all the
constraints are satisfied. The computational complexity of CSP problems has been
intensively studied during the last decades, and several breakthrough results have
recently been presented for the finite-domain case. These results are to a large
extent based on utilising methods from universal algebra and mathematical logic.
This project aims at developing new mathematical methods for analysing the
computational complexity of infinite-domain CSP problems---such problems have very interesting applications within computer science and AI (such as spatiotemporal reasoning, machine learning, scheduling, and bioinformatics). The project aim at constructing new algorithms with significantly better complexity than current algorithms. The work within this project
includes the construction of new algorithms, analysing their complexity, and identifiying general methods for the algorithm construction and analysis.
The application deadline is May 1, 2020.
For further information visit
https://liu.se/jobba-pa-liu/lediga-jobb?rmpage=job&rmjob=13594&rmlang=SE
or contact Peter Jonsson
peter.jonsson@liu.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/
*
**********************************************************
Thursday, April 2, 2020
[DMANET] RANDOM / APPROX updated call for papers
Call for Papers:
24th RANDOM & 23rd APPROX
August 17-19, 2020
24th RANDOM & 23rd APPROX
August 17-19, 2020
http://randomconference.com
http://approxconference.wordpress.com
====================================================
Paper submission deadline: April 24, 2020
====================================================
COVID UPDATE
Due to the Covid-19 pandemic, RANDOM, APPROX 2020 will be completely virtual. The details will be determined and announced later, but the authors will be expected (if deemed necessary by the format) to be able to present their result in a live online presentation for the above dates (Aug 17-19). At least one author of accepted papers is expected to be officially registered for the conference.
SCOPE
The 24th International Workshop on Randomization and Computation (RANDOM 2020) and the 23rd International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX 2020) will be held virtually on August 17-19, 2020.
RANDOM 2020 focuses on applications of randomness to computational and combinatorial problems while APPROX 2020 focuses on algorithmic and complexity theoretic issues relevant to the development of efficient approximate solutions to computationally difficult problems.
TOPICS
Papers are solicited in all research areas related to randomization and approximation, including but not limited to:
RANDOM
* design and analysis of randomized algorithms
* randomized complexity theory
* pseudorandomness and derandomization
* random combinatorial structures
* random walks/Markov chains
* expander graphs and randomness extractors
* probabilistic proof systems
* random projections and embeddings
* error-correcting codes
* average-case analysis
* smoothed analysis
* property testing
* computational learning theory
APPROX
* approximation algorithms
* hardness of approximation
* small space, sub-linear time and streaming algorithms
* online algorithms
* approaches that go beyond worst-case analysis
* distributed and parallel approximation
* embeddings and metric space methods
* mathematical programming methods
* spectral methods
* combinatorial optimization
* algorithmic game theory, mechanism design and economics
* computational geometric problems
* approximate learning
IMPORTANT DATES
Submissions: April 24, 2020
Notifications: June 11, 2020
Camera ready: June 22, 2020
SUBMISSIONS
Abstract Format: Electronic submissions are solicited. Please consult the following servers:
For submission of APPROX papers: http://www.easychair.org/conferences/?conf=approx2020
For submission of RANDOM papers: http://www.easychair.org/conferences/?conf=random2020
Note: You will be asked to login using an EasyChair account. Directions on how to register for such an account are available at the submission servers (you may also have an old account from a previous conference submission).
The submission must be received by 15:00pm (PDT) of April 24, 2020 for your submission to be considered.
Submission Format: Submissions should start with the title of the paper, each author's name, affiliation, and e-mail address, followed by a one-paragraph summary of the results to be presented. This should then be followed by a technical exposition on single-spaced pages on letter-size paper, using reasonable margins, page numbers, and at least 11-point font. The first 10 pages should contain the main ideas and techniques used to achieve the results including motivation and a clear comparison with related work (not including the references). There is no page limit but any material beyond the first 10 pages will be read at the sole discretion of the program committee.
Simultaneous submission to other conferences with published proceedings is not allowed except as explained below.
Dual submission with CCC 2020 for RANDOM 2020: The CCC 2020 notification deadline falls one week after the RANDOM conference deadline. We will allow submissions that are substantially similar to those submitted to CCC 2020 with the understanding that the authors will withdraw the RANDOM submission if the CCC submission is accepted. The authors will also have to declare such dual submissions through the submission server at the time of submission.
PROCEEDINGS
Accepted papers will be published in the online proceedings of the conference in the Leibniz International Proceedings in Informatics (LIPIcs) series, based at Schloss Dagstuhl. This guarantees perennial, free and easy electronic access, while the authors retain the rights over their work.
RANDOM Program Chair
Raghu Meka, UCLA mailto:raghuvardhan@gmail.com
APPROX Program Chair
Jarosław Byrka, University of Wrocław mailto:jby@cs.uni.wroc.pl
RANDOM Steering Committee
Oded Goldreich, Weizmann
Cris Moore, SFI
Anup Rao, U Washington
Omer Reingold, Stanford, Steering Committee Chair
Dana Ron, Tel Aviv University
Ronitt Rubinfeld, MIT
Amit Sahai, UCLA
Ronen Shaltiel, U Haifa, Publicity Chair
Alistair Sinclair, UC Berkeley
Paul Spirakis, U Liverpool
APPROX Steering Committee
Klaus Jansen, U Kiel
Samir Khuller, Northwestern University (Chicago)
Monaldo Mastrolilli, IDSIA
László A. Végh, LSE
PROGRAM COMMITTEES
RANDOM
Nima Anari, Stanford University
Eshan Chattopadhyay, Cornell University
Gil Cohen, Tel Aviv University
Parikshit Gopalan, VmWare Research
Prahladh Harsha, Tata Institute of Fundamental Research
Sam Hopkins, University of California, Berkeley
Valentine Kabanets, Simon Fraser University
Gautam Kamath, University of Waterloo
Tali Kaufman, Bar-Ilan University
Yin-Tat Lee, University of Washington
Sepideh Mahabadi, TTI Chicago
Raghu Meka, UCLA, PC chair
Jelani Nelson, University of California, Berkeley
Ryan O'Donnell, Carnegie Mellon University
Ilya Razenshteyn, Microsoft Research
Barna Saha, University of California, Berkeley
Tselil Schramm, Stanford University
Madhu Sudan, Harvard University
Avishay Tal, University of California, Berkeley
Eric Vigoda, Georgia Tech University
Mary Wootters, Stanford University
APPROX
Nikhil Bansal, CWI & TU Eindhoven
Jarosław Byrka, University of Wrocław, PC chair
Andreas Emil Feldmann, Charles University in Prague
Naveen Garg, IIT Delhi
Anupam Gupta, Carnegie Mellon
Pasin Manurangsi, Google Research
Evangelos Markakis, AUEB, Athens
Nicole Megow, University of Bremen
Marcin Mucha, University of Warsaw
Harald Räcke, TU Munich
Laura Sanità, TU Eindhoven & University of Waterloo
Chaitanya Swamy, University of Waterloo
Jakub Tarnawski, Microsoft Research
Anke van Zuylen, William and Mary
David Williamson, Cornell
**********************************************************
*
* 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: ANTS 2020 -- Deadline Extension and COVID-19 Information
CfP: 12th International Conference on Swarm Intelligence
=======================================================================
ANTS 2020
12th International Conference on Swarm Intelligence
October 26-28, 2020. Barcelona
Up-to-date information at http://www.swarm-intelligence.eu/ants2020/
=======================================================================
ANTS 2020
12th International Conference on Swarm Intelligence
October 26-28, 2020. Barcelona
Up-to-date information at http://www.swarm-intelligence.eu/ants2020/
Extended Submission Deadline: May 1, 2020
Submission site: https://easychair.org/conferences/?conf=ants2020
Proceedings published by Springer LNCS
=======================================================================
=======================================================================
COVID-19 Related Information
=======================================================================
Sadly, the COVID-19 pandemic has currently brought the social, economic,
and academic life in large parts of the world to a standstill. Moreover,
it seems very hard to forecast the near (even medium) term future,
making it uncertain whether it will be possible to have a physical
meeting in Barcelona or not. In case it will not be possible to hold
ANTS 2020 as an on-site conference, presenters will be required to
provide video presentations of their papers and posters. These video
presentations will be made available online by means of a dedicated
website. Moreover, the proceedings will be sent by land mail to everyone
who has registered.
=======================================================================
Extended deadline
=======================================================================
Given the high level of disruption caused by the COVID-19 pandemic, we
have decided to extend the submission by two weeks. The new deadline is
therefore: May 1, 2020
=======================================================================
Scope of the Conference
=======================================================================
Swarm intelligence is the discipline that deals with the study of
self-organizing processes both in nature and in artificial systems.
Researchers in ethology and animal behavior have proposed a number of
models to explain interesting aspects of collective behaviors such as
movement coordination, shape-formation or decision making. Recently,
algorithms and methods inspired by these models have been proposed to
solve difficult problems in many domains. Among these, it is worth
mentioning ant colony optimization (ACO) and particle swarm optimization
(PSO), focusing respectively on discrete and continuous optimisation
problems. Also, Swarm robotics represents another field of techniques
derived from swarm intelligence for the design of collaborative
multi-robot systems featuring enhanced efficiency, robustness and
scalability. ANTS 2020 aims to give researchers in swarm intelligence
the opportunity to meet, to present their latest research, and to
discuss current developments and applications. The three-day conference
will be held for the first time in Barcelona, on October 26–28, 2020.
=======================================================================
Relevant Research Areas
=======================================================================
ANTS 2020 solicits contributions dealing with any aspect of swarm
intelligence.
Typical, but not exclusive, topics of interest are:
- Behavioral models of social insects or other animal societies that can
stimulate new algorithmic approaches.
- Theoretical and empirical and research in swarm intelligence.
- Application of swarm intelligence methods (e.g., ant colony
optimisation or particle swarm optimisation) to real-world problems.
- Theoretical and experimental research in swarm robotics systems.
**********************************************************
*
* 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] SCIP Optimization Suite 7.0 released
Dear colleagues,
we are happy to announce the release of the SCIP Optimization Suite 7.0.
It consists of SCIP 7.0, SoPlex 5.0, ZIMPL 3.3.9, UG 0.8.9, GCG 3.0.3, and
PaPILO 1.0. Additionally, version 3.2 of SCIP-SDP has been released.
New features of the SCIP Optimization Suite 7.0 include
- the first release of PaPILO, a Parallel Presolve Library for Integer
Linear Optimization,
- tree size estimation methods to predict the search progress and
trigger restarts,
- the extension of SCIP's Benders' decomposition to handle convex MINLP
subproblems,
- a data structure to store decomposition information, used in primal
heuristics and
Benders' decomposition,
- a revision of SCIP's symmetry handling methods allowing the
combination of
polyhedral methods with orbital fixing,
and many further improvements and additions, resulting in significant
speedups for both MIP and MINLP.
For more information check out our website http://scip.zib.deand the
accompanying release report with an in-depth description of the
enhancements, which is available at Optimization Online:
http://www.optimization-online.org/DB_HTML/2020/03/7705.html
Best regards,
the SCIP team and friends
**********************************************************
*
* 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
13th International Workshop on Computational Optimization (WCO20)
Sofia, Bulgaria, September 6-9, 2020
organized in the framework of FEDERATED CONFERENCE ON COMPUTER SCIENCE AND
INFORMATION SYSTEMS
FedCSIS - 2020
IEEE CS is a technical co-sponsor of FedCSIS 2020
https://fedcsis.org/2020/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
*numerical and heuristic methods for modeling
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.
*environment modeling and optimization
===============================
Best paper award
The best WCO20 paper will be awarded during the social dinner of
FedCSIS2020.
The best paper will be selected by WCO19 co-Chairs by taking into
consideration the scores suggested by the reviewers, as well as the quality
of the given oral presentation.
===============================
Submission and Publication
* Authors should submit draft papers in PDF format.
* The total length of a paper should not exceed 10 pages for regular paper
and 4 pages for short papers (IEEE style). IEEE style templates are
available at http://www.fedcsis.org/.
* Papers will be refereed and accepted on the basis of their scientific
merit and relevance to the workshop.
* Accepted and presented papers will be published in the Conference
Proceedings and included in the IEEE Xplore database and submitted for
different indexations (Communication and Position papers will only appear
in the conference proceedings).
* Extended versions of selected papers presented at WCO18 will be published
in edited books of the series "Studies of Computational Intelligence",
Springer.
===============================
Important dates:
Paper submission (sharp / no extensions) : May 15th, 2020
Position paper submission : June 9th, 2020
Author notification : June 30th, 2020
Final paper submission and registration : July 15, 2020
Conference date : September 6-9, 2020
===============================
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 :
wco2020@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/
*
**********************************************************
13th International Workshop on Computational Optimization (WCO20)
Sofia, Bulgaria, September 6-9, 2020
organized in the framework of FEDERATED CONFERENCE ON COMPUTER SCIENCE AND
INFORMATION SYSTEMS
FedCSIS - 2020
IEEE CS is a technical co-sponsor of FedCSIS 2020
https://fedcsis.org/2020/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
*numerical and heuristic methods for modeling
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.
*environment modeling and optimization
===============================
Best paper award
The best WCO20 paper will be awarded during the social dinner of
FedCSIS2020.
The best paper will be selected by WCO19 co-Chairs by taking into
consideration the scores suggested by the reviewers, as well as the quality
of the given oral presentation.
===============================
Submission and Publication
* Authors should submit draft papers in PDF format.
* The total length of a paper should not exceed 10 pages for regular paper
and 4 pages for short papers (IEEE style). IEEE style templates are
available at http://www.fedcsis.org/.
* Papers will be refereed and accepted on the basis of their scientific
merit and relevance to the workshop.
* Accepted and presented papers will be published in the Conference
Proceedings and included in the IEEE Xplore database and submitted for
different indexations (Communication and Position papers will only appear
in the conference proceedings).
* Extended versions of selected papers presented at WCO18 will be published
in edited books of the series "Studies of Computational Intelligence",
Springer.
===============================
Important dates:
Paper submission (sharp / no extensions) : May 15th, 2020
Position paper submission : June 9th, 2020
Author notification : June 30th, 2020
Final paper submission and registration : July 15, 2020
Conference date : September 6-9, 2020
===============================
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 :
wco2020@fedcsis.org
--
Prof. Stefka Fidanova
IICT-BAS
Acad. G. Bonchev str. bl.25A
1113 Sofia Bulgaria
Ph. +359-2-9796642
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
[DMANET] Postdoc position in Theoretical Computer Science at CTU Prague
A one-year full-time postdoc position is available in the G²OAT research
group
at the Czech Technical University in Prague (CTU), Czech Republic with
preferred starting date September 2020 (negotiable, with possible
extension
for at least one more year). The research interests of the group range
from
graph algorithms, through classical and parameterized complexity and
integer
linear programming to combinatorial games. The research group Graphs,
Games,
Optimization, Algorithms and Theoretical Computer Science (G²OAT) is a
part of
the Department of Theoretical Computer Science at the Faculty of
Information
Technology at CTU. The department also includes Stringology and
Arborology
research groups. The G²OAT group is rather small, comprising 3 assistant
professors and 3 Ph.D. students (two more Ph.D. students joining in
September),
however, the current team members regularly publish at renowned
conferences
and journals. A successful candidate will work at CTU's main campus
which
features a range of amenities such as the National Technical Library,
and a
laid-back atmosphere with cafes and other social hangout places.
group
at the Czech Technical University in Prague (CTU), Czech Republic with
preferred starting date September 2020 (negotiable, with possible
extension
for at least one more year). The research interests of the group range
from
graph algorithms, through classical and parameterized complexity and
integer
linear programming to combinatorial games. The research group Graphs,
Games,
Optimization, Algorithms and Theoretical Computer Science (G²OAT) is a
part of
the Department of Theoretical Computer Science at the Faculty of
Information
Technology at CTU. The department also includes Stringology and
Arborology
research groups. The G²OAT group is rather small, comprising 3 assistant
professors and 3 Ph.D. students (two more Ph.D. students joining in
September),
however, the current team members regularly publish at renowned
conferences
and journals. A successful candidate will work at CTU's main campus
which
features a range of amenities such as the National Technical Library,
and a
laid-back atmosphere with cafes and other social hangout places.
The position is supported by the OP VVV MEYS funded project
CZ.02.1.01/0.0/0.0/16_019/0000765 "Research Center for Informatics" (a
recently
awarded EU-funded center of excellence run by internationally renowned
professors with worldwide impact) and offers a generous travel budget.
The G²OAT group is a part of a work-package of RCI focused on
Theoretical
Computer Science. Successful candidates will get a monthly salary in the
range
of 2-3 thousand EUR (the Czech Republic cost of living is at 59% of the
US
price level by OECD statistics). There are no teaching duties associated
with
this position.
We are seeking highly motivated individuals holding a PhD in computer
science,
discrete mathematics, or related areas from a reputed institution. The
ideal
candidate is familiar with several of the following areas: Parameterized
complexity, integer linear programming, structural graph theory, game
theory,
computational social choice. Experience in optimization and in
particular
approximation algorithms or hardness of approximation is appreciated but
not
required. The candidate's high scientific potential should be witnessed
by
publications in the area of algorithms or discrete math in proceedings
of
highly ranked international conferences and/or journals.
The successful candidate must:
* be a researcher who has received a PhD or its equivalent within the
last 7
years,
* have a strong publication record, and
* be fluent in English (both written and spoken), prior knowledge of
Czech
is not required.
Please submit your CV and a motivation letter to
ondrej.suchy@fit.cvut.cz.
Furthermore, a letter of recommendation should be sent by the
recommender also
directly to ondrej.suchy@fit.cvut.cz.
Candidates interested in applying are encouraged to make informal
inquiries.
Applications received by May 17 will receive full consideration.
**********************************************************
*
* 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 1, 2020
[DMANET] THE IBS DISCRETE MATHEMATICS GROUP (DIMAG) POSTDOCTORAL RESEARCH FELLOWSHIP (DUE: APRIL 26, 2020)
The IBS Discrete Mathematics Group (DIMAG) in Daejeon, Korea invites applications for several postdoctoral research fellowship positions.
URL: https://dimag.ibs.re.kr/hiring/
DIMAG is a new research group that was established in December 1, 2018 at the Institute for Basic Science (IBS), led by Prof. Sang-il Oum. DIMAG is located at the headquarters of the Institute for Basic Science (IBS) in Daejeon, South Korea, a city of 1.5 million people.
Successful candidates for postdoctoral research fellowship positions will be new or recent Ph.D.'s with outstanding research potential in all fields of discrete mathematics with emphasis on structural graph theory, extremal graph theory, combinatorial optimization, matroid theory, or fixed-parameter tractable algorithms.
These non-tenure-track appointments are for two or three years, and the starting salary is no less than KRW 57,000,000. The appointment is one time renewable up to 5 years in total contingent upon the outstanding performance of the researcher.
These are purely research positions and research fellows will have no teaching duties.
A complete application packet should include:
• AMS standard cover sheet (preferred) or cover letter (PDF format)
• Curriculum vitae including a publication list (PDF format)
• Research statement (PDF format)
• Consent to Collection and Use of Personal Information (PDF file) https://dimag.ibs.re.kr/wp-content/uploads/2020/03/consent.pdf
• At least 3 recommendation letters
For full consideration, applicants should email items 1, 2, 3, and 4 and arrange their recommendation letters emailed to dimag@ibs.re.kr by April 26, 2020, Sunday. Recommendations letters forwarded by an applicant will not be considered.
DIMAG encourages applications from individuals of diverse backgrounds.
For Korean citizens who have not yet completed their military duty: IBS는 병역특례지정기관입니다. IBS is a designated institute for alternative military service.
--
Sang-il Oum (엄상일) https://dimag.ibs.re.kr/home/sangil/
CI, Discrete Mathematics Group, Institute for Basic Science (IBS).
Professor, Dept. of Mathematical Sciences, KAIST.
**********************************************************
*
* 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] [Changes to deadline] Graphical Models for Security (GraMSec 2020) - CFP
GraMSec 2020: The Seventh International Workshop on Graphical Models for
Security
http://gramsec.uni.lu
Security
http://gramsec.uni.lu
June 22, 2020 *Online event*
Co-located with CSF 2020
*LNCS post-proceedings confirmed*
SCOPE
The use of graphical security models to represent and analyse the
security of systems has gained an increasing research attention over the
last two decades. Formal methods and computer security researchers, as
well as security professionals from the industry and government, have
proposed various graphical security models, metrics, and measurements.
Graphical models are used to capture different security facets and
address a range of challenges including security assessment, automated
defence, secure services composition, security policy validation, and
verification. The International Workshop on Graphical Models for Security
is an established scientific event dedicated to study and exchange
of experiences on graphical security and safety modelling.
TOPICS
This year, we encourage excellent submissions related, but not
restricted, to the following broad headings:
1. Graph representations: mathematical, conceptual, and implemented
tools for describing and reasoning about security and safety
2. Logical approaches: formal logical tools for representing and
reasoning about graphs and their use as modelling tools in security
3. Machine learning: modelling and reasoning about the role of big data
and machine learning in security operations
4. Networks in national security: terrorist networks, counter-terrorism
networks; safety in national infrastructure (e.g., utilities and
transportation)
5. Risk analysis and management: models and graphical methodologies for
security and privacy risk management in business and organisational
architectures
6. Social networks: using and reasoning about social graphs, network
analysis, network protocols, social mapping, sociometry.
7. Semantics: developing or studying semantic approaches to graph-based
models used in security like set theoretic models, categorical models,
logical models, etc.
8. Threat modelling: modelling and analysing software systems security,
models for DevSecOps, etc.
9. Security requirements: models and tools for describing and analysing
requirements on system security and privacy.
10. Visual security: modelling and analytics for security visualisations.
11. Secure systems: safe and secure system design, quantification of
security/safety, models for system security/safety evaluation.
We welcome a broad range of contributions: from theory to tools and
experience reports. Preference will be given to papers likely to
stimulate high-quality debate at the Workshop.
SUBMISSION GUIDELINES
We solicit two types of submissions:
- Regular papers (up to 18 pages, excluding the bibliography and
well-marked appendices) describing original and unpublished work within
the scope of the workshop.
- Short papers (up to 10 pages, excluding the bibliography and
well-marked appendices) describing original and unpublished work in
progress.
The reviewers are not required to read the appendices, so the papers
should be intelligible without them. All submissions must be prepared
using the LNCS style. Each paper will undergo a thorough review process.
Submissions should be made using the GraMSec 2020 EasyChair website:
https://easychair.org/conferences/?conf=gramsec2020.
PUBLICATION
As in previous editions, we the post-proceedings will be published
in the Lecture Notes in Computer Science (LNCS) series,
published by Springer. Proceedings will be published after the
workshop, thus permitting the authors to incorporate feedback.
VENUE
Due to the current coronavirus outbreak, the IEEE CSF Symposium
and its associated workshops, including GraMSec, will be held
online this year. Details about registration and participation will
be soon made available.
IMPORTANT DATES
Given the situation and the fact that the workshop will be held online,
we will keep only one submission deadline.
- Paper submissions due: Friday, April 24, 2020
- Notifications: Friday, May 29, 2020
- Workshop: Monday, June 22, 2020
- Camera ready versions due: Friday, August 7, 2020
PROGRAM CHAIRS
Harley Eades III, Augusta University, United States of America
Olga Gadyatskaya, Leiden Institute of Advanced Computer Science,
Leiden University, The Netherlands
STEERING COMMITTEE
Sushil Jajodia, George Mason University, United States of America
Barbara Fila, INSA Rennes, IRISA, France
Sjouke Mauw, University of Luxembourg, Luxembourg
Christian W. Probst, Unitec, New Zealand
Ketil Stølen, SINTEF Digital and University of Oslo, Norway
PUBLICITY CHAIR
Barbara Fila, INSA Rennes, IRISA, France
WEB CHAIR
Reynaldo Gil Pons, University of Luxembourg, Luxembourg
**********************************************************
*
* 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] Algorithms PhD positions – deadline May 1
Starting August 1, 2020 or later, several PhD positions in the area of big data analysis algorithms are available at Department of Computer Science, Aarhus University, under the supervision of Professor Lars Arge (www.cs.au.dk/~large<http://www.cs.au.dk/~large>) and/or Professor Gerth S. Brodal (www.cs.au.dk/~gerth<http://www.cs.au.dk/~gerth>).
The positions are part of a project funded by a grant from Independent Research Fund Denmark. The overall objective of the project is to develop memory-hierarchy efficient (such as I/O-efficient or cache-oblivious) algorithms and data structures for a number of fundamental geometric data structure problems, a number of fundamental graph data problems, as well as for a number of fundamental massive terrain data and flood risk assessment problems. The project is conducted in collaboration with leading international experts at Duke University (Pankaj Agarwal), UC Irvine (Mike Goodrich), Universite Libra de Bruxelles (John Iacono) and Goethe University Frankfurt (Ulrich Meyer), as well as at Aarhus University spin-out company SCALGO.
The positions are administered through the Graduate School of Science and Technology at Aarhus University (phd.scitech.au.dk) and include full tuition waiver and a very competitive scholarship. Applications are welcomed from students with either a BS or an MS degree, as well as a strong background in algorithms and data structures. Students with experience within I/O-efficient algorithms, cache-oblivious algorithms, or algorithm engineering are preferred. The application deadline for the positions is May 1, 2020. Applicants should apply using the Aarhus Graduate School of Science and Technology application system (reachable from phd.scitech.au.dk)
Applicants seeking further information in regards to scientific questions are invited to contact Professor Lars Arge (large@cs.au.dk<mailto:large@cs.au.dk>) or Professor Gerth S. Brodal (gerth@cs.au.dk<mailto:gerth@cs.au.dk>). For other questions, please contact research group coordinator Julie Rasmussen (jras@cs.au.dk<mailto:jras@cs.au.dk>)
**********************************************************
*
* 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/
*
**********************************************************
The positions are part of a project funded by a grant from Independent Research Fund Denmark. The overall objective of the project is to develop memory-hierarchy efficient (such as I/O-efficient or cache-oblivious) algorithms and data structures for a number of fundamental geometric data structure problems, a number of fundamental graph data problems, as well as for a number of fundamental massive terrain data and flood risk assessment problems. The project is conducted in collaboration with leading international experts at Duke University (Pankaj Agarwal), UC Irvine (Mike Goodrich), Universite Libra de Bruxelles (John Iacono) and Goethe University Frankfurt (Ulrich Meyer), as well as at Aarhus University spin-out company SCALGO.
The positions are administered through the Graduate School of Science and Technology at Aarhus University (phd.scitech.au.dk) and include full tuition waiver and a very competitive scholarship. Applications are welcomed from students with either a BS or an MS degree, as well as a strong background in algorithms and data structures. Students with experience within I/O-efficient algorithms, cache-oblivious algorithms, or algorithm engineering are preferred. The application deadline for the positions is May 1, 2020. Applicants should apply using the Aarhus Graduate School of Science and Technology application system (reachable from phd.scitech.au.dk)
Applicants seeking further information in regards to scientific questions are invited to contact Professor Lars Arge (large@cs.au.dk<mailto:large@cs.au.dk>) or Professor Gerth S. Brodal (gerth@cs.au.dk<mailto:gerth@cs.au.dk>). For other questions, please contact research group coordinator Julie Rasmussen (jras@cs.au.dk<mailto:jras@cs.au.dk>)
**********************************************************
*
* 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] Asst. Professor in Computer Science with Focus on Cybersecurity
As part of our planned expansion in the area of Cybersecurity, the
Department of Mathematics and Computer Science at the University of
Southern Denmark, Odense, invites applications for an assistant professor
position in Computer Science. We interpret the area cybersecurity broadly:
the ideal applicant is a computer scientist with a strong theoretical
background, conducting research on cybersecurity or research that has
cybersecurity as a direct application. We would like to expand on our
current security research efforts within Cryptology, Formal Methods,
Information Security, Security in DevOps, and Data-driven approaches,
so these topics are of particular interest.
Requirements:
The candidate
- is a computer scientist holding a PhD
- has a strong record of research at a high international level,
reflecting the academic age of the applicant
- can teach and advise in computer science at all levels, including a
broad range of core computer science subjects at the undergraduate level.
Experience in combining theory and practice of computer science is a plus.
Fluency in English is required. Knowledge of Danish is not a requirement:
more English than Danish is used when teaching in computer science, and
more than half of the faculty members in computer science have
international backgrounds. Our new colleague will be offered Danish
courses by the university.
Further information, including how to apply can be found at:
https://www.sdu.dk/da/service/ledige_stillinger/1098235
For questions, please contact Associate Professor Jacopo Mauro
mauro@imada.sdu.dk or Professor Joan Boyar joan@imada.sdu.dk.
About the department:
Based in Odense, the Department of Mathematics and Computer Science offers
an inclusive and international working environment with state-of-the-art
facilities as well as a strong tradition for collaboration across
departments and faculties, and with other educational institutions,
municipalities, and industries. The degrees offered by the department
include bachelor, master, and PhD in computer science, and a master in
data science. Our assistant professors, in particular, have very
reasonable teaching loads.
An appointment as an assistant professor lasts for three years, and
contingent on a positive performance evaluation, a permanent position for
an associate professor is normally opened, for which the assistant
professor can apply.
The starting date should preferably be no later than spring 2021.
Application deadline: 30 May 2020.
--
Joan Boyar Email: joan@imada.sdu.dk
Dept. of Math. and Comp. Sci. URL: http://www.imada.sdu.dk/~joan/
University of Southern Denmark
Campusvej 55 phone: +45 6550 2338
DK-5230 Odense M, 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/
*
**********************************************************
Department of Mathematics and Computer Science at the University of
Southern Denmark, Odense, invites applications for an assistant professor
position in Computer Science. We interpret the area cybersecurity broadly:
the ideal applicant is a computer scientist with a strong theoretical
background, conducting research on cybersecurity or research that has
cybersecurity as a direct application. We would like to expand on our
current security research efforts within Cryptology, Formal Methods,
Information Security, Security in DevOps, and Data-driven approaches,
so these topics are of particular interest.
Requirements:
The candidate
- is a computer scientist holding a PhD
- has a strong record of research at a high international level,
reflecting the academic age of the applicant
- can teach and advise in computer science at all levels, including a
broad range of core computer science subjects at the undergraduate level.
Experience in combining theory and practice of computer science is a plus.
Fluency in English is required. Knowledge of Danish is not a requirement:
more English than Danish is used when teaching in computer science, and
more than half of the faculty members in computer science have
international backgrounds. Our new colleague will be offered Danish
courses by the university.
Further information, including how to apply can be found at:
https://www.sdu.dk/da/service/ledige_stillinger/1098235
For questions, please contact Associate Professor Jacopo Mauro
mauro@imada.sdu.dk or Professor Joan Boyar joan@imada.sdu.dk.
About the department:
Based in Odense, the Department of Mathematics and Computer Science offers
an inclusive and international working environment with state-of-the-art
facilities as well as a strong tradition for collaboration across
departments and faculties, and with other educational institutions,
municipalities, and industries. The degrees offered by the department
include bachelor, master, and PhD in computer science, and a master in
data science. Our assistant professors, in particular, have very
reasonable teaching loads.
An appointment as an assistant professor lasts for three years, and
contingent on a positive performance evaluation, a permanent position for
an associate professor is normally opened, for which the assistant
professor can apply.
The starting date should preferably be no later than spring 2021.
Application deadline: 30 May 2020.
--
Joan Boyar Email: joan@imada.sdu.dk
Dept. of Math. and Comp. Sci. URL: http://www.imada.sdu.dk/~joan/
University of Southern Denmark
Campusvej 55 phone: +45 6550 2338
DK-5230 Odense M, 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] Call for papers on Resilient transportation for 2020 INFORMS Annual Meeting
We are seeking contributors for a special stream on *Resilient
transportation* at the 2020 INFORMS Annual Meeting in National Harbor (USA).
The stream focuses on optimisation solutions to make transportation
networks and vehicles more robust or adaptable to any kind of
disturbance and failure, with a focus on public transports.
transportation* at the 2020 INFORMS Annual Meeting in National Harbor (USA).
The stream focuses on optimisation solutions to make transportation
networks and vehicles more robust or adaptable to any kind of
disturbance and failure, with a focus on public transports.
The 2020 INFORMS Annual Meeting will take place on November 8th to 11th
(http://meetings2.informs.org/wordpress/nationalharbor2020/). Interested
speakers should contact Pierre Hosteins (pierre.hosteins@ifsttar.fr)
before *May 1st* with the tentative title of their submission and (if
possible) a short abstract. Please note that an attendee may present
only one paper at the conference.
Please forward this call to any person you think might be interested in
contributing to the stream.
Pierre Hosteins
--
Université Gustave Eiffel
COSYS-ESTAS
20, rue Elisee Reclus - BP 70317
F-59666 Villeneuve d'Ascq
Tel: +33 (0)3 20 43 83 58
Fax: +33 (0)3 20 43 83 59
**********************************************************
*
* 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] Online resources for DCs --- contribution added --- IFORS
Dear Colleagues and Friends,
The aim of the IFORS Developing Countries Online Resources page is to offer the OR worker all publicly-available materials on the topic of OR for Development. It also aims to provide a venue for people who are working in the area to share their completed or in-process work, learn from others, and stimulate comments and discussions on the work. Regarding IFORS Developing Countries OR resources website, its regular updates - and your possible submission of "free" (not copyright protected) material, you might occasionally visit
http://ifors.org/developing_countries/index.php?title=Main_Page.
With this open resources page we aim to make research and application results better accessible to the many friends in the Developing Countries. We would be glad about interest.
"Operational Research" (OR) is the discipline of applying advanced analytical methods to help make better decisions. By using techniques such as problem structuring methods and mathematical modelling to analyze complex situations, Operational Research gives executives the power to make more effective decisions and build more productive systems.
The International Federation of Operational Research Societies (IFORS; http://ifors.org/) is an almost 60-year old organization which is currently composed of 51 national societies. Regional Groups of IFORS are: ALIO (The Latin American Ibero Association on Operations Research), APORS (The Association of Asian-Pacific Operational Research Societies), EURO (The Association of European Operational Research Societies), NORAM (The Association of North American Operations Research Societies). IFORS conferences are taking place every three years. On IFORS 2020, Seoul, South Korea, please refer to http://www.ifors2020.kr/.
Thank you very much for your attention.
With kind regards,
best wishes,
Gerhard-Wilhelm Weber
PS: Feedback is welcome via gerhard.weber@put.poznan.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/
*
**********************************************************
The aim of the IFORS Developing Countries Online Resources page is to offer the OR worker all publicly-available materials on the topic of OR for Development. It also aims to provide a venue for people who are working in the area to share their completed or in-process work, learn from others, and stimulate comments and discussions on the work. Regarding IFORS Developing Countries OR resources website, its regular updates - and your possible submission of "free" (not copyright protected) material, you might occasionally visit
http://ifors.org/developing_countries/index.php?title=Main_Page.
With this open resources page we aim to make research and application results better accessible to the many friends in the Developing Countries. We would be glad about interest.
"Operational Research" (OR) is the discipline of applying advanced analytical methods to help make better decisions. By using techniques such as problem structuring methods and mathematical modelling to analyze complex situations, Operational Research gives executives the power to make more effective decisions and build more productive systems.
The International Federation of Operational Research Societies (IFORS; http://ifors.org/) is an almost 60-year old organization which is currently composed of 51 national societies. Regional Groups of IFORS are: ALIO (The Latin American Ibero Association on Operations Research), APORS (The Association of Asian-Pacific Operational Research Societies), EURO (The Association of European Operational Research Societies), NORAM (The Association of North American Operations Research Societies). IFORS conferences are taking place every three years. On IFORS 2020, Seoul, South Korea, please refer to http://www.ifors2020.kr/.
Thank you very much for your attention.
With kind regards,
best wishes,
Gerhard-Wilhelm Weber
PS: Feedback is welcome via gerhard.weber@put.poznan.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/
*
**********************************************************
Subscribe to:
Posts (Atom)
Posts
