research
∙
08/18/2023
Fair Allocation Algorithms for Indivisible Items under Structured Conflict Constraints
We consider the fair allocation of indivisible items to several agents w...
share
research
∙
08/26/2022
Avoidability beyond paths
The concept of avoidable paths in graphs was introduced by Beisegel, Chu...
research
∙
07/12/2022
Sprague-Grundy values and complexity for LCTR
Given a Young diagram on n boxes as a non-increasing sequence of integer...
research
∙
08/31/2021
Graphs where Search Methods are Indistinguishable
Graph searching is one of the simplest and most widely used tools in gra...
research
∙
06/18/2021
Graphs with at most two moplexes
A moplex is a natural graph structure that arises when lifting Dirac's c...
research
∙
08/20/2020
Fast recognition of some parametric graph families
We identify all [1, λ, 8]-cycle regular I-graphs and all [1, λ, 8]-cycle...
research
∙
08/03/2020
Shifting paths to avoidable ones
An extension of an induced path P in a graph G is an induced path P' suc...
research
∙
03/25/2020
Fair packing of independent sets
In this work we add a graph theoretical perspective to a classical probl...
research
∙
11/22/2018
Recognizing Graph Search Trees
Graph searches and the corresponding search trees can exhibit important ...
research
∙
10/29/2018
On the End-Vertex Problem of Graph Searches
End vertices of graph searches can exhibit strong structural properties ...
research
∙
06/07/2018
