The following pages link to Yasuaki Kobayashi (Q284332):
Displayed 40 items.
- A faster fixed parameter algorithm for two-layer crossing minimization (Q284334) (← links)
- Computing directed pathwidth in \(O(1.89^n)\) time (Q300464) (← links)
- Mathematical model for calcium-assisted epidermal homeostasis (Q306855) (← links)
- Computing the pathwidth of directed graphs with small vertex cover (Q477674) (← links)
- A fast and simple subexponential fixed parameter algorithm for one-sided crossing minimization (Q494803) (← links)
- A linear edge kernel for two-layer crossing minimization (Q744090) (← links)
- Improved methods for computing distances between unordered trees using integer programming (Q1708596) (← links)
- A (probably) optimal algorithm for \textsc{bisection} on bounded-treewidth graphs (Q2034399) (← links)
- An optimal algorithm for bisection for bounded-treewidth graph (Q2037961) (← links)
- Parameterized complexity of \((A,\ell)\)-path packing (Q2118381) (← links)
- An improved deterministic parameterized algorithm for cactus vertex deletion (Q2135634) (← links)
- Reconfiguration of regular induced subgraphs (Q2154077) (← links)
- Parameterized complexity of graph burning (Q2161013) (← links)
- Algorithms and hardness results for the maximum balanced connected subgraph problem (Q2180163) (← links)
- An improved fixed-parameter algorithm for max-cut parameterized by crossing number (Q2301753) (← links)
- Finding a maximum minimal separator: graph classes and fixed-parameter tractability (Q2661784) (← links)
- Computing the largest bond and the maximum connected cut of a graph (Q2663713) (← links)
- Reconfiguring (non-spanning) arborescences (Q2680989) (← links)
- Reconfiguring directed trees in a digraph (Q2695298) (← links)
- On structural parameterizations of Node Kayles (Q2695476) (← links)
- A Fast and Simple Subexponential Fixed Parameter Algorithm for One-Sided Crossing Minimization (Q2912885) (← links)
- k-cyclic Orientations of Graphs (Q3060762) (← links)
- On the Pathwidth of Almost Semicomplete Digraphs (Q3452843) (← links)
- (Q4634401) (← links)
- Computing Directed Pathwidth in O(1.89 n ) Time (Q4899252) (← links)
- A Linear Edge Kernel for Two-Layer Crossing Minimization (Q4925262) (← links)
- (Q4999304) (← links)
- Parameterized Complexity of $$(A,\ell )$$-Path Packing (Q5041178) (← links)
- (Q5089231) (← links)
- (Q5111885) (← links)
- (Q5875545) (← links)
- (Q5875594) (← links)
- Exploring the gap between treedepth and vertex cover through vertex integrity (Q5918674) (← links)
- Subgraph isomorphism on graph classes that exclude a substructure (Q5919029) (← links)
- Exploring the gap between treedepth and vertex cover through vertex integrity (Q5925679) (← links)
- Polynomial-delay and polynomial-space enumeration of large maximal matchings (Q6039434) (← links)
- (Q6089668) (← links)
- Reconfiguration of time-respecting arborescences (Q6179438) (← links)
- On Structural Parameterizations of Node Kayles (Q6337445) (← links)
- Independent set reconfiguration on directed graphs (Q6394663) (← links)