1
/
35
2026.05.12, Benjamin Duhamel, Excluding a forest induced minor
2026.05.06, Maximilian Gorsky, The Disjoint Paths Problem lies in the Oort cloud of algorithms
2026.04.28, Xin Wei, Separating hash families with large universe
2026.04.07, Mamadou Moustapha Kanté, Strongly flip-flat classes of graphs
2026.03.31, Tung H. Nguyen, Polynomial χ-boundedness for excluding the five-vertex path
2026.03.24, Hidde Koerts, Characterizing large clique number in tournaments
2026.03.12, József Balogh, Clique covers and decompositions of cliques of graphs
2026.03.10, Dario Cavallaro, Well-quasi-ordering Eulerian directed Graphs by (strong) Immersion
2026.03.03, Chính T. Hoàng, Problems on graph coloring
2026.02.24, Marek Sokołowski, Strongly Polynomial Parallel Work-Depth Tradeoffs for Directed SSSP
1
/
35