Author of the publication

Bounding and Computing Obstacle Numbers of Graphs

, , , , , , and . Proc. 30th Europ. Symp. Algorithms (ESA'22), volume 244 of LIPIcs, page 11:1--13. Schloss Dagstuhl~-- Leibniz-Zentrum für Informatik, (2022)
DOI: 10.4230/LIPIcs.ESA.2022.11

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Benchmarking Question Answering Systems, , , , , , , and . Semantic Web, 10 (2): 293--304 (2019)Encoding nearest larger values., , , and . Theor. Comput. Sci., (2018)The t-Pebbling Number is Eventually Linear in t., , , and . Electron. J. Comb., (2011)A simple linear algorithm for computing rectilinear 3-centers.. Comput. Geom., 31 (3): 150-165 (2005)Netrunner Mate-in-1 or -2 is Weakly NP-Hard., and . CoRR, (2017)The Minimum Weight Triangulation Problem with Few Inner Points., and . IWPEC, volume 3162 of Lecture Notes in Computer Science, page 200-212. Springer, (2004)Coloring Octrees., , , and . COCOON, volume 3106 of Lecture Notes in Computer Science, page 62-71. Springer, (2004)Coloring octrees., , , and . Theor. Comput. Sci., 363 (1): 11-17 (2006)Halving balls by a hyperplane in deterministic linear time., , and . J. Comput. Geom., 11 (1): 576-614 (2020)The Number of Edges in Maximal 2-Planar Graphs., and . SoCG, volume 258 of LIPIcs, page 39:1-39:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)