default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTuukka Korhonen
Person information
- affiliation: University of Bergen, Norway
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j6]Fedor V. Fomin, Tuukka Korhonen
:
Fast FPT-Approximation of Branchwidth. SIAM J. Comput. 53(4): 1085-1131 (2024)- [j5]Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Daniel Lokshtanov, Giannos Stamoulis:
Shortest Cycles with Monotone Submodular Costs. ACM Trans. Algorithms 20(1): 2:1-2:16 (2024) - [j4]Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Kirill Simonov, Giannos Stamoulis:
Fixed-Parameter Tractability of Maximum Colored Path and Beyond. ACM Trans. Algorithms 20(4): 36:1-36:48 (2024) - [c24]Tuukka Korhonen, Fedor V. Fomin, Pekka Parviainen:
Structural perspective on constraint-based learning of Markov networks. AISTATS 2024: 1855-1863 - [c23]Matthias Bentert, Pål Grønås Drange, Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen:
Two-Sets Cut-Uncut on Planar Graphs. ICALP 2024: 22:1-22:18 - [c22]Clément Dallard, Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Martin Milanic:
Computing Tree Decompositions with Small Independence Number. ICALP 2024: 51:1-51:18 - [c21]Tuukka Korhonen, Wojciech Nadara, Michal Pilipczuk, Marek Sokolowski:
Fully dynamic approximation schemes on planar and apex-minor-free graphs. SODA 2024: 296-313 - [c20]Tuukka Korhonen, Daniel Lokshtanov:
Induced-Minor-Free Graphs: Separator Theorem, Subexponential Algorithms, and Improved Hardness of Recognition. SODA 2024: 5249-5275 - [c19]Tuukka Korhonen, Marek Sokolowski:
Almost-Linear Time Parameterized Algorithm for Rankwidth via Dynamic Rankwidth. STOC 2024: 1538-1549 - [c18]Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Saket Saurabh:
Stability in Graphs with Matroid Constraints. SWAT 2024: 22:1-22:16 - [i28]Tuukka Korhonen, Marek Sokolowski:
Almost-linear time parameterized algorithm for rankwidth via dynamic rankwidth. CoRR abs/2402.12364 (2024) - [i27]Tuukka Korhonen, Fedor V. Fomin, Pekka Parviainen:
Structural perspective on constraint-based learning of Markov networks. CoRR abs/2403.08562 (2024) - [i26]Tuukka Korhonen, Michal Pilipczuk, Giannos Stamoulis:
Minor Containment and Disjoint Paths in almost-linear time. CoRR abs/2404.03958 (2024) - [i25]Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Saket Saurabh:
Stability in Graphs with Matroid Constraints. CoRR abs/2404.03979 (2024) - [i24]Maria Chudnovsky, Meike Hatzel, Tuukka Korhonen, Nicolas Trotignon, Sebastian Wiederrecht:
Unavoidable induced subgraphs in graphs with complete bipartite induced minors. CoRR abs/2405.01879 (2024) - 2023
- [j3]Tuukka Korhonen:
Grid induced minor theorem for graphs of small degree. J. Comb. Theory B 160: 206-214 (2023) - [c17]Parinya Chalermsook, Fedor V. Fomin, Thekla Hamm, Tuukka Korhonen, Jesper Nederlof, Ly Orgo:
Polynomial-Time Approximation of Independent Set Parameterized by Treewidth. ESA 2023: 33:1-33:13 - [c16]Tuukka Korhonen, Konrad Majewski, Wojciech Nadara, Michal Pilipczuk, Marek Sokolowski:
Dynamic treewidth. FOCS 2023: 1734-1744 - [c15]Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Giannos Stamoulis:
Computing Paths of Large Rank in Planar Frameworks Deterministically. ISAAC 2023: 32:1-32:15 - [c14]Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Daniel Lokshtanov, Giannos Stamoulis:
Shortest Cycles With Monotone Submodular Costs. SODA 2023: 2214-2227 - [c13]Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Kirill Simonov, Giannos Stamoulis:
Fixed-Parameter Tractability of Maximum Colored Path and Beyond. SODA 2023: 3700-3712 - [c12]Benjamin Bergougnoux, Tuukka Korhonen, Jesper Nederlof:
Tight Lower Bounds for Problems Parameterized by Rank-Width. STACS 2023: 11:1-11:17 - [c11]Tuukka Korhonen, Daniel Lokshtanov:
An Improved Parameterized Algorithm for Treewidth. STOC 2023: 528-541 - [c10]Benjamin Bergougnoux, Tuukka Korhonen, Igor Razgon:
New Width Parameters for Independent Set: One-Sided-Mim-Width and Neighbor-Depth. WG 2023: 72-85 - [i23]Benjamin Bergougnoux, Tuukka Korhonen, Igor Razgon:
New Width Parameters for Independent Set: One-sided-mim-width and Neighbor-depth. CoRR abs/2302.10643 (2023) - [i22]Tuukka Korhonen, Konrad Majewski, Wojciech Nadara, Michal Pilipczuk, Marek Sokolowski:
Dynamic treewidth. CoRR abs/2304.01744 (2023) - [i21]Matthias Bentert, Pål Grønås Drange, Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen:
Two-sets cut-uncut on planar graphs. CoRR abs/2305.01314 (2023) - [i20]Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Giannos Stamoulis:
Computing paths of large rank in planar frameworks deterministically. CoRR abs/2305.01993 (2023) - [i19]Parinya Chalermsook, Fedor V. Fomin, Thekla Hamm, Tuukka Korhonen, Jesper Nederlof, Ly Orgo:
Polynomial-time Approximation of Independent Set Parameterized by Treewidth. CoRR abs/2307.01341 (2023) - [i18]Tuukka Korhonen, Daniel Lokshtanov:
Induced-Minor-Free Graphs: Separator Theorem, Subexponential Algorithms, and Improved Hardness of Recognition. CoRR abs/2308.04795 (2023) - [i17]Tuukka Korhonen, Matti Järvisalo:
SharpSAT-TD in Model Counting Competitions 2021-2023. CoRR abs/2308.15819 (2023) - [i16]Peter Gartland, Tuukka Korhonen, Daniel Lokshtanov:
On Induced Versions of Menger's Theorem on Sparse Graphs. CoRR abs/2309.08169 (2023) - [i15]Tuukka Korhonen, Wojciech Nadara, Michal Pilipczuk, Marek Sokolowski:
Fully dynamic approximation schemes on planar and apex-minor-free graphs. CoRR abs/2310.20623 (2023) - [i14]Édouard Bonnet, Jedrzej Hodor, Tuukka Korhonen, Tomás Masarík:
Treewidth is Polynomial in Maximum Degree on Graphs Excluding a Planar Induced Minor. CoRR abs/2312.07962 (2023) - 2022
- [j2]Tuukka Korhonen:
Finding Optimal Triangulations Parameterized by Edge Clique Cover. Algorithmica 84(8): 2242-2270 (2022) - [c9]Fedor V. Fomin, Tuukka Korhonen:
Fast FPT-approximation of branchwidth. STOC 2022: 886-899 - [i13]Tuukka Korhonen:
Grid Induced Minor Theorem for Graphs of Small Degree. CoRR abs/2203.13233 (2022) - [i12]Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Kirill Simonov, Giannos Stamoulis:
Fixed-Parameter Tractability of Maximum Colored Path and Beyond. CoRR abs/2207.07449 (2022) - [i11]Clément Dallard, Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Martin Milanic:
Computing Tree Decompositions with Small Independence Number. CoRR abs/2207.09993 (2022) - [i10]Benjamin Bergougnoux, Tuukka Korhonen, Jesper Nederlof:
Tight Lower Bounds for Problems Parameterized by Rank-width. CoRR abs/2210.02117 (2022) - [i9]Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Daniel Lokshtanov, Giannos Stamoulis:
Shortest Cycles With Monotone Submodular Costs. CoRR abs/2211.04797 (2022) - [i8]Tuukka Korhonen, Daniel Lokshtanov:
An Improved Parameterized Algorithm for Treewidth. CoRR abs/2211.07154 (2022) - 2021
- [c8]Tuukka Korhonen, Matti Järvisalo:
Integrating Tree Decompositions into Decision Heuristics of Propositional Model Counters (Short Paper). CP 2021: 8:1-8:11 - [c7]Tuukka Korhonen:
A Single-Exponential Time 2-Approximation Algorithm for Treewidth. FOCS 2021: 184-192 - [c6]Tuukka Korhonen:
Lower Bounds on Dynamic Programming for Maximum Weight Independent Set. ICALP 2021: 87:1-87:14 - [i7]Tuukka Korhonen:
Lower Bounds on Dynamic Programming for Maximum Weight Independent Set. CoRR abs/2102.06901 (2021) - [i6]Tuukka Korhonen:
Single-Exponential Time 2-Approximation Algorithm for Treewidth. CoRR abs/2104.07463 (2021) - [i5]Fedor V. Fomin, Tuukka Korhonen:
Fast FPT-Approximation of Branchwidth. CoRR abs/2111.03492 (2021) - 2020
- [c5]Tuukka Korhonen, Matti Järvisalo:
Finding Most Compatible Phylogenetic Trees over Multi-State Characters. AAAI 2020: 1544-1551 - [c4]Tuukka Korhonen:
Finding Optimal Triangulations Parameterized by Edge Clique Cover. IPEC 2020: 22:1-22:18 - [c3]Tuukka Korhonen:
PACE Solver Description: SMS. IPEC 2020: 30:1-30:4 - [i4]Tuukka Korhonen:
SMS in PACE 2020. CoRR abs/2006.07302 (2020) - [i3]Tuukka Korhonen:
Tight Bounds for Potential Maximal Cliques Parameterized by Vertex Cover. CoRR abs/2011.11282 (2020) - [i2]Tuukka Korhonen:
Listing Small Minimal Separators of a Graph. CoRR abs/2012.09153 (2020)
2010 – 2019
- 2019
- [j1]Tuukka Korhonen, Jeremias Berg, Matti Järvisalo:
Solving Graph Problems via Potential Maximal Cliques: An Experimental Evaluation of the Bouchitté-Todinca Algorithm. ACM J. Exp. Algorithmics 24(1): 1.9:1-1.9:19 (2019) - [c2]Tuukka Korhonen, Jeremias Berg, Matti Järvisalo:
Enumerating Potential Maximal Cliques via SAT and ASP. IJCAI 2019: 1116-1122 - [i1]Tuukka Korhonen:
Potential Maximal Cliques Parameterized by Edge Clique Cover. CoRR abs/1912.10989 (2019) - 2017
- [c1]Tuukka Korhonen, Jeremias Berg, Paul Saikko, Matti Järvisalo:
MaxPre: An Extended MaxSAT Preprocessor. SAT 2017: 449-456
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-07 21:32 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
