Theory Announcements: April 2020

Thursday, April 30, 2020

[DMANET] PhD and Postdoc Positions in Mathematical Programming at Johannes Kepler University Linz, Austria

The Institute of Production and Logistics Management at the Johannes
Kepler University Linz, Austria, is inviting applications for PhD and
Postdoc positions within FWF and LIT-funded projects in different areas
of mathematical programming:

One or two 1- to 1,5-year Postdoc Positions within the project "MOMIP:
Multi-Objective Mixed-Integer Programming" (funded by the Austrian
Science Fund (FWF))

The project concerns the further development of generic branch-and-bound
based methods for bi-objective and three-objective (mixed) integer
optimization problems. For further information please contact Prof.
Sophie Parragh (sophie.parragh@jku.at).

Starting date: as soon as possible.

2-year PhD Position (30 hours/week) within the LIT-funded project
"HEROpt - Solution algorithms for hierarchical optimization problems"
(funded by the Linz Institute of Technology (LIT))

The project concerns the development of generic exact solution
algorithms for bilevel optimization problems and interdiction problems,
as well as algorithms for special classes of optimization problems with
a bilevel-type structure, such as competitive facility location
problems. For further information please contact Dr. Markus Sinnl
(markus.sinnl@jku.at).

Starting date: August 1, 2020.

3-year PhD position within the FWF-funded project "Hybrid Algorithms for
Redesigning MRP"

The project "Hybrid Algorithms for Redesigning MRP" is a joint project
with the University of Applied Sciences Upper Austria. The part carried
out at JKU mainly concerns the (further) development of two- and
multi-stage stochastic optimization models for medium-term production
planning and the design and implementation of appropriate optimization
algorithms. For further information please contact Prof. Sophie Parragh
(sophie.parragh@jku.at).

Starting date: October 1, 2020.

Candidates interested in one or more of the above positions should have

* PhD/Master's degree in Operations Research, Industrial Engineering,
Computer Science or a related field
* C++/python/Java/Julia programming skills
* experience with Gurobi or CPLEX
* experience in the implementation of optimization alogrithms
* a background in mathematical programming (especially mixed integer
programming) and optimization
* a strong interest in the respective area of the research project.

The salary follows FWF-rules for doctoral/postdoctoral candidates:
https://www.fwf.ac.at/en/research-funding/personnel-costs/

Participation and presentations at scientific conferences are expected
and will be funded.

If you are interested in working in a young international research team
at one of the nicest campus universities in Austria, only 1 hour and 20
minutes by train from Vienna, please send the following documents

* motivation letter
* detailed CV
* certificates
* list of MSc or PhD courses and grades
* PhD/Master's thesis (if in another language than English, a three-page
abstract in English)
* reference letter from your supervisor
* list of publications

to plm@jku.at, until May 15, 2020. Please indicate in your motivation
letter in which position(s) you are interested.

Applications will be considered until the positions are filled.

The Johannes Kepler University wishes to increase the proportion of
academic female faculty and, for this reason, especially welcomes
applications by qualified women. If applicants are equally qualified, a
woman will be given preference for this position. The university
welcomes applications from qualified applicants with physical
disabilities. These applications will be given special 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/
*
**********************************************************

[DMANET] Online Seminar on Frontiers of Parameterized Complexity: May 07, 2020 -- Jason Li

We are excited to announce a new online seminar series on Frontiers of
Parameterized Complexity with talks scheduled weekly on Thursdays at
17.00 GMT+2 (Bergen time). 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.

More details about the seminar series can be found here:
https://frontpc.blogspot.com/2020/04/talks-schedule.html

The next talk of the series will be held on May 07, 2020 at 17:00 GMT+2.

The link to join the meeting on Zoom is https://uib.zoom.us/j/4231169675
Meeting ID: 423 116 9675
Password: Name of the W[1]-complete problem, 6 letters, all capital.
Also known as a set of pairwise adjacent vertices.

