Yota Otachi

Nicolás Honorato Droguett

Algorithmica, January, 2024

Grouped domination parameterized by vertex cover, twin cover, and beyond.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2024

Collecting Balls on a Line by Robots with Limited Energy.

[BibT_eX]

[DOI]

Tesshu Hanaka

Kazuhiro Kurita

IEICE Trans. Inf. Syst., 2024

On a Spectral Lower Bound of Treewidth.

[BibT_eX]

[DOI]

IEICE Trans. Inf. Syst., 2024

Finding a Reconfiguration Sequence between Longest Increasing Subsequences.

[BibT_eX]

[DOI]

IEICE Trans. Inf. Syst., 2024

Parameterized Spanning Tree Congestion.

[BibT_eX]

[DOI]

CoRR, 2024

Dichotomies for Tree Minor Containment with Structural Parameters.

[BibT_eX]

[DOI]

Proceedings of the WALCOM: Algorithms and Computation, 2024

On the Complexity of List H-Packing for Sparse Graph Classes.

[BibT_eX]

[DOI]

Proceedings of the WALCOM: Algorithms and Computation, 2024

Structural Parameterizations of Vertex Integrity.

[BibT_eX]

[DOI]

Proceedings of the WALCOM: Algorithms and Computation, 2024

Orientable Burning Number of Graphs.

[BibT_eX]

[DOI]

Proceedings of the WALCOM: Algorithms and Computation, 2024

Finding Induced Subgraphs from Graphs with Small Mim-Width.

[BibT_eX]

[DOI]

Akira Suzuki

Yuma Tamura

Proceedings of the 19th Scandinavian Symposium and Workshops on Algorithm Theory, 2024

2023

Sorting balls and water: Equivalence and computational complexity.

[BibT_eX]

[DOI]

Theor. Comput. Sci., November, 2023

Reconfiguration of cliques in a graph.

[BibT_eX]

[DOI]

Takehiro Ito

Discret. Appl. Math., July, 2023

Reconfiguring (non-spanning) arborescences.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2023

Minimum Consistent Subset for Trees Revisited.

[BibT_eX]

[DOI]

CoRR, 2023

Sequentially Swapping Tokens: Further on Graph Classes.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2023: Theory and Practice of Computer Science, 2023

A Framework to Design Approximation Algorithms for Finding Diverse Solutions in Combinatorial Problems.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022

Grundy Distinguishes Treewidth from Pathwidth.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., September, 2022

Exploring the gap between treedepth and vertex cover through vertex integrity.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2022

An Improved Deterministic Parameterized Algorithm for Cactus Vertex Deletion.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2022

Finding shortest non-separating and non-disconnecting paths.

[BibT_eX]

[DOI]

Yasuaki Kobayashi

Shunsuke Nagano

CoRR, 2022

Linear-Time Recognition of Double-Threshold Graphs.

[BibT_eX]

[DOI]

Algorithmica, 2022

Parameterized Complexity of Graph Burning.

[BibT_eX]

[DOI]

Yasuaki Kobayashi

Algorithmica, 2022

Parameterized Complexity of (A, ℓ )-Path Packing.

[BibT_eX]

[DOI]

Algorithmica, 2022

Reconfiguration of Regular Induced Subgraphs.

[BibT_eX]

[DOI]

Proceedings of the WALCOM: Algorithms and Computation, 2022

Independent Set Reconfiguration on Directed Graphs.

[BibT_eX]

[DOI]

Proceedings of the 47th International Symposium on Mathematical Foundations of Computer Science, 2022

Parameterized Complexity of Non-Separating and Non-Disconnecting Paths and Sets.

[BibT_eX]

[DOI]

Ankit Abhinav

Susobhan Bandopadhyay

Proceedings of the 47th International Symposium on Mathematical Foundations of Computer Science, 2022

Computing Diverse Shortest Paths Efficiently: A Theoretical and Experimental Study.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021

Token Sliding on Split Graphs.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2021

Longest common subsequence in sublinear space.

