Monday, April 6, 2020

[DMANET] EATCS-IPEC Nerode Prize - Final Call for Nominations

EATCS-IPEC Nerode Prize - Call for Nominations
Deadline: April 15, 2020

The EATCS-IPEC Nerode Prize for outstanding papers in the area of multivariate algorithmics, is presented annually with the presentation taking place at IPEC (International Symposium on Parameterized and Exact Computation). IPEC 2020 takes place within ISAAC 2020, December 14-16, 2020, Hong Kong. The Prize is named in honor of Anil Nerode in recognition of his major contributions to mathematical logic, theory of automata, computability and complexity theory.


Award Committee

The winning paper(s) will be selected by the EATCS-IPEC Nerode Prize Award Committee. This year's committee consists of the following people.

Hans L. Bodlaender (Chair, Utrecht University, h.l.bodlaender@uu.nl),
Anuj Dawar (University of Cambridge, anuj.dawar@cl.cam.ac.uk)
Virgi V. Williams (MIT, virgi@mit.edu).
Deadline for Nominations: April 15, 2020. (Original deadline: March 15, 2020.)

Decision: June 15, 2020.

The Award Committee is solely responsible for the selection of the winner of the award which may be shared by more than one paper or series of papers. The Award Committee reserves the right to declare no winner at all.

Eligibility

Any research paper or series of research papers by a single author or by a team of authors published in a recognized refereed journal. The research work nominated for the award should be in the area of multivariate algorithms and complexity meant in a broad sense, and encompasses, but is not restricted to those areas covered by IPEC. The Award Committee has the ultimate authority to decide on the eligibility of a nomination. Papers authored by a member of the Award Committee are not eligible for nomination.

Note that the past restrictions that require a certain number of years before/after the publication of the nominated papers have been removed.

Nominations

Nominations may be made by any member of the scientific community including the members of the Award Committee. A nomination should contain a brief summary of the technical content of each nominated paper and a brief explanation of its significance. Nominations are done by an email to the Award Committee Chair with copies to the members of the committee. The Subject line of the nomination E-mail should contain the group of words "Nerode Prize Nomination".

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

Sunday, April 5, 2020

[DMANET] Permanent Lecturer Position at Freie Universität Berlin

The Department of Computer Science at Freie Universität Berlin announces

one lecturer position (100% TV-L E13, permanent)

in theoretical computer science.

The main tasks are
- to teach basic Bachelor classes in mathematics for computer science
(discrete mathematics and probability theory, analysis, linear algebra)
and in computer science for majors in other fields (bioinformatics,
business informatics, mathematics, physics, etc)
- to advise Bachelor and Master theses in computer science
- to participate in administrative tasks

The main requirements are
- a PhD and research experience in Computer Science or a related field
- experience in teaching undergraduate computer science
- fluency in German (all undergraduate teaching at FU Berlin takes place
in German)

The detailed announcement with instructions for the application can be
found here (in German):
https://www.fu-berlin.de/universitaet/beruf-karriere/jobs/wiss/19_fb-mathematik-und-informatik/MI-DauerWiMi1_Inf_2020_-DauerWimi2_Inf_2020.html

If you have further questions about the position, please send an email
to mulzer[at]inf.fu-berlin.de .

The application deadline is 27. April 2020.


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

[DMANET] QBF 2020 - Call for papers

CALL FOR PAPERS

QBF 2020
--------
International Workshop on
Quantified Boolean Formulas and Beyond

Alghero, Italy, July 5, 2020
https://www.ac.tuwien.ac.at/qbf2020

Affiliated to and co-located with:
Int. Conf. on Theory and Applications
of Satisfiability Testing (SAT 2020)
July 5-9, 2020, Alghero, Italy

** The workshop/conference organization is monitoring the COVID-19
situation, and we hope to do our best to support the form of dialogue
that this workshop aims to promote. For now, we would encourage those
interested in submitting to the workshop to proceed in doing so; given
the situation, we plan to give authors of accepted works a chance to
confirm their willingness to participate prior to finalizing this.

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

Quantified Boolean formulas (QBF) are an extension of propositional
logic which allows for explicit quantification over propositional
variables. The decision problem of QBF is PSPACE-complete, compared to
the NP-completeness of the decision problem of propositional logic (SAT).

Many problems from application domains such as model checking, formal
verification or synthesis are PSPACE-complete, and hence could be
encoded in QBF in a natural way. Considerable progress has been made
in QBF solving throughout the past years. However, in contrast to SAT,
QBF is not yet widely applied to practical problems in academic or
industrial settings. For example, the extraction and validation of
models of (un)satisfiability of QBFs has turned out to be
challenging, given that state-of-the-art solvers implement different
solving paradigms.

The goal of the International Workshop on Quantified Boolean Formulas
(QBF Workshop) is to bring together researchers working on theoretical
and practical aspects of QBF solving. In addition to that, it
addresses (potential) users of QBF in order to reflect on the
state-of-the-art and to consolidate on immediate and long-term
research challenges.

The workshop also welcomes work on reasoning with quantifiers in
related problems, such as dependency QBF (DQBF), quantified constraint
satisfaction problems (QCSP), and satisfiability modulo theories (SMT)
with quantifiers.


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

April 24: Submission
May 12: Notification of acceptance
May 28: Final versions of accepted papers due
July 5: Workshop

Please see the workshop webpage for any updates:
https://www.ac.tuwien.ac.at/qbf2020

======================
CALL FOR CONTRIBUTIONS
======================

The workshop is concerned with all aspects of current research on all
formalisms enriched by quantifiers, and in particular QBF. The topics
of interest include (but are not limited to):

Applications, encodings and benchmarks with quantifiers
QBF Proof theory and complexity results
Experimental evaluations of solvers or related tools
Case studies illustrating the power of quantifiers
Certificates and proofs for QBF, QCSP, SMT with quantifiers, etc.
Formats of proofs and certificates
Implementations of proof checkers and verifiers
Decision procedures
Calculi and their relationships
Data structures, implementation details and heuristics
Pre- and inprocessing techniques
Structural reasoning

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

Submissions of extended abstracts are invited and will be managed via
Easychair:

https://easychair.org/conferences/?conf=qbf2020

In particular, we invite the submission of extended abstracts on work
that has been published already, novel unpublished work, or work in
progress.

The following forms of submissions are solicited:

- Proposals for short tutorial presentations on topics related to the
workshop. Tutorial proposals will be reviewed by the PC. The number
of accepted tutorials depends on the overall number of accepted
papers and talks, with the aim to set up a balanced workshop
program.

- Talk abstracts reporting on already published work. Such an abstract
should include an outline of the planned talk, and pointers to
relevant bibliography.

- Talk proposals presenting work that is unpublished or in progress.

- Submissions which describe novel applications of QBF or related
formalisms in various domains are particularly welcome.
Additionally, this call comprises known applications which have been
shown to be hard for QBF solvers in the past as well as new
applications for which present QBF solvers might lack certain
features still to be identified.

Each submission should have an overall length of 1-4 pages in LNCS
format. Authors may decide to include an appendix with additional
material. Appendices will be considered at the reviewers' discretion.

The accepted extended abstracts will be published on the workshop
webpage. The workshop does not have formal proceedings.

Authors of accepted contributions are expected to give a talk at the
workshop.

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

qbf2020@easychair.org

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

Hubie Chen, Birbeck, University of London (co-chair)
Friedrich Slivovsky, Vienna University of Technology (co-chair)
Joshua Blinkhorn, Friedrich-Schiller-Universität Jena
Mikolas Janota, INESC-ID/IST, University of Lisbon
Paqui Lucio, University of the Basque Country
Stefan Mengel, CNRS, CRIL
Tomáš Peitl, Friedrich-Schiller-Universität Jena
Ralf Wimmer, Concept Engineering GmbH & Albert-Ludwigs-Universität Freiburg


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

