research
∙
07/27/2023
Reachability Poorman Discrete-Bidding Games
We consider bidding games, a class of two-player zero-sum graph games. T...
share
research
∙
06/08/2022
Reconfiguration of Non-crossing Spanning Trees
For a set P of n points in the plane in general position, a non-crossing...
research
∙
04/21/2022
Lattice and Non-lattice Piercing of Axis-Parallel Rectangles: Exact Algorithms and a Separation Result
For a given family of shapes ℱ in the plane, we study what is the lowest...
research
∙
02/17/2022
Finding a Battleship of Uncertain Shape
Motivated by a game of Battleship, we consider the problem of efficientl...
research
∙
01/20/2022
Invasion Dynamics in the Biased Voter Process
The voter process is a classic stochastic process that models the invasi...
research
∙
01/06/2022
Fixation Maximization in the Positional Moran Process
The Moran process is a classic stochastic process that models invasion d...
research
∙
06/14/2021
Piercing All Translates of a Set of Axis-Parallel Rectangles
For a given shape S in the plane, one can ask what is the lowest possibl...
research
∙
01/11/2021
On Compatible Matchings
A matching is compatible to two or more labeled point sets of size n wit...
research
∙
01/02/2021
Long plane trees
Let 𝒫 be a finite set of points in the plane in general position. For an...
research
∙
11/19/2019
All-Pay Bidding Games on Graphs
In this paper we introduce and study all-pay bidding games, a class of ...
research
∙
03/16/2019
Token Swapping on Trees
The input to the token swapping problem is a graph with vertices v_1, v_...
research
∙
09/27/2018
Fixation probability and fixation time in structured populations
The rate of biological evolution depends on the fixation probability and...
research
∙
02/07/2018
