Sunday, January 31, 2021

[DMANET] WADS 2021 Second Call for Papers

SECOND CALL FOR PAPERS

WADS 2021

Algorithms and Data Structures Symposium

August 9-11, 2021
Dalhousie University, Halifax, Nova Scotia, Canada

The Algorithms and Data Structures Symposium, WADS, which alternates with the Scandinavian Symposium and Workshops on Algorithm Theory, SWAT, is intended as a forum for researchers in the area of design and analysis of algorithms and data structures.

We invite submissions of papers presenting original research on the theory and application of algorithms and data structures in all areas, including combinatorics, computational geometry, databases, graphics, and parallel and distributed computing.

Contributors are invited to submit a full paper in Springer LNCS format. The title, abstract, and body of the paper may not exceed 12 pages and the total length including references may not exceed 14 pages. An appendix, beyond the 14 pages, may be added and may be read at the reviewers' discretion. Please format your paper in the Springer Lecture Notes style available here: http://www.springer.de/comp/lncs/authors.html.
Submissions will be handled through EasyChair https://easychair.org/conferences/?conf=wads2021
For further information, see the WADS 2021 website https://projects.cs.dal.ca/wads2021/

WADS participates in SafeToC http://safetoc.org and is committed to preventing and combatting harassment in the Theory of Computing community. The ToC advocates for WADS are Faith Ellen and Stephane Durocher. Authors who submit papers will have an opportunity to declare a conflict of interest with potential reviewers. See the WADS web page for further details on Conflict of Interest https://projects.cs.dal.ca/wads2021/code-of-conduct/.

WADS 2021 will have a best paper award in memory of Alejandro Lopez-Ortiz, and a best all-student paper award. The conference proceedings will be published in the Springer Verlag series Lecture Notes in Computer Science. Two special issues of papers selected from WADS are planned for the journals Algorithmica and Computational Geometry: Theory and Applications.

WADS 2021 is planned for August 9-11, 2021. The symposium will most likely be fully online. It may have an in-person component, which will be held at Dalhousie University, Halifax, Nova Scotia, Canada. This depends on the covid-19 situation. In any case, authors of accepted papers who cannot attend in person will be able to give their talks online.

CCCG 2021, the 33rd Canadian Conference on Computational Geometry, is planned for August 10-12 at the same location.

IMPORTANT DATES

Paper submission deadline February 20, 2021, 23:59 anywhere on earth (UTC -12)
Acceptance/rejection notification April 13, 2021
Camera-ready version due May 21, 2021
Symposium August 9-11, 2021

INVITED SPEAKERS

Vida Dujmović, University of Ottawa
Ola Svensson, EPFL

PROGRAM COMMITTEE

Chairs
Meng He, Dalhousie University, Canada (local arrangements)
Anna Lubiw, University of Waterloo, Canada
Mohammad Salavatipour, University of Alberta, Canada

Mohammad Ali Abam, Sharif University of Technology, Iran
Ahmad Biniaz, University of Windsor, Canada
Anthony Bonato, Ryerson University, Canada
Parinya Chalermsook, Aalto University, Finland
Steven Chaplick, Maastricht University, Netherlands
Giordano Da Lozzo, Roma Tre University, Italy
Khaled Elbassioni, Khalifa University, Abu Dhabi, United Arab Emirates
Ruy Fabila-Monroy, CINVESTAV, Mexico
Moran Feldman, University of Haifa, Israel
Travis Gagie, Dalhousie University, Canada
Pinar Heggernes, University of Bergen, Norway
Zhiyi Huang, University of Hong Kong, Hong Kong
John Iacono, Université Libre de Bruxelles, Belgium
Shahin Kamali, University of Manitoba, Canada
Matya Katz, Ben-Gurion University of the Negev, Israel
Guohui Lin, University of Alberta, Canada
Brendan Lucier, Microsoft Research, USA
Pat Morin, Carleton University, Canada
Yakov Nekrich, Michigan Technological University, USA
Yoshio Okamoto, University of Electro-Communications, Japan
Denis Pankratov, Concordia University, Canada
Venkatesh Raman, Institute of Mathematical Sciences, Chennai, India
Laura Sanita, Eindhoven University of Technology, Netherlands
Jose Soto, University of Chile, Chile
He Sun, University of Edinburgh, Scotland, UK
Dimitrios Thilikos, Université de Montpellier, France
Aravindan Vijayaraghavan, Northwestern University, USA
Carola Wenk, Tulane University, 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] CFP: IEEE Int. Conferences (TrustCom, BigDataSE, CSE, EUC, iSCI) in Shenyang, Liaoning, China, 18-20 August 2021

*** IEEE (TrustCom, BigDataSE, CSE, EUC, iSCI) International Conferences ***

To be held in Shenyang, Liaoning, China, 18-20 August 2021.

The 20th IEEE International Conference on Trust, Security and Privacy in
Computing and Communications (IEEE TrustCom 2021)
https://trustcom2021.sau.edu.cn/

The 15th IEEE International Conference on Big Data Science and Engineering
(IEEE BigDataSE 2021)

https://bigdatase2021.sau.edu.cn/

The 24th IEEE International Conference on Computational Science and
Engineering (IEEE CSE 2021)

https://cse2021.sau.edu.cn/

The 19th IEEE International Conference on Embedded and Ubiquitous Computing
(IEEE EUC 2021)

https://euc2021.sau.edu.cn/

The 9th IEEE International Conference on Smart City and Informatization

(IEEE iSCI 2021)

https://isci2021.sau.edu.cn/

Sponsored by

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

IMPORTANT DATES

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

Workshop Proposal Due: 1 March 2021

Paper Submission Deadline: 20 March 2021

Authors Notification: 30 May 2021

Camera-Ready Paper Due: 10 July 2021

Early Registration Due: 10 July 2021

Conference Date: 18-20 August 2021

PAPER SUBMISSION GUIDELINE

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

Submissions must include an abstract, keywords, the e-mail address of the
corresponding author and should not exceed 8 pages for main conference,
including tables and figures in IEEE CS format. The template files for
LATEX or WORD can be downloaded here
<https://www.ieee.org/conferences/publishing/templates.html>. All paper
submissions must represent original and unpublished work. Each submission
will be peer reviewed by at least three program committee members.

Submit your paper(s) in PDF file at the submission sites:

https://trustcom2021.sau.edu.cn/

https://bigdatase2021.sau.edu.cn/

https://cse2021.sau.edu.cn/

https://euc2021.sau.edu.cn/

https://isci2021.sau.edu.cn/

Manuscript Templates for Conference Proceedings can be found at
https://www.ieee.org/conferences_events/conferences/publishing/templates.html

All accepted papers are expected to be included in IEEE Xplore and will be
indexed by Engineering Index (EI). The authors of selected best papers will
be invited post conference to extend their contributions for special issues
of prestigious journals to be planned in conjunction with the conference.

**********************************************************
*
* 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] CTW2020: CfP Special Issue DAM - Deadline Extended

*Call for Papers *
*Discrete Applied Mathematics *
Special Issue: 18th Cologne-Twente Workshop on Graphs and Combinatorial
Optimization (CTW 2020)

