Author of the publication

A Fixed-Parameter Algorithm for Detecting a Singleton Attractor in an AND/OR Boolean Network with Bounded Treewidth.

, , , and . IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 98-A (1): 384-390 (2015)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Development and comparison of search algorithms for robot motion planning in the configuration space., , , and . IROS, page 429-434. IEEE, (1991)Domain-Based Approaches to Prediction and Analysis of Protein-Protein Interactions., and . IJKDB, 4 (1): 24-41 (2014)A Novel Clustering Method for Analysis of Biological Networks using Maximal Components of Graphs., , and . APBC, volume 5 of Advances in Bioinformatics and Computational Biology, page 257-266. Imperial College Press, (2007)Enumerating Chemical Graphs with Two Disjoint Cycles Satisfying Given Path Frequency Specifications., , , , , , and . CoRR, (2020)Enumerating Chemical Graphs with Mono-block 2-Augmented Tree Structure from Given Upper and Lower Bounds on Path Frequencies., , , , , , and . CoRR, (2020)Integer Programming-Based Method for Designing Synthetic Metabolic Networks by Minimum Reaction Insertion in a Boolean Model, , , and . PLOS ONE, 9 (3): e92637+ (Mar 20, 2014)On the complexity of finding a largest common subtree of bounded degree., , , and . Theor. Comput. Sci., (2015)Enumerating Substituted Benzene Isomers of Tree-Like Chemical Graphs., , and . IEEE ACM Trans. Comput. Biol. Bioinform., 15 (2): 633-646 (2018)Common Attractors in Multiple Boolean Networks., , , , , and . IEEE ACM Trans. Comput. Biol. Bioinform., 20 (5): 2862-2873 (September 2023)An FVS-Based Approach to Attractor Detection in Asynchronous Random Boolean Networks., , and . IEEE ACM Trans. Comput. Biol. Bioinform., 19 (2): 806-818 (2022)