Toshiki Saitoh

Proceedings of the WALCOM: Algorithms and Computation, 2023

Efficient Non-isomorphic Graph Enumeration Algorithms for Subclasses of Perfect Graphs.

[BibT_eX]

[DOI]

Proceedings of the WALCOM: Algorithms and Computation, 2023

2021

Max-Min 3-Dispersion Problems.

[BibT_eX]

[DOI]

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

Fixed-Treewidth-Efficient Algorithms for Edge-Deletion to Interval Graph Classes.

[BibT_eX]

[DOI]

Hans L. Bodlaender

Proceedings of the WALCOM: Algorithms and Computation, 2021

2020

Enumeration of nonisomorphic interval graphs and nonisomorphic permutation graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

Complexity of the Maximum <i>k</i>-Path Vertex Cover Problem.

[BibT_eX]

[DOI]

Tom C. van der Zanden

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

Fixed-Treewidth-Efficient Algorithms for Edge-Deletion to Intersection Graph Classes.

[BibT_eX]

[DOI]

Hans L. Bodlaender

CoRR, 2020

2019

Preface for the Special Issue on the Project "Foundation of Innovative Algorithms for Big Data".

[BibT_eX]

[DOI]

Rev. Socionetwork Strateg., 2019

Sequentially Swapping Colored Tokens on Graphs.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2019

The Time Complexity of Permutation Routing via Matching, Token Swapping and a Variant.

[BibT_eX]

[DOI]

Jun Kawahara

J. Graph Algorithms Appl., 2019

Colorful Frontier-Based Search: Implicit Enumeration of Chordal and Interval Subgraphs.

[BibT_eX]

[DOI]

Proceedings of the Analysis of Experimental Algorithms - Special Event, 2019

2018

Swapping colored tokens on graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2018

Enumerating All Subgraphs without Forbidden Induced Subgraphs via Multivalued Decision Diagrams.

[BibT_eX]

[DOI]

CoRR, 2018

Complexity of the Maximum k-Path Vertex Cover Problem.

[BibT_eX]

[DOI]

Tom C. van der Zanden

Proceedings of the WALCOM: Algorithms and Computation - 12th International Conference, 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

Fast maximum weight clique extraction algorithm: Optimal tables for branch-and-bound.

[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

Space-Efficient and Output-Sensitive Implementations of Greedy Algorithms on Intervals.

[BibT_eX]

[DOI]

David G. Kirkpatrick

Proceedings of the WALCOM: Algorithms and Computation, 2017

The Time Complexity of the Token Swapping Problem and Its Parallel Variants.

[BibT_eX]

[DOI]

Jun Kawahara

Proceedings of the WALCOM: Algorithms and Computation, 2017

2016

A fast heuristic for the minimum weight vertex cover problem.

[BibT_eX]

[DOI]

Proceedings of the 15th IEEE/ACIS International Conference on Computer and Information Science, 2016

2015

Swapping labeled tokens on graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

Extending partial representations of subclasses of chordal graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 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

2014

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

[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

2013

The complexity of the stamp folding problem.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

Reconstruction Algorithms for Permutation Graphs and Distance-Hereditary Graphs.

[BibT_eX]

[DOI]

IEICE Trans. Inf. Syst., 2013

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

[BibT_eX]

[DOI]

CoRR, 2013

2012

Random generation and enumeration of bipartite permutation graphs.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2012

Bipartite Permutation Graphs are reconstructible.

[BibT_eX]

[DOI]

Discret. Math. Algorithms Appl., 2012

Subgraph isomorphism in graph classes.

[BibT_eX]

[DOI]

Discret. Math., 2012

Finding All Solutions and Instances of Numberlink and Slitherlink by ZDDs.

[BibT_eX]

[DOI]

Algorithms, 2012

Efficient Enumeration of the Directed Binary Perfect Phylogenies from Incomplete Data.

[BibT_eX]

[DOI]

Yoshio Okamoto

Proceedings of the Experimental Algorithms - 11th International Symposium, 2012

2011

Voronoi Game on a Path.

[BibT_eX]

[DOI]

IEICE Trans. Inf. Syst., 2011

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

[BibT_eX]

[DOI]

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

Complexity of the Stamp Folding Problem.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2011

2010

Reconstruction of interval graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2010

Random Generation and Enumeration of Proper Interval Graphs.

[BibT_eX]

[DOI]

IEICE Trans. Inf. Syst., 2010

Reconstruction Algorithm for Permutation Graphs.

[BibT_eX]

[DOI]