15 citations · 20 across the 6 of their papers we have counts for
3 papers · 1 filter
Learning fine-grained search space pruning and heuristics for combinatorial optimization
Juho Lauri, Sourav Dutta, Marco Grassia +1
Combinatorial optimization problems arise in a wide range of applications from diverse domains. Many of these problems are NP-hard and designing efficient heuristics for them requi…
Algorithms and hardness results for happy coloring problems
N. R. Aravind, Subrahmanyam Kalyanasundaram, Anjeneya Swami Kare +1
In a vertex-colored graph, an edge is happy if its endpoints have the same color. Similarly, a vertex is happy if all its incident edges are happy. Motivated by the computation of…
On the fine-grained complexity of rainbow coloring
Łukasz Kowalik, Juho Lauri, Arkadiusz Socała
The Rainbow k-Coloring problem asks whether the edges of a given graph can be colored in colors so that every pair of vertices is connected by a rainbow path, i.e., a path with…