| 2025 | CASC | Ordered Fields and Grzegorczyk's Hierarchy. | Leonid Chilikov, Victor L. Selivanov |
| 2025 | CiE | L | Victor L. Selivanov |
| 2025 | CiE | Ordinal Invariants of the h-Preorder on k-Labeled Forests. | Victor L. Selivanov, Ilya Smirnov |
| 2024 | CiE | Universal Boolean Algebras with Applications to Semantic Classes of Models. | Mikhail G. Peretyat'kin, Victor L. Selivanov |
| 2023 | CiE | Logic vs Topology on Regular mega-languages. | Vladislav Orekhovskii, Victor L. Selivanov |
| 2023 | CiE | Extending Wagner's Hierarchy to Deterministic Visibly Pushdown Automata. | Victor L. Selivanov |
| 2022 | CiE | Enumerating Classes of Effective Quasi-Polish Spaces. | Matthew de Brecht, Takayuki Kihara, Victor L. Selivanov |
| 2022 | CiE | Boole vs Wadge: Comparing Two Basic Tools of Descriptive Set Theory. | Victor L. Selivanov |
| 2021 | CASC | Primitive Recursive Ordered Fields and Some Applications. | Victor L. Selivanov, Svetlana Selivanova |
| 2021 | CiE | Searching for Applicable Versions of Computable Structures. | Pavel Alaev, Victor L. Selivanov |
| 2021 | CiE | Non-collapse of the Effective Wadge Hierarchy. | Victor L. Selivanov |
| 2021 | CSR | Input-Driven Pushdown Automata on Well-Nested Infinite Strings. | Alexander Okhotin, Victor L. Selivanov |
| 2020 | CiE | Degrees of Non-computability of Homeomorphism Types of Polish Spaces. | Mathieu Hoyrup, Takayuki Kihara, Victor L. Selivanov |
| 2018 | CiE | Polynomial-Time Presentations of Algebraic Number Fields. | Pavel Alaev, Victor L. Selivanov |
| 2018 | CiE | Bit Complexity of Computing Solutions for Symmetric Hyperbolic Systems of PDEs (Extended Abstract). | Svetlana V. Selivanova, Victor L. Selivanov |
| 2017 | CiE | Extending Wadge Theory to k-Partitions. | Victor L. Selivanov |
| 2016 | CiE | The Boolean Algebra of Piecewise Testable Languages. | Anton Konovalov, Victor L. Selivanov |
| 2016 | CiE | On the Lattices of Effectively Open Sets. | Oleg V. Kudinov, Victor L. Selivanov |
| 2015 | CiE | Base-Complexity Classifications of QCB | Matthew de Brecht, Matthias Schrder, Victor L. Selivanov |
| 2015 | CiE | Towards the Effective Descriptive Set Theory. | Victor L. Selivanov |
| 2014 | CiE | Hyperprojective Hierarchy of qcb | Matthias Schrder, Victor L. Selivanov |
| 2013 | LATA | Boolean Algebras of Regular ω-Languages. | Victor L. Selivanov, Anton Konovalov |
| 2011 | CiE | Complexity Issues for Preorders on Finite Labeled Forests. | Peter Hertling, Victor L. Selivanov |
| 2011 | CiE | A Fine Hierarchy of ω-Regular k-Partitions. | Victor L. Selivanov |
| 2011 | DLT | Boolean Algebras of Regular Languages. | Victor L. Selivanov, Anton Konovalov |
| 2010 | CiE | Definability in the Subword Order. | Oleg V. Kudinov, Victor L. Selivanov, Lyudmila V. Yartseva |
| 2010 | CiE | Undecidability in Weihrauch Degrees. | Oleg V. Kudinov, Victor L. Selivanov, Anton V. Zhukov |
| 2009 | CiE | A Gandy Theorem for Abstract Structures and Applications to First-Order Definability. | Oleg V. Kudinov, Victor L. Selivanov |
| 2009 | DLT | Definability in the Infix Order on Words. | Oleg V. Kudinov, Victor L. Selivanov |
| 2008 | CiE | The Shrinking Property for NP and coNP. | Christian Glaer, Christian Reitwiener, Victor L. Selivanov |
| 2008 | CiE | Complexity of Aperiodicity for Topological Properties of Regular omega-Languages. | Victor L. Selivanov, Klaus W. Wagner |
| 2008 | DLT | Complexity of Topological Properties of Regular omega-Languages. | Victor L. Selivanov, Klaus W. Wagner |
| 2008 | STACS | Efficient Algorithms for Membership in Boolean Hierarchies of Regular Languages. | Christian Glaer, Heinz Schmitz, Victor L. Selivanov |
| 2007 | CiE | Definability in the Homomorphic Quasiorder of Finite Labeled Forests. | Oleg V. Kudinov, Victor L. Selivanov |
| 2007 | CiE | A Useful Undecidable Theory. | Victor L. Selivanov |
| 2007 | DLT | Fine Hierarchy of Regular Aperiodic | Victor L. Selivanov |
| 2007 | LATA | Classifying omega-regular partitions. | Victor L. Selivanov |
| 2006 | CiE | Undecidability in the Homomorphic Quasiorder of Finite Labeled Forests. | Oleg V. Kudinov, Victor L. Selivanov |
| 2005 | CiE | Some Reducibilities on Regular Sets. | Victor L. Selivanov |
| 2004 | MFCS | A Reducibility for the Dot-Depth Hierarchy. | Victor L. Selivanov, Klaus W. Wagner |
| 2003 | STACS | Wadge Degrees of omega-Languages of Deterministic Turing Machines. | Victor L. Selivanov |
| 2001 | FCT | Relating Automata-Theoretic Hierarchies to Complexity-Theoretic Hierarchies. | Victor L. Selivanov |
| 2001 | STACS | A Logical Approach to Decidability of Hierarchies of Regular Star-Free Languages. | Victor L. Selivanov |
| 1994 | STACS | Two Refinements of the Polynomial Hierarcht. | Victor L. Selivanov |
| 1987 | FCT | Index-Sets of Factor-Objects of the Post Numbering. | Victor L. Selivanov |