17 citations · 50 across the 13 of their papers we have counts for
4 papers · 1 filter
Learning Multi-Stage Sparsification for Maximum Clique Enumeration
Marco Grassia, Juho Lauri, Sourav Dutta +1
We propose a multi-stage learning approach for pruning the search space of maximum clique enumeration, a fundamental computationally difficult problem arising in various network an…
Complexity of fall coloring for restricted graph classes
Juho Lauri, Christodoulos Mitillos
We strengthen a result by Laskar and Lyle (Discrete Appl. Math. (2009), 330-338) by proving that it is NP-complete to decide whether a bipartite planar graph can be partitioned int…
Perfect Italian domination on planar and regular graphs
Juho Lauri, Christodoulos Mitillos
A perfect Italian dominating function of a graph is a function such that for every vertex , it holds that , i.…
Fine-grained Search Space Classification for Hard Enumeration Variants of Subset Problems
Juho Lauri, Sourav Dutta
We propose a simple, powerful, and flexible machine learning framework for (i) reducing the search space of computationally difficult enumeration variants of subset problems and (i…