Yasuaki Kobayashi

Available identifiers

zbMath Open kobayashi.yasuakiMaRDI QIDQ284332

List of research outcomes

Publication	Date of Publication	Type
Reconfiguration of time-respecting arborescences	2024-01-16	Paper
https://portal.mardi4nfdi.de/entity/Q6089668	2023-11-13	Paper
Polynomial-delay and polynomial-space enumeration of large maximal matchings	2023-05-05	Paper
On structural parameterizations of Node Kayles	2023-03-31	Paper
Reconfiguring directed trees in a digraph	2023-03-30	Paper
Exploring the gap between treedepth and vertex cover through vertex integrity	2023-03-22	Paper
https://portal.mardi4nfdi.de/entity/Q5875545	2023-02-03	Paper
https://portal.mardi4nfdi.de/entity/Q5875594	2023-02-03	Paper
Reconfiguring (non-spanning) arborescences	2023-01-05	Paper
Parameterized Complexity of $$(A,\ell )$$-Path Packing	2022-10-13	Paper
Parameterized complexity of graph burning	2022-08-03	Paper
https://portal.mardi4nfdi.de/entity/Q5089231	2022-07-18	Paper
Reconfiguration of regular induced subgraphs	2022-07-13	Paper
Exploring the gap between treedepth and vertex cover through vertex integrity	2022-05-10	Paper
An improved deterministic parameterized algorithm for cactus vertex deletion	2022-05-09	Paper
Parameterized complexity of \((A,\ell)\)-path packing	2022-03-22	Paper
An optimal algorithm for bisection for bounded-treewidth graph	2021-07-08	Paper
https://portal.mardi4nfdi.de/entity/Q4999304	2021-07-06	Paper
A (probably) optimal algorithm for \textsc{bisection} on bounded-treewidth graphs	2021-06-22	Paper
Computing the largest bond and the maximum connected cut of a graph	2021-04-19	Paper
Finding a maximum minimal separator: graph classes and fixed-parameter tractability	2021-04-08	Paper
Subgraph isomorphism on graph classes that exclude a substructure	2020-11-11	Paper
https://portal.mardi4nfdi.de/entity/Q5111885	2020-05-27	Paper
Algorithms and hardness results for the maximum balanced connected subgraph problem	2020-05-13	Paper
On Structural Parameterizations of Node Kayles	2020-03-26	Paper
An improved fixed-parameter algorithm for max-cut parameterized by crossing number	2020-02-25	Paper
https://portal.mardi4nfdi.de/entity/Q4634401	2018-04-10	Paper
Improved methods for computing distances between unordered trees using integer programming	2018-03-26	Paper
Mathematical model for calcium-assisted epidermal homeostasis	2016-09-01	Paper
Computing directed pathwidth in \(O(1.89^n)\) time	2016-06-28	Paper
A faster fixed parameter algorithm for two-layer crossing minimization	2016-05-18	Paper
On the Pathwidth of Almost Semicomplete Digraphs	2015-11-19	Paper
A fast and simple subexponential fixed parameter algorithm for one-sided crossing minimization	2015-09-02	Paper
Computing the pathwidth of directed graphs with small vertex cover	2014-12-09	Paper
A linear edge kernel for two-layer crossing minimization	2014-10-06	Paper
A Linear Edge Kernel for Two-Layer Crossing Minimization	2013-06-11	Paper
Computing Directed Pathwidth in O(1.89 n ) Time	2013-01-07	Paper
A Fast and Simple Subexponential Fixed Parameter Algorithm for One-Sided Crossing Minimization	2012-09-25	Paper
k-cyclic Orientations of Graphs	2010-12-09	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Yasuaki Kobayashi