Friday, April 3, 2020

[DMANET] The Highlights of Logic, Games, and Automata community mailing list

Dear all,

A few months ago we created a mailing list for the Highlights of Logic,
Games, and Automata community:
highlights_community@diff.u-bordeaux.fr
This is the place to post about job openings (including PhD studentships
and research internships), calls for events, and other announcements
relevant to the research community working on Logic, Games, and Automata,
broadly construed.
The list is already more than a hundred members strong.

*Please consider signing up here:*
https://diff.u-bordeaux.fr/sympa/info/highlights_community
or by sending an email to sympa@diff.u-bordeaux.fr with subject line:
subscribe highlights_community Firstname Lastname

The list is moderated to make sure that the emails are pertinent. It is not
meant to be a discussion forum, so only "announcements" will be
disseminated. There are several features offered by the sympa manager,
including: publicly available archives, digests, RSS.

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

[DMANET] PhD studentship in Security, Privacy and Trust, in Luxembourg

Dear colleague,

University of Luxembourg is seeking candidates to fill a PhD studentship broadly in the research area of ``Security and Trust of Software Systems.'' Candidates should hold a master degree in computer science or mathematics.

Start date: From 15 June 2020, negotiable
Terms: full time and fully funded for duration of study
Apply here (CV + research statement required): http://emea3.mrted.ly/2g9oy

This studentship will be conducted in the Security and Trust of Software Systems (SaToSS) group, led by Prof Sjouke Mauw, with co-supervision from an experienced researcher within the research group. The SaToSS group has a track record in producing outstanding researchers, for example the most recent PhD graduate, Jorge Toro-Pozo, received the award for the best thesis of the year in computer science at University of Luxembourg and is now a researcher at ETH Zurich.

More info on SaToSS: https://satoss.uni.lu/members/

PhD thesis topics are not limited to:

1. Privacy in: social networks, ePassports, ePayments, eVoting, blockchains, location-aware services, etc.

2. Security of: multiparty protocols, distance bounding protocols (preventing relay attacks), fair exchange protocols (agreeing on terms of transactions), threat and trust models, Android security, GNSS security, adversarial examples and bias in neural networks and language, hardware-isolation using virtualization, etc.

3. Cyber security risk assessment: using attack trees, of cyber-physical and socio-technical systems, of New Space architectures (e.g., satellite constellations), etc.

The methodology typically applied in the group is to harness (formal) methods and tools to analyse topical security and trust problems such as the above. Methods employed are not limited to various strands of symbolic analysis, concurrency theory, logic, graph theory, and game theory. A master degree in computer science with an security element helps; however a student comfortable proving theorems can generally convert to such topics, if research in security is a new. Specific topics can be provided on request, and can be matched to a strong student's background and interests.

The University of Luxembourg offers highly competitive salaries and is an equal opportunity employer.

For further information, and to discuss the suitability of topics and potential supervisors, please contact Dr. Ross Horne, at ross.horne@uni.lu, or Prof. Dr. Sjouke Mauw, at sjouke.mauw@uni.lu.


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

[DMANET] Online Colloquium--Maria Chudnovsky

*We hope you will join us for the next *Northeast Combinatorics
Network* Virtual
Combinatorics Colloquium!*

Please join us for the following up-coming Virtual Combinatorics
Colloquium. Individuals anywhere in the world can "attend" these online
talks and interact with the speaker and other attendees remotely via Zoom.

*Zoom link: https://smcvt.zoom.us/j/831984515
<https://smcvt.zoom.us/j/831984515> *

*Date: *Tuesday, 7 April 2020

*Time*: 2:00 p.m. (14:00) Eastern Daylight Time

*Speaker: *Maria Chudnovsky, Princeton University

*Title:* RECENT PROGRESS ON THE ERDOS-HAJNAL CONJECTURE

*Abstract: *What is the effect of excluding an induced subgraph on the
global structure of a graph? While there do not seem to be general
structural consequences, a conjecture of Erdos and Hajnal states that
graphs with forbidden induced subgraphs behave very differently from
general graphs; more precisely they contain much larger cliques or stable
sets. This conjecture is still open. In this talk we will discuss the
history of this problem and some recent theorems related to it.

Click on the given link to join. Depending on your set-up, there may be a
very brief download, but we are using the Zoom platform, so it should be
pretty minimal. Past VCC events have gone very smoothly.

Here are quick instructions for joining a Zoom meeting:
https://support.zoom.us/hc/en-us/articles/201362193-How-Do-I-Join-A-Meeting-

The talk will start at the given time, but the invitation will be open 30
minutes so that anyone who wants to can call in early and get a sense of
how the platform works (how to mute/unmute, share screens, shared
whiteboard, raise hand, chat, etc.). It is very similar in feel to many
other like products, but takes a bit to figure out where Zoom puts the
buttons.

*To avoid the possibility of distraction and feedback noise, please keep
your mic muted unless you or someone in your group has something particular
to say.*

The *Northeast Combinatorics Network* (NCN) is funded by the US National
Science Foundation.

Activities, including *Discrete Math Days in the Northeast* (DMD), *Summer
Combo in Vermont*, and the *Virtual Combinatorics Colloquium* (VCC), are
detailed on the NCN website:

Google Sites: Northeast Combinatorics Network
<https://sites.google.com/view/northeastcombinatoricsnetwork/home>

Email: northeastcombinatoricsnetwork@gmail.com

YouTube Channel: Northeast Combinatorics Network
<https://www.youtube.com/channel/UCQYSxI_EL0nhE9E6aZZra5Q>


Some VCC tips:

For reporting purposes, we appreciate knowing who is attending and the
institution/location of the attendees. Please provide this information in
the chat feature of Zoom when you sign in.

Callers may find it helpful to use headphones if possible, as this reduces
feedback issues.

Participants should keep microphones muted unless someone wants to raise a
hand and ask a question. If feedback occurs, turn off your volume to ask
the question, then turn it back on to hear the answer.

The default will be for the audience to be muted (again to reduce feedback
issues), but participants can unmute themselves, or use the 'raise hand'
button, if they have questions.

*Jo*

Jo Ellis-Monaghan

Chair, Department of Mathematics and Statistics (on sabbatical 2019-2020)

Editor-in-Chief, PRIMUS

Saint Michael's College

One Winooski Park

Colchester, VT 05439

office: Jeanmarie 279

website: http://academics.smcvt.edu/jellis-monaghan/

phone: 802 654 2660

fax: 802 654 2960

e-mail: je <jellis-monaghan@smcvt.edu>llismonaghan@gmail.com
<llismonaghan@gmail.com>

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

[DMANET] PhD position Operations Research, University of Duisburg-Essen

The Operations Research group of Professor Kimms at the Mercator School of M=
anagement, University of Duisburg-Essen, Germany, is looking for a PhD candi=
date with strong OR skills. Our research focus is on math programming, graph=
theory or cooperative game theory approaches for problems in Logistics, Sup=
ply Chain Management, Revenue Management, or Disaster Management. Further de=
tails can be found on our website: https://www.log.msm.uni-due.de/startseite=
/

To be able to receive a PhD at our Management School the candidate is requir=
ed to have at least some basic knowledge in business administration or econo=
mics, i.e. "pure" mathematicians are not a good fit. The position has teachi=
ng obligations. Hence, a good command of German or English is a must. The of=
ficial announcement of the position (in German) can be found here:

https://www.log.msm.uni-due.de/fileadmin/Dateien/Logistics/Dokumente/Stellen=
ausschreibungen/aus_775-19_ii_wiss._mit._kimms__pluemacher_.pdf


