Author of the publication

Efficient Data Reduction for DOMINATING SET: A Linear Problem Kernel for the Planar Case.

, , and . SWAT, volume 2368 of Lecture Notes in Computer Science, page 150-159. Springer, (2002)

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

An Adaptive Version of Brandes' Algorithm for Betweenness Centrality., , , , and . ISAAC, volume 123 of LIPIcs, page 36:1-36:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Reflections on Multivariate Algorithmics and Problem Parameterization.. STACS, volume 5 of LIPIcs, page 17-32. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2010)Faster Binary Mean Computation Under Dynamic Time Warping., , and . CoRR, (2020)Polynomial Time Data Reduction for Dominating Set, , and . CoRR, (2002)Listing All Maximal k-Plexes in Temporal Graphs., , , , , and . ACM Journal of Experimental Algorithmics, 24 (1): 1.13:1-1.13:27 (2019)Complexity of Combinatorial Matrix Completion With Diameter Constraints., , and . CoRR, (2020)The Computational Complexity of Finding Separators in Temporal Graphs., , , and . CoRR, (2017)On Multidimensional Curves with Hilbert Property., and . Theory Comput. Syst., 33 (4): 295-312 (2000)As Time Goes By: Reflections on Treewidth for Temporal Graphs., , , , and . Treewidth, Kernels, and Algorithms, volume 12160 of Lecture Notes in Computer Science, page 49-77. Springer, (2020)Interval Scheduling and Colorful Independent Sets., , , and . ISAAC, volume 7676 of Lecture Notes in Computer Science, page 247-256. Springer, (2012)