Speaker: Jason Li, CMU
Title: Detecting Feedback Vertex Sets of Size k in O*(2.7^k) Time
Abstract: In the Feedback Vertex Set problem, one is given an
undirected graph $G$ and an integer $k$, and one needs to determine
whether there exists a set of $k$ vertices that intersects all cycles
of $G$ (a so-called feedback vertex set). Feedback Vertex Set is one
of the most central problems in parameterized complexity: It served as
an excellent test bed for many important algorithmic techniques in the
field such as Iterative Compression~[Guo et al. (JCSS'06)], Randomized
Branching~[Becker et al. (J. Artif. Intell. Res'00)] and
Cut\&Count~[Cygan et al. (FOCS'11)].

In particular, there has been a long race for the smallest dependence
$f(k)$ in run times of the type $O^\star(f(k))$, where the $O^\star$
notation omits factors polynomial in $n$. This race seemed to be run
in 2011, when a randomized $O^\star(3^k)$ time algorithm based on
Cut\&Count was introduced.

In this work, we show the contrary and give a $O^\star(2.7^k)$ time
randomized algorithm. Our algorithm combines all mentioned techniques
with substantial new ideas: First, we show that, given a feedback
vertex set of size $k$ of bounded average degree, a tree decomposition
of width $(1-\Omega(1))k$ can be found in polynomial time. Second, we
give a randomized branching strategy inspired by the one from~[Becker
et al. (J. Artif. Intell. Res'00)] to reduce to the aforementioned
bounded average degree setting. Third, we obtain significant run time
improvements by employing fast matrix multiplication.

********************************************************
Other upcoming talks in the series include:

May 14 2020:
Speaker: Vincent Cohen-Addad, Google Z\"urich
Title: On the Parameterized Complexity of Various Clustering Problems

May 21 2020:
Speaker: Micha\l Pilipczuk, University of Warsaw
Title: To be announced

May 28 2020:
Speaker: D\'aniel Marx, Max-Plack-Institut f\"ur Informatik
Title: To be announced

June 03 2020:
Speaker: Hans Bodlaender, Utrecht University
Title: Typical Sequences Revisited - Computing Width Parameters of Graphs

For more details please contact one of the following.

Roohani Sharma: roohani@imsc.res.in
Saket Saurabh: saket@imsc.res.in
Fedor Fomin: Fedor.Fomin@uib.no

Best regards and cheers!
**********************************************************
*
* 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 Privacy, Security and Trust, in Luxembourg

University of Luxembourg is seeking candidates to fill a PhD studentship broadly in the research area of security, privacy and trust. Candidates should hold a master degree in computer science or mathematics.

Terms: full time and fully funded for duration of study
Start date: From 15 June 2020, negotiable

Apply here (CV + research statement required): http://emea3.mrted.ly/2g9oy

COVID-19 arrangements: Applications should be submitted ASAP due to possible HR delays. There is a possibility for EU citizens to start remotely. Non-EU citizens, will first need to have a residence permit approved and delivered, which is currently an unpredictable process.

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 2019 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, 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] SAGT 2020 - Call for Papers

SAGT 2020 - Call for Papers
13th INTERNATIONAL SYMPOSIUM ON ALGORITHMIC GAME THEORY
https://www.uni-augsburg.de/de/fakultaet/mntf/math/prof/opt/team/harks/sagt2020/ <https://www.uni-augsburg.de/de/fakultaet/mntf/math/prof/opt/team/harks/sagt2020/>
September 16 - 18, 2020

IMPORTANT DATES AND CONFERENCE FORMAT

- Abstract Submission: May 19, 2020.
- Notification of acceptance: July 1, 2020.
- Camera ready: July 15, 2020.

Due to the current COVID-19 crisis, the SAGT 2020 will take place as a virtual conference September 16-18, 2020. Technical details will be announced later. The review and publishing process for the conference proceedings will be as usual. The proceedings will be published with Springer.

SUBMISSIONS

Authors are invited to submit previously unpublished work for publication in the proceedings. Foundational work is solicited on topics including but not limited to:
- Solution Concepts in Game Theory
- Efficiency of Equilibria and Price of Anarchy
- Complexity Classes in Game Theory
- Computational Aspects of Equilibria and Fixed-Point Theorems
- Repeated Games and Convergence of Dynamics
- Algorithmic Mechanism Design
- Reputation, Recommendation and Trust Systems
- Network Games and Graph-Theoretic Aspects of Social Networks
- Cost-Sharing Algorithms and Analysis
- Computing with Incentives
- Computational Social Choice
- Decision Theory, and Pricing
- Auction Design and Analysis
- Economic Aspects of Distributed Computing
- Internet Economics and Computational Advertising

Industrial application works and position papers presenting novel ideas, issues, challenges and directions are also welcome.
Submissions must be prepared in LNCS style and are limited to at most 14 pages (including title page, but excluding references). Additional material can be added in a clearly marked appendix.

For more detailed submission guidelines and instructions see the conference webpage at https://www.uni-augsburg.de/de/fakultaet/mntf/math/prof/opt/team/harks/sagt2020/ <https://www.uni-augsburg.de/de/fakultaet/mntf/math/prof/opt/team/harks/sagt2020/>

The submission is done via Easychair: https://easychair.org/conferences/?conf=sagt2020 <https://easychair.org/conferences/?conf=sagt2020>

PROGRAM COMMITTEE

- Umang Bhaskar, Tata Institute of Fundamental Research
- Vittorio Bilò, University of Salento
- Ozan Candogan, University of Chicago
- Jose Correa, Universidad de Chile
- Ágnes Cseh, Hungarian Academy of Sciences
- Edith Elkind, University of Oxford
- John Fearnley, University of Liverpool
- Aris Filos-Ratsikas, University of Liverpool
- Dimitris Fotakis, National Technical University of Athens
- Martin Gairing, University of Liverpool
- Yiannis Giannakopoulos, Technical University of Munich
- Yannai A. Gonczarowski The Hebrew University of Jerusalem and Tel Aviv University
- Tobias Harks (PC Co-chair), Augsburg University
- Martin Hoefer, Goethe University Frankfurt/Main
- Max Klimm (PC Co-chair), Humboldt-Universität zu Berlin
- Maria Kyropoulou, University of Essex
- David Manlove, University of Glasgow
- Evangelos Markakis, Athens University of Economics and Business
- Dario Paccagnan, ETH Zurich
- Georgios Piliouras, Singapore University of Technology and Design
- Guido Schaefer, CWI Amsterdam
- Orestis Telelis, Department of Digital Systems, University of Piraeus
- Christos Tzamos, University of Wisconsin-Madison
- Marc Uetz, University of Twente
- Adrian Vetta, McGill University

STEERING COMMITTEE
- Elias Koutsoupias, University of Oxford
- Marios Mavronicolas, University of Cyprus
- Dov Monderer, Technion
- Burkhard Monien, University of Paderborn
- Christos Papadimitriou, UC Berkeley
- Giuseppe Persiano, University of Salerno
- Paul Spirakis, University of Liverpool (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] Call for papers ICCL2020 - Deadline extended

*************** apologies for cross-postings*******************

International Conference on Computational Logistics (ICCL'20)
Call for Papers
DEADLINE EXTENDED TO THE 25TH OF MAY
University of Twente, Enschede, The Netherlands
September 27-30, 2020
https://iccl2020.nl/

The 11th Conference on Computational Logistics will be held September
27-30, 2020 at the University of Twente in Enschede, The Netherlands. In
the tradition of the previous conferences, the conference will focus on the
theory and applications of operations research, artificial intelligence,
and management science to problems in logistics. The theme of this edition
is Optimization and Artificial Intelligence in Logistics Management.

Topics of the conference include among others:
- Operations Research and Management in logistics
- Routing problems
- Emergency logistics
- Reverse logistics
- Crowd logistics
- Freight transportation
- Green supply chain
- Metropolitan/city logistics
- Smart Agro-Logistics
- Uncertainty modeling in planning and control
- Large-scale evolutionary optimization in logistics
- Multi-agent systems in logistics
- Self-organizing logistics
- Internet of things in smart logistics
- Artificial Intelligence in logistics
- Machine learning applications in supply chain
- Last generation ICT networks
- Land and maritime smart logistics
- ICT in logistics
- Computational issues in foreign trade supply chains
- Facility (re-)layout decision problems

Special sessions:
- Shared (Autonomous) Mobility
- Collaborative Freight Transportation
- Representing behavior and uncertainty in freight transportation
- Telecommunications supporting logistics under pandemic crisis
Further details on these sessions can be found on:
https://iccl2020.nl/call-for-papers/#sessions

Important Dates:
- May 25, 2020: Submission deadline full papers (conference proceedings)
- June 12, 2020: Submission deadline abstracts for presentation only
- June 26, 2020: Notifications of acceptance (for both full papers and
abstracts)
- July 15, 2020: Deadline for submission camera-ready paper
- August 14, 2020: End of early registration (reduced conference fee)

Covid-19 note:
Our current expectation is that by the end of September (i) not all
potential conference attendees are able to travel to The Netherlands and
(ii) social distancing is required at the conference locations. Therefore,
we are currently aiming at a joint offline/online conference. However, we
are continuously monitoring the COVID-19 outbreak and its impact on the
conference. So if changes or modifications are taken, we will speedily
inform you.

Guidelines for paper submission:
Two kinds of submissions are invited, i.e., a proposal can be submitted for:
- Conference papers for publication in Springer's Lecture Notes in Computer
Science (LNCS).Length 8 pages to a maximum of 15.
- Abstracts for presentation only.
Further details can be found on: https://iccl2020.nl/call-for-papers/

Publication:
Conference papers will be published in Lecture Notes in Computer Sciences
(LNCS), Springer.
Selected papers will be invited to a post-conference special issue in a
relevant ISI journal.

**********************************************************
*
* 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 at KU Leuven

The Research Center for Operations Management at KU Leuven (Belgium) is offering a position for a full-time PhD student. The position is associated with the FWO research project "Optimization and Analytics for Stochastic and Robust Project Scheduling", which involves the design, theoretical analysis, and practical implementation of optimization methods for project scheduling and similar large-scale planning problems under uncertainty.

We are looking for a highly motivated candidate with a strong background in mathematics, computer science, operations research, or a related field, who recently completed their master's degree or are about to complete it in 2020. Knowledge in combinatorial optimization (network and scheduling algorithms, mathematical programming, ...) and programming skills are an asset.

KU Leuven is the largest university of Belgium and ranked among the top 50 universities in the world. Leuven is a beautiful and liveable city with a large and international student population in the heart of Europe, only a 20min train-ride from Brussels. Our faculty is located in the historic city center, just a 5min walk from the UNESCO World Heritage Site "Groot Begijnhof".

We offer an employment as full-time doctoral scholar for initially one year, renewable for up to four years after positive evaluation. Salary is competitive and funds for conference travels, participation in summer schools, and other activities are available. The tentative starting date is September 2020, but earlier or later dates are possible, depending on the availability of the candidate.

KU Leuven seeks to foster an environment where all talents can flourish, regardless of gender, age, cultural background, nationality, or impairments.

For questions regarding this position please contact one of the promotors:
Erik Demeulemeester (erik.demeulemeester@kuleuven.be)
Jannik Matuschke (jannik.matuschke@kuleuven.be)

Please send your application via email as a single pdf file to: jannik.matuschke@kuleuven.be
Your application should include a detailed CV, a letter of motivation, transcripts, and names and contact details of at least two references. Applications will be reviewed immediately until the position is filled.

[DMANET] CFP FedCSIS 2020

CALL FOR PAPERS

15th Conference on Computer Science and Information Systems (FedCSIS'2020)

Sofia, Bulgaria, 6-9 September, 2020

www.fedcsis.org

Strict submission deadline: May 15, 2020, 23:59:59 pm HST (no extensions)

(FedCSIS IEEE conference number: #49059)

***************************** COVI-19 Information
*****************************

We would like to assure everybody that FedCSIS 2020 will take place,
the submitted and accepted papers will be published and sent for
indexations as usual.
In case the conference cannot be staged in real setting of beautiful Sofia,
we will provide a virtual web-based avenue for it. We look forward to
receiving your
contributions as usual and guarantee that FedCSIS 2020 will be another
memorable and rewarding conference.

Nevertheless, we would like to stress that in case of inability to be
physically
present at the FedCSIS Conference, due to travel restrictions, the FedCSIS
paper authors
will be allowed to remotely present their papers.

FedCSIS organizers

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

Please feel free to forward this announcement to your colleagues and
associates who could be interested in it.

KEY FACTS: expected Proceedings: IEEE Digital Library; indexing: Web of
Science (since 2012); 22 Technical Sessions in 5 Tracks; Doctoral
Symposium; conference fee covers 4 lunches and 3 social events; Sofia –
capital of Bulgaria, city history goes back to Roman times (with some,
recently uncovered and made available to see, fascinating ruins of Serdika
– which is how Sofia was known during Tracian and Roman times). In case of
being forced to move conference to a Web-based format, conference fee will
be reduced.

FedCSIS is an annual international conference, this year organized jointly
by the Polish Information Processing Society (PTI), IEEE Poland Section
Computer Society Chapter and Bulgarian Academy of Sciences. The mission of
the FedCSIS Conference Series is to provide a highly acclaimed forum in
computer science and information systems. We invite researchers from around
the world to contribute their research results and participate in Technical
Sessions focused on their scientific and professional interests in computer
science and information systems.

As in the previous years, FedCSIS 2020 will host a data mining challenge.
It will be organized on a, recently re-designed, Knowledge Pit platform:
https://knowledgepit.ai/fedcsis20-challenge/
There will also be a special session devoted to this challenge at the
FedCSIS 2020 conference.

Since 2012, Proceedings of the FedCSIS conference are indexed in the Web of
Science, SCOPUS and other indexing services. This already includes
Proceedings of FedCSIS 2018 (we are awaiting the decision for the FedCSIS
2019). Information about FedCSIS indexing / bibliometry / rankings can be
found at: https://www.fedcsis.org/2020/indexation.

FedCSIS TRACKS AND TECHNICAL SESSIONS

The FedCSIS 2020 consists of five conference Tracks, hosting Technical
Sessions:

Track 1: Artificial Intelligence
* Advanced Artificial Intelligence in Applications (15th Symposium AAIA'20)
* Advances in Semantic Information Retrieval (9th International Workshop
ASIR'20)
* Formal Approaches to Vagueness in Relation to Mereology (1st Symposium
FVRM'20)
* Language Technologies and Applications (5th Workshop LTA'20)
* Computational Optimization (13th Workshop WCO'20)

Track 2: Computer Science & Systems
* Advances in Computer Science & Systems (ACSS'20)
* Actors, Agents, Assistants, Avatars (1st Workshop 4A'20)
* Computer Aspects of Numerical Algorithms (13th Workshop CANA'20)
* Multimedia Applications and Processing (13th Symposium MMAP'20)
* Scalable Computing (11th Workshop WSC'20)

Track 3: Network Systems and Applications
* Advances in Network Systems and Applications (ANSA'20)
* Internet of Things - Enablers, Challenges and Applications (4rd Workshop
IoT-ECAW'20)
* Cyber Security, Privacy and Trust (1st International Forum NEMESIS'20)

Track 4: Information Systems and Technologies
* Advances in Information Systems and Technologies (AIST'20)
* Data Science in Health (DSH'19) (2nd Special Session DSH'20)
* Information Systems Management (15th Conference ISM'20)
* Knowledge Acquisition and Management (26th Conference KAM'20)

Track 5: Software and System Engineering
* Advances in Software and System Engineering (ASSE'20)
* Cyber-Physical Systems (7th Workshop IWCPS'20)
* Lean and Agile Software Development (4th International Conference LASD'20)
* Model Driven Approaches in System Development (6th Workshop MDASD'20)
* Software Engineering (40th IEEE Workshop SEW'20)

Track 6: DS-RAIT'20 - 7th Doctoral Symposium on Recent Advances in
Information Technology

KEYNOTE SPEAKERS

* Christian Blum, Artificial Intelligence Research Institute (IIIA-CSIC),
Barcelona, Spain
Keynote title: Are you a Hybrid? Yes, of course, everyone is a Hybrid
nowadays!

* George Boustras, European University Cyprus
Keynote title: Critical Infrastructure Protection – on the interface of
safety and security

* Hans-Georg Fill, University of Fribourg, Switzerland
Keynote title: From Digital Transformation to Digital Ubiquity: The Role of
Enterprise Modeling

PAPER SUBMISSION AND PUBLICATION

+ Papers should be submitted by May 15, 2020 (strict deadline, no
extensions, submission system is open).

+ Preprints will be published on a USB memory stick and provided to the
FedCSIS participants.

+ Only papers presented during the conference will be submitted to the IEEE
for inclusion in the Xplore Digital Library. Furthermore, proceedings,
published in a volume with ISBN, ISSN and DOI numbers, will posted within
the conference Web portal. Moreover, most Technical Session organizers
arrange quality journals, edited volumes, etc., and may invite selected
extended and revised papers for post-conference publications (information
can be found at the websites of individual events, or by contacting Chairs
of said events).

IMPORTANT DATES

+ Paper submission (strict deadline): May 15, 2020, 23:59:59 pm HST (there
will be no extension)
+ Position paper submission: June 9, 2020
+ Author notification: June 30, 2020
+ Final paper submission and registration: July 15, 2020
+ Conference date: September 6-9, 2020

CHAIRS OF FedCSIS CONFERENCE SERIES

Maria Ganzha, Leszek A. Maciaszek, Marcin Paprzycki

CONTACT FedCSIS at: secretariat@fedcsis.org

FedCSIS in Social Media:
FedCSIS on Facebook: http://tinyurl.com/FedCSISFacebook
FedCSIS on LinkedIN: https://tinyurl.com/FedCSISonLinkedIN
FedCSIS on Twitter: https://twitter.com/FedCSIS
FedCSIS on XING: http://preview.tinyurl.com/FedCSISonXING

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

[DMANET] PhD positions in Bioinformatics / Computational Biology at Georgia State

The Computer Science department at Georgia State University is looking
for strong PhD candidates to join its exciting Next Generation program
in the Bioinformatics cluster. The candidate would work under the
supervision of Dr. Murray Patterson, however there will be ample
opportunity to collaborate with other faculty, labs and industry.

The ideal candidate should have some background in
- data analysis, interpretation and visualization
- mathematical modeling
- C/C++, Python, or other modern programming languages
- some familiarity with the unix/linux environment

Candidates with a BSc. or MSc. in computer science, mathematics or
similar disciplines will be considered. Knowledge of
biology/bioinformatics is not a must, but is a plus. Candidates from
biology or chemistry with a strong computational component will also
be considered.

Interested applicants should compose a single PDF file containing the
following:
- a cover/motivation letter
- CV
- (unofficial) transcripts of your grades
- the contact details of 2-3 professional references

Please send this PDF in an email to mpatterson@cs.gsu.edu with the
subject line "PhD application GSU"

The Department of Computer Science has a current enrollment of about
75 graduate students, and is active in research areas including
bioinformatics, graphics and visualization, networks and distributed
systems, and algorithms. The department emphasizes interdisciplinary
research: it runs its own bioinformatics program, and participates in
Georgia State's Molecular Basis of Disease and Brains and Behavior
programs. U.S. News and World Report ranks Georgia State as #2 in
Most Innovative Schools, nationally. Georgia State University is
located in the vibrant and multicultural Atlanta, a city which is
quickly becoming a major technology hub in the country.

Best Wishes,
Murray Patterson
https://murraypatterson.net/
**********************************************************
*
* 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 29, 2020

[DMANET] ALGOSENSORS 2020: International Symposium on Algorithms and Experiments for Wireless Sensor Networks

ALGOSENSORS 2020: International Symposium on Algorithms and Experiments for
Wireless Sensor Networks

Polo Didattico delle Piagge, Giacomo Matteotti, 56124 Pisa, Italy
Pisa, Italy, September 9-10, 2020

************
Postponed Submission deadline May 10, 2020
************

The Organization Committee (OC) is committed to ALGO 2020 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.

The ALGOSENSORS symposium aims to bring together research contributions
related to diverse algorithmic aspects of sensor networks, wireless
networks as well as distributed robotics, both from a theoretical and an
experimental perspective. This year ALGOSENSORS has three tracks:

- (A) Algorithms and Theory
- (B) Distributed and Mobile
- (C) Wireless Sensor Networks and Emergent applications

Each paper will be initially submitted to a single track but will be
handled by the same program committee. The program committee will make sure
that all papers are reviewed by PC members in the expertise area.

Link: http://algo2020.di.unipi.it/ALGOSENSORS2020/index.html

Submission link: https://easychair.org/conferences/?conf=algosensors2020

Important Dates
Abstract registration deadline: May 10, 2020
Submission deadline: May 10, 2020
Notification: June 15, 2020

Scope
ALGOSENSORS is an international symposium dedicated to the algorithmic
aspects of wireless networks. Originally focused on sensor networks, it now
covers algorithmic issues arising in wireless networks of all types of
computational entities, static or mobile, including sensor networks,
sensor-actuator networks, autonomous robots. The focus is on the design and
analysis of algorithms, models of computation, and experimental analysis.
It is colocated with ALGO 2020.

List of Possible Topics
Algorithms
Complexity and Computability
Computational Models
Experimental Analysis
Performance Evaluation
Systems and Testbeds
Cyber Physical Systems
Game Theoretic Aspects
Social Networks and Algorithms
Communication Protocols
Fault Tolerance and Dependability
Data Aggregation and Fusion
Deployment
Routing and Data Propagation
Energy Management
Infrastructure Discovery
Localization
Mobility and Dynamics
Obstacle Avoidance
Swarm Computing
Time Synchronization
Topology Control
Delivery with Drones
Smart Farming
Precision Agriculture
Precise Localization
Autonomous Navigation
Wireless Sensor Networks
Ad-Hoc Networks
Internet of Things

Submission Guidelines
Papers are to be submitted electronically using the EasyChair server at:

https://www.easychair.org/conferences/?conf=algosensors2020

The submissions must contain original results that have not already been
published and are not concurrently submitted to a journal or conference
with published proceedings. Each paper should select one of the two tracks
(Algorithms & Theory or Experiments & Applications). Authors need to ensure
that for each accepted paper at least one author will register and attend
the symposium.

Submissions are limited to twelve (12) single-column pages in the LNCS
format. This includes figures, but excludes references and an optional
appendix (to be read at the program committees discretion). Authors should
consult Springer's authors' guidelines and use their proceedings templates,
either for LaTeX or for Word, for the preparation of their papers.

Accepted papers will be published as ALGOSENSORS 2020 post-proceedings in
the Springer LNCS series. Springer encourages authors to include their
ORCIDs in their papers. In addition, the corresponding author of each
paper, acting on behalf of all of the authors of that paper, must complete
and sign a Consent-to-Publish form. The corresponding author signing the
copyright form should match the corresponding author marked on the paper.
Once the files have been sent to Springer, changes relating to the
authorship of the papers cannot be made.

Committees

Steering Committee
Josep Diaz, U.P. Catalunya, Spain
Magnus M. Halldorsson, Reykjavik U., Iceland
Bhaskar Krishnamachari, U. of Southern California, USA
P.R. Kumar, Texas A&M U., USA
Sotiris Nikoletseas, U. of Patras and CTI, Greece (Chair)
Jose Rolim, U. of Geneva
Paul Spirakis, U. of Patras and CTI, Greece
Adam Wolisz, T.U. Berlin, Germany

Program committee
John Augustine, IIT Madras, India
Stefano Carpin, Univ. of California, Merced, USA
Jérémie Chalopin, CNRS Marseille, France
Mattia D'Emidio, Univ. of L'Aquila, Italy
Irene Finocchi, Sapienza Univ. of Rome, Italy
Paola Flocchini, Univ. of Ottawa, Canada
Leszek Gasieniec, Univ. of Liverpool, UK
Subrahmanyam Kalyanasundaram, IIT Hyderabad, India
Ralf Klasing, CNRS Bordeaux, France
Irina Kostitsyna, TU/e, Netherlands
Euripides Markou, Univ. of Thessaly, Greece
Dominik Pająk, Wroclaw Univ., Poland
Giuseppe Prencipe, Univ. of Pisa, Italy
Tomasz Radzik, King's College London, UK
Christian Scheideler, Paderborn University, Germany
Mordohay Shalom, Institute of Technology, Israel
Dimitrios Zorbas, Tyndall National Institute, University College Cork,
Ireland
Vlady Ravelomanana, CNRS Paris Diderot, France
Christopher Thraves, U. Concepcion, Chile
Theofanis P. Raptis, IIT-CNR Pisa, Italy
Miguel A. Mosteiro, Pace U., USA
Xavier Defago, Tokyo Institute of Technology, Japan

Co-Chairs
Amitabha Bagchi, IIT Delhi, India
Alfredo Navarra, Univ. of Perugia, Italy
Cristina M. Pinotti, Univ. of Perugia, Italy

Publicity Chair
Francesco Betti Sorbelli, MS&T Rolla, USA

Contact: All questions about submissions should be emailed to
cristina.pinotti@unipg.it

--
Francesco Betti Sorbelli

[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

June 15-17, 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.

Few selected papers will be invited for the:
Special Issue "Routing in Aerial, Underground, and Underwater Wireless
Sensor Networks", of
The journal Sensors (https://www.mdpi.com/journal/sensors)

Submission link: https://easychair.org/conferences/?conf=widroit2020

Important Dates
Submission: May 7, 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

--
Francesco Betti Sorbelli

[DMANET] IPEC 2020: First Call for Papers

15th International Symposium on Parameterized and Exact Computation (IPEC
2020) International Symposium on Parameterized and Exact Computation (IPEC)
is an annual conference covering all aspects of parameterized and exact
algorithms and complexity. Its 15th edition will happen online in 2020.

------ Topics ------
Papers presenting original research in the area are sought, including but
not limited to:
* new techniques for the design and analysis of parameterized and exact
algorithms;
* fixed-parameter tractability and kernelization results;
* parameterized complexity theory;
* parameterized (in)approximability results;
* relationships between parameterized complexity and traditional
complexity classifications;
* applications of parameterized and exact computation; and
* implementation issues of exact, parameterized, and kernelization
algorithms.
Theoretically grounded studies on parameterized and exact computations and
kernelization for real-world applications and algorithmic engineering are
especially encouraged.

------ Conference ------
Due to the COVID-19 pandemic, IPEC 2020 will be an online event taking
place on 14–18 December 2020. On each day, there will be two roughly
90-minute sessions of invited and contributed talks with a 30-minute break
in between, scheduled between 8am and noon UTC (i.e., spanning European
morning / Asian afternoon or evening). The conference will also feature
virtual rooms for coffee break discussions. Participating in the conference
will be free of charge.

Accepted papers will be published in the symposium proceedings in the
Leibniz International Proceedings in Informatics (LIPIcs) series, based at
Schloss Dagstuhl. Authors of accepted papers are expected to present their
work at the symposium (preferably by a live online talk or at the very
least by a prerecorded talk), and to incorporate the comments from the
program committee. Authors are also encouraged to be present at virtual
coffee breaks at least after the session with their talk. A special issue
of Algorithmica is planned for selected papers presented at IPEC 2020.

------ Awards ------
The program committee may award a Best Paper Award and a Best Student Paper
Award, both of which may be exceptionally split between two or more papers.
A student is someone who has not received a PhD degree before the full
paper submission deadline. A paper accepted to the conference is eligible
for the Best Student Paper Award if either all its authors are students, or
besides student co-author(s) there is one non-student co-author that
confirms, at the moment of submission, that a clear majority of conceptual
work on the paper was done by the student co-author(s). In the latter case,
it is moreover expected that a student gives a presentation at the
conference. Papers co-authored by members of the programme committee are
not eligible for the Best Paper Award or the Best Student Paper Award.

------ Special events ------
An invited talk is planned by the 2020 EATCS-IPEC Nerode Prize winner. In
addition, there will be a session presenting the results of the 5th
Parameterized Algorithms and Computational Experiments Challenge (PACE
2020).

------ Submission guidelines ------
Authors are invited to submit an extended abstract of up to 12 pages
(excluding the title page and references section) in LIPIcs style, in
English, describing original unpublished research. The title page consists
exclusively of the title of the paper, author information, and abstract.
Results previously published in another conference proceedings or journal
(or scheduled for publication prior to IPEC) will not be considered.
Simultaneous submission to other conferences with published proceedings or
to journals is not allowed. However, the authors are encouraged to make
full versions of their submissions freely accessible in an online
repository such as ArXiv or ECCC.

The extended abstract should contain a summary of the main results, their
motivation and importance, and evidence of their correctness. All claims
made in the extended abstract must be fully justified in a clearly marked
appendix that will be read at the discretion of the program committee. The
authors may choose to either present in the appendix only the material
excluded from the extended abstract or to attach a full version of the
paper as the appendix. In either case, the authors should take a particular
notice that the extended abstract should present their work in a
comprehensible and self-contained way and the quality of the presentation
in the extended abstract will be taken into account by the programme
committee.

Authors must submit their papers electronically via EasyChair:
https://easychair.org/conferences/?conf=ipec2020 . The use of the LIPIcs
style file (
https://www.dagstuhl.de/en/publications/lipics/instructions-for-authors) is
mandatory; no changes to font size, page margins, etc., are permitted.
Program committee members (except the co-chairs) are allowed to submit
papers.

------ Important Dates ------
Submission deadline: 15th July 2020 (AoE)
Notification: by 18th September 2020
Camera-ready deadline: 30th September 2020
Conference: 14th-18th December 2020

------ Program Committee ------
Marthe Bonamy (CNRS Bordeaux, France)
(co-chair) Yixin Cao (Hong Kong Polytechnic University, China)
Yijia Chen (Fudan University, China)
David Eppstein (UC Irvine, USA)
Eun Jung Kim (CNRS, France)
Marvin Künnemann (MPII, Germany)
Euiwoong Lee (New York University, USA)
Pasin Manurangsi (Google Research, USA)
Pranabendu Misra (MPII, Germany)
Irene Muzi (TU Berlin, Germany)
(co-chair) Marcin Pilipczuk (University of Warsaw, Poland)
Marc Roth (University of Oxford, UK)
R.B. Sandeep (IIT Dharwad, India)
Darren Strash (Hamilton College, USA)

[DMANET] QBF 2020 - updated call for papers

CALL FOR PAPERS

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

July 5, 2020 -- to be held virtually
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

UPDATES: The workshop will be held virtually.
The deadline has been extended by 2 weeks.
-------------------------------------------------------------

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
===============

May 8: Submission
May 26: Notification of acceptance
June 11: 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

[DMANET] Workshop on Nonmonotonic Reasoning (NMR 2020)

* Apologies if you receive multiple copies of this call *

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

NMR 2020

Dates: 12-14 September 2020
Rhodes, Greece

*** Deadline: 12 June 2020 ***
==============================

The 18th International Workshop on Nonmonotonic Reasoning (NMR)

https://nmr2020.dc.uba.ar

co-located with the International Conference on Principles of Knowledge Representation and Reasoning (KR)

NMR is the premier forum for results in the area of nonmonotonic reasoning. Its aim is to bring together active researchers in this broad field within knowledge representation and reasoning (KRR), including belief revision, uncertain reasoning, reasoning about actions, planning, logic programming, preferences, argumentation, causality, and many other related topics including systems and applications.

NMR has a long history - it started in 1984, and has been held every two years since then. Recent previous NMR workshops were held in Tempe (2018), Cape Town (2016), and Vienna (2014).

NMR 2020 is co-located with KR 2020 and DL 2020. In particular, NMR 2020 will share a joint session with DL 2020.

As in previous editions, NMR 2020 aims to foster connections between the different subareas of nonmonotonic reasoning and provide a forum for emerging topics. We especially invite papers on systems and applications, as well as position papers and papers addressing benchmark issues. The workshop will be structured by topical sessions fitting to the scopes of accepted papers.

The workshop will be held in the Greek island of Rhodes, from 12 to 14 September 2020. Workshop activities will include invited talks and presentations of technical papers.

-- Submission Information --

Papers should be at most 10 pages in AAAI style including references, figures, and appendices, if any. For further instructions on the format, please see the KR 2020 website. Papers must be submitted in PDF only.

Please submit to: https://easychair.org/conferences/?conf=nmr2020

Papers already published or accepted for publication at other conferences are also welcome, provided that the original publication is mentioned in a footnote on the first page. In the same vein, papers under review for other conferences can be submitted with a similar indication on their front page. Papers that have already been published or submitted elsewhere may have over length.

-- Workshop Proceedings --

There are no formal proceedings for NMR. The accepted papers will be published as a technical report and will be made available in the Computing Research Repository (CoRR). The papers will be compiled in the homepage of NMR 2020 (https://nmr2020.dc.uba.ar). The copyright of the papers lies with the authors, and as far as NMR is concerned, they are free to submit to other conferences and workshops as well.

-- Important Dates --

- Paper registration deadline: 12 June 2020
- Paper submission deadline: 19 June 2020
- Notification to authors: 15 July 2020
- Camera ready version: 31 July 2020
- Workshop dates: 12-14 September 2020

-- Invited Speakers --

- Andreas Herzig, IRIT CNRS, France (joint session with DL 2020)
- Francesca Toni, Imperial College London, UK

-- Workshop Co-Chairs --

- María Vanina Martínez, Universidad de Buenos Aires and CONICET, Argentina
- Ivan Varzinczak, CRIL, Univ. Artois & CNRS, France

-- Program Committee --

- Ofer Arieli, Academic College of Tel-Aviv, Israel
- Christoph Beierle, FernUniversitaet Hagen, Germany
- Alexander Bochman, Holon Institute of Technology, Israel
- Richard Booth, Cardiff University, UK
- Arina Britz, Stellenbosch University, South Africa
- Giovanni Casini, Université du Luxembourg
- James Delgrande, Simon Fraser University, Canada
- Juergen Dix, Clausthal University of Technology, Germany
- Wolfgang Faber, Alpen-Adria-Universität Klagenfurt
- Jorge Fandinno, IRIT-CNRS, France
- Eduardo Fermé, Universidade da Madeira, Portugal
- Martin Gebser, University of Potsdam, Germany
- Laura Giordano, Universite of Piemonte Orientale, Italy
- Lluis Godo Lacasa, IIIA - CSIC, Spain
- Andreas Herzig, IRIT-CNRS, France
- Aaron Hunter, British Columbia Institute of Technology, Canada
- Anthony Hunter, University College London, UK
- Katsumi Inoue, National Institute of Informatics, Japan
- Tomi Janhunen, Aalto University, Finland
- Souhila Kaci, Université Montpellier 2, France
- Antonis Kakas, University of Cyprus
- Gabriele Kern-Isberner, Technische Universitaet Dortmund, Germany
- Sébastien Konieczny, CRIL-CNRS, France
- Thomas Lukasiewicz, University of Oxford, UK
- Thomas Meyer, University of Cape Town, South Africa
- Nir Oren, University of Aberdeen, UK
- Odile Papini, Aix-Marseille Université, France
- Xavier Parent, Université du Luxembourg
- Ramon Pino Perez, Universidad de Los Andes, Venezuela
- Laurent Perrussel, Université de Toulouse, France
- Ricardo O. Rodriguez, Universidad de Buenos Aires, Argentina
- Ken Satoh, National Institute of Informatics and Sokendai, Japan
- Gerardo Simari, Universidad Nacional del Sur and CONICET, Argentina
- Guillermo R. Simari, Universidad del Sur in Bahia Blanca, Argentina
- Christian Straßer, Ruhr-Universitaet Bochum, Germany
- Matthias Thimm, Universität Koblenz-Landau, Germany
- Leon van der Torre, Université du Luxembourg
- Renata Wassermann, Universidade de São Paulo, Brazil
- Emil Weydert, Université du Luxembourg
- Stefan Woltran, Vienna University of Technology, Austria

-- Further Information --

Please visit the workshop website (https://nmr2020.dc.uba.ar) for further information and regular updates.

--
Ivan Varzinczak - https://www.ijv.ovh
CRIL, Université d'Artois & CNRS, France

[DMANET] PhD position in Algebraic Graph Theory at TU Eindhoven

PhD position in "Algebraic Graph Theory" at TU Eindhoven

We are looking for a strong, motivated PhD student with a background in
mathematics for a four-year project that aims to apply linear algebra
methods to problems about graphs.

PROJECT DESCRIPTION
The field of Spectral Graph Theory aims to understand to what extent graphs
are characterized by their spectra. Starting from the eigenvalues and
eigenvectors ofa matrix associated to a graph, we seek to deduce
combinatorial properties of the graph. The research of this project is
aimed at advancing the theory of spectral graph theory. The project
investigates questions such as: To what extend is a graph characterizedby
its spectrum? Is the existence of non-isomorphic graphs with the same
spectrum a rare or a common phenomena? Can we use eigenvalues to provide
good and efficient bounds on NP-hard graph parameters?
Dr. Aida Abiad and Prof.dr. Frits Spieksma will supervise the project.

REQUIREMENTS
We are looking for a highly motivated candidate with an MSc in mathematics.

ABOUT TU EINDHOVEN, THE DEPARTMENT OF MATHEMATICS AND COMPUTER SCIENCE, AND
THE COMBINATORIAL OPTIMIZATION GROUP
The TU Eindhoven (TU/e) was established in 1956 as a polytechnic. It has
grown into a university with nine departments. The TU/e now has
approximately 3000 employees (incl. PhD students) and 8000 BSc and MSc
students. The TU/e campus is in the center of Eindhoven. Our Department
offers several bachelor and master programs, all of which are taught in
English. The Combinatorial Optimization group provides a dynamic
international research atmosphere.

BEING A PhD STUDENT IN THE NETHERLANDS
In the Netherlands, every PhD student gets paid a salary; no additional
grants are needed. Moreover, although PhD students sometimes take courses,
there is no minimum requirement. Hence, PhD students are more like
employees than like students. Indeed, the Dutch word for PhD student
translates to "research trainee". The work of a PhD student may include
assisting in courses of BSc or MSc programs of the department. This amounts
to around 10% of the time; the remaining time is spent on research and
research-related activities. Foreign PhD students need not speak Dutch: it
is easy to get by with English, not only at the university but also in
everyday life.

WHAT WE OFFER
We offer a PhD position in Algebraic Graph Theory. Gross salary ranges from
€ 2.325 per month in the first year increasing up to € 2.972 in the fourth
year. The TU Eindhoven offers a broadpackage of fringe benefits (e.g.
excellent technical infrastructure, child daycare and excellent sports
facilities).

FURTHER INFORMATION
For more information about the project or about the working conditions,
please contact Aida Abiad (a.abiad.monge@tue.nl), or Frits Spieksma (
f.c.r.spieksma@tue.nl ).

HOW TO APPLY
Applications should be done through the following website:
https://jobs.tue.nl/en/vacancy/phd-position-in-algebraic-graph-theory-at-tu-eindhoven-850544.html

Besides personal and contact information, you should upload three PDF
documents:
* a letter of motivation (named motivation.pdf)
* a CV (named cv.pdf)
* a list of courses and grades (named courses.pdf)
Do not upload any other documents.

Closing Date: 10 May 2020

[DMANET] IEEE SmartSys 2020: COVID-19 updates and Deadline Extension

After evaluating the current situation and in accordance with SMARTCOMP
organizers, the organizing committee has decided to postpone IEEE SmartSys
2020 and reschedule it for 14-17 September 2020. The workshop will still
take place in Bologna, Italy. Proceedings will not be cancelled, and
publications will continue as planned.

All deadlines have been postponed as well, as specified below.

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

CALL FOR PAPERS - IEEE SmartSys 2020

Fifth IEEE Workshop on Smart Service Systems (SmartSys)

Co-located with the IEEE International Conference on Smart Computing
(SMARTCOMP 2020)

Bologna, Italy., September 14, 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

Manuscript submission: 15 May, 2020

Paper acceptance notification: 16 June, 2020

Camera-ready paper submission: 30 June, 2020

Workshop date: 14-17 September, 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

Tuesday, April 28, 2020

[DMANET] Professor in Software Technologies for Complex Software Systems, Linkoping university, Sweden

Professor in Software Technologies for Complex Software Systems, Linköping university, Sweden

Description of the subject area:
The position is associated with the Wallenberg AI, Autonomous Systems and Software Program (WASP) which is Sweden's largest individual research program ever; a major national initiative for strategically motivated basic research, education and faculty recruitment (see https://wasp-sweden.org<https://wasp-sweden.org/>) with a total budget exceeding USD500 million. WASP is hosted by Linköping University and comprises five Swedish full partner universities and a substantial part of Swedish industry and commerce. The WASP initiative includes among many instruments an international recruitment program that includes the present position.

The focus of the position is development of tools and technologies for developing and maintaining complex software systems.

Examples of expertise sought after include
· Tools for model-driven software engineering where in particular graphical entities and declarative formalisms constitute core modeling concepts from which software system or cyber-physical systems can be prototyped or automatically synthesized;
· Tools and technologies for developing and maintaining heterogeneous and distributed software architectures whiles building appropriate abstractions supporting e.g. virtualization and cloud computing;
· State of the art tools and technologies for scalable test- and verification of very large complex software systems.

For more details please follow the link below:

https://liu.se/en/work-at-liu/vacancies?rmpage=job&rmjob=13705&rmlang=UK

Mariam Kamkar, Professor
Department of computer and Information Science
Linkoping University, Sweden

**********************************************************
*
* 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] Reminder: Next talk in Frontiers of Parameterized Complexity on April 30, 2020 by Daniel Lokshtanov

This is a reminder for this week's talk in the newly launched online
seminar series on Frontiers of Parameterized Complexity. More details
about the seminar series can be found here:
https://frontpc.blogspot.com/2020/04/talks-schedule.html

This week's talk will be held on April 30, 2020 at 17:00 GMT+2.

The link to join the meeting on Zoom is https://uib.zoom.us/j/4231169675
Meeting ID: 423 116 9675
Password: Name of the W[1]-complete problem, 6 letters, all capital.
Also known as a set of pairwise adjacent vertices.

Speaker: Daniel Lokshtanov, UCSB
Title: A Parameterized Approximation Scheme for Min k-Cut
Abstract: In the Min k-Cut problem, input is an edge weighted graph G
and an integer k, and the task is to partition the vertex set into k
non-empty sets, such that the total weight of the edges with endpoints
in different parts is minimized. When k is part of the input, the
problem is NP-complete and hard to approximate within any factor less
than 2. Recently, the problem has received significant attention from
the perspective of parameterized approximation. Gupta {\em et al.}
[SODA 2018] initiated the study of FPT-approximation for the Min
k-Cut problem and gave an 1.9997-approximation algorithm running in
time 2^{O(k^6}n^{O(1)}. Later, the same set of authors~[FOCS 2018]
designed an (1 +\epsilon)-approximation algorithm that runs in time
(k/\epsilon)^{O(k)}n^{k+O(1)}, and a 1.81-approximation algorithm
running in time 2^{O(k^2)}n^{O(1)}. More, recently, Kawarabayashi and
Lin~[SODA 2020] gave a (5/3 + \epsilon)-approximation for Min k-Cut
running in time 2^{O(k^2 \log k)}n^{O(1)}.

In this paper we give a parameterized approximation algorithm with
best possible approximation guarantee, and best possible running time
dependence on said guarantee (up to Exponential Time Hypothesis (\ETH)
and constants in the exponent). In particular, for every \epsilon > 0,
the algorithm obtains a (1 +\epsilon)-approximate solution in time
(k/\epsilon)^{O(k)}n^{O(1)}. The main ingredients of our algorithm
are: a simple sparsification procedure, a new polynomial time
algorithm for decomposing a graph into highly connected parts, and a
new exact algorithm with running time s^{O(k)}n^{O(1)} on unweighted
(multi-) graphs. Here, s denotes the number of edges in a minimum
k-cut. The later two are of independent interest.

For more details please contact one of the following.

Roohani Sharma: roohani@imsc.res.in
Saket Saurabh: saket@imsc.res.in
Fedor Fomin: Fedor.Fomin@uib.no

Best regards and cheers!

**********************************************************
*
* 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 speakers: special stream on Resilient transportation for INFORMS 2020

Dear colleagues,

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

[DMANET] Call for submissions - Special issue of Mathematical Programming, Series B, on "Mathematical Optimization and Fair Social Decisions"

Dear Colleagues,

Please find below the call for submissions of the special issue on MPB dedicated to the International Conference on Mathematical Optimization for Fair Social Decisions: A tribute to Michel Balinski, https://tombalinski.sciencesconf.org <https://tombalinski.sciencesconf.org/>

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

Special issue of Mathematical Programming, Series B, on "Mathematical Optimization and Fair Social Decisions"

This special issue is dedicated to the International Conference on Mathematical Optimization for Fair Social Decisions: A tribute to Michel Balinski, https://tombalinski.sciencesconf.org <https://tombalinski.sciencesconf.org/>

We solicit high-quality, multi-disciplinary contributions that address mathematical (continuous and discrete) optimization (algorithms and modeling) in the context of game theory, voting, matching, fair division, cost-sharing, social choice, mechanism design, price of anarchy, and other areas relevant to social decisions. Papers that are only social science are not suitable for this special issue as well as papers that only consider optimization.

All submissions should be at most 25 pages in length, and will be peer-reviewed to the standard of Mathematical Programming. Authors should submit their papers electronically at https://www.editorialmanager.com/mapr/default.aspx <https://www.editorialmanager.com/mapr/default.aspx> selecting Article Type "MPB - Special Issues Only", entering the relevant information, and selecting Section/Category "Series B - S.I. Mathematical Optimization and Fair Social Decisions". The deadline for submission is December 15, 2020.
Additional information about the special issue can be obtained from the Guest Editors.
We are looking forward to receiving your contribution.

Guest Editors:

Mourad Baiou, baiou@isima.fr <mailto:baiou@isima.fr>
José Correa, correa@uchile.cl <mailto:correa@uchile.cl>

Rida Laraki, rida.laraki@gmail.com <mailto:rida.laraki@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] AICCSA 2020 CFP: 17th ACS/IEEE International Conference on Computer Systems and Applications, Antalya, Turkey, November 2-5, 2020

[Apologies if you got multiple copies of this invitation]

17th ACS/IEEE International Conference on Computer Systems and Applications
(AICCSA 2020)

Antalya, Turkey, November 2-5, 2020

http://www.aiccsa.net/AICCSA2020/

*AICCSA 2020 - Call for Papers*

I M P O R T A N T A N N O U N C E M E N T

Given the current COVID-19 situation, the AICCSA board is studying
different options regarding the 2020 edition of the conference that will
cope with sanitary security policies, and guarantee the promotion of
scientific interaction and dissemination of research results.

Meanwhile we encourage authors to submit papers until the *15th May
Extended Deadline.*

*Possible papers extended versions in a special issue of the Cluster
Computing journal*

The ACS/IEEE International Conference on Computer Systems and Applications
(AICCSA) is the premier conference covering all contemporary areas in
computer systems and applications and hence it is an international forum
for leading researchers and practitioners in this important and rapidly
changing disciplines. AICCSA 2020, to be held in the city of Antalya,
Turkey.

We are pleased to invite you to submit original contributions to AICCSA'20
via the official submission system for the conference
https://easychair.org/conferences/?conf=aiccsa2020 .

Paper submissions can report technical and experimental results,
theoretical studies, conceptual studies, and surveys. All submissions will
be double-blind and peer-reviewed on the basis of relevance, originality,
importance and clarity of their contribution.

Topics of interest will fall under one or more of the conference tracks.
Click on each track for more information.

*Track 1: AI, Agent Systems and Ambient Intelligence*

*Track 2: Semantics and Knowledge Management*

*Track 3: Security, Privacy and Trust*

*Track 4: Networking, IoT, and Sensors*

*Track 5: Electronics and power systems*

*Track 6: Databases and Information Systems*

*Track 7: Multimedia, Computer Vision and Image Processing*

*Track 8: Parallel and Distributed Systems*

*Track 9: Data Science*

*Track 10: Software Engineering*

*Track 11: Natural Language Processing and Applications*

* Submission Guidelines and Proceeding*

Manuscripts should be prepared in 10-point font using the IEEE 8.5" x 11"
two-column conference format. All papers should be submitted electronically
as PDF files on https://easychair.org/conferences/?conf=aiccsa2020
*. * Submitted
papers must present original unpublished research that is not currently
under review for any other conference or journal. Papers not following
these guidelines may be rejected without review. Besides, submissions
received after the due date, exceeding length limit, or not appropriately
structured will not be considered. Authors may contact the Program Chair
for further information or clarification.

All submissions are blind peer-reviewed by at least three reviewers.
Accepted papers will appear in the Conference Proceedings and published by
the IEEE Computer Society Conference Publishing Services and will be
submitted to IEEE Xplore for inclusion. Submission of regular papers must
not exceed 8 pages. Each submission must include, outside the main body of
the paper, up to 7 keywords, complete postal and e-mail address, and fax
and phone numbers of the corresponding author. Authors of accepted papers
are expected to present their work at the conference. Submitted papers that
are deemed of good quality but that could not be accepted as regular papers
will be accepted as short papers.

*Double-Blind Peer Review Guidelines*

AICCSA 2020 uses double-blind review, which means that both the reviewer
and author identities are concealed from the reviewers, and vice versa,
throughout the review process. To facilitate this, authors need to ensure
that their manuscripts are prepared in a way that does not give away their
identity or affiliation.

*Information to help prepare the Blinded Manuscript*

Besides the obvious need to remove names and affiliations under the title
within the manuscript, there are other steps that need to be taken to
ensure the manuscript is correctly prepared for double-blind peer review.
To assist with this process the key items that need to be observed are as
follows:

− Use the third person to refer to work the Authors have previously
undertaken, e.g. replace any phrases like "as we have shown before" with "…
has been shown before [Anonymous, 2007]".

− Make sure figures do not contain any affiliation related identifier

− Do not eliminate essential self-references or other references but
limit self-references only to papers that are relevant for those reviewing
the submitted paper.

− Cite papers published by the Author in the text as follows:
'[Anonymous, 2007]'.

− For blinding in the reference list: '[Anonymous 2007] Details
omitted for double-blind reviewing.'

− Remove references to funding sources.

− Do not include acknowledgments

− Remove any identifying information, including author names, from
file names and ensure document properties are also anonymized.

*Special Issues*

*All regular papers that will be presented during the conference will be
invited for submission to the special issue of the Cluster Computing
journal. The expanded version of the conference paper with more complete
description of the work and additional results will undergo peer review
process. *

*Important Dates *

Main conference papers deadline: *15th May 2020 (Extended)*

Notification: 30th June 2020

Camera-ready: 1st August 2020

Registration: 1st September 2020

Conference dates: from 2 Nov. 2020 to 5 Nov. 2020

Please send any inquiry on AICCSA 2020 to: mail@aiccsa.net

Theory Announcements

Thursday, April 30, 2020

[DMANET] PhD and Postdoc Positions in Mathematical Programming at Johannes Kepler University Linz, Austria

[DMANET] Online Seminar on Frontiers of Parameterized Complexity: May 07, 2020 -- Jason Li

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

[DMANET] SAGT 2020 - Call for Papers

[DMANET] Call for papers ICCL2020 - Deadline extended

[DMANET] PhD position at KU Leuven

[DMANET] CFP FedCSIS 2020

[DMANET] PhD positions in Bioinformatics / Computational Biology at Georgia State

Wednesday, April 29, 2020

[DMANET] ALGOSENSORS 2020: International Symposium on Algorithms and Experiments for Wireless Sensor Networks

[DMANET] Wi-DroIT 2020 – 2nd International Workshop on Wireless Drones over Internet of Things

[DMANET] IPEC 2020: First Call for Papers

[DMANET] QBF 2020 - updated call for papers

[DMANET] Workshop on Nonmonotonic Reasoning (NMR 2020)

[DMANET] PhD position in Algebraic Graph Theory at TU Eindhoven

[DMANET] IEEE SmartSys 2020: COVID-19 updates and Deadline Extension

Tuesday, April 28, 2020

[DMANET] Professor in Software Technologies for Complex Software Systems, Linkoping university, Sweden

[DMANET] Reminder: Next talk in Frontiers of Parameterized Complexity on April 30, 2020 by Daniel Lokshtanov

[DMANET] Call for speakers: special stream on Resilient transportation for INFORMS 2020

[DMANET] Call for submissions - Special issue of Mathematical Programming, Series B, on "Mathematical Optimization and Fair Social Decisions"

[DMANET] AICCSA 2020 CFP: 17th ACS/IEEE International Conference on Computer Systems and Applications, Antalya, Turkey, November 2-5, 2020

Mailing Lists

Search This Blog

Blog Archive

Thursday, April 30, 2020

Wednesday, April 29, 2020

Tuesday, April 28, 2020

Mailing Lists

Subscribe To

Search This Blog

Blog Archive