Please feel free to send your application via email to alf.kimms@uni-due.de s=
ince our post office has reduced opening hours these days. Please send in al=
l the application material that is common in Germany (- just a CV won't be s=
ufficient). Our team is looking forward to receive your application.=

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

[DMANET] Open PhD Position: Algorithms for Constraint Satisfaction

Linköping University advertises up to two (2) positions as
PhD student in Computer Science formally based at the Department
of Computer and Information Science (IDA) within the Wallenberg AI,
Autonomous Systems and Software Program (WASP). WASP is Sweden's
largest individual research program ever, and provides a platform for
academic research and education, fostering interaction with Sweden's
leading technology companies.

The PhD student(s) will join a research project on constraint satisfaction
problems (CSP) directed by prof. Peter Jonsson. This project is within
the WASP program for mathematical foundations of AI, and students within
this project will be part of the WASP graduate school. CSPs are a well-known and
important class of computational problems with a wide range of applications
within computer science, artificial intelligence, and mathematics. An instance
of the constraint satisfaction problem consists of a set of variables, a set
of possible variable values (known as the domain), and a set of constraints
which impose restrictions on value assignments to the variables. To solve
such a problem, a value has to be found for each variable so that all the
constraints are satisfied. The computational complexity of CSP problems has been
intensively studied during the last decades, and several breakthrough results have
recently been presented for the finite-domain case. These results are to a large
extent based on utilising methods from universal algebra and mathematical logic.
This project aims at developing new mathematical methods for analysing the
computational complexity of infinite-domain CSP problems---such problems have very interesting applications within computer science and AI (such as spatiotemporal reasoning, machine learning, scheduling, and bioinformatics). The project aim at constructing new algorithms with significantly better complexity than current algorithms. The work within this project
includes the construction of new algorithms, analysing their complexity, and identifiying general methods for the algorithm construction and analysis.

The application deadline is May 1, 2020.

For further information visit

https://liu.se/jobba-pa-liu/lediga-jobb?rmpage=job&rmjob=13594&rmlang=SE

or contact Peter Jonsson

peter.jonsson@liu.se


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

Thursday, April 2, 2020

[DMANET] RANDOM / APPROX updated call for papers

Call for Papers:
24th RANDOM & 23rd APPROX
August 17-19, 2020

http://randomconference.com
http://approxconference.wordpress.com

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

Paper submission deadline: April 24, 2020

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

COVID UPDATE

Due to the Covid-19 pandemic, RANDOM, APPROX 2020 will be completely virtual. The details will be determined and announced later, but the authors will be expected (if deemed necessary by the format) to be able to present their result in a live online presentation for the above dates (Aug 17-19). At least one author of accepted papers is expected to be officially registered for the conference.

SCOPE

The 24th International Workshop on Randomization and Computation (RANDOM 2020) and the 23rd International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX 2020) will be held virtually on August 17-19, 2020.
RANDOM 2020 focuses on applications of randomness to computational and combinatorial problems while APPROX 2020 focuses on algorithmic and complexity theoretic issues relevant to the development of efficient approximate solutions to computationally difficult problems.

TOPICS

Papers are solicited in all research areas related to randomization and approximation, including but not limited to:

RANDOM
* design and analysis of randomized algorithms
* randomized complexity theory
* pseudorandomness and derandomization
* random combinatorial structures
* random walks/Markov chains
* expander graphs and randomness extractors
* probabilistic proof systems
* random projections and embeddings
* error-correcting codes
* average-case analysis
* smoothed analysis
* property testing
* computational learning theory

APPROX
* approximation algorithms
* hardness of approximation
* small space, sub-linear time and streaming algorithms
* online algorithms
* approaches that go beyond worst-case analysis
* distributed and parallel approximation
* embeddings and metric space methods
* mathematical programming methods
* spectral methods
* combinatorial optimization
* algorithmic game theory, mechanism design and economics
* computational geometric problems
* approximate learning

IMPORTANT DATES
Submissions: April 24, 2020
Notifications: June 11, 2020
Camera ready: June 22, 2020

SUBMISSIONS
Abstract Format: Electronic submissions are solicited. Please consult the following servers:

For submission of APPROX papers: http://www.easychair.org/conferences/?conf=approx2020
For submission of RANDOM papers: http://www.easychair.org/conferences/?conf=random2020

Note: You will be asked to login using an EasyChair account. Directions on how to register for such an account are available at the submission servers (you may also have an old account from a previous conference submission).
The submission must be received by 15:00pm (PDT) of April 24, 2020 for your submission to be considered.

Submission Format: Submissions should start with the title of the paper, each author's name, affiliation, and e-mail address, followed by a one-paragraph summary of the results to be presented. This should then be followed by a technical exposition on single-spaced pages on letter-size paper, using reasonable margins, page numbers, and at least 11-point font. The first 10 pages should contain the main ideas and techniques used to achieve the results including motivation and a clear comparison with related work (not including the references). There is no page limit but any material beyond the first 10 pages will be read at the sole discretion of the program committee.

Simultaneous submission to other conferences with published proceedings is not allowed except as explained below.

Dual submission with CCC 2020 for RANDOM 2020: The CCC 2020 notification deadline falls one week after the RANDOM conference deadline. We will allow submissions that are substantially similar to those submitted to CCC 2020 with the understanding that the authors will withdraw the RANDOM submission if the CCC submission is accepted. The authors will also have to declare such dual submissions through the submission server at the time of submission.

PROCEEDINGS
Accepted papers will be published in the online proceedings of the conference in the Leibniz International Proceedings in Informatics (LIPIcs) series, based at Schloss Dagstuhl. This guarantees perennial, free and easy electronic access, while the authors retain the rights over their work.

RANDOM Program Chair
Raghu Meka, UCLA mailto:raghuvardhan@gmail.com

APPROX Program Chair
Jarosław Byrka, University of Wrocław mailto:jby@cs.uni.wroc.pl

RANDOM Steering Committee

Oded Goldreich, Weizmann
Cris Moore, SFI
Anup Rao, U Washington
Omer Reingold, Stanford, Steering Committee Chair
Dana Ron, Tel Aviv University
Ronitt Rubinfeld, MIT
Amit Sahai, UCLA
Ronen Shaltiel, U Haifa, Publicity Chair
Alistair Sinclair, UC Berkeley
Paul Spirakis, U Liverpool

APPROX Steering Committee

Klaus Jansen, U Kiel
Samir Khuller, Northwestern University (Chicago)
Monaldo Mastrolilli, IDSIA
László A. Végh, LSE

PROGRAM COMMITTEES

RANDOM
Nima Anari, Stanford University
Eshan Chattopadhyay, Cornell University
Gil Cohen, Tel Aviv University
Parikshit Gopalan, VmWare Research
Prahladh Harsha, Tata Institute of Fundamental Research
Sam Hopkins, University of California, Berkeley
Valentine Kabanets, Simon Fraser University
Gautam Kamath, University of Waterloo
Tali Kaufman, Bar-Ilan University
Yin-Tat Lee, University of Washington
Sepideh Mahabadi, TTI Chicago
Raghu Meka, UCLA, PC chair
Jelani Nelson, University of California, Berkeley
Ryan O'Donnell, Carnegie Mellon University
Ilya Razenshteyn, Microsoft Research
Barna Saha, University of California, Berkeley
Tselil Schramm, Stanford University
Madhu Sudan, Harvard University
Avishay Tal, University of California, Berkeley
Eric Vigoda, Georgia Tech University
Mary Wootters, Stanford University