[BibT_eX]

[DOI]

Takashi Horiyama

Inf. Process. Lett., 2021

Low-congestion shortcut and graph parameters.

[BibT_eX]

[DOI]

Distributed Comput., 2021

On the security number of the Cartesian product of graphs.

[BibT_eX]

[DOI]

Marko Jakovac

Discret. Appl. Math., 2021

Distributed Reconfiguration of Spanning Trees.

[BibT_eX]

[DOI]

Yukiko Yamauchi

Naoyuki Kamiyama

Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2021

Computational Complexity of Jumping Block Puzzles.

[BibT_eX]

[DOI]

Masaaki Kanzaki

Ryuhei Uehara

Proceedings of the Computing and Combinatorics - 27th International Conference, 2021

Reconfiguring Directed Trees in a Digraph.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 27th International Conference, 2021

Finding Diverse Trees, Paths, and More.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020

Efficient enumeration of maximal k-degenerate induced subgraphs of a chordal graph.

[BibT_eX]

[DOI]

Alessio Conte

Mamadou Moustapha Kanté

Takeaki Uno

Kunihiro Wasa

Theor. Comput. Sci., 2020

Space-Efficient Algorithms for Longest Increasing Subsequence.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2020

K3 Edge Cover Problem in a Wide Sense.

[BibT_eX]

[DOI]

J. Inf. Process., 2020

Parameterized Complexity of Safe Set.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2020

Symmetric assembly puzzles are hard, beyond a few pieces.

[BibT_eX]

[DOI]

Erik D. Demaine

Matias Korman

Jason S. Ku

Joseph S. B. Mitchell

Comput. Geom., 2020

Parameterized Orientable Deletion.

[BibT_eX]

[DOI]

Algorithmica, 2020

Subgraph Isomorphism on Graph Classes that Exclude a Substructure.

[BibT_eX]

[DOI]

Tom C. van der Zanden

Algorithmica, 2020

Independent Set Reconfiguration Parameterized by Modular-Width.

[BibT_eX]

[DOI]

Algorithmica, 2020

Sublinear-Space Lexicographic Depth-First Search for Bounded Treewidth Graphs and Planar Graphs.

[BibT_eX]

[DOI]

Taisuke Izumi

Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

A Survey on Spanning Tree Congestion.

[BibT_eX]

[DOI]

Proceedings of the Treewidth, Kernels, and Algorithms, 2020

Hedonic Seat Arrangement Problems.

[BibT_eX]

[DOI]

Tom C. van der Zanden

Proceedings of the 19th International Conference on Autonomous Agents and Multiagent Systems, 2020

2019

Reconfiguration of colorable sets in classes of perfect graphs.

[BibT_eX]

[DOI]

Takehiro Ito

Mehdi Khosravian Ghadikolaei

Theor. Comput. Sci., 2019

On structural parameterizations of firefighting.

[BibT_eX]

[DOI]

Bireswar Das

Murali Krishna Enduri

Theor. Comput. Sci., 2019

How Bad is the Freedom to Flood-It?

[BibT_eX]

[DOI]

Rémy Belmonte

Michael Lampis

J. Graph Algorithms Appl., 2019

On Computational Complexity of Pipe Puzzles.

[BibT_eX]

[DOI]

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2019

A lower bound on opaque sets.

[BibT_eX]

[DOI]

Comput. Geom., 2019

On the Classes of Interval Graphs of Limited Nesting and Count of Lengths.

[BibT_eX]

[DOI]

Pavel Klavík

Jirí Sejnoha

Algorithmica, 2019

Subgraph Isomorphism on Graph Classes that Exclude a Substructure.

[BibT_eX]

[DOI]

Tom C. van der Zanden

Proceedings of the Algorithms and Complexity - 11th International Conference, 2019

2018

Swapping colored tokens on graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2018

Vertex deletion problems on chordal graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2018

Safe sets in graphs: Graph classes and structural parameters.

[BibT_eX]

[DOI]

J. Comb. Optim., 2018

