Takeyuki Tamura

Available identifiers

zbMath Open tamura.takeyukiMaRDI QIDQ620948

List of research outcomes

Publication	Date of Publication	Type
https://portal.mardi4nfdi.de/entity/Q5091018	2022-07-21	Paper
New and improved algorithms for unordered tree inclusion	2021-08-27	Paper
Improved Hardness of Maximum Common Subgraph Problems on Labeled Graphs of Bounded Treewidth and Bounded Degree	2021-04-20	Paper
https://portal.mardi4nfdi.de/entity/Q5140773	2020-12-16	Paper
A polynomial-time algorithm for computing the maximum common connected edge subgraph of outerplanar graphs of bounded degree	2019-03-26	Paper
Discrimination of singleton and periodic attractors in Boolean networks	2017-11-17	Paper
On the parameterized complexity of associative and commutative unification	2016-12-22	Paper
On the Parameterized Complexity of Associative and Commutative Unification	2015-09-15	Paper
On the complexity of finding a largest common subtree of bounded degree	2015-06-10	Paper
Efficient exponential-time algorithms for edit distance between unordered trees	2014-04-01	Paper
On the Complexity of Finding a Largest Common Subtree of Bounded Degree	2013-08-16	Paper
On the Complexity of the Maximum Common Subgraph Problem for Partial k-Trees of Bounded Degree	2013-03-21	Paper
A Polynomial-Time Algorithm for Computing the Maximum Common Subgraph of Outerplanar Graphs of Bounded Degree	2012-09-25	Paper
Efficient Exponential Time Algorithms for Edit Distance between Unordered Trees	2012-08-14	Paper
Determining a singleton attractor of an AND/OR Boolean network in \(O(n^{1.587})\) time	2012-03-19	Paper
Singleton and 2-periodic attractors of sign-definite Boolean networks	2012-03-09	Paper
Algorithms for singleton attractor detection in planar and nonplanar AND/OR Boolean networks	2011-02-19	Paper
Exact algorithms for computing the tree edit distance between unordered trees	2011-02-02	Paper
Completing Networks Using Observed Data	2009-12-01	Paper
Algorithms for Inference, Analysis and Control of Boolean Networks	2009-02-03	Paper
An Improved Algorithm for Detecting a Singleton Attractor in a Boolean Network Consisting of AND/OR Nodes	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	2008-02-26	Paper
https://portal.mardi4nfdi.de/entity/Q4673413	2005-04-29	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Takeyuki Tamura