@inproceedings(as21,
 author       = {Pavel Alaev and Victor L. Selivanov},
 year         = {2021},
 title        = {Complexity Issues for the Iterated h-Preorders},
 editor       = {Yo{-}Sub Han and Sang{-}Ki Ko},
 booktitle    = {Descriptional Complexity of Formal Systems - 23rd {IFIP} {WG} 1.02 International Conference, {DCFS} 2021, Virtual Event, September 5, 2021, Proceedings},
 series       = {Lecture Notes in Computer Science},
 volume       = {13037},
 publisher    = {Springer},
 pages        = {1--12},
 url          = {https://doi.org/10.1007/978-3-030-93489-7\_1},
)
@inproceedings(bhkk08,
 author       = {Andreas Bj{\"{o}}rklund and Thore Husfeldt and Petteri Kaski and Mikko Koivisto},
 year         = {2008},
 title        = {The Travelling Salesman Problem in Bounded Degree Graphs},
 editor       = {Luca Aceto and Damg{\r a}rd, Ivan and Leslie Ann Goldberg and Magn{\'{u}}s M. Halld{\'{o}}rsson and Anna Ing{\'{o}}lfsd{\'{o}}ttir and Igor Walukiewicz},
 booktitle    = {Automata, Languages and Programming, 35th International Colloquium, {ICALP} 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part {I:} Tack {A:} Algorithms, Automata, Complexity, and Games},
 series       = {Lecture Notes in Computer Science},
 volume       = {5125},
 publisher    = {Springer},
 pages        = {198--209},
 url          = {https://doi.org/10.1007/978-3-540-70575-8\_17},
)
@book(clrs22,
 author       = {T.H. Cormen and C.E. Leiserson and R.L. Rivest and C. Stein},
 year         = {2022},
 title        = {Introduction to Algorithms, fourth edition},
 publisher    = {MIT Press},
 url          = {https://books.google.com/books?id=HOJyzgEACAAJ},
)
@book(dpv08,
 author       = {Sanjoy Dasgupta and Christos H. Papadimitriou and Umesh V. Vazirani},
 year         = {2008},
 title        = {Algorithms},
 publisher    = {McGraw-Hill},
)
@book(gt14,
 author       = {M.T. Goodrich and R. Tamassia},
 year         = {2014},
 title        = {Algorithm Design and Applications},
 publisher    = {Wiley},
 url          = {https://books.google.com/books?id=tQBFBQAAQBAJ},
)
@incollection(hs14,
 author       = {Peter Hertling and Victor L. Selivanov},
 year         = {2014},
 title        = {Complexity issues for Preorders on finite labeled forests},
 editor       = {Vasco Brattka and Hannes Diener and Dieter Spreen},
 booktitle    = {Logic, Computation, Hierarchies},
 series       = {Ontos Mathematical Logic},
 volume       = {4},
 publisher    = {De Gruyter},
 pages        = {165--190},
 url          = {https://doi.org/10.1515/9781614518044.165},
)
@article(j75,
 author       = {Donald B. Johnson},
 year         = {1975},
 title        = {Finding All the Elementary Circuits of a Directed Graph},
 journal      = {{SIAM} J. Comput.},
 volume       = {4},
 number       = {1},
 pages        = {77--84},
 url          = {https://doi.org/10.1137/0204007},
)
@book(j11,
 author       = {Stasys Jukna},
 year         = {2011},
 title        = {Extremal Combinatorics - With Applications in Computer Science},
 series       = {Texts in Theoretical Computer Science. An {EATCS} Series},
 publisher    = {Springer},
 url          = {https://doi.org/10.1007/978-3-642-17364-6},
)
@article(km19,
 author       = {T. Kihara and A. Montalb\'{a}n},
 year         = {2019},
 title        = {On the structure of the Wadge degrees of bqo-valued Borel functions},
 journal      = {Trans. Amer. Math. Soc.},
 volume       = {371},
 pages        = {7885--7923},
 url          = {https://doi.org/10.1090/tran/7621},
)
@phdthesis(ko00,
 author       = {S. Kosub},
 year         = {2000},
 title        = {Complexity and Partitions},
 type         = {Phd thesis},
 school       = {Universit\"at W\"urzburg},
)
@inproceedings(kpb,
 author       = {Sriram C. Krishnan and Anuj Puri and Robert K. Brayton},
 year         = {1995},
 title        = {Structural Complexity of Omega-Automata},
 editor       = {Ernst W. Mayr and Claude Puech},
 booktitle    = {{STACS} 95, 12th Annual Symposium on Theoretical Aspects of Computer Science, Munich, Germany, March 2-4, 1995, Proceedings},
 series       = {Lecture Notes in Computer Science},
 volume       = {900},
 publisher    = {Springer},
 pages        = {143--156},
 url          = {https://doi.org/10.1007/3-540-59042-0\_69},
)
@article(kl,
 author       = {L{\'{e}}onard Kwuida and Erkko Lehtonen},
 year         = {2011},
 title        = {On the Homomorphism Order of Labeled Posets},
 journal      = {Order},
 volume       = {28},
 number       = {2},
 pages        = {251--265},
 url          = {https://doi.org/10.1007/s11083-010-9169-x},
)
@book(pp,
 author       = {D. Perrin and J.-E. Pin},
 year         = {2004},
 title        = {Infinite Words},
 publisher    = {Elsevier},
)
@article(s98,
 author       = {Victor L. Selivanov},
 year         = {1998},
 title        = {Fine Hierarchy of Regular Omega-Languages},
 journal      = {Theor. Comput. Sci.},
 volume       = {191},
 number       = {1-2},
 pages        = {37--59},
 url          = {https://doi.org/10.1016/S0304-3975(97)00301-0},
)
@article(s04,
 author       = {Victor L. Selivanov},
 year         = {2004},
 title        = {Boolean hierarchies of partitions over a reducible base},
 journal      = {Algebra and Logic},
 volume       = {43},
 number       = {1},
 pages        = {44--61},
 url          = {https://doi.org/10.1023/B:ALLO.0000015130.31054.b3},
)
@inproceedings(s11,
 author       = {Victor L. Selivanov},
 year         = {2011},
 title        = {A Fine Hierarchy of {$\omega$}-Regular k-Partitions},
 editor       = {Benedikt L{\"{o}}we and Dag Normann and Ivan N. Soskov and Alexandra A. Soskova},
 booktitle    = {Models of Computation in Context - 7th Conference on Computability in Europe, CiE 2011, Sofia, Bulgaria, June 27 - July 2, 2011. Proceedings},
 series       = {Lecture Notes in Computer Science},
 volume       = {6735},
 publisher    = {Springer},
 pages        = {260--269},
 url          = {https://doi.org/10.1007/978-3-642-21875-0\_28},
)
@article(s12,
 author       = {Victor L. Selivanov},
 year         = {2012},
 title        = {Fine hierarchies via Priestley duality},
 journal      = {Ann. Pure Appl. Log.},
 volume       = {163},
 number       = {8},
 pages        = {1075--1107},
 url          = {https://doi.org/10.1016/j.apal.2011.12.029},
)
@article(s22,
 author       = {Victor L. Selivanov},
 year         = {2022},
 title        = {Non-collapse of the effective Wadge hierarchy},
 journal      = {Comput.},
 volume       = {11},
 number       = {3-4},
 pages        = {335--358},
 url          = {https://doi.org/10.3233/COM-210376},
)
@article(s23,
 author       = {Victor L. Selivanov},
 year         = {2023},
 title        = {Wadge Degrees of Classes of {$\omega$}-Regular \emph{k}-Partitions},
 journal      = {J. Autom. Lang. Comb.},
 volume       = {28},
 number       = {1-3},
 pages        = {167--199},
 url          = {https://doi.org/10.25596/jalc-2023-167},
)
@article(t72,
 author       = {Robert Endre Tarjan},
 year         = {1972},
 title        = {Depth-First Search and Linear Graph Algorithms},
 journal      = {{SIAM} J. Comput.},
 volume       = {1},
 number       = {2},
 pages        = {146--160},
 url          = {https://doi.org/10.1137/0201010},
)
@incollection(th90,
 author       = {Wolfgang Thomas},
 year         = {1990},
 title        = {Automata on Infinite Objects},
 editor       = {Jan van Leeuwen},
 booktitle    = {Handbook of Theoretical Computer Science, Volume {B:} Formal Models and Semantics},
 publisher    = {Elsevier and {MIT} Press},
 pages        = {133--191},
 url          = {https://doi.org/10.1016/b978-0-444-88074-1.50009-3},
)
@phdthesis(wad84,
 author       = {W. Wadge},
 year         = {1984},
 title        = {Reducibility and determinateness in the Baire space},
 type         = {Phd thesis},
 school       = {University of California, Berkely},
)
@article(wag79,
 author       = {K. Wagner},
 year         = {1979},
 title        = {On $\omega$-regular sets},
 journal      = {Information and Control},
 volume       = {43},
 pages        = {123--177},
 url          = {https://doi.org/10.1016/S0019-9958(79)90653-3},
)
@inproceedings(wy,
 author       = {T. Wilke and H. Yoo},
 year         = {1995},
 title        = {Computing the Wadge degree, the Lipschitz degree, and the Rabin index of a regular language of infinite words in polynomial time},
 editor       = {Peter D. Mosses and Mogens Nielsen and Michael I. Schwartzbach},
 booktitle    = {TAPSOFT '95: Theory and Practice of Software Development},
 series       = {Lecture Notes in Computer Science},
 volume       = {915},
 publisher    = {Springer, Berlin, Heidelberg},
 pages        = {288--302},
 url          = {https://doi.org/10.1007/3-540-59293-8\_202},
)