| Publication | Date of Publication | Type |
|---|
An analysis of load-balancing algorithms on edge-Markovian evolving graphs
Journal of Computer and System Sciences | 2026-06-11 | Paper |
How many vertices does a random walk miss in a network with a moderately increasing number of vertices?
Mathematics of Operations Research | 2026-03-20 | Paper |
| The recurrence/transience of random walks on a bounded grid in an increasing dimension | 2026-01-30 | Paper |
scientific article; zbMATH DE number 7788346 (Why is no real title available?)
(available as arXiv preprint) | 2024-01-15 | Paper |
Searching with increasing speeds
Lecture Notes in Computer Science | 2023-08-02 | Paper |
Exploration of finite 2D square grid by a metamorphic robotic system
Lecture Notes in Computer Science | 2023-08-02 | Paper |
Self-stabilizing localization of the middle point of a line segment by an oblivious robot with limited visibility
Lecture Notes in Computer Science | 2022-11-04 | Paper |
Can a skywalker localize the midpoint of a rope?
ACM Transactions on Computation Theory | 2022-09-24 | Paper |
Search by a metamorphic robotic system in a finite 2D square grid
Information and Computation | 2022-05-17 | Paper |
Searching for an evader in an unknown dark cave by an optimal number of asynchronous searchers
Theoretical Computer Science | 2021-09-27 | Paper |
Every finite distributive lattice is isomorphic to the minimizer set of an \(M^\natural \)-concave set function
Operations Research Letters | 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
Theoretical Computer Science | 2020-08-03 | Paper |
Plane formation by synchronous mobile robots without chirality
(available as arXiv preprint) | 2020-07-30 | Paper |
Finding submodularity hidden in symmetric difference
SIAM Journal on Discrete Mathematics | 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
2012 Proceedings of the Ninth Workshop on Analytic Algorithmics and Combinatorics (ANALCO) | 2019-09-17 | Paper |
Total variation discrepancy of deterministic random walks for ergodic Markov chains
2016 Proceedings of the Thirteenth Workshop on Analytic Algorithmics and Combinatorics (ANALCO) | 2019-09-17 | Paper |
Deterministic random walks for rapidly mixing chains
SIAM Journal on Discrete Mathematics | 2018-09-05 | Paper |
Plane formation by synchronous mobile robots in the three dimensional Euclidean space
Lecture Notes in Computer Science | 2018-08-24 | Paper |
Plane formation by synchronous mobile robots in the three-dimensional Euclidean space
Journal of the ACM | 2018-05-17 | Paper |
Team assembling problem for asynchronous heterogeneous mobile robots
Theoretical Computer Science | 2018-03-12 | Paper |
The parity Hamiltonian cycle problem
Discrete Mathematics | 2018-01-19 | Paper |
Total variation discrepancy of deterministic random walks for ergodic Markov chains
Theoretical Computer Science | 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
(available as arXiv preprint) | 2017-10-23 | Paper |
An FPTAS for the volume computation of 0-1 knapsack polytopes based on approximate convolution
Algorithmica | 2016-12-21 | Paper |
The parity Hamiltonian cycle problem in directed graphs
Lecture Notes in Computer Science | 2016-11-30 | Paper |
Online Linear Optimization for Job Scheduling Under Precedence Constraints
Lecture Notes in Computer Science | 2016-11-30 | Paper |
Extended formulations for sparsity matroids
Mathematical Programming. Series A. Series B | 2016-08-25 | Paper |
An FPTAS for the volume computationof 0-1 knapsack polytopes based on approximate convolution integral
Algorithms and Computation | 2015-09-11 | Paper |
Collision of random walks and a refined analysis of attacks on the discrete logarithm problem
Lecture Notes in Computer Science | 2015-08-27 | Paper |
Deterministic random walks on finite graphs
Random Structures & Algorithms | 2015-07-23 | Paper |
Pattern formation by oblivious asynchronous mobile robots
SIAM Journal on Computing | 2015-06-24 | Paper |
\(L _{ \infty }\)-discrepancy analysis of polynomial-time deterministic samplers emulating rapidly mixing chains
Lecture Notes in Computer Science | 2014-09-26 | Paper |
Approximating the path-distance-width for AT-free graphs and graphs in related classes
Discrete Applied Mathematics | 2014-04-02 | Paper |
Asynchronous pattern formation by anonymous oblivious mobile robots
Lecture Notes in Computer Science | 2013-03-13 | Paper |
On space complexity of self-stabilizing leader election in mediated population protocol
Distributed Computing | 2013-02-04 | Paper |
Subgraph isomorphism in graph classes
Discrete Mathematics | 2012-10-16 | Paper |
Online prediction under submodular constraints
Lecture Notes in Computer Science | 2012-10-16 | Paper |
Sparsity and connectivity of medial graphs: Concerning two edge-disjoint Hamiltonian paths in planar rigidity circuits
Discrete Mathematics | 2012-08-10 | Paper |
On randomized approximation for finding a level ideal of a poset and the generalized median stable matchings
Mathematics of Operations Research | 2012-05-24 | Paper |
Online linear optimization over permutations
Algorithms and Computation | 2011-12-16 | Paper |
Approximability of the path-distance-width for AT-free graphs
Graph-Theoretic Concepts in Computer Science | 2011-12-16 | Paper |
A randomized algorithm for finding frequent elements in streams using O( N) space
Algorithms and Computation | 2011-12-16 | Paper |
A polynomial-time perfect sampler for the \(Q\)-Ising with a vertex-independent noise
Journal of Combinatorial Optimization | 2011-12-15 | Paper |
Dominating Set Counting in Graph Classes
Lecture Notes in Computer Science | 2011-08-17 | Paper |
Polynomial time approximate or perfect samplers for discretized Dirichlet distribution
Japan Journal of Industrial and Applied Mathematics | 2011-02-08 | Paper |
On listing, sampling, and counting the chordal graphs with edge constraints
Theoretical Computer Science | 2010-06-07 | Paper |
Approximation Algorithm and Perfect Sampler for Closed Jackson Networks with Single Servers
SIAM Journal on Computing | 2009-08-20 | Paper |
Finding a Level Ideal of a Poset
Lecture Notes in Computer Science | 2009-07-23 | Paper |
A Polynomial-Time Perfect Sampler for the Q-Ising with a Vertex-Independent Noise
Lecture Notes in Computer Science | 2009-07-23 | Paper |
Listing Chordal Graphs and Interval Graphs
Graph-Theoretic Concepts in Computer Science | 2008-09-04 | Paper |
Randomized approximation scheme and perfect sampler for closed Jackson networks with multiple servers
Annals of Operations Research | 2008-09-03 | Paper |
On Listing, Sampling, and Counting the Chordal Graphs with Edge Constraints
Lecture Notes in Computer Science | 2008-07-10 | Paper |
Polynomial time perfect sampling algorithm for two-rowed contingency tables
Random Structures & Algorithms | 2007-02-07 | Paper |
| Rapidly mixing chain and perfect sampler for logarithmic separable concave distributions on simplex | 2006-08-29 | Paper |
| scientific article; zbMATH DE number 2127729 (Why is no real title available?) | 2005-01-14 | Paper |
