publications | Jan Petr

(can also be seen on Google Scholar)

preprints

[1] The wreath matrix
with Pavel Turek
arXiv 2501.07269, submitted
(arXiv)

accepted

[12] Reconstructing almost all of a point set in $\mathbb{R}^d$ from randomly revealed pairwise distances
with Douglas Barnes, Julien Portier, Benedict Randall Shaw and Alan Sergeev
accepted to SIAM Journal on Discrete Mathematics
(arXiv)

[11] Towards odd-sunflowers: size-aware families and lightnings
with Pavel Turek
Journal of Combinatorial Theory, Series A, Volume 220 (2026)
(journal) (arXiv)

[10] Intervals in Dyck paths and the wreath conjecture
with Pavel Turek
Electronic Journal of Combinatorics, Volume 32, Issue 4 (2025)
(journal) (arXiv)

[9] The complexity of decomposing a graph into a matching and a bounded linear forest
with Agnijo Banerjee, João Pedro Marciano, Adva Mond and Julien Portier
Journal of Graph Theory, Volume 109, Issue 1 (2025)
(journal) (arXiv)

[8] Bounds for the Competition-Independence game on trees
with Julien Portier
Discrete Mathematics, Volume 347, Issue 3 (2024)
(journal) (arXiv)

[7] On the number of minimum dominating sets and total dominating sets in forests
with Julien Portier and Leo Versteegen
Journal of Graph Theory, Volume 106, Issue 4 (2024)
(journal) (arXiv)

[6] A note on Cops and Robbers, independence number, domination number and diameter
with Julien Portier and Leo Versteegen
Discrete Mathematics, Volume 346, Issue 1 (2023)
(journal) (arXiv)

[5] The odd chromatic number of a planar graph is at most $8$
with Julien Portier
Graphs and Combinatorics, Volume 39, Issue 2 (2023)
(journal) (arXiv)

[4] A new lower bound on the pebbling number of the grid
with Julien Portier and Szymon Stolarczyk
Discrete Mathematics, Volume 346, Issue 1 (2023)
(journal) (arXiv)

[3] A faster algorithm for Cops and Robbers
with Julien Portier and Leo Versteegen
Discrete Applied Mathematics. Volume 320 (2022)
(journal) (arXiv)

[2] On longest palindromic subwords of finite binary words
with Jan Soukup
Discrete Mathematics, Volume 344, Issue 9 (2021)
(journal)

[1] Slowdown for the geodesic-biased random walk
with Mikhail Beliayeu, Petr Chmel and Bhargav Narayanan
Electronic Communications in Probability, Volume 24 (2019)
(journal) (arXiv)

refereeing

I have experienced the peer review process from the other side thanks to: