# Shin-ichi Minato

Orcid: 0000-0002-1397-1020
According to our database

Collaborative distances:

^{1}, Shin-ichi Minato authored at least 125 papers between 1990 and 2024.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Dataset Other## Links

#### On csauthors.net:

## Bibliography

2024

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

Proceedings of the WALCOM: Algorithms and Computation, 2024

Proceedings of the SOFSEM 2024: Theory and Practice of Computer Science, 2024

Designing Algorithms for the Shortest Path Reconfiguration Problem Using Decision Diagram Operations.

Proceedings of the 16th International Conference on Agents and Artificial Intelligence, 2024

2023

Theor. Comput. Sci., November, 2023

IEICE Trans. Inf. Syst., March, 2023

CoRR, 2023

Automated Parallel Test Forms Assembly using Zero-suppressed Binary Decision Diagrams.

IEEE Access, 2023

CompDP: A Framework for Simultaneous Subgraph Counting Under Connectivity Constraints.

Proceedings of the 21st International Symposium on Experimental Algorithms, 2023

A Fast and Exact Evaluation Algorithm for the Expected Number of Connected Nodes: an Enhanced Network Reliability Measure.

Proceedings of the IEEE INFOCOM 2023, 2023

Proceedings of the IEEE International Conference on Communications, 2023

2022

Interval-Memoized Backtracking on ZDDs for Fast Enumeration of All Lower Cost Solutions.

CoRR, 2022

Space and Power Reduction in BDD-based Optical Logic Circuits Exploiting Dual Ports.

Proceedings of the 2022 Design, Automation & Test in Europe Conference & Exhibition, 2022

2021

Minor-embedding heuristics for large-scale annealing processors with sparse hardware graphs of up to 102, 400 nodes.

Soft Comput., 2021

J. Inf. Process., 2021

CoRR, 2021

Proceedings of the IEEE Computer Society Annual Symposium on VLSI, 2021

2020

J. Inf. Process., 2020

J. Inf. Process., 2020

Compiling Crossing-free Geometric Graphs with Connectivity Constraint for Fast Enumeration, Random Sampling, and Optimization.

CoRR, 2020

Enumerating All Subgraphs Under Given Constraints Using Zero-Suppressed Sentential Decision Diagrams.

Proceedings of the 18th International Symposium on Experimental Algorithms, 2020

Proceedings of the WALCOM: Algorithms and Computation - 14th International Conference, 2020

Implicit Enumeration of Topological-Minor-Embeddings and Its Application to Planar Subgraph Enumeration.

Proceedings of the WALCOM: Algorithms and Computation - 14th International Conference, 2020

2019

CoRR, 2019

A Fast Algorithm for Combinatorial Hotspot Mining Based on Spatial Scan Statistic.

Proceedings of the 2019 SIAM International Conference on Data Mining, 2019

2018

IEEE Trans. Smart Grid, 2018

Fast Enumeration of All Pareto-Optimal Solutions for 0-1 Multi-Objective Knapsack Problems Using ZDDs.

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

Comput. Commun., 2018

Algorithms, 2018

Graph Minors from Simulated Annealing for Annealing Machines with Sparse Connectivity.

Proceedings of the Theory and Practice of Natural Computing - 7th International Conference, 2018

FPGA-Based QBoost with Large-Scale Annealing Processor and Accelerated Hyperparameter Search.

Proceedings of the 2018 International Conference on ReConFigurable Computing and FPGAs, 2018

Proceedings of the 2018 IEEE Conference on Computer Communications, 2018

Proceedings of the Combinatorial Optimization and Applications, 2018

Efficient Bandit Combinatorial Optimization Algorithm with Zero-suppressed Binary Decision Diagrams.

Proceedings of the International Conference on Artificial Intelligence and Statistics, 2018

2017

BDD-Constrained A<sup>*</sup> Search: A Fast Method for Solving Constrained Shortest-Path Problems.

IEICE Trans. Inf. Syst., 2017

Verifying Scenarios of Proximity-Based Federations among Smart Objects through Model Checking and Its Advantages.

IEICE Trans. Inf. Syst., 2017

Power of Enumeration - Recent Topics on BDD/ZDD-Based Techniques for Discrete Structure Manipulation.

IEICE Trans. Inf. Syst., 2017

Frontier-Based Search for Enumerating All Constrained Subgraphs with Compressed Representation.

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

Practical Adversarial Combinatorial Bandit Algorithm via Compression of Decision Sets.

CoRR, 2017

Proceedings of the WALCOM: Algorithms and Computation, 2017

