3 citations · 12 across the 26 of their papers we have counts for
5 papers · 1 filter
Graph Coloring Below Guarantees via Co-Triangle Packing
Shyan Akmal, Tomohiro Koana
In the -Coloring Problem, we are given a graph on nodes, and tasked with determining if its vertices can be properly colored using colors. In this paper we study b…
Kronecker scaling of tensors with applications to arithmetic circuits and algorithms
Andreas Björklund, Petteri Kaski, Tomohiro Koana +1
We show that sufficiently low tensor rank for the balanced tripartitioning tensor for a large enough constan…
FPT algorithms over linear delta-matroids with applications
Eduard Eiben, Tomohiro Koana, Magnus Wahlström
Matroids, particularly linear ones, have been a powerful tool in parameterized complexity for algorithms and kernelization. They have sped up or replaced dynamic programming. Delta…
Faster Minimization of Total Weighted Completion Time on Parallel Machines
Danny Hermelin, Tomohiro Koana, Dvir Shabtay
We study the classical problem of minimizing the total weighted completion time on a fixed set of identical machines working in parallel, the problem in the s…
Faster Edge Coloring by Partition Sieving
Shyan Akmal, Tomohiro Koana
In the Edge Coloring problem, we are given an undirected graph with vertices and edges, and are tasked with finding the smallest positive integer so that the edges…