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 | 101* | 2001 |

Detecting Backdoor Sets with Respect to Horn and Binary Clauses. N Nishimura, P Ragde, S Szeider SAT 4, 96-103, 2004 | 99 | 2004 |

On the parameterized complexity of reconfiguration problems AE Mouawad, N Nishimura, V Raman, N Simjour, A Suzuki Algorithmica 78 (1), 274-297, 2017 | 95 | 2017 |

Introduction to reconfiguration N Nishimura Algorithms 11 (4), 52, 2018 | 94 | 2018 |

Asynchronous shared memory parallel computation N Nishimura Proceedings of the second annual ACM Symposium on Parallel Algorithms and …, 1990 | 94 | 1990 |

Finding largest subtrees and smallest supertrees A Gupta, N Nishimura Algorithmica 21 (2), 183-210, 1998 | 92 | 1998 |

On graph powers for leaf-labeled trees N Nishimura, P Ragde, DM Thilikos Journal of Algorithms 42 (1), 69-108, 2002 | 82 | 2002 |

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 | 63 | 2004 |

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 | 58 | 1998 |

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 | 53 | 2004 |

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 | 51 | 2008 |

The complexity of subgraph isomorphism for classes of partial k-trees A Gupta, N Nishimura Theoretical Computer Science 164 (1-2), 287-298, 1996 | 48 | 1996 |

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 | 43 | 2014 |

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 | 40 | 2017 |

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 | 38 | 2007 |

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 | 36 | 2001 |

Reconfiguration over tree decompositions AE Mouawad, N Nishimura, V Raman, M Wrochna International Symposium on Parameterized and Exact Computation, 246-257, 2014 | 35 | 2014 |

Solving# SAT using vertex covers N Nishimura, P Ragde, S Szeider Acta Informatica 44 (7), 509-523, 2007 | 35 | 2007 |

Fast fixed-parameter tractable algorithms for nontrivial generalizations of vertex cover N Nishimura, P Ragde, DM Thilikos Discrete Applied Mathematics 152 (1-3), 229-245, 2005 | 35 | 2005 |

Sequential and parallel algorithms for embedding problems on classes of partial *k*-treesA Gupta, N Nishimura Scandinavian Workshop on Algorithm Theory, 172-182, 1994 | 35 | 1994 |