Dear Colleagues,
at this time, the Organizing Committee of the International Conference on
Optimization and Decision Sciences 2020 wishes to thank all the people,
friends and colleagues, here and abroad, for their words of concern and
encouragement for the situation in Italy.
Although right now there are other major issues, in particular for our
friends in the northern part of Italy, we believe that, from our side, we
should try to keep working to have a successful meeting, possibly with some
changes on our previous organization.
For the above reasons, we extended the deadlines as much as possible to
allow anyone to have more time for sessions organization, abstract and
short papers submission, and, hopefully a more favorable situation to plan
our future activities.
-------------------------------------------------------------------------------------------------------------------
*Extended Deadlines*
- May 1, 2020 Deadline for submission of sessions proposal
- May 1, 2020 Deadline for short paper submission
- May 24, 2020 Deadline for abstract submission
- June 29, 2020 Contribution (short paper or abstract) acceptance
notification
- June 29, 2020 Deadline for early registration
- July 19, 2020 Deadline for camera-ready paper
----------------------------------------------------------------------------------------------
Keep visiting our web site (http://www.airoconference.it/ods2020/) or
contact the conference secretariat (ods2020-airo.dss@uniroma1.it).
*The ODS 2020 Organizing Committee*
--
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
Tuesday, March 24, 2020
[DMANET] 7 PhD positions in Computer Science at Gran Sasso Science Institute (GSSI), L'Aquila (Italy)
The GSSI - Gran Sasso Science Institute offers seven, four-year PhD
fellowships in Computer Science for the academic year 2020/21. The
fellowships include a yearly salary of € 16,159.91 gross, free
accommodation at the GSSI facilities and use of the canteen. The
official language for all PhD courses is English.
fellowships in Computer Science for the academic year 2020/21. The
fellowships include a yearly salary of € 16,159.91 gross, free
accommodation at the GSSI facilities and use of the canteen. The
official language for all PhD courses is English.
Applications must be submitted through the online form available at
www.gssi.it/phd/ by Thursday, 11 June 2020 at 5 pm (Italian time zone).
*Computer Science at the GSSI and its PhD programme*
The Computer Science group at the GSSI carries out high-quality,
interdisciplinary research on algorithms, formal methods, and software
analysis and development. Further information on the group, its members,
activities, current research projects, guests, wide international
network and vibrant research environment can be found at
https://cs.gssi.it .
The PhD program in Computer Science at the GSSI (see
https://sites.google.com/gssi.it/csgssi/ph-d-program/program) fosters
theoretical and applied research on the above-mentioned fields, and
equips young researchers with the knowledge and skills to successfully
tackle the future challenges in the digital era.
*About the Gran Sasso Science Institute*
The GSSI-Gran Sasso Science Institute (https://www.gssi.it/) is an
international PhD school and a centre for research and higher education
in the areas of Computer Science, Mathematics, Physics and Social
Sciences. The GSSI was founded in 2012 in L'Aquila (Italy) as Centre for
Advanced Studies of the National Institute for Nuclear Physics (INFN)
and was then established in March 2016 as a School of Advanced Studies
providing post-graduate education. Through day-to-day collaboration and
interaction, researchers and students have the opportunity to build a
sound knowledge of research methods and to engage in interdisciplinary
research, innovative approaches for scientific investigation and
multicultural exchanges. In addressing the complexity of today's world,
the GSSI is committed to removing all barriers between its areas of
study and research. The dissemination of scientific results towards
society and the promotion of cultural events for the generic public are
among the goals of the GSSI.
**********************************************************
*
* 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] CO2020 - Cancelled
We regret that, due to the coronavirus, we have been forced to cancel CO2020 (the combinatorial optimization conference that was due to take place in Bath in September 2020).
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
Monday, March 23, 2020
[DMANET] HALG2020 (Highlights of Algorithms) - new date
Dear HALG 2020 participants,
The PC, the organizers and the HALG Steering Committee are monitoring the situation with coronavirus and are considering measures to ensure a safe environment for all participants. Given the current situation, we decided to postpone HALG2020 to a later date, probably at the end of August (tentatively Aug 29-31, 2020). The meeting will be in person if possible and otherwise held virtually. The call for short contributions will reopen after a more definite plan for the conference is fixed. Finally, we advise you not to purchase your travel tickets nor book accommodation until a final announcement regarding HALG is posted.
The organization of HALG 2020
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
The PC, the organizers and the HALG Steering Committee are monitoring the situation with coronavirus and are considering measures to ensure a safe environment for all participants. Given the current situation, we decided to postpone HALG2020 to a later date, probably at the end of August (tentatively Aug 29-31, 2020). The meeting will be in person if possible and otherwise held virtually. The call for short contributions will reopen after a more definite plan for the conference is fixed. Finally, we advise you not to purchase your travel tickets nor book accommodation until a final announcement regarding HALG is posted.
The organization of HALG 2020
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
[DMANET] Online Colloquium--Maria Chudnovsky
*We hope you will join us for the next Virtual Combinatorics Colloquium!*
Please join us for the following up-coming Virtual Combinatorics
Colloquium. Individuals and viewing party groups from anywhere in the
world can "attend" these online talks and interact with the speaker and
other attendees remotely via Zoom.
*Zoom link: https://smcvt.zoom.us/j/831984515
<https://smcvt.zoom.us/j/831984515> *
*Date: *Tuesday, 7 April 2020
*Time*: 2:00 p.m. (14:00) Eastern Daylight Time
*Speaker: *Maria Chudnovsky, Princeton University
*Title:* RECENT PROGRESS ON THE ERDOS-HAJNAL CONJECTURE
*Abstract: *What is the effect of excluding an induced subgraph on the
global
structure of a graph? While there do not seem to be general structural
consequences,
a conjecture of Erdos and Hajnal states that graphs with forbidden induced
subgraphs behave very differently from general graphs; more precisely they
contain much larger cliques or stable sets. This conjecture is still open.
In this talk we will discuss the history of this problem and some recent
theorems related to it.
Click on the given link to join. Depending on your set-up, there may be a
very brief download, but we are using the Zoom platform, so it should be
pretty minimal. Past VCC events have gone very smoothly.
Here are quick instructions for joining a Zoom meeting:
https://support.zoom.us/hc/en-us/articles/201362193-How-Do-I-Join-A-Meeting-
The talk will start at the given time, but the invitation will be open 30
minutes so that anyone who wants to can call in early and get a sense of
how the platform works (how to mute/unmute, share screens, shared
whiteboard, raise hand, chat, etc.). It is very similar in feel to many
other like products, but takes a bit to figure out where Zoom puts the
buttons.
*To avoid the possibility of distraction and feedback noise, please keep
your mic muted unless you or someone in your group has something particular
to say.*
The *Northeast Combinatorics Network* (NCN) is funded by the US National
Science Foundation.
Activities, including *Discrete Math Days in the Northeast* (DMD), *Summer
Combo in Vermont*, and the *Virtual Combinatorics Colloquium* (VCC), are
detailed on the NCN website:
Google Sites: Northeast Combinatorics Network
<https://sites.google.com/view/northeastcombinatoricsnetwork/home>
Email: northeastcombinatoricsnetwork@gmail.com
YouTube Channel: Northeast Combinatorics Network
<https://www.youtube.com/channel/UCQYSxI_EL0nhE9E6aZZra5Q>
Some VCC tips:
For reporting purposes, we appreciate knowing who is attending and the
institution/location of the attendees. Please provide this information in
the chat feature of Zoom when you sign in.
We hope you will be hosting a viewing party
<https://sites.google.com/view/northeastcombinatoricsnetwork/events/virtual-combinatorics-colloquium/vcc-viewing-parties>
for this event. We'd like to list the viewing parties on the NCN website
<https://sites.google.com/view/northeastcombinatoricsnetwork/home>, and
knowing the existence and size of your party helps with reporting to the
organizations that fund these events. Please provide the number of
participants in your group in the chat feature when you sign in.
Single callers may find it helpful to use headphones if possible, as this
reduces feedback issues.
Viewing groups should keep microphones muted unless someone wants to raise
a hand and ask a question. If feedback occurs, turn off your volume to ask
the question, then turn it back on to hear the answer.
The default will be for the audience to be muted (again to reduce feedback
issues), but participants can unmute themselves, or use the 'raise hand'
button, if they have questions.
*Jo*
Jo Ellis-Monaghan
Chair, Department of Mathematics and Statistics (on sabbatical 2019-2020)
Editor-in-Chief, PRIMUS
Saint Michael's College
One Winooski Park
Colchester, VT 05439
office: Jeanmarie 279
website: http://academics.smcvt.edu/jellis-monaghan/
phone: 802 654 2660
fax: 802 654 2960
e-mail: je <jellis-monaghan@smcvt.edu>llismonaghan@gmail.com
<llismonaghan@gmail.com>
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
[DMANET] PACE 2020 Second Call for Participation
This is the second call for participation for PACE, the Parameterized Algorithms and Computational Experiments Challenge. By now, public instances are available and preliminary submissions are possible at optil.io . The goals of PACE as well as official reports for past challenges can be found on our website: https://pacechallenge.org/
In this fifth edition, the challenge is on treedepth:
* Input: A connected undirected graph
* Output: A treedepth decomposition of the graph
Let us recall that a treedepth decomposition of a connected graph G=(V,E) is a rooted tree T=(V,E_T) such that every edge of G connects a pair of nodes that have an ancestor-descendant relationship in T. The depth of T is the maximum number of nodes in a root-vertex path in T. The treedepth of G is a minimum depth of a treedepth decomposition of G.
** Tracks
------------------------------------------------------------
There are two different tracks in which you can compete:
*Exact:* Compute a treedepth decomposition of minimum depth. You have 30 minutes per instance. Contestants are ranked by number of instances solved and time required as a tiebreaker.
*Heuristic:* Heuristic: Compute some treedepth decomposition of decent depth. You have 30 minutes per instance. Contestants are ranked by the quality of their results.
Detailed instructions and public instances are available on https://pacechallenge.org/
** Prizes
------------------------------------------------------------
Thanks to the generous sponsoring of the NETWORKS project (http://thenetworkcenter.nl/), 4000 euros in prize money and travel support is available for the winners of the competition.
** Timeline
------------------------------------------------------------
* October 25th, 2019: Announcement of the challenge (Problem)
* November 11th, 2019: Announcement of the tracks and additional information
* December 16th, 2019: Public instances are available
* March 13th, 2020: Challenge leaderboard and submission of preliminary versions available via optil.io
* June 1st, 2020 (AOE) Submission of final version (solver description two weeks after the code)
* July, 2020: Announcement of the results
* December 14-16, 2020 Award ceremony at the International Symposium on Parameterized and Exact Computation (IPEC 2020) in Hong Kong
** Program Committee
------------------------------------------------------------
* Lukasz Kowalik (mailto:kowalik@mimuw.edu.pl) (chair) (University of Warsaw)
* Marcin Mucha (University of Warsaw)
* Wojciech Nadara (University of Warsaw)
* Marcin Pilipczuk (University of Warsaw)
* Manuel Sorge (University of Warsaw)
* Piotr Wygocki (University of Warsaw)
** Steering Committee
------------------------------------------------------------
* Edouard Bonnet (LIP, ENS Lyon)
* Holger Dell (IT University of Copenhagen)
* Johannes Fichte (Technische Universitat Dresden)
* Markus Hecher (Technische Universitat Wien)
* Bart M. P. Jansen (chair) (Eindhoven University of Technology)
* Petteri Kaski (Aalto University)
* Christian Komusiewicz (Philipps-Universitat Marburg)
* Florian Sikora (LAMSADE, Universite Paris Dauphine)
**********************************************************
*
* 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/
*
**********************************************************
In this fifth edition, the challenge is on treedepth:
* Input: A connected undirected graph
* Output: A treedepth decomposition of the graph
Let us recall that a treedepth decomposition of a connected graph G=(V,E) is a rooted tree T=(V,E_T) such that every edge of G connects a pair of nodes that have an ancestor-descendant relationship in T. The depth of T is the maximum number of nodes in a root-vertex path in T. The treedepth of G is a minimum depth of a treedepth decomposition of G.
** Tracks
------------------------------------------------------------
There are two different tracks in which you can compete:
*Exact:* Compute a treedepth decomposition of minimum depth. You have 30 minutes per instance. Contestants are ranked by number of instances solved and time required as a tiebreaker.
*Heuristic:* Heuristic: Compute some treedepth decomposition of decent depth. You have 30 minutes per instance. Contestants are ranked by the quality of their results.
Detailed instructions and public instances are available on https://pacechallenge.org/
** Prizes
------------------------------------------------------------
Thanks to the generous sponsoring of the NETWORKS project (http://thenetworkcenter.nl/), 4000 euros in prize money and travel support is available for the winners of the competition.
** Timeline
------------------------------------------------------------
* October 25th, 2019: Announcement of the challenge (Problem)
* November 11th, 2019: Announcement of the tracks and additional information
* December 16th, 2019: Public instances are available
* March 13th, 2020: Challenge leaderboard and submission of preliminary versions available via optil.io
* June 1st, 2020 (AOE) Submission of final version (solver description two weeks after the code)
* July, 2020: Announcement of the results
* December 14-16, 2020 Award ceremony at the International Symposium on Parameterized and Exact Computation (IPEC 2020) in Hong Kong
** Program Committee
------------------------------------------------------------
* Lukasz Kowalik (mailto:kowalik@mimuw.edu.pl) (chair) (University of Warsaw)
* Marcin Mucha (University of Warsaw)
* Wojciech Nadara (University of Warsaw)
* Marcin Pilipczuk (University of Warsaw)
* Manuel Sorge (University of Warsaw)
* Piotr Wygocki (University of Warsaw)
** Steering Committee
------------------------------------------------------------
* Edouard Bonnet (LIP, ENS Lyon)
* Holger Dell (IT University of Copenhagen)
* Johannes Fichte (Technische Universitat Dresden)
* Markus Hecher (Technische Universitat Wien)
* Bart M. P. Jansen (chair) (Eindhoven University of Technology)
* Petteri Kaski (Aalto University)
* Christian Komusiewicz (Philipps-Universitat Marburg)
* Florian Sikora (LAMSADE, Universite Paris Dauphine)
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
[DMANET] PhD position (4 years) at TU Wien
***************************************************
PhD position (4 years) at TU Wien
***************************************************
The Institute of Logic and Computation at TU Wien is hiring
a PhD student for a research collaboration with industry in the area of
knowledge representation and reasoning. The goal of this collaboration is
to advance the use of logic-based tools and methods for solving real-world
problems with innovative technologies.
Topics of particular interest for the collaboration are scheduling,
combining machine learning and symbolic reasoning, context-based
reasoning, answer set programming, and explanation finding.
Candidates for the position should have a solid background in knowledge
representation and reasoning, logic-based AI, planning and scheduling,
answer set programming, or logic programming at large.
The salary depends on experience but is expected to be
36,000 EUR at least per annum before taxes. Hiring is
from now, for a period of up to four years.
The position is affiliated with the Knowledge-Based Systems Group (KBS)
and the Databases and AI Group (DBAI) of the Institute, under the lead of
Prof. Thomas Eiter and PD Dr. Nysret Musliu.
Interested candidates should contact:
Thomas Eiter <thomas.eiter@tuwien.ac.at>
http://www.kr.tuwien.ac.at/staff/eiter/
and/or
Nysret Musliu <nysret.musliu@tuwien.ac.at>
https://www.dbai.tuwien.ac.at/staff/musliu/
----------------------------------------------------------------------
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
PhD position (4 years) at TU Wien
***************************************************
The Institute of Logic and Computation at TU Wien is hiring
a PhD student for a research collaboration with industry in the area of
knowledge representation and reasoning. The goal of this collaboration is
to advance the use of logic-based tools and methods for solving real-world
problems with innovative technologies.
Topics of particular interest for the collaboration are scheduling,
combining machine learning and symbolic reasoning, context-based
reasoning, answer set programming, and explanation finding.
Candidates for the position should have a solid background in knowledge
representation and reasoning, logic-based AI, planning and scheduling,
answer set programming, or logic programming at large.
The salary depends on experience but is expected to be
36,000 EUR at least per annum before taxes. Hiring is
from now, for a period of up to four years.
The position is affiliated with the Knowledge-Based Systems Group (KBS)
and the Databases and AI Group (DBAI) of the Institute, under the lead of
Prof. Thomas Eiter and PD Dr. Nysret Musliu.
Interested candidates should contact:
Thomas Eiter <thomas.eiter@tuwien.ac.at>
http://www.kr.tuwien.ac.at/staff/eiter/
and/or
Nysret Musliu <nysret.musliu@tuwien.ac.at>
https://www.dbai.tuwien.ac.at/staff/musliu/
----------------------------------------------------------------------
**********************************************************
*
* 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 postponed: Queer and Trans Mathematicians in Combinatorics
Dear Colleagues,
Due to the rapidly-evolving situation with COVID-19, we have decided to postpone the first Queer and Trans Mathematicians in Combinatorics (QTMC) until summer of 2021. The conference will be held on June 25-27, 2021, at the Fields Institute in Toronto. Anyone who has already registered for QTMC will hear from Fields soon. For more information, and for updates on QTMC 2021, please continue to check our website<http://queertransmath.com>.
Wishing you the very best in these uncertain times,
Rachelle Bouchat
Aram Dermenjian
Ray Karpman
Mike Zabrocki
Ray D. Karpman (Rachel Karpman)
Assistant Professor of Mathematics
pronouns: they/them or she/her
Office: Towers Hall 136
email: karpman1@otterbein.edu
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
Due to the rapidly-evolving situation with COVID-19, we have decided to postpone the first Queer and Trans Mathematicians in Combinatorics (QTMC) until summer of 2021. The conference will be held on June 25-27, 2021, at the Fields Institute in Toronto. Anyone who has already registered for QTMC will hear from Fields soon. For more information, and for updates on QTMC 2021, please continue to check our website<http://queertransmath.com>.
Wishing you the very best in these uncertain times,
Rachelle Bouchat
Aram Dermenjian
Ray Karpman
Mike Zabrocki
Ray D. Karpman (Rachel Karpman)
Assistant Professor of Mathematics
pronouns: they/them or she/her
Office: Towers Hall 136
email: karpman1@otterbein.edu
**********************************************************
*
* 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] Seymour is Seventy, Lyon, France, 2020 June 15-19, is postponed
The meeting Seymour is Seventy, to be held in Lyon, France, 2020 June 15-19, is postponed. We hope to run a similar event in the summer of 2021 instead, specific decisions on the dates are to be made when the situation clarifies.
https://dimag.ibs.re.kr/seymour70/
*************
Seymour is Seventy
A conference honouring the seventieth birthday of Paul Seymour
At ENS de Lyon, France
Postponed
**************
Invited speakers
Noga Alon, Princeton University / Tel Aviv University
Maria Chudnovsky, Princeton University
Julia Chuzhoy, Toyota Technological Institute at Chicago
Gérard Cornuéjols, Carnegie Mellon University
Matt DeVos, Simon Fraser University
Guoli Ding, Louisiana State University
Jacob Fox, Stanford University
András Gyárfás, Hungarian Academy of Sciences
Alexandr V. Kostochka, University of Illinois at Urbana-Champaign
Chun-Hung Liu, Texas A&M University
Sergey Norin, McGill University
Sang-il Oum, IBS Discrete Mathematics Group / KAIST
Bruce Reed, McGill University
Alexander Schrijver, University of Amsterdam / CWI Amsterdam
Alex Scott, University of Oxford
Sophie Spirkl, Princeton University
Benny Sudakov, ETH Zurich
Stéphan Thomassé, ENS de Lyon
Carsten Thomassen, Technical University of Denmark
Kristina Vušković, University of Leeds
Paul Wollan, University of Rome "La Sapienza"
**************
Organizers
Maria Chudnovsky
Sang-Il Oum
Nicolas Trotignon
_____________________
Nicolas Trotignon
CNRS, LIP, ENS de Lyon, Département d'informatique
http://perso.ens-lyon.fr/nicolas.trotignon/index.html
_____________________
Nicolas Trotignon
CNRS, LIP, ENS de Lyon, Département d'informatique
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] Final call for (Self-)Nominations for the VCLA International Student Awards for Outstanding Master and Bachelor Theses in Logic and Computer Science - Deadline: 9.4.2020 AoE
The Vienna Center for Logic and Algorithms of TU Wien (Vienna University of
Technology), calls for the nomination of authors of outstanding theses and
scientific works in the field of Logic and Computer Science, in the following
two categories:
-Outstanding Master Thesis Award*
-Outstanding Undergraduate Thesis Award (Bachelor thesis or equivalent, 1st
cycle of the Bologna process)*
*The degree must have been awarded between November 15th, 2018 and December
31st, 2019 (inclusive).
----------------------------------
The main areas of interest are:
----------------------------------
-Computational Logic, covering theoretical and mathematical foundations such
as proof theory, model theory, computability theory, Boolean satisfiability
(SAT), QBF, constraint satisfaction, satisfiability modulo theories, automated
deduction (resolution, refutation, theorem proving), non-classical logics
(substructural logics, multi-valued logics, deontic logics, modal and temporal
logics).
-Algorithms and Computational Complexity, including design and analysis of
discrete algorithms, complexity analysis, algorithmic lower bounds,
parameterized and exact algorithms, decomposition methods, approximation
algorithms, randomized algorithms, algorithm engineering, as well as
algorithmic game theory, computational social choice, parallel algorithms,
graph drawing algorithms, and distributed algorithms.
-Databases and Artificial Intelligence, concerned with logical methods for
modeling, storing, and drawing inferences from data and knowledge. This
includes subjects like query languages based on logical concepts (Datalog,
variants of SQL, XML, and SPARQL), novel database-theoretical methods (schema
mappings, information extraction and integration), logic programming,
knowledge representation and reasoning (ontologies, answer-set programming,
belief change, inconsistency handling, argumentation, planning).
-Verification, concerned with logical methods and automated tools for
reasoning about the behavior and correctness of complex state-based systems
such as software and hardware designs as well as hybrid systems. This ranges
from model checking, program analysis and abstraction to new interdisciplinary
areas such as fault localization, program repair, program synthesis, and the
analysis of biological systems.
-Formal Methods for Security and Privacy, covering design and analysis
techniques for security and privacy critical systems, such as cryptographic
protocols, software, hardware and so on. The category of formal methods is to
be meant in a broad sense, including related questions in logic, model
checking, static analysis, dynamic monitoring, theorem proving, and artificial
intelligence.
----------------------------------
Awards
----------------------------------
-The Outstanding Master Thesis Award: 1200 EUR
-The Outstanding Undergraduate Thesis Award: 800 EUR
-The winners will be invited to present their work at an award ceremony in
Vienna.
----------------------------------
Eligibility
----------------------------------
-The degree must have been awarded between November 15th, 2018 and December
31st, 2019 (inclusive).
-Students who obtained their degree at TU Wien are not eligible.
----------------------------------
Nomination Requirements
----------------------------------
Nominations must include:
-A cover page that contains the name and contact details of the nominated
person, the title of the work for which the person is being nominated, award
category, the date on which the degree was awarded, and the name of the
university
-An English summary of the thesis of maximum 3 pages, excluding references (A4
or letter page size, 11pt font min). The summary must clearly state the main
contribution of the work, its novelty, and its relevance to some of the
aforementioned areas of interest
-The CV of the nominated person, including publication list (if applicable
-An endorsement letter from a supervisor or another proposing person. The
letter must clearly state the independent and novel contribution of the
student, and why the proposer believes the student deserves the award. The
endorsement letter may be provided after the submission deadline, and emailed
directly to award (AT) logic-cs.at.
-The full thesis
All documents should be in English, with the exception of the thesis. In case
the thesis is in a different language, it must be accompanied by a research
report in English of at least 10 pages that should be sufficient for the
committee to evaluate the merit and quality of the submitted work.
----------------------------------
Instructions for submitting nominations
----------------------------------
-Nominations should be submitted electronically using the following link to
EasyChair here
-Submissions consist of two pdf files. The first is a single pdf file
containing all documents for the nomination except the full thesis; the
documents should appear in the order they are listed above. The second pdf
file is the full thesis
-The endorsement letter may optionally be sent by email by the endorser and
omitted from the Easychair submission. In this case, please email the letter
as a pdf file, including the name of the nominated person in the subject, to
award (AT) logic-cs DOT at
-The submission must be accompanied by a plain text electronic abstract of the
thesis of at most 400 words, and three keywords.
-The nominated student must be listed as the first and corresponding author in
the submission form.
----------------------------------
Important dates
----------------------------------
-Submission deadline (extended): April 9, 2020 (anywhere on Earth)
-Notification of decision: end of June 2020
-Award ceremony: TBA
----------------------------------
Contact
----------------------------------
Please send all inquiries to award@logic-cs.at
----------------------------------
Website with the information on the award committee, and the previous awardees
----------------------------------
https://logic-cs.at/vcla-awards-2020
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
Technology), calls for the nomination of authors of outstanding theses and
scientific works in the field of Logic and Computer Science, in the following
two categories:
-Outstanding Master Thesis Award*
-Outstanding Undergraduate Thesis Award (Bachelor thesis or equivalent, 1st
cycle of the Bologna process)*
*The degree must have been awarded between November 15th, 2018 and December
31st, 2019 (inclusive).
----------------------------------
The main areas of interest are:
----------------------------------
-Computational Logic, covering theoretical and mathematical foundations such
as proof theory, model theory, computability theory, Boolean satisfiability
(SAT), QBF, constraint satisfaction, satisfiability modulo theories, automated
deduction (resolution, refutation, theorem proving), non-classical logics
(substructural logics, multi-valued logics, deontic logics, modal and temporal
logics).
-Algorithms and Computational Complexity, including design and analysis of
discrete algorithms, complexity analysis, algorithmic lower bounds,
parameterized and exact algorithms, decomposition methods, approximation
algorithms, randomized algorithms, algorithm engineering, as well as
algorithmic game theory, computational social choice, parallel algorithms,
graph drawing algorithms, and distributed algorithms.
-Databases and Artificial Intelligence, concerned with logical methods for
modeling, storing, and drawing inferences from data and knowledge. This
includes subjects like query languages based on logical concepts (Datalog,
variants of SQL, XML, and SPARQL), novel database-theoretical methods (schema
mappings, information extraction and integration), logic programming,
knowledge representation and reasoning (ontologies, answer-set programming,
belief change, inconsistency handling, argumentation, planning).
-Verification, concerned with logical methods and automated tools for
reasoning about the behavior and correctness of complex state-based systems
such as software and hardware designs as well as hybrid systems. This ranges
from model checking, program analysis and abstraction to new interdisciplinary
areas such as fault localization, program repair, program synthesis, and the
analysis of biological systems.
-Formal Methods for Security and Privacy, covering design and analysis
techniques for security and privacy critical systems, such as cryptographic
protocols, software, hardware and so on. The category of formal methods is to
be meant in a broad sense, including related questions in logic, model
checking, static analysis, dynamic monitoring, theorem proving, and artificial
intelligence.
----------------------------------
Awards
----------------------------------
-The Outstanding Master Thesis Award: 1200 EUR
-The Outstanding Undergraduate Thesis Award: 800 EUR
-The winners will be invited to present their work at an award ceremony in
Vienna.
----------------------------------
Eligibility
----------------------------------
-The degree must have been awarded between November 15th, 2018 and December
31st, 2019 (inclusive).
-Students who obtained their degree at TU Wien are not eligible.
----------------------------------
Nomination Requirements
----------------------------------
Nominations must include:
-A cover page that contains the name and contact details of the nominated
person, the title of the work for which the person is being nominated, award
category, the date on which the degree was awarded, and the name of the
university
-An English summary of the thesis of maximum 3 pages, excluding references (A4
or letter page size, 11pt font min). The summary must clearly state the main
contribution of the work, its novelty, and its relevance to some of the
aforementioned areas of interest
-The CV of the nominated person, including publication list (if applicable
-An endorsement letter from a supervisor or another proposing person. The
letter must clearly state the independent and novel contribution of the
student, and why the proposer believes the student deserves the award. The
endorsement letter may be provided after the submission deadline, and emailed
directly to award (AT) logic-cs.at.
-The full thesis
All documents should be in English, with the exception of the thesis. In case
the thesis is in a different language, it must be accompanied by a research
report in English of at least 10 pages that should be sufficient for the
committee to evaluate the merit and quality of the submitted work.
----------------------------------
Instructions for submitting nominations
----------------------------------
-Nominations should be submitted electronically using the following link to
EasyChair here
-Submissions consist of two pdf files. The first is a single pdf file
containing all documents for the nomination except the full thesis; the
documents should appear in the order they are listed above. The second pdf
file is the full thesis
-The endorsement letter may optionally be sent by email by the endorser and
omitted from the Easychair submission. In this case, please email the letter
as a pdf file, including the name of the nominated person in the subject, to
award (AT) logic-cs DOT at
-The submission must be accompanied by a plain text electronic abstract of the
thesis of at most 400 words, and three keywords.
-The nominated student must be listed as the first and corresponding author in
the submission form.
----------------------------------
Important dates
----------------------------------
-Submission deadline (extended): April 9, 2020 (anywhere on Earth)
-Notification of decision: end of June 2020
-Award ceremony: TBA
----------------------------------
Contact
----------------------------------
Please send all inquiries to award@logic-cs.at
----------------------------------
Website with the information on the award committee, and the previous awardees
----------------------------------
https://logic-cs.at/vcla-awards-2020
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
Sunday, March 22, 2020
[DMANET] [CFP] IEEE SmaCE'20 - To be held virtually
****Please Receive our Apologies for Cross-postings******
Due to the health pandemic, SmaCE'20 will be held virtually, without
physical gathering. Still, accepted papers will be included in the IEEE
Proceedings, as planned. Extended deadlines for submissions and
camera-ready versions are provided. Reduced registration fees will
apply. Detailed information will follow soon.
CALL FOR PAPERS
------------------------------------------------------------------------------------------------------------------
2nd IEEE Workshop on Smart Circular Economy
https://sites.google.com/view/smace2020/home
*To be held virtually*
In conjuction with the
16th International Conference on Distributed Computing in Sensor Systems
IEEE DCOSS 2020 - https://www.dcoss.org
-------------------------------------------------------------------------------------------------------------------
Important Dates
==========
Paper Submission Deadline: May 10, 2020
Acceptance Notification: June 3, 2020
Camera Ready Submission Deadline: June 10, 2020
Early Registration Deadline: TBC
Workshop Dates: The event will be virtual - details to follow
*Accepted papers will appear in IEEE Xplore.*
Scope
====
Circular Economy is a paradigm for sustainable growth that envisions the
transformation of how modern societies design, produce and consume goods
and services towards a regenerative economic cycle. Future and emerging
technologies, such as 5G, the blockchain, and crowdsourced sensing
systems, along with innovative models and paradigms, such as the
Internet of Things, Industry 4.0, and community networks, will play an
important role in the transition to Circular Economy by enabling and
facilitating, among others, digitization (efficient asset management,
open data, etc.) and collaboration (co-innovation, shared value
creation, etc.).
Smart Circular Economy is an international inter-disciplinary workshop
focusing on the role of ICT as an enabler for Circular Economy. This
workshop will bring together scientists, researchers as well as relevant
stakeholders from the industry and local communities to share and
exchange their experiences, discuss challenges, and report
state-of-the-art and in-progress research lying in the intersection of
ICT and Circular Economy.
Accepted and presented papers will be included in the same proceedings
volume as the IEEE DCOSS 2020 proceedings, listed in all major
publication indexes (IEEE Xplore, DBLP, Scopus, etc)
Topics
======
SmaCE is an inter-disciplinary event accepting papers in the disciplines
of Computer Science, Economics and Business. Topics of interest include,
but are not limited to:
- Architectures for collecting and curating data generated by
distributed, heterogeneous smart assets.
- Technology enablers for Circular Economy - Internet of Things, 5G,
Software Defined Networks, Big Data, Analytics, Machine Learning, Neural
Networks and other.
- Smart Infrastructure - Smart Grid, Utility Networks (water, gas,
waste, etc.), Transport Networks and other.
- Crowdsensing, Internet of Things and Participatory Sensing,
Crowdsourced Systems and Architectures
- The Blockchain and other Distributed Ledger Technologies for Smart
Circular Economy -asset tracking, smart contracts, micro-transactions,
etc.
- In-depth case studies illustrating Circular Economy performance and
efficiency in terms of people, the planet and profit.
- Sharing economy and resale markets.
- Peer-to-peer and ad-hoc markets.
- Applications of Smart Circular Economy technologies in verticals such
as healthcare, transportation, energy, citizen safety, and other.
- Interdependency between Digital and Physical Networks; e.g.
communication and utility networks.
- Data-driven business models, Open Innovation, Co-creation and shared
value creation
- RFID, NFC and other technologies for asset management
- Low-Power Networks - LoRa, SigFox, NB-IoT, IPv6-enabled IoT,
Industrial IoT
- Smart services and service provisioning
- Requirements engineering for Circular Economy
- Security, Privacy and Trust for Smart Circular Economy
Sponsors
===============
EU H2020 projects:
- CE-IoT (https://www.ce-iot.eu/)
- Ideal-Cities (https://www.ideal-cities.eu/) and
- Semiotics (https://www.semiotics-project.eu/).
Submission & Proceedings
===============
Accepted and presented papers will be included in the same proceedings
volume as the IEEE DCOSS 2020 proceedings, listed in all major
publication indexes (IEEE Xplore, DBLP, Scopus, etc).
Submitted papers must be prepared in English (UK or US spelling),
following the IEEE two-column Manuscript Templates for Conference
Proceedings (available here) with a maximum length of eight (8) printed
pages including text, figures, and references. Authors may add at most
two (2) pages, but only for an appendix, i.e. these two pages contain
supplementary material only. The additional two pages will incur
overlength charges at 100USD/page. Note that the Workshop follows a
single-blind review policy.
The names and affiliations of all the authors must be presented in the
submitted manuscript. No-show papers submitted by authors who did not
present the paper in-person will not be included in the workshop
proceedings. No refund of the paid fees can be claimed by the no-show
authors. Presentations by proxies are not allowed, unless explicitly
approved by the organisers.
Organizing Committee
====================
[General Chair]
Marios Angelopoulos, Bournemouth University, UK
contact: mangelopoulos@bournemouth.ac.uk
[Technical Program Co-Chairs]
Giorgos Demetriou, Ecole des Ponts Business School, France
Sotiris Ioannidis, FORTH, Greece
Vasilis Katos, Bournemouth University, UK
Sotiris Nikoletseas, University of Patras, Greece
David Langley, University of Groningen & TNO, the Netherlands
Technical Programme Committee can be found at:
https://sites.google.com/view/smace2020/committees
--
Dr. Constantinos Marios Angelopoulos
Principal Academic
Bournemouth University
Future & Complex Networks Research Group (FlexNet)
Programme Leader MSc IoT; IoT w. Cybersecurity; IoT w. Data Analytics
Phone: +44 (0) 1202 967189
Skype: aggeloko
WEB: http://staffprofiles.bournemouth.ac.uk/display/mangelopoulos
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
Due to the health pandemic, SmaCE'20 will be held virtually, without
physical gathering. Still, accepted papers will be included in the IEEE
Proceedings, as planned. Extended deadlines for submissions and
camera-ready versions are provided. Reduced registration fees will
apply. Detailed information will follow soon.
CALL FOR PAPERS
------------------------------------------------------------------------------------------------------------------
2nd IEEE Workshop on Smart Circular Economy
https://sites.google.com/view/smace2020/home
*To be held virtually*
In conjuction with the
16th International Conference on Distributed Computing in Sensor Systems
IEEE DCOSS 2020 - https://www.dcoss.org
-------------------------------------------------------------------------------------------------------------------
Important Dates
==========
Paper Submission Deadline: May 10, 2020
Acceptance Notification: June 3, 2020
Camera Ready Submission Deadline: June 10, 2020
Early Registration Deadline: TBC
Workshop Dates: The event will be virtual - details to follow
*Accepted papers will appear in IEEE Xplore.*
Scope
====
Circular Economy is a paradigm for sustainable growth that envisions the
transformation of how modern societies design, produce and consume goods
and services towards a regenerative economic cycle. Future and emerging
technologies, such as 5G, the blockchain, and crowdsourced sensing
systems, along with innovative models and paradigms, such as the
Internet of Things, Industry 4.0, and community networks, will play an
important role in the transition to Circular Economy by enabling and
facilitating, among others, digitization (efficient asset management,
open data, etc.) and collaboration (co-innovation, shared value
creation, etc.).
Smart Circular Economy is an international inter-disciplinary workshop
focusing on the role of ICT as an enabler for Circular Economy. This
workshop will bring together scientists, researchers as well as relevant
stakeholders from the industry and local communities to share and
exchange their experiences, discuss challenges, and report
state-of-the-art and in-progress research lying in the intersection of
ICT and Circular Economy.
Accepted and presented papers will be included in the same proceedings
volume as the IEEE DCOSS 2020 proceedings, listed in all major
publication indexes (IEEE Xplore, DBLP, Scopus, etc)
Topics
======
SmaCE is an inter-disciplinary event accepting papers in the disciplines
of Computer Science, Economics and Business. Topics of interest include,
but are not limited to:
- Architectures for collecting and curating data generated by
distributed, heterogeneous smart assets.
- Technology enablers for Circular Economy - Internet of Things, 5G,
Software Defined Networks, Big Data, Analytics, Machine Learning, Neural
Networks and other.
- Smart Infrastructure - Smart Grid, Utility Networks (water, gas,
waste, etc.), Transport Networks and other.
- Crowdsensing, Internet of Things and Participatory Sensing,
Crowdsourced Systems and Architectures
- The Blockchain and other Distributed Ledger Technologies for Smart
Circular Economy -asset tracking, smart contracts, micro-transactions,
etc.
- In-depth case studies illustrating Circular Economy performance and
efficiency in terms of people, the planet and profit.
- Sharing economy and resale markets.
- Peer-to-peer and ad-hoc markets.
- Applications of Smart Circular Economy technologies in verticals such
as healthcare, transportation, energy, citizen safety, and other.
- Interdependency between Digital and Physical Networks; e.g.
communication and utility networks.
- Data-driven business models, Open Innovation, Co-creation and shared
value creation
- RFID, NFC and other technologies for asset management
- Low-Power Networks - LoRa, SigFox, NB-IoT, IPv6-enabled IoT,
Industrial IoT
- Smart services and service provisioning
- Requirements engineering for Circular Economy
- Security, Privacy and Trust for Smart Circular Economy
Sponsors
===============
EU H2020 projects:
- CE-IoT (https://www.ce-iot.eu/)
- Ideal-Cities (https://www.ideal-cities.eu/) and
- Semiotics (https://www.semiotics-project.eu/).
Submission & Proceedings
===============
Accepted and presented papers will be included in the same proceedings
volume as the IEEE DCOSS 2020 proceedings, listed in all major
publication indexes (IEEE Xplore, DBLP, Scopus, etc).
Submitted papers must be prepared in English (UK or US spelling),
following the IEEE two-column Manuscript Templates for Conference
Proceedings (available here) with a maximum length of eight (8) printed
pages including text, figures, and references. Authors may add at most
two (2) pages, but only for an appendix, i.e. these two pages contain
supplementary material only. The additional two pages will incur
overlength charges at 100USD/page. Note that the Workshop follows a
single-blind review policy.
The names and affiliations of all the authors must be presented in the
submitted manuscript. No-show papers submitted by authors who did not
present the paper in-person will not be included in the workshop
proceedings. No refund of the paid fees can be claimed by the no-show
authors. Presentations by proxies are not allowed, unless explicitly
approved by the organisers.
Organizing Committee
====================
[General Chair]
Marios Angelopoulos, Bournemouth University, UK
contact: mangelopoulos@bournemouth.ac.uk
[Technical Program Co-Chairs]
Giorgos Demetriou, Ecole des Ponts Business School, France
Sotiris Ioannidis, FORTH, Greece
Vasilis Katos, Bournemouth University, UK
Sotiris Nikoletseas, University of Patras, Greece
David Langley, University of Groningen & TNO, the Netherlands
Technical Programme Committee can be found at:
https://sites.google.com/view/smace2020/committees
--
Dr. Constantinos Marios Angelopoulos
Principal Academic
Bournemouth University
Future & Complex Networks Research Group (FlexNet)
Programme Leader MSc IoT; IoT w. Cybersecurity; IoT w. Data Analytics
Phone: +44 (0) 1202 967189
Skype: aggeloko
WEB: http://staffprofiles.bournemouth.ac.uk/display/mangelopoulos
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
Saturday, March 21, 2020
[DMANET] Wi-DroIT 2020 – 2nd International Workshop on Wireless Drones over Internet of Things
Wi-DroIT 2020 – 2nd International Workshop on Wireless Drones over Internet
of Things
of Things
May 25-27, 2020
Due to the pandemic, DCOSS 2020 Workshops will be held in an online manner,
without physical attendance. Still, all accepted papers will be included in
the IEEE Proceedings as planned, in the same volume with the main event.
Reduced registration fees will apply.
Link: https://sites.google.com/view/widroit2020
in conjunction with the:
16th International Conference on Distributed Computing in Sensor Systems
(DCOSS 2020)
Workshop papers will get 8 pages in the IEEE proceedings, in the same
volume with the DCOSS papers.
Important Dates
Submission: April 30, 2020
Notification: May 30, 2020
Camera Ready: June 10, 2020
In the last few years, Unmanned Autonomous Vehicles (UAVs), have developed
rapidly and have been used for emergent applications that range from
inspection, surveillance, agriculture, cargo delivery, and communications.
The symbiosis between UAVs and Wireless Sensor Networks (WSNs) started
quite naturally: UAVs perform remote sensing, act as data-mule that carry
the data collected by the WSN. Evolving WSN in Internet of Things (IoT)
devices, single or multiple Drones/UAVs can cooperatively provide services
that require efficient protocols where multiple objectives and constraints
should be accounted.
For this workshop, we search for papers that combine design of algorithms,
optimization, and test-bed to develop the theoretical foundations for the
UAV systems operating in symbiosis with WSN in IoT applications. The
numerous emergent applications nurtured by IoT may require an
interdisciplinary approach, involving techniques from algorithm foundations
and different areas, such as robotics, artificial intelligence,
mathematical modeling, machine learning. Possible topics are:
Autonomous WSN via Drones
Topology monitoring of WSN with Drones
Build Remote Sensing Networks via Drones
Communication architectures and protocols of Drones over IoT
Modeling and analysis of Drone systems over IoT
Precision Agriculture
Monitoring crops
Controlling bugs in Agriculture
Drones for environment monitoring
Autopilot and UAS autonomy
UAV mission planning, path planning, and scheduling
Parcel delivery using Drones
4G-5G networks and UAVs
Constraints and multiobjective optimization problems in UAVs
Ground Localization with Drones
Cooperative control of multiple UAVs
UAV secure communication techniques
Optimal UAV deployment strategies
Experimental results, simulators and test beds for drone networks
Single UAV Applications
Multi-UAV Applications
Human Rights and Drones
Authors are invited to submit original unpublished manuscripts that
demonstrate current research on distributed sensor systems related to
Wi-DroIT topics of interest. Please use the US letter size (8.5 X 11 in)
standard IEEE conference LaTeX format or Microsoft Word template available
on the link below:
http://www.ieee.org/conferences_events/conferences/publishing/templates.html
All submissions should be written in English and submitted as a full paper.
Full papers should have a maximum of eight (8) printed pages including
figures and references. Full papers are expected to describe fully
developed ideas with a thorough evaluation.
Note that Wi-DroIT does not follow the double-blind review policy. The
names and affiliations of all the authors must be present in the submitted
manuscript.
Program Chairs
Wan Du, UC Merced, CA, USA
Enrico Natalizio, University of Lorraine/LORIA, France
Cristina M. Pinotti, University of Perugia, Italy
Program Committee
Kaikai Liu, San Jose State University, USA
Shijia Pan, University of California, Merced, USA
Paolo Barsocchi, ISTI-CNR Pisa, Italy
Stefano Carpin, University of California, Merced, USA
Marco Levorato, University of California, Irvine, USA
Tathagata Mukkerjee, The University of Alabama in Huntsville, USA
Daniele Palossi, ETH Zurich, Switzerland
Anil Shende, Roanoke College, USA
Francesco Betti Sorbelli, Missouri S&T University, USA
Farshad Ghanei, University at Buffalo, USA
Vijay Shah, Wireless@Virginia Tech, USA
Ajay Pratap, Missouri S&T University, USA
Simone Silvestri, University of Kentucky, USA
Nirnay Ghosh, IIEST, Shibpur, India
Nicola Roberto Zema, University of Paris-Saclay, France
Angelo Trotta, University of Bologna, Italy
Abolfazl Razi, Northern Arizona University, USA
Dimitrios Zorbas, Tyndall National Institute, Ireland
Lars Wolf, T.U. Braunschweig, Germany
Panagiotis Sarigiannidis, University of Western Macedonia (UOWM),
Greece
Ing-Ray Chen, Virginia Tech, USA
Contact
Francesco Betti Sorbelli, Missouri Science and Technology University,
Rolla, MO, USA; francesco.bettisorbelli@mst.edu
**********************************************************
*
* 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 SmartSys 2020 -- COVID-19 UPDATES AND DEADLINE EXTENSION
We are aware of the rapidly evolving COVID-19 situation around the world,
and jointly with the other conference organizers we are considering all the
possible options including remote presentation, changing the conference
dates or relocating the conference to another location.
and jointly with the other conference organizers we are considering all the
possible options including remote presentation, changing the conference
dates or relocating the conference to another location.
For this reason, we decided to postpone the submission deadline to April 5,
while we kindly ask authors to register their Abstract by March 22.
Please see the following announcement that was recently made at the main
conference website as well:
"The committee is aware of the COVID-19 situation and considering all the
alternative options. We are considering to permit remote
participation/presentation to the conference, postponing the conference to
the autumn or moving the conference to another location, in case unsafe
travel conditions to Italy still persist."
CALL FOR PAPERS - IEEE SmartSys 2020
5th IEEE Workshop on Smart Service Systems (SmartSys)
Co-located with the IEEE International Conference on Smart Computing
(SMARTCOMP 2020)
Bologna, Italy, June 22, 2020
http://www.iet.unipi.it/smartsys2020/
Technology succeeds when it provides benefits to the society either
directly or indirectly. Understanding the societal and economic impact and
human-centered aspects of a smart system or technology in advance and
designing the system a-priori with potential value-added services help spur
the discoveries of new tools, methodologies and innovative services. Smart
service systems span across a variety of socio-technical facets comprising
devices, people, organizations, environments and technologies to sense,
actuate, control and assess the physical, cyber and societal artifacts of
the human service systems. Besides the systems being self-adaptive and
fault-tolerant, it needs to be designed in such a way that it can
continuously increase the quality and productivity, the compliance and
sustainability of the smart services it offers. While human-centered
perspective and cognitive learning help create multi-facet value-added
services and catalyze the sustained economic growth of smart service
systems, understanding the multi-modal sensing, control, heterogeneity and
interdependency between different physical, virtual and logical components
of such a complex system will enable the realization of new transformative
smarter service systems. If successful, this can help improve the
quality-of-service of the customers, quality-of-life of the citizens and
quality-of returns of the stakeholders and investors.
Nurturing the development of smart service systems seeks for inter- and
trans-disciplinary crosscutting research threads from system and
operational engineering, computer science and information systems, social
and behavioral science, computational modeling and industrial engineering
etc. The goal of this workshop is to bring together practitioners and
researchers from both academia and industry in order to have a forum for
discussion and technical presentations on the fundamental knowledge and
principles of smart service systems that enable the value co-creation in
sensing, actuating, data analytics, learning, cognition, and control of
human centric cyber-physical-social systems and future of work.
Research contributions are solicited in all areas pertinent to smart human
services and systems, including:
• Innovative technologies, tools, methodologies and solutions for smart
service systems; example includes personalized healthcare, smart energy,
smart cities, smart manufacturing, intelligent transportation, education,
precision medicine and agriculture, national security etc.
• Information extraction and interpretation from sensors, actuators, smart
phones, smart watch, and human
• Context and situational-awareness of smart service systems
• Design of people-centric services and technologies for providing better
services such as food, transportation and places to live
• Novel architectures and interoperable solutions for internet of things
• Models and methodologies for designing complex smart systems
• Big data analytics approaches for innovative smart services
• Modeling, analysis, co-production, and co-evolution of human activity,
behavior and interaction for the effective adaptation and percolation of
longitudinal smart service systems
• Role of machine learning, artificial intelligence, robotics, pervasive
computing, control theory, information and communications technologies
• Role of formal methods in computer networks, cyber-physical systems,
Internet-of-Things and machine learning
• Design and developments of intelligent systems, intelligent enterprises
and cyber-physical-social-systems
• Design of inter-dependent complex global systems such as healthcare,
smart gird, computer networks, logistics and supply-chains, financial
markets etc.
• Smart infrastructure and testbed to support the integration and test of
autonomous systems and innovative applications
Important Dates
Abstract registration: March 22, 2020
Paper submission (extended): April 5, 2020
Notification: April 20, 2020
Camera Ready: April 30, 2020
Workshop Date: June 22, 2020
Organizing Committees
*Workshop Co-Organizers*
Nirmalya Roy, University of Maryland, Baltimore County
Carlo Vallati, University of Pisa
Gurdip Singh, Syracuse University
Sajal Das, Missouri University of Science and Technology
*Technical Program Co-Chairs:*
Antonio Virdis, University of Pisa, Italy
Maryam Rahnemoonfar, University of Maryland, Baltimore County
*Publicity Co-chairs*
Carlo Puliafito, University of Pisa, Italy
Junfei Xie, San Diego State University
*Technical Program Committee*
Pietro Cassarà, ISTI-CNR
Aryya Gangopadhyay, University of Maryland Baltimore County (UMBC)
Alberto Gotta, ISTI-CNR
Marco Gramaglia, Universidad Carlos III de Madrid
Jason Hallstrom, Florida Atlantic University
Francesco Longo, Universita di Messina
Benjamin Mandler, IBM Haifa Research Lab
Simon Mayer, University of St. Gallen
Dr. Francesco Restuccia, Northeastern University
Francesca Righetti, University of Pisa
Olga Saukh, TU Graz / CSH Vienna
Corinna Schmitt, Universität der Bundeswehr München, Research Center CODE
Marco Tiloca, RISE Research Institutes of Sweden
Junfei Xie, San Diego State University
Publicity Co-Chair
**********************************************************
*
* 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] ESA 2020 Call for papers
ESA 2020 Call for papers
The 28th Annual European Symposium on Algorithms
September 7-9, 2020, Pisa, Italy
http://algo2020.di.unipi.it/ESA2020/index.html
The 28th Annual European Symposium on Algorithms
September 7-9, 2020, Pisa, Italy
http://algo2020.di.unipi.it/ESA2020/index.html
OVERVIEW
The European Symposium on Algorithms (ESA) is one of the premier
conferences on algorithms. It is organized in collaboration with the
European Association for Theoretical Computer Science (EATCS) and is a part
of ALGO 2020 (http://algo2020.di.unipi.it/).
The symposium seeks original algorithmic contributions for problems with
relevant theoretical and/or practical applications. Papers with a strong
emphasis on the theoretical analysis of algorithms should be submitted to
Track A, while papers reporting on the results of extensive experimental
evaluations and/or providing original contributions to the engineering of
algorithms for practical applications should be submitted to Track B.
There will be a Best Student Paper Award as well as a Best Paper Award,
both sponsored by EATCS. In order for a paper to be considered for the Best
Student Paper Award, all of its authors are required to be students.
TOPICS
Papers presenting original research in all areas of algorithmic research
are sought, including but not limited to:
- Algorithm engineering
- Algorithmic aspects of networks
- Algorithmic game theory
- Approximation algorithms
- Computational biology
- Computational finance
- Computational geometry
- Combinatorial optimization
- Data compression
- Data structures
- Databases and information retrieval
- Distributed and parallel computing
- Graph algorithms
- Hierarchical memories
- Heuristics and meta-heuristics
- Mathematical programming
- Mobile computing
- Online algorithms
- Parameterized algorithms
- Pattern matching
- Quantum computing
- Randomized algorithms
- Scheduling and resource allocation problems
- Streaming algorithms
SUBMISSION AND PROCEEDINGS
Papers should be submitted electronically via the EasyChair submission
system.
Track A: https://easychair.org/my/conference?conf=esa2020tracka
Track B: https://easychair.org/conferences/?conf=esa2020trackb
ESA 2020 proceedings will be published in the Leibniz International
Proceedings in Informatics (LIPIcs) series, based at Schloss Dagstuhl. The
proceedings chair is Grzegorz Herman, Jagiellonian University, Poland.
SUBMISSION GUIDELINES
Authors are invited to submit an extended abstract or full paper of at
most 11 pages excluding the title page, references, and an optional
appendix. The submission should be typeset using a 10-point or larger
font in a single-column format with ample spacing throughout and 2cm
margins all around on A4-size paper. We recommend, but not strictly
require, making your initial submission adhere to LIPIcs publication
guidelines. Proofs omitted due to space constraints must be placed in
an appendix. This appendix can even comprise an entire full version of
the paper. The appendix will be read by the program committee members
at their discretion. In particular, appendices of accepted papers are
not going to be published in the proceedings. The main part of the
submission should therefore contain a clear technical presentation of
the merits of the paper, including a discussion of the paper's
importance within the context of prior work and a description of the
key technical and conceptual ideas used to achieve its main claims.
These guidelines are strict: submissions deviating significantly from
these guidelines risk being rejected without consideration of their
merits. Papers should be submitted electronically via the EasyChair
submission system. Results previously published (or scheduled for
publication) in another conference proceedings or journal will not be
accepted at ESA. Simultaneous submission to other conferences with
published proceedings, or to both tracks of ESA 2020, is also not
permitted. By submitting a paper the authors acknowledge that in case
of acceptance, at least one of the authors must register at ALGO 2020
or ESA 2020, attend the conference, and present the paper.
DOUBLE-BLIND REVIEWING
The conference will employ a lightweight double-blind reviewing
process. Submissions should not reveal the identity of the authors in
any way. In particular, authors' names, affiliations, and email
addresses should not appear at the beginning or in the body of the
submission. Authors should ensure that any references to their own
related work is in the third person (e.g., not "We build on our
previous work ..." but rather "We build on the work of ..."). The
purpose of the double-blind reviewing is to help PC members and
external reviewers come to an initial judgment about the paper without
bias, not to make it impossible for them to discover the authors if
they were to try. Nothing should be done in the name of anonymity that
weakens the submission or makes the job of reviewing the paper more
difficult. In particular, important references should not be omitted
or anonymized. In addition, authors should feel free to disseminate
their ideas or draft versions of their paper as they normally would.
For example, authors may post drafts of their papers on the web,
submit them to arXiv, and give talks on their research ideas. In case
there exist publicly available versions of the submission online, the
authors might mention this in their submission (without providing
references/links), and briefly explain the differences if any.
Alternatively, they might communicate the details to the chairs, who
will keep them confidential unless revealing them to the PC is needed
for a fair judgment. Authors with further questions on double-blind
reviewing are encouraged to contact the PC chairs.
COVID-19
The Organization Committee (OC) is committed to ALGO 2020 and aware of
the pandemic situation for the COVID-19 outbreak, announced by the
World Health Organization. As already happened for other conferences,
the OC is preparing backup plans such as moving the events or
(partially) running them in a virtual way. What is most important is
that the scientific activity of the Programme Committees of the ALGO
conferences is not suspended or stopped: peer review, accepted papers,
camera ready and proceedings will be accomplished as usual. As for the
talks and the participation, the health and safety of our community is
our priority: attending and giving the talks will be safe, and virtual
presence will be possible in case of remaining safety concerns or
travel restrictions.
IMPORTANT DATES
- Submission deadline: April 24, 2020 (23:59 AoE)
- Notification deadline: June 18, 2020
- Final version deadline: June 28, 2020
- ESA Symposium: September 7-9, 2020
PROGRAM COMMITTEE: TRACK A (DESIGN AND ANALYSIS)
Amir Abboud, IBM Almaden Research Center
Gregory Bodwin, Georgia Tech
Karl Bringmann, MPII
Deeparnab Chakrabarty, Dartmouth College
Daniel Dadush, CWI
Michael Elkin, Ben-Gurion University of the Negev
Leah Epstein, University of Haifa
Manuela Fisher, ETHZ
Fabrizio Frati, Roma Tre University
Fabrizio Grandoni (chair), IDSIA
Kasper Green Larsen, Aarhus University
Jacob Holm, University of Copenhagen
Michael Kapralov, EPFL
Petteri Kaski, Aalto University
Telikepalli Kavitha, TIFR
Tomasz Kociumaka, Bar-Ilan University
Moshe Lewenstein, Bar-Ilan University
Shi Li, University at Buffalo
Yury Makarychev, TTIC
Krzysztof Onak, IBM T.J. Watson Research Center
Seth Pettie, University of Michigan
Marcin Pilipczuk, University of Warsaw
Thomas Rothvoss, University of Washington
Laura Sanità, University of Waterloo
Saket Saurabh, Institute of Mathematical Sciences
Chris Schwiegelshohn, Sapienza University of Rome
Vera Traub, ETHZ
Carmine Ventre, King's College London
David Wajc, Carnegie Mellon University
Andreas Wiese, Universidad de Chile
David P. Woodruff, Carnegie Mellon University
Meirav Zehavi, Ben-Gurion University of the Negev
PROGRAM COMMITTEE: TRACK B (ENGINEERING AND APPLICATIONS)
Armin Biere, Linz University
Maike Buchin, Bochum University
Markus Chimani, University of Osnabrück
Irene Finocchi, LUISS University, Rome
Travis Gagie, Dalhousie University
Rolf Niedermeier, TU Berlin
Kunihiko Sadakane, University of Tokyo
Peter Sanders (chair), KIT Karlsruhe
Yihan Sun, UC Riverside
Sivan Toledo, Tel-Aviv University
Jesper Träff, TU Vienna
Renato Werneck, Amazon
STEERING COMMITTEE
Yossi Azar (2017-2020), Tel-Aviv University
Hannah Bast (2017-2020, chair 2018-), Albert-Ludwigs-Universität Freiburg
Michael Bender (2018-2021), Stony Brook University
Artur Czumaj (2015-2019), University of Warwick
Fabrizio Grandoni (2019-2022), IDSIA, USI-SUPSI
Monika Henzinger (2016-2020), Universität Wien
Robert Krauthgamer (2017-2021), The Weizmann Institute of Science
Aleksander Madry (2015-2019), MIT
Peter Sanders (2019-2022), Karlsruhe Institute of Technology
Ola Svensson (2018-2021), EPFL Lausanne
**********************************************************
*
* 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, March 20, 2020
[DMANET] Online Colloquium--Maria Chudnovsky--save the date
Please save the date for the following up-coming Virtual Combinatorics
Colloquium. We will send a poster and the zoom link shortly. Individuals
and viewing party groups from around the world can "attend" these online
talks and interact with the speaker and other attendees remotely via Zoom.
Past VCC presentations, which may be of interest for online courses, may
be found here:
https://sites.google.com/view/northeastcombinatoricsnetwork/virtual-combinatorics-colloquium/past-vccs
Colloquium. We will send a poster and the zoom link shortly. Individuals
and viewing party groups from around the world can "attend" these online
talks and interact with the speaker and other attendees remotely via Zoom.
Past VCC presentations, which may be of interest for online courses, may
be found here:
https://sites.google.com/view/northeastcombinatoricsnetwork/virtual-combinatorics-colloquium/past-vccs
*Date: *Tuesday, 7 April 2020
*Time*: 2:00 p.m. (14:00) Eastern Daylight Time
*Speaker: *Maria Chudnovsky, Princeton University
*Zoom link: *(Will be provided in the next announcement)
*Title:* RECENT PROGRESS ON THE ERDOS-HAJNAL CONJECTURE
*Abstract: *What is the effect of excluding an induced subgraph on the
global structure of a graph? While there do not seem to be general
structural consequences, a conjecture of Erdos and Hajnal states that
graphs with forbidden induced subgraphs behave very differently from
general graphs; more precisely they contain much larger cliques or stable
sets. This conjecture is still open. In this talk we will discuss the
history of this problem and some recent theorems related to it.
*Jo*
Jo Ellis-Monaghan
Chair, Department of Mathematics and Statistics (on sabbatical 2019-2020)
Editor-in-Chief, PRIMUS
Saint Michael's College
One Winooski Park
Colchester, VT 05439
office: Jeanmarie 279
website: http://academics.smcvt.edu/jellis-monaghan/
phone: 802 654 2660
fax: 802 654 2960
e-mail: je <jellis-monaghan@smcvt.edu>llismonaghan@gmail.com
<llismonaghan@gmail.com>
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
[DMANET] Special Issue on Algorithms for complex network and its applications
Dear Colleagues,
CALL FOR PAPERS
Algorithms
https://www.mdpi.com/journal/algorithms/special_issues/complex_network
Submission Deadline: 15 September 2020
*********
Manuscripts can be submitted continuously until the deadline. Once a paper is submitted, the review process will start immediately. Accepted papers will be published continuously in the journal. All accepted papers will be listed together in an online special issue published in the journal website.
*********
Network science has become an important and growing field in today's society as many sectors using information technology, wireless communications, big data, and the Internet of Things are formed by a large number of interacting components and underpinned with self-organizing principles. The need to understand algorithms underlying complex networks, large-scale structures, and the dynamics governing them is imperative. In this Special Issue we invite authors to submit high-quality papers from both theoretical/mathematical and practical points of view addressing algorithm-related problems arising from complex networks. Some of the topics of interest include (but are not limited to):
Algorithms for random structure
Combinatorial algorithms
Complex network analysis
Network visualization
Community detection algorithms
Web analytics
Artificial intelligence
Sensor networks
Social network analysis
Biological network analysis
Algorithms for wireless networks
Simulation for complex networks
Network synchronization algorithms
Distributed algorithms
Optimization algorithms
Guest Editors
Joanna Józefowska, Poznan University of Technology, Poznan, Poland
Yilun Shang, Northumbria University, Newcastle upon Tyne, UK
*** Instructions for submission ***
Manuscripts should be submitted online at www.mdpi.com by registering and logging in to this website. Once you are registered, click here to go to the submission form. Manuscripts can be submitted until the deadline. All papers will be peer-reviewed. Accepted papers will be published continuously in the journal (as soon as accepted) and will be listed together on the special issue website. Research articles, review articles as well as short communications are invited. For planned papers, a title and short abstract (about 100 words) can be sent to the Editorial Office for announcement on this website.
Submitted manuscripts should not have been published previously, nor be under consideration for publication elsewhere (except conference proceedings papers). All manuscripts are thoroughly refereed through a single-blind peer-review process. A guide for authors and other relevant information for submission of manuscripts is available on the Instructions for Authors page. Algorithms is an international peer-reviewed open access monthly journal published by MDPI.
Please visit the Instructions for Authors page before submitting a manuscript. The Article Processing Charge (APC) for publication in this open access journal is 1000 CHF (Swiss Francs). Submitted papers should be well formatted and use good English. Authors may use MDPI's English editing service prior to publication or during author revisions.
For further information, please contact the guest editors at
Joanna.Jozefowska@cs.put.poznan.pl
yilun.shang@northumbria.ac.uk
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
CALL FOR PAPERS
Algorithms
https://www.mdpi.com/journal/algorithms/special_issues/complex_network
Submission Deadline: 15 September 2020
*********
Manuscripts can be submitted continuously until the deadline. Once a paper is submitted, the review process will start immediately. Accepted papers will be published continuously in the journal. All accepted papers will be listed together in an online special issue published in the journal website.
*********
Network science has become an important and growing field in today's society as many sectors using information technology, wireless communications, big data, and the Internet of Things are formed by a large number of interacting components and underpinned with self-organizing principles. The need to understand algorithms underlying complex networks, large-scale structures, and the dynamics governing them is imperative. In this Special Issue we invite authors to submit high-quality papers from both theoretical/mathematical and practical points of view addressing algorithm-related problems arising from complex networks. Some of the topics of interest include (but are not limited to):
Algorithms for random structure
Combinatorial algorithms
Complex network analysis
Network visualization
Community detection algorithms
Web analytics
Artificial intelligence
Sensor networks
Social network analysis
Biological network analysis
Algorithms for wireless networks
Simulation for complex networks
Network synchronization algorithms
Distributed algorithms
Optimization algorithms
Guest Editors
Joanna Józefowska, Poznan University of Technology, Poznan, Poland
Yilun Shang, Northumbria University, Newcastle upon Tyne, UK
*** Instructions for submission ***
Manuscripts should be submitted online at www.mdpi.com by registering and logging in to this website. Once you are registered, click here to go to the submission form. Manuscripts can be submitted until the deadline. All papers will be peer-reviewed. Accepted papers will be published continuously in the journal (as soon as accepted) and will be listed together on the special issue website. Research articles, review articles as well as short communications are invited. For planned papers, a title and short abstract (about 100 words) can be sent to the Editorial Office for announcement on this website.
Submitted manuscripts should not have been published previously, nor be under consideration for publication elsewhere (except conference proceedings papers). All manuscripts are thoroughly refereed through a single-blind peer-review process. A guide for authors and other relevant information for submission of manuscripts is available on the Instructions for Authors page. Algorithms is an international peer-reviewed open access monthly journal published by MDPI.
Please visit the Instructions for Authors page before submitting a manuscript. The Article Processing Charge (APC) for publication in this open access journal is 1000 CHF (Swiss Francs). Submitted papers should be well formatted and use good English. Authors may use MDPI's English editing service prior to publication or during author revisions.
For further information, please contact the guest editors at
Joanna.Jozefowska@cs.put.poznan.pl
yilun.shang@northumbria.ac.uk
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
Thursday, March 19, 2020
[DMANET] New Springer Book: Optimal Districting and Territory Design (2020)
Dear Colleague,
I would like to bring to your attention the release of the edited book:
"Optimal Districting and Territory Design" (2020), Springer,
ISBN: 978-3-030-34311-8,
which is available at: https://www.springer.com/gp/book/9783030343118
Please take a look and feel free to share among your students
and colleagues.
I hope you find it useful and valuable.
Kind regards,
rz
--
//------------------------------------------
// Roger Z. Rios, PhD
// Graduate Program in Systems Engineering
// U A N L
// roger [at] yalma.fime.uanl.mx
// http://yalma.fime.uanl.mx/~roger/
//------------------------------------------
**********************************************************
*
* 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/
*
**********************************************************
I would like to bring to your attention the release of the edited book:
"Optimal Districting and Territory Design" (2020), Springer,
ISBN: 978-3-030-34311-8,
which is available at: https://www.springer.com/gp/book/9783030343118
Please take a look and feel free to share among your students
and colleagues.
I hope you find it useful and valuable.
Kind regards,
rz
--
//------------------------------------------
// Roger Z. Rios, PhD
// Graduate Program in Systems Engineering
// U A N L
// roger [at] yalma.fime.uanl.mx
// http://yalma.fime.uanl.mx/~roger/
//------------------------------------------
**********************************************************
*
* 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] Scottish Combinatorics Meeting and Postgraduate Combinatorics Meeting - Postponed
Due to the COVID-19 situation, both the Scottish Combinatorics Meeting and Postgraduate Combinatorics Meeting will be postponed. We plan that both events will be again co-located in Glasgow in April 2021; more details will follow in due course.
---
Kitty Meeks
Royal Society of Edinburgh Research Fellow
School of Computing Science, University of Glasgow
http://www.dcs.gla.ac.uk/~kitty/
Direct line: +44 (0)141 330 1631
**********************************************************
*
* 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/
*
**********************************************************
---
Kitty Meeks
Royal Society of Edinburgh Research Fellow
School of Computing Science, University of Glasgow
http://www.dcs.gla.ac.uk/~kitty/
Direct line: +44 (0)141 330 1631
**********************************************************
*
* 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] Senior Lecturere Position in Austria, Leoben
Senior Lecturere Position in Austria, Leoben
We would need a Senior lecturer, the topic is Optimization/Operations
Research. Knowledge of German (fluently) is necessary!
You may find details on
http://napps1.unileoben.ac.at/napps/public/mbl.nsf/ansicht%2002/147462BE3EAE8CEBC12585200032E9EB?OpenDocument
Deadline: End of march!
If you have any question, please contact erika.hausenblas@unileoben.ac.at.
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
We would need a Senior lecturer, the topic is Optimization/Operations
Research. Knowledge of German (fluently) is necessary!
You may find details on
http://napps1.unileoben.ac.at/napps/public/mbl.nsf/ansicht%2002/147462BE3EAE8CEBC12585200032E9EB?OpenDocument
Deadline: End of march!
If you have any question, please contact erika.hausenblas@unileoben.ac.at.
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
[DMANET] CANCELLED: Summer School on Modern Optimization for Transportation, June 1-5, 2020, Fréjus (French Riviera)
We regret to announce that, due to the coronavirus, we have to cancel the summer school on Modern Optimization for Transportation, which was supposed to be held on June 1 - 5, 2020 in Fréjus (French Riviera).
Registered participants will be contacted by the organizers.
Informations are available on the summer school website: http://cermics.enpc.fr/~parmenta/events/frejus2020/summerSchoolModernOptimForTransport.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/
*
**********************************************************
Subscribe to:
Posts (Atom)
Posts
