( en | de | ru )

 

Disambiguation of "Korhonen, Tuukka"

Author of the publication

copydeleteadd this publication to your clipboard
Tight Lower Bounds for Problems Parameterized by Rank-Width.

, , and . STACS, volume 254 of LIPIcs, page 11:1-11:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)

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.

Hannu Korhonen

Hanna Korhonen

Urho Korhonen

Tuukka Kauhanen

Tuukka Ruotsalo

 

Other publications of authors with the same name

Shortest Cycles with Monotone Submodular Costs., , , , and . ACM Trans. Algorithms, 20 (1): 2:1-2:16 (January 2024)Fixed-Parameter Tractability of Maximum Colored Path and Beyond., , , , and . CoRR, (2022)Integrating Tree Decompositions into Decision Heuristics of Propositional Model Counters (Short Paper)., and . CP, volume 210 of LIPIcs, page 8:1-8:11. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Enumerating Potential Maximal Cliques via SAT and ASP., , and . IJCAI, page 1116-1122. ijcai.org, (2019)Potential Maximal Cliques Parameterized by Edge Clique Cover.. CoRR, (2019)A Single-Exponential Time 2-Approximation Algorithm for Treewidth.. FOCS, page 184-192. IEEE, (2021)Fixed-Parameter Tractability of Maximum Colored Path and Beyond., , , , and . SODA, page 3700-3712. SIAM, (2023)Shortest Cycles With Monotone Submodular Costs., , , , and . SODA, page 2214-2227. SIAM, (2023)New Width Parameters for Independent Set: One-Sided-Mim-Width and Neighbor-Depth., , and . WG, volume 14093 of Lecture Notes in Computer Science, page 72-85. Springer, (2023)Fully dynamic approximation schemes on planar and apex-minor-free graphs., , , and . CoRR, (2023)