Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Naomi Nishimura
2010 – today
- 2012
[c27]- [c26]Marcin Kaminski, Naomi Nishimura: Finding an induced path of given parity in planar graphs in polynomial time. SODA 2012: 656-670
2000 – 2009
- 2008
- [j20]Michael R. Fellows, Christian Knauer, Naomi Nishimura, Prabhakar Ragde, Frances A. Rosamond, Ulrike Stege, Dimitrios M. Thilikos, Sue Whitesides: Faster Fixed-Parameter Tractable Algorithms for Matching and Packing Problems. Algorithmica 52(2): 167-176 (2008)
- [j19]Vida Dujmovic, Michael R. Fellows, Matthew Kitching, Giuseppe Liotta, Catherine McCartin, Naomi Nishimura, Prabhakar Ragde, Frances A. Rosamond, Sue Whitesides, David R. Wood: On the Parameterized Complexity of Layered Graph Drawing. Algorithmica 52(2): 267-292 (2008)
- 2007
- [j18]Naomi Nishimura, Prabhakar Ragde, Stefan Szeider: Solving #SAT using vertex covers. Acta Inf. 44(7-8): 509-523 (2007)
- [j17]MohammadTaghi Hajiaghayi, Naomi Nishimura: Subgraph isomorphism, log-bounded fragmentation, and graphs of (locally) bounded treewidth. J. Comput. Syst. Sci. 73(5): 755-768 (2007)
- 2006
- [j16]Vida 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: A Fixed-Parameter Approach to 2-Layer Planarization. Algorithmica 45(2): 159-182 (2006)
- [c25]Naomi Nishimura, Prabhakar Ragde, Stefan Szeider: Solving #SAT Using Vertex Covers. SAT 2006: 396-409
- 2005
- [j15]Arvind Gupta, Naomi Nishimura, Andrzej Proskurowski, Prabhakar Ragde: Embeddings of k-connected graphs of pathwidth k. Discrete Applied Mathematics 145(2): 242-265 (2005)
- [j14]Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos: Fast fixed-parameter tractable algorithms for nontrivial generalizations of vertex cover. Discrete Applied Mathematics 152(1-3): 229-245 (2005)
- [c24]Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos: Parameterized Counting Algorithms for General Graph Covering Problems. WADS 2005: 99-109
- 2004
- [j13]Erik D. Demaine, Mohammad Taghi Hajiaghayi, Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos: Approximation algorithms for classes of graphs excluding single-crossing graphs as minors. J. Comput. Syst. Sci. 69(2): 166-195 (2004)
- [c23]Michael R. Fellows, Christian Knauer, Naomi Nishimura, Prabhakar Ragde, Frances A. Rosamond, Ulrike Stege, Dimitrios M. Thilikos, Sue Whitesides: Faster Fixed-Parameter Tractable Algorithms for Matching and Packing Problems. ESA 2004: 311-322
- [c22]Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos: Smaller Kernels for Hitting Set Problems of Constant Arity. IWPEC 2004: 121-126
- [c21]Naomi Nishimura, Prabhakar Ragde, Stefan Szeider: Detecting Backdoor Sets with Respect to Horn and Binary Clauses. SAT 2004
- 2003
- [c20]Henning Fernau, Torben Hagerup, Naomi Nishimura, Prabhakar Ragde, Klaus Reinhardt: On the parameterized complexity of the generalized rush hour puzzle. CCCG 2003: 6-9
- 2002
- [j12]Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos: On Graph Powers for Leaf-Labeled Trees. J. Algorithms 42(1): 69-108 (2002)
- [c19]Mohammad Taghi Hajiaghayi, Naomi Nishimura: Subgraph Isomorphism, log-Bounded Fragmentation and Graphs of (Locally) Bounded Treewidth. MFCS 2002: 305-318
- 2001
- [j11]Mohammad Taghi Hajiaghayi, Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos: Fast approximation schemes for K3, 3-minor-free or K5-minor-free graphs. Electronic Notes in Discrete Mathematics 10: 137-142 (2001)
- [c18]Vida 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: On the Parameterized Complexity of Layered Graph Drawing. ESA 2001: 488-499
- [c17]Vida 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: A Fixed-Parameter Approach to Two-Layer Planarization. Graph Drawing 2001: 1-15
- [c16]Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos: Fast Fixed-Parameter Tractable Algorithms for Nontrivial Generalizations of Vertex Cover. WADS 2001: 75-86
- 2000
- [j10]Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos: Finding Smallest Supertrees Under Minor Containment. Int. J. Found. Comput. Sci. 11(3): 445-465 (2000)
- [c15]Arvind Gupta, Naomi Nishimura, Andrzej Proskurowski, Prabhakar Ragde: Embeddings of k-Connected Graphs of Pathwidth k. SWAT 2000: 111-124
- [c14]Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos: On Graph Powers for Leaf-Labeled Trees. SWAT 2000: 125-138
1990 – 1999
- 1999
- [c13]Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos: Finding Smallest Supertrees Under Minor Containment. WG 1999: 303-312
- 1998
- [j9]Arvind Gupta, Naomi Nishimura: Finding Largest Subtrees and Smallest Supertrees. Algorithmica 21(2): 183-210 (1998)
- [j8]
- [j7]Torben Hagerup, Jyrki Katajainen, Naomi Nishimura, Prabhakar Ragde: Characterizing Multiterminal Flow Networks and Computing Flows in Networks of Small Treewidth. J. Comput. Syst. Sci. 57(3): 366-375 (1998)
- 1996
- [j6]Patrick W. Dymond, Faith E. Fich, Naomi Nishimura, Prabhakar Ragde, Walter L. Ruzzo: Pointers versus Arithmetic in PRAMs. J. Comput. Syst. Sci. 53(2): 218-232 (1996)
- [j5]Arvind Gupta, Naomi Nishimura: The Complexity of Subgraph Isomorphism for Classes of Partial k-Trees. Theor. Comput. Sci. 164(1&2): 287-298 (1996)
- [c12]Peter A. Buhr, Anil K. Goel, Naomi Nishimura, Prabhakar Ragde: Parallel Pointer-Based Join Algorithms in Memory-mapped Environments. ICDE 1996: 266-275
- [c11]
- [c10]Peter A. Buhr, Anil K. Goel, Naomi Nishimura, Prabhakar Ragde: µDatabase: Parallelism in a Memory-Mapped Environment. SPAA 1996: 196-199
- [c9]Arvind Gupta, Naomi Nishimura: Characterizing the Complexity of Subgraph Isomorphism for Graphs of Bounded Path-Width. STACS 1996: 453-464
- 1995
- [j4]Arvind Gupta, Naomi Nishimura: The Parallel Complexity of Tree Embedding Problems. J. Algorithms 18(1): 176-200 (1995)
- [j3]Naomi Nishimura: Efficient Asynchronous Simulation of a Class of Synchronous Parallel Algorithms. J. Comput. Syst. Sci. 50(1): 98-113 (1995)
- [c8]
- [c7]Torben Hagerup, Jyrki Katajainen, Naomi Nishimura, Prabhakar Ragde: Characterizations of k-Terminal Flow Networks and Computing Network Flows in Partial k-Trees. SODA 1995: 641-649
- [c6]
- 1994
- [j2]Naomi Nishimura: A Model for Asynchronous Shared Memory Parallel Computation. SIAM J. Comput. 23(6): 1231-1252 (1994)
- [j1]
- [c5]Arvind Gupta, Naomi Nishimura: Sequential and Parallel Algorithms for Embedding Problems on Classes of Partial k-Trees. SWAT 1994: 172-182
- 1993
- [c4]Patrick W. Dymond, Faith E. Fich, Naomi Nishimura, Prabhakar Ragde, Walter L. Ruzzo: Pointers versus Arithmetic in PRAMs. Structure in Complexity Theory Conference 1993: 239-252
- 1992
- [c3]Arvind Gupta, Naomi Nishimura: The Parallel Complexity of Tree Embedding Problems (Extended Abstract). STACS 1992: 21-32
- 1990
- [c2]
1980 – 1989
- 1989
- [c1]
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-01-23 20:55 CET by the dblp team