Yota Otachi

From MaRDI portal
Person:284349

Available identifiers

zbMath Open otachi.yotaWikidataQ60574244 ScholiaQ60574244MaRDI QIDQ284349

List of research outcomes

PublicationDate of PublicationType
Grouped domination parameterized by vertex cover, twin cover, and beyond2024-04-04Paper
Extended MSO model checking via small vertex integrity2024-01-09Paper
Computational complexity of jumping block puzzles2024-01-05Paper
Parameterized Complexity of Graph Burning2023-11-13Paper
Sorting balls and water: equivalence and computational complexity2023-10-12Paper
Grouped domination parameterized by vertex cover, twin cover, and beyond2023-10-04Paper
Sequentially swapping tokens: further on graph classes2023-08-14Paper
Reconfiguration of cliques in a graph2023-04-27Paper
Reconfiguring directed trees in a digraph2023-03-30Paper
Computational complexity of jumping block puzzles2023-03-30Paper
Exploring the gap between treedepth and vertex cover through vertex integrity2023-03-22Paper
https://portal.mardi4nfdi.de/entity/Q58744802023-02-07Paper
Reconfiguring (non-spanning) arborescences2023-01-05Paper
Linear-time recognition of double-threshold graphs2022-12-21Paper
A Survey on Spanning Tree Congestion2022-10-19Paper
Parameterized Complexity of $$(A,\ell )$$-Path Packing2022-10-13Paper
Grundy Distinguishes Treewidth from Pathwidth2022-08-18Paper
Parameterized complexity of graph burning2022-08-03Paper
https://portal.mardi4nfdi.de/entity/Q50904592022-07-18Paper
Reconfiguration of regular induced subgraphs2022-07-13Paper
Exploring the gap between treedepth and vertex cover through vertex integrity2022-05-10Paper
An improved deterministic parameterized algorithm for cactus vertex deletion2022-05-09Paper
Independent set reconfiguration on directed graphs2022-03-24Paper
Linear-time recognition of double-threshold graphs2022-03-22Paper
Parameterized complexity of \((A,\ell)\)-path packing2022-03-22Paper
Low-congestion shortcut and graph parameters2021-11-08Paper
On the security number of the Cartesian product of graphs2021-09-30Paper
Token sliding on split graphs2021-08-05Paper
Alliances in graphs of bounded clique-width2021-06-07Paper
Longest common subsequence in sublinear space2021-03-11Paper
Vertex Deletion Problems on Chordal Graphs2020-11-25Paper
Subgraph isomorphism on graph classes that exclude a substructure2020-11-11Paper
Symmetric assembly puzzles are hard, beyond a few pieces2020-10-23Paper
Parameterized Complexity of Safe Set2020-09-04Paper
Independent set reconfiguration parameterized by modular-width2020-09-03Paper
https://portal.mardi4nfdi.de/entity/Q51164882020-08-25Paper
Reconfiguration of Colorable Sets in Classes of Perfect Graphs2020-08-25Paper
https://portal.mardi4nfdi.de/entity/Q33057232020-08-11Paper
Space-Efficient Algorithms for Longest Increasing Subsequence2020-08-05Paper
Exact algorithms for the max-min dispersion problem2020-07-07Paper
Parameterized orientable deletion2020-05-21Paper
Space-efficient algorithms for longest increasing subsequence2020-04-15Paper
Efficient enumeration of maximal \(k\)-degenerate induced subgraphs of a chordal graph2020-04-07Paper
Independent set reconfiguration parameterized by modular-width2020-02-24Paper
Subgraph isomorphism on graph classes that exclude a substructure2020-02-06Paper
Parameterized complexity of safe set2020-02-06Paper
A lower bound on opaque sets2019-10-18Paper
Linear-Time Recognition of Double-Threshold Graphs2019-09-20Paper
On structural parameterizations of firefighting2019-06-06Paper
Reconfiguration of colorable sets in classes of perfect graphs2019-05-17Paper
On the classes of interval graphs of limited nesting and count of lengths2019-04-25Paper
How Bad is the Freedom to Flood-It?2019-02-14Paper
Safe sets in graphs: graph classes and structural parameters2018-12-06Paper
Vertex deletion problems on chordal graphs2018-09-24Paper
Computational complexity of robot arm simulation problems2018-09-06Paper
Degree-constrained orientation of maximum satisfaction: graph classes and parameterized complexity2018-07-25Paper
On structural parameterizations of firefighting2018-06-05Paper
Swapping colored tokens on graphs2018-05-17Paper
Degree-constrained orientation of maximum satisfaction: Graph classes and parameterized complexity2018-04-19Paper
On the Classes of Interval Graphs of Limited Nesting and Count of Lengths2018-04-19Paper
A faster parameterized algorithm for pseudoforest deletion2018-04-10Paper
Induced minor free graphs: isomorphism and clique-width2018-02-28Paper
A Lower Bound on Opaque Sets2018-01-30Paper
A faster parameterized algorithm for pseudoforest deletion2018-01-11Paper
Efficient enumeration of maximal \(k\)-degenerate subgraphs in a chordal graph2017-10-23Paper
Extending partial representations of interval graphs2017-10-09Paper
Extending partial representations of proper and unit interval graphs2017-05-02Paper
Symmetric Assembly Puzzles are Hard, Beyond a Few Pieces2017-02-01Paper
Safe Sets in Graphs: Graph Classes and Structural Parameters2017-02-01Paper
Ferrers dimension of grid intersection graphs2016-11-24Paper
Thin strip graphs2016-11-24Paper
Induced minor free graphs: isomorphism and clique-width2016-10-21Paper
Finding a chain graph in a bipartite permutation graph2016-05-18Paper
A polynomial-time approximation scheme for the geometric unique coverage problem on unit squares2016-01-18Paper
Sliding Token on Bipartite Permutation Graphs2016-01-11Paper
Polynomial-time algorithms for subgraph isomorphism in small graph classes of perfect graphs2015-12-10Paper
On the treewidth of toroidal grids2015-12-07Paper
Competitive Diffusion on Weighted Graphs2015-10-30Paper
Swapping Colored Tokens on Graphs2015-10-30Paper
Reconfiguration of Cliques in a Graph2015-09-30Paper
Linear-time algorithm for sliding tokens on trees2015-09-16Paper
Polynomial-Time Algorithm for Sliding Tokens on Trees2015-09-11Paper
Depth-First Search Using $$O(n)$$ Bits2015-09-11Paper
Completely independent spanning trees in (partial) \(k\)-trees2015-08-04Paper
Extending partial representations of subclasses of chordal graphs2015-05-18Paper
Base-object location problems for base-monotone regions2014-10-06Paper
Efficient algorithms for network localization using cores of underlying graphs2014-09-18Paper
Lower bounds for treewidth of product graphs2014-09-12Paper
Extending partial representations of proper and unit interval graphs2014-09-02Paper
Reduction Techniques for Graph Isomorphism in the Context of Width Parameters2014-09-02Paper
A 4.31-approximation for the geometric unique coverage problem on unit disks2014-07-07Paper
Polynomial-Time Algorithms for Subgraph Isomorphism in Small Graph Classes of Perfect Graphs2014-04-16Paper
Intersection Dimension of Bipartite Graphs2014-04-16Paper
Approximating the path-distance-width for AT-free graphs and graphs in related classes2014-04-02Paper
https://portal.mardi4nfdi.de/entity/Q54030232014-03-25Paper
Isomorphism on Subgraph-Closed Graph Classes: A Complexity Dichotomy and Intermediate Graph Classes2014-01-14Paper
Bounded Representations of Interval and Proper Interval Graphs2014-01-14Paper
On Complexity of Flooding Games on Graphs with Interval Representations2013-12-06Paper
Hardness Results and an Exact Exponential Algorithm for the Spanning Tree Congestion Problem2013-11-28Paper
The path-distance-width of hypercubes2013-11-11Paper
Base Location Problems for Base-Monotone Regions2013-04-12Paper
A 4.31-Approximation for the Geometric Unique Coverage Problem on Unit Disks2013-03-21Paper
Extending Partial Representations of Subclasses of Chordal Graphs2013-03-21Paper
Isomorphism for Graphs of Bounded Connected-Path-Distance-Width2013-03-21Paper
Parameterized complexity of the spanning tree congestion problem2012-11-21Paper
Subgraph isomorphism in graph classes2012-10-16Paper
Spanning tree congestion of rook's graphs2012-09-05Paper
Designing Low-Congestion Networks with Structural Graph Theory2012-09-05Paper
A Polynomial-Time Approximation Scheme for the Geometric Unique Coverage Problem on Unit Squares2012-08-14Paper
Efficient enumeration of ordered trees with \(k\) leaves2012-08-08Paper
Random generation and enumeration of bipartite permutation graphs2012-05-11Paper
Approximability of the Path-Distance-Width for AT-free Graphs2011-12-16Paper
Hardness Results and an Exact Exponential Algorithm for the Spanning Tree Congestion Problem2011-07-01Paper
Extending partial representations of interval graphs2011-07-01Paper
Spanning tree congestion of \(k\)-outerplanar graphs2011-05-16Paper
Bandwidth and pathwidth of three-dimensional grids2011-05-10Paper
Complexity Results for the Spanning Tree Congestion Problem2010-11-16Paper
The carving-width of generalized hypercubes2010-10-19Paper
Security number of grid-like graphs2010-04-28Paper
Random Generation and Enumeration of Bipartite Permutation Graphs2009-12-17Paper
On spanning tree congestion of graphs2009-12-10Paper
An improved algorithm for the longest induced path problem on \(k\)-chordal graphs2009-03-09Paper
Efficient Enumeration of Ordered Trees with k Leaves (Extended Abstract)2009-02-24Paper
A lower bound for the vertex boundary-width of complete \(k\)-ary trees2008-05-13Paper
Relationships between the class of unit grid intersection graphs and other classes of bipartite graphs2007-10-29Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Yota Otachi