On Partitioning Colored Points. - Takahisa Toda (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2011)

Extracting Co-Occurrence Relations from ZDDs. - Takahisa Toda (Algorithms, 2012)

Fast Compression of Large-Scale Hypergraphs for Solving Combinatorial Problems. - Takahisa Toda (Discovery Science, 2013)

Hypergraph Transversal Computation with Binary Decision Diagrams. - Takahisa Toda (SEA, 2013)

On separating families of bipartitions. - Takahisa Toda; Ivo Vigan (Discret. Math., 2013)

Three-way Indexing ZDDs for Large-Scale Sparse Datasets. - Hiroshi Aoki; Takahisa Toda; Shin-ichi Minato (PAKDD Workshops, 2014)

A General Framework for Parallel Unary Operations on ZDDs. - Shogo Takeuchi; Takahisa Toda; Shin-ichi Minato (PAKDD Workshops, 2014)

Implicit Generation of Pattern-Avoiding Permutations by Using Permutation Decision Diagrams. - Yuma Inoue; Takahisa Toda; Shin-ichi Minato (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2014)

BDD construction for all solutions SAT and efficient caching mechanism. - Takahisa Toda; Koji Tsuda (SAC, 2015)

Superset Generation on Decision Diagrams. - Takahisa Toda; Shogo Takeuchi; Koji Tsuda; Shin-ichi Minato (WALCOM, 2015)

Effective construction of compression-based feature space. - Hisashi Koga; Yuji Nakajima; Takahisa Toda (ISITA, 2016)

Implementing Efficient All Solutions SAT Solvers. - Takahisa Toda; Takehide Soh (ACM J. Exp. Algorithmics, 2016)

Fast Exact Algorithm to Solve Continuous Similarity Search for Evolving Queries. - Tomohiro Yamazaki; Hisashi Koga; Takahisa Toda (AIRS, 2017)

Improved Compression-Based Pattern Recognition Exploiting New Useful Features. - Taichi Uchino; Hisashi Koga; Takahisa Toda (IbPRIA, 2017)

Dualization of boolean functions using ternary decision diagrams. - Takahisa Toda (Ann. Math. Artif. Intell., 2017)

Exploiting Functional Dependencies of Variables in All Solutions SAT Solvers. - Takahisa Toda; Takeru Inoue (J. Inf. Process., 2017)

Extended Min-Hash Focusing on Intersection Cardinality. - Hisashi Koga; Satoshi Suzuki; Taiki Itabashi; Gibran Fuentes Pineda; Takahisa Toda (IDEAL (1), 2018)

Exact Method for Generating Strategy-Solvable Sudoku Clues. - Kohei Nishikawa; Takahisa Toda (Algorithms, 2020)

Interval-based Counterexample Analysis for Error Explanation. - Takahisa Toda; Takeru Inoue (J. Inf. Process., 2021)

Applying Combinatorial Testing to Verification-Based Fairness Testing. - Takashi Kitamura 001; Zhenjiang Zhao 002; Takahisa Toda (SSBSE, 2022)

Efficient Fairness Testing Through Hash-Based Sampling. - Zhenjiang Zhao 002; Takahisa Toda; Takashi Kitamura 001 (SSBSE, 2022)

ZDD-Based Algorithmic Framework for Solving Shortest Reconfiguration Problems. - Takehiro Ito; Jun Kawahara; Yu Nakahata; Takehide Soh; Akira Suzuki 001; Junichi Teruyama; Takahisa Toda (CPAIOR, 2023)

Solving Reconfiguration Problems of First-Order Expressible Properties of Graph Vertices with Boolean Satisfiability. - Takahisa Toda; Takehiro Ito; Jun Kawahara; Takehide Soh; Akira Suzuki 001; Junichi Teruyama (ICTAI, 2023)

Toward Individual Fairness Testing with Data Validity. - Takashi Kitamura 001; Sousuke Amasaki; Jun Inoue 001; Yoshinao Isobe; Takahisa Toda (ASE, 2024)

Approximation-guided Fairness Testing through Discriminatory Space Analysis. - Zhenjiang Zhao 002; Takahisa Toda; Takashi Kitamura 001 (ASE, 2024)

Diversity-aware fairness testing of machine learning classifiers through hashing-based sampling. - Zhenjiang Zhao 002; Takahisa Toda; Takashi Kitamura 001 (Inf. Softw. Technol., 2024)