Follow
Naomi Nishimura
Naomi Nishimura
Verified email at uwaterloo.ca
Title
Cited by
Cited by
Year
Introduction to reconfiguration
N Nishimura
Algorithms 11 (4), 52, 2018
1312018
On the parameterized complexity of layered graph drawing
V DujmoviŠ, M Fellows, M Hallett, M Kitching, G Liotta, C McCartin, ...
European Symposium on Algorithms, 488-499, 2001
109*2001
Detecting Backdoor Sets with Respect to Horn and Binary Clauses.
N Nishimura, P Ragde, S Szeider
SAT 4, 96-103, 2004
1052004
On the parameterized complexity of reconfiguration problems
AE Mouawad, N Nishimura, V Raman, N Simjour, A Suzuki
Algorithmica 78 (1), 274-297, 2017
1042017
Asynchronous shared memory parallel computation
N Nishimura
Proceedings of the second annual ACM Symposium on Parallel Algorithms andá…, 1990
1001990
Finding largest subtrees and smallest supertrees
A Gupta, N Nishimura
Algorithmica 21 (2), 183-210, 1998
961998
On graph powers for leaf-labeled trees
N Nishimura, P Ragde, DM Thilikos
Journal of Algorithms 42 (1), 69-108, 2002
912002
Approximation algorithms for classes of graphs excluding single-crossing graphs as minors
ED Demaine, MT Hajiaghayi, N Nishimura, P Ragde, DM Thilikos
Journal of Computer and System Sciences 69 (2), 166-195, 2004
662004
Characterizing multiterminal flow networks and computing flows in networks of small treewidth
T Hagerup, J Katajainen, N Nishimura, P Ragde
Journal of Computer and System Sciences 57 (3), 366-375, 1998
651998
Faster fixed-parameter tractable algorithms for matching and packing problems
MR Fellows, C Knauer, N Nishimura, P Ragde, F Rosamond, U Stege, ...
European Symposium on Algorithms, 311-322, 2004
532004
The complexity of subgraph isomorphism for classes of partial k-trees
A Gupta, N Nishimura
Theoretical Computer Science 164 (1-2), 287-298, 1996
521996
Faster fixed-parameter tractable algorithms for matching and packing problems
MR Fellows, C Knauer, N Nishimura, P Ragde, F Rosamond, U Stege, ...
Algorithmica 52 (2), 167-176, 2008
512008
The complexity of bounded length graph recoloring and CSP reconfiguration
P Bonsma, AE Mouawad, N Nishimura, V Raman
International Symposium on Parameterized and Exact Computation, 110-121, 2014
482014
Shortest reconfiguration paths in the solution space of Boolean formulas
AE Mouawad, N Nishimura, V Pathak, V Raman
SIAM Journal on Discrete Mathematics 31 (3), 2185-2200, 2017
462017
Subgraph isomorphism, log-bounded fragmentation, and graphs of (locally) bounded treewidth
MT Hajiaghayi, N Nishimura
Journal of Computer and System Sciences 73 (5), 755-768, 2007
412007
The complexity of dominating set reconfiguration
A Haddadan, T Ito, AE Mouawad, N Nishimura, H Ono, A Suzuki, ...
Theoretical Computer Science 651, 37-49, 2016
392016
Solving# SAT using vertex covers
N Nishimura, P Ragde, S Szeider
Acta Informatica 44 (7), 509-523, 2007
372007
A fixed-parameter approach to two-layer planarization
V DujmoviŠ, M Fellows, M Hallett, M Kitching, G Liotta, C McCartin, ...
International Symposium on Graph Drawing, 1-15, 2001
372001
Vertex cover reconfiguration and beyond
AE Mouawad, N Nishimura, V Raman
International Symposium on Algorithms and Computation, 452-463, 2014
362014
Reconfiguration over tree decompositions
AE Mouawad, N Nishimura, V Raman, M Wrochna
International Symposium on Parameterized and Exact Computation, 246-257, 2014
362014
The system can't perform the operation now. Try again later.
Articles 1–20