Algorithmics

Description

Research on algorithms, data structures, and computational complexity of discrete problems. Most popular topics include text algorithms, graph algorithms, computational geometry, approximation and parameterized algorithms.

Employees and PhD students

• mgr Krzysztof Ciebiera

  Algorithm engineering

• dr hab. Marek Cygan

  Parameterized complexity, approximation algorithms

• dr Robert Dąbrowski

  Text algorithms, word equations

• prof. dr hab. Krzysztof Diks

  Graph algorithms

• dr Adam Karczmarz

  Graph algorithms, dynamic algorithms, data structures

• prof. dr hab. Łukasz Kowalik

  Parameterized complexity, exponential-time algorithms, approximation algorithms, graph algorithms

• dr hab. Mirosław Kowaluk, prof. UW

  Computational geometry, graph algorithms

• dr Marcin Kubica

  Text algorithms and combinatorics on words

• dr hab. Marcin Mucha

  Approximation and online algorithms, hardness in P

• dr hab. Marcin Peczarski

  Combinatorics of posets, sorting with minimal number of comparisons

• dr hab. Marcin Pilipczuk, prof. UW

  Parameterized complexity, exponential-time algorithms, approximation algorithms, graph algorithms

• dr hab. Michał Pilipczuk, prof. UW

  Parameterized complexity, exponential-time algorithms, approximation algorithms, graph algorithms

• prof. dr hab. Wojciech Plandowski

  Text algorithms and combinatorics on words, data compression

• dr hab. Jakub Radoszewski, prof. UW

  Text algorithms and combinatorics on words

• prof. dr hab. Wojciech Rytter

  Text algorithms and combinatorics on words

• dr hab. Krzysztof Rządca, prof. UW

  Scheduling and resource management

• dr hab. Piotr Sankowski, prof. UW

  Graph algorithms, algebraic methods, approximation algorithms, dynamic algorithms, network algorithms

• dr hab. Tomasz Waleń

  Text algorithms and combinatorics on words

• dr Michał Włodarczyk

  Parameterized and exponential algorithms, approximation algorithms, algebraic methods

• dr Marcin Wrochna

  Graph algorithms, parameterized complexity

• dr Piotr Wygocki

  Nearest neighbor search, locality sensitive hashing

• dr Anna Zych-Pawlewicz

  Graph algorithms