Toshiki Saitoh

From MaRDI portal
Person:344840

Available identifiers

zbMath Open saitoh.toshikiWikidataQ115940135 ScholiaQ115940135MaRDI QIDQ344840

List of research outcomes

PublicationDate of PublicationType
Overlapping edge unfoldings for Archimedean solids and (anti)prisms2023-11-24Paper
Efficient non-isomorphic graph enumeration algorithms for subclasses of perfect graphs2023-11-24Paper
Path cover problems with length cost2023-11-17Paper
Sorting balls and water: equivalence and computational complexity2023-10-12Paper
Path cover problems with length cost2022-07-13Paper
Fixed-treewidth-efficient algorithms for edge-deletion to interval graph classes2021-10-04Paper
Fast maximum weight clique extraction algorithm: optimal tables for branch-and-bound2021-06-07Paper
Exact algorithms for the max-min dispersion problem2020-07-07Paper
Max-Min 3-Dispersion problems2020-02-24Paper
Enumeration of nonisomorphic interval graphs and nonisomorphic permutation graphs2020-01-16Paper
Finding all solutions and instances of Numberlink and Slitherlink by ZDDs2019-03-26Paper
Sequentially Swapping Colored Tokens on Graphs2019-02-14Paper
The Time Complexity of Permutation Routing via Matching, Token Swapping and a Variant2019-02-14Paper
Computational complexity of robot arm simulation problems2018-09-06Paper
Complexity of the maximum \(k\)-path vertex cover problem2018-06-15Paper
Enumeration of nonisomorphic interval graphs and nonisomorphic permutation graphs2018-06-15Paper
Swapping colored tokens on graphs2018-05-17Paper
Extending partial representations of interval graphs2017-10-09Paper
Space-Efficient and Output-Sensitive Implementations of Greedy Algorithms on Intervals2017-05-05Paper
Sequentially Swapping Colored Tokens on Graphs2017-05-05Paper
The Time Complexity of the Token Swapping Problem and Its Parallel Variants2017-05-05Paper
Extending partial representations of proper and unit interval graphs2017-05-02Paper
Ferrers dimension of grid intersection graphs2016-11-24Paper
Competitive Diffusion on Weighted Graphs2015-10-30Paper
Swapping Colored Tokens on Graphs2015-10-30Paper
Swapping labeled tokens on graphs2015-05-26Paper
Extending partial representations of subclasses of chordal graphs2015-05-18Paper
Extending partial representations of proper and unit interval graphs2014-09-02Paper
Intersection Dimension of Bipartite Graphs2014-04-16Paper
Approximating the path-distance-width for AT-free graphs and graphs in related classes2014-04-02Paper
The complexity of the stamp folding problem2014-01-10Paper
Extending Partial Representations of Subclasses of Chordal Graphs2013-03-21Paper
Subgraph isomorphism in graph classes2012-10-16Paper
BIPARTITE PERMUTATION GRAPHS ARE RECONSTRUCTIBLE2012-10-15Paper
Random generation and enumeration of bipartite permutation graphs2012-05-11Paper
Approximability of the Path-Distance-Width for AT-free Graphs2011-12-16Paper
Complexity of the Stamp Folding Problem2011-08-12Paper
Extending partial representations of interval graphs2011-07-01Paper
Bipartite Permutation Graphs Are Reconstructible2011-01-10Paper
Reconstruction of interval graphs2010-11-11Paper
Reconstruction Algorithm for Permutation Graphs2010-02-09Paper
Random Generation and Enumeration of Bipartite Permutation Graphs2009-12-17Paper
Reconstruction of Interval Graphs2009-07-23Paper
Random Generation and Enumeration of Proper Interval Graphs2009-02-24Paper

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: Toshiki Saitoh