8 citations · 36 across the 49 of their papers we have counts for
4 papers · 1 filter
Computing diverse pair of solutions for tractable SAT
Tatsuya Gima, Yuni Iwamasa, Yasuaki Kobayashi +3
In many decision-making processes, one may prefer multiple solutions to a single solution, which allows us to choose an appropriate solution from the set of promising solutions tha…
Parameterized Spanning Tree Congestion
Michael Lampis, Valia Mitsou, Edouard Nemery +3
In this paper we study the Spanning Tree Congestion problem, where we are given a graph and are asked to find a spanning tree of minimum maximum congestion. Here, the…
Finding Induced Subgraphs from Graphs with Small Mim-Width
Yota Otachi, Akira Suzuki, Yuma Tamura
In the last decade, algorithmic frameworks based on a structural graph parameter called mim-width have been developed to solve generally NP-hard problems. However, it is known that…
An improved spectral lower bound of treewidth
Tatsuya Gima, Tesshu Hanaka, Kohei Noro +2
We show that for every -vertex graph with at least one edge, its treewidth is greater than or equal to , where and are the maximum degree a…