52 citations · 224 across the 34 of their papers we have counts for
Showing 2017Show all
3 papers · 1 filter
math.CO2017
On the probability of nonexistence in binomial subsets
Frank Mousset, Andreas Noever, Konstantinos Panagiotou +1
Given a hypergraph and a sequence of values in , let be the random subset of obtained by keeping every…
cs.DS2017
Nearest Common Ancestors: Universal Trees and Improved Labeling Schemes
Fabian Kuhn, Konstantinos Panagiotou, Pascal Su
We investigate the nearest common ancestor (NCA) function in rooted trees. As the main conceptual contribution, the paper introduces universal trees for the NCA function: For a giv…
cs.DS2017
Optimal strategies for weighted ray search
Spyros Angelopoulos, Konstantinos Panagiotou
We introduce and study the general setting of weighted search in which a number of targets, each with a certain weight, are hidden in a star-like environment that consists of i…