Naomi Nishimura

2008
45	EE	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)
44	EE	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
43	EE	Naomi Nishimura, Prabhakar Ragde, Stefan Szeider: Solving #SAT using vertex covers. Acta Inf. 44(7-8): 509-523 (2007)
42	EE	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
41	EE	Naomi Nishimura, Prabhakar Ragde, Stefan Szeider: Solving #SAT Using Vertex Covers. SAT 2006: 396-409
40	EE	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)
2005
39	EE	Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos: Parameterized Counting Algorithms for General Graph Covering Problems. WADS 2005: 99-109
38	EE	Arvind Gupta, Naomi Nishimura, Andrzej Proskurowski, Prabhakar Ragde: Embeddings of k-connected graphs of pathwidth k. Discrete Applied Mathematics 145(2): 242-265 (2005)
37	EE	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)
2004
36	EE	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
35	EE	Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos: Smaller Kernels for Hitting Set Problems of Constant Arity. IWPEC 2004: 121-126
34	EE	Naomi Nishimura, Prabhakar Ragde, Stefan Szeider: Detecting Backdoor Sets with Respect to Horn and Binary Clauses. SAT 2004
33	EE	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)
2003
32		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
31	EE	Mohammad Taghi Hajiaghayi, Naomi Nishimura: Subgraph Isomorphism, log-Bounded Fragmentation and Graphs of (Locally) Bounded Treewidth. MFCS 2002: 305-318
30	EE	Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos: On Graph Powers for Leaf-Labeled Trees. J. Algorithms 42(1): 69-108 (2002)
2001
29	EE	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
28	EE	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
27	EE	Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos: Fast Fixed-Parameter Tractable Algorithms for Nontrivial Generalizations of Vertex Cover. WADS 2001: 75-86
26	EE	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)
2000
25	EE	Arvind Gupta, Naomi Nishimura, Andrzej Proskurowski, Prabhakar Ragde: Embeddings of k-Connected Graphs of Pathwidth k. SWAT 2000: 111-124
24	EE	Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos: On Graph Powers for Leaf-Labeled Trees. SWAT 2000: 125-138
23		Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos: Finding Smallest Supertrees Under Minor Containment. Int. J. Found. Comput. Sci. 11(3): 445-465 (2000)
1999
22	EE	Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos: Finding Smallest Supertrees Under Minor Containment. WG 1999: 303-312
1998
21		Arvind Gupta, Naomi Nishimura: Finding Largest Subtrees and Smallest Supertrees. Algorithmica 21(2): 183-210 (1998)
20		Lata Narayanan, Naomi Nishimura: Interval Routing on k-Trees. J. Algorithms 26(2): 325-369 (1998)
19		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
18	EE	Peter A. Buhr, Anil K. Goel, Naomi Nishimura, Prabhakar Ragde: Parallel Pointer-Based Join Algorithms in Memory-mapped Environments. ICDE 1996: 266-275
17		Lata Narayanan, Naomi Nishimura: Interval Routing on k-trees. SIROCCO 1996: 104-118
16		Peter A. Buhr, Anil K. Goel, Naomi Nishimura, Prabhakar Ragde: µDatabase: Parallelism in a Memory-Mapped Environment. SPAA 1996: 196-199
15		Arvind Gupta, Naomi Nishimura: Characterizing the Complexity of Subgraph Isomorphism for Graphs of Bounded Path-Width. STACS 1996: 453-464
14		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)
13	EE	Arvind Gupta, Naomi Nishimura: The Complexity of Subgraph Isomorphism for Classes of Partial k-Trees. Theor. Comput. Sci. 164(1&2): 287-298 (1996)
1995
12		Arvind Gupta, Naomi Nishimura: finding Smallest Supertrees. ISAAC 1995: 112-121
11		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
10		Arvind Gupta, Naomi Nishimura: Finding Largest Common Embeddable Subtrees. STACS 1995: 397-408
9		Arvind Gupta, Naomi Nishimura: The Parallel Complexity of Tree Embedding Problems. J. Algorithms 18(1): 176-200 (1995)
8		Naomi Nishimura: Efficient Asynchronous Simulation of a Class of Synchronous Parallel Algorithms. J. Comput. Syst. Sci. 50(1): 98-113 (1995)
1994
7		Arvind Gupta, Naomi Nishimura: Sequential and Parallel Algorithms for Embedding Problems on Classes of Partial k-Trees. SWAT 1994: 172-182
6		Naomi Nishimura: A Model for Asynchronous Shared Memory Parallel Computation. SIAM J. Comput. 23(6): 1231-1252 (1994)
5		Naomi Nishimura: Restricted CRCW PRAM. Theor. Comput. Sci. 123(2): 415-426 (1994)
1993
4		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
3		Arvind Gupta, Naomi Nishimura: The Parallel Complexity of Tree Embedding Problems (Extended Abstract). STACS 1992: 21-32
1990
2	EE	Naomi Nishimura: Asynchronous Shared Memory Parallel Computation. SPAA 1990: 76-84
1989
1		Naomi Nishimura: Complexity Issues in Tree-Based Version Control. WADS 1989: 472-486

Coauthor Index

1	Peter A. Buhr	[16] [18]
2	Erik D. Demaine	[33]
3	Vida Dujmovic	[28] [29] [40] [44]
4	Patrick W. Dymond	[4] [14]
5	Faith Ellen (Faith Ellen Fich, Faith E. Fich)	[4] [14]
6	Michael R. Fellows (Mike Fellows)	[28] [29] [36] [40] [44] [45]
7	Henning Fernau	[32]
8	Anil K. Goel	[16] [18]
9	Arvind Gupta	[3] [7] [9] [10] [12] [13] [15] [21] [25] [38]
10	Torben Hagerup	[11] [19] [32]
11	Mohammad Taghi Hajiaghayi (MohammadTaghi Hajiaghayi)	[26] [31] [33] [42]
12	Michael T. Hallett	[28] [29] [40]
13	Jyrki Katajainen	[11] [19]
14	Matthew Kitching	[28] [29] [40] [44]
15	Christian Knauer	[36] [45]
16	Giuseppe Liotta	[28] [29] [40] [44]
17	Catherine McCartin	[28] [29] [40] [44]
18	Lata Narayanan	[17] [20]
19	Andrzej Proskurowski	[25] [38]
20	Prabhakar Ragde	[4] [11] [14] [16] [18] [19] [22] [23] [24] [25] [26] [27] [28] [29] [30] [32] [33] [34] [35] [36] [37] [38] [39] [40] [41] [43] [44] [45]
21	Klaus Reinhardt	[32]
22	Frances A. Rosamond	[28] [29] [36] [40] [44] [45]
23	Walter L. Ruzzo	[4] [14]
24	Ulrike Stege	[36] [45]
25	Matthew Suderman (Matthew J. Suderman)	[28] [29] [40]
26	Stefan Szeider	[34] [41] [43]
27	Dimitrios M. Thilikos	[22] [23] [24] [26] [27] [30] [33] [35] [36] [37] [39] [45]
28	Sue Whitesides	[28] [29] [36] [40] [44] [45]
29	David R. Wood	[28] [29] [40] [44]

Colors in the list of coauthors