Naomi Nishimura

According to our database1, Naomi Nishimura
  • authored at least 68 papers between 1989 and 2017.
  • has a "Dijkstra number"2 of three.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2017
On the Parameterized Complexity of Reconfiguration Problems.
Algorithmica, 2017

2016
The complexity of dominating set reconfiguration.
Theor. Comput. Sci., 2016

Reconfiguration of dominating sets.
J. Comb. Optim., 2016

2015
On scalable parallel recursive backtracking.
J. Parallel Distrib. Comput., 2015

The complexity of dominating set reconfiguration.
CoRR, 2015

The Complexity of Dominating Set Reconfiguration.
Proceedings of the Algorithms and Data Structures - 14th International Symposium, 2015

Computing Weak Consistency in Polynomial Time: [Extended Abstract].
Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, 2015

Shortest Reconfiguration Paths in the Solution Space of Boolean Formulas.
Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015

2014
Reconfiguration of Dominating Sets.
CoRR, 2014

Reconfiguration over tree decompositions.
CoRR, 2014

Vertex Cover Reconfiguration and Beyond.
CoRR, 2014

Shortest reconfiguration paths in the solution space of Boolean formulas.
CoRR, 2014

Reconfiguration over Tree Decompositions.
Proceedings of the Parameterized and Exact Computation - 9th International Symposium, 2014

The Complexity of Bounded Length Graph Recoloring and CSP Reconfiguration.
Proceedings of the Parameterized and Exact Computation - 9th International Symposium, 2014

Vertex Cover Reconfiguration and Beyond.
Proceedings of the Algorithms and Computation - 25th International Symposium, 2014

Reconfiguration of Dominating Sets.
Proceedings of the Computing and Combinatorics - 20th International Conference, 2014

2013
On the Parameterized Complexity of Reconfiguration Problems.
CoRR, 2013

An Easy-to-use Scalable Framework for Parallel Recursive Backtracking.
CoRR, 2013

Parameterized Enumeration of (Locally-) Optimal Aggregations.
Proceedings of the Algorithms and Data Structures - 13th International Symposium, 2013

On the Parameterized Complexity of Reconfiguration Problems.
Proceedings of the Parameterized and Exact Computation - 8th International Symposium, 2013

2012
Finding an induced path of given parity in planar graphs in polynomial time.
Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

Enumerating Neighbour and Closest Strings.
Proceedings of the Parameterized and Exact Computation - 7th International Symposium, 2012

2008
Faster Fixed-Parameter Tractable Algorithms for Matching and Packing Problems.
Algorithmica, 2008

On the Parameterized Complexity of Layered Graph Drawing.
Algorithmica, 2008

2007
Subgraph isomorphism, log-bounded fragmentation, and graphs of (locally) bounded treewidth.
J. Comput. Syst. Sci., 2007

Solving #SAT using vertex covers.
Acta Inf., 2007

2006
A Fixed-Parameter Approach to 2-Layer Planarization.
Algorithmica, 2006

Solving #SAT Using Vertex Covers.
Proceedings of the Theory and Applications of Satisfiability Testing, 2006

2005
Fast fixed-parameter tractable algorithms for nontrivial generalizations of vertex cover.
Discrete Applied Mathematics, 2005

Embeddings of k-connected graphs of pathwidth k.
Discrete Applied Mathematics, 2005

Parameterized Counting Algorithms for General Graph Covering Problems.
Proceedings of the Algorithms and Data Structures, 9th International Workshop, 2005

2004
Approximation algorithms for classes of graphs excluding single-crossing graphs as minors.
J. Comput. Syst. Sci., 2004

Detecting Backdoor Sets with Respect to Horn and Binary Clauses.
Proceedings of the SAT 2004, 2004

Smaller Kernels for Hitting Set Problems of Constant Arity.
Proceedings of the Parameterized and Exact Computation, First International Workshop, 2004

Faster Fixed-Parameter Tractable Algorithms for Matching and Packing Problems.
Proceedings of the Algorithms, 2004

2003
On the parameterized complexity of the generalized rush hour puzzle.
Proceedings of the 15th Canadian Conference on Computational Geometry, 2003

2002
On Graph Powers for Leaf-Labeled Trees.
J. Algorithms, 2002

Subgraph Isomorphism, log-Bounded Fragmentation and Graphs of (Locally) Bounded Treewidth.
Proceedings of the Mathematical Foundations of Computer Science 2002, 2002

2001
Fast approximation schemes for K3, 3-minor-free or K5-minor-free graphs.
Electronic Notes in Discrete Mathematics, 2001

Fast Fixed-Parameter Tractable Algorithms for Nontrivial Generalizations of Vertex Cover.
Proceedings of the Algorithms and Data Structures, 7th International Workshop, 2001

A Fixed-Parameter Approach to Two-Layer Planarization.
Proceedings of the Graph Drawing, 9th International Symposium, 2001


2000
Finding Smallest Supertrees Under Minor Containment.
Int. J. Found. Comput. Sci., 2000

On Graph Powers for Leaf-Labeled Trees.
Proceedings of the Algorithm Theory, 2000

Embeddings of k-Connected Graphs of Pathwidth k.
Proceedings of the Algorithm Theory, 2000

1999
Finding Smallest Supertrees Under Minor Containment.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1999

1998
Characterizing Multiterminal Flow Networks and Computing Flows in Networks of Small Treewidth.
J. Comput. Syst. Sci., 1998

Interval Routing on k-Trees.
J. Algorithms, 1998

Finding Largest Subtrees and Smallest Supertrees.
Algorithmica, 1998

1996
The Complexity of Subgraph Isomorphism for Classes of Partial k-Trees.
Theor. Comput. Sci., 1996

Pointers versus Arithmetic in PRAMs.
J. Comput. Syst. Sci., 1996

Characterizing the Complexity of Subgraph Isomorphism for Graphs of Bounded Path-Width.
Proceedings of the STACS 96, 1996

µDatabase: Parallelism in a Memory-Mapped Environment.
SPAA, 1996

Interval Routing on k-trees.
Proceedings of the SIROCCO'96, 1996

Parallel Pointer-Based Join Algorithms in Memory-mapped Environments.
Proceedings of the Twelfth International Conference on Data Engineering, February 26, 1996

1995
Efficient Asynchronous Simulation of a Class of Synchronous Parallel Algorithms.
J. Comput. Syst. Sci., 1995

The Parallel Complexity of Tree Embedding Problems.
J. Algorithms, 1995

Finding Largest Common Embeddable Subtrees.
STACS, 1995

Characterizations of k-Terminal Flow Networks and Computing Network Flows in Partial k-Trees.
Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 1995

finding Smallest Supertrees.
Proceedings of the Algorithms and Computation, 6th International Symposium, 1995

1994
Restricted CRCW PRAM.
Theor. Comput. Sci., 1994

A Model for Asynchronous Shared Memory Parallel Computation.
SIAM J. Comput., 1994

Sequential and Parallel Algorithms for Embedding Problems on Classes of Partial k-Trees.
Proceedings of the Algorithm Theory, 1994

1993
Pointers versus Arithmetic in PRAMs.
Proceedings of the Eigth Annual Structure in Complexity Theory Conference, 1993

1992
The Parallel Complexity of Tree Embedding Problems (Extended Abstract).
Proceedings of the STACS 92, 1992

1991
Asynchronous shared memory parallel computation (preliminary version).
SIGARCH Computer Architecture News, 1991

1990
Asynchronous Shared Memory Parallel Computation.
SPAA, 1990

1989
Complexity Issues in Tree-Based Version Control.
Proceedings of the Algorithms and Data Structures, 1989


  Loading...