Online bipartite matching in offline time
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
Homepage » Archiwum dla October 2014
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
You can use the anonymous submission form to upload information about an event, a blog post or a job posting. It will be published when it is approved by the moderator.