Efficient Scenario Verification of Proximity-based Federations among Smart Objects through Symbolic Model Checking.

Proceedings of the 7th International Joint Conference on Pervasive and Embedded Computing and Communication Systems (PECCS 2017), 2017

Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Halifax, NS, Canada, August 13, 2017

Proceedings of the 3rd Workshop on Advanced Methodologies for Bayesian Networks, 2017

Proceedings of the 3rd Workshop on Advanced Methodologies for Bayesian Networks, 2017

BDD-Constrained A* Search: A Fast Method for Solving Constrained DAG Shortest-Path Problems.

Proceedings of the Workshops of the The Thirty-First AAAI Conference on Artificial Intelligence, 2017

Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

2016

Encyclopedia of Algorithms, 2016

Int. J. Softw. Tools Technol. Transf., 2016

Sequence binary decision diagram: Minimization, relationship to acyclic automata, and complexities of Boolean set operations.

Discret. Appl. Math., 2016

Proceedings of the Reversible Computation - 8th International Conference, 2016

Maximizing hosting capacity of distributed generation by network reconfiguration in distribution system.

Proceedings of the Power Systems Computation Conference, 2016

Power of Enumeration - BDD/ZDD-Based Techniques for Discrete Structure Manipulation.

Proceedings of the 46th IEEE International Symposium on Multiple-Valued Logic, 2016

Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, 2016

2015

Distribution Network Verification for Secure Restoration by Enumerating All Critical Failures.

IEEE Trans. Smart Grid, 2015

Proceedings of the WALCOM: Algorithms and Computation - 9th International Workshop, 2015

Proceedings of the WALCOM: Algorithms and Computation - 9th International Workshop, 2015

Proceedings of the Reversible Computation - 7th International Conference, 2015

Proceedings of the NAACL HLT 2015, The 2015 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, Denver, Colorado, USA, May 31, 2015

Proceedings of the Advanced Methodologies for Bayesian Networks, 2015

Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 2015

2014

IEEE Trans. Smart Grid, 2014

Implicit Generation of Pattern-Avoiding Permutations by Using Permutation Decision Diagrams.

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

Proceedings of the Prague Stringology Conference 2014, Prague, Czech Republic, 2014

Proceedings of the 2014 SIAM International Conference on Data Mining, 2014

A Fast Method of Statistical Assessment for Combinatorial Hypotheses Based on Frequent Itemset Enumeration.

Proceedings of the Machine Learning and Knowledge Discovery in Databases, 2014

On the Size of the Zero-Suppressed Binary Decision Diagram that Represents All the Subtrees in a Tree.

Proceedings of the Trends and Applications in Knowledge Discovery and Data Mining, 2014

Proceedings of the Trends and Applications in Knowledge Discovery and Data Mining, 2014

Proceedings of the Trends and Applications in Knowledge Discovery and Data Mining, 2014

Proceedings of the Algorithms and Computation - 25th International Symposium, 2014

Rethinking Packet Classification for Global Network View of Software-Defined Networking.

Proceedings of the 22nd IEEE International Conference on Network Protocols, 2014

2013

IEICE Trans. Inf. Syst., 2013

Proceedings of the WALCOM: Algorithms and Computation, 7th International Workshop, 2013

Compact Complete Inverted Files for Texts and Directed Acyclic Graphs Based on Sequence Binary Decision Diagrams .

Proceedings of the Prague Stringology Conference 2013, Prague, Czech Republic, 2013

Proceedings of the 43rd IEEE International Symposium on Multiple-Valued Logic, 2013

Proceedings of the Algorithms - ESA 2013, 2013

2012

J. Multiple Valued Log. Soft Comput., 2012

Counterexamples to the long-standing conjecture on the complexity of BDD binary operations.

Inf. Process. Lett., 2012

Int. J. Organ. Collect. Intell., 2012

A Dynamically Reconfigurable FPGA-Based Pattern Matching Hardware for Subclasses of Regular Expressions.

IEICE Trans. Inf. Syst., 2012

On Tackling Flash Crowds with URL Shorteners and Examining User Behavior after Great East Japan Earthquake.

IEICE Trans. Commun., 2012

Algorithms, 2012

Proceedings of the Reversible Computation, 4th International Workshop, 2012

Proceedings of the Advances in Knowledge Discovery and Data Mining, 2012

2011

Overview of ERATO Minato Project: The Art of Discrete Structure Manipulation between Science and Engineering.

New Gener. Comput., 2011

Notes on Sequence Binary Decision Diagrams: Relationship to Acyclic Automata and Complexities of Binary Set Operations.

