Juho Lauri

Orcid: 0000-0002-6781-6106

According to our database1, Juho Lauri authored at least 23 papers between 2015 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Learning fine-grained search space pruning and heuristics for combinatorial optimization.
J. Heuristics, 2023

2022
Upper bounding rainbow connection number by forest number.
Discret. Math., 2022

2021
Exact defective colorings of graphs.
CoRR, 2021

2020
NP-completeness results for partitioning a graph into total dominating sets.
Theor. Comput. Sci., 2020

Parameterized complexity of happy coloring problems.
Theor. Comput. Sci., 2020

Complexity of Fall Coloring for Restricted Graph Classes.
Theory Comput. Syst., 2020

Perfect Italian domination on planar and regular graphs.
Discret. Appl. Math., 2020

Finding Path Motifs in Large Temporal Graphs Using Algebraic Fingerprints.
Big Data, 2020

Towards Quantifying the Distance between Opinions.
Proceedings of the Fourteenth International AAAI Conference on Web and Social Media, 2020

2019
On the complexity of restoring corrupted colorings.
J. Comb. Optim., 2019

Learning Multi-Stage Sparsification for Maximum Clique Enumeration.
CoRR, 2019

Finding a Maximum Clique in Dense Graphs via χ2 Statistics.
Proceedings of the 28th ACM International Conference on Information and Knowledge Management, 2019

Fine-Grained Search Space Classification for Hard Enumeration Variants of Subset Problems.
Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

2018
On the Fine-Grained Complexity of Rainbow Coloring.
SIAM J. Discret. Math., 2018

Computing Minimum Rainbow and Strong Rainbow Colorings of Block Graphs.
Discret. Math. Theor. Comput. Sci., 2018

On the complexity of rainbow coloring problems.
Discret. Appl. Math., 2018

Engineering Motif Search for Large Motifs.
Proceedings of the 17th International Symposium on Experimental Algorithms, 2018

Rainbow Vertex Coloring Bipartite Graphs and Chordal Graphs.
Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science, 2018

2017
Complexity of rainbow vertex connectivity problems for restricted graph classes.
Discret. Appl. Math., 2017

Algorithms and hardness results for happy coloring problems.
CoRR, 2017

2016
On finding rainbow and colorful paths.
Theor. Comput. Sci., 2016

Further hardness results on rainbow and strong rainbow connectivity.
Discret. Appl. Math., 2016

2015
Engineering Motif Search for Large Graphs.
Proceedings of the Seventeenth Workshop on Algorithm Engineering and Experiments, 2015


  Loading...