*****************************************************************************
*** Second Call for Papers ***
ALGOSENSORS 2021
17th International Symposium on Algorithms and
Experiments for Wireless Sensor Networks
9-10 September 2021
Lisbon, Portugal
--- part of ALGO 2021 ---
http://algo2021.tecnico.ulisboa.pt/ALGOSENSORS2021/index.html
**********************************************************************
*** The submission server at
*** https://easychair.org/conferences/?conf=algosensors2021
*** is now open.
**********************************************************************
*****************************************************************************
*** ***
*** IMPORTANT: See note on COVID-19 at the end of this message. ***
*** ***
*****************************************************************************
Authors are invited to submit original research papers in the broad area of
algorithms for wireless networks.
===============
IMPORTANT DATES
===============
Paper submission: 30 June 2021 (AoE)
Notification to authors: 2 August 2021
Camera-ready submission: 23 August 2021
Symposium: 9-10 September 2021
=================
ABOUT ALGOSENSORS
=================
ALGOSENSORS is an international symposium dedicated to the algorithmic
aspects of wireless networks. Originally focused on sensor networks, it
now covers algorithmic issues arising in wireless networks of all types
of computational entities, static or mobile, including sensor networks,
sensor-actuator networks, autonomous robots. The focus is on the design
and analysis of algorithms, models of computation, and experimental
analysis.
ALGOSENSORS 2021 will be held on 9-10 September 2021 in Lisbon, Portugal.
It will be part of ALGO 2021, which also hosts ALGOCLOUD, ATMOS, ESA, IPEC
and WAOA.
===============
INVITED SPEAKER
===============
There will be one invited talk at ALGOSENSORS 2021. The invited speaker is:
- Bernhard Haeupler (CMU, USA & ETHZ, Switzerland).
The invited talk will be integrated in the global ALGO program, as a joint keynote.
=====
SCOPE
=====
Original research contributions are solicited related to diverse algorithmic
aspects of sensor networks, wireless networks as well as distributed robotics,
including the theoretical, experimental and application perspectives.
Topics of interest include, but are not limited to:
- Ad Hoc Networks
- Algorithms
- Autonomous Mobile Robots
- Communication Protocols
- Complexity and Computability
- Computational Models
- Cryptography, Security and Trust
- Cyber Physical Systems
- Data Aggregation and Fusion
- Deployment
- Dynamic Networks, Temporal Graphs
- Energy Management
- Experimental Analysis
- Fault Tolerance and Dependability
- Game Theoretic Aspects
- Infrastructure Discovery
- Internet of Things
- Localization
- Medium Access Control
- Mobility and Dynamics
- Obstacle Avoidance
- Pattern Formation
- Performance Evaluation
- Population Protocols
- Power Saving Schemes
- Resource Efficiency
- RFID Algorithms
- Routing and Data Propagation
- Self-stabilization, Self-* Properties
- Sensor Networks
- Swarm Computing
- Systems and Testbeds
- Time Synchronization
- Topology Control
- Tracking
- Virtual Infrastructures
- Wireless Networks
========================
PROGRAM COMMITTEE CHAIRS
========================
Leszek Gasieniec (University of Liverpool, UK)
Ralf Klasing (CNRS and University of Bordeaux, France)
Tomasz Radzik (King's College London, UK)
=================
PROGRAM COMMITTEE
=================
Eleni C. Akrida (Durham University, UK)
Petra Berenbrink (University of Hamburg, Germany)
Christelle Caillouet (University of Cote d'Azur, Nice, France)
Arnaud Casteigts (University of Bordeaux, France)
Dibyayan Chakraborty (Indian Institute of Science, Bengaluru, India)
Marek Chrobak (University of California, Riverside, USA)
Giuseppe Antonio Di Luna (Sapienza University, Rome, Italy)
Romaric Duvignau (Chalmers University of Technology, Gothenburg, Sweden)
Thomas Erlebach (University of Leicester, UK)
Sandor Fekete (TU Braunschweig, Germany)
Florent Foucaud (Clermont Auvergne University, France)
Pierre Fraigniaud (CNRS and University Paris Diderot, France)
Luisa Gargano (University of Salerno, Italy)
Sun-Yuan Hsieh (National Cheng Kung University, Tainan, Taiwan)
Ling-Ju Hung (National Taipei University of Business, Taipei, Taiwan)
Irina Kostitsyna (Eindhoven University of Technology, Netherlands)
Dariusz R. Kowalski (Augusta University, USA)
Kitty Meeks (University of Glasgow, UK)
Nathalie Mitton (Inria Lille-Nord Europe, France)
Tobias Moemke (Augsburg University, Germany)
Oscar Morales-Ponce (California State University, Long Beach, USA)
Rolf Niedermeier (Technical University of Berlin, Germany)
Aris Pagourtzis (National Technical University of Athens, Greece)
Peter Rossmanith (RWTH Aachen University, Germany)
Olga Saukh (Graz University of Technology and CSH Vienna, Austria)
Grzegorz Stachowiak (University of Wroclaw, Poland)
Walter Unger (RWTH Aachen University, Germany)
Yukiko Yamauchi (Kyushu University, Fukuoka, Japan)
==================
STEERING COMMITTEE
==================
Josep Diaz (Universitat Politecnica de Catalunya, Barcelona, Spain)
Magnus M. Halldorsson (Reykjavik University, Iceland)
Bhaskar Krishnamachari (University of Southern California, Los Angeles, USA)
Panganamala R. Kumar (Texas A&M University, USA)
Sotiris Nikoletseas (Chair) (University of Patras and CTI, Greece)
Jose Rolim (University of Geneva, Switzerland)
Paul Spirakis (University of Liverpool, UK and University of Patras, Greece)
Adam Wolisz (Technical University of Berlin, Germany)
===========
PROCEEDINGS
===========
The conference proceedings will be published in the Springer "Lecture Notes
in Computer Science" series (publication expected October 2021).
=============
SPECIAL ISSUE
=============
Selected papers will be invited to a special issue of the journal
"Theoretical Computer Science", devoted to ALGOSENSORS 2021.
======
AWARDS
======
Awards will be given to the best paper and the best student paper. To be
eligible for the best student paper award, at least one of the paper authors
must be a full-time student at the time of submission, and the student(s)
must have made a significant contribution to the paper. The program committee
may decline to make these awards or may split them.
==========
SUBMISSION
==========
Papers are to be submitted electronically using the EasyChair server at
https://easychair.org/conferences/?conf=algosensors2021. The submissions must
contain original results that have not already been published and are not
concurrently submitted to a journal or conference with published proceedings.
By submitting a paper, the authors acknowledge that in case of acceptance at least
one of the authors will register for ALGO/ALGOSENSORS 2021 and present the paper.
Submissions must be in the form of a single pdf file prepared using the LNCS latex
templates and style files (available, together with Springer's authors' guidelines, from
https://www.springer.com/gp/computer-science/lncs/conference-proceedings-guidelines).
Springer's proceedings LaTeX templates are also available on Overleaf
(https://www.overleaf.com/latex/templates/springer-lecture-notes-in-computer-science/kzwwpvhwnvfj#.WsdHOy5uZpg).
Each submission should consist of the main part of the paper, not exceeding 12 pages
(including the title page and excluding the references), plus an optional clearly
marked appendix (to be read at the discretion of the program committee). Any figure
pertaining to the main part of the paper should be included therein (within the 12 page
limit). The first page must include an indication of whether the paper is eligible for
the best student paper award.
+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
IMPORTANT NOTE: We hope that by September it will be possible to travel to Portugal
from many parts of the world, but we also expect that it may be unsafe, difficult or
impossible for some people to attend in person. If your paper is accepted we hope it
will be possible for you to present it on location, but remote participation options
will be available, and the choice of whether to travel would be yours entirely.
+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
**********************************************************
*
* 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, May 7, 2021
[DMANET] mini-symposium on SNLP and dynamical distance geometry : call for participation
Dear colleagues,
this first session of our mini-symposium on "Sensor Network Localization
and Dynamical Distance Geometry" is scheduled in about 10 days. The
mini-symposium will run from May 18th to May 27th, 2021.
If interested, please do not hesitate to visit the mini-symposium webpage
http://www.fields.utoronto.ca/activities/20-21/constraint-sensor
and to register to the event in order to get information on how to
attend via Zoom (participation is free of charge but registration is
necessary).
All the best,
Antonio Mucherino
Henry Wolkowicz
**********************************************************
*
* 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/
*
**********************************************************
this first session of our mini-symposium on "Sensor Network Localization
and Dynamical Distance Geometry" is scheduled in about 10 days. The
mini-symposium will run from May 18th to May 27th, 2021.
If interested, please do not hesitate to visit the mini-symposium webpage
http://www.fields.utoronto.ca/activities/20-21/constraint-sensor
and to register to the event in order to get information on how to
attend via Zoom (participation is free of charge but registration is
necessary).
All the best,
Antonio Mucherino
Henry Wolkowicz
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
[DMANET] Post in computer science in Lyon
The LIP laboratory, located at the ENS de Lyon in France, is offering a 1 year post-doc position in computer science, starting on the 1st September 2021. Candidates should have a PhD and a strong background in one of the subjects studied in the LIP. (Please refer to http://www.ens-lyon.fr/LIP/ for details.) The salary will depend on the successful candidate's prior research experience with a guaranteed minimum of 2300 EUR/month before taxes.
An application consists of a single PDF file containing:
- a CV including a full list of publications; and
- a research project that in particular proposes a mentor in one of the research teams of the LIP.
The application should be sent by email to russell.harmer@ens-lyon.fr and nicolas.trotignon@ens-lyon.fr by the 30th May, 23:59 UT. Reference letters should be sent directly by email to the same addresses with the same deadline.
______________________
Nicolas Trotignon
CNRS, LIP, ENS de Lyon
http://perso.ens-lyon.fr/nicolas.trotignon/index.html
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
An application consists of a single PDF file containing:
- a CV including a full list of publications; and
- a research project that in particular proposes a mentor in one of the research teams of the LIP.
The application should be sent by email to russell.harmer@ens-lyon.fr and nicolas.trotignon@ens-lyon.fr by the 30th May, 23:59 UT. Reference letters should be sent directly by email to the same addresses with the same deadline.
______________________
Nicolas Trotignon
CNRS, LIP, ENS de Lyon
http://perso.ens-lyon.fr/nicolas.trotignon/index.html
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
[DMANET] IEEE BCCA2021- CALL FOR WORKSHOP PROPOSALS
*The Third IEEE International Conference on Blockchain Computing and
Applications (BCCA 2021)*
*Nov. 15 - 17, 2021 - TARTU, ESTONIA*
http://intelligenttech.org/BCCA2021/index.php
*CALL FOR WORKSHOP PROPOSALS*
We invite you to submit proposals for one-day or two-day workshops in any
area related to the field of blockchains. In particular, workshops on
challenging, emerging areas related to the conference topics are especially
sought. The workshops will take place in physical and/or virtual form,
depending on the situation with COVID-19.
The workshop proceedings will be included in the main conference proceeding
main conference proceedings *that will be submitted to IEEEXplore, dblp
and Scopus for inclusion*. However, workshop organizers are encouraged and
free to organize journal special issues as well.
*IMPORTANT DATES*
Workshop Proposal submission deadline: May 31st, 2021
Workshop Proposal acceptance notification: June 7th, 2021
Workshops: November 15th/16th/17th 2021
*SUBMISSIONS*
Workshop proposals should be authored by at least two organizers,
preferably from different institutions, and they should contain the
following three sections and address each corresponding point:
1. Organizers
- Name: organizers' full names
- Contact information: affiliations, job titles, postal addresses,
e-mail addresses, URLs, and phone
- Brief biography: 100-200 words, focusing on the organizers' expertise in the field and experience as workshop organizers
2. Workshop content
- Title: workshop title and acronym
- Abstract: max 150 words describing the workshop (suitable for the
conference's website)
- Topics and motivation:
- What are the topics, themes, and areas of interest of the workshop?
- How is the workshop relevant to BCCA?
- How does the workshop connect BCCA to other research communities?
- Goals and expected results:
- Explicitly state the goals of the workshop and how you intend to
reach them
- What are the expected results of the workshop?
- How will these results be disseminated?
- Format:
- What is the planned workshop format (paper presentations, working
sessions, lightning talks, demonstrations, etc.)?
- With the aim of avoiding workshops cancellation, in case of
insufficient number of submissions, what is the "backup" plan?
- What will be done to stimulate collaborative interaction?
- If the workshop takes place in virtual form, what is the virtual
plan? Please describe in a few sentences how to present research
contributions and how to foster online discussion.
- What are the planned pre- and post-workshop activities?
- Participants:
- What is the expected number of submissions and participants?
Provide a plan for attracting sufficient submissions and promoting
attendance
- If applicable, please provide information from previous or related
workshops. Have there been previous workshops on the same or a closely related topic? When, where and with how many participants?
- Required equipment (if the conference remains physical): Overhead
projector, PC projector, whiteboard, flip charts, microphone, etc.
- Program committee: list of tentative program committee members, names
and affiliations.
3. Preliminary Call for Papers
This will necessarily repeat some of the information from the previous
sections but should be targeted towards prospective participants. It should
address the following items:
- Overview of the motivation, topics, and goals
- Workshop format
- Deadlines of the workshop (see dates in this call for proposals)
- Submission guidelines and review process
- References to previous workshops (websites)
*SUBMISSION INSTRUCTIONS*
A workshop proposal must be at most 4 pages.
Please send your workshop proposals by e-mail to the following addresses:
onder.gurcan@gmail.com
ouns.bouachir@zu.ac.ae
**********************************************************
*
* 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/
*
**********************************************************
Applications (BCCA 2021)*
*Nov. 15 - 17, 2021 - TARTU, ESTONIA*
http://intelligenttech.org/BCCA2021/index.php
*CALL FOR WORKSHOP PROPOSALS*
We invite you to submit proposals for one-day or two-day workshops in any
area related to the field of blockchains. In particular, workshops on
challenging, emerging areas related to the conference topics are especially
sought. The workshops will take place in physical and/or virtual form,
depending on the situation with COVID-19.
The workshop proceedings will be included in the main conference proceeding
main conference proceedings *that will be submitted to IEEEXplore, dblp
and Scopus for inclusion*. However, workshop organizers are encouraged and
free to organize journal special issues as well.
*IMPORTANT DATES*
Workshop Proposal submission deadline: May 31st, 2021
Workshop Proposal acceptance notification: June 7th, 2021
Workshops: November 15th/16th/17th 2021
*SUBMISSIONS*
Workshop proposals should be authored by at least two organizers,
preferably from different institutions, and they should contain the
following three sections and address each corresponding point:
1. Organizers
- Name: organizers' full names
- Contact information: affiliations, job titles, postal addresses,
e-mail addresses, URLs, and phone
- Brief biography: 100-200 words, focusing on the organizers' expertise in the field and experience as workshop organizers
2. Workshop content
- Title: workshop title and acronym
- Abstract: max 150 words describing the workshop (suitable for the
conference's website)
- Topics and motivation:
- What are the topics, themes, and areas of interest of the workshop?
- How is the workshop relevant to BCCA?
- How does the workshop connect BCCA to other research communities?
- Goals and expected results:
- Explicitly state the goals of the workshop and how you intend to
reach them
- What are the expected results of the workshop?
- How will these results be disseminated?
- Format:
- What is the planned workshop format (paper presentations, working
sessions, lightning talks, demonstrations, etc.)?
- With the aim of avoiding workshops cancellation, in case of
insufficient number of submissions, what is the "backup" plan?
- What will be done to stimulate collaborative interaction?
- If the workshop takes place in virtual form, what is the virtual
plan? Please describe in a few sentences how to present research
contributions and how to foster online discussion.
- What are the planned pre- and post-workshop activities?
- Participants:
- What is the expected number of submissions and participants?
Provide a plan for attracting sufficient submissions and promoting
attendance
- If applicable, please provide information from previous or related
workshops. Have there been previous workshops on the same or a closely related topic? When, where and with how many participants?
- Required equipment (if the conference remains physical): Overhead
projector, PC projector, whiteboard, flip charts, microphone, etc.
- Program committee: list of tentative program committee members, names
and affiliations.
3. Preliminary Call for Papers
This will necessarily repeat some of the information from the previous
sections but should be targeted towards prospective participants. It should
address the following items:
- Overview of the motivation, topics, and goals
- Workshop format
- Deadlines of the workshop (see dates in this call for proposals)
- Submission guidelines and review process
- References to previous workshops (websites)
*SUBMISSION INSTRUCTIONS*
A workshop proposal must be at most 4 pages.
Please send your workshop proposals by e-mail to the following addresses:
onder.gurcan@gmail.com
ouns.bouachir@zu.ac.ae
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
[DMANET] New book announcement: matheuristics
New book announcement: matheuristics
link: https://www.springer.com/gp/book/9783030702762
This book is the first comprehensive tutorial on matheuristics.
Matheuristics are based on mathematical extensions of previously known
heuristics, mainly metaheuristics, and on original, area-specific
approaches. This tutorial provides a detailed discussion of both
contributions, presenting the pseudocodes of over 40 algorithms,
abundant literature references, and for each case a step-by-step
description of a sample run on a common Generalized Assignment Problem
example. C++ source codes of all algorithms are available in an
associated SW repository.
Table of contents (10 chapters):
The Generalized Assignment Problem Pages 3-33
Automatic Design for Matheuristics Pages 35-57
Single Solution Metaheuristics Pages 61-94
Population-Based Metaheuristics Pages 95-130
Diving Heuristics Pages 133-141
Very Large-Scale Neighborhood Search Pages 143-158
Decomposition-Based Heuristics Pages 159-177
Corridor Method Pages 179-187
Kernel Search Pages 189-197
Fore-and-Back Pages 199-211
--
________________________________________________________________
Vittorio Maniezzo, prof. || vittorio.maniezzo@unibo.it
Department of Computer Science || tel. +39 331 6382417
University of Bologna || skype: vittorio.maniezzo
via dell'Universita' n. 50, || www.cs.unibo.it/maniezzo
47521 Cesena, Italy ||
**********************************************************
*
* 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/
*
**********************************************************
link: https://www.springer.com/gp/book/9783030702762
This book is the first comprehensive tutorial on matheuristics.
Matheuristics are based on mathematical extensions of previously known
heuristics, mainly metaheuristics, and on original, area-specific
approaches. This tutorial provides a detailed discussion of both
contributions, presenting the pseudocodes of over 40 algorithms,
abundant literature references, and for each case a step-by-step
description of a sample run on a common Generalized Assignment Problem
example. C++ source codes of all algorithms are available in an
associated SW repository.
Table of contents (10 chapters):
The Generalized Assignment Problem Pages 3-33
Automatic Design for Matheuristics Pages 35-57
Single Solution Metaheuristics Pages 61-94
Population-Based Metaheuristics Pages 95-130
Diving Heuristics Pages 133-141
Very Large-Scale Neighborhood Search Pages 143-158
Decomposition-Based Heuristics Pages 159-177
Corridor Method Pages 179-187
Kernel Search Pages 189-197
Fore-and-Back Pages 199-211
--
________________________________________________________________
Vittorio Maniezzo, prof. || vittorio.maniezzo@unibo.it
Department of Computer Science || tel. +39 331 6382417
University of Bologna || skype: vittorio.maniezzo
via dell'Universita' n. 50, || www.cs.unibo.it/maniezzo
47521 Cesena, Italy ||
**********************************************************
*
* 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] [Scheduling seminar] Martin Skutella (TU Berlin) | May 12 | Efficient Algorithms and Provably Good Solutions for NP-hard Scheduling Problems
Dear scheduling researcher,
We are delighted to announce the talk given by Martin Skutella (TU Berlin).
The title is "Efficient Algorithms and Provably Good Solutions for
NP-hard Scheduling Problems".
The seminar will take place on Zoom on Wednesday, May 12 at 13:00 UTC:
https://cesnet.zoom.us/j/97275617228?pwd=R3ZEMlhialpFSlBUcUo2NEVmS214dz09
<https://cesnet.zoom.us/j/97275617228?pwd=R3ZEMlhialpFSlBUcUo2NEVmS214dz09>
Meeting ID: 972 7561 7228
Passcode: 672344
You can follow the seminar online or offline on our Youtube channel as well:
https://www.youtube.com/channel/UCUoCNnaAfw5NAntItILFn4A
The abstract follows.
Machine scheduling problems are among the first optimization problems
for which approximation algorithms have been analyzed. An approximation
algorithm is a polynomial-time algorithm which always finds a feasible
solution whose objective function value is within an a priori known
factor (performance ratio) of the optimum solution value. In this talk
we focus on identical parallel machine scheduling with total weighted
completion time objective. We present, among other things, a refined
analysis of the performance ratio for the weighted shortest processing
time first (WSPT) rule. This is joint work with Sven Jaeger.
The next seminar in our series will be given by Erik Demeulemeester
(FEB-KBI, KU Leuven) "On the State of the Art in Proactive/Reactive
Project Scheduling" and it will be held on May 26 at 13:00 UTC. For more
details please visit https://schedulingseminar.com/
With kind regards
Zdenek, Mike and Guohua
**********************************************************
*
* 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/
*
**********************************************************
We are delighted to announce the talk given by Martin Skutella (TU Berlin).
The title is "Efficient Algorithms and Provably Good Solutions for
NP-hard Scheduling Problems".
The seminar will take place on Zoom on Wednesday, May 12 at 13:00 UTC:
https://cesnet.zoom.us/j/97275617228?pwd=R3ZEMlhialpFSlBUcUo2NEVmS214dz09
<https://cesnet.zoom.us/j/97275617228?pwd=R3ZEMlhialpFSlBUcUo2NEVmS214dz09>
Meeting ID: 972 7561 7228
Passcode: 672344
You can follow the seminar online or offline on our Youtube channel as well:
https://www.youtube.com/channel/UCUoCNnaAfw5NAntItILFn4A
The abstract follows.
Machine scheduling problems are among the first optimization problems
for which approximation algorithms have been analyzed. An approximation
algorithm is a polynomial-time algorithm which always finds a feasible
solution whose objective function value is within an a priori known
factor (performance ratio) of the optimum solution value. In this talk
we focus on identical parallel machine scheduling with total weighted
completion time objective. We present, among other things, a refined
analysis of the performance ratio for the weighted shortest processing
time first (WSPT) rule. This is joint work with Sven Jaeger.
The next seminar in our series will be given by Erik Demeulemeester
(FEB-KBI, KU Leuven) "On the State of the Art in Proactive/Reactive
Project Scheduling" and it will be held on May 26 at 13:00 UTC. For more
details please visit https://schedulingseminar.com/
With kind regards
Zdenek, Mike and Guohua
**********************************************************
*
* 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, May 6, 2021
[DMANET] ADHS 2021 - Registration open!
Dear colleague,
Registration for the 7th IFAC Conference on Analysis and Design of Hybrid Systems, ADHS 2021, is open! See https://sites.uclouvain.be/adhs21/registration.html
The conference will take place on July 7-9 and will be held in a fully virtual format.
Deadline for registration with paper*: June 10, 2021
Deadline for registration without paper: July 6, 2021
*At least one per final paper submission is required, student or regular.
The list of accepted papers, to be presented at the conference, is available here: https://sites.uclouvain.be/adhs21/accepted_papers.html
The detailed program of the conference will follow very soon.
A Best Paper Award and a Best Repeatability Award (new!) will also be awarded during the conference.
Looking forward to seeing you at ADHS 2021!
Best regards,
For the organizing committee,
Guillaume Berger
**********************************************************
*
* 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/
*
**********************************************************
Registration for the 7th IFAC Conference on Analysis and Design of Hybrid Systems, ADHS 2021, is open! See https://sites.uclouvain.be/adhs21/registration.html
The conference will take place on July 7-9 and will be held in a fully virtual format.
Deadline for registration with paper*: June 10, 2021
Deadline for registration without paper: July 6, 2021
*At least one per final paper submission is required, student or regular.
The list of accepted papers, to be presented at the conference, is available here: https://sites.uclouvain.be/adhs21/accepted_papers.html
The detailed program of the conference will follow very soon.
A Best Paper Award and a Best Repeatability Award (new!) will also be awarded during the conference.
Looking forward to seeing you at ADHS 2021!
Best regards,
For the organizing committee,
Guillaume Berger
**********************************************************
*
* 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] NetSys2021 WKSHPS: 1st International Workshop on Cyber Forensics and Advanced Threat Investigations in Emerging Technologies
Call for Papers: 1st International Workshop on Cyber Forensics and
Advanced Threat Investigations in Emerging Technologies (CFATI 2021)
in conjunction with the 5th International Conference on Networked
Systems (Netsys 2021) September 13- 16 2021, Luebeck, Germany
https://cfati3.conceptechint.net
This Workshop is in collaboration with DigForAsp (Digital forensics:
evidence analysis via intelligent systems and practices). COST Action
CA17124 is funded by the European Cooperation in Science and
Technology (COST).
********************
Scope of the workshop:
********************
The main motivation for this Workshop is to bring together researchers
and practitioners working on cyber forensics and threat investigations
for emerging technologies to disseminate current research issues and
advances. Original technical papers describing new, state-of-the-art
research, will be considered. The Workshop welcomes submissions that
evaluate existing research results by reproducing experiments.
The aim of this workshop is to provide insight for the discussion of
the major research challenges and achievements on various topics of
interest. Papers on practical as well as on theoretical topics and
problems in various topics related to cyber forensics and threat
investigations are invited, with special emphasis on novel techniques
and tools to collect data from networked devices and services in
emerging networks (such as the ones that can be found in
cyber-physical systems and Internet of things). Topics include (but
are not limited to):
- Forensics and threat investigations in IoT
- Forensics and threat investigations in peer-to-peer, and social networks
- Forensics and threat investigations in SDN/NFV
- Forensics and threat investigations in Cloud Computing
- Forensics and threat investigations in Smart Technologies Systems
(Smart Cars, Smart Homes, Smart Cities)
- Dark Web Investigations, Forensics, and Monitoring
- Forensics and threat investigations in Virtual private networks
- Security and Privacy in Clouds, Fog Computing, and 5G, and 6G
- Security and Privacy in IoT, SDN/NFV, and Edge Computing
- Security and Privacy in Smart Technologies Systems (Smart Cars,
Smart Homes, Smart Cities)
- Forensics and visualization of Big Data
- Trusted Computing in Smart Technologies Systems (Smart Cars, Smart
Homes, Smart Cities)
- Tools and services for cyber forensics and threat investigations
- OSINT (Open Source Intelligence)
- Cooperative and distributed forensics and threat investigations
- Advanced threat investigations, forensic and anti-forensic techniques
- Attack detection, traceback, and attribution in Emerging Technologies
- Malware Analysis and Attribution
- Digital Evidence Extraction/Analysis using Artificial intelligence,
Machine Learning, and Data Mining
- Data exfiltration techniques from networked devices and services
(e.g. cyber-physical systems, and Internet-of-Things)
- Methods for reconstruction of Digital Evidence in Emerging Technologies
- Forensics and threat investigations in E-health/M-health
- Vulnerability & threat detection and mitigation techniques for
networked services
- Novel large-scale investigations and Machine Learning techniques to
analyze intelligence data sets and logs
We also encourage contributions describing innovative work in the
realm of cybersecurity, cyber defense, and digital crimes.
********************
Submissions & Proceedings:
********************
Paper submissions must present original, research or experiences.
Late-breaking advances and work-in-progress reports from ongoing
research are also encouraged. Only original papers that have not been
published or submitted for publication elsewhere can be submitted.
Also, extended versions of conference or workshop papers that are
already published may be considered as long as the additional
contribution is at least 30% new content from the original. Each
submission must be written in English, accompanied by a 75 to 200 word
abstract and a list of up to 5 keywords. There is a length limitation
of 12 pages for full papers (including title, abstract, figures,
tables) plus 1 page for references.
Submissions must be in ECEASST-NetSys21 template: All accepted papers
will be included in the Workshop Proceedings to be published open
access by the European Association
of Software Science and Technology via the Electronic Communications
of the EASST (ECEASST) journal (
https://journal.ub.tu-berlin.de/index.php/eceasst) indexed in Scopus
and DBLP, and listed in the Directory of Open Access Journals (DOAJ).
In addition, the PC of NetSys'21 will select the best submitted
abstracts and ask their authors to submit extended versions to a
special issue of ACM TOIT ( https://dl.acm.org/journal/toit ). More
details on https://cfati3.conceptechint.net/submissions.html
Selective Outstanding Papers
Selected papers presented at the workshop, after further revision,
will have the opportunity to be published in special issues in indexed
and/or high impact factor journals. Each extended paper should have at
least 60% of new material and will be sent through a review process to
ensure the quality of contributions (more details will be added soon)
All accepted authors will be eligible to submit an extended version in
a fast track of:
International Journal of Cyber Forensics and Advanced Threat
Investigations (Open Access)
********************
Important dates:
********************
Paper Submission: May 30, 2021 (AOE)
Authors Notifications: July 8, 2021
Camera Ready due: July 22, 2021
Netsys 2021: September 13, 2021 - September 16, 2021
********************
Submission:
********************
Authors should submit their contributions electronically in PDF format
https://easychair.org/conferences/?conf=cfati32021
If you have any further questions please contact the workshop organizers via
https://cfati3.conceptechint.net/contact-us.html
This workshop is technically supported by the Association of Cyber
Forensics and Threat Investigators (www.acfti.org) and the Industrial
Cybersecurity Center (www.cci-es.org).
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
Advanced Threat Investigations in Emerging Technologies (CFATI 2021)
in conjunction with the 5th International Conference on Networked
Systems (Netsys 2021) September 13- 16 2021, Luebeck, Germany
https://cfati3.conceptechint.net
This Workshop is in collaboration with DigForAsp (Digital forensics:
evidence analysis via intelligent systems and practices). COST Action
CA17124 is funded by the European Cooperation in Science and
Technology (COST).
********************
Scope of the workshop:
********************
The main motivation for this Workshop is to bring together researchers
and practitioners working on cyber forensics and threat investigations
for emerging technologies to disseminate current research issues and
advances. Original technical papers describing new, state-of-the-art
research, will be considered. The Workshop welcomes submissions that
evaluate existing research results by reproducing experiments.
The aim of this workshop is to provide insight for the discussion of
the major research challenges and achievements on various topics of
interest. Papers on practical as well as on theoretical topics and
problems in various topics related to cyber forensics and threat
investigations are invited, with special emphasis on novel techniques
and tools to collect data from networked devices and services in
emerging networks (such as the ones that can be found in
cyber-physical systems and Internet of things). Topics include (but
are not limited to):
- Forensics and threat investigations in IoT
- Forensics and threat investigations in peer-to-peer, and social networks
- Forensics and threat investigations in SDN/NFV
- Forensics and threat investigations in Cloud Computing
- Forensics and threat investigations in Smart Technologies Systems
(Smart Cars, Smart Homes, Smart Cities)
- Dark Web Investigations, Forensics, and Monitoring
- Forensics and threat investigations in Virtual private networks
- Security and Privacy in Clouds, Fog Computing, and 5G, and 6G
- Security and Privacy in IoT, SDN/NFV, and Edge Computing
- Security and Privacy in Smart Technologies Systems (Smart Cars,
Smart Homes, Smart Cities)
- Forensics and visualization of Big Data
- Trusted Computing in Smart Technologies Systems (Smart Cars, Smart
Homes, Smart Cities)
- Tools and services for cyber forensics and threat investigations
- OSINT (Open Source Intelligence)
- Cooperative and distributed forensics and threat investigations
- Advanced threat investigations, forensic and anti-forensic techniques
- Attack detection, traceback, and attribution in Emerging Technologies
- Malware Analysis and Attribution
- Digital Evidence Extraction/Analysis using Artificial intelligence,
Machine Learning, and Data Mining
- Data exfiltration techniques from networked devices and services
(e.g. cyber-physical systems, and Internet-of-Things)
- Methods for reconstruction of Digital Evidence in Emerging Technologies
- Forensics and threat investigations in E-health/M-health
- Vulnerability & threat detection and mitigation techniques for
networked services
- Novel large-scale investigations and Machine Learning techniques to
analyze intelligence data sets and logs
We also encourage contributions describing innovative work in the
realm of cybersecurity, cyber defense, and digital crimes.
********************
Submissions & Proceedings:
********************
Paper submissions must present original, research or experiences.
Late-breaking advances and work-in-progress reports from ongoing
research are also encouraged. Only original papers that have not been
published or submitted for publication elsewhere can be submitted.
Also, extended versions of conference or workshop papers that are
already published may be considered as long as the additional
contribution is at least 30% new content from the original. Each
submission must be written in English, accompanied by a 75 to 200 word
abstract and a list of up to 5 keywords. There is a length limitation
of 12 pages for full papers (including title, abstract, figures,
tables) plus 1 page for references.
Submissions must be in ECEASST-NetSys21 template: All accepted papers
will be included in the Workshop Proceedings to be published open
access by the European Association
of Software Science and Technology via the Electronic Communications
of the EASST (ECEASST) journal (
https://journal.ub.tu-berlin.de/index.php/eceasst) indexed in Scopus
and DBLP, and listed in the Directory of Open Access Journals (DOAJ).
In addition, the PC of NetSys'21 will select the best submitted
abstracts and ask their authors to submit extended versions to a
special issue of ACM TOIT ( https://dl.acm.org/journal/toit ). More
details on https://cfati3.conceptechint.net/submissions.html
Selective Outstanding Papers
Selected papers presented at the workshop, after further revision,
will have the opportunity to be published in special issues in indexed
and/or high impact factor journals. Each extended paper should have at
least 60% of new material and will be sent through a review process to
ensure the quality of contributions (more details will be added soon)
All accepted authors will be eligible to submit an extended version in
a fast track of:
International Journal of Cyber Forensics and Advanced Threat
Investigations (Open Access)
********************
Important dates:
********************
Paper Submission: May 30, 2021 (AOE)
Authors Notifications: July 8, 2021
Camera Ready due: July 22, 2021
Netsys 2021: September 13, 2021 - September 16, 2021
********************
Submission:
********************
Authors should submit their contributions electronically in PDF format
https://easychair.org/conferences/?conf=cfati32021
If you have any further questions please contact the workshop organizers via
https://cfati3.conceptechint.net/contact-us.html
This workshop is technically supported by the Association of Cyber
Forensics and Threat Investigators (www.acfti.org) and the Industrial
Cybersecurity Center (www.cci-es.org).
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
[DMANET] CFP (deadline extended) Special Track on AI for Tackling Dis/Misinformation during Pandemics @ ACM GoodIT2021
Call For Papers: Special Track on AI for Tackling Dis/Misinformation
during Pandemics In conjunction with the ACM International Conference
on Information Technology for Social Good (GoodIT 2021)
The GoodIT conference is sponsored by ACM SIGCAS, the Association for
Computing Machinery's Special Interest Group on Computers & Society.
The conference focuses on the application of IT technologies to social
good.
The Special Track on AI for Tackling Dis/Misinformation during
Pandemics focuses on new data technologies based on artificial
intelligence, data governance, machine learning, natural language
processing, and social network analysis to aid experts in analyzing
large volumes of social media data in order to detect fake news,
misinformation, and disinformation. A number of open challenges need
more investigation from the research community, such as recent trends
in composing information disorder by combining false and real content,
the mechanisms that drive fake content diffusion during pandemics, how
to differentiate fake content from personal viewpoints, why people
tend to believe fake content and make decisions based on it during
pandemics, and what are the different motivations behind the
dissemination of fake content. Fact-checking and claim verification
are two important strategies that are worth incorporating in the
automated tackling and curtailment of fake content during and after
pandemics.
************ Key Dates ************
Submission deadline: May 23, 2021 (extended)
Notification of acceptance: June 22, 2021
Camera Ready: July 10, 2021
GoodIT 2021: September 09-11, 2021
************ Important Links ************
Special Track Website: https://aitdmp.conceptechint.net
Submission Link: https://goodit2021.hotcrp.com/
************ Submission Guidelines ************
All submissions will be reviewed using a single-blind review process.
The identity of referees will not be revealed to authors, but authors
can keep their names on the submitted papers, on figures,
bibliography, etc.
Papers should not exceed 6 pages (US letter size) double column
including figures, tables, and references in standard ACM format.
Papers must be submitted electronically in printable PDF form.
Templates for the standard ACM format can be found here:
https://www.acm.org/publications/proceedings-template No changes to
margins, spacing, or font sizes are allowed from those specified by
the style files. Papers violating the formatting guidelines will be
returned without review.
ACM has partnered with Overleaf, a free cloud-based, collaborative
authoring tool, to provide an ACM LaTeX authoring template. The ACM
LaTeX template on Overleaf platform is available to all ACM authors
at: www.overleaf.com/gallery/tagged/acm-official
Accepted papers will be included in the ACM Digital Library. Special
issues associated with the conference are being organized.
************ Topics ************
Papers on practical as well as on theoretical topics and problems in
various topics related to rumors, fake news, misinformation, and
disinformation during and after pandemics, are invited, with special
emphasis on novel techniques and tools for automated tackling and
curtailment of fake content during and after pandemics. Topics include
(but are not limited to):
-AI approaches for the detection of online influence and manipulation
-AI approaches to identify misinformation and disinformation campaigns
-AI approaches for spotting misinformation and disinformation spreaders.
-Social media mining for automated detection of misinformation
propagation and disinformation circulation
-AI approaches for automated identification and verification of claims
-AI approaches for intention detection for misinformation and
disinformation contents
-AI approaches for credibility assessment of Social media sources
-AI approaches for fake news curtailment, filtering and prevention.
-AI approaches for analysis/detection of distributed and
multi-platform misinformation and disinformation disseminations
-AI approaches for predicting the Impact of misinformation and
disinformation during pandemics
-New datasets and evaluation methodologies to aid in automated
detection and analysis of misinformation and disinformation content in
social media channels
**********The Conference Sponsored by**********
Association for Computing Machinery's Special Interest Group on
Computers & Society http://www.sigcas.org/
This special track is supported by the Association of Cyber Forensics and
Threat Investigators (www.acfti.org) and the Industrial Cybersecurity
Center (www.cci-es.org).
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
during Pandemics In conjunction with the ACM International Conference
on Information Technology for Social Good (GoodIT 2021)
The GoodIT conference is sponsored by ACM SIGCAS, the Association for
Computing Machinery's Special Interest Group on Computers & Society.
The conference focuses on the application of IT technologies to social
good.
The Special Track on AI for Tackling Dis/Misinformation during
Pandemics focuses on new data technologies based on artificial
intelligence, data governance, machine learning, natural language
processing, and social network analysis to aid experts in analyzing
large volumes of social media data in order to detect fake news,
misinformation, and disinformation. A number of open challenges need
more investigation from the research community, such as recent trends
in composing information disorder by combining false and real content,
the mechanisms that drive fake content diffusion during pandemics, how
to differentiate fake content from personal viewpoints, why people
tend to believe fake content and make decisions based on it during
pandemics, and what are the different motivations behind the
dissemination of fake content. Fact-checking and claim verification
are two important strategies that are worth incorporating in the
automated tackling and curtailment of fake content during and after
pandemics.
************ Key Dates ************
Submission deadline: May 23, 2021 (extended)
Notification of acceptance: June 22, 2021
Camera Ready: July 10, 2021
GoodIT 2021: September 09-11, 2021
************ Important Links ************
Special Track Website: https://aitdmp.conceptechint.net
Submission Link: https://goodit2021.hotcrp.com/
************ Submission Guidelines ************
All submissions will be reviewed using a single-blind review process.
The identity of referees will not be revealed to authors, but authors
can keep their names on the submitted papers, on figures,
bibliography, etc.
Papers should not exceed 6 pages (US letter size) double column
including figures, tables, and references in standard ACM format.
Papers must be submitted electronically in printable PDF form.
Templates for the standard ACM format can be found here:
https://www.acm.org/publications/proceedings-template No changes to
margins, spacing, or font sizes are allowed from those specified by
the style files. Papers violating the formatting guidelines will be
returned without review.
ACM has partnered with Overleaf, a free cloud-based, collaborative
authoring tool, to provide an ACM LaTeX authoring template. The ACM
LaTeX template on Overleaf platform is available to all ACM authors
at: www.overleaf.com/gallery/tagged/acm-official
Accepted papers will be included in the ACM Digital Library. Special
issues associated with the conference are being organized.
************ Topics ************
Papers on practical as well as on theoretical topics and problems in
various topics related to rumors, fake news, misinformation, and
disinformation during and after pandemics, are invited, with special
emphasis on novel techniques and tools for automated tackling and
curtailment of fake content during and after pandemics. Topics include
(but are not limited to):
-AI approaches for the detection of online influence and manipulation
-AI approaches to identify misinformation and disinformation campaigns
-AI approaches for spotting misinformation and disinformation spreaders.
-Social media mining for automated detection of misinformation
propagation and disinformation circulation
-AI approaches for automated identification and verification of claims
-AI approaches for intention detection for misinformation and
disinformation contents
-AI approaches for credibility assessment of Social media sources
-AI approaches for fake news curtailment, filtering and prevention.
-AI approaches for analysis/detection of distributed and
multi-platform misinformation and disinformation disseminations
-AI approaches for predicting the Impact of misinformation and
disinformation during pandemics
-New datasets and evaluation methodologies to aid in automated
detection and analysis of misinformation and disinformation content in
social media channels
**********The Conference Sponsored by**********
Association for Computing Machinery's Special Interest Group on
Computers & Society http://www.sigcas.org/
This special track is supported by the Association of Cyber Forensics and
Threat Investigators (www.acfti.org) and the Industrial Cybersecurity
Center (www.cci-es.org).
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
[DMANET] WAOA 2021 - Call for papers
WAOA 2021 - Call for papers
19th Workshop on Approximation and Online Algorithms
http://algo2021.tecnico.ulisboa.pt/WAOA2021/
September 9 - 10, 2021, Lisbon, Portugal (possibly hybrid)
===================================================
Paper submission deadline: June 27, 2021
===================================================
Invited speaker: Daniel Lokshtanov
===================================================
Scope:
Approximation and online algorithms are fundamental tools to deal with computationally hard problems and problems in which the input is gradually disclosed over time. Both kinds of problems arise from a large number of applications in a variety of fields. The workshop focuses on the design and analysis of approximation and online algorithms. It also covers experimental methods used to design and analyze efficient approximation and online algorithms. It is colocated with ALGO 2021, which also hosts ESA, ALGOCLOUD, ALGOSENSORS, ATMOS, and WABI. ALGO 2021 will take place 6-10 September 2021 in Lisbon, Portugal.
===================================================
Topics:
Papers are solicited in all research areas related to approximation and online algorithms, including, but not limited to:
Graph algorithms
Inapproximability results
Network design
Packing and covering
Paradigms for the design and analysis of approximation and online algorithms
Parameterized complexity
Scheduling problems
Algorithmic game theory
Algorithmic trading
Coloring and partitioning
Competitive analysis
Computational advertising
Computational finance
Cuts and connectivity
Geometric problems
Mechanism design
Resource augmentation
Real-world applications
===============================================
Important dates:
Submission deadline: June 27, 2021
Notification: July 31, 2021
Workshop: September 9 -10, 2021
Camera ready: August 7, 2021
===============================================
Publication:
Proceedings will be published in the Springer series Lecture Notes in Computer Science after the workshop takes place. Selected papers presented at WAOA 2021 will be invited to a special issue of Theory of Computing Systems.
===============================================
Submission guidelines:
Submissions should start with the title of the paper, each author's name, affiliation, and e-mail address, followed by a one- or two-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. Submitted papers are not required to be in LNCS style.
Papers should be submitted electronically via the EasyChair submission system at:
https://easychair.org/conferences/?conf=waoa21
By submitting a paper the authors acknowledge that in case of acceptance at least one of the authors must register at ALGO 2021 and present the paper. The program committee may award a Best Paper Award to one of the accepted papers.
===============================================
Program Committee:
Jaroslaw Byrka, University of Wroclaw
Parinya Chalermsook, Aalto University
Sandor Fekete, TU Braunschweig
Andreas Emil Feldmann, Charles University in Prague
Zachary Friggstad, University of Alberta
Stefan Funke, University of Stuttgart
Naveen Garg, Indian Institute of Technology Delhi
Hung Le, University of Massachusetts Amherst
Jochen Koenemann, University of Waterloo (co-chair)
Asaf Levin, Technion Israel Institute of Technology
Daniel Lokshtanov, University of California, Santa Barbara
Jannik Matuschke, KU Leuven
Matthias Mnich, Hamburg University of Technology
Ben Moseley, Carnegie Mellon University
Alantha Newman, Universite Grenoble Alpes
Britta Peis, RWTH Aachen University (co-chair)
Heiko Roeglin, University of Bonn
Chaitanya Swamy, University of Waterloo
Vera Traub, ETH Zuerich
Marc Uetz, University of Twente
Jose Verschae, Catholic University of Chile
Gerhard Woeginger, RWTH Aachen University
**********************************************************
*
* 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/
*
**********************************************************
19th Workshop on Approximation and Online Algorithms
http://algo2021.tecnico.ulisboa.pt/WAOA2021/
September 9 - 10, 2021, Lisbon, Portugal (possibly hybrid)
===================================================
Paper submission deadline: June 27, 2021
===================================================
Invited speaker: Daniel Lokshtanov
===================================================
Scope:
Approximation and online algorithms are fundamental tools to deal with computationally hard problems and problems in which the input is gradually disclosed over time. Both kinds of problems arise from a large number of applications in a variety of fields. The workshop focuses on the design and analysis of approximation and online algorithms. It also covers experimental methods used to design and analyze efficient approximation and online algorithms. It is colocated with ALGO 2021, which also hosts ESA, ALGOCLOUD, ALGOSENSORS, ATMOS, and WABI. ALGO 2021 will take place 6-10 September 2021 in Lisbon, Portugal.
===================================================
Topics:
Papers are solicited in all research areas related to approximation and online algorithms, including, but not limited to:
Graph algorithms
Inapproximability results
Network design
Packing and covering
Paradigms for the design and analysis of approximation and online algorithms
Parameterized complexity
Scheduling problems
Algorithmic game theory
Algorithmic trading
Coloring and partitioning
Competitive analysis
Computational advertising
Computational finance
Cuts and connectivity
Geometric problems
Mechanism design
Resource augmentation
Real-world applications
===============================================
Important dates:
Submission deadline: June 27, 2021
Notification: July 31, 2021
Workshop: September 9 -10, 2021
Camera ready: August 7, 2021
===============================================
Publication:
Proceedings will be published in the Springer series Lecture Notes in Computer Science after the workshop takes place. Selected papers presented at WAOA 2021 will be invited to a special issue of Theory of Computing Systems.
===============================================
Submission guidelines:
Submissions should start with the title of the paper, each author's name, affiliation, and e-mail address, followed by a one- or two-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. Submitted papers are not required to be in LNCS style.
Papers should be submitted electronically via the EasyChair submission system at:
https://easychair.org/conferences/?conf=waoa21
By submitting a paper the authors acknowledge that in case of acceptance at least one of the authors must register at ALGO 2021 and present the paper. The program committee may award a Best Paper Award to one of the accepted papers.
===============================================
Program Committee:
Jaroslaw Byrka, University of Wroclaw
Parinya Chalermsook, Aalto University
Sandor Fekete, TU Braunschweig
Andreas Emil Feldmann, Charles University in Prague
Zachary Friggstad, University of Alberta
Stefan Funke, University of Stuttgart
Naveen Garg, Indian Institute of Technology Delhi
Hung Le, University of Massachusetts Amherst
Jochen Koenemann, University of Waterloo (co-chair)
Asaf Levin, Technion Israel Institute of Technology
Daniel Lokshtanov, University of California, Santa Barbara
Jannik Matuschke, KU Leuven
Matthias Mnich, Hamburg University of Technology
Ben Moseley, Carnegie Mellon University
Alantha Newman, Universite Grenoble Alpes
Britta Peis, RWTH Aachen University (co-chair)
Heiko Roeglin, University of Bonn
Chaitanya Swamy, University of Waterloo
Vera Traub, ETH Zuerich
Marc Uetz, University of Twente
Jose Verschae, Catholic University of Chile
Gerhard Woeginger, RWTH Aachen University
**********************************************************
*
* 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] Diagrams 2021: 2nd Call for Graduate Symposium
Dear all
The Diagrams 2021 conference hosts a free graduate symposium. Deadlines for submission is June 21, so there's still time!
Please find more information in the call for papers attached below or on the conference webpage www.diagrams-conference.org/2021<http://www.diagrams-conference.org/2021> - and do pass on the information if you know students or recent graduates for whom it may be relevant.
I hope to see you at the conference!
Best,
Mikkel Willum Johansen
Publicity Chair
Diagrams 2021
*** Call for Graduate Symposium: Diagrams 2021 ***
12th International Conference on the Theory and Application of Diagrams
September 28 – 30, 2021
Virtual Event
www.diagrams-conference.org/2021<http://www.diagrams-conference.org/2021>
*** Highlights of Diagrams 2021 ***
- FREE REGISTRATION
- Graduate Symposium proceedings will be available online
- Inspirational ECR Speaker: Francesco Bellucci, University of Bologna
- Three Conference Tracks: Main, Philosophy, and Psychology and Education
- Conference proceedings published by Springer
- Best Paper and Best Student Paper awards
- Graduate Symposium submission deadline June 21, 2021.
- Conference paper submission dates in April 2021.
*****************************************************************
Diagrams is the only conference series that provides a united forum for all areas that are concerned with the study of diagrams and has a multidisciplinary emphasis.
The goal of the Diagrams 2021 Graduate Symposium is twofold. Firstly, the Symposium will provide senior graduate students and recent Masters and Doctoral graduates with the opportunity to present their research. Established researchers will provide feedback and comments on each of the presentations. Secondly, the Symposium will provide students with an opportunity to network with each other as future colleagues.
In previous Diagrams Graduate Symposiums, lively and useful discussions have enabled students to receive suggestions about their on-going research and allowed more experienced participants to hear some fresh ideas and view some of the new trends in the field.
The Graduate Symposium will include an Inspirational Early Career Researcher Invited Talk<http://www.diagrams-conference.org/2021/index.php/keynotes/>. The invitation to deliver this talk is reserved for an active Diagrams researcher, within approximately ten years of their PhD, who has demonstrable potential to be a major leadership force within the community. The Inspirational ECR talk will be open to the entire Diagrams delegation.
*****************************************************************
Submission Requirements
Submissions that focus on any aspect of diagrams research are welcome. Topics of interest are the same as those given in the calls for papers for the three conference tracks:
http://www.diagrams-conference.org/2021/index.php/calls/main-track/
http://www.diagrams-conference.org/2021/index.php/calls/philosophy/ http://www.diagrams-conference.org/2021/index.php/calls/psychology-of-diagrams/.
Students who wish to present their work at the symposium must submit a 3-page report describing
– their thesis topic,
– the approach being taken,
– the work that has been completed,
– the expected contributions of the research
– any necessary acknowledgements (for example, supervision team and source funding).
The student should be the sole author of their submission and the supervisor names should be included in the acknowledgements section.
The report must be submitted in Springer LNCS format.
Authors of accepted submissions will be expected to be in attendance at the virtual conference to present their research and respond to questions presented by delegates. All presenters must accept that it is not within the power of the organisers to prevent delegates from recording talks. However, when registering, delegates will be asked to confirm that they will not record any part of the conference.
More details can be found at
http://www.diagrams-conference.org/2021/index.php/calls/graduate-symposium/.
*****************************************************************
Supervisor Support
Students who submit to the graduate symposium must ask their main or lead supervisor to submit a short supporting statement, by email to Mohanad Alqadah, msqadah '@' uqu.edu.sa.
The supporting statement should confirm that the supervisor supports the student's participation in the symposium and briefly explain why the student will benefit.
It is the student's responsibility to ensure that their supervisor submits the supporting statement.
________________________________
Mikkel Willum Johansen
Associate professor
Department of Science Education
University of Copenhagen
Tlf: (+45) 28 72 84 41
**********************************************************
*
* 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 Diagrams 2021 conference hosts a free graduate symposium. Deadlines for submission is June 21, so there's still time!
Please find more information in the call for papers attached below or on the conference webpage www.diagrams-conference.org/2021<http://www.diagrams-conference.org/2021> - and do pass on the information if you know students or recent graduates for whom it may be relevant.
I hope to see you at the conference!
Best,
Mikkel Willum Johansen
Publicity Chair
Diagrams 2021
*** Call for Graduate Symposium: Diagrams 2021 ***
12th International Conference on the Theory and Application of Diagrams
September 28 – 30, 2021
Virtual Event
www.diagrams-conference.org/2021<http://www.diagrams-conference.org/2021>
*** Highlights of Diagrams 2021 ***
- FREE REGISTRATION
- Graduate Symposium proceedings will be available online
- Inspirational ECR Speaker: Francesco Bellucci, University of Bologna
- Three Conference Tracks: Main, Philosophy, and Psychology and Education
- Conference proceedings published by Springer
- Best Paper and Best Student Paper awards
- Graduate Symposium submission deadline June 21, 2021.
- Conference paper submission dates in April 2021.
*****************************************************************
Diagrams is the only conference series that provides a united forum for all areas that are concerned with the study of diagrams and has a multidisciplinary emphasis.
The goal of the Diagrams 2021 Graduate Symposium is twofold. Firstly, the Symposium will provide senior graduate students and recent Masters and Doctoral graduates with the opportunity to present their research. Established researchers will provide feedback and comments on each of the presentations. Secondly, the Symposium will provide students with an opportunity to network with each other as future colleagues.
In previous Diagrams Graduate Symposiums, lively and useful discussions have enabled students to receive suggestions about their on-going research and allowed more experienced participants to hear some fresh ideas and view some of the new trends in the field.
The Graduate Symposium will include an Inspirational Early Career Researcher Invited Talk<http://www.diagrams-conference.org/2021/index.php/keynotes/>. The invitation to deliver this talk is reserved for an active Diagrams researcher, within approximately ten years of their PhD, who has demonstrable potential to be a major leadership force within the community. The Inspirational ECR talk will be open to the entire Diagrams delegation.
*****************************************************************
Submission Requirements
Submissions that focus on any aspect of diagrams research are welcome. Topics of interest are the same as those given in the calls for papers for the three conference tracks:
http://www.diagrams-conference.org/2021/index.php/calls/main-track/
http://www.diagrams-conference.org/2021/index.php/calls/philosophy/ http://www.diagrams-conference.org/2021/index.php/calls/psychology-of-diagrams/.
Students who wish to present their work at the symposium must submit a 3-page report describing
– their thesis topic,
– the approach being taken,
– the work that has been completed,
– the expected contributions of the research
– any necessary acknowledgements (for example, supervision team and source funding).
The student should be the sole author of their submission and the supervisor names should be included in the acknowledgements section.
The report must be submitted in Springer LNCS format.
Authors of accepted submissions will be expected to be in attendance at the virtual conference to present their research and respond to questions presented by delegates. All presenters must accept that it is not within the power of the organisers to prevent delegates from recording talks. However, when registering, delegates will be asked to confirm that they will not record any part of the conference.
More details can be found at
http://www.diagrams-conference.org/2021/index.php/calls/graduate-symposium/.
*****************************************************************
Supervisor Support
Students who submit to the graduate symposium must ask their main or lead supervisor to submit a short supporting statement, by email to Mohanad Alqadah, msqadah '@' uqu.edu.sa.
The supporting statement should confirm that the supervisor supports the student's participation in the symposium and briefly explain why the student will benefit.
It is the student's responsibility to ensure that their supervisor submits the supporting statement.
________________________________
Mikkel Willum Johansen
Associate professor
Department of Science Education
University of Copenhagen
Tlf: (+45) 28 72 84 41
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
[DMANET] Conference CP 2021 - Call For Tutorial Proposals
*Call For Tutorial Proposals*
-------------------------------------------------------------------
27th International Conference on Principles and Practice of Constraint Programming (CP2021)
October 25- 29, 2021, (the conference will be online due to COVID-19)
https://cp2021.a4cp.org/ <https://cp2021.a4cp.org/>
The CP conference is the premier annual international conference on constraint programming. It is concerned with all aspects of computing with constraints, including but not limited to algorithms, environments, languages, models, systems, theory, and applications such as decision making, resource allocation, configuration, planning, and scheduling.
We invite proposals for tutorials to be held at CP2021 which may be delivered in virtual (pre-recorded, or on-line) form. Tutorials will be scheduled during the conference, which will take place from October 25 to 29, 2021. The length of tutorials will be 90 minutes.
The Tutorial Program is intended to disseminate information to conference attendees on recently emerging topics and trends, provide surveys of complementary techniques to those commonly studied at CP, and inform industrial practitioners on the state-of-the-art within the field. Tutorials will be given by experts in the subject matter.
Tutorial proposals should be emailed to the tutorial chair Anastasia Paparrizou <mailto:paparrizou@cril.fr> by June 1, 2021. Notifications will be provided within 2 weeks. A tutorial proposal, which should not exceed two pages overall, should include:
Title
Presenter/organizer name(s) and affiliations
Abstract (less than 300 words)
Motivation (suitability for the CP audience)
Presenter/organizer biography (or link to webpage) and connection to the tutorial topic.
For further inquiries or to submit your proposal please contact the tutorial chair : Anastasia Paparrizou <mailto:paparrizou@cril.fr>
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
-------------------------------------------------------------------
27th International Conference on Principles and Practice of Constraint Programming (CP2021)
October 25- 29, 2021, (the conference will be online due to COVID-19)
https://cp2021.a4cp.org/ <https://cp2021.a4cp.org/>
The CP conference is the premier annual international conference on constraint programming. It is concerned with all aspects of computing with constraints, including but not limited to algorithms, environments, languages, models, systems, theory, and applications such as decision making, resource allocation, configuration, planning, and scheduling.
We invite proposals for tutorials to be held at CP2021 which may be delivered in virtual (pre-recorded, or on-line) form. Tutorials will be scheduled during the conference, which will take place from October 25 to 29, 2021. The length of tutorials will be 90 minutes.
The Tutorial Program is intended to disseminate information to conference attendees on recently emerging topics and trends, provide surveys of complementary techniques to those commonly studied at CP, and inform industrial practitioners on the state-of-the-art within the field. Tutorials will be given by experts in the subject matter.
Tutorial proposals should be emailed to the tutorial chair Anastasia Paparrizou <mailto:paparrizou@cril.fr> by June 1, 2021. Notifications will be provided within 2 weeks. A tutorial proposal, which should not exceed two pages overall, should include:
Title
Presenter/organizer name(s) and affiliations
Abstract (less than 300 words)
Motivation (suitability for the CP audience)
Presenter/organizer biography (or link to webpage) and connection to the tutorial topic.
For further inquiries or to submit your proposal please contact the tutorial chair : Anastasia Paparrizou <mailto:paparrizou@cril.fr>
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
[DMANET] INFORMS Workshop on Market Design 2021
Dear colleagues,
The INFORMS Section on Auctions and Market Design [1] is organizing its
3rd Workshop on Market Design [2], traditionally held in conjunction
with the ACM Conference on Economics and Computation [3].
The two-day workshop with invited speakers and a sequence of submitted
papers will be held virtually on July 23-24, 2021. The submission
deadline is June 1, 2021. Further information is available here [2].
We look forward to your participation and to getting your submissions!
Martin Bichler, Technical University of Munich
Sasa Pekec, Duke university
Alex Teytelboym, University of Oxford
--
Prof. Dr. Martin Bichler
Associate Dean, Department of Informatics
Technical University of Munich, Germany
Tel.: +49-89-289-17500
http://dss.in.tum.de/staff/bichler.html
INFORMS Section on Auctions and Market Design [4]
DFG Research Training Group AdONE [5]
Handbook on Spectrum Auction Design [6]
Market Design: A Linear Programming Approach [7]
Links:
------
[1] https://connect.informs.org/auctionsandmarketdesign
[2]
https://connect.informs.org/auctionsandmarketdesign/events/recentcommunityeventsdashboard/new-item2519
[3] http://ec21.sigecom.org/
[4] https://connect.informs.org/auctionsandmarketdesign/home
[5] https://www.gs.tum.de/adone/start/
[6]
http://www.cambridge.org/de/academic/subjects/computer-science/it-management-and-ecommerce/handbook-spectrum-auction-design?format=HB#sKOsoozTsRGHumgf.97
[7]
http://www.cambridge.org/de/academic/subjects/computer-science/algorithmics-complexity-computer-algebra-and-computational-g/market-design-linear-programming-approach-auctions-and-matching?format=HB#67UV0pyAI1uie9L5.97
**********************************************************
*
* 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 INFORMS Section on Auctions and Market Design [1] is organizing its
3rd Workshop on Market Design [2], traditionally held in conjunction
with the ACM Conference on Economics and Computation [3].
The two-day workshop with invited speakers and a sequence of submitted
papers will be held virtually on July 23-24, 2021. The submission
deadline is June 1, 2021. Further information is available here [2].
We look forward to your participation and to getting your submissions!
Martin Bichler, Technical University of Munich
Sasa Pekec, Duke university
Alex Teytelboym, University of Oxford
--
Prof. Dr. Martin Bichler
Associate Dean, Department of Informatics
Technical University of Munich, Germany
Tel.: +49-89-289-17500
http://dss.in.tum.de/staff/bichler.html
INFORMS Section on Auctions and Market Design [4]
DFG Research Training Group AdONE [5]
Handbook on Spectrum Auction Design [6]
Market Design: A Linear Programming Approach [7]
Links:
------
[1] https://connect.informs.org/auctionsandmarketdesign
[2]
https://connect.informs.org/auctionsandmarketdesign/events/recentcommunityeventsdashboard/new-item2519
[3] http://ec21.sigecom.org/
[4] https://connect.informs.org/auctionsandmarketdesign/home
[5] https://www.gs.tum.de/adone/start/
[6]
http://www.cambridge.org/de/academic/subjects/computer-science/it-management-and-ecommerce/handbook-spectrum-auction-design?format=HB#sKOsoozTsRGHumgf.97
[7]
http://www.cambridge.org/de/academic/subjects/computer-science/algorithmics-complexity-computer-algebra-and-computational-g/market-design-linear-programming-approach-auctions-and-matching?format=HB#67UV0pyAI1uie9L5.97
**********************************************************
*
* 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, May 5, 2021
[DMANET] PhD Student Position - INRIA Lille Nord Europe (INOCS)- Supporting Energy Communities - Operational Research and Energy Analytics (SEC-OREA). Deadline: May 25, 2021
New optimization models and solution algorithms to represent energy exchanges in local energy communities.
Fully funded PhD position based in the INOCS team INRIA Lille Nord Europe, France. Enquiries to Luce.Brotcorne@inria.fr .
The PhD student will work for the EU funded SEC-OREA (Supporting Energy Communities - Operational Research and Energy Analytics) project. The main tasks will be to define and efficiently solve new bilevel optimization models representing the hierarchical decision making process among stakeholders in a local energy communities integrating renewable energy production facilities.
SEC-OREA is funded under the EU CHIST ERA programme. It enables local energy communities (LECs) to participate in the decarbonisation of the energy sector by developing advanced efficient algorithms and analytics technologies. LECs are an efficient way to manage energy by increasing the use of renewable energy sources (RES) at a local level. We aim to co-create an overarching LEC enabling framework with our stakeholders. Our goal is to create technical tools to empower citizens and place them at the core of the Energy Union.
The consortium brings together expertise from Business, Climatology, Computational Methods, Secure ICT, and Power Systems. We reach across the EU with researchers, innovators and stakeholders in Belgium, France, Ireland, Latvia and Portugal. Strong stakeholders include a national meteorological service, municipalities and energy agencies who support the development of LECs, and a distribution system operator (DSO). PIs include Dr. Paula Carroll (UCD), Dr. Luce Brotcorne (INRIA) and Prof. Bernard Fortz (ULB).
Candidates must hold a master degree in computer sciences, mathematics, or operations research. Knowledge of optimization solvers and a strong background in programming are welcomed. Candidates should send a CV and a motivation letter to Luce Brotcorne( Luce.Brotcorne@inria.fr ) by May 25, 2021.
**********************************************************
*
* 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/
*
**********************************************************
Fully funded PhD position based in the INOCS team INRIA Lille Nord Europe, France. Enquiries to Luce.Brotcorne@inria.fr .
The PhD student will work for the EU funded SEC-OREA (Supporting Energy Communities - Operational Research and Energy Analytics) project. The main tasks will be to define and efficiently solve new bilevel optimization models representing the hierarchical decision making process among stakeholders in a local energy communities integrating renewable energy production facilities.
SEC-OREA is funded under the EU CHIST ERA programme. It enables local energy communities (LECs) to participate in the decarbonisation of the energy sector by developing advanced efficient algorithms and analytics technologies. LECs are an efficient way to manage energy by increasing the use of renewable energy sources (RES) at a local level. We aim to co-create an overarching LEC enabling framework with our stakeholders. Our goal is to create technical tools to empower citizens and place them at the core of the Energy Union.
The consortium brings together expertise from Business, Climatology, Computational Methods, Secure ICT, and Power Systems. We reach across the EU with researchers, innovators and stakeholders in Belgium, France, Ireland, Latvia and Portugal. Strong stakeholders include a national meteorological service, municipalities and energy agencies who support the development of LECs, and a distribution system operator (DSO). PIs include Dr. Paula Carroll (UCD), Dr. Luce Brotcorne (INRIA) and Prof. Bernard Fortz (ULB).
Candidates must hold a master degree in computer sciences, mathematics, or operations research. Knowledge of optimization solvers and a strong background in programming are welcomed. Candidates should send a CV and a motivation letter to Luce Brotcorne( Luce.Brotcorne@inria.fr ) by May 25, 2021.
**********************************************************
*
* 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 Algorithms (University of Bristol, UK)
Postdoctoral Research Associate Position in Algorithms (2 years)
University of Bristol, UK
Application deadline: 26 May 2021
A postdoctoral research position is available in the Algorithms group at the University of Bristol. The successful candidate will be hosted by Dr Christian Konrad (http://people.cs.bris.ac.uk/~konrad/) and collaborate with him and his team and a number of leading international partners on streaming algorithms for processing massive graphs.
The position is for 2 years. The start date is flexible, however, a start date close to September 2021 is preferred.
The applicant is expected to have a strong interest and background in the mathematical analysis of algorithms. Being familiar with streaming algorithms, communication complexity, or graph algorithms is a plus but is not necessarily required.
For further information and for applying for this position please visit the official job advert on the University of Bristol webpages:
https://www.bristol.ac.uk/jobs/find/details/?jobId=225894
Please do not hesitate to get in touch with Christian Konrad (christian.konrad@bristol.ac.uk) if you would like to informally discuss this position or if you have any other questions.
**********************************************************
*
* 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 Bristol, UK
Application deadline: 26 May 2021
A postdoctoral research position is available in the Algorithms group at the University of Bristol. The successful candidate will be hosted by Dr Christian Konrad (http://people.cs.bris.ac.uk/~konrad/) and collaborate with him and his team and a number of leading international partners on streaming algorithms for processing massive graphs.
The position is for 2 years. The start date is flexible, however, a start date close to September 2021 is preferred.
The applicant is expected to have a strong interest and background in the mathematical analysis of algorithms. Being familiar with streaming algorithms, communication complexity, or graph algorithms is a plus but is not necessarily required.
For further information and for applying for this position please visit the official job advert on the University of Bristol webpages:
https://www.bristol.ac.uk/jobs/find/details/?jobId=225894
Please do not hesitate to get in touch with Christian Konrad (christian.konrad@bristol.ac.uk) if you would like to informally discuss this position or if you have any other questions.
**********************************************************
*
* 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] SYM-OP-IS 2021---Second Call for Papers
Dear Colleagues,
This is the second call for papers of the XLVIII International Symposium on Operational Research (http://symopis2021.matf.bg.ac.rs/), which takes place in Banja Koviljaca, Serbia, from 20 to 23 September 2021.
SYM-OP-IS is an International Symposium that has been organized since 1974. It presents an annual gathering of OR researchers, both theoreticians and practitioners, in order to exchange scientific and technical information, convey experiences and present new results achieved in the development and application of OR methods. This year, the conference is organized by the Faculty of Mathematics - University of Belgrade (www.matf.bg.ac.rs) and Mathematical Institute of the Serbian Academy of Sciences and Arts (www.mi.sanu.ac.rs), in cooperation with several other research, educational, and state institutions.
The Symposium Programme comprises of plenary lectures and numerous sections that accommodate the exchange of ideas among academia and industry, both from Serbia and abroad. The main aim of the Symposium is the development and applications of new Operational Research methods, models and techniques. Various sections ensure a valuable mixture of theoretical and practical aspects of Operational Research. A special section on the VNS method and its applications is dedicated to Prof. Nenad Mladenovic celebrating his 70th birthday and 45 years of research work.
==================- INVITED SPEAKERS -==================
The following invited speakers have confirmed their participation at SYM-OP-IS 2021:+ Natasha Shakhlevich Chakhlevitch, Unversity of Leeds, UK.+ Nikolaos Matsatsinis, Technical University of Crete, Greece+ Nenad Mladenovic, Khalifa University, Abu Dhabi, UAE.
==================- IMPORTANT DATES -==================
Registration is opened at http://symopis2021.matf.bg.ac.rs/index.php?page=registration.+ Paper submission deadline is May 31, 2021.+ Acceptance notification to authors is June 15, 2021. + The deadline for registration is August 20, 2021.
=========- VENUE -=========
XLVIII International Symposium on Operational Research will take place at the ROYAL SPA Hotel, which is located in Banja Koviljaca, a beautiful spa in the western part of Serbia (http://symopis2021.matf.bg.ac.rs/index.php?lang=en&page=location). Please, contact hotel directly to book your accommodation, with the note that you are participant of the SYM-OP-IS 2021 conference. The hotel offers special prices for the accommodation to participants of the SYM-OP-IS 2021.
Important note: Having in mind the global Covid 19 situation, there is a possibility for participants from abroad to join the conference and give presentation online. For more details on this form of participation, please, contact us at symopis2021@matf.bg.ac.rs.
=============- PUBLICATION -=============
To submit a short paper or an abstract please consult the instructions on http://symopis2021.matf.bg.ac.rs/index.php?page=submiting
The Symposium Proceedings with the final versions of the accepted papers will be published before the symposium. Selected papers will have the opportunity to be published in Special Issues of the following journals: +Yugoslav Journal of Operations Research-YUJOR (http://yujor.fon.bg.ac.rs/index.php/yujor), +International Journal for Traffic and Transport Engineering - IJTTE (http://ijtte.com/), and+Military Technical Courier (http://www.vtg.mod.gov.rs/).
Looking forward to meeting you at SYM-OP-IS 2021,
Programme Committee Co-ChairsProf. Dragan Urosevic, Mathematical Institute SANU,Prof. Milan Drazic, Faculty of Mathematics, University of BelgradeOrganizing Committee ChairProf. Zorica Stanimirovic, Faculty of Mathematics, University of BelgradeSYM-OP-IS 2021 Organizing CommitteeE-mail: symopis2021@matf.bg.ac.rs
**********************************************************
*
* 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] CCCG 2021 Final Call for Papers: Deadline Extended
Due to new COVID lockdowns and requests from authors, the CCCG 2021 submission deadline is extended to May 10.
Final Call for Papers: Deadline Extended
CCCG 2021
Canadian Conference on Computational Geometry
August 10-12, 2021
Dalhousie University, Halifax, Nova Scotia, Canada
The Canadian Conference on Computational Geometry (CCCG) is a forum to disseminate and discuss new theoretical and applied results in discrete and computational geometry. CCCG focuses on the design of efficient algorithms, the development of software, and the study of the mathematical foundations of computational problems whose formulations involve geometric constraints.
The field of computational geometry is motivated by problems from a broad range of application areas, as diverse as computer graphics and animation, computer vision, computer-aided design and manufacturing, geographic information systems, pattern recognition, wireless communications, robotics, protein folding, urban planning, graph drawing, or statistical analysis.
Authors are invited to submit papers describing original research of theoretical or practical significance in computational, combinatorial and discrete geometry, as well as related areas. Submissions will be refereed by the Program Committee. Submissions should not exceed ten pages, excluding references and appendices. Documents must be prepared using LaTeX; the appropriate template is available from the link below. Authors who feel that additional details are necessary should include a clearly marked appendix, which will be read at the discretion of the Program Committee.
Only electronic submissions via EasyChair (link below) will be accepted. Simultaneous submission to another conference or journal is not allowed. Accepted papers are expected to be presented at the conference. Failure to do so will result in removal of the paper from the proceedings.
Proceedings will be published online. There will be no paper proceedings. Authors of selected papers will be invited to submit extended versions to a special issue of the journal Computational Geometry: Theory and Applications.
Any submission that is authored only by students is eligible for the best young researcher award (paper & presentation).
CCCG 2021 LATEX Template
https://projects.cs.dal.ca/cccg2021/wordpress/wp-content/uploads/2021/02/CCCG2021-tex-template.zip
Submission Link
https://easychair.org/conferences/?conf=cccg2021
For further information, see the CCCG 2021 website https://projects.cs.dal.ca/cccg2021/
CCCG supports SafeToC. The ToC advocate for CCCG is Timothy Wylie. See the CCCG web page for further details.
CCCG 2021 is planned for August 10-12, 2021. The conference will either be fully online, or, if the COVID-19 situation allows, also include an in-person component, which will be held at Dalhousie University, Halifax, Nova Scotia, Canada. In any case, authors of accepted papers who cannot attend in person will be able to present their work online.
WADS 2021, the 17th Algorithms and Data Structures Symposium, is planned for August 9-11 at the same location.
IMPORTANT DATES
Submissions Due May 10, 2021, 23:59 anywhere on earth (UTC -12)
Paper notification June 14, 2021
Final Versions Due June 28, 2021 (23:59 Anywhere on Earth)
Conference August 10-12, 2021
INVITED SPEAKERS
Pankaj K. Agarwal, Duke University
Sabetta Matsumoto, Georgia Institute of Technology
PROGRAM COMMITTEE
Oswin Aichholzer, Graz University of Technology
Hugo Akitaya, Tufts University
Binay Bhattacharya, Simon Fraser University
Prosenjit Bose, Carleton University
David Bremner, University of New Brunswick
Hsien-Chih Chang, Dartmouth College
Jean-Lou De Carufel, University of Ottawa
David Eppstein, University of California, Irvine
Ruy Fabila-Monroy, Cinvestav
Brittany Terese Fasy, Montana State University
Marina Gavrilova, University of Calgary
Meng He (co-chair), Dalhousie University
Akitoshi Kawamura, Kyoto University
Jason Morrison, University of Manitoba
Sharath Raghvendra, Virginia Tech
Suneeta Ramaswami, Rutgers University
Maria Saumell, The Czech Academy of Sciences
Don Sheehy (co-chair), North Carolina State University
Michiel Smid, Carleton University
Bettina Speckmann, Eindhoven University of Technology
Katharine Turner, Australian National University
Yusu Wang, UC San Diego
**********************************************************
*
* 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: Deadline Extended
CCCG 2021
Canadian Conference on Computational Geometry
August 10-12, 2021
Dalhousie University, Halifax, Nova Scotia, Canada
The Canadian Conference on Computational Geometry (CCCG) is a forum to disseminate and discuss new theoretical and applied results in discrete and computational geometry. CCCG focuses on the design of efficient algorithms, the development of software, and the study of the mathematical foundations of computational problems whose formulations involve geometric constraints.
The field of computational geometry is motivated by problems from a broad range of application areas, as diverse as computer graphics and animation, computer vision, computer-aided design and manufacturing, geographic information systems, pattern recognition, wireless communications, robotics, protein folding, urban planning, graph drawing, or statistical analysis.
Authors are invited to submit papers describing original research of theoretical or practical significance in computational, combinatorial and discrete geometry, as well as related areas. Submissions will be refereed by the Program Committee. Submissions should not exceed ten pages, excluding references and appendices. Documents must be prepared using LaTeX; the appropriate template is available from the link below. Authors who feel that additional details are necessary should include a clearly marked appendix, which will be read at the discretion of the Program Committee.
Only electronic submissions via EasyChair (link below) will be accepted. Simultaneous submission to another conference or journal is not allowed. Accepted papers are expected to be presented at the conference. Failure to do so will result in removal of the paper from the proceedings.
Proceedings will be published online. There will be no paper proceedings. Authors of selected papers will be invited to submit extended versions to a special issue of the journal Computational Geometry: Theory and Applications.
Any submission that is authored only by students is eligible for the best young researcher award (paper & presentation).
CCCG 2021 LATEX Template
https://projects.cs.dal.ca/cccg2021/wordpress/wp-content/uploads/2021/02/CCCG2021-tex-template.zip
Submission Link
https://easychair.org/conferences/?conf=cccg2021
For further information, see the CCCG 2021 website https://projects.cs.dal.ca/cccg2021/
CCCG supports SafeToC. The ToC advocate for CCCG is Timothy Wylie. See the CCCG web page for further details.
CCCG 2021 is planned for August 10-12, 2021. The conference will either be fully online, or, if the COVID-19 situation allows, also include an in-person component, which will be held at Dalhousie University, Halifax, Nova Scotia, Canada. In any case, authors of accepted papers who cannot attend in person will be able to present their work online.
WADS 2021, the 17th Algorithms and Data Structures Symposium, is planned for August 9-11 at the same location.
IMPORTANT DATES
Submissions Due May 10, 2021, 23:59 anywhere on earth (UTC -12)
Paper notification June 14, 2021
Final Versions Due June 28, 2021 (23:59 Anywhere on Earth)
Conference August 10-12, 2021
INVITED SPEAKERS
Pankaj K. Agarwal, Duke University
Sabetta Matsumoto, Georgia Institute of Technology
PROGRAM COMMITTEE
Oswin Aichholzer, Graz University of Technology
Hugo Akitaya, Tufts University
Binay Bhattacharya, Simon Fraser University
Prosenjit Bose, Carleton University
David Bremner, University of New Brunswick
Hsien-Chih Chang, Dartmouth College
Jean-Lou De Carufel, University of Ottawa
David Eppstein, University of California, Irvine
Ruy Fabila-Monroy, Cinvestav
Brittany Terese Fasy, Montana State University
Marina Gavrilova, University of Calgary
Meng He (co-chair), Dalhousie University
Akitoshi Kawamura, Kyoto University
Jason Morrison, University of Manitoba
Sharath Raghvendra, Virginia Tech
Suneeta Ramaswami, Rutgers University
Maria Saumell, The Czech Academy of Sciences
Don Sheehy (co-chair), North Carolina State University
Michiel Smid, Carleton University
Bettina Speckmann, Eindhoven University of Technology
Katharine Turner, Australian National University
Yusu Wang, UC San Diego
**********************************************************
*
* 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
16th International Workshop on Computational Optimization (WCO21)
Sofia, Bulgaria, September 2-5, 2021 (online)
organized in the framework of CONFERENCE ON COMPUTER SCIENCE AND
INFORMATION SYSTEMS
FedCSIS - 2021
IEEE CS is a technical co-sponsor of FedCSIS 2021
https://fedcsis.org/2021/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 WCO21 paper will be awarded during the social dinner of
FedCSIS2020.
The best paper will be selected by WCO21 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 WCO21 will be published
in edited book of the series "Studies of Computational Intelligence",
Springer with SJR 183.
===============================
Important dates:
+ Paper submission (strict deadline): May 24, 2021, 23:59:59 pm HST (there
will be no extension)
+ Position paper submission: June 14, 2021
+ Author notification: July 5, 2021
+ Final paper submission and registration: August 2, 2021
+ Conference date: September 2-5, 2021
===============================================================================
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 :
wco2021@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/
*
**********************************************************
16th International Workshop on Computational Optimization (WCO21)
Sofia, Bulgaria, September 2-5, 2021 (online)
organized in the framework of CONFERENCE ON COMPUTER SCIENCE AND
INFORMATION SYSTEMS
FedCSIS - 2021
IEEE CS is a technical co-sponsor of FedCSIS 2021
https://fedcsis.org/2021/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 WCO21 paper will be awarded during the social dinner of
FedCSIS2020.
The best paper will be selected by WCO21 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 WCO21 will be published
in edited book of the series "Studies of Computational Intelligence",
Springer with SJR 183.
===============================
Important dates:
+ Paper submission (strict deadline): May 24, 2021, 23:59:59 pm HST (there
will be no extension)
+ Position paper submission: June 14, 2021
+ Author notification: July 5, 2021
+ Final paper submission and registration: August 2, 2021
+ Conference date: September 2-5, 2021
===============================================================================
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 :
wco2021@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] FCT 2021 - Final Call for Papers
-----------------------
FCT 2021 - Call for Papers
-----------------------
23rd International Symposium on Fundamentals of Computation Theory
September 12-15, 2021, Athens, Greece
https://www.corelab.ntua.gr/fct2021
Submission deadline: May 9, 2021 (abstracts) / May 16, 2021 (full papers)
-----------------------
About FCT
-----------------------
The Symposium on Fundamentals of Computation Theory (FCT) was established
in 1977 as a forum for researchers interested in all aspects of theoretical
computer science, and in particular algorithms, complexity, formal and
logical methods. FCT is a biennial series of conferences, previously held
in Poland, Germany, Hungary, Sweden, Russia, Romania, Latvia, Norway,
United Kingdom, France, and Denmark. The last five Symposia were held in
Oslo (2011), Liverpool (2013), Gdansk (2015), Bordeaux (2017), and
Copenhagen (2019).
FCT 2021 will be hosted by the National Technical University of Athens
partially or completely online, depending on the status of the COVID-19
pandemic.
-----------------------
Important Dates
-----------------------
Abstract registration: May 9, 2021 (AoE)
Full paper submission: May 16, 2021 (AoE)
Notification to authors: June 28, 2021
Camera-ready submission: July 6, 2021
Symposium: September 12-15, 2021
-----------------------
Scope
-----------------------
The program committee is soliciting original and significant research
contributions to the fundamentals of computation theory, including (but not
limited to):
Algorithms
algorithm design and optimization
data structures
combinatorics and analysis of algorithms
randomized algorithms
approximation algorithms
parameterized and exact algorithms
computational algebra and number theory
computational geometry
parallel algorithms
distributed algorithms and protocols
online algorithms
streaming algorithms
algorithmic game theory
computational foundations of machine learning
computational biology
Complexity
models of computation
computational complexity
decidability
Boolean/algebraic circuits and functions
randomized computation
derandomization
interactive proofs
computational foundations of cryptography
quantum computation
complexity theory
lower bounds
counting complexity
Formal methods
algebraic and categorical methods
automata and formal languages
database theory
foundations of concurrency and distributed systems
logic and model checking
models of reactive, hybrid, and stochastic systems
principles of programming languages
program analysis and transformation
security
specification, refinement, and verification
type systems
ad hoc, dynamic, and evolving systems
foundations of cloud computing and ubiquitous systems
-----------------------
Invited Speakers
-----------------------
Constantinos Daskalakis, Massachusetts Institute of Technology
Daniel Marx, Max Planck Institute for Informatics
Claire Mathieu, CNRS and University of Paris
Nobuko Yoshida, Imperial College London
-----------------------
Proceedings
-----------------------
Conference proceedings will be published in the ARCoSS subline of the
Springer "Lecture Notes in Computer Science" series.
-----------------------
Special Issue
-----------------------
Selected papers will be invited to a special issue of the "Journal of
Computer and System Sciences", devoted to FCT 2021.
-----------------------
Awards
-----------------------
Awards will be given to the best paper and the best student paper. To be
eligible for the best student paper award, at least one of the paper
authors must be a full-time student at the time of submission, and the
student(s) must have made a significant contribution to the paper.
-----------------------
Program Committee
-----------------------
Evripidis Bampis (co-chair), Sorbonne University
Petra Berenbrink, University of Hamburg
Arnaud Casteigts, University of Bordeaux
Marek Chrobak, UC Riverside
Hans van Ditmarsch, CNRS and University of Lorraine
Thomas Erlebach, University of Leicester
Bruno Escoffier, Sorbonne University
Henning Fernau, University of Trier
Dimitris Fotakis, National Technical University of Athens
Pierre Fraigniaud, CNRS and University of Paris
Leszek Gasieniec, University of Liverpool and Augusta University
Laurent Gourves, CNRS and University of Paris-Dauphine
Giuseppe F. Italiano, LUISS Guido Carli University
Ralf Klasing, CNRS and University of Bordeaux
Alexander Kononov, Sobolev Institute of Mathematics and Novosibirsk
State University
Antonin Kucera, Masaryk University
Dietrich Kuske, TU Ilmenau
Nikos Leonardos, National and Kapodistrian University of Athens
Minming Li, City University of Hong Kong
Zsuzsanna Liptak, University of Verona
Giorgio Lucarelli, University of Lorraine
Vangelis Markakis, Athens University of Economics and Business
Nicole Megow, University of Bremen
Andrzej Murawski, University of Oxford
Aris Pagourtzis (co-chair), National Technical University of Athens
Charis Papadopoulos, University of Ioannina
Igor Potapov, University of Liverpool
Tomasz Radzik, King's College London
Maria Serna, Technical University of Catalonia
Hadas Shachnai, Technion
Vorapong Suppakitpaisarn, University of Tokyo
Nikos Tzevelekos, Queen Mary University of London
Guochuan Zhang, Zhejiang University
-----------------------
Steering Committee
-----------------------
Bogdan Chlebus, University of Colorado
Marek Karpinski, University of Bonn (chair)
Andrzej Lingas, Lund University
Miklos Santha, CNRS and University Paris Diderot
Eli Upfal, Brown University
-----------------------
Organizing Committee
-----------------------
Dimitris Fotakis (co-chair), National Technical University of Athens
Nikos Leonardos, National and Kapodistrian University of Athens
Thanasis Lianeas, National Technical University of Athens
Aris Pagourtzis (co-chair), National Technical University of Athens
-----------------------
Submission
-----------------------
Authors are invited to submit high-quality manuscripts reporting original
unpublished research in the topics related to the symposium. Simultaneous
submission to other conferences or workshops with published proceedings is
not allowed. It is required that each accepted paper be presented at the
conference by one of its authors.
Submissions must not exceed 12 pages (excluding references), formatted
according to LNCS LaTeX template and style files, plus an optional, clearly
marked appendix of reasonable length (to be read at the program committee's
discretion). The first page must include an indication of whether the paper
is eligible for the best student paper award.
Papers are to be submitted electronically through EasyChair using the
following link: https://easychair.org/conferences/?conf=fct2021
-----------------------
Contact
-----------------------
For further information, please send an e-mail to fct2021_at_corelab_ntua_gr
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
FCT 2021 - Call for Papers
-----------------------
23rd International Symposium on Fundamentals of Computation Theory
September 12-15, 2021, Athens, Greece
https://www.corelab.ntua.gr/fct2021
Submission deadline: May 9, 2021 (abstracts) / May 16, 2021 (full papers)
-----------------------
About FCT
-----------------------
The Symposium on Fundamentals of Computation Theory (FCT) was established
in 1977 as a forum for researchers interested in all aspects of theoretical
computer science, and in particular algorithms, complexity, formal and
logical methods. FCT is a biennial series of conferences, previously held
in Poland, Germany, Hungary, Sweden, Russia, Romania, Latvia, Norway,
United Kingdom, France, and Denmark. The last five Symposia were held in
Oslo (2011), Liverpool (2013), Gdansk (2015), Bordeaux (2017), and
Copenhagen (2019).
FCT 2021 will be hosted by the National Technical University of Athens
partially or completely online, depending on the status of the COVID-19
pandemic.
-----------------------
Important Dates
-----------------------
Abstract registration: May 9, 2021 (AoE)
Full paper submission: May 16, 2021 (AoE)
Notification to authors: June 28, 2021
Camera-ready submission: July 6, 2021
Symposium: September 12-15, 2021
-----------------------
Scope
-----------------------
The program committee is soliciting original and significant research
contributions to the fundamentals of computation theory, including (but not
limited to):
Algorithms
algorithm design and optimization
data structures
combinatorics and analysis of algorithms
randomized algorithms
approximation algorithms
parameterized and exact algorithms
computational algebra and number theory
computational geometry
parallel algorithms
distributed algorithms and protocols
online algorithms
streaming algorithms
algorithmic game theory
computational foundations of machine learning
computational biology
Complexity
models of computation
computational complexity
decidability
Boolean/algebraic circuits and functions
randomized computation
derandomization
interactive proofs
computational foundations of cryptography
quantum computation
complexity theory
lower bounds
counting complexity
Formal methods
algebraic and categorical methods
automata and formal languages
database theory
foundations of concurrency and distributed systems
logic and model checking
models of reactive, hybrid, and stochastic systems
principles of programming languages
program analysis and transformation
security
specification, refinement, and verification
type systems
ad hoc, dynamic, and evolving systems
foundations of cloud computing and ubiquitous systems
-----------------------
Invited Speakers
-----------------------
Constantinos Daskalakis, Massachusetts Institute of Technology
Daniel Marx, Max Planck Institute for Informatics
Claire Mathieu, CNRS and University of Paris
Nobuko Yoshida, Imperial College London
-----------------------
Proceedings
-----------------------
Conference proceedings will be published in the ARCoSS subline of the
Springer "Lecture Notes in Computer Science" series.
-----------------------
Special Issue
-----------------------
Selected papers will be invited to a special issue of the "Journal of
Computer and System Sciences", devoted to FCT 2021.
-----------------------
Awards
-----------------------
Awards will be given to the best paper and the best student paper. To be
eligible for the best student paper award, at least one of the paper
authors must be a full-time student at the time of submission, and the
student(s) must have made a significant contribution to the paper.
-----------------------
Program Committee
-----------------------
Evripidis Bampis (co-chair), Sorbonne University
Petra Berenbrink, University of Hamburg
Arnaud Casteigts, University of Bordeaux
Marek Chrobak, UC Riverside
Hans van Ditmarsch, CNRS and University of Lorraine
Thomas Erlebach, University of Leicester
Bruno Escoffier, Sorbonne University
Henning Fernau, University of Trier
Dimitris Fotakis, National Technical University of Athens
Pierre Fraigniaud, CNRS and University of Paris
Leszek Gasieniec, University of Liverpool and Augusta University
Laurent Gourves, CNRS and University of Paris-Dauphine
Giuseppe F. Italiano, LUISS Guido Carli University
Ralf Klasing, CNRS and University of Bordeaux
Alexander Kononov, Sobolev Institute of Mathematics and Novosibirsk
State University
Antonin Kucera, Masaryk University
Dietrich Kuske, TU Ilmenau
Nikos Leonardos, National and Kapodistrian University of Athens
Minming Li, City University of Hong Kong
Zsuzsanna Liptak, University of Verona
Giorgio Lucarelli, University of Lorraine
Vangelis Markakis, Athens University of Economics and Business
Nicole Megow, University of Bremen
Andrzej Murawski, University of Oxford
Aris Pagourtzis (co-chair), National Technical University of Athens
Charis Papadopoulos, University of Ioannina
Igor Potapov, University of Liverpool
Tomasz Radzik, King's College London
Maria Serna, Technical University of Catalonia
Hadas Shachnai, Technion
Vorapong Suppakitpaisarn, University of Tokyo
Nikos Tzevelekos, Queen Mary University of London
Guochuan Zhang, Zhejiang University
-----------------------
Steering Committee
-----------------------
Bogdan Chlebus, University of Colorado
Marek Karpinski, University of Bonn (chair)
Andrzej Lingas, Lund University
Miklos Santha, CNRS and University Paris Diderot
Eli Upfal, Brown University
-----------------------
Organizing Committee
-----------------------
Dimitris Fotakis (co-chair), National Technical University of Athens
Nikos Leonardos, National and Kapodistrian University of Athens
Thanasis Lianeas, National Technical University of Athens
Aris Pagourtzis (co-chair), National Technical University of Athens
-----------------------
Submission
-----------------------
Authors are invited to submit high-quality manuscripts reporting original
unpublished research in the topics related to the symposium. Simultaneous
submission to other conferences or workshops with published proceedings is
not allowed. It is required that each accepted paper be presented at the
conference by one of its authors.
Submissions must not exceed 12 pages (excluding references), formatted
according to LNCS LaTeX template and style files, plus an optional, clearly
marked appendix of reasonable length (to be read at the program committee's
discretion). The first page must include an indication of whether the paper
is eligible for the best student paper award.
Papers are to be submitted electronically through EasyChair using the
following link: https://easychair.org/conferences/?conf=fct2021
-----------------------
Contact
-----------------------
For further information, please send an e-mail to fct2021_at_corelab_ntua_gr
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
[DMANET] Postdoc Position in Algorithms (TU Munich)
Postdoctoral Position in Algorithms
TU Munich
A postdoctoral position in the area of efficient algorithms is
available in the research group of Prof. Susanne Albers, Department
of Computer Science, Technical University of Munich (TU Munich).
A research interest in approximation and online algorithms,
algorithmic game theory or algorithm engineering is very welcome.
More information about Susanne Albers and the research group can
be found at http://wwwalbers.in.tum.de/index.html.en
The position provides a competitive 12 month salary with standard
benefits. The appointment is for a period of one or two years,
depending on the scientific profile of the candidate. The expected
start date of the position is late summer or fall 2021.
The successful candidate should have a PhD degree in computer
science or mathematics. Furthermore, he/she should be interested
in collaborating with students. Since the position includes teaching
responsibilities, proficiency in German is required. The application
material should include (1) a cover letter describing the interest
in the position, (2) a CV and list of publications, (3) a short
research summary, and (4) the names and contact information of at
least two references. The material should be sent electronically
to <albers@in.tum.de>.
Applications will be reviewed starting May 28, 2021.
Susanne Albers
Department of Computer Science
Technical University Munich
Boltzmannstr. 3
85748 Garching (near Munich), Germany
E-mail: albers@in.tum.de
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
TU Munich
A postdoctoral position in the area of efficient algorithms is
available in the research group of Prof. Susanne Albers, Department
of Computer Science, Technical University of Munich (TU Munich).
A research interest in approximation and online algorithms,
algorithmic game theory or algorithm engineering is very welcome.
More information about Susanne Albers and the research group can
be found at http://wwwalbers.in.tum.de/index.html.en
The position provides a competitive 12 month salary with standard
benefits. The appointment is for a period of one or two years,
depending on the scientific profile of the candidate. The expected
start date of the position is late summer or fall 2021.
The successful candidate should have a PhD degree in computer
science or mathematics. Furthermore, he/she should be interested
in collaborating with students. Since the position includes teaching
responsibilities, proficiency in German is required. The application
material should include (1) a cover letter describing the interest
in the position, (2) a CV and list of publications, (3) a short
research summary, and (4) the names and contact information of at
least two references. The material should be sent electronically
to <albers@in.tum.de>.
Applications will be reviewed starting May 28, 2021.
Susanne Albers
Department of Computer Science
Technical University Munich
Boltzmannstr. 3
85748 Garching (near Munich), Germany
E-mail: albers@in.tum.de
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
[DMANET] CFP IPEC 2021 - second call
The International Symposium on Parameterized and Exact Computation (IPEC) is an annual conference covering all aspects of parameterized and exact algorithms and complexity. Its 16th edition will be part of ALGO 2021, which also hosts ESA 2021 and a number of more specialized conferences and workshops. ALGO 2021 will take place on September 6-10, 2021, Lisbon, Portugal. Due to the COVID-19 pandemic, IPEC might be held online.
Webpage: http://algo2021.tecnico.ulisboa.pt/IPEC2021/index.html <http://algo2021.tecnico.ulisboa.pt/IPEC2021/index.html>
====================================================================================
Topics
====================================================================================
Papers presenting original research in the area are sought, including but not limited to:
- new techniques for the design and analysis of parameterized and exact algorithms;
- fixed-parameter tractability and kernelization results;
- parameterized complexity theory;
- parameterized (in)approximability results;
- relationships between parameterized complexity and traditional complexity classifications;
- applications of parameterized and exact computation;
- implementation issues of exact, parameterized, and kernelization algorithms;
- theoretically grounded studies on parameterized and exact computations and kernelization for real-world applications and algorithmic engineering.
====================================================================================
Special Events
====================================================================================
An invited talk is planned by the 2021 EATCS-IPEC Nerode Prize winner. In addition, the results of the 5th Parameterized Algorithms and Computational Experiments Challenge (PACE 2021) will be presented in a special session.
====================================================================================
Conference
====================================================================================
Accepted papers will be published in the symposium proceedings in the Leibniz International Proceedings in Informatics (LIPIcs) series, based at Schloss Dagstuhl. Authors of accepted papers are expected to present their work at the symposium, and to incorporate the comments from the program committee.
A special issue of Algorithmica is planned for selected papers presented at IPEC 2021.
====================================================================================
Awards
====================================================================================
The program committee may award a Best Paper Award and a Best Student Paper Award, both of which may be exceptionally split between two or more papers. A student is someone who has not received a PhD degree before the full paper submission deadline. A paper accepted to the conference is eligible for the Best Student Paper Award if either all its authors are students, or besides student co-author(s) there is one non-student co-author that confirms, at the moment of submission, that a clear majority of conceptual work on the paper was done by the student co-author(s). In the latter case, it is moreover expected that a student gives the presentation at the conference. Papers co-authored by members of the program committee are not eligible for the Best Paper Award or the Best Student Paper Award.
====================================================================================
Submission Guidelines
====================================================================================
Authors are invited to submit an extended abstract of up to 12 pages (excluding the title page and references section) in LIPIcs style, in English, describing original unpublished research. The title page consists exclusively of the title of the paper, author information, and abstract. Results previously published in another conference proceedings or journal (or scheduled for publication prior to IPEC) will not be considered. Simultaneous submission to other conferences with published proceedings or to journals is not allowed. However, the authors are encouraged to make full versions of their submissions freely accessible in an online repository such as arXiv or ECCC. Program committee members (except the co-chairs) are allowed to submit papers.
The extended abstract should contain a summary of the main results, their motivation and importance, and evidence of their correctness. All claims made in the extended abstract must be fully justified in a clearly marked appendix that will be read at the discretion of the program committee. The authors may choose to either present in the appendix only the material excluded from the extended abstract or to attach a full version of the paper as the appendix. In either case, the authors should take a particular notice that the extended abstract should present their work in a comprehensible and self-contained way and the quality of the presentation in the extended abstract will be taken into account by the program committee.
Authors must submit their papers electronically via EasyChair. The use of the LIPIcs style file (https://www.dagstuhl.de/en/publications/lipics/instructions-for-authors <https://www.dagstuhl.de/en/publications/lipics/instructions-for-authors>) is mandatory; no changes to font size, page margins, etc., are permitted.
Submission website: https://easychair.org/conferences/?conf=ipec2021 <https://easychair.org/conferences/?conf=ipec2021>
====================================================================================
Important Dates
====================================================================================
Paper Registration: June 25, 2021 (23:59 AoE)
Full Paper Submission: June 28, 2021 (23:59 AoE)
Notification of acceptance: July 30, 2021
Conference dates: September 8-10, 2021
====================================================================================
Program Committee
====================================================================================
Akanksha Agrawal, IIT Madras, India
Fahad Panolan, IIT Hyderabad, India
Dimitrios Thilikos, LIRMM, Universite de Montpellier, CNRS, France
Eduard Eiben, Royal Holloway, University of London, UK
Ignasi Sau, LIRMM, Universite de Montpellier, CNRS, France
Jesper Nederlof, Utrecht University, Netherlands
Jiehua Chen, Vienna University of Technology, Austria
Karl Bringmann, Saarland University, Germany
Karthik C. S., New York University, USA
Martin Koutecky, Charles University, Czech Republic
Meirav Zehavi (co-chair), Ben-Gurion University of the Negev, Israel
Pascal Schweitzer, TU Kaiserslautern, Germany
Petr Golovach (co-chair), University of Bergen, Norway
Sebastian Siebertz, University of Bremen, Germany
Saket Saurabh, Indian Institute of Mathematical Sciences, India, and University of Bergen, Norway
Tillmann Miltzow, Utrecht University, Netherlands
Vincent Cohen-Addad, Google Zurich, Switzerland
William Lochet, University of Bergen, Norway
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
Webpage: http://algo2021.tecnico.ulisboa.pt/IPEC2021/index.html <http://algo2021.tecnico.ulisboa.pt/IPEC2021/index.html>
====================================================================================
Topics
====================================================================================
Papers presenting original research in the area are sought, including but not limited to:
- new techniques for the design and analysis of parameterized and exact algorithms;
- fixed-parameter tractability and kernelization results;
- parameterized complexity theory;
- parameterized (in)approximability results;
- relationships between parameterized complexity and traditional complexity classifications;
- applications of parameterized and exact computation;
- implementation issues of exact, parameterized, and kernelization algorithms;
- theoretically grounded studies on parameterized and exact computations and kernelization for real-world applications and algorithmic engineering.
====================================================================================
Special Events
====================================================================================
An invited talk is planned by the 2021 EATCS-IPEC Nerode Prize winner. In addition, the results of the 5th Parameterized Algorithms and Computational Experiments Challenge (PACE 2021) will be presented in a special session.
====================================================================================
Conference
====================================================================================
Accepted papers will be published in the symposium proceedings in the Leibniz International Proceedings in Informatics (LIPIcs) series, based at Schloss Dagstuhl. Authors of accepted papers are expected to present their work at the symposium, and to incorporate the comments from the program committee.
A special issue of Algorithmica is planned for selected papers presented at IPEC 2021.
====================================================================================
Awards
====================================================================================
The program committee may award a Best Paper Award and a Best Student Paper Award, both of which may be exceptionally split between two or more papers. A student is someone who has not received a PhD degree before the full paper submission deadline. A paper accepted to the conference is eligible for the Best Student Paper Award if either all its authors are students, or besides student co-author(s) there is one non-student co-author that confirms, at the moment of submission, that a clear majority of conceptual work on the paper was done by the student co-author(s). In the latter case, it is moreover expected that a student gives the presentation at the conference. Papers co-authored by members of the program committee are not eligible for the Best Paper Award or the Best Student Paper Award.
====================================================================================
Submission Guidelines
====================================================================================
Authors are invited to submit an extended abstract of up to 12 pages (excluding the title page and references section) in LIPIcs style, in English, describing original unpublished research. The title page consists exclusively of the title of the paper, author information, and abstract. Results previously published in another conference proceedings or journal (or scheduled for publication prior to IPEC) will not be considered. Simultaneous submission to other conferences with published proceedings or to journals is not allowed. However, the authors are encouraged to make full versions of their submissions freely accessible in an online repository such as arXiv or ECCC. Program committee members (except the co-chairs) are allowed to submit papers.
The extended abstract should contain a summary of the main results, their motivation and importance, and evidence of their correctness. All claims made in the extended abstract must be fully justified in a clearly marked appendix that will be read at the discretion of the program committee. The authors may choose to either present in the appendix only the material excluded from the extended abstract or to attach a full version of the paper as the appendix. In either case, the authors should take a particular notice that the extended abstract should present their work in a comprehensible and self-contained way and the quality of the presentation in the extended abstract will be taken into account by the program committee.
Authors must submit their papers electronically via EasyChair. The use of the LIPIcs style file (https://www.dagstuhl.de/en/publications/lipics/instructions-for-authors <https://www.dagstuhl.de/en/publications/lipics/instructions-for-authors>) is mandatory; no changes to font size, page margins, etc., are permitted.
Submission website: https://easychair.org/conferences/?conf=ipec2021 <https://easychair.org/conferences/?conf=ipec2021>
====================================================================================
Important Dates
====================================================================================
Paper Registration: June 25, 2021 (23:59 AoE)
Full Paper Submission: June 28, 2021 (23:59 AoE)
Notification of acceptance: July 30, 2021
Conference dates: September 8-10, 2021
====================================================================================
Program Committee
====================================================================================
Akanksha Agrawal, IIT Madras, India
Fahad Panolan, IIT Hyderabad, India
Dimitrios Thilikos, LIRMM, Universite de Montpellier, CNRS, France
Eduard Eiben, Royal Holloway, University of London, UK
Ignasi Sau, LIRMM, Universite de Montpellier, CNRS, France
Jesper Nederlof, Utrecht University, Netherlands
Jiehua Chen, Vienna University of Technology, Austria
Karl Bringmann, Saarland University, Germany
Karthik C. S., New York University, USA
Martin Koutecky, Charles University, Czech Republic
Meirav Zehavi (co-chair), Ben-Gurion University of the Negev, Israel
Pascal Schweitzer, TU Kaiserslautern, Germany
Petr Golovach (co-chair), University of Bergen, Norway
Sebastian Siebertz, University of Bremen, Germany
Saket Saurabh, Indian Institute of Mathematical Sciences, India, and University of Bergen, Norway
Tillmann Miltzow, Utrecht University, Netherlands
Vincent Cohen-Addad, Google Zurich, Switzerland
William Lochet, University of Bergen, Norway
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
Tuesday, May 4, 2021
[DMANET] Call for location ICALP 2023
CALL FOR LOCATION ICALP 2023
The International Colloquium on Automata, Languages and Programming
(ICALP) is the main conference and annual meeting of the EATCS (European
Association for Theoretical Computer Science). This international
conference was launched in 1972 and covers all aspects of theoretical
computer science. ICALP comprises the main, two-track conference over
four days, plus a pre- and/or a post-workshop day.
We invite proposals for locations to host the 50th ICALP, to be held in
the first half of July 2023. Previous (and upcoming) ICALP editions include:
* ICALP 2022 in Paris (France)
* ICALP 2021 in Glasgow (UK), virtual
* ICALP 2020 in Saarbrücken (Germany), virtual
* ICALP 2019 in Patras (Greece)
* ICALP 2018 in Prague (Czech Rep.)
The deadline for proposals is *** June 15, 2021 ***.
Proposals or informal inquires should be sent to the Steering Committee
chair or the President of the EATCS (see contact information below).
Selected proposals are to be presented at the General Assembly of the
EATCS at ICALP 2021.
Proposals should address the following points:
- name(s) of the Conference Chair(s) and their host institution
- proposed location (and possibly venue)
- appropriateness of the proposed dates (including possible holidays or
other events)
- travel information and estimated transportation costs
- estimated accommodation and registration costs
- conference facilities (session and plenary rooms, workshop rooms)
Steering Committee chair: Anca Muscholl (anca at labri dot fr)
EATCS president: Artur Czumaj (aczumaj at acm dot org)
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
Subscribe to:
Posts (Atom)
Posts