Following the tradition of previous CTWs, a special issue of Discrete
Applied
Mathematics will be devoted to the 18th Cologne-Twente Workshop on Graphs
and Combinatorial Optimization (CTW 2020, https://ctw2020.iasi.cnr.it),
held online on September 14–16, 2020 and organized by CNR-IASI, University
of Rome "Tor Vergata," University "Roma Tre" and CNRS-LIX-Ecole
Polytechnique Palaiseau.
All interested researchers are invited to contribute to this special
volume. The topics should be related to the themes of the workshop

graph theory,
combinatorial optimization,
design and analysis of algorithms,
theory and applications of mathematical programming with discrete variables.

Contributions arising from papers given at the workshop should be
substantially extended and should cite the conference paper.
Submissions of contributions not presented at the workshop are also welcome.
All articles will be thoroughly refereed according to the high standards of
Discrete Applied Mathematics.
The full papers must be submitted through the Elsevier Editorial System
(http://ees.elsevier.com/dam). When submitting your paper, be sure to
specify that the paper is a contribution for the special issue of *CTW 2020*,
so that your paper is assigned to the guest editors. Please see the Author
Instructions on the site if you have not yet submitted a paper through this
web-based system. Be sure to note that your work is intended for the
Special Issue and to select the article type *CTW 2020.*

The deadline for submission is extended to *April 30, 2021*.

Accepted papers will be published online individually, before print
publication.

We are looking forward to receiving your contribution.

The Guest Editors,
Claudio Gentile, Gaia Nicosia, Andrea Pacifici, Giuseppe Stecca, Paolo
Ventura

--
*DAM Special Issue on *
*http://ctw2020.iasi.cnr.it <http://ctw2020.iasi.cnr.it>*
*18th Cologne-Twente Workshop on Graphs and Combinatorial Optimization*
*Moving ONLINE - September 14-16, 2020*
--
Claudio Gentile
Istituto di Analisi dei Sistemi ed Informatica "Antonio Ruberti" (IASI-CNR)
Via dei Taurini, 19 - I 00185 Roma Italy.
Tel: +39 06 4993 7128 - Fax: +39 06 49937106 - e-mail: gentile@iasi.cnr.it

Saturday, January 30, 2021

[DMANET] 2021 MIP Workshop is back online: Save the Date & Call for Post

The 18th Mixed Integer Programming Workshop will be held online on May 24-27, 2021. Mark your calendars!
MIP is a single-track workshop highlighting the latest trends in integer programming and discrete optimization, with invited speakers covering topics of interest to the community, including theory, computational issues and applications.
The website of MIP 2021 can be found at https://sites.google.com/view/mipworkshop2021/.

*Call for Student Poster Submissions*
The workshop will include a virtual poster session reserved to students and a best poster award. Students can submit an abstract of their poster at https://forms.gle/1ZnguCHiNM9kbVNy9.
The abstract format is: a PDF file, one letter-size page maximum, one-inch margins, 11-point font, single-space. Only students may submit poster abstracts. The program committee will select poster presenters and finalists. Only finalists will compete for the best poster award.
The deadline for poster submissions is April 1, and the committee will communicate decisions to submitting students by April 15. The poster presenters will be asked to upload a video recording of their presentation before the workshop. Please contact mip.posters2021@gmail.com if you have any questions.

*MIP 2021 Confirmed Speakers*
Amitabh Basu (Johns Hopkins University)
Daniel Bienstock (Columbia University)
Karthekeyan Chandrasekaran (UIUC)
Sanjeeb Dash (IBM Research)
Jesús De Loera (UC Davis)
Ambros Gleixner (ZIB)
Jamie Haddock (UCLA)
Gregor Hendel (FICO)
Christopher Hojny (TU/e)
Aleksandr Kazachkov (University of Florida)
Elias Khalil (University of Toronto)
Fatma Kilinç-Karzan (CMU)
Jon Lee (University of Michigan)
Jannik Matuschke (KU Leuven)
Andrea Qualizza (Amazon)
Thiago Serra (Bucknell University)
Siqian Shen (University of Michigan)
Dan Steffy (Oakland University)
Noriyoshi Sukegawa (Tokyo University of Science)
Jose Verschae (Pontificia Universidad Católica)
Boshi Yang (Clemson University)

*MIP 2020 Program Committee*
Timo Berthold (FICO & Zuse Institute Berlin)
Yuri Faenza (Columbia University)
Robert Hildebrand (Virginia Tech)
Carla Michini (University of Wisconsin-Madison)
Yuan Zhou (University of Kentucky)

**********************************************************
*
* 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, January 29, 2021

[DMANET] Stream Software for Optimization at EURO31 (half-virtual / Athens, Greece, 11-14 July, 2021)

Dear colleagues,

We (Timo Berthold, Bob Fourer, Susanne Heipcke) are organizing a stream on the topic of "Software for Optimization" at the 31st EURO Conference, currently planned to take place in Athens, Greece, on 11-14 July, 2021.

We invite submissions on all aspects of software for optimization, including topics such as
- advances and new features for LP/MIP solvers (session code 6ee3c870)
- software for solving NLP and MINLP problems (session code 01fdda27)
- other optimization software, including solvers working with other problem
formulation paradigms such as Constraint Programming or local search (session
code 9c0bd769)
- modelling tools and software for representing mathematical optimization problems (session code ab2a7b35)
- software for deploying optimization projects (session code 93ad51b6)

The abstract submission system is available online, via the conference web page: https://euro2021athens.com/ and also directly: https://www.euro-online.org/conf/euro31/

Abstracts must be written in English and contain no more than 1,500 characters in plain text format (no formulas are allowed).

The submission deadline is February 28, 2021.

Of course, no one can foresee whether the event will be able to take place as planned. Currently, EURO is planned to be held as a combined half virtual, half physical event. It might become fully virtual. Given that the author registration deadline is not until mid-May, however, there will be plenty of time to consider plans.

Best regards,
Timo Berthold

**********************************************************
*
* 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 - Conference CP2021 - Montpellier - October 25 to 29, 2021

Call For Papers CP2021 <https://cp2021.a4cp.org/>

The Twenty-Sixth Conference on Principles and Practice of Constraint Programming CP 2021 <https://cp2021.a4cp.org/> will take place in Montpellier, France from October 25 to 29, 2021. Montpellier is in the south of France, only 11km away from the Mediterranean and easily accessible by plane and rail. See details in the local information page <https://cp2021.a4cp.org/local.html>
The CP conference series concerns all aspects of computing with constraints, including: theory, algorithms, environments, languages, models, systems, and applications. It welcomes submissions that advance the state of the art for the underlying technologies as well as papers that explore the role of constraint programming within other disciplines such as, for instance: operation research, machine learning and verification.

The CP 2021 programme will include presentations of high-quality scientific papers and tutorials on both theory and applications. Invited talks will describe important topics relevant to the field. The CP programme also welcomes workshops for discussing in-progress work and provides support to students through its doctoral program, which includes a dedicated one day doctoral conference, mentorship by experienced researchers and more.

Tracks

The conference features a main /Technical Track/, and /Thematic/ tracks:

Application
CP and Machine Learning
CP and Operations Research
Testing and Verification
Important dates

All deadlines are AoE. Dates are intended as anywhere on Earth <https://www.timeanddate.com/time/zones/aoe>.

May 14, 2021 Abstract Submission
May 21,2021 Full Paper submission
June 21, 2021 Author response due
July 5, 2021 Final Notification
July 19, 2021 Camera-ready
Submissions Instructions

Paper submission is via EasyChair (CP 2021) <https://easychair.org/my/conference?conf=cp2021#>. Each submission should be directed to the suitable track.

CP21 is switching from Springer to LIPIcs for its proceedings. It is therefore crucial for authors to follows the guidelines provided below and not start from an old style file that is appropriate for Springer only.

The submissions should be submitted in the form of a PDF file following LIPIcs guidelines. <https://submission.dagstuhl.de/documentation/authors> The site linked above has examples and the necessary style files. Please read the directions <https://submission.dagstuhl.de/styles/instructions/52> attentively as specific LaTeX packages are prohibited or restricted.
Other Informations

Questions about the paper submission process may be addressed to the Program Chair Laurent Michel <mailto:ldm+cp21@engr.uconn.edu>.

Website

https://cp2021.a4cp.org/ <https://cp2021.a4cp.org/>

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

[DMANET] DCOSS 2021 -- 2 WEEKS to the Extended Deadline (February 12)

============================================================
The 17th Annual International Conference on
Distributed Computing in Sensor Systems (DCOSS 2021)*
Coral Bay, Pafos, Cyprus
June 7 - 9, 2021
www.dcoss.org

* DCOSS has always been technically co-sponsored by IEEE; approval for this
year pending.
=============================================================

****** Due to many requests the abstract and full paper submission is
extended to February 12, 2021 ******

****** NOTE: the conference will possibly allow remote presentations (or
going fully online) if needed ******

For paper submission: https://dcoss.org/paper-submission/

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

DCOSS 2021 is the 17th International Conference on Distributed Computing in
Sensor Systems to be hosted in Coral Bay, Pafos, Cyprus in June 7-9, 2021.
In the last few years, we have witnessed a significant growth in the use of
IoT and distributed sensor systems in a number of application areas,
ranging from smart transport, energy and buildings, to factory automation,
smart healthcare and environmental monitoring. In order for smart sensor
systems to truly become useful and pervasive, we need to address a number
of research challenges, including the tight integration of sensing and
machine intelligence, reliable and efficient networking, interoperability
and scalability, the need for dependable autonomy, interaction with humans,
and important aspects of security, privacy and trust. DCOSS focuses on
issues arising in the entire IoT and networked sensor systems stack:
covering aspects of high-level abstractions, models and languages, novel
algorithms and applications, system design approaches and architectures, as
well as tools for simulated and real deployments. Potential authors are
invited to submit original unpublished manuscripts that demonstrate recent
advances in both theoretical and experimental research. Topics of interest
include, but are not limited to, the following:

- Artificial Intelligence for IoT
- Smart healthcare to combat epidemics (including COVID-19)
- Edge and fog computing: distributed computing models from sensor to cloud
- Energy harvesting models and optimization
- Machine intelligence in distributed sensor systems and real time analytics
- Communication and networking primitives and protocols
- Autonomy: closing the loop between sensing and actuation
- Task allocation, reprogramming, and reconfiguration
- Robustness, resilience and dependability
- Security and privacy issues
- Approaches, tools, and experience of deployment and operation
- Performance analysis: complexity, correctness, scalability
- Mobile and human-centered sensing
- Interoperability, heterogeneity and scalability
- Crowd sensing and social sensing techniques, applications, and systems
- Complex systems comprising wearable, robotic and/or fixed sensor systems
- Novel and compelling applications
- IoT systems for emerging and developing economies
- Green and environmentally-friendly IoT

Authors are invited to submit original unpublished manuscripts that
demonstrate current research on distributed sensor systems related to DCOSS
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

Note that DCOSS does not follow the double-blind review policy. The names
and affiliations of all the authors must be present in the submitted
manuscript.

***** A Special Issue of the Computer Networks (COMNET) Elsevier Journal
will include selected best papers of DCOSS 2021. ****

Please visit DCOSS website at www.dcoss.org for more information.

******** Main Organizers ********

- Technical Program Committee Chairs:
---------------------------------------
Enzo Mingozzi (University of Pisa, Italy)
Stefano Basagni (Northeastern University, USA)
Jiannong Cao (The Hong Kong Polytechnic University)

TPC Members
------------
Carlo Alberto Boano, Graz University of Technology
Azzedine Boukerche, University of Ottawa
Kevin Chan, US CCDC Army Research Laboratory
Thomas Erlebach, University of Leicester
Raja Jurdak, Queensland University of Technology
Tomasz Jurdzinski, University of Wroclaw
Evangelos Kranakis, Carleton University
Olaf Landsiedel, Kiel University
Jun Luo, Nanyang Technological University
Prasant Misra, TATA Consultancy Services
Nathalie Mitton, Inria Lille-Nord Europe
Miguel Mosteiro, Pace University
Gian Pietro Picco, University of Trento
Cristina Pinotti, University of Perugia
Utz Roedig, University College Cork
Vasos Vassiliou, University of Cyprus
Dong Wang, University of Notre Dame
Hongkai Wen, University of Warwick
Jie Yang, Florida State University
Desheng Zhang, Rutgers University
Ambuj Varshney, University of California, Berkeley
Nicolas Tsiftes, RISE Research Institutes of Sweden
Xiaolong Zheng, Beijing University of Posts and Telecommunications
Shijia Pan, University of California Merced
Jiaxin Ding, Shanghai Jiaotong university
Chenren Xu, Peking University
Sirajum Munir, Bosch Research
Jean-Francois Chamberland, Texas A&M University
Behnam Dezfouli, Santa Clara University
Jie Gao, Rutgers University
Gaia Maselli, University of Rome
Enrico Natalizio, University of Lorraine/Loria
Theofanis Raptis, IIT-CNR
Francesco Restuccia, Northeastern University
Simone Silvestri, University of Kentucky
Eirini Eleni Tsiropoulou, University of New Mexico
Damla Turgut, University of Central Florida
Antonio Virdis, University of Pisa
Thiemo Voigt, Swedish Institute of Computer Science

- Local Chairs
----------------
Vasos Vassiliou (University of Cyprus, Cyprus)
Zinon Zinonos (Neapolis University Pafos, Cyprus)

- Workshops Chairs
-------------------
Enrico Natalizio (University of Lorraine, France)
Zhangyu Guan (University at Buffalo, USA)

- Poster & Demo Chairs
------------------------
Thomas Lagkas (International Hellenic University, Greece)
Roger Chamberlain (Washington University in St. Louis, USA)

- Proceedings Chair
-------------------
Marios Angelopoulos (Bournemouth University, UK)

- Publicity Chairs
-------------------
Eirini Eleni Tsiropoulou (University of New Mexico, USA)
Lei Shu (Nanjing Agricultural University & University of Lincoln, China/UK)
Tamoghna Ojha (Indian Institute of Technology Kharagpur, India)

- Steering Committee Chair:
---------------------------
Sotiris Nikoletseas (University of Patras and CTI, Greece)

******** Collocated Events ********

DCOSS 2021 will collocate with several thematic Workshops and Special
Sessions on emerging topics and technologies.

The event will also feature a poster and demo session.

Important Dates:
Abstract Registration Deadline: February 12, 2021
Paper Submission Deadline: February 12, 2021
Acceptance Notification: March 15, 2021
Camera Ready Deadline: March 29, 2021
Early Registration Deadline: April 22, 2021

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

--
*Dr. Tamoghna Ojha*

*General Chair, WPSN 2021 <http://wpsn2021.github.io/>Publicity
Co-Chair, DCOSS 2021 <https://dcoss.org/>PhD & MS (SWAN
<http://cse.iitkgp.ac.in/~smisra/swan/> Lab, IIT Kharagpur, India)*
URL: Personal Website <http://tamoghnaojha.github.io> LinkedIn
<http://in.linkedin.com/in/tamoghnaojha>

**********************************************************
*
* 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 in Operations Research at KU Leuven (Ref. BAP-2021-28)

The research group ORSTAT of KU Leuven (Belgium) has a vacancy for one full-time PhD scholarship starting in September 2021, for a period of four years. The researcher to be hired will work in the field of operations research (OR) under the supervision of Prof. Roel Leus; this work should lead to a PhD degree. Some keywords of our research area are: combinatorial optimization, integer (linear) programming, stochastic and robust optimization, algorithm design, ... The candidate will work on the development of models and algorithms at the interface of discrete optimization, scheduling, project management, and innovation. He/she will find a dynamic and pleasant working environment, in a group that is actively involved in scientific research at the highest international level.

Candidates will be expected to participate in seminars and conferences, be internationally mobile and to enroll in our PhD program. The candidate can be asked to give guidance to Bachelor and Master students, to be involved in teaching activities and to supervise exams.

Candidates should have a strong interest in OR and preferably hold a Master's degree in Business Engineering (Handelsingenieur), Mathematics, Computer Science, Industrial Engineering, Operations Research, or equivalent. Graduation with honors in preliminary studies is a requirement, as well as an appropriate command of written and spoken English. Experience with at least one programming language is an asset. Students that are currently in the final year of their Masters are especially encouraged to apply.

We offer an employment as full-time doctoral scholar for 1 year, renewable up until max. 4 years after positive evaluation. The tentative starting date is September 20, 2021, depending on the availability of the candidate. For more information please contact prof. dr. Roel Leus, mail: roel.leus@kuleuven.be<mailto:roel.leus@kuleuven.be>, or dr. Ben Hermans, mail: ben.hermans@kuleuven.be<mailto:ben.hermans@kuleuven.be>.

You can apply for this job no later than April 05, 2021. Applications can only be received via KU Leuven's online application tool at the webpage https://www.kuleuven.be/personeel/jobsite/jobs/56144997?hl=en (ref. BAP-2021-28), the university does not accept applications via any other way. When applying, you must upload a motivation letter and cv in pdf. In the motivation letter you should specifically indicate why you are the right person for the vacant position. You can also upload a publication list, photo and/or other attachments.

KU Leuven seeks to foster an environment where all talents can flourish, regardless of gender, age, cultural background, nationality or impairments. If you have any questions relating to accessibility or support, please contact us at diversiteit.HR@kuleuven.be<mailto:diversiteit.HR@kuleuven.be> .

**********************************************************
*
* 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 parameterized algorithms / kernelization at TU Eindhoven

The Algorithms group of TU Eindhoven is offering a postdoc position in parameterized algorithms and kernelization, funded by the ERC Starting grant 'ReduceSearch'. For more information about the positions and how to apply, please visit:

https://jobs.tue.nl/en/vacancy/postdoc-reducesearch-869807.html

For your convenience I have copied the text from this website below.

-- Bart M. P. Jansen

TU Eindhoven is offering a postdoc position for a talented and motivated researcher with a strong interest in algorithms and complexity. The research is supported by ERC Starting grant "Rigorous Search Space Reduction" and is aimed at advancing the theory of algorithmic preprocessing. The project investigates questions such as: why does preprocessing lead to such large speedups for some NP-hard problems? How does a preprocessing algorithm reduce the search space of the follow-up algorithm? Which aspects of a problem input make it amenable to preprocessing? How can new preprocessing algorithms be developed that deliver speedups of several orders of magnitude? These questions are tackled using the framework of parameterized complexity and kernelization, and are asked for a diverse set of NP-hard problems concerning graphs, logic, and constraint satisfaction.

The position is supervised by dr. Bart M. P. Jansen (https://www.win.tue.nl/~bjansen/ )

-- Job requirements --

The postdoctoral candidate is required to have a strong background in algorithms or computational complexity. Experience within the domain of parameterized complexity, kernelization, or constraint satisfaction problems is a plus. Candidates are expected to be fluent in English, both oral and in writing, and to have obtained a PhD degree.

The postdoctoral candidate will be expected to conduct independent research on topics relevant to the above agenda, to publish this research at conferences and journals, and to cooperate with the PhD candidates and principal investigator of the ReduceSearch project. The position does not have any required teaching duties. If the postdoctoral candidate wishes to further their development by assisting with the daily supervision of master- or PhD students, there will be opportunities to do so.

The starting date is negotiable. A starting date in the first half of 2021 is preferred. The position is offered for a period of one year, which may be extended.

-- Conditions of employment --

A meaningful job in a dynamic and ambitious university with the possibility to present your work at international conferences. The position comes with ample travel budget to engage in research activities abroad.
A full-time employment for 1 year with the possibility of an extension.
You will have free access to high-quality training programs for research and valorization, professional development courses, and didactical courses of the TEACH training program.
A gross monthly salary (scale 10: € 2.790 - € 4.402 depending on experience) and benefits in accordance with the Collective Labor Agreement for Dutch Universities
A broad package of fringe benefits (including an excellent technical infrastructure, moving expenses, and savings schemes).
Family-friendly initiatives are in place, such as an international spouse program, and excellent on-campus children day care and sports facilities.

-- How to apply --

If you are interested in the postdoc position and would like to apply, please send us your application by using the 'apply for this job' button at the top of this page. Your application must contain the following documents:

• A motivation letter describing your background and reasons for applying for this position.
• A 1-page research statement describing research interests and goals.
• A detailed CV including a publications list and overview of presentations at scientific meetings.
• Names and contact information of two academic references.

You can upload only 5 documents up to 2 MB each. Please send us your application before February 28 , 2021. You can only apply using the "Apply now button" on the website of the Technical University of Eindhoven.

Screening of applicants will start as soon as applications are received and will continue until the positions have been filled.

-- About the research environment --

TU Eindhoven features a rich environment for algorithmic research. The cluster Algorithms, Geometry, and Applications, including full professors Mark de Berg and Bettina Speckmann investigates (parameterized, approximation, and classic) algorithms for problems in computational geometry and graph theory. The Combinatorial Optimization group (prof. Frits Spieksma) focuses on problems in scheduling and optimization, and includes algorithmic expert prof. Nikhil Bansal. In addition, TU Eindhoven is one of the four cornerstones of the NETWORKS project which investigates algorithmic and stochastic problems on complex networks. All combined, this research environment offers the postdoctoral researcher interesting possibilities for collaboration.

-- About TU Eindhoven --

TU Eindhoven (TU/e) is a mid-size technical university located in the heart of the high-tech industry in the Netherlands, named the Brainport region. Eindhoven is the fifth largest city in the Netherlands, and including suburbs it has about 420,000 inhabitants. TU/e is a highly ranked university both in research and education. Our training and research programs are highly regarded and we foster close relationships with companies, organizations and research institutes in the Brainport region and beyond. TU/e is a social and inspiring university with a fine culture. You'll quickly feel at home, surrounded by people who share your scientific ambitions. The TU/e currently has nine departments, with over 11,000 students in total.

-- More information --

Further information with respect to the positions can be obtained from dr. Bart M. P. Jansen via b.m.p.jansen@tue.nl
Further information concerning employment conditions can be obtained from the HR Advisor for Mathematics and Computer Science via HRServices.MCS@tue.nl
**********************************************************
*
* 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] Second call for papers --- EUROCOMB'21

*******************************************************************
SECOND CALL FOR PAPERS

European Conference on Combinatorics, Graph Theory and Applications

EUROCOMB 2021

https://eurocomb2021.upc.edu/

6-10 September 2020
*******************************************************************

The conference EUROCOMB 2021 will be held *online* September 6-10, 2021.

SCOPE

In the tradition of EUROCOMB'01 (Barcelona), EUROCOMB'03 (Prague),
EUROCOMB'05 (Berlin), EUROCOMB'07 (Seville), EUROCOMB'09 (Bordeaux),
EUROCOMB'11 (Budapest), EUROCOMB'13 (Pisa), EUROCOMB'15 (Bergen),
EUROCOMB'17 (Vienna) and EUROCOMB'19 (Bratislava), this conference will
cover the full range of Combinatorics and Graph Theory including
applications in other areas of Mathematics, Computer Science, and
Engineering.

Topics include, but are not limited to:

Algebraic Combinatorics
Combinatorial Geometry
Combinatorial Number Theory
Combinatorial Optimization
Designs and Configurations
Enumerative Combinatorics
Extremal Combinatorics
Graph Theory
Ordered Sets
Probabilistic Combinatorics
Random discrete structures
Topological Combinatorics

PLENARY SPEAKERS

Julia Böttcher (LSE, London)
Josep Díaz (UPC, Barcelona)
Louis Esperet (G-SCOP, Grenoble)
Christian Krattenthaler (U. Wien)
Sergey Norin (McGill, Montreal)
Will Perkins (UIC, Chicago)
Marcin Pilipczuk (U. of Warsaw)
Lisa Sauerman (IAS, Princeton)
Eva Tardos (Cornell, Ithaca)
David Wood (Monash, Melbourne)

IMPORTANT DATES

Abstract submission deadline: March 19th, 2021
Nominations for the European Prize in Combinatorics deadline: April 15th,
2021
Notification of acceptance of abstract: April 30th, 2021
Proceedings camera ready: May 21st, 2021
Early registration deadline: August 15th, 2021
EUROCOMB'21: 6-10 September 2021

ORGANISATION

The conference is organised by the Universitat Politècnica de Catalunya
- BarcelonaTECH. The organising committee may be contacted at:
eurocomb.2021@event.upc.edu For up-to-date information please consult the
conference web site: https://eurocomb2021.upc.edu/

SUBMISSIONS

The submission of extended abstracts for EUROCOMB'21 is open.

Submissions should describe recent original theoretical results or
applications of Combinatorics and Graph Theory.

Please use the template available in the webpage of the conference for the
submissions. They should have a maximum of 6 pages in this format. They
should be submitted as a pdf file using the interface provided on EasyChair

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

There will be a volume of CRM Research Perspectives

https://www.springer.com/series/13332

which will publish all accepted abstracts of the conference.

The deadline for submissions is March 19th, 2021.

EUROPEAN PRIZE IN COMBINATORICS

Continuing with the tradition established at EUROCOMB'03 in Prague, the
European Prize in Combinatorics will be awarded during the conference
EUROCOMB'21.

The aim of the prize is to recognise excellent contributions in
Combinatorics, Discrete Mathematics, and their applications, by young
European researchers (eligibility of EU) not older than 35 years. The prize
carries a monetary award.

A nomination letter including CV and the list of publications of the
nominee should be sent to the organisers of EUROCOMB'21 at
eurocomb.2021@event.upc.edu with subject "European prize in Combinatorics"
before April 15th, 2021.

The nominations will be evaluated by an international jury.

REGISTRATION

Registration will be open in early March 2021.

There will be a low registration fee of 40€ (regular) and 20€
(undergraduate and graduate students, retired participants) for early bird
(before August 15, 2021)

PROGRAM COMMITTEE

Maria Axenovich (KIT, Karlsruhe)
Agnes Backhausz (Eötvös Loránd U., Budapest)
Marthe Bonamy (LABRI, Bordeaux)
Michael Drmota (TUWien)
Zdenek Dvořák (Charles U., Prague)
Stefan Felsner (TU Berlin)
Ervin Gyori (Alfred Rényi Institute, Budapest)
Dan Král' (Masaryk U., Brno)
Bojan Mohar (SFU, Vancouver and U. of Ljubljana)
Rob Morris (IMPA, Rio de Janeiro)
Jaroslav Nešetřil (Charles U. and ITI, Prague), Chair
Marc Noy (UPC, Barcelona)
Patrice Ossona de Mendez (CNRS and EHESS, Paris)
Marco Pellegrini (IIT-CNR, Pisa)
Oleg Pikhurko (Warwick)
Andrzej Ruciński (UAM, Póznan and Emory)
Oriol Serra (UPC, Barcelona), Co-chair
Martin Skoviera (Comenius U., Bratislava)
Jozef Skokan (LSE, London)
Maya Stein (U. de Chile, Santiago de Chile)
Benjamin Sudakov (ETH, Zurich)
Xuding Zhu (Zhejiang Normal U., Jinhua)

[DMANET] HSCC Test-Of-Time Award - Last Call for Nominations

The HSCC 2021 organizers are soliciting nominations for the HSCC Test-of-Time Award to recognize the work published at a Hybrid Systems: Computation and Control (HSCC) conference in 2011 or before, which has proven to be the most visionary and impactful, leading to new directions of research being initiated, or new applications being brought into the hybrid systems research community. The award selection is through a committee of three internationally well-known and outstanding scientists who significantly contributed to the hybrid systems field and also to the HSCC organization. The decision to attribute the award and the choice of the awardee is at the sole discretion of the selection committee, which will carefully consider the nominated papers.

Deadline for nominating papers for the award: Jan 31, 2021, AoE

Background
The HSCC conference series, founded in a meeting in Grenoble after the HART'97 workshop, was a convergence of two trends. On one hand, at the end of the 80s, researchers in formal verification of discrete systems were exploring timed systems represented by additional clock variables, and then started branching into systems with more complex continuous dynamics as in hybrid systems. On the other hand, researchers in control were interested in using such models and verification techniques to analyze control systems that fall outside the traditional control system models, capturing the essence of real implemented control systems. The first workshop on Hybrid Systems: Computation and Control took place in 1998 at Berkeley.

This award was initiated at the 20th anniversary of HSCC in 2018 to reflect on the papers published at HSCC that have had the most impact on the larger computer science and control theory/practice community.

Previous winners can be found at hscc-conference.org<https://eur03.safelinks.protection.outlook.com/?url=https%3A%2F%2Furldefense.proofpoint.com%2Fv2%2Furl%3Fu%3Dhttp-3A__hscc-2Dconference.org%26d%3DDwMFaQ%26c%3DOCIEmEwdEq_aNlsP4fF3gFqSN-E3mlr2t9JcDdfOZag%26r%3DILcGpbaEE-6yorXSWg7iLuXnEFvtNnGZB2IZ7UfqmmE%26m%3DMbn2ydg5E6_2XGu46zea1RlOUdQ4ijJMX1OlviqMgac%26s%3DPtHMGfK0raJX-Ae37CwYWVwui_O-6YpAnTCJPEv8cak%26e%3D&data=04%7C01%7Cguillaume.berger%40uclouvain.be%7Ca65f10bf1a3e4e531bb308d8c20cff8c%7C7ab090d4fa2e4ecfbc7c4127b4d582ec%7C0%7C0%7C637472708396639344%7CUnknown%7CTWFpbGZsb3d8eyJWIjoiMC4wLjAwMDAiLCJQIjoiV2luMzIiLCJBTiI6Ik1haWwiLCJXVCI6Mn0%3D%7C1000&sdata=Nj2nSuVcMB5oX8fbnpISzgWTn6vemav56WM5EQx35HE%3D&reserved=0>.

Eligibility Rules
The paper should have been published at an HSCC conference, in 2011 or before. The paper cannot be co-authored by any person on the selection committee.

Nomination Rules and Procedure
Anyone but members of the selection committee can submit a nomination.
Nominators cannot nominate papers on which they are a co-author.
The members of the selection committee are allowed to solicit nominations.

To nominate a paper, please send an email to the HSCC 2021 Awards Chair at antoine.girard@l2s.centralesupelec.fr<mailto:antoine.girard@l2s.centralesupelec.fr> containing the following pieces of information (approximately 500 words overall):

- The title of the paper, the full list of authors, and the year of publication.
- A paragraph describing the larger context in which the work is of relevance, and explaining the importance of the work to the community.
- A second paragraph indicating the strength of the technical or experimental results, and providing some quantifiable metrics (such as number of citations as measured by Google Scholar) as a measure of the impact of the paper. Subjective evidence of the impact is also accepted.

Selection Committee:
The selection committee for this year's award is composed of the following distinguished members:
- (Chair) Thomas A. Henzinger, President, Institute of Science and Technology, Austria
- Thao Dang, Research Director, Le Centre National de la Recherche Scientifique (CNRS), France
- Emilio Frazzoli, Professor of Dynamic Systems and Control, ETH Zurich, Switzerland, and Chief Scientist, Motional Inc., USA

Award Details:
The authors of the awarded paper will be notified by the end of February. They will receive a plaque at the CPS Week banquet. There will be a cash prize associated with the award.

**********************************************************
*
* 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, January 28, 2021

Conference on Logic and Argumentation - Call for Papers

--------------------------------------------
Fourth International Conference on Logic and Argumentation (CLAR 2021)
20-22 October 2021, Hangzhou, China
Hybrid (physical or virtual attendance)
https://www.xixilogic.org/events/clar2021/
--------------------------------------------
The 4th International Conference on Logic and Argumentation (CLAR 2021) invites
contributions from logic, artificial intelligence, philosophy, computer science,
linguistics, law, and other areas studying logic and formal argumentation.

CLAR 2021 will be held in Hangzhou, 20-22 October 2021 at Zhejiang University
City College. Due to the uncertainties of the epidemiological situation, the
conference will be held in a HYBRID format (virtual and physical attendance
both accepted), and we encourage physical participation if possible.

Papers accepted to CLAR 2021 will be published as Springer LNAI proceedings,
and will be available online during the conference. Authors of selected papers
will be invited to submit an extended version to a journal special issue after
the conference.

More information about CLAR 2021 can be found at the conference website:
http://www.xixilogic.org/events/clar2021

The CLAR 2021 conference will highlight recent advances in logic and
argumentation and foster interaction between these areas within and outside
China. Previous conferences can be accessed via:
http://www.xixilogic.org/events/clar

List of Topics
--------------------
Suggested topics include, but are not limited to the following:
* Abstract argumentation
* Applications of logic and/or argumentation
* Applied logic
* Argumentation and game theory
* Argumentation and law
* Argumentation and linguistics
* Argumentation and medical reasoning
* Argumentation in AI
* Argument mining
* Argumentation schemes
* BDI logic
* Computational argumentation
* Deontic logic
* Dynamic epistemic logic and belief revision
* Formal models for dialog and argumentation
* Informal logic
* Judgment aggregation
* Knowledge representation and reasoning
* Logic for game theory
* Logic for multi-agent systems
* Logic for semantic web
* Logic for social network
* Mathematical logic
* Modal logic
* Nonmonotonic logics
* Numerical and uncertainty reasoning
* Philosophical logic
* Pragma-Dialectics
* Preference logic
* Structured argumentation
* Uncertain argumentation

Submission Guidelines
--------------------
We invite two types of submissions: full papers (12 - 20 pages) describing
original and unpublished work and extended abstracts (5 - 8 pages) of
preliminary original work or extended abstracts of already published work
(needs to be highlighted along with the title), from either the field of logic
or the field of formal argumentation. Additional support material may be
included in an appendix, which may be considered or ignored by the program
committee.

Submissions must be prepared in LaTeX, using the Springer LNCS style:
ftp://ftp.springernature.com/cs-proceeding/llncs/llncs2e.zip
Submissions not complying with these guidelines will be desk rejected.

Papers in PDF format should be submitted via EasyChair:
https://easychair.org/conferences/?conf=clar2021

Each submitted paper will be carefully peer-reviewed by a panel of PC members
based on originality, significance, technical soundness, clarity of exposition
and relevance for the conference. For each accepted paper, at least one author
is expected to register and present the paper at the conference.

Important Dates
--------------------
Submission: 30 June 2021
Notification: 1 August 2021
Camera-Ready: 15 August 2021
Conference: 20-22 October 2021

PC Chairs
--------------------
Pietro Baroni, University of Brescia
Christoph BenzmÃ¼ller, Freie UniversitÃ¤t Berlin
YÃ¬ N. WÃ¡ng, Sun Yat-sen University

For general questions or questions regarding the local organizations please
send emails to clar2021@xixilogic.org. Questions regarding the program should
go to the PC chairs directly.
--
Christoph BenzmÃ¼ller (http://christoph-benzmueller.de)

[DMANET] phd and postdoc positions at Reykjavik University

Mode(l)s of Verificaton and Monitorability

Department of Computer Science, Reykjavic University

One PhD and one postdoc position

We invite applications for a total of two positions: one PhD position and one postdoc position, at the Department of Computer Science of Reykjavik University.

The position is part of a research project funded by the Icelandic Research Fund, under the direction of Antonis Achilleos (Reykjavik University), Luca Aceto (Reykjavik University), and Anna Ingolfsdottir (Reykjavik University) in cooperation with Adrian Francalanza (University of Malta) and Karoliina Lehtinen (LIS, Aix-Marseille).

The project continues previous work in the theoretical foundations of runtime verification and its overarching goal is to better understand the properties and push the limits of monitorability in different settings. For more information on the project, please visit

https://sites.google.com/view/antonisachilleos/movemnt

or contact Antonis Achilleos (email: antonios@ru.is<mailto:antonios@ru.is>)

The successful candidates will benefit from, and contribute to, the
research environment at the Icelandic Centre of Excellence in
Theoretical Computer Science (ICE-TCS), with research groups on
concurrency, logic and semantics, algorithms, combinatorics. For
information about ICE-TCS and its activities, see

http://icetcs.ru.is/ .

Moreover, they will cooperate with Adrian Francalanza and Karoliina
Lehtinen during the project work and will benefit from the interaction
with their research groups at the University of Malta and LIS, Aix-Marseille.
*Qualification requirements*

Applicants for the postdoctoral position should have, or be about to
defend, a PhD degree in computer science or a closely related
field. Moreover, previous knowledge in logic, concurrency theory, or any
of the project's related areas, and mathematical competence are desirable.

Applicants for the PhD fellowship should have, or be about to obtain, an
MSc degree in Computer Science, or closely related fields. Some
background in logic, concurrency theory, or some other of the project's
related areas, and mathematical competence are desirable.
*Remuneration*

The PhD position provides a stipend of 383,000 ISK per month before
taxes, and the salary for the postdoc position is 460,000 ISK per month
before taxes.
*Start date and duration*

The PhD position is for three years, to start as soon as possible.

The postdoc position is for one year, to start in July or August 2021 (the start date is negotiable), and can be renewed for one more year, based on mutual agreement.

*Application details*

Interested applicants should send their CV, including a list of publications, in PDF to all the addresses below, together with a statement outlining their suitability for the project and the names of at least two referees.

Antonis Achilleos
email: antonios@ru.is<mailto:antonios@ru.is>

Luca Aceto
email: luca@ru.is<mailto:luca@ru.is>

Anna Ingolfsdottir
email: annai@ru.is<mailto:annai@ru.is>

Adrian Francalanza
email: adrian.francalanza@um.edu.mt<mailto:adrian.francalanza@um.edu.mt>

Karoliina Lehtinen
email: lehtinen@lis-lab.fr<mailto:lehtinen@lis-lab.fr>

Informal inquiries about the project and the conditions of work are very welcome.

We will start reviewing applications as soon as they arrive and will continue to accept applications until each position is filled. We strongly encourage interested applicants to send their applications as soon as possible and no later than 20 February 2021.

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

SPAA 2021 Last Call for Papers

SPAA 2021 Call for Papers

33th ACM Symposium on Parallelism in
Algorithms and Architectures

July 6 - 8, 2021
Philadelphia, PA, USA

Important Deadlines:

Abstract registration:	February 8, 2021, 11:59pm AoE
Full papers submission:	February 11, 2021, 11:59pm AoE
Rebuttal:	April 6-8, 2021
Notification:	April 18, 2021
Camera-ready:	May 16, 2021

Contributed papers are sought in all areas of parallel algorithms and architectures, encompassing any computational system that can perform multiple operations or tasks simultaneously. Topics of interest include, but are not limited to:

• Parallel and Distributed Algorithms
• Parallel and Distributed Data Structures
• Green Computing & Power-Efficient Architectures
• Management of Massive Data Sets
• Parallel Complexity Theory
• Parallel and Distributed Architectures
• Multi-Core Architectures
• Instruction Level Parallelism and VLSI
• Compilers and Tools for Concurrent Programming
• Supercomputer Architecture and Computing
• Transactional Memory Hardware and Software
• The Internet and the World Wide Web
• Game Theory and Collaborative Learning
• Routing and Information Dissemination
• Resource Management and Awareness
• Peer-to-Peer Systems
• Mobile, Ad-Hoc, and Sensor Networks
• Robustness, Self-Stabilization, and Security
• Synergy of Parallelism in Algorithms, Programming and Architecture

Submission details:

Please indicate in the title of your manuscript whether this is a regular paper or a brief announcement. All regular rejected papers automatically will be considered for brief announcements. Titles of regular papers which should not be considered for this option should mention "full paper only" after the title. Visit this link for submission details.

Regular papers:
A regular paper submission must report on original research that has not been previously or concurrently published. Submitted manuscripts may not exceed ten (10) single-spaced double-column pages. The title page and bibliography are not counted toward the ten pages. All necessary details to substantiate the claims of the paper should be included in a clearly marked appendix. If desired, the authors can simply attach a copy of the full paper as an appendix. Regular papers will be allotted 10 pages plus bibliography in the proceedings.

Brief announcements:
Examples of good brief announcements include: work in progress, announcement of tools/libraries, challenge problems posted to the community, corrections to earlier results. Brief announcements may also include smaller results of interest. Submitted manuscripts may not exceed two (2) single-spaced double-column pages for brief announcements. The title page is not counted toward the two pages.

Double-Blind Policy:
Submissions to SPAA 2021 will be double-blind. Additional details are available at this link.

Awards:

The program committee will select a set of best and outstanding papers, which will be presented in a special session of the conference.

Safe ToC:

SPAA is proud to be affiliated with the SafeToC initiative.

Program Chair

Yossi Azar, Tel Aviv University

Program Committee

Hagit Attiya, Technion
Guy Blelloch, CMU
Rezaul Chowdhury, Stony Brook University
Martin Farach-Colton, Rutgers University
Panagiota Fatourou, FORTH and University of Crete
Pierre Fraigniaud, Université de Paris and CNRS
Mohsen Ghaffari, ETH Zurich
Wojciech Golab, University of Waterloo
Rachid Guerraoui, EPFL
Sungjin Im, UC Merced
Peter Kling, University of Hamburg
Fabian Kuhn, University of Freiburg
Jing Li, NJIT
Friedhelm Meyer auf der Heide, Paderborn University
Avery Miller, University of Manitoba
Vahab Mirrokni, Google Research
Benjamin Moseley, CMU
Gopal Pandurangan, University of Houston
Boaz Patt-Shamir, Tel Aviv University
Rajmohan Rajaraman, Northeastern University
Tao B. Schardl, MIT
Julian Shun, MIT
Yihan Sun, UC Riverside
Xueyan Tang, Nanyang Technological University
Kanat Tangwongsan, Mahidol University

SPAA General Chair

Kunal Agrawal, WUSTL

------

Yan Gu
Assistant Professor,
Computer Science and Engineering Department,
University of California, Riverside

https://www.cs.ucr.edu/~ygu

Wednesday, January 27, 2021

[DMANET] ICALP 2021 - Second Call for Papers

===================================
ICALP 2021 - Second Call for Papers
===================================

http://easyconferences.eu/icalp2021/

The 48th International Colloquium on Automata, Languages, and
Programming (ICALP) will take place from 13-16 July 2021.

ICALP is the main conference and annual meeting of the European
Association for Theoretical Computer Science (EATCS). As usual, ICALP
will be preceded by a series of workshops, which will take place on 12
July 2021.

*** ICALP 2021 and its workshops will be online-only, hosted by the
University of Glasgow, UK. ***

=============== Important dates =======================

Submission deadline: Friday 12 February 2021, 23:59 AoE
Notification: Wednesday 28 April 2021
Camera-ready deadline: Friday 7 May 2021

Deadlines are firm; late submissions will not be considered.

================
Invited Speakers
================

Unifying Invited Speakers:

Adi Shamir, Weizmann Institute of Science, Israel
Toniann Pitassi, University of Toronto, Canada
Andrei Bulatov, Simon Fraser University, Canada

Track A Invited Speakers:

Keren Censor-Hillel, Technion, Israel
David Woodruff, Carnegie Mellon University, USA

Track B Invited Speaker:

Christel Baier, Technical University of Dresden, Germany

===========================
Submissions and Proceedings
===========================
ICALP proceedings are published in the Leibniz International Proceedings
in Informatics (LIPIcs) series. This is a series of high-quality
conference proceedings across all fields in informatics established in
cooperation with Schloss Dagstuhl - Leibniz Center for Informatics.
LIPIcs volumes are published according to the principle of Open Access,
i.e., they are available online and free of charge.

Submission Guidelines
---------------------
Authors are invited to submit an extended abstract of no more than 12
pages, excluding references presenting original research on the theory
of computer science. All submissions must be formatted in the LIPIcs
style
https://www.dagstuhl.de/en/publications/lipics/instructions-for-authors/)
and
submitted via Easychair to the appropriate track of the conference. The
use of pdflatex and the LIPIcs style are mandatory: papers that deviate
significantly from the required format may be rejected without
consideration of merit.

No prior publication and no simultaneous submission to other publication
outlets (either a conference or a journal) is allowed.

Technical details necessary for a proper scientific evaluation of a
submission must be included in the 12-page submission or in a clearly
labelled appendix, to be consulted at the discretion of program
committee members. Authors are strongly encouraged to also make full
versions of their submissions freely accessible in an on-line repository
such as ArXiv, HAL, ECCC.

Best Paper Awards
-----------------
As in previous editions of ICALP, there will be best paper and best
student paper awards for each track of the conference. In order to be
eligible for a best student paper award, a paper should be authored only
by students and should be marked as such upon submission.

Topics
======
Papers presenting original research on all aspects of theoretical
computer science are sought. Typical but not exclusive topics of
interest are:

Track A: Algorithms, Complexity and Games
-----------------------------------------
* Algorithmic and Complexity Aspects of Network Economics
* Algorithmic Aspects of Networks and Networking
* Algorithmic Aspects of Security and Privacy
* Algorithms for Computational Biology
* Algorithmic Game Theory and Mechanism Design
* Approximation and Online Algorithms
* Combinatorial Optimization
* Combinatorics in Computer Science
* Computational Complexity
* Computational Geometry
* Computational Learning Theory
* Cryptography
* Data Structures
* Design and Analysis of Algorithms
* Distributed and Mobile Computing
* Foundations of Machine Learning
* Graph Mining and Network Analysis
* Parallel and External Memory Computing
* Quantum Computing
* Randomness in Computation
* Theoretical Foundations of Algorithmic Fairness

Track B: Automata, Logic, Semantics, and Theory of Programming
-------------------------------------------------------------
* Algebraic and Categorical Models of Computation
* Automata, Logic, and Games
* Database Theory, Constraint Satisfaction Problems, and Finite Model Theory
* Formal and Logical Aspects of Learning
* Formal and Logical Aspects of Security and Privacy
* Logic in Computer Science and Theorem Proving
* Models of Computation: Complexity and Computability
* Models of Concurrent, Distributed, and Mobile Systems
* Models of Reactive, Hybrid, and Stochastic Systems
* Principles and Semantics of Programming Languages
* Program Analysis, Verification, and Synthesis
* Type Systems and Typed Calculi

===============================
ICALP 2021 Programme Committees
===============================

Track A: Track A: Algorithms, Complexity and Games
---------------------------------------------------
* Nikhil Bansal (CWI Amsterdam, Netherlands), Chair
* Yossi Azar (Tel Aviv University, Israel)
* Luca Becchetti (Sapienza University of Rome, Italy)
* Aleksander Belov (University of Latvia, Latvia)
* Eric Blais (University of Waterloo, Canada)
* Niv Buchbinder (Tel Aviv University, Israel)
* Kevin Buchin (TU Eindhoven, Netherlands)
* Parinya Chalermsook (Aalto University, Finland)
* Vincent Cohen-Addad (Google Research, Switzerland)
* Shahar Dobzinski (Weizmann Institute, Israel)
* Ran Duan (Tsinghua University, China)
* Vida Dujmovic (University of Ottawa, Canada)
* Yuval Filmus (Technion, Israel)
* Samuel Fiorini (Université libre de Bruxelles, Belgium)
* Andreas Galanis (University of Oxford, UK)
* Mika Göös (EPFL, Switzerland)
* Inge Li Gørtz (TU Denmark, Denmark)
* Heng Guo (University of Edinburgh, UK)
* Prahladh Harsha (TIFR, Mumbai, India)
* Sungjin Im (UC Merced, USA)
* Stacey Jeffery (CWI Amsterdam, Netherlands)
* Iordanis Kerenidis (CNRS - Université Paris Diderot, France)
* Michael Kapralov (EPFL, Switzerland)
* Ravi Kumar (Google Research, USA)
* Stefan Kratsch (HU Berlin, Germany)
* Silvio Lattanzi (Google Research, Switzerland)
* Shi Li (SUNY Buffalo, USA)
* Konstantin Makarychev (Northwestern University, USA)
* Marcin Mucha (University of Warsaw, Poland)
* Wolfgang Mulzer (FU Berlin, Germany)
* Jesper Nederlof (Utrecht University, Netherlands)
* Aleksandar Nikolov (University of Toronto, Canada)
* Neil Olver (LSE, UK)
* Rasmus Pagh (IT University of Copenhagen, Denmark)
* Merav Parter (Weizmann Institute, Israel)
* Alexandros Psomas (Purdue University, USA)
* Barna Saha (UC Berkeley, USA)
* Thatchaphol Saranurak (University of Michigan, USA)
* Rahul Savani (University of Liverpool, UK)
* Mohit Singh (Georgia Tech, USA)
* Sahil Singla (IAS/Princeton, USA)
* Noah Stephens-Davidowitz (Cornell University, USA)
* László Végh (LSE, UK)
* Meirav Zehavi (Ben-Gurion University, Israel)

Track B: Automata, Logic, Semantics, and Theory of Programming
---------------------------------------------------------------
* James Worrell (University of Oxford, UK), Chair
* Parosh Aziz Abdulla (Uppsala University, Sweden)
* S. Akshay (Indian Institute of Technology Bombay, India)
* Nathalie Bertrand (Inria Rennes, France)
* Michael Blondin (University of Sherbrooke, Canada)
* Olivier Carton (IRIF, University of Paris, France)
* Corina Cîrstea (University of Southampton, UK)
* Dana Fisman (Ben Gurion University, Israel )
* Paul Gastin (LSV, ENS Paris-Saclay, France)
* Stefan Göller (University of Kassel, Germany)
* Radha Jagadeesan (DePaul University Chicago, USA)
* Bakhadyr Khoussainov (University of Auckland, New Zealand)
* Emanuel Kieroński (Wrocław University, Poland)
* Bartek Klin (Warsaw University, Poland)
* Barbara König (University of Duisburg-Essen, Germany)
* Laura Kovacs (Vienna University of Technology, Austria)
* Ugo Dal Lago (University of Bologna and Inria, Italy)
* Christoph Löding (RWTH Aachen University, Germany)
* Madhavan Mukund (Chennai Mathematical Institute, India)
* Sebastian Maneth (University of Bremen, Germany)
* Richard Mayr (University of Edinburgh, UK)
* Annabelle McIver (Macquarie University, Australia)
* Sophie Pinchinat (IRISA, Université de Rennes, France)
* Cristian Riveros (Pontificia Universidad Católica de Chile, Chile)
* Davide Sangiorgi (University of Bologna and Inria, Italy)
* Lijun Zhang (Institute of Software, Chinese Academy of
Sciences, China)

===============================
ICALP 2021 Organizing Committee
===============================
Simon Gay, Conference Chair
Oana Andrei
Ornela Dardha
Jessica Enright
David Manlove
Kitty Meeks
Alice Miller
Gethin Norman
Sofiat Olaosebikan
Michele Sevegnani

[DMANET] Open Position: Assistant Professor in the area of Machine Learning at Politecnico di Milano (Italy)

The School of Management at Politecnico di Milano (SoM) is looking for an Assistant Professor (AP) in the area of Machine Learning.
The AP will join the Machine Learning & Big Data Analytics research group "door" http://www.door.polimi.it/ at SoM.
Eligible candidates should have a PhD and an excellent track record in research related to Machine Learning, demonstrated by relevant publications in leading conferences or journals. Skills in programming languages (Java/C++/Python), database management systems and distributed architectures for big data analysis (Spark, Tensorflow) are desirable.
The AP position is a fixed-term appointment for 3+2 years, potentially extendable to an Associate Professor tenure. Teaching in Bachelor, Master of Science and PhD courses is a duty. The position will start in 2021. Salaries and teaching loads are comparable with other academic institutions abroad.
Politecnico di Milano is one of the most prominent technical universities in the world, ranked 16th in the World, 6th in Europe, and 1st in Italy, according to QS World University Ranking by Subject - Engineering & Technology 2019. SoM includes a broad range of research initiatives and teaching activities, with over 4,900 students enrolled in degree programmes.
Interested candidates should write to Carlo Vercellis (carlo.vercellis@polimi.it<mailto:carlo.vercellis@polimi.it>) or Carlotta Orsenigo (carlotta.orsenigo@polimi.it<mailto:carlotta.orsenigo@polimi.it>), including a cover letter motivating their interest, a CV, a description of current research (2-page maximum) and one of teaching activities (1-page maximum) by March 31, 2021. All correspondence and expressions of interest will be kept strictly confidential. Knowledge of the Italian language is not required, but the ability to teach in English is mandatory. The School guarantees equal gender opportunities in recruitment and career.
Disclaimer: this is not yet a job vacancy advertisement. SoM will soon open a public competition for the AP position (pursuant art. 18 of the Italian Law 240/2010).

**********************************************************
*
* 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] Postdoctoral Research positions at International Laboratory of Game Theory and Decision Making (HSE, Russia)

Postdoctoral Fellow in Game Theory, Economic Design, Computational Economics, and Discrete Mathematics
The Higher School of Economics Laboratory of Game Theory and Decision Making
https://game.hse.ru/
St. Petersburg, Russia

The Higher School of Economics Laboratory of Game Theory and Decision Making in St. Petersburg, Russia, invites applications for postdoctoral research positions in the field of Game Theory, Economic Design, Computational Economics, and Discrete Mathematics.

About HSE University
The Higher School of Economics (HSE University) is a young, dynamic, and fast-growing Russian research university. Over the past 25 years, HSE University has become a leader in Russian education, while also being recognized globally.
For instance, we were the first state-run university in Russia to begin recruiting on the international academic market. We aim at being a university with a highly attuned approach to training new professionals. Therefore, we are eager to hire people with real experience, as well as basic and applied knowledge. Committed to high-quality research, HSE University now has more than 100 research institutes and centres and over 50 international research laboratories collaborating with international specialists from all over the world.
Requirements
The general requirements for the postdoctoral fellowship positions are the following:

* Candidates must hold a recent Ph.D. or be close to completion in the field of Economics, Theoretical Computer Science or Mathematics or related areas which was awarded over the last 5 years or received before starting work at HSE in a relevant field by an internationally recognized university and has been assessed by external reviewers as having the potential to pursue research that is publishable in leading peer-reviewed journals;
* Fluent English is an obligatory condition as research and other activities are conducted in English. Knowledge of Russian is not required;
* Relevant experience will be an asset although not required.
The position involves:

* working under the direct supervision of Prof. Herve Moulin, lab's academic supervisor;
* participants are encouraged to pursue their own research along with working on the Laboratory of Game Theory and Decision Making research projects such as:

* market design & mechanism design
* game theory: strategic, algorithmic, and applied

* writing research papers for international peer-reviewed journals in co-authorship with the members of the Lab;
* participation in the events of the Lab and other contribution to the Lab's development;
* public presentations of candidate's own research to the academic community;
* some teaching is encouraged, though not required.
Conditions

Appointments are made for one year. Postdoctoral fellows have an opportunity of renewal of the contract (no more than two times).

HSE University offers postdoctoral fellows a competitive salary, the standard medical insurance plan, a working space equipped with a computer and free Internet access at the University.
Application Process
Applications must be submitted online. Please provide a CV, a statement of research interest and a recent research paper submitted via an online application form. At least two letters of recommendation should be sent directly to the International Faculty Recruitment Office at fellowship@hse.ru<mailto:fellowship@hse.ru> before the application deadline. Please note that direct applications to the hiring laboratory may not be reviewed.
Read more about the application process here<https://iri.hse.ru/postdoc_info>.

The deadline for the applications is February 14, 2021.

Apply now<https://iri.hse.ru/polls/323647081.html>
For more information:

* about Postdoctoral Fellowship - Frequently Asked Questions<https://iri.hse.ru/faq_pd>
* about HSE university – official web-site<https://www.hse.ru/en/info/>
* about the Laboratory of Game Theory and Decision Making – official web-site of the Laboratory https://game.hse.ru/en/ or contact the following members of the Lab:

* Herve Moulin<https://scholar.google.co.uk/citations?user=9-ONixQAAAAJ&hl=en> (Herve.Moulin@glasgow.ac.uk<mailto:Herve.Moulin@glasgow.ac.uk>) and Anna Bogomolnaia<https://scholar.google.co.uk/citations?user=7kaIUXoAAAAJ&hl=en> (Anna.Bogomolnaia@glasgow.ac.uk<mailto:Anna.Bogomolnaia@glasgow.ac.uk>), the academic supervisors;
* Alexander Nesterov<https://www.hse.ru/en/staff/asnesterov> (nesterovu@gmail.com<mailto:nesterovu@gmail.com>), the laboratory head;
* Elena Kusharina <https://www.hse.ru/org/persons/137313165> (ekusharina@hse.ru<mailto:ekusharina@hse.ru>), the manager.

* about international specialists' life in Russia - International Faculty Support<https://ifaculty.hse.ru/> page

If you have any additional questions, feel free to contact the International Faculty Recruitment Office at iri@hse.ru

Tuesday, January 26, 2021

[DMANET] Faculty openings in analytics & machine learning, fintech & blockchain

Dept. of Management Science, University of Strathclyde (Glasgow, UK) has multiple faculty openings (Chancellor's Fellows) in:
- Analytics and machine learning
- Fintech and blockchain technologies

Chancellor's fellow posts are at Lecturer (US-equivalent Assistant Professor) level, with the expectation of the successful candidates promoting to Senior Lecturer (US-equivalent Associate Professor) at the end of the 5-year period. Candidates with substantial track record of research leadership are welcome to apply at Senior Lecturer level. Chancellor's fellow posts have a reduced teaching load and limited administrative duties, thus enabling the successful candidate grow their research portfolio.

Further details including how to apply can be found at
https://strathvacancies.engageats.co.uk//ViewAttachment.aspx?enc=jmxpV+AcVus8i/wvT3FZXrrCOvCUGNWd9uca/tGZrAJjCe4gPnCqz54Ei2b0U3Vblx/XFgFBqhylBzvfZTNa7sIZnB5sEQW0T6MYHrAtFXoY4cfNDIlSG1b2drVWedTx

Any questions and informal interest should be directed to Head of Department, Prof Alec Morton
<alec.morton@strath.ac.uk>.

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

[DMANET] IWOCA 2021 going online

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

IWOCA 2021

32nd International Workshop on Combinatorial Algorithms

5-7 July 2021
Ottawa, Canada (held online-only)

https://iwoca2021.eecs.uottawa.ca/

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

COVID-19 update: The conference and affiliated workshops will be
online-only,
hosted by the University of Ottawa, Canada.

--------------------------------------------------
ABOUT IWOCA
--------------------------------------------------

Since its inception in 1989 as AWOCA (Australasian Workshop on
Combinatorial Algorithms), IWOCA has provided an annual forum for
researchers who design algorithms for the myriad combinatorial problems
that underlie computer applications in science, engineering, and business.

--------------------------------------------------
SCOPE AND TOPICS
--------------------------------------------------

The program committee is soliciting original and significant research
contributions to the broad area of combinatorial algorithms, including (but
not limited to): Algorithms and Data Structures, Algorithmic Game Theory,
Approximation Algorithms, Complexity Theory, Combinatorics and Graph
Theory, Combinatorial Generation and Enumeration, Combinatorial
Optimization, Combinatorics of Words and Strings, Computational Geometry,
Computational Biology, Cryptography and Information Security, Graph
Algorithms, Graph Drawing and Labelling, Decompositions and Combinatorial
Designs, Distributed and Network Algorithms, Dynamic and Evolving Networks,
Mobile Agents, New Paradigms of Computation, Online Algorithms, Parallel
Algorithms, Parameterized and Exact Algorithms, Probabilistic and
Randomized Algorithms, Streaming Algorithms.

--------------------------------------------------
IMPORTANT DATES
--------------------------------------------------

Abstract: March 8, 2021 (AoE)
Paper submission: March 14, 2021 (AoE)
Notification to authors: May 1, 2021
Camera-ready submission: May 13, 2021
Symposium: July 5-7, 2021

--------------------------------------------------
SUBMISSION
--------------------------------------------------

Authors are invited to submit high-quality manuscripts reporting original
unpublished research in the topics related to the symposium. Simultaneous
submission to other conferences or workshops with published proceedings is
not allowed. It is required that each accepted paper be presented at the
conference by one of its authors.
Submissions must be in the form of a single pdf file prepared using the
LNCS latex templates and style files. Springer's proceedings LaTeX
templates are also available on Overleaf. Springer's authors' guidelines
may be consulted at the following link:
https://www.springer.com/gp/computer-science/lncs/conference-proceedings-guidelines
Each submission should consist of the main part of the paper, not exceeding
12 pages (including the title page and excluding the references), plus an
optional clearly marked appendix (to be read at the discretion of the
program committee). Any figure pertaining to the main part of the paper
should be included therein (within the 12 page limit). The first page must
include an indication of whether the paper is eligible for the best student
paper award. Papers are to be submitted electronically through EasyChair at
the following link: https://easychair.org/conferences/?conf=iwoca2021

--------------------------------------------------
INVITED SPEAKERS
--------------------------------------------------

- Maria Chudnovsky, Princeton University, USA
- Anna Lubiw, University of Waterloo, Canada
- David Peleg, Weizmann Institute of Science, Israel
- Alfred Wassermann, Universität Bayreuth, Germany

--------------------------------------------------
PROCEEDINGS
--------------------------------------------------

Conference proceedings will be published in the ARCoSS subline of the
Springer "Lecture Notes in Computer Science" series.

--------------------------------------------------
SPECIAL ISSUE
--------------------------------------------------

Selected papers will be invited to a special issue of the Springer journal
"Algorithmica", devoted to IWOCA 2021. (https://www.springer.com/journal/453
)

--------------------------------------------------
AWARDS
--------------------------------------------------

Awards will be given to the best paper and the best student paper. To be
eligible for the best student paper award, at least one of the paper
authors must be a full-time student at the time of submission, and the
student(s) must have made a significant contribution to the paper. The
program committee may decline to make these awards or may split them.

--------------------------------------------------
PROGRAM COMMITTEE
--------------------------------------------------

- Hans L. Bodlaender, Utrecht University
- Ljiljana Brankovic, University of Newcastle
- Charlie Colbourn, Arizona State University
- Alessio Conte, University of Pisa
- Celina M. H. de Figueiredo, Federal University of Rio de Janeiro
- Giuseppe Antonio Di Luna, University of Rome, Sapienza
- Vida Dujmovic, University of Ottawa
- Cristina G. Fernandes, University of São Paulo
- Henning Fernau, University of Trier
- Gabriele Fici, University of Palermo
- Paola Flocchini (co-chair), University of Ottawa
- Florent Foucaud, Clermont Auvergne University
- Dalibor Froncek, University of Minnesota Duluth
- Travis Gagie, Dalhousie University
- Luisa Gargano, University of Salerno
- Leszek Gąsieniec, University of Liverpool
- Konstantinos Georgiou, Ryerson University
- Sylvie Hamel, Université de Montréal
- Giuseppe F. Italiano, LUISS Guido Carli University
- Taisuke Izumi, Osaka University
- Ralf Klasing, CNRS and University of Bordeaux
- Rastislav Královič, Comenius University
- Thierry Lecroq, University of Rouen Normandy
- Zsuzsanna Lipták, University of Verona
- Bernard Mans, Macquarie University
- George B. Mertzios, Durham University
- Othon Michail, University of Liverpool
- Matúš Mihalák, Maastricht University
- Lucia Moura (co-chair), University of Ottawa
- Maura Paterson, Birkbeck, University of London
- Nicola Prezza, Ca' Foscari University of Venice
- Tomasz Radzik, King's College London
- Joe Sawada, University of Guelph
- Michiel Smid, Carleton University
- Wing-Kin (Ken) Sung, National University of Singapore
- Jukka Suomela, Aalto University
- Koichi Wada, Hosei University

--------------------------------------------------
ORGANIZING COMMITTEE
--------------------------------------------------

- Saman Bazargani, University of Ottawa
- Jean-Lou De Carufel, University of Ottawa
- Vida Dujmovic (co-chair), University of Ottawa
- Lucia Moura (co-chair), University of Ottawa
- Kanstantsin Pashkovich, University of Ottawa

--------------------------------------------------
STEERING COMMITTEE
--------------------------------------------------

- Maria Chudnovsky, Princeton University
- Charles Colbourn, Arizona State University
- Costas Iliopoulos, King's College London
- Ralf Klasing, CNRS and University of Bordeaux
- Wing-Kin (Ken) Sung, National University of Singapore

Sunday, January 31, 2021

Saturday, January 30, 2021

Friday, January 29, 2021

Thursday, January 28, 2021

SPAA 2021 Call for Papers

33th ACM Symposium on Parallelism inAlgorithms and Architectures

July 6 - 8, 2021Philadelphia, PA, USA

Important Deadlines:

Submission details:

Regular papers:

Brief announcements:

Double-Blind Policy:

Awards:

Safe ToC:

Program Chair

Program Committee

SPAA General Chair

Wednesday, January 27, 2021

Tuesday, January 26, 2021

Mailing Lists

Subscribe To

Search This Blog

Blog Archive

33th ACM Symposium on Parallelism in
Algorithms and Architectures

July 6 - 8, 2021
Philadelphia, PA, USA