Sebastian Wiederrecht, Killing a vortex
Room B332 IBS (기초과학연구원)The Structural Theorem of the Graph Minors series of Robertson and Seymour asserts that, for every
The Structural Theorem of the Graph Minors series of Robertson and Seymour asserts that, for every
An
Van der Waerden's theorem states that any coloring of
A common technique to characterize hereditary graph classes is to exhibit their minimal obstructions. Sometimes, the set of minimal obstructions might be infinite, or too complicated to describe. For instance, for any …
For a graph
A well-known conjecture of Burr and Erdős asserts that the Ramsey number
We determine the maximum number of copies of
Order types are a combinatorial classification of finite point sets used in discrete and computational geometry. This talk will give an introduction to these objects and their analogue for the …
In computer science, random expressions are commonly used to analyze algorithms, either to study their average complexity, or to generate benchmarks to test them experimentally. In general, these approaches only …
We study the problem of maximizing a continuous DR-submodular function that is not necessarily smooth. We prove that the continuous greedy algorithm achieves an guarantee when the function is monotone …