Proceedings of the Prague Stringology Conference 2011, 2011

<i>π</i>DD: A New Decision Diagram for Efficient Problem Solving in Permutation Space.

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2011, 2011

A Compact Representation Scheme of Coalitional Games Based on Multi-Terminal Zero-Suppressed Binary Decision Diagrams.

Proceedings of the Agents in Principle, Agents in Practice - 14th International Conference, 2011

Second Workshop on Algorithms for Large-Scale Information Processing in Knowledge Discovery (ALSIP).

Proceedings of the New Frontiers in Artificial Intelligence, 2011

An efficient algorithm for constructing a Sequence Binary Decision Diagram representing a set of reversed sequences.

Proceedings of the 2011 IEEE International Conference on Granular Computing, 2011

Proceedings of the 10th ACM SIGPLAN workshop on Erlang, Tokyo, Japan, September 23, 2011, 2011

Proceedings of the Special Workshop on Internet and Disasters, 2011

Proceedings of the AI 2011: Advances in Artificial Intelligence, 2011

2010

Proceedings of the 2nd Asian Conference on Machine Learning, 2010

Proceedings of the String Processing and Information Retrieval, 2010

Frequentness-Transition Queries for Distinctive Pattern Mining from Time-Segmented Databases.

Proceedings of the SIAM International Conference on Data Mining, 2010

Proceedings of the Computer and Information Sciences, 2010

Dynamic reconfigurable bit-parallel architecture for large-scale regular expression matching.

Proceedings of the International Conference on Field-Programmable Technology, 2010

2009

Proceedings of the New Frontiers in Artificial Intelligence, 2009

2008

DDMF: An Efficient Decision Diagram Structure for Design Verification of Quantum Circuits under a Practical Restriction.

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

LCM over ZBDDs: Fast Generation of Very Large-Scale Frequent Itemsets Using a Compact Graph-Based Representation.

Proceedings of the Advances in Knowledge Discovery and Data Mining, 2008

Proceedings of 8th IEEE International Conference on Computer and Information Technology, 2008

A fast algorithm for cofactor implication checking and its application for knowledge discovery.

Proceedings of 8th IEEE International Conference on Computer and Information Technology, 2008

2007

Compiling Bayesian Networks by Symbolic Probability Calculation Based on Zero-Suppressed BDDs.

Proceedings of the IJCAI 2007, 2007

A Theoretical Study on Variable Ordering of Zero-Suppressed BDDs for Representing Frequent Itemsets.

Proceedings of the Discovery Science, 10th International Conference, 2007

2006

Proceedings of the Knowledge Discovery in Inductive Databases, 5th International Workshop, 2006

Proceedings of the New Frontiers in Artificial Intelligence, 2006

Proceedings of the Discovery Science, 9th International Conference, 2006

2005

Efficient Method of Combinatorial Item Set Analysis Based on Zero-Suppressed BDDs.

Proceedings of the 2005 International Workshop on Challenges in Web Information Retrieval and Integration (WIRI 2005), 2005

Proceedings of the New Frontiers in Artificial Intelligence, 2005

VSOP (Valued-Sum-of-Products) Calculator for Knowledge Processing Based on Zero-Suppressed BDDs.

Proceedings of the Federation over the Web, 2005

2002

IEEE Trans. Computers, 2002

2001

Int. J. Softw. Tools Technol. Transf., 2001

Proceedings of the Conference on Design, Automation and Test in Europe, 2001

1999

Proceedings of the VLSI Handbook., 1999

1998

Inf. Process. Lett., 1998

Finding all simple disjunctive decompositions using irredundant sum-of-products forms.

Proceedings of the 1998 IEEE/ACM International Conference on Computer-Aided Design, 1998

1997

Formal Methods Syst. Des., 1997

1996

IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 1996

Proceedings of the 1996 IEEE/ACM International Conference on Computer-Aided Design, 1996

Proceedings of the Formal Methods in Computer-Aided Design, First International Conference, 1996

1995

Manipulation of regular expressions under length constraints using zero-suppressed-BDDs.

Proceedings of the 1995 Conference on Asia Pacific Design Automation, Makuhari, Massa, Chiba, Japan, August 29, 1995

1994

Proceedings of the 31st Conference on Design Automation, 1994

1993

Proceedings of the 30th Design Automation Conference. Dallas, 1993

1990

Shared Binary Decision Diagram with Attributed Edges for Efficient Boolean function Manipulation.

Proceedings of the 27th ACM/IEEE Design Automation Conference. Orlando, 1990