Tatsuya Gima

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
An improved spectral lower bound of treewidth (available as arXiv preprint)	N/A	Paper
Structural parameterizations of \(k\)-planarity Journal of Graph Algorithms and Applications	2026-09-25	Paper
Hitting geodesic intervals in structurally restricted graphs	2026-09-23	Paper
Structural parameterizations of k-planarity	2026-09-21	Paper
Courcelle's theorem for Lipschitz continuity	2026-08-31	Paper
Broadcasting under structural restrictions	2026-08-05	Paper
Bandwidth parameterized by cluster vertex deletion number	2025-09-24	Paper
On the complexity of list \(\mathcal{H}\)-packing for sparse graph classes Theoretical Computer Science	2025-09-16	Paper
Bandwidth parameterized by cluster vertex deletion number Algorithmica	2025-08-29	Paper
Algorithmic meta-theorems for combinatorial reconfiguration revisited	2025-06-19	Paper
Orientable burning number of graphs Discrete Applied Mathematics	2025-03-18	Paper
An improved spectral lower bound of treewidth Information Processing Letters	2025-01-14	Paper
Dichotomies for tree minor containment with structural parameters Theoretical Computer Science	2025-01-08	Paper
Structural parameterizations of vertex integrity Theoretical Computer Science	2024-12-12	Paper
Algorithmic meta-theorems for combinatorial reconfiguration revisited Algorithmica	2024-10-24	Paper
Extended MSO model checking via small vertex integrity	2024-09-11	Paper
Orientable burning number of graphs	2024-07-19	Paper
Dichotomies for tree minor containment with structural parameters	2024-07-19	Paper
Structural parameterizations of vertex integrity (best paper)	2024-07-19	Paper
On the complexity of list \(\mathcal{H}\)-packing for sparse graph classes	2024-07-19	Paper
Extended MSO model checking via small vertex integrity Algorithmica	2024-01-09	Paper
Exploring the gap between treedepth and vertex cover through vertex integrity Lecture Notes in Computer Science	2023-03-22	Paper
Exploring the gap between treedepth and vertex cover through vertex integrity Theoretical Computer Science	2022-05-10	Paper
An improved deterministic parameterized algorithm for cactus vertex deletion Theory of Computing Systems	2022-05-09	Paper

Research outcomes over time

This page was built for person: Tatsuya Gima