By sank We are quite happy that this year two ERC grants will be starting in our group. First of all, decease Marek Cygan very

By sank The dynamic Steiner tree problem has been around for a while already (for 24 years), for sale but it did not get a

By malcin The Graph Isomorphism problem is interesting for many reasons, look one being the fact that its complexity status is still unclear – it

By Anna Zych In 1973 Hopcroft and Karp gave a very nice time algorithm computing a maximum matching in unweighted bipartite graphs. This algorithm turned

By sank Recently with Marcin Pilipczuk, unhealthy Micha? Pilipczuk and Erik Jan van Leeuwen we were able to prove that the Steiner Tree problem has

By kowalik Long long time ago, diagnosis actually in 1943, US Army was recruiting a lot of soldiers. Each of the recruits had to be

By Marek Adamczyk Matchings are one of the most basic primitives used in the area of mechanism design. Whenever we need to assign items to

By sank I have recently realized that I have published 9 papers at FOCS and only 1 paper at STOC. I started wondering why this