Kunihiro Wasa

Proceedings of the 48th International Symposium on Mathematical Foundations of Computer Science, 2023

Reconfiguration and Enumeration of Optimal Cyclic Ladder Lotteries.

[BibT_eX]

[DOI]

Yuta Nozaki

Katsuhisa Yamanaka

Proceedings of the Combinatorial Algorithms - 34th International Workshop, 2023

2022

Constant amortized time enumeration of Eulerian trails.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2022

An Approximation Algorithm for K-best Enumeration of Minimal Connected Edge Dominating Sets with Cardinality Constraints.

[BibT_eX]

[DOI]

CoRR, 2022

Polynomial-Delay and Polynomial-Space Enumeration of Large Maximal Matchings.

[BibT_eX]

[DOI]

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

Reconfiguration of Regular Induced Subgraphs.

[BibT_eX]

[DOI]

Proceedings of the WALCOM: Algorithms and Computation, 2022

Reconfiguration of Spanning Trees with Degree Constraint or Diameter Constraint.

[BibT_eX]

[DOI]

Proceedings of the 39th International Symposium on Theoretical Aspects of Computer Science, 2022

Linear-Delay Enumeration for Minimal Steiner Problems.

[BibT_eX]

[DOI]

Proceedings of the PODS '22: International Conference on Management of Data, Philadelphia, PA, USA, June 12, 2022

Independent Set Reconfiguration on Directed Graphs.

[BibT_eX]

[DOI]

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

2021

Optimal reconfiguration of optimal ladder lotteries.

[BibT_eX]

[DOI]

Katsuhisa Yamanaka

Takashi Horiyama

Theor. Comput. Sci., 2021

A constant amortized time enumeration algorithm for independent sets in graphs with bounded clique number.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2021

Max-Min 3-Dispersion Problems.

[BibT_eX]

[DOI]

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

Efficient enumeration of dominating sets for sparse graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2021

Maximal strongly connected cliques in directed graphs: Algorithms and bounds.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2021

Polynomial-Delay Enumeration of Large Maximal Matchings.

[BibT_eX]

[DOI]

CoRR, 2021

Reconfiguring Directed Trees in a Digraph.

[BibT_eX]

[DOI]

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

2020

Efficient enumeration of maximal <i>k</i>-degenerate induced subgraphs of a chordal graph.

[BibT_eX]

[DOI]

Yota Otachi

Theor. Comput. Sci., 2020

Diameter of colorings under Kempe changes.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

CompRet: a comprehensive recommendation framework for chemical synthesis planning with algorithmic enumeration.

[BibT_eX]

[DOI]

J. Cheminformatics, 2020

Polynomial Delay Enumeration for Minimal Steiner Problems.

[BibT_eX]

[DOI]

CoRR, 2020

Efficient Constant-Factor Approximate Enumeration of Minimal Subsets for Monotone Properties with Cardinality Constraints.

[BibT_eX]

[DOI]

CoRR, 2020

Shortest Reconfiguration of Colorings Under Kempe Changes.

[BibT_eX]

[DOI]

Proceedings of the 37th International Symposium on Theoretical Aspects of Computer Science, 2020

Reconfiguration of Spanning Trees with Many or Few Leaves.

[BibT_eX]

[DOI]

Proceedings of the 28th Annual European Symposium on Algorithms, 2020

Finding the Anticover of a String.

[BibT_eX]

[DOI]

Proceedings of the 31st Annual Symposium on Combinatorial Pattern Matching, 2020

2019

The Complexity of Induced Tree Reconfiguration Problems.

[BibT_eX]

[DOI]

Katsuhisa Yamanaka

Hiroki Arimura

IEICE Trans. Inf. Syst., 2019

Constant Amortized Time Enumeration of Independent Sets for Graphs with Forbidden Subgraphs on Fixed Number of Vertices.

[BibT_eX]

[DOI]

CoRR, 2019

Listing Induced Steiner Subgraphs as a Compact Way to Discover Steiner Trees in Graphs.

[BibT_eX]

[DOI]

Roberto Grossi

Andrea Marino

Proceedings of the 44th International Symposium on Mathematical Foundations of Computer Science, 2019

The Perfect Matching Reconfiguration Problem.

[BibT_eX]

[DOI]

Proceedings of the 44th International Symposium on Mathematical Foundations of Computer Science, 2019

An Efficient Algorithm for Enumerating Chordal Bipartite Induced Subgraphs in Sparse Graphs.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 30th International Workshop, 2019

2018

Efficient Enumeration of Induced Matchings in a Graph without Cycles with Length Four.

[BibT_eX]

[DOI]

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

Efficient Enumeration of Subgraphs and Induced Subgraphs with Bounded Girth.

[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

Efficient Enumeration of Bipartite Subgraphs in Graphs.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 24th International Conference, 2018

An Efficient Algorithm for Enumerating Induced Subgraphs with Bounded Degeneracy.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2018

Ladder-Lottery Realization.

[BibT_eX]

[DOI]

Proceedings of the 30th Canadian Conference on Computational Geometry, 2018

2017

On Maximal Cliques with Connectivity Constraints in Directed Graphs.

[BibT_eX]

[DOI]

Proceedings of the 28th International Symposium on Algorithms and Computation, 2017

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

[BibT_eX]

[DOI]

Yota Otachi

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

Listing Acyclic Subgraphs and Subgraphs of Bounded Girth in Directed Graphs.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2017

2016

Enumeration of Enumeration Algorithms.

[BibT_eX]

[DOI]

CoRR, 2016

2014

Constant Time Enumeration of Subtrees with Exactly <i>k</i> Nodes in a Tree.

[BibT_eX]

[DOI]

IEICE Trans. Inf. Syst., 2014

Efficient Enumeration of Induced Subtrees in a K-Degenerate Graph.

[BibT_eX]

[DOI]

Hiroki Arimura