Takeyuki Tamura

MaRDI QIDQ620948zbMATH OpenFDO

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Finding and analyzing the minimum set of driver nodes in control of Boolean networks Advances in Complex Systems	2024-10-30	Paper
scientific article; zbMATH DE number 7561381 (Why is no real title available?)	2022-07-21	Paper
New and improved algorithms for unordered tree inclusion Theoretical Computer Science	2021-08-27	Paper
New and improved algorithms for unordered tree inclusion Theoretical Computer Science	2021-08-27	Paper
Improved hardness of maximum common subgraph problems on labeled graphs of bounded treewidth and bounded degree International Journal of Foundations of Computer Science	2021-04-20	Paper
A simple linear-time algorithm for computing the centroid and canonical form of a plane graph and its applications	2020-12-16	Paper
A polynomial-time algorithm for computing the maximum common connected edge subgraph of outerplanar graphs of bounded degree Algorithms	2019-03-26	Paper
Discrimination of singleton and periodic attractors in Boolean networks Automatica	2017-11-17	Paper
On the parameterized complexity of associative and commutative unification Theoretical Computer Science	2016-12-22	Paper
On the parameterized complexity of associative and commutative unification Parameterized and Exact Computation	2015-09-15	Paper
On the parameterized complexity of associative and commutative unification Parameterized and Exact Computation	2015-09-15	Paper
On the complexity of finding a largest common subtree of bounded degree Theoretical Computer Science	2015-06-10	Paper
Efficient exponential-time algorithms for edit distance between unordered trees Journal of Discrete Algorithms	2014-04-01	Paper
On the complexity of the maximum common subgraph problem for partial \(k\)-trees of bounded degree Algorithms and Computation	2013-03-21	Paper
Determining a singleton attractor of an AND/OR Boolean network in \(O(n^{1.587})\) time Information Processing Letters	2012-03-19	Paper
Singleton and 2-periodic attractors of sign-definite Boolean networks Information Processing Letters	2012-03-09	Paper
Algorithms for singleton attractor detection in planar and nonplanar AND/OR Boolean networks Mathematics in Computer Science	2011-02-19	Paper
Exact algorithms for computing the tree edit distance between unordered trees Theoretical Computer Science	2011-02-02	Paper
Completing networks using observed data Lecture Notes in Computer Science	2009-12-01	Paper
Algorithms for Inference, Analysis and Control of Boolean Networks Algebraic Biology	2009-02-03	Paper
An Improved Algorithm for Detecting a Singleton Attractor in a Boolean Network Consisting of AND/OR Nodes Algebraic Biology	2009-02-03	Paper
An O(1.787 n )-Time Algorithm for Detecting a Singleton Attractor in a Boolean Network Consisting of AND/OR Nodes Fundamentals of Computation Theory	2008-02-26	Paper
scientific article; zbMATH DE number 2163026 (Why is no real title available?)	2005-04-29	Paper

Research outcomes over time

This page was built for person: Takeyuki Tamura