| Publication | Date of Publication | Type |
|---|
| Online scheduling on identical machines with a metric state space | 2024-04-23 | Paper |
| Elementarily traceable irrational numbers | 2024-01-12 | Paper |
| Trade-offs among degree, diameter, and number of paths | 2023-01-11 | Paper |
| Average-case polynomial-time computability of hamiltonian dynamics | 2021-08-04 | Paper |
| Simple strategies versus optimal schedules in multi-agent patrolling | 2020-09-03 | Paper |
| Polynomial Running Times for Polynomial-Time Oracle Machines | 2020-05-26 | Paper |
| A lower bound on opaque sets | 2019-10-18 | Paper |
| Second-order linear-time computability with applications to computable analysis | 2019-10-15 | Paper |
| Sequentially Swapping Colored Tokens on Graphs | 2019-02-14 | Paper |
| Parameterized complexity for uniform operators on multidimensional analytic functions and ODE solving | 2018-10-18 | Paper |
| Weight Balancing on Boundaries and Skeletons | 2018-04-23 | Paper |
| Complexity Theory of (Functions on) Compact Metric Spaces | 2018-04-23 | Paper |
| On characterizations of randomized computation using plain Kolmogorov complexity1 | 2018-03-16 | Paper |
| A Lower Bound on Opaque Sets | 2018-01-30 | Paper |
| On the computational complexity of the Dirichlet Problem for Poisson's Equation | 2017-11-22 | Paper |
| Sequentially Swapping Colored Tokens on Graphs | 2017-05-05 | Paper |
| Morpion solitaire 5D: a new upper bound of 121 on the maximum score | 2017-02-21 | Paper |
| Thin strip graphs | 2016-11-24 | Paper |
| Towards Computational Complexity Theory on Advanced Function Spaces in Analysis | 2016-08-17 | Paper |
| Complexity Theory for Operators in Analysis | 2015-09-24 | Paper |
| Simple Strategies Versus Optimal Schedules in Multi-agent Patrolling | 2015-09-21 | Paper |
| Differential recursion | 2015-09-17 | Paper |
| Computational benefit of smoothness: parameterized bit-complexity of numerical operators on analytic functions and Gevrey's hierarchy | 2015-08-24 | Paper |
| Fence patrolling by mobile agents with distinct speeds | 2015-07-08 | Paper |
| On minimum- and maximum-weight minimum spanning trees with neighborhoods | 2015-05-12 | Paper |
| Function Spaces for Second-Order Polynomial Time | 2015-02-25 | Paper |
| On Characterizations of Randomized Computation Using Plain Kolmogorov Complexity | 2014-10-14 | Paper |
| Small Complexity Classes for Computable Analysis | 2014-10-14 | Paper |
| Complexity theory for operators in analysis | 2014-08-13 | Paper |
| Zone diagrams in Euclidean spaces and in other normed spaces | 2014-04-03 | Paper |
| Distance k -sectors exist | 2014-04-03 | Paper |
| Computational Complexity of Smooth Differential Equations | 2014-03-24 | Paper |
| The Distance 4-Sector of Two Points Is Unique | 2014-01-14 | Paper |
| On Minimum-and Maximum-Weight Minimum Spanning Trees with Neighborhoods | 2013-09-13 | Paper |
| Fence patrolling by mobile agents with distinct speeds | 2013-03-21 | Paper |
| Zone diagrams in Euclidean spaces and in other normed spaces | 2012-12-20 | Paper |
| Parameterized Uniform Complexity in Numerics: from Smooth to Analytic, from NP-hard to Polytime | 2012-11-21 | Paper |
| Computational Complexity of Smooth Differential Equations | 2012-09-25 | Paper |
| Generalized semimagic squares for digital halftoning | 2011-11-30 | Paper |
| Lipschitz continuous ordinary differential equations are polynomial-space complete | 2011-02-18 | Paper |
| VC dimensions of principal component analysis | 2010-11-08 | Paper |
| Distance \(k\)-sectors exist | 2010-09-02 | Paper |
