Skip to main content Skip to navigation

Computer Science News

Show all news items

Best Student Paper Award at European Symposium on Algorithms

We are delighted to announce that Peter Kiss, a PhD student in the Theory and Foundations Research Division, has received the best student paper award at European Symposium on Algorithms (ESA) 2023, for his joint work with Joakim Bilkstad for the paper: "Incremental (1-eps)-approximate dynamic matching in O(poly(1/eps)) update time". The paper considers the problem of maintaining a large matching in a graph that is undergoing a sequence of edge insertions. They present an algorithm for this fundamental problem in dynamic graph algorithms, which has near-optimal approximation ratio and an update time that does not grow at all with the size of the input and is also polynomial in 1/\eps (the error parameter). In addition, their approach is simpler than previous algorithms on the same problem that achieved weaker guarantees.

Wed 13 Sep 2023, 12:10 | Tags: People Research Theory and Foundations