( en | de | ru )

 

Disambiguation of "Nishimura, Naomi"

Author of the publication

copydeleteadd this publication to your clipboard
Finding Largest Subtrees and Smallest Supertrees.

, and . Algorithmica, 21 (2): 183-210 (1998)

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.

Naomi Silberner

Kumi Nishimura

Masanobu Nishimura

Naomi Tidten

Masanobu Nishimura

 

Other publications of authors with the same name

Incremental Optimization of Independent Sets Under the Reconfiguration Framework., , , and . COCOON, volume 11653 of Lecture Notes in Computer Science, page 313-324. Springer, (2019)Finding Smallest Supertrees Under Minor Containment., , and . WG, volume 1665 of Lecture Notes in Computer Science, page 303-312. Springer, (1999)Subgraph Isomorphism, log-Bounded Fragmentation and Graphs of (Locally) Bounded Treewidth., and . MFCS, volume 2420 of Lecture Notes in Computer Science, page 305-318. Springer, (2002)Computing Weak Consistency in Polynomial Time: Extended Abstract., , , and . PODC, page 395-404. ACM, (2015)Reconfiguration of Graph Minors., , and . MFCS, volume 117 of LIPIcs, page 75:1-75:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)On Directed Covering and Domination Problems., , and . ISAAC, volume 92 of LIPIcs, page 45:1-45:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Graph Editing to a Given Neighbourhood Degree List is Fixed-Parameter Tractable., and . COCOA (2), volume 10628 of Lecture Notes in Computer Science, page 138-153. Springer, (2017)Embeddings of k-Connected Graphs of Pathwidth k., , , and . SWAT, volume 1851 of Lecture Notes in Computer Science, page 111-124. Springer, (2000)Faster Fixed-Parameter Tractable Algorithms for Matching and Packing Problems., , , , , , , and . ESA, volume 3221 of Lecture Notes in Computer Science, page 311-322. Springer, (2004)Sequential and Parallel Algorithms for Embedding Problems on Classes of Partial k-Trees., and . SWAT, volume 824 of Lecture Notes in Computer Science, page 172-182. Springer, (1994)