% Bibliography prepared 2026-09-11 (Pacific time).
% See BIBLIOGRAPHY_NOTES.md for source scope and historical attribution.
% English titles for the two Bulgarian manuscripts are translations.

@article{GinsburgSpanier1966,
  author = {Ginsburg, Seymour and Spanier, Edwin H.},
  title = {Semigroups, {Presburger} Formulas, and Languages},
  journal = {Pacific Journal of Mathematics},
  volume = {16}, number = {2}, pages = {285--296}, year = {1966},
  doi = {10.2140/pjm.1966.16.285},
  url = {https://msp.org/pjm/1966/16-2/pjm-v16-n2-p09-s.pdf}
}

@article{KornerWei1984,
  author = {K{\"o}rner, J{\'a}nos and Wei, Victor K.},
  title = {Odd and Even {Hamming} Spheres Also Have Minimum Boundary},
  journal = {Discrete Mathematics},
  volume = {51}, number = {2}, pages = {147--165}, year = {1984},
  doi = {10.1016/0012-365X(84)90068-2},
  url = {https://doi.org/10.1016/0012-365X(84)90068-2}
}

@article{BezrukovSerra2002,
  author = {Bezrukov, Sergei L. and Serra, Oriol},
  title = {A Local--Global Principle for Vertex-Isoperimetric Problems},
  journal = {Discrete Mathematics},
  volume = {257}, number = {2--3}, pages = {285--309}, year = {2002},
  doi = {10.1016/S0012-365X(02)00431-4},
  url = {https://doi.org/10.1016/S0012-365X(02)00431-4}
}

@unpublished{RaychevRusev2020Student,
  author = {Raychev, Angel and Rusev, Dimitar},
  title = {Optimal Strategies for Finding a Princess in a Linear Graph},
  year = {2020},
  note = {Bulgarian student-conference manuscript, twentieth Student Conference (UK'20), 20 pages. Title translated into English}
}

@unpublished{Raychev2020Spring,
  author = {Raychev, Angel},
  title = {Optimal Strategies for Finding a Princess in a Linear Table},
  year = {2020},
  note = {Bulgarian spring-conference manuscript, twentieth Student Section (US'20), 17 pages. Title translated into English}
}

@article{BritnellWildon2013,
  author = {Britnell, John R. and Wildon, Mark},
  title = {Finding a Princess in a Palace: A Pursuit-Evasion Problem},
  journal = {The Electronic Journal of Combinatorics},
  volume = {20},
  number = {1},
  pages = {P25},
  year = {2013},
  doi = {10.37236/2296},
  eprint = {1204.5490},
  archivePrefix = {arXiv},
  primaryClass = {math.CO},
  url = {https://arxiv.org/abs/1204.5490}
}

@article{Haslegrave2014,
  author = {Haslegrave, John},
  title = {An Evasion Game on a Graph},
  journal = {Discrete Mathematics},
  volume = {314},
  pages = {1--5},
  year = {2014},
  doi = {10.1016/j.disc.2013.09.004},
  url = {https://doi.org/10.1016/j.disc.2013.09.004}
}

@article{AbramovskayaEtAl2016,
  author = {Abramovskaya, Tatjana V. and Fomin, Fedor V. and Golovach, Petr A. and Pilipczuk, Micha{\l}},
  title = {How to Hunt an Invisible Rabbit on a Graph},
  journal = {European Journal of Combinatorics},
  volume = {52},
  pages = {12--26},
  year = {2016},
  doi = {10.1016/j.ejc.2015.08.002},
  eprint = {1502.05614},
  archivePrefix = {arXiv},
  url = {https://fedorvf.github.io/articles/2016/2016g.pdf}
}

@article{BeluhovKolev2017,
  author = {Beluhov, Nikolay and Kolev, Emil},
  title = {Search for a Moving Target in a Graph},
  journal = {Electronic Notes in Discrete Mathematics},
  volume = {57},
  pages = {39--46},
  year = {2017},
  doi = {10.1016/j.endm.2017.02.008},
  url = {https://doi.org/10.1016/j.endm.2017.02.008}
}

@article{BolkemaGroothuis2019,
  author = {Bolkema, Jessalyn and Groothuis, Corbin},
  title = {Hunting Rabbits on the Hypercube},
  journal = {Discrete Mathematics},
  volume = {342},
  number = {2},
  pages = {360--372},
  year = {2019},
  doi = {10.1016/j.disc.2018.10.011},
  eprint = {1701.08726},
  archivePrefix = {arXiv},
  primaryClass = {math.CO},
  url = {https://arxiv.org/abs/1701.08726}
}

@article{OtachiSuda2011,
  author = {Otachi, Yota and Suda, Ryohei},
  title = {Bandwidth and Pathwidth of Three-Dimensional Grids},
  journal = {Discrete Mathematics},
  volume = {311},
  number = {10--11},
  pages = {881--887},
  year = {2011},
  doi = {10.1016/j.disc.2011.02.019},
  eprint = {1101.0964},
  archivePrefix = {arXiv},
  primaryClass = {cs.DM},
  url = {https://arxiv.org/abs/1101.0964}
}

@article{DissauxEtAl2025,
  author = {Dissaux, Thomas and Fioravantes, Foivos and Gahlawat, Harmender and Nisse, Nicolas},
  title = {Further Results on the {Hunters and Rabbit} Game through Monotonicity},
  journal = {Information and Computation},
  volume = {305},
  pages = {105302},
  year = {2025},
  doi = {10.1016/j.ic.2025.105302},
  eprint = {2309.16533},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2309.16533}
}

@article{BenAmeurEtAl2026,
  author = {Ben-Ameur, Walid and Gahlawat, Harmender and Maddaloni, Alessandro},
  title = {Hunting a Rabbit: Complexity, Approximability and Some Characterizations},
  journal = {Theoretical Computer Science},
  volume = {1075},
  pages = {115946},
  year = {2026},
  doi = {10.1016/j.tcs.2026.115946},
  eprint = {2502.15982},
  archivePrefix = {arXiv},
  primaryClass = {math.CO},
  url = {https://arxiv.org/abs/2502.15982},
  note = {Preprint first posted in 2025}
}

@misc{Kamenetsky2018Two,
  author = {Kamenetsky, Dmitry},
  title = {Entry {A301337}: Number of Steps Required in the Worst Case for Two Knights to Find the Princess in a Castle with $n$ Rooms Arranged in a Line},
  howpublished = {The On-Line Encyclopedia of Integer Sequences},
  year = {2018},
  month = mar,
  date = {2018-03-19},
  url = {https://oeis.org/A301337},
  urldate = {2026-09-11},
  note = {Created 19 March 2018; conjectural formula recorded the same day. Accessed 11 September 2026}
}

@misc{Kamenetsky2018Three,
  author = {Kamenetsky, Dmitry},
  title = {Entry {A301426}: Number of Steps Required in the Worst Case for Three Knights to Find the Princess in a Castle with $n$ Rooms Arranged in a Line},
  howpublished = {The On-Line Encyclopedia of Integer Sequences},
  year = {2018},
  month = mar,
  date = {2018-03-21},
  url = {https://oeis.org/A301426},
  urldate = {2026-09-11},
  note = {Created 21 March 2018; conjectural formula added the same day. Accessed 11 September 2026}
}

@misc{Kamenetsky2018Squares,
  author = {Kamenetsky, Dmitry},
  title = {Entry {A301860}: Number of Steps Required in the Worst Case for $n$ Knights to Find the Princess in a Castle with Rooms Arranged in an $(n+1)\times(n+1)$ Grid},
  howpublished = {The On-Line Encyclopedia of Integer Sequences},
  year = {2018},
  month = mar,
  date = {2018-03-28},
  url = {https://oeis.org/A301860},
  urldate = {2026-09-11},
  note = {Created 28 March 2018. The first two values are credited in the entry to Robby Goetschalckx. Accessed 11 September 2026}
}