APPROX
Nikhil Bansal, CWI & TU Eindhoven
Jarosław Byrka, University of Wrocław, PC chair
Andreas Emil Feldmann, Charles University in Prague
Naveen Garg, IIT Delhi
Anupam Gupta, Carnegie Mellon
Pasin Manurangsi, Google Research
Evangelos Markakis, AUEB, Athens
Nicole Megow, University of Bremen
Marcin Mucha, University of Warsaw
Harald Räcke, TU Munich
Laura Sanità, TU Eindhoven & University of Waterloo
Chaitanya Swamy, University of Waterloo
Jakub Tarnawski, Microsoft Research
Anke van Zuylen, William and Mary
David Williamson, Cornell


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

[DMANET] CfP: ANTS 2020 -- Deadline Extension and COVID-19 Information

CfP: 12th International Conference on Swarm Intelligence
=======================================================================
ANTS 2020
12th International Conference on Swarm Intelligence
October 26-28, 2020. Barcelona
Up-to-date information at http://www.swarm-intelligence.eu/ants2020/

Extended Submission Deadline: May 1, 2020
Submission site: https://easychair.org/conferences/?conf=ants2020
Proceedings published by Springer LNCS
=======================================================================

=======================================================================
COVID-19 Related Information
=======================================================================
Sadly, the COVID-19 pandemic has currently brought the social, economic,
and academic life in large parts of the world to a standstill. Moreover,
it seems very hard to forecast the near (even medium) term future,
making it uncertain whether it will be possible to have a physical
meeting in Barcelona or not. In case it will not be possible to hold
ANTS 2020 as an on-site conference, presenters will be required to
provide video presentations of their papers and posters. These video
presentations will be made available online by means of a dedicated
website. Moreover, the proceedings will be sent by land mail to everyone
who has registered.

=======================================================================
Extended deadline
=======================================================================
Given the high level of disruption caused by the COVID-19 pandemic, we
have decided to extend the submission by two weeks. The new deadline is
therefore: May 1, 2020

=======================================================================
Scope of the Conference
=======================================================================
Swarm intelligence is the discipline that deals with the study of
self-organizing processes both in nature and in artificial systems.
Researchers in ethology and animal behavior have proposed a number of
models to explain interesting aspects of collective behaviors such as
movement coordination, shape-formation or decision making. Recently,
algorithms and methods inspired by these models have been proposed to
solve difficult problems in many domains. Among these, it is worth
mentioning ant colony optimization (ACO) and particle swarm optimization
(PSO), focusing respectively on discrete and continuous optimisation
problems. Also, Swarm robotics represents another field of techniques
derived from swarm intelligence for the design of collaborative
multi-robot systems featuring enhanced efficiency, robustness and
scalability. ANTS 2020 aims to give researchers in swarm intelligence
the opportunity to meet, to present their latest research, and to
discuss current developments and applications. The three-day conference
will be held for the first time in Barcelona, on October 26–28, 2020.

=======================================================================
Relevant Research Areas
=======================================================================
ANTS 2020 solicits contributions dealing with any aspect of swarm
intelligence.
Typical, but not exclusive, topics of interest are:
- Behavioral models of social insects or other animal societies that can
stimulate new algorithmic approaches.
- Theoretical and empirical and research in swarm intelligence.
- Application of swarm intelligence methods (e.g., ant colony
optimisation or particle swarm optimisation) to real-world problems.
- Theoretical and experimental research in swarm robotics systems.

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

[DMANET] SCIP Optimization Suite 7.0 released

Dear colleagues,

we are happy to announce the release of the SCIP Optimization Suite 7.0.
It consists of SCIP 7.0, SoPlex 5.0, ZIMPL 3.3.9, UG 0.8.9, GCG 3.0.3, and
PaPILO 1.0. Additionally, version 3.2 of SCIP-SDP has been released.

New features of the SCIP Optimization Suite 7.0 include

- the first release of PaPILO, a Parallel Presolve Library for Integer
Linear Optimization,
- tree size estimation methods to predict the search progress and
trigger restarts,
- the extension of SCIP's Benders' decomposition to handle convex MINLP
subproblems,
- a data structure to store decomposition information, used in primal
heuristics and
  Benders' decomposition,
- a revision of SCIP's symmetry handling methods allowing the
combination of
  polyhedral methods with orbital fixing,

and many further improvements and additions, resulting in significant
speedups for both MIP and MINLP.

For more information check out our website http://scip.zib.deand the
accompanying release report with an in-depth description of the
enhancements, which is available at Optimization Online:

http://www.optimization-online.org/DB_HTML/2020/03/7705.html


Best regards,
the SCIP team and friends

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

[DMANET] Computational optimization

Call for Papers

13th International Workshop on Computational Optimization (WCO20)
Sofia, Bulgaria, September 6-9, 2020

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

IEEE CS is a technical co-sponsor of FedCSIS 2020

https://fedcsis.org/2020/wco

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

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

* combinatorial and continuous global optimization
* unconstrained and constrained optimization
* multiobjective and robust optimization
* optimization in dynamic and/or noisy environments
* optimization on graphs
* large-scale optimization, in parallel and distributed computational
environments
* meta-heuristics for optimization, nature-inspired approaches and any
other derivative-free methods
* exact/heuristic hybrid methods, involving natural computing techniques
and other global and local optimization methods
*numerical and heuristic methods for modeling

The applications of interest are included in the list below, but are not
limited to:

* classical operational research problems (knapsack, traveling salesman,
etc)
* computational biology and distance geometry
* data mining and knowledge discovery
* human motion simulations; crowd simulations
* industrial applications
* optimization in statistics, econometrics, finance, physics, chemistry,
biology, medicine, and engineering.
*environment modeling and optimization
===============================

Best paper award

The best WCO20 paper will be awarded during the social dinner of
FedCSIS2020.
The best paper will be selected by WCO19 co-Chairs by taking into
consideration the scores suggested by the reviewers, as well as the quality
of the given oral presentation.

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

Submission and Publication

* Authors should submit draft papers in PDF format.
* The total length of a paper should not exceed 10 pages for regular paper
and 4 pages for short papers (IEEE style). IEEE style templates are
available at http://www.fedcsis.org/.
* Papers will be refereed and accepted on the basis of their scientific
merit and relevance to the workshop.
* Accepted and presented papers will be published in the Conference
Proceedings and included in the IEEE Xplore database and submitted for
different indexations (Communication and Position papers will only appear
in the conference proceedings).
* Extended versions of selected papers presented at WCO18 will be published
in edited books of the series "Studies of Computational Intelligence",
Springer.

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

Important dates:

Paper submission (sharp / no extensions) : May 15th, 2020
Position paper submission : June 9th, 2020
Author notification : June 30th, 2020
Final paper submission and registration : July 15, 2020
Conference date : September 6-9, 2020

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

Organizing Committee

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

If you have any question do not hesitate to send an email to :
wco2020@fedcsis.org


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

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

[DMANET] Postdoc position in Theoretical Computer Science at CTU Prague

A one-year full-time postdoc position is available in the G²OAT research
group
at the Czech Technical University in Prague (CTU), Czech Republic with
preferred starting date September 2020 (negotiable, with possible
extension
for at least one more year). The research interests of the group range
from
graph algorithms, through classical and parameterized complexity and
integer
linear programming to combinatorial games. The research group Graphs,
Games,
Optimization, Algorithms and Theoretical Computer Science (G²OAT) is a
part of
the Department of Theoretical Computer Science at the Faculty of
Information
Technology at CTU. The department also includes Stringology and
Arborology
research groups. The G²OAT group is rather small, comprising 3 assistant
professors and 3 Ph.D. students (two more Ph.D. students joining in
September),
however, the current team members regularly publish at renowned
conferences
and journals. A successful candidate will work at CTU's main campus
which
features a range of amenities such as the National Technical Library,
and a
laid-back atmosphere with cafes and other social hangout places.

The position is supported by the OP VVV MEYS funded project
CZ.02.1.01/0.0/0.0/16_019/0000765 "Research Center for Informatics" (a
recently
awarded EU-funded center of excellence run by internationally renowned
professors with worldwide impact) and offers a generous travel budget.
The G²OAT group is a part of a work-package of RCI focused on
Theoretical
Computer Science. Successful candidates will get a monthly salary in the
range
of 2-3 thousand EUR (the Czech Republic cost of living is at 59% of the
US
price level by OECD statistics). There are no teaching duties associated
with
this position.

We are seeking highly motivated individuals holding a PhD in computer
science,
discrete mathematics, or related areas from a reputed institution. The
ideal
candidate is familiar with several of the following areas: Parameterized

complexity, integer linear programming, structural graph theory, game
theory,
computational social choice. Experience in optimization and in
particular
approximation algorithms or hardness of approximation is appreciated but
not
required. The candidate's high scientific potential should be witnessed
by
publications in the area of algorithms or discrete math in proceedings
of
highly ranked international conferences and/or journals.

The successful candidate must:

* be a researcher who has received a PhD or its equivalent within the
last 7
years,
* have a strong publication record, and
* be fluent in English (both written and spoken), prior knowledge of
Czech
is not required.

Please submit your CV and a motivation letter to
ondrej.suchy@fit.cvut.cz.
Furthermore, a letter of recommendation should be sent by the
recommender also
directly to ondrej.suchy@fit.cvut.cz.
Candidates interested in applying are encouraged to make informal
inquiries.
Applications received by May 17 will receive full consideration.
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

Wednesday, April 1, 2020

[DMANET] THE IBS DISCRETE MATHEMATICS GROUP (DIMAG) POSTDOCTORAL RESEARCH FELLOWSHIP (DUE: APRIL 26, 2020)

The IBS Discrete Mathematics Group (DIMAG) in Daejeon, Korea invites applications for several postdoctoral research fellowship positions.

URL: https://dimag.ibs.re.kr/hiring/

DIMAG is a new research group that was established in December 1, 2018 at the Institute for Basic Science (IBS), led by Prof. Sang-il Oum. DIMAG is located at the headquarters of the Institute for Basic Science (IBS) in Daejeon, South Korea, a city of 1.5 million people.

Successful candidates for postdoctoral research fellowship positions will be new or recent Ph.D.'s with outstanding research potential in all fields of discrete mathematics with emphasis on structural graph theory, extremal graph theory, combinatorial optimization, matroid theory, or fixed-parameter tractable algorithms.

These non-tenure-track appointments are for two or three years, and the starting salary is no less than KRW 57,000,000. The appointment is one time renewable up to 5 years in total contingent upon the outstanding performance of the researcher.

These are purely research positions and research fellows will have no teaching duties.

A complete application packet should include:

• AMS standard cover sheet (preferred) or cover letter (PDF format)
• Curriculum vitae including a publication list (PDF format)
• Research statement (PDF format)
• Consent to Collection and Use of Personal Information (PDF file) https://dimag.ibs.re.kr/wp-content/uploads/2020/03/consent.pdf
• At least 3 recommendation letters
For full consideration, applicants should email items 1, 2, 3, and 4 and arrange their recommendation letters emailed to dimag@ibs.re.kr by April 26, 2020, Sunday. Recommendations letters forwarded by an applicant will not be considered.

DIMAG encourages applications from individuals of diverse backgrounds.

For Korean citizens who have not yet completed their military duty: IBS는 병역특례지정기관입니다. IBS is a designated institute for alternative military service.


--
Sang-il Oum (엄상일) https://dimag.ibs.re.kr/home/sangil/
CI, Discrete Mathematics Group, Institute for Basic Science (IBS).
Professor, Dept. of Mathematical Sciences, KAIST.


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

[DMANET] [Changes to deadline] Graphical Models for Security (GraMSec 2020) - CFP

GraMSec 2020: The Seventh International Workshop on Graphical Models for
Security
http://gramsec.uni.lu

June 22, 2020 *Online event*
Co-located with CSF 2020

*LNCS post-proceedings confirmed*

SCOPE

The use of graphical security models to represent and analyse the
security of systems has gained an increasing research attention over the
last two decades. Formal methods and computer security researchers, as
well as security professionals from the industry and government, have
proposed various graphical security models, metrics, and measurements.
Graphical models are used to capture different security facets and
address a range of challenges including security assessment, automated
defence, secure services composition, security policy validation, and
verification. The International Workshop on Graphical Models for Security
is an established scientific event dedicated to study and exchange
of experiences on graphical security and safety modelling.


TOPICS

This year, we encourage excellent submissions related, but not
restricted, to the following broad headings:
1. Graph representations: mathematical, conceptual, and implemented
tools for describing and reasoning about security and safety
2. Logical approaches: formal logical tools for representing and
reasoning about graphs and their use as modelling tools in security
3. Machine learning: modelling and reasoning about the role of big data
and machine learning in security operations
4. Networks in national security: terrorist networks, counter-terrorism
networks; safety in national infrastructure (e.g., utilities and
transportation)
5. Risk analysis and management: models and graphical methodologies for
security and privacy risk management in business and organisational
architectures
6. Social networks: using and reasoning about social graphs, network
analysis, network protocols, social mapping, sociometry.
7. Semantics: developing or studying semantic approaches to graph-based
models used in security like set theoretic models, categorical models,
logical models, etc.
8. Threat modelling: modelling and analysing software systems security,
models for DevSecOps, etc.
9. Security requirements: models and tools for describing and analysing
requirements on system security and privacy.
10. Visual security: modelling and analytics for security visualisations.
11. Secure systems: safe and secure system design, quantification of
security/safety, models for system security/safety evaluation.

We welcome a broad range of contributions: from theory to tools and
experience reports. Preference will be given to papers likely to
stimulate high-quality debate at the Workshop.

SUBMISSION GUIDELINES

We solicit two types of submissions:
- Regular papers (up to 18 pages, excluding the bibliography and
well-marked appendices) describing original and unpublished work within
the scope of the workshop.
- Short papers (up to 10 pages, excluding the bibliography and
well-marked appendices) describing original and unpublished work in
progress.

The reviewers are not required to read the appendices, so the papers
should be intelligible without them. All submissions must be prepared
using the LNCS style. Each paper will undergo a thorough review process.
Submissions should be made using the GraMSec 2020 EasyChair website:
https://easychair.org/conferences/?conf=gramsec2020.

PUBLICATION

As in previous editions, we the post-proceedings will be published
in the Lecture Notes in Computer Science (LNCS) series,
published by Springer. Proceedings will be published after the
workshop, thus permitting the authors to incorporate feedback.

VENUE

Due to the current coronavirus outbreak, the IEEE CSF Symposium
and its associated workshops, including GraMSec, will be held
online this year. Details about registration and participation will
be soon made available.

IMPORTANT DATES

Given the situation and the fact that the workshop will be held online,
we will keep only one submission deadline.

- Paper submissions due: Friday, April 24, 2020
- Notifications: Friday, May 29, 2020

- Workshop: Monday, June 22, 2020
- Camera ready versions due: Friday, August 7, 2020

PROGRAM CHAIRS

Harley Eades III, Augusta University, United States of America
Olga Gadyatskaya, Leiden Institute of Advanced Computer Science,
Leiden University, The Netherlands

STEERING COMMITTEE

Sushil Jajodia, George Mason University, United States of America
Barbara Fila, INSA Rennes, IRISA, France
Sjouke Mauw, University of Luxembourg, Luxembourg
Christian W. Probst, Unitec, New Zealand
Ketil Stølen, SINTEF Digital and University of Oslo, Norway

PUBLICITY CHAIR

Barbara Fila, INSA Rennes, IRISA, France

