×
Author ID: nishimura.naomi Recent zbMATH articles by "Nishimura, Naomi"
Published as: Nishimura, Naomi; Nishimura, N.

Publications by Year

Citations contained in zbMATH Open

66 Publications have been cited 586 times in 406 Documents Cited by Year
Introduction to reconfiguration. Zbl 1461.68164
Nishimura, Naomi
89
2018
The fast multipole boundary element method for potential problems: a tutorial. Zbl 1187.65134
Liu, Y. J.; Nishimura, N.
84
2006
A fast boundary element method for the analysis of fiber-reinforced composites based on a rigid-inclusion model. Zbl 1111.74528
Liu, Y. J.; Nishimura, N.; Otani, Y.; Takahashi, T.; Chen, X. L.; Munakata, H.
46
2005
On graph powers for leaf-labeled trees. Zbl 0990.68100
Nishimura, Naomi; Ragde, Prabhakar; Thilikos, Dimitrios M.
44
2002
A fast multipole accelerated method of fundamental solutions for potential problems. Zbl 1182.74256
Liu, Y. J.; Nishimura, N.; Yao, Z. H.
28
2005
The complexity of bounded length graph recoloring and CSP reconfiguration. Zbl 1456.68065
Bonsma, Paul; Mouawad, Amer E.; Nishimura, Naomi; Raman, Venkatesh
26
2014
On the parameterized complexity of layered graph drawing. Zbl 1170.68028
Dujmović, Vida; Fellows, Michael R.; Kitching, Matthew; Liotta, Giuseppe; McCartin, Catherine; Nishimura, Naomi; Ragde, Prabhakar; Rosamond, Frances; Whitesides, Sue; Wood, David R.
25
2008
On the parameterized complexity of reconfiguration problems. Zbl 1360.68516
Mouawad, Amer E.; Nishimura, Naomi; Raman, Venkatesh; Simjour, Narges; Suzuki, Akira
25
2017
Faster fixed-parameter tractable algorithms for matching and packing problems. Zbl 1170.68047
Fellows, M. R.; Knauer, C.; Nishimura, N.; Ragde, P.; Rosamond, F.; Stege, U.; Thilikos, D. M.; Whitesides, S.
22
2008
The complexity of dominating set reconfiguration. Zbl 1359.68133
Haddadan, Arash; Ito, Takehiro; Mouawad, Amer E.; Nishimura, Naomi; Ono, Hirotaka; Suzuki, Akira; Tebbal, Youcef
22
2016
On the parameterized complexity of reconfiguration problems. Zbl 1350.68155
Mouawad, Amer E.; Nishimura, Naomi; Raman, Venkatesh; Simjour, Narges; Suzuki, Akira
20
2013
Vertex cover reconfiguration and beyond. Zbl 1432.68164
Mouawad, Amer E.; Nishimura, Naomi; Raman, Venkatesh
19
2014
Characterizing multiterminal flow networks and computing flows in networks of small treewidth. Zbl 0917.68013
Hagerup, Torben; Katajainen, Jyrki; Nishimura, Naomi; Ragde, Prabhakar
18
1998
Fast fixed-parameter tractable algorithms for nontrivial generalizations of vertex cover. Zbl 1080.05093
Nishimura, Naomi; Ragde, Prabhakar; Thilikos, Dimitrios M.
18
2005
Shortest reconfiguration paths in the solution space of Boolean formulas. Zbl 1374.68246
Mouawad, Amer E.; Nishimura, Naomi; Pathak, Vinayak; Raman, Venkatesh
16
2015
The complexity of subgraph isomorphism for classes of partial k-trees. Zbl 0871.68139
Gupta, Arvind; Nishimura, Naomi
15
1996
A fixed-parameter approach to 2-layer planarization. Zbl 1095.68081
Dujmović, Vida; Fellows, Michael; Hallett, Michael; Kitching, Matthew; Liotta, Giuseppe; McCartin, Catherine; Nishimura, Naomi; Ragde, Prabhakar; Rosamond, Fran; Suderman, Matthew; Whitesides, Sue; Wood, David R.
14
2006
Reconfiguration of dominating sets. Zbl 1425.05126
Suzuki, Akira; Mouawad, Amer E.; Nishimura, Naomi
14
2014
Reconfiguration over tree decompositions. Zbl 1456.68132
Mouawad, Amer E.; Nishimura, Naomi; Raman, Venkatesh; Wrochna, Marcin
14
2014
Thermal analysis of carbon-nanotube composites using a rigid-line inclusion model by the boundary integral equation method. Zbl 1109.74321
Nishimura, N.; Liu, Y. J.
13
2004
Reconfiguration of dominating sets. Zbl 1356.90127
Suzuki, Akira; Mouawad, Amer E.; Nishimura, Naomi
13
2016
Approximation algorithms for classes of graphs excluding single-crossing graphs as minors. Zbl 1073.68063
Demaine, Erik D.; Hajiaghayi, Mohammad Taghi; Nishimura, Naomi; Ragde, Prabhakar; Thilikos, Dimitrios M.
12
2004
Solving #SAT using vertex covers. Zbl 1133.68073
Nishimura, Naomi; Ragde, Prabhakar; Szeider, Stefan
12
2007
Fast multipole boundary element analysis for 2D problems of magneto-electro-elastic media. Zbl 1244.74205
Zhu, Xingyi; Huang, Zhiyi; Jiang, Aiming; Chen, W. Q.; Nishimura, N.
11
2010
Finding largest subtrees and smallest supertrees. Zbl 0896.68103
Gupta, Arvind; Nishimura, N.
10
1998
Subgraph isomorphism, log-bounded fragmentation, and graphs of (locally) bounded treewidth. Zbl 1115.68114
Hajiaghayi, MohammadTaghi; Nishimura, Naomi
9
2007
Embeddings of \(k\)-connected graphs of pathwidth \(k\). Zbl 1055.05143
Gupta, Arvind; Nishimura, Naomi; Proskurowski, Andrzej; Ragde, Prabhakar
9
2005
Shortest reconfiguration paths in the solution space of Boolean formulas. Zbl 1374.68247
Mouawad, Amer E.; Nishimura, Naomi; Pathak, Vinayak; Raman, Venkatesh
9
2017
On the parameterized complexity of layered graph drawing. Zbl 1006.68544
Dujmović, V.; Fellows, M.; Hallett, M.; Kitching, M.; Liotta, G.; McCartin, C.; Nishimura, N.; Ragde, P.; Rosamond, F.; Suderman, M.; Whitesides, S.; Wood, D. R.
8
2001
Sequential and parallel algorithms for embedding problems on classes of partial \(k\)-trees. Zbl 1502.68228
Gupta, Arvind; Nishimura, Naomi
8
1994
Faster fixed-parameter tractable algorithms for matching and packing problems. Zbl 1111.68794
Fellows, Michael R.; Knauer, C.; Nishimura, N.; Ragde, P.; Rosamond, F.; Stege, U.; Thilikos, Dimitrios M.; Whitesides, S.
7
2004
The complexity of dominating set reconfiguration. Zbl 1451.68131
Haddadan, Arash; Ito, Takehiro; Mouawad, Amer E.; Nishimura, Naomi; Ono, Hirotaka; Suzuki, Akira; Tebbal, Youcef
7
2015
Incremental optimization of independent sets under the reconfiguration framework. Zbl 07172849
Ito, Takehiro; Mizuta, Haruka; Nishimura, Naomi; Suzuki, Akira
6
2019
Solving #SAT using vertex covers. Zbl 1187.68263
Nishimura, Naomi; Ragde, Prabhakar; Szeider, Stefan
5
2006
Interval routing on \(k\)-trees. 6. Zbl 0894.68108
Narayanan, Lata; Nishimura, Naomi
5
1998
Smaller kernels for hitting set problems of constant arity. Zbl 1104.68519
Nishimura, Naomi; Ragde, Prabhakar; Thilikos, Dimitrios M.
5
2004
A fixed-parameter approach to two-layer planarization. Zbl 1054.68576
Dujmović, V.; Fellows, M.; Hallett, M.; Kitching, M.; Liotta, Giuseppe; McCartin, C.; Nishimura, N.; Ragde, P.; Rosamond, F.; Suderman, M.; Whitesides, S.; Wood, David R.
5
2002
Parameterized counting algorithms for general graph covering problems. Zbl 1161.68690
Nishimura, Naomi; Ragde, Prabhakar; Thilikos, Dimitrios M.
5
2005
Reconfiguring spanning and induced subgraphs. Zbl 1436.68137
Hanaka, Tesshu; Ito, Takehiro; Mizuta, Haruka; Moore, Benjamin; Nishimura, Naomi; Subramanya, Vijay; Suzuki, Akira; Vaidyanathan, Krishna
5
2020
Characterizations of \(k\)-terminal flow networks and computing network flows in partial \(k\)-trees. Zbl 0849.90057
Hagerup, Torben; Katajainen, Jyrki; Nishimura, Naomi; Ragde, Prabhakar
4
1995
Finding an induced path of given parity in planar graphs in polynomial time. Zbl 1423.68342
Kamiński, Marcin; Nishimura, Naomi
4
2012
Parameterized enumeration of (locally-) optimal aggregations. Zbl 1391.68133
Nishimura, Naomi; Simjour, Narges
4
2013
Reconfiguring spanning and induced subgraphs. Zbl 1436.68136
Hanaka, Tesshu; Ito, Takehiro; Mizuta, Haruka; Moore, Benjamin; Nishimura, Naomi; Subramanya, Vijay; Suzuki, Akira; Vaidyanathan, Krishna
4
2018
The parallel complexity of tree embedding problems. Zbl 0818.68088
Gupta, Arvind; Nishimura, Naomi
3
1995
A boundary element method for the analysis of CNT/polymer composites with a cohesive interface model based on molecular dynamics. Zbl 1244.74168
Liu, Y. J.; Nishimura, N.; Qian, D.; Adachi, N.; Otani, Y.; Mokashi, V.
3
2008
Finding smallest supertrees under minor containment. Zbl 1320.05127
Nishimura, Naomi; Ragde, Prabhakar; Thilikos, Dimitrios M.
3
2000
Enumerating neighbour and closest strings. Zbl 1374.68248
Nishimura, Naomi; Simjour, Narges
3
2012
Embeddings of \(k\)-connected graphs of pathwidth \(k\). Zbl 0966.68223
Gupta, Arvind; Nishimura, Naomi; Proskurowski, Andrzej; Ragde, Prabhakar
2
2000
On graph powers for leaf-labeled trees. Zbl 0966.68225
Nishimura, Naomi; Ragde, Prabhakar; Thilikos, Dimitrios M.
2
2000
Characterizing the complexity of subgraph isomorphism for graphs of bounded path-width. Zbl 1379.68164
Gupta, Arvind; Nishimura, Naomi
2
1996
Subgraph isomorphism, log-bounded fragmentation and graphs of (locally) bounded treewidth. Zbl 1016.05066
Hajiaghayi, Mohammad Taghi; Nishimura, Naomi
2
2002
Reconfiguration of graph minors. Zbl 1516.05205
Moore, Benjamin; Nishimura, Naomi; Subramanya, Vijay
2
2018
A model for asynchronous shared memory parallel computation. Zbl 0830.68043
Nishimura, Naomi
1
1994
Efficient asynchronous simulation of a class of synchronous parallel algorithms. Zbl 0939.68944
Nishimura, Naomi
1
1995
Graph editing to a given neighbourhood degree list is fixed-parameter tractable. Zbl 1474.05373
Nishimura, Naomi; Subramanya, Vijay
1
2017
A BIE formulation for consolidation problems. Zbl 0594.73085
Nishimura, N.
1
1985
Crack-tip fields in a viscoplastic material. Zbl 0618.73109
Achenbach, J. D.; Nishimura, N.; Sung, J. C.
1
1987
Pointers versus arithmetic in PRAMs. Zbl 0859.68044
Dymond, Patrick W.; Fich, Faith E.; Nishimura, Naomi; Ragde, Prabhakar; Ruzzo, Walter L.
1
1996
A numerical method of crack determination by the boundary integral equation method. Zbl 0786.35147
Nishimura, N.
1
1992
Finding largest common embeddable subtrees. Zbl 1379.68106
Gupta, Arvind; Nishimura, Naomi
1
1995
Computing weak consistency in polynomial time (extended abstract). Zbl 1333.68058
Golab, Wojciech; Li, Xiaozhou (Steve); López-Ortiz, Alejandro; Nishimura, Naomi
1
2015
Time domain BIEM with CQM accelerated with ACA and truncation for the wave equation. Zbl 1357.65167
Yoshikawa, H.; Matsuura, R.; Nishimura, N.
1
2013
On directed covering and domination problems. Zbl 1457.05088
Hanaka, Tesshu; Nishimura, Naomi; Ono, Hirotaka
1
2017
On directed covering and domination problems. Zbl 1407.05194
Hanaka, Tesshu; Nishimura, Naomi; Ono, Hirotaka
1
2019
Incremental optimization of independent sets under the reconfiguration framework. Zbl 1495.90154
Ito, Takehiro; Mizuta, Haruka; Nishimura, Naomi; Suzuki, Akira
1
2022
The parallel complexity of tree embedding problems (extended abstract). Zbl 1493.68160
Gupta, Arvind; Nishimura, Naomi
1
1992
Incremental optimization of independent sets under the reconfiguration framework. Zbl 1495.90154
Ito, Takehiro; Mizuta, Haruka; Nishimura, Naomi; Suzuki, Akira
1
2022
Reconfiguring spanning and induced subgraphs. Zbl 1436.68137
Hanaka, Tesshu; Ito, Takehiro; Mizuta, Haruka; Moore, Benjamin; Nishimura, Naomi; Subramanya, Vijay; Suzuki, Akira; Vaidyanathan, Krishna
5
2020
Incremental optimization of independent sets under the reconfiguration framework. Zbl 07172849
Ito, Takehiro; Mizuta, Haruka; Nishimura, Naomi; Suzuki, Akira
6
2019
On directed covering and domination problems. Zbl 1407.05194
Hanaka, Tesshu; Nishimura, Naomi; Ono, Hirotaka
1
2019
Introduction to reconfiguration. Zbl 1461.68164
Nishimura, Naomi
89
2018
Reconfiguring spanning and induced subgraphs. Zbl 1436.68136
Hanaka, Tesshu; Ito, Takehiro; Mizuta, Haruka; Moore, Benjamin; Nishimura, Naomi; Subramanya, Vijay; Suzuki, Akira; Vaidyanathan, Krishna
4
2018
Reconfiguration of graph minors. Zbl 1516.05205
Moore, Benjamin; Nishimura, Naomi; Subramanya, Vijay
2
2018
On the parameterized complexity of reconfiguration problems. Zbl 1360.68516
Mouawad, Amer E.; Nishimura, Naomi; Raman, Venkatesh; Simjour, Narges; Suzuki, Akira
25
2017
Shortest reconfiguration paths in the solution space of Boolean formulas. Zbl 1374.68247
Mouawad, Amer E.; Nishimura, Naomi; Pathak, Vinayak; Raman, Venkatesh
9
2017
Graph editing to a given neighbourhood degree list is fixed-parameter tractable. Zbl 1474.05373
Nishimura, Naomi; Subramanya, Vijay
1
2017
On directed covering and domination problems. Zbl 1457.05088
Hanaka, Tesshu; Nishimura, Naomi; Ono, Hirotaka
1
2017
The complexity of dominating set reconfiguration. Zbl 1359.68133
Haddadan, Arash; Ito, Takehiro; Mouawad, Amer E.; Nishimura, Naomi; Ono, Hirotaka; Suzuki, Akira; Tebbal, Youcef
22
2016
Reconfiguration of dominating sets. Zbl 1356.90127
Suzuki, Akira; Mouawad, Amer E.; Nishimura, Naomi
13
2016
Shortest reconfiguration paths in the solution space of Boolean formulas. Zbl 1374.68246
Mouawad, Amer E.; Nishimura, Naomi; Pathak, Vinayak; Raman, Venkatesh
16
2015
The complexity of dominating set reconfiguration. Zbl 1451.68131
Haddadan, Arash; Ito, Takehiro; Mouawad, Amer E.; Nishimura, Naomi; Ono, Hirotaka; Suzuki, Akira; Tebbal, Youcef
7
2015
Computing weak consistency in polynomial time (extended abstract). Zbl 1333.68058
Golab, Wojciech; Li, Xiaozhou (Steve); López-Ortiz, Alejandro; Nishimura, Naomi
1
2015
The complexity of bounded length graph recoloring and CSP reconfiguration. Zbl 1456.68065
Bonsma, Paul; Mouawad, Amer E.; Nishimura, Naomi; Raman, Venkatesh
26
2014
Vertex cover reconfiguration and beyond. Zbl 1432.68164
Mouawad, Amer E.; Nishimura, Naomi; Raman, Venkatesh
19
2014
Reconfiguration of dominating sets. Zbl 1425.05126
Suzuki, Akira; Mouawad, Amer E.; Nishimura, Naomi
14
2014
Reconfiguration over tree decompositions. Zbl 1456.68132
Mouawad, Amer E.; Nishimura, Naomi; Raman, Venkatesh; Wrochna, Marcin
14
2014
On the parameterized complexity of reconfiguration problems. Zbl 1350.68155
Mouawad, Amer E.; Nishimura, Naomi; Raman, Venkatesh; Simjour, Narges; Suzuki, Akira
20
2013
Parameterized enumeration of (locally-) optimal aggregations. Zbl 1391.68133
Nishimura, Naomi; Simjour, Narges
4
2013
Time domain BIEM with CQM accelerated with ACA and truncation for the wave equation. Zbl 1357.65167
Yoshikawa, H.; Matsuura, R.; Nishimura, N.
1
2013
Finding an induced path of given parity in planar graphs in polynomial time. Zbl 1423.68342
Kamiński, Marcin; Nishimura, Naomi
4
2012
Enumerating neighbour and closest strings. Zbl 1374.68248
Nishimura, Naomi; Simjour, Narges
3
2012
Fast multipole boundary element analysis for 2D problems of magneto-electro-elastic media. Zbl 1244.74205
Zhu, Xingyi; Huang, Zhiyi; Jiang, Aiming; Chen, W. Q.; Nishimura, N.
11
2010
On the parameterized complexity of layered graph drawing. Zbl 1170.68028
Dujmović, Vida; Fellows, Michael R.; Kitching, Matthew; Liotta, Giuseppe; McCartin, Catherine; Nishimura, Naomi; Ragde, Prabhakar; Rosamond, Frances; Whitesides, Sue; Wood, David R.
25
2008
Faster fixed-parameter tractable algorithms for matching and packing problems. Zbl 1170.68047
Fellows, M. R.; Knauer, C.; Nishimura, N.; Ragde, P.; Rosamond, F.; Stege, U.; Thilikos, D. M.; Whitesides, S.
22
2008
A boundary element method for the analysis of CNT/polymer composites with a cohesive interface model based on molecular dynamics. Zbl 1244.74168
Liu, Y. J.; Nishimura, N.; Qian, D.; Adachi, N.; Otani, Y.; Mokashi, V.
3
2008
Solving #SAT using vertex covers. Zbl 1133.68073
Nishimura, Naomi; Ragde, Prabhakar; Szeider, Stefan
12
2007
Subgraph isomorphism, log-bounded fragmentation, and graphs of (locally) bounded treewidth. Zbl 1115.68114
Hajiaghayi, MohammadTaghi; Nishimura, Naomi
9
2007
The fast multipole boundary element method for potential problems: a tutorial. Zbl 1187.65134
Liu, Y. J.; Nishimura, N.
84
2006
A fixed-parameter approach to 2-layer planarization. Zbl 1095.68081
Dujmović, Vida; Fellows, Michael; Hallett, Michael; Kitching, Matthew; Liotta, Giuseppe; McCartin, Catherine; Nishimura, Naomi; Ragde, Prabhakar; Rosamond, Fran; Suderman, Matthew; Whitesides, Sue; Wood, David R.
14
2006
Solving #SAT using vertex covers. Zbl 1187.68263
Nishimura, Naomi; Ragde, Prabhakar; Szeider, Stefan
5
2006
A fast boundary element method for the analysis of fiber-reinforced composites based on a rigid-inclusion model. Zbl 1111.74528
Liu, Y. J.; Nishimura, N.; Otani, Y.; Takahashi, T.; Chen, X. L.; Munakata, H.
46
2005
A fast multipole accelerated method of fundamental solutions for potential problems. Zbl 1182.74256
Liu, Y. J.; Nishimura, N.; Yao, Z. H.
28
2005
Fast fixed-parameter tractable algorithms for nontrivial generalizations of vertex cover. Zbl 1080.05093
Nishimura, Naomi; Ragde, Prabhakar; Thilikos, Dimitrios M.
18
2005
Embeddings of \(k\)-connected graphs of pathwidth \(k\). Zbl 1055.05143
Gupta, Arvind; Nishimura, Naomi; Proskurowski, Andrzej; Ragde, Prabhakar
9
2005
Parameterized counting algorithms for general graph covering problems. Zbl 1161.68690
Nishimura, Naomi; Ragde, Prabhakar; Thilikos, Dimitrios M.
5
2005
Thermal analysis of carbon-nanotube composites using a rigid-line inclusion model by the boundary integral equation method. Zbl 1109.74321
Nishimura, N.; Liu, Y. J.
13
2004
Approximation algorithms for classes of graphs excluding single-crossing graphs as minors. Zbl 1073.68063
Demaine, Erik D.; Hajiaghayi, Mohammad Taghi; Nishimura, Naomi; Ragde, Prabhakar; Thilikos, Dimitrios M.
12
2004
Faster fixed-parameter tractable algorithms for matching and packing problems. Zbl 1111.68794
Fellows, Michael R.; Knauer, C.; Nishimura, N.; Ragde, P.; Rosamond, F.; Stege, U.; Thilikos, Dimitrios M.; Whitesides, S.
7
2004
Smaller kernels for hitting set problems of constant arity. Zbl 1104.68519
Nishimura, Naomi; Ragde, Prabhakar; Thilikos, Dimitrios M.
5
2004
On graph powers for leaf-labeled trees. Zbl 0990.68100
Nishimura, Naomi; Ragde, Prabhakar; Thilikos, Dimitrios M.
44
2002
A fixed-parameter approach to two-layer planarization. Zbl 1054.68576
Dujmović, V.; Fellows, M.; Hallett, M.; Kitching, M.; Liotta, Giuseppe; McCartin, C.; Nishimura, N.; Ragde, P.; Rosamond, F.; Suderman, M.; Whitesides, S.; Wood, David R.
5
2002
Subgraph isomorphism, log-bounded fragmentation and graphs of (locally) bounded treewidth. Zbl 1016.05066
Hajiaghayi, Mohammad Taghi; Nishimura, Naomi
2
2002
On the parameterized complexity of layered graph drawing. Zbl 1006.68544
Dujmović, V.; Fellows, M.; Hallett, M.; Kitching, M.; Liotta, G.; McCartin, C.; Nishimura, N.; Ragde, P.; Rosamond, F.; Suderman, M.; Whitesides, S.; Wood, D. R.
8
2001
Finding smallest supertrees under minor containment. Zbl 1320.05127
Nishimura, Naomi; Ragde, Prabhakar; Thilikos, Dimitrios M.
3
2000
Embeddings of \(k\)-connected graphs of pathwidth \(k\). Zbl 0966.68223
Gupta, Arvind; Nishimura, Naomi; Proskurowski, Andrzej; Ragde, Prabhakar
2
2000
On graph powers for leaf-labeled trees. Zbl 0966.68225
Nishimura, Naomi; Ragde, Prabhakar; Thilikos, Dimitrios M.
2
2000
Characterizing multiterminal flow networks and computing flows in networks of small treewidth. Zbl 0917.68013
Hagerup, Torben; Katajainen, Jyrki; Nishimura, Naomi; Ragde, Prabhakar
18
1998
Finding largest subtrees and smallest supertrees. Zbl 0896.68103
Gupta, Arvind; Nishimura, N.
10
1998
Interval routing on \(k\)-trees. 6. Zbl 0894.68108
Narayanan, Lata; Nishimura, Naomi
5
1998
The complexity of subgraph isomorphism for classes of partial k-trees. Zbl 0871.68139
Gupta, Arvind; Nishimura, Naomi
15
1996
Characterizing the complexity of subgraph isomorphism for graphs of bounded path-width. Zbl 1379.68164
Gupta, Arvind; Nishimura, Naomi
2
1996
Pointers versus arithmetic in PRAMs. Zbl 0859.68044
Dymond, Patrick W.; Fich, Faith E.; Nishimura, Naomi; Ragde, Prabhakar; Ruzzo, Walter L.
1
1996
Characterizations of \(k\)-terminal flow networks and computing network flows in partial \(k\)-trees. Zbl 0849.90057
Hagerup, Torben; Katajainen, Jyrki; Nishimura, Naomi; Ragde, Prabhakar
4
1995
The parallel complexity of tree embedding problems. Zbl 0818.68088
Gupta, Arvind; Nishimura, Naomi
3
1995
Efficient asynchronous simulation of a class of synchronous parallel algorithms. Zbl 0939.68944
Nishimura, Naomi
1
1995
Finding largest common embeddable subtrees. Zbl 1379.68106
Gupta, Arvind; Nishimura, Naomi
1
1995
Sequential and parallel algorithms for embedding problems on classes of partial \(k\)-trees. Zbl 1502.68228
Gupta, Arvind; Nishimura, Naomi
8
1994
A model for asynchronous shared memory parallel computation. Zbl 0830.68043
Nishimura, Naomi
1
1994
A numerical method of crack determination by the boundary integral equation method. Zbl 0786.35147
Nishimura, N.
1
1992
The parallel complexity of tree embedding problems (extended abstract). Zbl 1493.68160
Gupta, Arvind; Nishimura, Naomi
1
1992
Crack-tip fields in a viscoplastic material. Zbl 0618.73109
Achenbach, J. D.; Nishimura, N.; Sung, J. C.
1
1987
A BIE formulation for consolidation problems. Zbl 0594.73085
Nishimura, N.
1
1985
all top 5

