PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Fluschnik, Till"

Author of the publication

copydeleteadd this publication to your clipboard
Kernelization Lower Bounds for Finding Constant Size Subgraphs.

, , and . CoRR, (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. You can also use the button next to the name to display some publications already assigned to the person.

Till Kugler University of Stuttgart

Till Böhm University of Stuttgart

Till Hielscher University of Stuttgart

Pascal Tilli University of Stuttgart

 

Other publications of authors with the same name

Kernelization Lower Bounds for Finding Constant-Size Subgraphs., , and . CiE, volume 10936 of Lecture Notes in Computer Science, page 183-193. Springer, (2018)The Parameterized Complexity of the Minimum Shared Edges Problem., , , and . CoRR, (2016)Fair Knapsack., , , and . CoRR, (2017)Fractals for Kernelization Lower Bounds, With an Application to Length-Bounded Cut Problems., , , and . CoRR, (2015)The Complexity of Finding Small Separators in Temporal Graphs., , , and . MFCS, volume 117 of LIPIcs, page 45:1-45:17. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, (2018)The Complexity of Routing with Few Collisions., , and . FCT, volume 10472 of Lecture Notes in Computer Science, page 257-270. Springer, (2017)On the Computational Complexity of Length- and Neighborhood-Constrained Path Problems., and . CoRR, (2018)A More Fine-Grained Complexity Analysis of Finding the Most Vital Edges for Undirected Shortest Paths., , , , and . CoRR, (2018)Exact mean computation in dynamic time warping spaces., , , , , and . Data Min. Knowl. Discov., 33 (1): 252-291 (2019)The parameterized complexity of the minimum shared edges problem., , , and . J. Comput. Syst. Sci., (2019)