Approximation and online algorithms are fundamental tools to deal with computationally hard problems and problems in which the input is gradually disclosed over time. Both kinds of problems arise from a large number of applications in a variety of fields. The workshop focuses on the design and analysis of approximation and online algorithms. It also covers experimental methods used to design and analyze efficient approximation and online algorithms. It is colocated with ALGO 2021, which also hosts ESA, ALGOCLOUD, ALGOSENSORS and ATMOS. ALGO 2021 will take place 6-10 September 2021 in Lisbon, Portugal.

Important Dates

    • Paper Submission: June 27, 2021, 15:00 PDT
    • Notification of acceptance: July 31, 2021
    • Camera ready: August 7, 2021
    • Conference dates: September 9 - 10, 2021, in Lisbon, Portugal

Call For Papers

Submissions should start with the title of the paper, each author’s name, affiliation, and e-mail address, followed by a one- or two-paragraph summary of the results to be presented. This should then be followed by a technical exposition on single-spaced pages on letter-size paper, using reasonable margins, page numbers, and at least 11-point font. The first 10 pages should contain the main ideas and techniques used to achieve the results including motivation and a clear comparison with related work (not including the references). There is no page limit but any material beyond the first 10 pages will be read at the sole discretion of the program committee. Simultaneous submission to other conferences with published proceedings is not allowed. Submitted papers are not required to be in LNCS style style.

Papers should be submitted electronically via the EasyChair submission system at:

By submitting a paper the authors acknowledge that in case of acceptance at least one of the authors must register at ALGO 2021 and present the paper. The program committee may award a Best Paper Award to one of the accepted papers.


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

  • Graph algorithms
  • Inapproximability results
  • Network design
  • Packing and covering
  • Paradigms for the design and analysis of approximation and online algorithms
  • Parameterized complexity
  • Scheduling problems
  • Algorithmic game theory
  • Algorithmic trading
  • Coloring and partitioning
  • Competitive analysis
  • Computational advertising
  • Computational finance
  • Cuts and connectivity
  • Geometric problems
  • Mechanism design
  • Resource augmentation
  • Real-world applications



Program Committee

  • Jarosław Byrka, University of Wrocław
  • Parinya Chalermsook, Aalto University
  • Sándor Fekete, TU Braunschweig
  • Andreas Emil Feldmann, Charles University in Prague
  • Zachary Friggstad, University of Alberta
  • Stefan Funke, University of Stuttgart
  • Naveen Garg, Indian Institute of Technology Delhi
  • Hung Le, University of Massachusetts Amherst
  • Jochen Könemann, University of Waterloo (co-chair)
  • Asaf Levin, Technion Israel Institute of Technology
  • Daniel Lokshtanov, University of California, Santa Barbara
  • Jannik Matuschke, KU Leuven
  • Matthias Mnich, Hamburg University of Technology
  • Ben Moseley, Carnegie Mellon University
  • Alantha Newman, Université Grenoble Alpes
  • Britta Peis, RWTH Aachen University (co-chair)
  • Heiko Röglin, University of Bonn
  • Chaitanya Swamy, University of Waterloo
  • Vera Traub, ETH Zürich
  • Marc Ütz, University of Twente
  • Jose Verschae, Catholic University of Chile
  • Gerhard Wöginger, RWTH Aachen University

Invited Speaker

Daniel Lokshtanov

University of California, Santa Barbara

Daniel Lokshtanov is an Associate Professor of Computer Science at UCSB. He received his PhD in Computer Science (2009), from the University of Bergen. Lokshtanov spent two years (2010-2012) as a Simons Postdoctoral Fellow at University of California at San Diego, and 6 as a faculty at the Department of Informatics at the University of Bergen. His main research interests are in graph algorithms, parameterized algorithms and complexity. He is a recipient of the Meltzer prize, the Bergen Research Foundation young researcher grant, and of an ERC starting grant on parameterized algorithms. He is a co-author of the recent textbooks on Parameterized Algorithms [] and Kernelization []


Proceedings will be published in the Springer series Lecture Notes in Computer Science after the workshop takes place. Selected papers presented at WAOA 2021 will be invited to a special issue of Theory of Computing Systems.