| Publication | Date of Publication | Type |
|---|
| https://portal.mardi4nfdi.de/entity/Q6147254 | 2024-01-15 | Paper |
| Searching with increasing speeds | 2023-08-02 | Paper |
| Exploration of finite 2D square grid by a metamorphic robotic system | 2023-08-02 | Paper |
| Self-stabilizing Localization of the Middle Point of a Line Segment by an Oblivious Robot with Limited Visibility | 2022-11-04 | Paper |
| Can a Skywalker Localize the Midpoint of a Rope? | 2022-09-24 | Paper |
| Search by a metamorphic robotic system in a finite 2D square grid | 2022-05-17 | Paper |
| Searching for an evader in an unknown dark cave by an optimal number of asynchronous searchers | 2021-09-27 | Paper |
| Every finite distributive lattice is isomorphic to the minimizer set of an \(M^\natural \)-concave set function | 2021-04-07 | Paper |
| An FPTAS for the volume of some \(\mathcal{V} \)-polytopes -- it is hard to compute the volume of the intersection of two cross-polytopes | 2020-08-03 | Paper |
| Plane formation by synchronous mobile robots without chirality | 2020-07-30 | Paper |
| Finding Submodularity Hidden in Symmetric Difference | 2020-03-04 | Paper |
| Searching for an evader in an unknown graph by an optimal number of searchers | 2019-11-22 | Paper |
| Plane formation by semi-synchronous robots in the three dimensional Euclidean space | 2019-11-22 | Paper |
| Deterministic Random Walks on Finite Graphs | 2019-09-17 | Paper |
| Total Variation Discrepancy of Deterministic Random Walks for Ergodic Markov Chains | 2019-09-17 | Paper |
| Deterministic Random Walks for Rapidly Mixing Chains | 2018-09-05 | Paper |
| Plane formation by synchronous mobile robots in the three dimensional Euclidean space | 2018-08-24 | Paper |
| Plane formation by synchronous mobile robots in the three dimensional Euclidean space | 2018-05-17 | Paper |
| Team assembling problem for asynchronous heterogeneous mobile robots | 2018-03-12 | Paper |
| The parity Hamiltonian cycle problem | 2018-01-19 | Paper |
| Total variation discrepancy of deterministic random walks for ergodic Markov chains | 2017-11-03 | Paper |
| An FPTAS for the volume of some \(\mathcal{V}\)-polytopes -- it is hard to compute the volume of the intersection of two cross-polytopes | 2017-10-23 | Paper |
| An FPTAS for the volume computation of 0-1 knapsack polytopes based on approximate convolution | 2016-12-21 | Paper |
| The Parity Hamiltonian Cycle Problem in Directed Graphs | 2016-11-30 | Paper |
| Online Linear Optimization for Job Scheduling Under Precedence Constraints | 2016-11-30 | Paper |
| Extended formulations for sparsity matroids | 2016-08-25 | Paper |
| An FPTAS for the Volume Computationof 0-1 Knapsack Polytopes Based on Approximate Convolution Integral | 2015-09-11 | Paper |
| Collision of Random Walks and a Refined Analysis of Attacks on the Discrete Logarithm Problem | 2015-08-27 | Paper |
| Deterministic random walks on finite graphs | 2015-07-23 | Paper |
| Pattern Formation by Oblivious Asynchronous Mobile Robots | 2015-06-24 | Paper |
| L ∞ -Discrepancy Analysis of Polynomial-Time Deterministic Samplers Emulating Rapidly Mixing Chains | 2014-09-26 | Paper |
| Approximating the path-distance-width for AT-free graphs and graphs in related classes | 2014-04-02 | Paper |
| Asynchronous Pattern Formation by Anonymous Oblivious Mobile Robots | 2013-03-13 | Paper |
| On space complexity of self-stabilizing leader election in mediated population protocol | 2013-02-04 | Paper |
| Subgraph isomorphism in graph classes | 2012-10-16 | Paper |
| Online Prediction under Submodular Constraints | 2012-10-16 | Paper |
| Sparsity and connectivity of medial graphs: Concerning two edge-disjoint Hamiltonian paths in planar rigidity circuits | 2012-08-10 | Paper |
| On randomized approximation for finding a level ideal of a poset and the generalized median stable matchings | 2012-05-24 | Paper |
| Online Linear Optimization over Permutations | 2011-12-16 | Paper |
| Approximability of the Path-Distance-Width for AT-free Graphs | 2011-12-16 | Paper |
| A Randomized Algorithm for Finding Frequent Elements in Streams Using O(loglogN) Space | 2011-12-16 | Paper |
| A polynomial-time perfect sampler for the \(Q\)-Ising with a vertex-independent noise | 2011-12-15 | Paper |
| Dominating Set Counting in Graph Classes | 2011-08-17 | Paper |
| Polynomial time approximate or perfect samplers for discretized Dirichlet distribution | 2011-02-08 | Paper |
| On listing, sampling, and counting the chordal graphs with edge constraints | 2010-06-07 | Paper |
| Approximation Algorithm and Perfect Sampler for Closed Jackson Networks with Single Servers | 2009-08-20 | Paper |
| Finding a Level Ideal of a Poset | 2009-07-23 | Paper |
| A Polynomial-Time Perfect Sampler for the Q-Ising with a Vertex-Independent Noise | 2009-07-23 | Paper |
| Listing Chordal Graphs and Interval Graphs | 2008-09-04 | Paper |
| Randomized approximation scheme and perfect sampler for closed Jackson networks with multiple servers | 2008-09-03 | Paper |
| On Listing, Sampling, and Counting the Chordal Graphs with Edge Constraints | 2008-07-10 | Paper |
| Polynomial time perfect sampling algorithm for two-rowed contingency tables | 2007-02-07 | Paper |
| Rapidly mixing chain and perfect sampler for logarithmic separable concave distributions on simplex | 2006-08-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3154676 | 2005-01-14 | Paper |