A faster parameterized algorithm for Pseudoforest Deletion.

[BibT_eX]

[DOI]

Hans L. Bodlaender

Discret. Appl. Math., 2018

Degree-Constrained Orientation of Maximum Satisfaction: Graph Classes and Parameterized Complexity.

[BibT_eX]

[DOI]

Hans L. Bodlaender

Algorithmica, 2018

Induced Minor Free Graphs: Isomorphism and Clique-Width.

[BibT_eX]

[DOI]

Rémy Belmonte

Pascal Schweitzer

Algorithmica, 2018

Computational Complexity of Robot Arm Simulation Problems.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 29th International Workshop, 2018

Exact Algorithms for the Max-Min Dispersion Problem.

[BibT_eX]

[DOI]

Proceedings of the Frontiers in Algorithmics - 12th International Workshop, 2018

2017

Hitori Numbers.

[BibT_eX]

[DOI]

J. Inf. Process., 2017

Alliances in graphs of bounded clique-width.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2017

Thin strip graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2017

Ferrers dimension of grid intersection graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2017

Extending Partial Representations of Interval Graphs.

[BibT_eX]

[DOI]

Algorithmica, 2017

Extending Partial Representations of Proper and Unit Interval Graphs.

[BibT_eX]

[DOI]

Algorithmica, 2017

Efficient Enumeration of Maximal k-Degenerate Subgraphs in a Chordal Graph.

[BibT_eX]

[DOI]

Alessio Conte

Mamadou Moustapha Kanté

Takeaki Uno

Kunihiro Wasa

Proceedings of the Computing and Combinatorics - 23rd International Conference, 2017

2016

Finding a chain graph in a bipartite permutation graph.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2016

Polynomial-time algorithms for Subgraph Isomorphism in small graph classes of perfect graphs.

[BibT_eX]

[DOI]

Matsuo Konagaya

Ryuhei Uehara

Discret. Appl. Math., 2016

On the treewidth of toroidal grids.

[BibT_eX]

[DOI]

Yoshio Okamoto

Discret. Appl. Math., 2016

A polynomial-time approximation scheme for the geometric unique coverage problem on unit squares.

[BibT_eX]

[DOI]

Comput. Geom., 2016

Safe Sets in Graphs: Graph Classes and Structural Parameters.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2016

2015

Extending partial representations of subclasses of chordal graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

Linear-time algorithm for sliding tokens on trees.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

Secure Sets and Defensive Alliances in Graphs: A Faster Algorithm and Improved Bounds.

[BibT_eX]

[DOI]

IEICE Trans. Inf. Syst., 2015

Completely independent spanning trees in (partial) k-trees.

[BibT_eX]

[DOI]

Toru Araki

Masayoshi Matsushita

Discuss. Math. Graph Theory, 2015

Swapping Colored Tokens on Graphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures - 14th International Symposium, 2015

Competitive Diffusion on Weighted Graphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures - 14th International Symposium, 2015

Sliding Token on Bipartite Permutation Graphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation - 26th International Symposium, 2015

2014

Efficient algorithms for network localization using cores of underlying graphs.

[BibT_eX]

[DOI]

Meng Li

Takeshi Tokuyama

Theor. Comput. Sci., 2014

A 4.31-approximation for the geometric unique coverage problem on unit disks.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2014

Base-object location problems for base-monotone regions.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2014

Approximating the path-distance-width for AT-free graphs and graphs in related classes.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2014

Lower bounds for treewidth of product graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2014

Computational Complexity of Competitive Diffusion on (Un)weighted Graphs.

[BibT_eX]

[DOI]

CoRR, 2014

Intersection Dimension of Bipartite Graphs.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Models of Computation, 2014

Reduction Techniques for Graph Isomorphism in the Context of Width Parameters.

[BibT_eX]

[DOI]

Pascal Schweitzer

Proceedings of the Algorithm Theory - SWAT 2014, 2014

Polynomial-Time Algorithm for Sliding Tokens on Trees.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation - 25th International Symposium, 2014

