8 citations · 36 across the 49 of their papers we have counts for
7 papers · 1 filter
An Improved Deterministic Parameterized Algorithm for Cactus Vertex Deletion
Yuuki Aoike, Tatsuya Gima, Tesshu Hanaka +5
A cactus is a connected graph that does not contain as a minor. Given a graph and integer , Cactus Vertex Deletion (also known as Diamond Hitting Se…
Longest Common Subsequence in Sublinear Space
Masashi Kiyomi, Takashi Horiyama, Yota Otachi
We present the first -space polynomial-time algorithm for computing the length of a longest common subsequence. Given two strings of length , the algorithm runs i…
Finding Diverse Trees, Paths, and More
Tesshu Hanaka, Yasuaki Kobayashi, Kazuhiro Kurita +1
Mathematical modeling is a standard approach to solve many real-world problems and {\em diversity} of solutions is an important issue, emerging in applying solutions obtained from…
Parameterized Complexity of -Path Packing
Rémy Belmonte, Tesshu Hanaka, Masaaki Kanzaki +6
Given a graph , , and integers and , the \textsc{-Path Packing} problem asks to find vertex-disjoint paths of length that h…
Grundy Distinguishes Treewidth from Pathwidth
Rémy Belmonte, Eun Jung Kim, Michael Lampis +2
Structural graph parameters, such as treewidth, pathwidth, and clique-width, are a central topic of study in parameterized complexity. A main aim of research in this area is to und…
Parameterized Complexity of Graph Burning
Yasuaki Kobayashi, Yota Otachi
Graph Burning asks, given a graph and an integer , whether there exists such that every vertex in has distance at most from…
Hedonic Seat Arrangement Problems
Hans L. Bodlaender, Tesshu Hanaka, Lars Jaffke +3
In this paper, we study a variant of hedonic games, called \textsc{Seat Arrangement}. The model is defined by a bijection from agents with preferences for each other to vertices in…