| Publication | Date of Publication | Type |
|---|
| Experimental Study of the Game Exact Nim(5, 2) | 2023-11-30 | Paper |
| Computing Remoteness Functions of Moore, Wythoff, and Euclid's games | 2023-11-05 | Paper |
| Shifting paths to avoidable ones | 2023-10-05 | Paper |
| Testing the satisfiability of algebraic formulas over the field of two elements | 2023-09-04 | Paper |
| On Remoteness Functions of Exact Slow $k$-NIM with $k+1$ Piles | 2023-04-13 | Paper |
| Automata equipped with auxiliary data structures and regular realizability problems | 2022-11-09 | Paper |
| Computational Hardness of Multidimensional Subtraction Games | 2022-10-19 | Paper |
| A win-win algorithm for the $(k+1)$-LST/$k$-pathwidth problem | 2022-08-29 | Paper |
| Avoidability beyond paths | 2022-08-26 | Paper |
| On computational complexity of set automata | 2021-11-25 | Paper |
| Counting the number of perfect matchings, and generalized decision trees | 2021-08-04 | Paper |
| Uniform cross-$t$-intersecting families: proving Hirschorn's conjecture up to polynomial factor | 2021-02-20 | Paper |
| Re-pairing brackets | 2021-01-21 | Paper |
| Geometry of translations on a Boolean cube | 2020-06-23 | Paper |
| Fast protocols for leader election and spanning tree construction in a distributed network | 2020-01-16 | Paper |
| Lower estimate for the cardinality of the domain of universal functions for the class of linear Boolean functions | 2018-04-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4635461 | 2018-04-22 | Paper |
| Gr\"unbaum coloring and its generalization to arbitrary dimension | 2017-11-29 | Paper |
| On computational complexity of set automata | 2017-10-13 | Paper |
| On the linear classification of even and odd permutation matrices and the complexity of computing the permanent | 2017-06-27 | Paper |
| On regular realizability problems for context-free languages | 2016-10-19 | Paper |
| Separating words by occurrences of subwords | 2015-07-27 | Paper |
| Distributed communication complexity of spanning tree construction | 2015-07-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5263763 | 2015-07-17 | Paper |
| On expressive power of regular realizability problems | 2015-03-17 | Paper |
| Cones of multipowers and combinatorial optimization problems | 2014-04-28 | Paper |
| On regular realizability problems | 2013-11-01 | Paper |
| Universality of Regular Realizability Problems | 2013-06-14 | Paper |
| Characterizing (quasi-)ultrametric finite spaces in terms of (directed) graphs | 2012-08-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3115238 | 2012-02-20 | Paper |
| Orbits of Linear Maps and Regular Languages | 2011-06-17 | Paper |
| Identical Relations in Symmetric Groups and Separating Words with Reversible Automata | 2010-06-22 | Paper |
| Efficient algorithms for sparse cyclotomic integer zero testing | 2010-03-05 | Paper |
| On Models of a Nondeterministic Computation | 2009-08-18 | Paper |
| Semidefinite programming and arithmetic circuit evaluation | 2008-09-10 | Paper |
| An Efficient Algorithm for Zero-Testing of a Lacunary Polynomial at the Roots of Unity | 2008-06-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5715089 | 2005-12-19 | Paper |
| On the stability of the Voronoi diagram. | 2004-03-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4406630 | 2003-06-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4544834 | 2002-08-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3980662 | 1992-06-26 | Paper |
| Growing Trees and Amoebas' Replications | 0001-01-03 | Paper |
