( en | de | ru )

 

Disambiguation of "Nishimura, Naomi"

Author of the publication

copydeleteadd this publication to your clipboard
Fast Fixed-Parameter Tractable Algorithms for Nontrivial Generalizations of Vertex Cover.

, , and . WADS, volume 2125 of Lecture Notes in Computer Science, page 75-86. Springer, (2001)

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

Computing Weak Consistency in Polynomial Time: Extended Abstract., , , and . PODC, page 395-404. ACM, (2015)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)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)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)finding Smallest Supertrees., and . ISAAC, volume 1004 of Lecture Notes in Computer Science, page 112-121. Springer, (1995)Finding Largest Subtrees and Smallest Supertrees., and . Algorithmica, 21 (2): 183-210 (1998)Fast Fixed-Parameter Tractable Algorithms for Nontrivial Generalizations of Vertex Cover., , and . WADS, volume 2125 of Lecture Notes in Computer Science, page 75-86. Springer, (2001)