( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
From Gap-ETH to FPT-Inapproximability: Clique, Dominating Set, and More.

, , , , , , и . FOCS, стр. 743-754. IEEE Computer Society, (2017)

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.

Daniel Cygan

Lukas Cyganek

Johannes Cyganek

Josef Cyganek

Birgit Cygan

 

Другие публикации лиц с тем же именем

Fast Approximation in Subspaces by Doubling Metric Decomposition., , , , и . ESA (1), том 6346 из Lecture Notes in Computer Science, стр. 72-83. Springer, (2010)Split Vertex Deletion meets Vertex Cover: New fixed-parameter and exact exponential-time algorithms., и . Inf. Process. Lett., 113 (5-6): 179-182 (2013)Steiner Forest Orientation Problems., , и . ESA, том 7501 из Lecture Notes in Computer Science, стр. 361-372. Springer, (2012)Fast Approximation in Subspaces by Doubling Metric Decomposition, , , , и . CoRR, (2009)Fast branching algorithm for Cluster Vertex Deletion., , , и . CoRR, (2013)Improving TSP tours using dynamic programming over tree decomposition., , и . CoRR, (2017)Hardness of Approximation for H-free Edge Modification Problems., , , и . TOCT, 10 (2): 9:1-9:32 (2018)On Problems Equivalent to (min, +)-Convolution., , , и . ACM Trans. Algorithms, 15 (1): 14:1-14:25 (2019)A bound on the number of perfect matchings in Klee-graphs., , и . Discret. Math. Theor. Comput. Sci., 15 (1): 37-54 (2013)Approximation and Parameterized Complexity of Minimax Approval Voting., , , и . J. Artif. Intell. Res., (2018)