Bounding and Computing Obstacle Numbers of Graphs

Abstract

Full Citation:

Martin Balko, Steven Chaplick, Robert Ganian, Siddharth Gupta, Michael Hoffmann, Pavel Valtr, Alexander Wolff. Bounding and Computing Obstacle Numbers of Graphs. 30th Annual European Symposium on Algorithms, ESA 2022, September 5-9, 2022, Berlin/Potsdam, Germany (Shiri Chechik and Gonzalo Navarro and Eva Rotenberg and Grzegorz Herman), volume 244 of LIPIcs, pages 11:1-11:13, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.

Robert Ganian
Robert Ganian

Robert Ganian is a Professor at the Algorithms and Complexity Group.