The field is growing by leaps and bounds—Herein you will find applications, open problems, the 'FPT Races' Table, the FPT Newsletter, and resources including courses about parameterized complexity and open positions. Witness the growth of the field. Follow the news on facebook with @MikeFellowsFPT and subscribe to Youtube FPT Complexity.

ICALP 2021 Satellite Workshop:"Algorithmic Aspects of Temporal Graphs IV"

Glasgow, Scotland, UK, Monday 12 July 2021 (held online due to Covid-19)

In this one-day workshop, recent advances in the area of temporal / dynamically changing graphs will be presented, as
well as some of the key challenges will be highlighted.

The workshop will run online on zoom. To receive the zoom link and the password for the workshop, please register as soon as possible (free of charge) using this link: https://www.eventbrite.co.uk/e/153473012913

Workshop Organizers:
- George B. Mertzios (Durham University, UK)
- Paul G. Spirakis (University of Liverpool, UK and University of
Patras, Greece)
- Eleni C. Akrida (Durham University, UK)
- Viktor Zamaraev (University of Liverpool, UK)

Link to the ICALP 2021 conference: http://easyconferences.eu/icalp2021/

IPEC: The International Symposium on Parameterized and Exact Computation (IPEC) is an annual conference covering all aspects of parameterized and exact algorithms and complexity. Its 16th edition will be part of ALGO 2021, which also hosts ESA 2021 and a number of more specialized conferences and workshops. ALGO 2021 will take place on September 6-10, 2021, Lisbon, Portugal. Due to the COVID-19 pandemic, IPEC might be held online.

Webpage: http://algo2021.tecnico.ulisboa.pt/IPEC2021/index.html <http://algo2021.tecnico.ulisboa.pt/IPEC2021/index.html>

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

NERODE: An invited talk is planned by the 2021 EATCS-IPEC Nerode Prize winner.
PACE: Special session for the 5th Parameterized Algorithms and Computational Experiments Challenge (PACE 2021) awards.

A special issue of Algorithmica is planned for selected papers presented at IPEC 2021.

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

Paper Registration: June 30, 2021 (23:59 AoE)
Notification of acceptance: July 30, 2021
Conference dates: September 8-10, 2021

Akanksha Agrawal, IIT Madras, India
Fahad Panolan, IIT Hyderabad, India
Dimitrios Thilikos, LIRMM, Universite de Montpellier, CNRS, France
Eduard Eiben, Royal Holloway, University of London, UK
Ignasi Sau, LIRMM, Universite de Montpellier, CNRS, France
Jesper Nederlof, Utrecht University, Netherlands
Jiehua Chen, Vienna University of Technology, Austria
Karl Bringmann, Saarland University, Germany
Karthik C. S., New York University, USA
Martin Koutecky, Charles University, Czech Republic
Meirav Zehavi (co-chair), Ben-Gurion University of the Negev, Israel
Pascal Schweitzer, TU Kaiserslautern, Germany
Petr Golovach (co-chair), University of Bergen, Norway
Sebastian Siebertz, University of Bremen, Germany
Saket Saurabh, Indian Institute of Mathematical Sciences, India, and University of Bergen, Norway
Tillmann Miltzow, Utrecht University, Netherlands
Vincent Cohen-Addad, Google Zurich, Switzerland
William Lochet, University of Bergen, Norway

FRONTIERS OF PARAMETERIZED COMPLEXITY online talk series about latest in the field. All are welcome to attend these online talks and interact with the speaker and other attendees remotely via Zoom.

The link to join the zoom talk is https://uib.zoom.us/j/4231169675. Meeting ID: 423 116 9675
Password: Name of the W[1]-complete problem, six letters, all capital. Set of pairwise adjacent vertices.