WEB CHAIR

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

[DMANET] Algorithms PhD positions – deadline May 1

Starting August 1, 2020 or later, several PhD positions in the area of big data analysis algorithms are available at Department of Computer Science, Aarhus University, under the supervision of Professor Lars Arge (www.cs.au.dk/~large<http://www.cs.au.dk/~large>) and/or Professor Gerth S. Brodal (www.cs.au.dk/~gerth<http://www.cs.au.dk/~gerth>).

The positions are part of a project funded by a grant from Independent Research Fund Denmark. The overall objective of the project is to develop memory-hierarchy efficient (such as I/O-efficient or cache-oblivious) algorithms and data structures for a number of fundamental geometric data structure problems, a number of fundamental graph data problems, as well as for a number of fundamental massive terrain data and flood risk assessment problems. The project is conducted in collaboration with leading international experts at Duke University (Pankaj Agarwal), UC Irvine (Mike Goodrich), Universite Libra de Bruxelles (John Iacono) and Goethe University Frankfurt (Ulrich Meyer), as well as at Aarhus University spin-out company SCALGO.


The positions are administered through the Graduate School of Science and Technology at Aarhus University (phd.scitech.au.dk) and include full tuition waiver and a very competitive scholarship. Applications are welcomed from students with either a BS or an MS degree, as well as a strong background in algorithms and data structures. Students with experience within I/O-efficient algorithms, cache-oblivious algorithms, or algorithm engineering are preferred. The application deadline for the positions is May 1, 2020. Applicants should apply using the Aarhus Graduate School of Science and Technology application system (reachable from phd.scitech.au.dk)

Applicants seeking further information in regards to scientific questions are invited to contact Professor Lars Arge (large@cs.au.dk<mailto:large@cs.au.dk>) or Professor Gerth S. Brodal (gerth@cs.au.dk<mailto:gerth@cs.au.dk>). For other questions, please contact research group coordinator Julie Rasmussen (jras@cs.au.dk<mailto:jras@cs.au.dk>)


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

[DMANET] Asst. Professor in Computer Science with Focus on Cybersecurity

As part of our planned expansion in the area of Cybersecurity, the
Department of Mathematics and Computer Science at the University of
Southern Denmark, Odense, invites applications for an assistant professor
position in Computer Science. We interpret the area cybersecurity broadly:
the ideal applicant is a computer scientist with a strong theoretical
background, conducting research on cybersecurity or research that has
cybersecurity as a direct application. We would like to expand on our
current security research efforts within Cryptology, Formal Methods,
Information Security, Security in DevOps, and Data-driven approaches,
so these topics are of particular interest.

Requirements:
The candidate
- is a computer scientist holding a PhD
- has a strong record of research at a high international level,
reflecting the academic age of the applicant
- can teach and advise in computer science at all levels, including a
broad range of core computer science subjects at the undergraduate level.

Experience in combining theory and practice of computer science is a plus.

Fluency in English is required. Knowledge of Danish is not a requirement:
more English than Danish is used when teaching in computer science, and
more than half of the faculty members in computer science have
international backgrounds. Our new colleague will be offered Danish
courses by the university.

Further information, including how to apply can be found at:
https://www.sdu.dk/da/service/ledige_stillinger/1098235

For questions, please contact Associate Professor Jacopo Mauro
mauro@imada.sdu.dk or Professor Joan Boyar joan@imada.sdu.dk.

About the department:
Based in Odense, the Department of Mathematics and Computer Science offers
an inclusive and international working environment with state-of-the-art
facilities as well as a strong tradition for collaboration across
departments and faculties, and with other educational institutions,
municipalities, and industries. The degrees offered by the department
include bachelor, master, and PhD in computer science, and a master in
data science. Our assistant professors, in particular, have very
reasonable teaching loads.

An appointment as an assistant professor lasts for three years, and
contingent on a positive performance evaluation, a permanent position for
an associate professor is normally opened, for which the assistant
professor can apply.

The starting date should preferably be no later than spring 2021.
Application deadline: 30 May 2020.

--
Joan Boyar Email: joan@imada.sdu.dk
Dept. of Math. and Comp. Sci. URL: http://www.imada.sdu.dk/~joan/
University of Southern Denmark
Campusvej 55 phone: +45 6550 2338
DK-5230 Odense M, Denmark
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

[DMANET] Call for papers on Resilient transportation for 2020 INFORMS Annual Meeting

We are seeking contributors for a special stream on *Resilient
transportation* at the 2020 INFORMS Annual Meeting in National Harbor (USA).
The stream focuses on optimisation solutions to make transportation
networks and vehicles more robust or adaptable to any kind of
disturbance and failure, with a focus on public transports.

The 2020 INFORMS Annual Meeting will take place on November 8th to 11th
(http://meetings2.informs.org/wordpress/nationalharbor2020/). Interested
speakers should contact Pierre Hosteins (pierre.hosteins@ifsttar.fr)
before *May 1st* with the tentative title of their submission and (if
possible) a short abstract. Please note that an attendee may present
only one paper at the conference.

Please forward this call to any person you think might be interested in
contributing to the stream.

Pierre Hosteins
--
Université Gustave Eiffel
COSYS-ESTAS
20, rue Elisee Reclus - BP 70317
F-59666 Villeneuve d'Ascq
Tel: +33 (0)3 20 43 83 58
Fax: +33 (0)3 20 43 83 59

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

[DMANET] Online resources for DCs --- contribution added --- IFORS

Dear Colleagues and Friends,

The aim of the IFORS Developing Countries Online Resources page is to offer the OR worker all publicly-available materials on the topic of OR for Development. It also aims to provide a venue for people who are working in the area to share their completed or in-process work, learn from others, and stimulate comments and discussions on the work. Regarding IFORS Developing Countries OR resources website, its regular updates - and your possible submission of "free" (not copyright protected) material, you might occasionally visit
http://ifors.org/developing_countries/index.php?title=Main_Page.

With this open resources page we aim to make research and application results better accessible to the many friends in the Developing Countries. We would be glad about interest.

"Operational Research" (OR) is the discipline of applying advanced analytical methods to help make better decisions. By using techniques such as problem structuring methods and mathematical modelling to analyze complex situations, Operational Research gives executives the power to make more effective decisions and build more productive systems.

The International Federation of Operational Research Societies (IFORS; http://ifors.org/) is an almost 60-year old organization which is currently composed of 51 national societies. Regional Groups of IFORS are: ALIO (The Latin American Ibero Association on Operations Research), APORS (The Association of Asian-Pacific Operational Research Societies), EURO (The Association of European Operational Research Societies), NORAM (The Association of North American Operations Research Societies). IFORS conferences are taking place every three years. On IFORS 2020, Seoul, South Korea, please refer to http://www.ifors2020.kr/.

Thank you very much for your attention.

With kind regards,
best wishes,
Gerhard-Wilhelm Weber

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

Tuesday, March 31, 2020

[DMANET] CFP: IEEE Int. Conferences (ISPA, BDCloud, SocialCom, SustainCom) in Exeter, England, UK, 15-17 October 2020

[Please accept our apologies if you receive multiple copies of this email]



*** IEEE (ISPA-2020,BDCloud-2020, SocialCom-2020, SustainCom-2020
International Conferences ***



To be held in Exeter, England, UK, 15-17 October 2020.



The 18th IEEE International Symposium on Parallel and Distributed
Processing with Applications (ISPA-2020)

https://hpcn.exeter.ac.uk/ispa2020



The 10th IEEE International Conference on Big Data and Cloud Computing
(BDCloud-2020)

https://hpcn.exeter.ac.uk/bdcloud2020



The 13th IEEE International Symposium on Social Computing and Networking
(SocialCom-2020)

https://hpcn.exeter.ac.uk/socialcom2020



The 10th IEEE International Conference on Sustainable Computing and
Communications (SustainCom-2020)

https://hpcn.exeter.ac.uk/sustaincom2020



Sponsored by

IEEE, IEEE Computer Society, and IEEE Technical Committee of Scalable
Computing (TCSC)



IMPORTANT DATES

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



Workshop/Special Session Proposal Due: 1 May 2020

Paper Submission Deadline: 1 June 2020

Authors Notification: 10 August 2020

Camera-Ready Paper Due: 8 September 2020

Early Registration Due: 8 September 2020

Conference Date: 15-17 October 2020



PAPER SUBMISSION GUIDELINE

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

All papers need to be submitted electronically through the conference
websites with PDF format. The materials presented in the papers should not
be published or under submission elsewhere. Each paper is limited to 8
pages (or 10 pages with over length charge) including figures and
references using IEEE Computer Society Proceedings Manuscripts style (two
columns, single-spaced, 10 fonts). You can confirm the IEEE Computer
Society Proceedings Author Guidelines at the following web page:

http://www.computer.org/web/cs-cps/

Manuscript Templates for Conference Proceedings can be found at

https://www.ieee.org/conferences_events/conferences/publishing/templates.html

Once accepted, the paper will be included into the IEEE conference
proceedings published by IEEE Computer Society Press (indexed by EI). The
authors of selected papers will be invited to extend their contributions
for special issues of prestigious journals.

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

[DMANET] New internet seminar on extremal and probabilistic combinatorics

*We are launching a new internet seminar with focus on extremal and
probabilistic combinatorics each Monday 13:00 UTC. The first speaker
will be Rob Morris (IMPA), on April 6. More information can be found on
the webpage of the webinar: https://sites.google.com/view/epcwebinar/.
You can also subscribe to the seminar mailing list there.*


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

[DMANET] Postdoc in Algorithms at the University of Glasgow

We are pleased to announce a postdoctoral position at the University of Glasgow, working with Kitty Meeks and Jessica Enright on the EPSRC-funded project Multilayer Algorithmics to Leverage Graph Structure (MultilayerALGS). The position is funded for up to 36 months starting on 1st July 2020 or as soon as possible thereafter.

Candidates should have (or expect to obtain very soon) a PhD in Computer Science, Mathematics, or a closely related area. We are ideally looking for a candidate with experience in algorithmic graph theory and/or parameterised complexity, as well as practical coding skills (e.g. knowledge of Python, C, Java or another suitable programming language).

The closing date for applications is 29th April 2020, and interviews are scheduled to take place remotely on 20th May 2020. Informal enquiries to Kitty Meeks (kitty.meeks@glasgow.ac.uk<mailto:kitty.meeks@glasgow.ac.uk>) or Jessica Enright (jessica.enright@glasgow.ac.uk<mailto:jessica.enright@glasgow.ac.uk>) are very welcome.

For more details and to apply, see https://my.corehr.com/pls/uogrecruit/erq_jobspec_version_4.jobspec?p_id=037548.


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

[DMANET] GECCO 2020: Workshop on Evolutionary Computation + Multiple Criteria Decision Making (EC + MCDM)

< We apologize for multiple posting. Please kindly disseminate this Call for Papers to your colleagues and contacts>



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

CALL FOR PAPERS

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

Workshop on

Evolutionary Computation + Multiple Criteria Decision Making (EC + MCDM)


The Genetic and Evolutionary Computation Conference (GECCO 2020) July 8-12, 2020, Cancun, Mexico: Please note that the conference will be held as an electronic-only conference. More details will be provided soon.


Paper submission deadline: April 3, 2020 April 17, 2020

Webpage: http://blogs.exeter.ac.uk/ecmcdm/<https://eur03.safelinks.protection.outlook.com/?url=http%3A%2F%2Fblogs.exeter.ac.uk%2Fecmcdm%2F&data=02%7C01%7CT.Chugh%40exeter.ac.uk%7C944e3b8a817c426aaef308d78413e6c6%7C912a5d77fb984eeeaf321334d8f04a53%7C0%7C0%7C637123093317123856&sdata=6LCzXWNxDVZLSKelqqdj2etStx7EAFolZzv0QYrG6sA%3D&reserved=0>

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



About the workshop

In many real-world problems, several conflicting objectives need to be optimized simultaneously. Therefore, it is crucial to properly structure and solve the problem with relevant tools for supporting a decision maker. Multiple criteria decision making (MCDM) tools have been found to be useful in several such applications e.g. health care, education, environment, transportation, business and production. In recent years, there has also been growing interest in merging EC and MCDM techniques for several applications. This workshop will showcase research that is both at the interface of EC and MCDM as well as in the more traditional MCDM domain.

The workshop on Evolutionary Computation + Multiple Criteria Decision Making (EC + MCDM) to be held in GECCO 2020 aims to promote the research on theory and applications in the field. Topics of interest (but not limited to) include:



• Preference elicitation and representation

• Interactive multiobjective optimization or decision maker in the loop

• Visualization in EC + MCDM • Aggregation/trade-off operators & algorithms

• Fuzzy logic based decision making techniques

• Bayesian and other decision making techniques

• Interactive multiobjective optimization for (computationally) expensive problems

• Using surrogates (or metamodels) in MCDM

• Hybridization of EC and MCDM

• Scalability in EC + MCDM

• MCDM and machine learning

• MCDM for Big data

• MCDM in real-world applications

• Exploring and using cognitive capabilities in MCDM

• Use of psychological tools to aid decision maker



Submission

We invite papers up to 8 pages relevant to the workshop and position papers of up to 2 pages showing preliminary results. We also welcome posters, demonstrations or presentations on ground-breaking theoretical and application results in the field. Accepted papers will be published in the GECCO Companion Proceedings and will be presented orally at the workshop.
For paper submission instructions and templates, please see: https://gecco-2020.sigevo.org/index.html/Papers+Submission+Instructions

Keynote talk

Prof. Michael Emmerich from Leiden University, Netherlands will be giving a keynote talk in the workshop.

Important dates

Submission opening: February 27, 2020

Submission deadline: April 3, 2020 April 17, 2020

Reviews due: April 13, 2020 April 27, 2020

Decisions due: April 17, 2020 May 1, 2020

Camera-Ready Material: April 24, 2020 May 8, 2020

Early author registration: April 24, 2020 May 11, 2020



Workshop organizers

Tinkle Chugh (University of Exeter, UK) Richard Allmendinger (Alliance Manchester Business School, University of Manchester, UK) Jussi Hakanen (Faculty of Information Technology, University of Jyväskylä, Finland)

More information about the organizers can be found on the workshop webpage http://blogs.exeter.ac.uk/ecmcdm/<https://eur03.safelinks.protection.outlook.com/?url=http%3A%2F%2Fblogs.exeter.ac.uk%2Fecmcdm%2F&data=02%7C01%7CT.Chugh%40exeter.ac.uk%7C944e3b8a817c426aaef308d78413e6c6%7C912a5d77fb984eeeaf321334d8f04a53%7C0%7C0%7C637123093317133809&sdata=FG1x%2BwTHEb4%2Fd9nI25B3iYx02MeBA4%2B7XnjYXBp03i4%3D&reserved=0>



Contact

Please feel free contact any of the special session organizers at t.chugh@exeter.ac.uk<mailto:t.chugh@exeter.ac.uk> , richard.allmendinger@manchester.ac.uk<mailto:richard.allmendinger@manchester.ac.uk> , jussi.hakanen@jyu.fi<mailto:jussi.hakanen@jyu.fi>

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

[DMANET] CFP - IEEE TNSM Special Issue on Data Analytics and Machine Learning for Network and Service Management — New Deadline

IEEE Transactions on Network and Service Management (impact factor: 4.682)

Special Issue on Data Analytics and Machine Learning for Network and
Service Management

https://www.comsoc.org/publications/journals/ieee-tnsm/cfp/data-analytics-and-machine-learning-network-and-service

(Submissions due: 1 May 2020)

Network and Service analytics can harness the immense stream of operational
data from clouds, to services, to social and communication networks. In the
era of big data and connected devices of all varieties, analytics and
machine learning have found ways to improve reliability, configuration,
performance, fault and security management. In particular, we see a growing
trend towards using machine learning, artificial intelligence and data
analytics to improve operations and management of information technology
services, systems and networks.
Research is therefore needed to understand and improve the potential and
suitability of data analytics and machine learning in the context of
services, systems and network management. This will provide deeper
understanding and better decision making based on largely collected and
available operational and service data. It will also present opportunities
for improving machine learning and data analytics algorithms and methods on
aspects such as reliability, dependability and scalability, as well as
demonstrate the benefits of these methods in management and control
systems. Moreover, there is an opportunity to define novel platforms that
can harness the vast operational data and advanced data analysis algorithms
to drive management decisions in networks, data centers, and clouds.

IEEE Transactions on Network and Service Management (IEEE TNSM) is a
premier journal for timely publication of archival research on the
management of networks, systems, services and applications. Following the
success of three recent TNSM special issues on Big Data Analytics for
Management in 2016, 2018, and 2019, this special issue will also focus on
recent, emerging approaches and technical models that exploit data
analytics and machine learning in network and service management solutions.
We welcome submissions addressing the underlying challenges and
opportunities, presenting novel techniques, experimental results, or
theoretical approaches motivated by management problems. Survey papers that
offer a perspective on related work and identify key challenges and
opportunities for future research are also in the scope of the special
issue. We look forward to your submissions!

Topics of Interest:

Topics of interest for this special issue include, but are not limited, to
the following:

Data Analytics, Machine Learning and Artificial Intelligence

Analysis, modelling and visualization
Operational analytics and intelligence
Event and log analytics, text mining
Outlier / Anomaly detection and prediction
Monitoring and measurements for management
Predictive analytics and real-time analytics
Artificial intelligence, neural networks, and deep learning for management
Data mining, statistical modeling, and machine learning for management

Application Domains and Management Paradigms

Cloud and network analytics
Social and communication networks analysis
Data centric management of virtualized infrastructure, clouds and data
centers
Data centric management of software defined networks
Data centric management of storage resources
Data centric management of Internet of Things and cyber-physical systems
Data centric management of zero touch and driverless networks
Platforms for analyzing and storing logs and operational data for
management tasks
Applications of data analytics to traffic classification, root-cause
analysis, service quality assurance, IT service and resource management
Novel approaches to cyber-security, intrusion detection, threat analysis,
and failure detection based on data analytics and machine learning


Submission Guidelines:

All papers should be submitted through the IEEE Transactions on Network and
Service Management manuscript submission site. Authors must indicate in the
submission cover letter that their manuscript is intended for the "Data
Analytics and Machine Learning for Network and Service Management" special
issue. View detailed author guidelines.

Important Dates:

Paper Submission: 1 May 2020
Publication Date (Tentative): December 2020

Guest Editors:

Nur Zincir-Heywood (Dalhousie University, Canada)
Giuliano Casale (Imperial College London, UK)
David Carrera (Barcelona Supercomputing Center, Spain)
Takeru Inoue (NTT Laboratories, Japan)
Hanan Lutfiyya (The University of Western Ontario, Canada)
Taghrid Samak (Google, USA)

**********************************************************
*
* 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] SGT'20 is postponed

Due to the Covid-19 situation, the Summer school on Graph Theory (SGT'20) is postponed.
This event was supposed to be held on June 7-12 2020 near Clermont-Ferrand (France).
https://sgt2020.limos.fr/

Aurélie Lagoutte, for the organizing committee


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

Monday, March 30, 2020

[DMANET] Oxford Discrete Mathematics and Probability Seminar

This is to announce the new Oxford Discrete Mathematics and Probability
Seminar, which will take place on Tuesdays, on Zoom, starting on 31st
March. The series will feature talks in both Combinatorics and
Probability and is open to anyone to attend. 

For the first week we will have a single seminar at 2pm (UK time); in most
future weeks we will also have a second seminar at 3.30pm.

The first two talks will be:

31st March, 2pm: Rob Morris (IMPA), Erdős covering systems

7th April, 2pm: Louigi Addario-Berry (McGill), Hipster random walks.

More details can be found at http://people.maths.ox.ac.uk/scott/dmp.htm .

This will be something of an experiment while we get to grips with the
technology, but we're excited about the possibilities this format might
bring!  We are aware of several other excellent such initiatives going on,
and will be keen to share our experiences and learn what works.

We have set up a mailing list for seminar announcements,
discmathprob@maillist.ox.ac.uk. In order to subscribe, please send an email
to sympa@maillist.ox.ac.uk with subject "subscribe discmathprob Firstname
Lastname" (replace "Firstname" and "Lastname" appropriately); leave the
message body blank. You should receive a message to let you know that your
subscription has been successful.

Our intention (of course with the agreement of the speakers) is to record
the seminars and put them on YouTube for an indefinite period of time, to
act as a resource for the community.  This has consequences from the
perspective of data protection since, by default, if you participate,
personal data consisting of your username, audio and video may be recorded.
If you wish to participate but do not want your personal data recorded, you
should please make sure to turn off your video and mute your microphone.

Christina Goldschmidt and Alex Scott
**********************************************************
*
* 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] FW: Faculty position - University of Kent

[Apologies for cross-posting]

Dear colleagues

Kent Business School is seeking a Lecturer/Senior Lecturer (Assistant/Associate Professor) in Big Data Analytics to join the Management Science group.
The successful applicant will lead and contribute to the delivery of business analytics modules at both undergraduate and postgraduate levels. In particular, the post holder will be expected to provide teaching in data visualisation, machine learning, database management with SQL, data analytics software and statistical programming languages (e.g. Python, R). The post holder should also have a clearly defined research agenda with a track record or clear potential to publish in top peer-reviewed journals.

Please see the links below to view the full job description and apply for this post:
https://jobs.kent.ac.uk/vacancy.aspx?ref=SS-186-20

To apply, please submit your CV, cover letter and a 2-page research plan.

Key Information
Salary: £34,804 to £59,135 per annum
Closing date for application: Sunday 19 April 2020
Interview date: Friday 22 May 2020 (interviews may need to be held via zoom or skype)

Informal enquiries may be directed by email to Prof Maria Paola Scaparra (m.p.scaparra@kent.ac.uk<mailto:m.p.scaparra@kent.ac.uk>).

Please do share this email with your postdocs or final-year PhD students who may be interested in the position.

Thank you and stay safe.

Paola

Maria Paola Scaparra | Head of the Management Science Group
Professor of Management Science
Centre for Logistics and Heuristic Optimisation(CLHO)
Kent Business School, University of Kent
Room 304, Sibson, Canterbury, Kent, CT2 7FS, UK
Tel: +44 (0)1227 824556 | Fax: +44 (0)1227 827726

http://www.kent.ac.uk/kbs | https://www.kent.ac.uk/kbs/our-staff/profiles/scaparra_maria.html

Gold for Kent in Teaching Excellence Framework (TEF)<https://www.kent.ac.uk/news/kentlife/14115/gold-award-for-kent-in-teaching-excellence-framework-tef>

Principal Investigator of the GCRF OSIRIS project
Twitter: @GCRF_OSIRIS
Website: https://research.kent.ac.uk/gcrf-osiris<https://research.kent.ac.uk/gcrf-osiris/>


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