Engineering Motif Search for Large Graphs. - Andreas Björklund; Petteri Kaski; Lukasz Kowalik; Juho Lauri (ALENEX, 2015)

Further hardness results on rainbow and strong rainbow connectivity. - Juho Lauri (Discret. Appl. Math., 2016)

On finding rainbow and colorful paths. - Lukasz Kowalik; Juho Lauri (Theor. Comput. Sci., 2016)

Chasing the Rainbow Connection: Hardness, Algorithms, and Bounds. - Juho Lauri (2016)

Algorithms and hardness results for happy coloring problems. - N. R. Aravind; Subrahmanyam Kalyanasundaram; Anjeneya Swami Kare; Juho Lauri (CoRR, 2017)

Complexity of rainbow vertex connectivity problems for restricted graph classes. - Juho Lauri (Discret. Appl. Math., 2017)

Rainbow Vertex Coloring Bipartite Graphs and Chordal Graphs. - Pinar Heggernes; Davis Issac; Juho Lauri; Paloma T. Lima; Erik Jan van Leeuwen (MFCS, 2018)

Engineering Motif Search for Large Motifs. - Petteri Kaski; Juho Lauri; Suhas Thejaswi (SEA, 2018)

On the complexity of rainbow coloring problems. - Eduard Eiben; Robert Ganian; Juho Lauri (Discret. Appl. Math., 2018)

Computing Minimum Rainbow and Strong Rainbow Colorings of Block Graphs. - Melissa S. Keranen; Juho Lauri (Discret. Math. Theor. Comput. Sci., 2018)

On the Fine-Grained Complexity of Rainbow Coloring. - Lukasz Kowalik; Juho Lauri; Arkadiusz Socala (SIAM J. Discret. Math., 2018)

Fine-Grained Search Space Classification for Hard Enumeration Variants of Subset Problems. - Juho Lauri; Sourav Dutta 001 (AAAI, 2019)

Finding a Maximum Clique in Dense Graphs via χ2 Statistics. - Sourav Dutta 001; Juho Lauri (CIKM, 2019)

Learning Multi-Stage Sparsification for Maximum Clique Enumeration. - Marco Grassia; Juho Lauri; Sourav Dutta 001; Deepak Ajwani (CoRR, 2019)

On the complexity of restoring corrupted colorings. - Marzio De Biasi; Juho Lauri (J. Comb. Optim., 2019)

Towards Quantifying the Distance between Opinions. - Saket Gurukar; Deepak Ajwani; Sourav Dutta 001; Juho Lauri; Srinivasan Parthasarathy 001; Alessandra Sala (ICWSM, 2020)

Finding Path Motifs in Large Temporal Graphs Using Algebraic Fingerprints. - Suhas Thejaswi; Aristides Gionis; Juho Lauri (Big Data, 2020)

Perfect Italian domination on planar and regular graphs. - Juho Lauri; Christodoulos Mitillos (Discret. Appl. Math., 2020)

Complexity of Fall Coloring for Restricted Graph Classes. - Juho Lauri; Christodoulos Mitillos (Theory Comput. Syst., 2020)

Parameterized complexity of happy coloring problems. - Akanksha Agrawal 001; N. R. Aravind; Subrahmanyam Kalyanasundaram; Anjeneya Swami Kare; Juho Lauri; Neeldhara Misra; I. Vinod Reddy (Theor. Comput. Sci., 2020)

NP-completeness results for partitioning a graph into total dominating sets. - Mikko Koivisto; Petteri Laakkonen; Juho Lauri (Theor. Comput. Sci., 2020)

Exact defective colorings of graphs. - James Cumberbatch; Juho Lauri; Christodoulos Mitillos (CoRR, 2021)

Upper bounding rainbow connection number by forest number. - L. Sunil Chandran; Davis Issac; Juho Lauri; Erik Jan van Leeuwen (Discret. Math., 2022)

Learning fine-grained search space pruning and heuristics for combinatorial optimization. - Juho Lauri; Sourav Dutta 001; Marco Grassia; Deepak Ajwani (J. Heuristics, 2023)

Restless reachability problems in temporal graphs. - Suhas Thejaswi; Juho Lauri; Aristides Gionis (Knowl. Inf. Syst., 2025)