Combating Collusion Rings is Hard but Possible

1 code implementation • 14 Dec 2021 • Niclas Boehmer, Robert Bredereck, André Nichterlein

A recent report of Littmann [Commun.

Parameterized Complexity of Diameter

no code implementations • 27 Feb 2018 • Matthias Bentert, André Nichterlein

Diameter -- the task of computing the length of a longest shortest path -- is a fundamental graph problem.

Data Structures and Algorithms