Events Search and Views Navigation

Event Views Navigation

Today

  • Yunbum Kook (국윤범), Sampling and volume computation

    Room B332 IBS (기초과학연구원)

    Since the development of the first randomized polynomial-time algorithm for volume computation by Dyer, Frieze, and Kannan in 1989, convex-body sampling has been a central problem at the intersection of algorithms, geometry, and probability. A major milestone came in 1997, when Kannan, Lovász, and Simonovits analyzed the Ball Walk and formulated the influential KLS conjecture. …

    Continue Reading

  • Daniel Mock, A Simple for the Dominating Set Problem and More

    Room B332 IBS (기초과학연구원)

    In , Fabianski et. al. developed a simple, yet surprisingly powerful algorithmic framework to develop efficient parameterized graph algorithms. Notably they derive a simple parameterized algorithm for the dominating set problem on a variety of graph classes, including powers of nowhere dense classes and biclique-free classes. These results encompass a wide range of previously known …

    Continue Reading

  • Daniel Dadush, TBA

    Room B332 IBS (기초과학연구원)

  • Hidde Koerts, TBA

    Room B332 IBS (기초과학연구원)
DIMAG on YouTube

We use YouTube Live to broadcast seminar talks live if the speaker agrees.