Track: Algorithms and Complexity

Track chairs

Bart Jansen (TU/e)
Rebecca Reiffenhäuser (UvA)

Track description

Algorithms constitute one of the foundational fields in Computer Science, and have developed into omnipresent tools shaping modern society. The development and theoretical analysis, as well as practical implementation and experimental evaluation of algorithms build the very basis for their central and widespread use. Modern algorithmic research has to incorporate aspects of many different flavors, ranging from complexity and scalability requirements to ones like explainability and social implications.
This track provides a forum to connect and foster exchange of ideas for researchers tackling all kinds of algorithmic challenges across different disciplines. A program of invited speakers will present a wide variety of cutting-edge research, bridging across the landscape of some of today's most important applications, techniques and new paradigms.

The track is an initiative of the IPN Special Interest Group on Algorithms (SIGalgo.nl).
We welcome poster submissions covering all directions of algorithmic research on classic as well as emerging topics, with a preference on highlighting important current challenges and results as well as exciting future horizons.