The following pages link to Takeyuki Tamura (Q620948):
Displayed 23 items.
- Exact algorithms for computing the tree edit distance between unordered trees (Q620949) (← links)
- Algorithms for singleton attractor detection in planar and nonplanar AND/OR Boolean networks (Q626872) (← links)
- On the parameterized complexity of associative and commutative unification (Q729894) (← links)
- Singleton and 2-periodic attractors of sign-definite Boolean networks (Q763485) (← links)
- Determining a singleton attractor of an AND/OR Boolean network in \(O(n^{1.587})\) time (Q765479) (← links)
- Discrimination of singleton and periodic attractors in Boolean networks (Q1680922) (← links)
- A polynomial-time algorithm for computing the maximum common connected edge subgraph of outerplanar graphs of bounded degree (Q1736548) (← links)
- New and improved algorithms for unordered tree inclusion (Q2049980) (← links)
- On the complexity of finding a largest common subtree of bounded degree (Q2348030) (← links)
- Efficient exponential-time algorithms for edit distance between unordered trees (Q2442818) (← links)
- On the Complexity of Finding a Largest Common Subtree of Bounded Degree (Q2842767) (← links)
- Efficient Exponential Time Algorithms for Edit Distance between Unordered Trees (Q2904510) (← links)
- A Polynomial-Time Algorithm for Computing the Maximum Common Subgraph of Outerplanar Graphs of Bounded Degree (Q2912710) (← links)
- On the Parameterized Complexity of Associative and Commutative Unification (Q2946004) (← links)
- Algorithms for Inference, Analysis and Control of Boolean Networks (Q3599189) (← links)
- An Improved Algorithm for Detecting a Singleton Attractor in a Boolean Network Consisting of AND/OR Nodes (Q3599204) (← links)
- Completing Networks Using Observed Data (Q3648747) (← links)
- (Q4673413) (← links)
- On the Complexity of the Maximum Common Subgraph Problem for Partial k-Trees of Bounded Degree (Q4909531) (← links)
- (Q5091018) (← links)
- (Q5140773) (← links)
- An O(1.787 n )-Time Algorithm for Detecting a Singleton Attractor in a Boolean Network Consisting of AND/OR Nodes (Q5444987) (← links)
- Improved Hardness of Maximum Common Subgraph Problems on Labeled Graphs of Bounded Treewidth and Bounded Degree (Q5859738) (← links)