Tuukka Korhonen, Dynamic Treewidth in Logarithmic Time
Room B332 IBS (기초과학연구원)We present a dynamic data structure that maintains a tree decomposition of width at most 9k+8 of a dynamic graph with treewidth at most k, which is updated by edge …
10 events found.
Discrete Math Seminar
-
-
-
Chi Hoi Yip, Cliques in Paley graphs and cyclotomic graphs
Room B332 IBS (기초과학연구원)Given a prime power $q \equiv 1 \pmod 4$, the Paley graph of order $q$ is the graph defined over $\mathbb{F}_q$ (the finite field with $q$ elements), such that two …
-
Donggyu Kim (김동규), Grassmann-Plücker functions for orthogonal matroids
Room B332 IBS (기초과학연구원)We present a new cryptomorphic definition of orthogonal matroids with coefficients using Grassmann-Plücker functions. The equivalence is motivated by Cayley's identities expressing principal and almost-principal minors of a skew-symmetric matrix …
-
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 …
-
-
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 …
-
Ferdinand Ihringer, TBA
Room B332 IBS (기초과학연구원) -
Tomáš Masařík, TBA
Room B332 IBS (기초과학연구원) -
Daniel Dadush, TBA
Room B332 IBS (기초과학연구원) -
-
Seonghun Park (박성훈), TBA
Room B332 IBS (기초과학연구원) -
Marek Sokołowski, TBA
Room B332 IBS (기초과학연구원)