1
/
35
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
2026.02.10, Seonghun Park (박성훈), Formalizing Flag Algebras in the Lean Theorem Prover
2026.02.03, Xiaofan Yuan, Rainbow structures in edge colored graphs
2026.01.27, Daniel Dadush, A Strongly Polynomial Algorithm for Linear Programs with at Most Two…
2026.01.20, Tomáš Masařík, Separator Theorem for Minor-free Graphs in Linear Time
2026.01.13, Ferdinand Ihringer, Boolean Functions Analysis in the Grassmann Graph
2026.01.06, Daniel Mock, A Simple Algorithm for the Dominating Set Problem and More
2025.12.30, Yunbum Kook (국윤범), Sampling and volume computation
1
/
35