Cited by 590 Authors

32 Ito, Takehiro
21 Suzuki, Akira
20 Bousquet, Nicolas
20 Nishimura, Naomi
17 Mouawad, Amer E.
13 Kobayashi, Yusuke
13 Otachi, Yota
12 Brandstädt, Andreas
12 Fernau, Henning
11 Uehara, Ryuhei
11 Zhou, Xiao
10 Liotta, Giuseppe
10 Thilikos, Dimitrios M.
9 Niedermeier, Rolf
9 Saurabh, Saket
9 Szeider, Stefan
8 Eppstein, David Arthur
8 Feghali, Carl
8 Kobayashi, Yasuaki
8 Lê Văn Băng
8 Zehavi, Meirav
7 Bonamy, Marthe
7 Mizuta, Haruka
7 Ono, Hirotaka
7 Wasa, Kunihiro
7 Whitesides, Sue H.
6 Bartier, Valentin
6 Di Giacomo, Emilio
6 Haas, Ruth
6 Lingas, Andrzej
6 Lokshtanov, Daniel
6 Montecchiani, Fabrizio
6 Ouvrard, Paul
6 Panolan, Fahad
6 Paulusma, Daniël
6 Wang, Jianxin
5 Abu-Khzam, Faisal N.
5 Belmonte, Rémy
5 Chen, Jian-er
5 Demaine, Erik D.
5 Fomin, Fedor V.
5 Golovach, Petr A.
5 Hajiaghayi, Mohammad Taghi
5 Hatanaka, Tatsuhiko
5 Kamiyama, Naoyuki
5 Okamoto, Yoshio
5 Raman, Venkatesh
5 Rautenbach, Dieter
5 Siebertz, Sebastian
4 Biedl, Therese C.
4 Bodlaender, Hans L.
4 Chang, Maw-Shang
4 Ganian, Robert
4 Guo, Jiong
4 Hamel, Sylvie
4 Hanaka, Tesshu
4 Hoàng Anh Đức
4 Johnson, Matthew
4 Kakimura, Naonori
4 Kaufmann, Michael
4 Lampis, Michael
4 Marx, Dániel
4 Mondal, Debajyoti
4 Moore, Benjamin R.
4 Moser, Hannes
4 Mühlenthaler, Moritz
4 Mynhardt, Christina Magdalena
4 Ragde, Prabhakar L.
4 Rahman, Md. Saidur
4 Wagner, Peter
3 Bonsma, Paul S.
3 Calamoneri, Tiziana
3 Chambers, Erin Wolf
3 Chen, Zhizhong
3 Cranston, Daniel W.
3 da Fonseca, Guilherme Dias
3 Didimo, Walter
3 Dom, Michael
3 Dujmović, Vida
3 Fellows, Michael Ralph
3 Feng, Qilong
3 Gérard, Yan
3 Goranci, Gramoz
3 Gupta, Arvind Kumar
3 Gurski, Frank
3 Heinrich, Marc
3 Hommelsheim, Felix
3 Hüffner, Falk
3 Iwamasa, Yuni
3 Joffard, Alice
3 Kamiński, Marcin Marek
3 Kim, Eun Jung
3 Kriege, Nils M.
3 Lee, Jae-Baek
3 López-Ortiz, Alejandro
3 Milosz, Robin
3 Mnich, Matthias
3 Mutzel, Petra
3 Nakahata, Yu
3 Nishat, Rahnuma Islam
...and 490 more Authors
all top 5

