| Discovering causal graphs with cycles and latent confounders: An exact branch-and-bound approach K Rantanen, A Hyttinen, M Järvisalo International Journal of Approximate Reasoning 117, 29-49, 2020 | 17 | 2020 |
| Learning optimal causal graphs with exact search K Rantanen, A Hyttinen, M Järvisalo International Conference on Probabilistic Graphical Models, 344-355, 2018 | 12 | 2018 |
| Learning chordal Markov networks via branch and bound K Rantanen, A Hyttinen, M Järvisalo Advances in neural information processing systems 30, 2017 | 10 | 2017 |
| Maximal ancestral graph structure learning via exact search K Rantanen, A Hyttinen, M Järvisalo Uncertainty in Artificial Intelligence, 1237-1247, 2021 | 9 | 2021 |
| Learning optimal cyclic causal graphs from interventional data K Rantanen, A Hyttinen, M Järvisalo International Conference on Probabilistic Graphical Models, 365-376, 2020 | 6 | 2020 |
| Learning score-optimal chordal Markov networks via branch and bound K Rantanen Computer Science 54, 2017 | 1 | 2017 |
| Optimization Algorithms for Learning Graphical Model Structures. K Rantanen University of Helsinki, Finland, 2021 | | 2021 |
| Learning Chordal Markov Networks via Stochastic Local Search K Rantanen, A Hyttinen, M Järvisalo ECAI 2020, 2632-2639, 2020 | | 2020 |
| BBMarkov: a branch-and-bound approach to learning optimal decomposable graphs KMJ Rantanen, AJ Hyttinen, MJ Järvisalo | | 2017 |
| 58093 String Processing Algorithms (Autumn 2015) Study Groups 1 (Thurday, November 5) D Denis, M Halin, Y He, J Jecmen, M Korento, J Mesimäki, K Rantanen, ... Journal of Experimental Algorithmics (JEA) 15, 2-5, 2010 | | 2010 |
