Author of the publication

Parameterized Complexity of Secluded Connectivity Problems.

, , , and . FSTTCS, volume 45 of LIPIcs, page 408-419. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2015)

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

Families with infants: a general approach to solve hard partition problems., , and . CoRR, (2013)Families with infants: speeding up algorithms for NP-hard problems using FFT., , and . CoRR, (2014)Computing All MOD-Functions Simultaneously., , , and . CSR, volume 7353 of Lecture Notes in Computer Science, page 81-88. Springer, (2012)A 5n - o(n) Lower Bound on the Circuit Size over U 2 of a Linear Boolean Function., , and . CiE, volume 7318 of Lecture Notes in Computer Science, page 432-439. Springer, (2012)New Lower Bounds on Circuit Size of Multi-output Functions., , , and . Theory Comput. Syst., 56 (4): 630-642 (2015)Parameterized Complexity of Secluded Connectivity Problems., , , and . Theory Comput. Syst., 61 (3): 795-819 (2017)Solving 3-Superstring in 3 n/3 Time., , and . MFCS, volume 8087 of Lecture Notes in Computer Science, page 480-491. Springer, (2013)A better-than-3n lower bound for the circuit complexity of an explicit function., , , and . Electron. Colloquium Comput. Complex., (2015)Circuit size lower bounds and #SAT upper bounds through a general framework., , , and . Electron. Colloquium Comput. Complex., (2016)Weighted gate elimination: Boolean dispersers for quadratic varieties imply improved circuit lower bounds., and . Electron. Colloquium Comput. Complex., (2015)