The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Naomi Nishimura: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Henning Fernau, Torben Hagerup, Naomi Nishimura, Prabhakar Ragde, Klaus Reinhardt
    On the parameterized complexity of the generalized rush hour puzzle. [Citation Graph (0, 0)][DBLP]
    CCCG, 2003, pp:6-9 [Conf]
  2. Patrick W. Dymond, Faith E. Fich, Naomi Nishimura, Prabhakar Ragde, Walter L. Ruzzo
    Pointers versus Arithmetic in PRAMs. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1993, pp:239-252 [Conf]
  3. 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. [Citation Graph (0, 0)][DBLP]
    ESA, 2001, pp:488-499 [Conf]
  4. 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. [Citation Graph (0, 0)][DBLP]
    ESA, 2004, pp:311-322 [Conf]
  5. 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. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2001, pp:1-15 [Conf]
  6. Peter A. Buhr, Anil K. Goel, Naomi Nishimura, Prabhakar Ragde
    Parallel Pointer-Based Join Algorithms in Memory-mapped Environments. [Citation Graph (0, 33)][DBLP]
    ICDE, 1996, pp:266-275 [Conf]
  7. Arvind Gupta, Naomi Nishimura
    finding Smallest Supertrees. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1995, pp:112-121 [Conf]
  8. Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos
    Smaller Kernels for Hitting Set Problems of Constant Arity. [Citation Graph (0, 0)][DBLP]
    IWPEC, 2004, pp:121-126 [Conf]
  9. Mohammad Taghi Hajiaghayi, Naomi Nishimura
    Subgraph Isomorphism, log-Bounded Fragmentation and Graphs of (Locally) Bounded Treewidth. [Citation Graph (0, 0)][DBLP]
    MFCS, 2002, pp:305-318 [Conf]
  10. Naomi Nishimura, Prabhakar Ragde, Stefan Szeider
    Detecting Backdoor Sets with Respect to Horn and Binary Clauses. [Citation Graph (0, 0)][DBLP]
    SAT, 2004, pp:- [Conf]
  11. Naomi Nishimura, Prabhakar Ragde, Stefan Szeider
    Solving #SAT Using Vertex Covers. [Citation Graph (0, 0)][DBLP]
    SAT, 2006, pp:396-409 [Conf]
  12. Lata Narayanan, Naomi Nishimura
    Interval Routing on k-trees. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 1996, pp:104-118 [Conf]
  13. Torben Hagerup, Jyrki Katajainen, Naomi Nishimura, Prabhakar Ragde
    Characterizations of k-Terminal Flow Networks and Computing Network Flows in Partial k-Trees. [Citation Graph (0, 0)][DBLP]
    SODA, 1995, pp:641-649 [Conf]
  14. Peter A. Buhr, Anil K. Goel, Naomi Nishimura, Prabhakar Ragde
    µDatabase: Parallelism in a Memory-Mapped Environment. [Citation Graph (0, 0)][DBLP]
    SPAA, 1996, pp:196-199 [Conf]
  15. Naomi Nishimura
    Asynchronous Shared Memory Parallel Computation. [Citation Graph (0, 0)][DBLP]
    SPAA, 1990, pp:76-84 [Conf]
  16. Arvind Gupta, Naomi Nishimura
    The Parallel Complexity of Tree Embedding Problems (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    STACS, 1992, pp:21-32 [Conf]
  17. Arvind Gupta, Naomi Nishimura
    Finding Largest Common Embeddable Subtrees. [Citation Graph (0, 0)][DBLP]
    STACS, 1995, pp:397-408 [Conf]
  18. Arvind Gupta, Naomi Nishimura
    Characterizing the Complexity of Subgraph Isomorphism for Graphs of Bounded Path-Width. [Citation Graph (0, 0)][DBLP]
    STACS, 1996, pp:453-464 [Conf]
  19. Arvind Gupta, Naomi Nishimura
    Sequential and Parallel Algorithms for Embedding Problems on Classes of Partial k-Trees. [Citation Graph (0, 0)][DBLP]
    SWAT, 1994, pp:172-182 [Conf]
  20. Arvind Gupta, Naomi Nishimura, Andrzej Proskurowski, Prabhakar Ragde
    Embeddings of k-Connected Graphs of Pathwidth k. [Citation Graph (0, 0)][DBLP]
    SWAT, 2000, pp:111-124 [Conf]
  21. Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos
    On Graph Powers for Leaf-Labeled Trees. [Citation Graph (0, 0)][DBLP]
    SWAT, 2000, pp:125-138 [Conf]
  22. Naomi Nishimura
    Complexity Issues in Tree-Based Version Control. [Citation Graph (0, 0)][DBLP]
    WADS, 1989, pp:472-486 [Conf]
  23. Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos
    Fast Fixed-Parameter Tractable Algorithms for Nontrivial Generalizations of Vertex Cover. [Citation Graph (0, 0)][DBLP]
    WADS, 2001, pp:75-86 [Conf]
  24. Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos
    Parameterized Counting Algorithms for General Graph Covering Problems. [Citation Graph (0, 0)][DBLP]
    WADS, 2005, pp:99-109 [Conf]
  25. Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos
    Finding Smallest Supertrees Under Minor Containment. [Citation Graph (0, 0)][DBLP]
    WG, 1999, pp:303-312 [Conf]
  26. Arvind Gupta, Naomi Nishimura
    Finding Largest Subtrees and Smallest Supertrees. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1998, v:21, n:2, pp:183-210 [Journal]
  27. 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. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2006, v:45, n:2, pp:159-182 [Journal]
  28. Arvind Gupta, Naomi Nishimura, Andrzej Proskurowski, Prabhakar Ragde
    Embeddings of k-connected graphs of pathwidth k. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2005, v:145, n:2, pp:242-265 [Journal]
  29. Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos
    Fast fixed-parameter tractable algorithms for nontrivial generalizations of vertex cover. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2005, v:152, n:1-3, pp:229-245 [Journal]
  30. Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos
    Finding Smallest Supertrees Under Minor Containment. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2000, v:11, n:3, pp:445-465 [Journal]
  31. Arvind Gupta, Naomi Nishimura
    The Parallel Complexity of Tree Embedding Problems. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1995, v:18, n:1, pp:176-200 [Journal]
  32. Lata Narayanan, Naomi Nishimura
    Interval Routing on k-Trees. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1998, v:26, n:2, pp:325-369 [Journal]
  33. Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos
    On Graph Powers for Leaf-Labeled Trees. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2002, v:42, n:1, pp:69-108 [Journal]
  34. 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. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2004, v:69, n:2, pp:166-195 [Journal]
  35. Patrick W. Dymond, Faith E. Fich, Naomi Nishimura, Prabhakar Ragde, Walter L. Ruzzo
    Pointers versus Arithmetic in PRAMs. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1996, v:53, n:2, pp:218-232 [Journal]
  36. Torben Hagerup, Jyrki Katajainen, Naomi Nishimura, Prabhakar Ragde
    Characterizing Multiterminal Flow Networks and Computing Flows in Networks of Small Treewidth. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1998, v:57, n:3, pp:366-375 [Journal]
  37. Naomi Nishimura
    Efficient Asynchronous Simulation of a Class of Synchronous Parallel Algorithms. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1995, v:50, n:1, pp:98-113 [Journal]
  38. Naomi Nishimura
    A Model for Asynchronous Shared Memory Parallel Computation. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1994, v:23, n:6, pp:1231-1252 [Journal]
  39. Arvind Gupta, Naomi Nishimura
    The Complexity of Subgraph Isomorphism for Classes of Partial k-Trees. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1996, v:164, n:1&2, pp:287-298 [Journal]
  40. Naomi Nishimura
    Restricted CRCW PRAM. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1994, v:123, n:2, pp:415-426 [Journal]
  41. MohammadTaghi Hajiaghayi, Naomi Nishimura
    Subgraph isomorphism, log-bounded fragmentation, and graphs of (locally) bounded treewidth. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2007, v:73, n:5, pp:755-768 [Journal]

  42. Solving #SAT using vertex covers. [Citation Graph (, )][DBLP]


  43. Faster Fixed-Parameter Tractable Algorithms for Matching and Packing Problems. [Citation Graph (, )][DBLP]


  44. On the Parameterized Complexity of Layered Graph Drawing. [Citation Graph (, )][DBLP]


Search in 0.006secs, Finished in 0.008secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002