research
∙
03/11/2022
Edge and Pair Queries – Random Graphs and Complexity
We investigate two types of query games played on a graph, pair queries ...
share
research
∙
07/12/2021
Noisy searching: simple, fast and correct
This work revisits the multiplicative weights update technique (MWU) whi...
research
∙
05/06/2021
Searching by Heterogeneous Agents
In this work we introduce and study a pursuit-evasion game in which the ...
research
∙
01/17/2021
The Complexity of Bicriteria Tree-Depth
This work considers the following extension of the tree-depth problem: f...
research
∙
04/30/2020
An Efficient Noisy Binary Search in Graphs via Median Approximation
Consider a generalization of the classical binary search problem in line...
research
∙
04/24/2019
Building a Nest by an Automaton
A robot modeled as a deterministic finite automaton has to build a struc...
research
∙
07/20/2018
Shared Processor Scheduling of Multiprocessor Jobs
We study shared processor scheduling of multiprocessor weighted jobs whe...
research
∙
04/05/2018
A Framework for Searching in Graphs in the Presence of Errors
We consider two types of searching models, where the goal is to design a...
research
∙
02/26/2018
On tradeoffs between width- and fill-like graph parameters
In this work we consider two two-criteria optimization problems: given a...
research
∙
12/01/2017
The Snow Team Problem (Clearing Directed Subgraphs by Mobile Agents)
We study several problems of clearing subgraphs by mobile agents in digr...
research
∙
09/28/2017