• Naomi Nishimura, Prabhakar Ragde, Dimitrios Thilikos, ``Parameterized counting algorithms for general graph covering problems", Proceedings of the Workshop on Algorithms and Data Structures (WADS 2005), August 2005.
• Arvind Gupta, Naomi Nishimura, Andrzej Proskurowski, and Prabhakar Ragde, ``Embeddings of k-connected graphs of pathwidth k", Discrete Applied Mathematics, 145(2): 242-265, 2005.
• Erik D. Demaine, MohammadTaghi Hajiaghayi, Naomi Nishimura, Prabhakar Ragde, and Dimitrios M. Thilikos, ``Approximation algorithms for classes of graphs excluding single-crossing graphs as minors", Journal of Computer and System Sciences, 69:166-195, 2004.
• Michael R. Fellows, Christian Knauer, Naomi Nishimura, Prabhakar Ragde, Frances Rosamond, Ulrike Stege, Dimitrios M. Thilikos, and Sue Whitesides, ``Faster fixed-parameter tractable algorithms for matching and packing problems", Proceedings of the 12th Annual European Symposium on Algorithms (ESA 2004), September 2004.
• Naomi Nishimura, Prabhakar Ragde, and Dimitrios Thilikos, ``Smaller kernels for hitting set problems of constant arity", Proceedings of the International Workshop on Parameterized Complexity and Exact Computation (IWPEC 2004), September 2004.
• Naomi Nishimura, Prabhakar Ragde, and Stefan Szeider, ``Detecting backdoor sets for Horn and binary clauses", Proceedings of the Seventh International Conference on Theory and Applications of Satisfiability Testing (SAT 2004), May 2004.
• Henning Fernau, Torben Hagerup, Naomi Nishimura, Prabhakar Ragde, and K. Reinhardt, ``On the parameterized complexity of a generalized Rush Hour puzzle", Proceedings of the 15th Canadian Conference on Computational Geometry (CCCG 2003), 2003.
• MohammadTaghi Hajiaghayi and Naomi Nishimura, ``Subgraph isomorphism, log-bounded fragmentation and graphs of (locally) bounded treewidth," Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science (MFCS 2002), 2002, pp. 305-318.
• Naomi Nishimura, Prabhakar Ragde, and Dimitrios M. Thilikos, ``On graph powers for leaf-labeled trees", Journal of Algorithms, 42:69-108, 2002.
• Vida Dujmovic, Michael Fellows, Michael Hallett, Matthew Kitching, Giuseppe Liotta, Catherine McCartin, Naomi Nishimura, Prabhakar Ragde, Frances Rosemand, Matthew Suderman, Sue Whitesides, and David R. Wood, ``A fixed-parameter approach to two-layer planarization," Proceedings of the 9th International Symposium on Graph Drawing (GD 2001), September 2001, pp. 1-15.
• MohammadTaghi Hajiaghayi, Naomi Nishimura, Prabhakar Ragde, and Dimitrios M. Thilikos, ``Fast approximation schemes for K_{3,3}-minor-free or K_5-minor-free graphs", EuroConference "Combinatorics, Graph Theory and Applications (COMB01), 2001
• Naomi Nishimura, Prabhakar Ragde, and Dimitrios M. Thilikos, ``Fast fixed-parameter tractable algorithms for nontrivial generalizations of vertex cover", Workshop on Algorithms and Data Structures (WADS 2001), 2001.
• Vida Dujmovic, Michael Fellows, Michael Hallett, Matthew Kitching, Giuseppe Liotta, Catherine McCartin, Naomi Nishimura, Prabhakar Ragde, Frances Rosemand, Matthew Suderman, Sue Whitesides, and David R. Wood, ``On the parameterized complexity of layered graph drawing," Proceedings of the 9th Annual European Symposium on Algorithms (ESA 2001), August 2001, pp. 488-499.
• Naomi Nishimura, Prabhakar Ragde, and Dimitrios M. Thilikos, ``Finding smallest supertrees under minor containment", International Journal of Foundations of Computer Science, 11(3):445-465, 2000.
• Torben Hagerup, Jyrki Katajainen, Naomi Nishimura, and Prabhakar Ragde, ``Characterizing multiterminal flow networks and computing flows in networks of bounded treewidth,'' Journal of Computer and System Sciences, 57 (3):366-375, December 1998.
• Arvind Gupta and Naomi Nishimura, ``Finding largest subtrees and smallest supertrees,'' Algorithmica, 21:183-210, 1998.
• Lata Narayanan and Naomi Nishimura, ``Interval routing on k-trees,'' Journal of Algorithms, 26 (2): 325-369, 1998.
• Patrick Dymond, Faith E. Fich, Naomi Nishimura, Prabhakar Ragde, and Walter L. Ruzzo, ``Pointers versus Arithmetic in PRAMs,'' Journal of Computer and System Sciences, 53(2):218-232, October 1996.
• Arvind Gupta and Naomi Nishimura, ``The complexity of subgraph isomorphism for classes of partial k-trees,'' Theoretical Computer Science, 164:287--298, August 1996.
• Peter A. Buhr, Anil K. Goel, Naomi Nishimura, and Prabhakar Ragde, ``uDatabase: Parallelism in a Memory-Mapped Environment,'' Proceedings of the Eighth Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA 1996), June 1996, pp. 196-199.
• Peter A. Buhr, Anil K. Goel, Naomi Nishimura, and Prabhakar Ragde, ``Parallel pointer-based join algorithms in memory-mapped environments,'' Proceedings of the 12th IEEE International Conference on Data Engineering (ICDE 1996), February 1996, pp. 266-275.
• Arvind Gupta and Naomi Nishimura, ``Characterizing the complexity of subgraph isomorphism for graphs of bounded path-width,'' Proceedings of the 13th Annual Symposium on Theoretical Aspects of Computer Science (STACS 1996), February 1996, pp. 453-465.
• Naomi Nishimura, ``Efficient Asynchronous Simulation of a Class of Synchronous Parallel Algorithms,'' Journal of Computer and System Science, 50 (1):98-113, February 1995.
• Arvind Gupta and Naomi Nishimura, ``The parallel complexity of tree embedding problems,'' Journal of Algorithms, 18 (1):176-200, January 1995.
• Arvind Gupta and Naomi Nishimura, ``Sequential and parallel algorithms for embedding problems on classes of partial k-trees,'' Proceedings of the 4th Scandinavian Workshop on Algorithm Theory (SWAT 1994), pp. 172-182, 1994.
• Naomi Nishimura, ``A Model for Asynchronous Shared Memory Parallel Computation,'' SIAM Journal on Computing, 23 (6):1231--1252, December 1994.

Naomi Nishimura's home page