Author of the publication

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

Netrunner Mate-in-1 or -2 is Weakly NP-Hard., and . CoRR, (2017)Coloring Octrees., , , and . COCOON, volume 3106 of Lecture Notes in Computer Science, page 62-71. Springer, (2004)The Minimum Weight Triangulation Problem with Few Inner Points., and . IWPEC, volume 3162 of Lecture Notes in Computer Science, page 200-212. Springer, (2004)Encoding nearest larger values., , , and . Theor. Comput. Sci., (2018)Benchmarking Question Answering Systems, , , , , , , and . Semantic Web, 10 (2): 293--304 (2019)The t-Pebbling Number is Eventually Linear in t., , , and . Electron. J. Comb., (2011)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)Connecting points in the presence of obstacles in the plane., and . CCCG, page 63-67. (2002)A simple linear algorithm for computing rectilinear 3-centers.. Comput. Geom., 31 (3): 150-165 (2005)Coloring octrees., , , and . Theor. Comput. Sci., 363 (1): 11-17 (2006)