Toshiki Saitoh
Orcid: 0000-0003-4676-5167
According to our database1,
Toshiki Saitoh
authored at least 48 papers
between 2010 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
2010
2012
2014
2016
2018
2020
2022
2024
0
1
2
3
4
5
6
7
2
2
1
3
3
2
4
2
2
3
4
1
2
2
1
1
3
2
1
2
1
1
2
1
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on zbmath.org
-
on orcid.org
On csauthors.net:
Bibliography
2024
Theor. Comput. Sci., 2024
Efficient non-isomorphic graph enumeration algorithms for several intersection graph classes.
Theor. Comput. Sci., 2024
2023
Theor. Comput. Sci., November, 2023
Proceedings of the WALCOM: Algorithms and Computation, 2023
Efficient Non-isomorphic Graph Enumeration Algorithms for Subclasses of Perfect Graphs.
Proceedings of the WALCOM: Algorithms and Computation, 2023
2021
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2021
Proceedings of the WALCOM: Algorithms and Computation, 2021
2020
Theor. Comput. Sci., 2020
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2020
Fixed-Treewidth-Efficient Algorithms for Edge-Deletion to Intersection Graph Classes.
CoRR, 2020
2019
Preface for the Special Issue on the Project "Foundation of Innovative Algorithms for Big Data".
Rev. Socionetwork Strateg., 2019
The Time Complexity of Permutation Routing via Matching, Token Swapping and a Variant.
J. Graph Algorithms Appl., 2019
Colorful Frontier-Based Search: Implicit Enumeration of Chordal and Interval Subgraphs.
Proceedings of the Analysis of Experimental Algorithms - Special Event, 2019
2018
Enumerating All Subgraphs without Forbidden Induced Subgraphs via Multivalued Decision Diagrams.
CoRR, 2018
Proceedings of the WALCOM: Algorithms and Computation - 12th International Conference, 2018
Proceedings of the Combinatorial Algorithms - 29th International Workshop, 2018
Proceedings of the Frontiers in Algorithmics - 12th International Workshop, 2018
2017
Fast maximum weight clique extraction algorithm: Optimal tables for branch-and-bound.
Discret. Appl. Math., 2017
Algorithmica, 2017
Space-Efficient and Output-Sensitive Implementations of Greedy Algorithms on Intervals.
Proceedings of the WALCOM: Algorithms and Computation, 2017
Proceedings of the WALCOM: Algorithms and Computation, 2017
2016
Proceedings of the 15th IEEE/ACIS International Conference on Computer and Information Science, 2016
2015
Theor. Comput. Sci., 2015
Proceedings of the Algorithms and Data Structures - 14th International Symposium, 2015
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.
Discret. Appl. Math., 2014
Proceedings of the Theory and Applications of Models of Computation, 2014
2013
IEICE Trans. Inf. Syst., 2013
CoRR, 2013
2012
J. Discrete Algorithms, 2012
Discret. Math. Algorithms Appl., 2012
Algorithms, 2012
Efficient Enumeration of the Directed Binary Perfect Phylogenies from Incomplete Data.
Proceedings of the Experimental Algorithms - 11th International Symposium, 2012
2011
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2011
Proceedings of the Combinatorial Optimization and Applications, 2011
2010
IEICE Trans. Inf. Syst., 2010
Proceedings of the WALCOM: Algorithms and Computation, 4th International Workshop, 2010