Naomi Nishimura - researchr alias

researchr

You are not signed in
Sign in
Sign up

2008

2007

Subgraph isomorphism, log-bounded fragmentation, and graphs of (locally) bounded treewidthMohammadTaghi Hajiaghayi, Naomi Nishimura. jcss, 73(5):755-768, 2007. [doi]

Solving #SAT using vertex coversNaomi Nishimura, Prabhakar Ragde, Stefan Szeider. ACTA, 44(7-8):509-523, 2007. [doi]

2006

2005

Embeddings of ::::k::::-connected graphs of pathwidth ::::k::::Arvind Gupta, Naomi Nishimura, Andrzej Proskurowski, Prabhakar Ragde. DAM, 145(2):242-265, 2005. [doi]

Fast fixed-parameter tractable algorithms for nontrivial generalizations of vertex coverNaomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos. DAM, 152(1-3):229-245, 2005. [doi]

Parameterized Counting Algorithms for General Graph Covering ProblemsNaomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos. wads 2005: 99-109 [doi]

2004

2003

On the parameterized complexity of the generalized rush hour puzzleHenning Fernau, Torben Hagerup, Naomi Nishimura, Prabhakar Ragde, Klaus Reinhardt. cccg 2003: 6-9

2002

Subgraph Isomorphism, log-Bounded Fragmentation and Graphs of (Locally) Bounded TreewidthMohammad Taghi Hajiaghayi, Naomi Nishimura. mfcs 2002: 305-318 [doi]

On Graph Powers for Leaf-Labeled TreesNaomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos. jal, 42(1):69-108, 2002. [doi]

2001

On the Parameterized Complexity of Layered Graph DrawingVida Dujmovic, Michael R. Fellows, Michael T. Hallett, Matthew Kitching, Giuseppe Liotta, Catherine McCartin, Naomi Nishimura, Prabhakar Ragde, Frances A. Rosamond, Matthew Suderman, Sue Whitesides, David R. Wood. esa 2001: 488-499 [doi]

A Fixed-Parameter Approach to Two-Layer PlanarizationVida Dujmovic, Michael R. Fellows, Michael T. Hallett, Matthew Kitching, Giuseppe Liotta, Catherine McCartin, Naomi Nishimura, Prabhakar Ragde, Frances A. Rosamond, Matthew Suderman, Sue Whitesides, David R. Wood. gd 2002: 1-15 [doi]

Fast approximation schemes for K::3, 3::-minor-free or K::5::-minor-free graphsMohammad Taghi Hajiaghayi, Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos. endm, 10:137-142, 2001. [doi]

Fast Fixed-Parameter Tractable Algorithms for Nontrivial Generalizations of Vertex CoverNaomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos. wads 2001: 75-86 [doi]

2000

Embeddings of ::::k::::-Connected Graphs of Pathwidth ::::k::::Arvind Gupta, Naomi Nishimura, Andrzej Proskurowski, Prabhakar Ragde. swat 2000: 111-124 [doi]

Finding Smallest Supertrees Under Minor ContainmentNaomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos. ijfcs, 11(3):445-465, 2000.

On Graph Powers for Leaf-Labeled TreesNaomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos. swat 2000: 125-138 [doi]

1999

Finding Smallest Supertrees Under Minor ContainmentNaomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos. criwg 1999: 303-312 [doi]

1998

Finding Largest Subtrees and Smallest SupertreesArvind Gupta, Naomi Nishimura. algorithmica, 21(2):183-210, 1998.

Characterizing Multiterminal Flow Networks and Computing Flows in Networks of Small TreewidthTorben Hagerup, Jyrki Katajainen, Naomi Nishimura, Prabhakar Ragde. jcss, 57(3):366-375, 1998.

Interval Routing on ::::k::::-TreesLata Narayanan, Naomi Nishimura. jal, 26(2):325-369, 1998.

1996

1995

1994

Sequential and Parallel Algorithms for Embedding Problems on Classes of Partial k-TreesArvind Gupta, Naomi Nishimura. swat 1994: 172-182

A Model for Asynchronous Shared Memory Parallel ComputationNaomi Nishimura. siamcomp, 23(6):1231-1252, 1994.

Restricted CRCW PRAMNaomi Nishimura. TCS, 123(2):415-426, 1994.

1993

Pointers versus Arithmetic in PRAMsPatrick W. Dymond, Faith E. Fich, Naomi Nishimura, Prabhakar Ragde, Walter L. Ruzzo. cocoon 1993: 239-252

1992

The Parallel Complexity of Tree Embedding Problems (Extended Abstract)Arvind Gupta, Naomi Nishimura. STACS 1992: 21-32

1990

Asynchronous Shared Memory Parallel ComputationNaomi Nishimura. spaa 1990: 76-84 [doi]

1989

Complexity Issues in Tree-Based Version ControlNaomi Nishimura. wads 1989: 472-486