Cited in 53 Serials

47 Theoretical Computer Science
35 Algorithmica
27 Discrete Applied Mathematics
17 Journal of Computer and System Sciences
12 Discrete Mathematics
12 Graphs and Combinatorics
9 European Journal of Combinatorics
9 SIAM Journal on Discrete Mathematics
9 Theory of Computing Systems
9 Journal of Graph Algorithms and Applications
9 Journal of Discrete Algorithms
8 Information Processing Letters
8 Journal of Combinatorial Optimization
5 Journal of Combinatorial Theory. Series B
5 Journal of Graph Theory
5 Algorithms
5 Computer Science Review
4 SIAM Journal on Computing
4 The Electronic Journal of Combinatorics
3 Artificial Intelligence
3 Discrete & Computational Geometry
3 Computational Geometry
3 International Journal of Foundations of Computer Science
2 Acta Informatica
2 Information Sciences
2 Combinatorica
2 Computers & Operations Research
2 Machine Learning
2 Distributed Computing
2 The Australasian Journal of Combinatorics
2 Discrete Optimization
1 Journal of Statistical Physics
1 Advances in Applied Mathematics
1 Journal of Automated Reasoning
1 Annals of Operations Research
1 Linear Algebra and its Applications
1 SIAM Review
1 Mathematical Programming. Series A. Series B
1 Journal of Algebraic Combinatorics
1 Combinatorics, Probability and Computing
1 Annals of Mathematics and Artificial Intelligence
1 Discussiones Mathematicae. Graph Theory
1 Discrete Mathematics and Theoretical Computer Science. DMTCS
1 Journal of Machine Learning Research (JMLR)
1 AKCE International Journal of Graphs and Combinatorics
1 Science in China. Series F
1 Journal of Satisfiability, Boolean Modeling and Computation
1 Statistical Analysis and Data Mining
1 Discrete Mathematics, Algorithms and Applications
1 ACM Transactions on Algorithms
1 Journal of Theoretical Biology
1 ACM Transactions on Computation Theory
1 Philosophical Transactions of the Royal Society of London. A. Mathematical, Physical and Engineering Sciences

Citations by Year