1 citations · 2 across the 6 of their papers we have counts for
9 papers
Envy-free dynamic pricing schemes
Kristóf Bérczi, Laura Codazzi, Julian Golak +1
A combinatorial market consists of a set of indivisible items and a set of agents, where each agent has a valuation function that specifies for each subset of items its value for t…
Knot Diagrams of Treewidth Two
Hans L. Bodlaender, Benjamin Burton, Fedor V. Fomin +1
In this paper, we study knot diagrams for which the underlying graph has treewidth two. We give a linear time algorithm for the following problem: given a knot diagram of treewidth…
On the status sequences of trees
Aida Abiad, Boris Brimkov, Alexander Grigoriev
The status of a vertex in a connected graph is the sum of the distances from to all other vertices. The status sequence of a connected graph is the list of the statuses of…
Dispersing obnoxious facilities on a graph
Alexander Grigoriev, Tim A. Hartmann, Stefan Lendl +1
We study a continuous facility location problem on a graph where all edges have unit length and where the facilities may also be positioned in the interior of the edges. The goal i…
Optimal policy design for the sugar tax
Kelly Geyskens, Alexander Grigoriev, Niels Holtrop +1
Healthy nutrition promotions and regulations have long been regarded as a tool for increasing social welfare. One of the avenues taken in the past decade is sugar consumption regul…
Combinatorial Properties and Recognition of Unit Square Visibility Graphs
Katrin Casel, Henning Fernau, Alexander Grigoriev +2
Unit square (grid) visibility graphs (USV and USGV, resp.) are described by axis-parallel visibility between unit squares placed (on integer grid coordinates) in the plane. We inve…