List of previous talks (https://frontpc.blogspot.com/2020/) and their video recordings at our YouTube channel Frontiers of Paramerterized Complexity (https://www.youtube.com/channel/UCdfML-PShQNSCeqbz9Ol_oA).

For questions, please contact one of the following.
Roohani Sharma, Max Planck Institute for Informatics: ed.gpm.fni-ipm|amrahsr#ed.gpm.fni-ipm|amrahsr
Saket Saurabh, Institute of Mathematical Science, ni.ser.csmi|tekas#ni.ser.csmi|tekas
Fedor Fomin, University of Bergen, on.biu.ii|nimof#on.biu.ii|nimof


Subscribe to Youtube "FPT Complexity".
Jungho Ahn has agreed to create and administrate the channel.
Please send your playlists and suggestions and contact Jungho if you would like to join as an admin.

ICALP requests help. ICALP 2021 is offering a student volunteer programme which offers free registration in exchange for technical assistance with running the sessions. Please check http://easyconferences.eu/icalp2021/registration/ for details.

The main duties of a student volunteer:
- To provide support in technical sessions, either for the main conference or workshops or both. This mainly consists of helping presenters to work with the online conference platform. Training will be given.
- To help with social sessions, in as-yet-unspecified ways - for example, helping to assign people to groups, or technical troubleshooting.
- To answer queries from conference participants, passing such queries to members of the organising committee if necessary.

The dates when you will be needed are as follows:
- Morning of the 1st and afternoon of the 2nd July for conference rehearsal and training.
- Tuesday 13th to Friday 16th July inclusive for the main conference - though you will only be asked to volunteer over two of these days. We will do our best to accommodate preferences in our scheduling.

If you are interested in volunteering, please see the draft job description, and email Dr Jess Enright (mailto:jessica.enright@glasgow.ac.uk) to register your interest, including "ICALP Student Volunteer" in the subject line.

Applications are open until sufficient volunteers are recruited, or until June 18th at the latest. You should be notified of the outcome of your application within 5 business days of your application.

The 16th International Conference and Workshops on Algorithms and Computation (WALCOM 2022)

WHEN: Conference March 24 - March 26, 2022
WHERE: at the University of Jember, Indonesia
Paper submission deadline: September 28, 2021 (Anywhere on Earth)

Based on the COVID-19 situation at the time of the conference, the event will be held physically in hybrid mode or virtually.

AWARDS: Best Paper" and "Best Student Paper" will be awarded. A paper is eligible for the Best Student Paper if the paper is presented by an author, who is a full-time student. The best paper awards will be sponsored by Springer.

Prof. Hans L. Bodlaender (Utrecht University and Technical University Eindhoven, The Netherlands)

Prof. Tiziana Calamoneri (University of Rome "Sapienza", Italy)

Prof. Takehiro Ito (Tohoku University, Japan)

The 27th International Computing and Combinatorics Conference (COCOON 2021)
will be held in National Cheng Kung University, Tainan, Taiwan
during October 24-26, 2021.


Due to COVID-19, COCOON 2021 will be a hybrid conference with both online and onsite participants. In case that the live on-line talk is not smooth, a pre-recorded talk will be played.

Original research papers in the areas of algorithms, theory of computation, computational complexity, and combinatorics related to computing are solicited. In addition to theoretical results, we are also interested in submissions that report on experimental and applied research of general algorithmic interest. Special consideration will be given to research that is
motivated by real-world problems. Experimental and applied papers are expected to show convincingly the
usefulness and efficiency of the algorithms discussed in a practical setting.

Important dates:
Paper Submission Due: June 30, 2021
Notification of Acceptance: August 15, 2021
Camera-ready and Registration: August 31, 2021
Conference Dates: October 24-26, 2021

AAAC 2021 —- The 14th Annual Meeting of Asian Association for Algorithms and Computation
October 22-24, 2021, Tainan, Taiwan

http://aaac2021.ie.nthu.edu.tw/ The official website of AAAC is http://www.aa-ac.org.

All areas of theoretical computer science, especially design and analysis of algorithms and complexity theory.

SUBMISSION: Submit one-page (A4) abstracts (in pdf format) that can be based on original results or surveys of existing results. Informal working notes including the one-page abstracts will be distributed at the meeting, which does not prevent any form of future publication of the same work. All submissions should be made electronically. Papers are now being accepted through the EasyChair Conference System. https://easychair.org/conferences/?conf=aaac2021

BEST STUDENT PAPER AWARD: Indicate if you are a student.

DATES: One-page abstract submission due: July 23 (Fri), 2021 (AoE)

Keynote Speeches:
Kazuo Iwama (Kyoto University, Japan)
Luca Trevisan (Bocconi University, Italy)
Prudence Wong (University of Liverpool, UK)

Evanthia Papadopoulou (University of Lugano, Switzerland)

23rd International Symposium on Fundamentals of Computation Theory (FCT 2021)
September 12-15, 2021, Athens, Greece
Submission deadline: May 9, 2021 (abstracts) / May 16, 2021 (full papers)

FCT was established in 1977 as a forum for researchers interested in all aspects of theoretical computer science, and in particular algorithms, complexity, formal and logical methods. FCT 2021 will be hosted by the National Technical University of Athens partially or completely online, depending on the status of the COVID-19 pandemic.

Important Dates
Abstract registration: May 9, 2021 (AoE)
Full paper submission: May 16, 2021 (AoE)
Symposium: September 12-15, 2021

The program committee is soliciting original and significant research contributions to the fundamentals of computation theory, including (but not limited to):

Algorithms: algorithm design and optimization / data structures/ combinatorics and analysis of algorithms/ randomized algorithms/ approximation algorithms/ parameterized and exact algorithms computational algebra and number theory/ computational geometry/ parallel algorithms/ distributed algorithms and protocols/ online algorithms/ streaming algorithms/ algorithmic game theory/ computational foundations of machine learning/ computational biology

Complexity: models of computation/ computational complexity/ / Boolean/algebraic circuits and functions/ randomized / derandomization/ interactive proofs/ computational foundations of cryptography/ quantum computation/ complexity theory/ lower bounds/ counting complexity

Formal methods: algebraic and categorical methods/ automata and formal languages/ database theory/ foundations of concurrency and distributed systems/ logic and model checking/ models of reactive, hybrid, and stochastic systems/ principles of programming languages/ program analysis and transformation/ security/ specification, refinement, and verification/ type systems/ ad hoc, dynamic, and evolving systems/ foundations of cloud computing and ubiquitous systems

Invited Speakers
Constantinos Daskalakis, Massachusetts Institute of Technology
Daniel Marx, Max Planck Institute for Informatics
Claire Mathieu, CNRS and University of Paris
Nobuko Yoshida, Imperial College London

The 7th International Conference on Algorithmic Decision Theory - ADT 2021 will take place at the Institute de Recherche en Informatique de Toulouse (IRIT) and University of Toulouse 1 Capitole from November 3 - 5, 2021, Toulouse, France

See: https://www.irit.fr/ADT2021

The ADT 2021 conference focus is on algorithmic decision theory broadly defined, seeking to bring together researchers and practitioners coming from diverse areas of Computer Science, Economics and Operations Research in order to improve the theory and practice of modern decision support. The conference topics include research in Algorithms, Argumentation Theory, Artificial Intelligence, Computational Social Choice, Database Systems, Decision Analysis, Discrete Mathematics, Game Theory, Machine Learning and Adversarial Machine Learning, Matching, Multi-agent Systems, Multiple Criteria Decision Aiding, Networks, Optimization, Preference Modelling, Risk Analysis and Adversarial Risk Analysis, and Utility Theory.

ADT 2021 provides a multi-disciplinary forum for sharing knowledge in this area with a special focus on algorithmic issues in Decision Theory, continuing the tradition of the first six editions of the International Conference on Algorithmic Decision Theory (ADT 2009 Venice, ADT 2011 Rutgers, ADT 2013 Brussels, ADT 2015 Lexington, ADT 2017 Luxembourg, ADT 2019 Durham NC) which brought together researchers and practitioners from diverse areas of computer science, economics, and operations research from around the globe.

Title and abstract submission: April 30, 2021 (AoE), Full paper submission: May 7, 2021 (AoE)

Edith Elkind, University of Oxford, UK
Christophe Labreuche, Thales Research & Technology, France
Gianbattista Biggio, University of Cagliari, Italy

HIGHLIGHTS 2021: 9th annual conference on Highlights of LOGIC, GAMES, and AUTOMATA
15-17 September 2021, Aachen (but most probably online) http://highlights-conference.org

We invite submissions for contributed talks (around 10 minutes).

Submission deadline: 4 JUNE, 7pm GMT
Notification: 18 JUNE, 7pm GMT

Website: http://highlights-conference.org

HIGHLIGHTS 2021 is the 9th conference on Highlights of Logic, Games, and Automata that aims to integrate the diverse research community working in the areas of Logic, Finite Model Theory, Automata Theory, Games and Verification. Individual papers are dispersed across many conferences, which makes them challenging to follow. Participating in the annual
Highlights conference offers a wide picture of the latest research in the field and a chance to meet and interact with most of the members of the research community. The speakers are encouraged to present their best recent work at Highlights, whether already published elsewhere or not.

There will be a tutorial day (14 September) and three days for the conference (15-17 September).
This year's edition will be most probably held online, with no registration fees.

TUTORIAL (September 14)
Christoph Haase
Michal Pilipczuk

Rajeev Alur
Balder ten Cate
Karoliina Lehtinen
Nutan Limaye
Joel Ouaknine

The 46th International Symposium on Mathematical Foundations of Computer Science MFCS
August 23-27, 2021, Tallinn, Estonia

The MFCS conference series has been organised since 1972. Traditionally, the conference moved between the Czech Republic, Slovakia, and Poland, while since 2013, the conference travels around Europe. In 2021, it will come to Tallinn, Estonia. MFCS is a high quality venue for original research in all branches of theoretical computer science.

Abstract Deadline: Thursday, April 30, 2021 (AoE)
Submission Deadline: Monday, May 3, 2021 (AoE)
Notification: Monday, June 21, 2021
Conference: Monday August 23 to Friday August 27, 2021

Papers should be submitted electronically through EasyChair at

This is our area!!! It means that the relatively new field of Theoretical Computer Science (TCS) is fully recognized. This is what we do - algorithms and complexity. Congratulations to Avi Wigderson and László Lovász.


After the two announcers, the 3-color problem is used to describe P vs NP and also randomness in cryptology.

The very last speaker, winner Avi W., talks about uses of TCS. Nice summary of applications. Very short.

Great news for our field!

Older news entries have moved to this page.

Unless otherwise stated, the content of this page is licensed under Creative Commons Attribution-ShareAlike 3.0 License