From the 1 of 5 linked papers with an AI index.
5 papers
Branch-width of represented matroids in matrix multiplication time
Mujin Choi, Tuukka Korhonen, Sang-il Oum
The paper presents an algorithm that computes a branch-decomposition of a matroid given by a matrix representation in time essentially O(n^ω), improving on previous cubic-time meth…
Tree-independence number of -free graph classes
Kenny Bešter Štorgel, Mujin Choi, Hidde Koerts +1
In this paper, we investigate the tree-independence number of graph classes that do not contain as an induced subgraph. Dallard et al. conjectured that for any positive i…
Odd-Cycle-Packing-treewidth: On the Maximum Independent Set problem in odd-minor-free graph classes
Mujin Choi, Maximilian Gorsky, Gunwoo Kim +2
We introduce the tree-decomposition-based graph parameter Odd-Cycle-Packing-treewidth (OCP-tw) as a width parameter that asks to decompose a given graph into pieces of bounded odd…
Excluding a Ladder as an Induced Minor in Graphs Without Induced Stars
Mujin Choi, Sebastian Wiederrecht
A -ladder is the graph obtained from two disjoint paths, each with vertices, by joining the th vertices of both paths with an edge for each . In this…
Excluding an induced wheel minor in graphs without large induced stars
Mujin Choi, Claire Hilaire, Martin MilaniÄ +1
We study a conjecture due to Dallard, Krnc, Kwon, MilaniÄ, Munaro, Å torgel, and Wiederrecht stating that for any positive integer and any planar graph , the class of all $…