default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKustaa Kangas
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[j4]Kustaa Kangas, Mikko Koivisto
, Sami Salonen:
A Faster Tree-Decomposition Based Algorithm for Counting Linear Extensions. Algorithmica 82(8): 2156-2173 (2020)
2010 – 2019
- 2019
- [j3]Eduard Eiben, Robert Ganian, Kustaa Kangas, Sebastian Ordyniak:
Counting Linear Extensions: Parameterizations by Treewidth. Algorithmica 81(4): 1657-1683 (2019) - 2018
- [j2]Kustaa Kangas, Petteri Kaski, Janne H. Korhonen, Mikko Koivisto:
On the Number of Connected Sets in Bounded Degree Graphs. Electron. J. Comb. 25(4): 4 (2018) - [j1]Brandon M. Malone, Kustaa Kangas, Matti Järvisalo, Mikko Koivisto, Petri Myllymäki:
Empirical hardness of finding optimal Bayesian network structures: algorithm selection and runtime prediction. Mach. Learn. 107(1): 247-283 (2018) - [c9]Topi Talvitie, Kustaa Kangas, Teppo Mikael Niinimäki, Mikko Koivisto:
Counting Linear Extensions in Practice: MCMC Versus Exponential Monte Carlo. AAAI 2018: 1431-1438 - [c8]Topi Talvitie, Kustaa Kangas, Teppo Mikael Niinimäki, Mikko Koivisto:
A Scalable Scheme for Counting Linear Extensions. IJCAI 2018: 5119-5125 - [c7]Kustaa Kangas, Mikko Koivisto, Sami Salonen:
A Faster Tree-Decomposition Based Algorithm for Counting Linear Extensions. IPEC 2018: 5:1-5:13 - 2017
- [i1]Brandon M. Malone, Kustaa Kangas, Matti Järvisalo, Mikko Koivisto, Petri Myllymäki:
AS-ASL: Algorithm Selection with Auto-sklearn. OASC 2017: 19-22 - 2016
- [b1]Kustaa Kangas:
Combinatorial Algorithms with Applications in Learning Graphical Models. University of Helsinki, Finland, 2016 - [c6]Eduard Eiben, Robert Ganian, Kustaa Kangas, Sebastian Ordyniak:
Counting Linear Extensions: Parameterizations by Treewidth. ESA 2016: 39:1-39:18 - [c5]Kustaa Kangas, Teemu Hankala, Teppo Mikael Niinimäki, Mikko Koivisto:
Counting Linear Extensions of Sparse Posets. IJCAI 2016: 603-609 - 2015
- [c4]Kustaa Kangas, Teppo Mikael Niinimäki, Mikko Koivisto:
Averaging of Decomposable Graphs by Dynamic Programming and Sampling. UAI 2015: 415-424 - 2014
- [c3]Brandon M. Malone, Kustaa Kangas, Matti Järvisalo, Mikko Koivisto, Petri Myllymäki:
Predicting the Hardness of Learning Bayesian Networks. AAAI 2014: 2460-2466 - [c2]Kustaa Kangas, Mikko Koivisto, Teppo Mikael Niinimäki:
Learning Chordal Markov Networks by Dynamic Programming. NIPS 2014: 2357-2365 - [c1]Kustaa Kangas, Petteri Kaski, Mikko Koivisto, Janne H. Korhonen:
On the Number of Connected Sets in Bounded Degree Graphs. WG 2014: 336-347
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-04-24 22:55 CEST 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:
