Displaying results 1 - 10 / 2847
results / page
What publication information is included in the service?
Publication name
Authors
Publication channel
Year

A faster tree-decomposition based algorithm for counting linear extensions

Peer-reviewed
Open access
DOI
10.4230/LIPIcs.IPEC.2018.5
Kangas, Kustaa; Koivisto, M.; Salonen, S.
Leibniz International Proceedings in Informatics2019

Counting Linear Extensions: Parameterizations by Treewidth

Peer-reviewed
Open access
DOI
10.4230/LIPIcs.ESA.2016.39
Kangas, Kustaa; Eiben, Eduard; Ganian, Robert; Ordyniak, Sebastian
Leibniz international proceedings in informatics2016

Counting linear extensions of sparse posets

Peer-reviewed
Kangas, Juho-Kustaa Wiljami; Hankala, Teemu Juhani; Niinimäki, Teppo Mikael; Koivisto, Mikko Kalle H...
International Joint Conference on Artificial Intelligence2016

Approximate counting of linear extensions in practice

Peer-reviewed
Open access
DOI
10.1613/jair.1.16374
Talvitie, Topi; Koivisto, Mikko
Journal of Artificial Intelligence Research2024

A Scalable Scheme for Counting Linear Extensions

Peer-reviewed
Open access
Talvitie, Topi; Kangas, Juho-Kustaa; Niinimäki, Teppo; Koivisto, Mikko
International Joint Conference on Artificial Intelligence2018

A Faster Tree-Decomposition Based Algorithm for Counting Linear Extensions

Peer-reviewed
Open access
DOI
10.1007/s00453-019-00633-1
Kangas, Kustaa; Koivisto, Mikko; Salonen, Sami
Algorithmica2020

Counting Linear Extensions:Parameterizations by Treewidth

Peer-reviewed
Open access
DOI
10.1007/s00453-018-0496-4
Eiben, E.; Ganian, R.; Kangas, K.; Ordyniak, S.
Algorithmica2019

Counting Linear Extensions in Practice MCMC Versus Exponential Monte Carlo

Peer-reviewed
Open access
Talvitie, Topi Laurinpoika; Kangas, Juho-Kustaa Wiljami; Niinimäki, Teppo Mikael; Koivisto, Mikko Ka...
Proceedings of the AAAI conference on artificial intelligence2018

Extensions of MSO and the monadic counting hierarchy

Peer-reviewed
DOI
10.1016/j.ic.2010.09.002
Kontinen, Juha; Niemistö, Hannu
Information and Computation2011

Locally linear embedding algorithm. Extensions and applications

Kayo, Olga
Acta Universitatis Ouluensis Series C Technica2006

A faster tree-decomposition based algorithm for counting linear extensions

Peer-reviewed
Open access
DOI
10.4230/LIPIcs.IPEC.2018.5
2019

Counting Linear Extensions: Parameterizations by Treewidth

Peer-reviewed
Open access
DOI
10.4230/LIPIcs.ESA.2016.39
2016

Counting linear extensions of sparse posets

Peer-reviewed
2016

Approximate counting of linear extensions in practice

Peer-reviewed
Open access
DOI
10.1613/jair.1.16374
2024

A Scalable Scheme for Counting Linear Extensions

Peer-reviewed
Open access
2018

A Faster Tree-Decomposition Based Algorithm for Counting Linear Extensions

Peer-reviewed
Open access
DOI
10.1007/s00453-019-00633-1
2020

Counting Linear Extensions:Parameterizations by Treewidth

Peer-reviewed
Open access
DOI
10.1007/s00453-018-0496-4
2019

Counting Linear Extensions in Practice MCMC Versus Exponential Monte Carlo

Peer-reviewed
Open access
2018

Extensions of MSO and the monadic counting hierarchy

Peer-reviewed
DOI
10.1016/j.ic.2010.09.002
2011

Locally linear embedding algorithm. Extensions and applications

2006