17 citations · 50 across the 13 of their papers we have counts for
18 papers
A disproof of a gap-one conjecture for the equitable chromatic number of block graphs
Juho Lauri
For a graph , let , where is the clique number and is the minimum, over all vertices , of the…
Exact defective colorings of graphs
James Cumberbatch, Juho Lauri, Christodoulos Mitillos
An exact -coloring of a graph is a coloring of its vertices with colors such that each vertex is adjacent to exactly vertices having the same color as . T…
Restless reachability problems in temporal graphs
Suhas Thejaswi, Juho Lauri, Aristides Gionis
We study a family of reachability problems under waiting-time restrictions in temporal and vertex-colored temporal graphs. Given a temporal graph and a set of source vertices, we f…
Upper Bounding Rainbow Connection Number by Forest Number
L. Sunil Chandran, Davis Issac, Juho Lauri +1
A path in an edge-colored graph is rainbow if no two edges of it are colored the same, and the graph is rainbow-connected if there is a rainbow path between each pair of its vertic…
Towards Quantifying the Distance between Opinions
Saket Gurukar, Deepak Ajwani, Sourav Dutta +3
Increasingly, critical decisions in public policy, governance, and business strategy rely on a deeper understanding of the needs and opinions of constituent members (e.g. citizens,…
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…