Author of the publication

Seeing the trees and their branches in the network is hard.

, , , and . Theor. Comput. Sci., 401 (1-3): 153-164 (2008)

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

Polynomial time approximation schemes and parameterized complexity., , , and . Discrete Applied Mathematics, 155 (2): 180-193 (2007)Seeing the Trees and Their Branches in the Forest is Hard., , , and . ICTCS, page 82-93. World Scientific, (2007)Strong computational lower bounds via parameterized complexity., , , and . J. Comput. Syst. Sci., 72 (8): 1346-1367 (2006)RBoost: Label Noise-Robust Boosting Algorithm Based on a Nonconvex Loss Function and the Numerically Stable Base Learners., , , , , and . IEEE Trans. Neural Netw. Learning Syst., 27 (11): 2216-2228 (2016)Tight lower bounds for certain parameterized NP-hard problems., , , , , , and . Inf. Comput., 201 (2): 216-231 (2005)Improved upper bound on the stretch factor of delaunay triangulations.. Symposium on Computational Geometry, page 264-273. ACM, (2011)New and improved spanning ratios for Yao graphs., , , , , , , , , and . JoCG, 6 (2): 19-53 (2015)Flip Distance Is in FPT Time O(n+ k * c^k)., and . STACS, volume 30 of LIPIcs, page 500-512. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, (2015)When Is Weighted Satisfiability FPT?, and . WADS, volume 8037 of Lecture Notes in Computer Science, page 451-462. Springer, (2013)On the Induced Matching Problem., , , and . STACS, volume 1 of LIPIcs, page 397-408. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany, (2008)