1 citations · 2 across the 3 of their papers we have counts for
4 papers
Finding the diameter of a tree with distance queries
Dániel Gerbner, András Imolay, Kartal Nagy +2
We study the number of distance queries needed to identify certain properties of a hidden tree on vertices. A distance query consists of two vertices , and the answer…
Stabbing non-piercing sets and face lengths in large girth plane graphs
Dömötör Pálvölgyi, Kristóf Zólomy
We show that a non-piercing family of connected planar sets with bounded independence number can be stabbed with a constant number of points. As a consequence, we answer a question…
Identification of a monotone Boolean function with "reasons" as a combinatorial search problem
Dániel Gerbner, András Imolay, Gyula O. H. Katona +5
We study the number of queries needed to identify a monotone Boolean function . A query consists of a 0-1-sequence, and the answer is the value of…
Discrete and Continuous Caching Games
Áron Jánosik, Csenge Miklós, Dániel G. Simon +1
We investigate a discrete search game called the Multiple Caching Game where the searcher's aim is to find all of a set of treasures hidden in locations. Allowed queries ar…