Depth-First Search Using O(n) Bits.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation - 25th International Symposium, 2014

2013

The path-distance-width of hypercubes.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2013

Linear-time Algorithm for Partial Representation Extension of Interval Graphs.

[BibT_eX]

[DOI]

CoRR, 2013

Base Location Problems for Base-Monotone Regions.

[BibT_eX]

[DOI]

Proceedings of the WALCOM: Algorithms and Computation, 7th International Workshop, 2013

Isomorphism on Subgraph-Closed Graph Classes: A Complexity Dichotomy and Intermediate Graph Classes.

[BibT_eX]

[DOI]

Pascal Schweitzer

Proceedings of the Algorithms and Computation - 24th International Symposium, 2013

Bounded Representations of Interval and Proper Interval Graphs.

[BibT_eX]

[DOI]

Martin Balko

Pavel Klavík

Proceedings of the Algorithms and Computation - 24th International Symposium, 2013

2012

Efficient enumeration of ordered trees with k leaves.

[BibT_eX]

[DOI]

Katsuhisa Yamanaka

Shin-Ichi Nakano

Theor. Comput. Sci., 2012

Random generation and enumeration of bipartite permutation graphs.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2012

Enumerating All Rooted Trees Including k Leaves.

[BibT_eX]

[DOI]

IEICE Trans. Inf. Syst., 2012

On bipartite powers of bigraphs.

[BibT_eX]

[DOI]

Yoshio Okamoto

Ryuhei Uehara

Discret. Math. Theor. Comput. Sci., 2012

Subgraph isomorphism in graph classes.

[BibT_eX]

[DOI]

Discret. Math., 2012

Parameterized Complexity of the Spanning Tree Congestion Problem.

[BibT_eX]

[DOI]

Algorithmica, 2012

On Complexity of Flooding Games on Graphs with Interval Representations.

[BibT_eX]

[DOI]

Proceedings of the Computational Geometry and Graphs - Thailand-Japan Joint Conference, 2012

Isomorphism for Graphs of Bounded Connected-Path-Distance-Width.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation - 23rd International Symposium, 2012

2011

Hardness Results and an Exact Exponential Algorithm for the Spanning Tree Congestion Problem.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2011

Spanning tree congestion of rook's graphs.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2011

Bandwidth and pathwidth of three-dimensional grids.

[BibT_eX]

[DOI]

Ryohei Suda

Discret. Math., 2011

Spanning tree congestion of k-outerplanar graphs.

[BibT_eX]

[DOI]

Discret. Math., 2011

On spanning tree congestion of Hamming graphs

[BibT_eX]

[DOI]

CoRR, 2011

Approximability of the Path-Distance-Width for AT-free Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2011

2010

The carving-width of generalized hypercubes.

[BibT_eX]

[DOI]

Discret. Math., 2010

Complexity Results for the Spanning Tree Congestion Problem.

[BibT_eX]

[DOI]

Hans L. Bodlaender

Erik Jan van Leeuwen

Proceedings of the Graph Theoretic Concepts in Computer Science, 2010

2009

On spanning tree congestion of graphs.

[BibT_eX]

[DOI]

Discret. Math., 2009

Security number of grid-like graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2009

Efficient Enumeration of Ordered Trees with kLeaves (Extended Abstract).

[BibT_eX]

[DOI]

Katsuhisa Yamanaka

Shin-Ichi Nakano

Proceedings of the WALCOM: Algorithms and Computation, Third International Workshop, 2009

2008

A lower bound for the vertex boundary-width of complete k-ary trees.

[BibT_eX]

[DOI]

Discret. Math., 2008

An improved algorithm for the longest induced path problem on k-chordal graphs.

[BibT_eX]

[DOI]

Tetsuya Ishizeki

Discret. Appl. Math., 2008

2007

Relationships between the class of unit grid intersection graphs and other classes of bipartite graphs.

[BibT_eX]

[DOI]

Yoshio Okamoto