Publikacje

• Treedepth and 2-Treedepth in Graphs with No Long Induced Paths - 2026
  Electronic Journal of Combinatorics 33(3) (2026), Jędrzej Hodor, Freddie Illingworth, Tomasz Mazur
• Quickly Excluding an Apex-Forest - 2026
  SIAM Journal on Discrete Mathematics 40 (2026), 282-307 Jędrzej Hodor, Hoang La, Piotr Micek, Clément Rambaud
• Centered colorings in minor-closed graph classes - 2026 ACM/SIAM Symposium on Discrete Algorithms [SODA], (2026), 164-184 Jędrzej Hodor, Hoang La, Piotr Micek, Clément Rambaud
• The Grid-Minor Theorem Revisited - 2025
  Combinatorica 45 (2025), 62 Vida Dujmović, Robert Hickingbotham, Jędrzej Hodor, Gwenaël Joret, Hoang La, Piotr Micek, Pat Morin, Clément Rambaud, David R. Wood
• Forcing the wheel - 2025
  Order (2025), Jędrzej Hodor, William T. Trotter
• Weak coloring numbers of minor-closed graph classes - 2025 ACM/SIAM Symposium on Discrete Algorithms [SODA], (2025), 3325-3334 Jędrzej Hodor, Hoang La, Piotr Micek, Clément Rambaud
• The depth of Tsirelson’s norm - 2025
  Studia Mathematica 280 (2025), 27-54 Kevin Beanland, Jędrzej Hodor
• Boolean dimension of a Boolean lattice - 2025
  Order 42 (2025), 25-36 Marcin Briański, Jędrzej Hodor, Hoang La, Katzper Michno, Piotr Micek
• Counting unions of Schreier sets - 2024
  Bulletin of the Australian Mathematical Society 110 (1) (2024), 19-31 Kevin Beanland, Dmitriy Gorovoy, Jędrzej Hodor, Daniil Homza
• The grid-minor theorem revisited - 2024 ACM/SIAM Symposium on Discrete Algorithms [SODA], (2024), 1241-1245 Vida Dujmović, Robert Hickingbotham, Jędrzej Hodor, Gwenaël Joret, Hoang La, Piotr Micek, Pat Morin, Clément Rambaud, David R. Wood
• Reconfiguring independent sets on interval graphs - 2021 International Symposium on Mathematical Foundations of Computer Science [MFCS] Leibniz International Proceedings in Informatics (LIPIcs) 202 (2021), 14 Marcin Briański, Stefan Felsner, Jędrzej Hodor, Piotr Micek