Jedrzej Hodor

Orcid: 0000-0002-2564-7121

According to our database¹, Jedrzej Hodor authored at least 13 papers between 2021 and 2026.

Collaborative distances:

Dijkstra number² of four.
Erdős number³ of two.

Timeline

Legend:

Book In proceedings Article PhD thesis Dataset Other

Links

On csauthors.net:

Bibliography

2026

Sample compression schemes for balls in structurally sparse graphs.

[BibT_eX]

[DOI]

CoRR, April, 2026

Centered colorings and weak coloring numbers in minor-closed graph classes.

[BibT_eX]

[DOI]

CoRR, March, 2026

Cops and robber in graphs with bounded vertex cover number.

[BibT_eX]

[DOI]

CoRR, February, 2026

Excluding an apex-forest or a fan as quickly as possible.

[BibT_eX]

[DOI]

CoRR, February, 2026

Quickly Excluding an Apex-Forest.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2026

Centered colorings in minor-closed graph classes.

[BibT_eX]

[DOI]

Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms, 2026

2025

Forcing the Wheel.

[BibT_eX]

[DOI]

Jedrzej Hodor

William T. Trotter

Order, December, 2025

Cube Height, Cube Width and Related Extremal Problems for Posets.

[BibT_eX]

[DOI]

CoRR, October, 2025

Boolean Dimension of a Boolean Lattice.

[BibT_eX]

[DOI]

Order, April, 2025

Weak coloring numbers of minor-closed graph classes.

[BibT_eX]

[DOI]

Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms, 2025

2024

The Grid-Minor Theorem Revisited.

[BibT_eX]

[DOI]

Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

2023

Treewidth is Polynomial in Maximum Degree on Graphs Excluding a Planar Induced Minor.

[BibT_eX]

[DOI]

CoRR, 2023

2021

Reconfiguring Independent Sets on Interval Graphs.

[BibT_eX]

[DOI]

Proceedings of the 46th International Symposium on Mathematical Foundations of Computer Science, 2021

Jedrzej Hodor

Timeline

Legend:

Links

On csauthors.net:

Bibliography

Loading...