Spremljaj
Naomi Nishimura
Naomi Nishimura
Preverjeni e-poštni naslov na uwaterloo.ca
Naslov
Navedeno
Navedeno
Leto
Introduction to reconfiguration
N Nishimura
Algorithms 11 (4), 52, 2018
2322018
On the parameterized complexity of layered graph drawing
V Dujmović, MR Fellows, M Kitching, G Liotta, C McCartin, N Nishimura, ...
Algorithmica 52, 267-292, 2008
123*2008
Detecting Backdoor Sets with Respect to Horn and Binary Clauses.
N Nishimura, P Ragde, S Szeider
SAT 4, 96-103, 2004
1082004
Asynchronous shared memory parallel computation
N Nishimura
Proceedings of the second annual ACM Symposium on Parallel Algorithms and …, 1990
1071990
Finding largest subtrees and smallest supertrees
A Gupta, N Nishimura
Algorithmica 21, 183-210, 1998
991998
On graph powers for leaf-labeled trees
N Nishimura, P Ragde, DM Thilikos
Journal of Algorithms 42 (1), 69-108, 2002
972002
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
801998
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
682004
On the parameterized complexity of reconfiguration problems
AE Mouawad, N Nishimura, V Raman, N Simjour, A Suzuki
Parameterized and Exact Computation: 8th International Symposium, IPEC 2013 …, 2013
622013
On the parameterized complexity of reconfiguration problems
AE Mouawad, N Nishimura, V Raman, N Simjour, A Suzuki
Algorithmica 78 (1), 274-297, 2017
592017
Faster fixed-parameter tractable algorithms for matching and packing problems
MR Fellows, C Knauer, N Nishimura, P Ragde, F Rosamond, U Stege, ...
Algorithmica 52, 167-176, 2008
592008
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
552017
Faster fixed-parameter tractable algorithms for matching and packing problems
MR Fellows, C Knauer, N Nishimura, P Ragde, F Rosamond, U Stege, ...
Algorithms–ESA 2004: 12th Annual European Symposium, Bergen, Norway …, 2004
552004
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
532016
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
522014
The complexity of subgraph isomorphism for classes of partial k-trees
A Gupta, N Nishimura
Theoretical Computer Science 164 (1-2), 287-298, 1996
501996
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
452005
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
422007
Reconfiguration over tree decompositions
AE Mouawad, N Nishimura, V Raman, M Wrochna
International Symposium on Parameterized and Exact Computation, 246-257, 2014
392014
Vertex cover reconfiguration and beyond
AE Mouawad, N Nishimura, V Raman
International Symposium on Algorithms and Computation, 452-463, 2014
382014
Sistem trenutno ne more izvesti postopka. Poskusite znova pozneje.
Članki 1–20