Naomi Nishimura

Proceedings of the WALCOM: Algorithms and Computation, 2024

Reconfiguration of Multisets with Applications to Bin Packing.

[BibT_eX]

[DOI]

Proceedings of the WALCOM: Algorithms and Computation, 2024

2022

Incremental optimization of independent sets under the reconfiguration framework.

[BibT_eX]

[DOI]

J. Comb. Optim., 2022

A survey on the parameterized complexity of the independent set and (connected) dominating set reconfiguration problems.

[BibT_eX]

[DOI]

CoRR, 2022

Parameterized Complexity of Reconfiguration of Atoms.

[BibT_eX]

[DOI]

Proceedings of the WALCOM: Algorithms and Computation, 2022

2020

Reconfiguring spanning and induced subgraphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

2019

On directed covering and domination problems.

[BibT_eX]

[DOI]

Tesshu Hanaka

Hirotaka Ono

Discret. Appl. Math., 2019

2018

Computing k-Atomicity in Polynomial Time.

[BibT_eX]

[DOI]

Wojciech M. Golab

Xiaozhou (Steve) Li

Alejandro López-Ortiz

SIAM J. Comput., 2018

Incremental Optimization of Independent Sets under Reachability Constraints.

[BibT_eX]

[DOI]

CoRR, 2018

Introduction to Reconfiguration.

[BibT_eX]

[DOI]

Algorithms, 2018

Vertex Cover Reconfiguration and Beyond.

[BibT_eX]

[DOI]

Algorithms, 2018

Reconfiguration of Graph Minors.

[BibT_eX]

[DOI]

Benjamin R. Moore

Vijay Subramanya

Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science, 2018

2017

Shortest Reconfiguration Paths in the Solution Space of Boolean Formulas.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2017

On the Parameterized Complexity of Reconfiguration Problems.

[BibT_eX]

[DOI]

Algorithmica, 2017

Graph Editing to a Given Neighbourhood Degree List is Fixed-Parameter Tractable.

[BibT_eX]

[DOI]

Vijay Subramanya

Proceedings of the Combinatorial Optimization and Applications, 2017

2016

The complexity of dominating set reconfiguration.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2016

Reconfiguration of dominating sets.

[BibT_eX]

[DOI]

Akira Suzuki

Amer E. Mouawad

J. Comb. Optim., 2016

2015

On scalable parallel recursive backtracking.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 2015

Computing Weak Consistency in Polynomial Time: [Extended Abstract].

[BibT_eX]

[DOI]

Wojciech M. Golab

Xiaozhou (Steve) Li

Alejandro López-Ortiz

Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, 2015

2014

Reconfiguration over Tree Decompositions.

[BibT_eX]

[DOI]

Proceedings of the Parameterized and Exact Computation - 9th International Symposium, 2014

The Complexity of Bounded Length Graph Recoloring and CSP Reconfiguration.

[BibT_eX]

[DOI]

Proceedings of the Parameterized and Exact Computation - 9th International Symposium, 2014

Vertex Cover Reconfiguration and Beyond.

[BibT_eX]

[DOI]

Amer E. Mouawad

Venkatesh Raman

Proceedings of the Algorithms and Computation - 25th International Symposium, 2014

2013

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

[BibT_eX]

[DOI]

CoRR, 2013

Parameterized Enumeration of (Locally-) Optimal Aggregations.

[BibT_eX]

[DOI]

Narges Simjour

Proceedings of the Algorithms and Data Structures - 13th International Symposium, 2013

2012

Finding an induced path of given parity in planar graphs in polynomial time.

[BibT_eX]

[DOI]

Marcin Kaminski

Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

Enumerating Neighbour and Closest Strings.

[BibT_eX]

[DOI]

Narges Simjour

Proceedings of the Parameterized and Exact Computation - 7th International Symposium, 2012

2008

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

[BibT_eX]

[DOI]

Sue Whitesides

Algorithmica, 2008

On the Parameterized Complexity of Layered Graph Drawing.

[BibT_eX]

[DOI]

Algorithmica, 2008

2007

Subgraph isomorphism, log-bounded fragmentation, and graphs of (locally) bounded treewidth.

[BibT_eX]

[DOI]

MohammadTaghi Hajiaghayi

J. Comput. Syst. Sci., 2007

Solving #SAT using vertex covers.

[BibT_eX]

[DOI]

Stefan Szeider

Acta Informatica, 2007

2006

A Fixed-Parameter Approach to 2-Layer Planarization.

[BibT_eX]

[DOI]

Algorithmica, 2006

2005

Fast fixed-parameter tractable algorithms for nontrivial generalizations of vertex cover.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2005

Embeddings of k-connected graphs of pathwidth k.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2005

Parameterized Counting Algorithms for General Graph Covering Problems.

[BibT_eX]

[DOI]

Mohammad Taghi Hajiaghayi

Proceedings of the Algorithms and Data Structures, 9th International Workshop, 2005

2004

Approximation algorithms for classes of graphs excluding single-crossing graphs as minors.

[BibT_eX]

[DOI]

Erik D. Demaine

J. Comput. Syst. Sci., 2004

Detecting Backdoor Sets with Respect to Horn and Binary Clauses.

[BibT_eX]

[DOI]

Stefan Szeider

Proceedings of the SAT 2004, 2004

Smaller Kernels for Hitting Set Problems of Constant Arity.

[BibT_eX]

[DOI]

Proceedings of the Parameterized and Exact Computation, First International Workshop, 2004

2003

On the parameterized complexity of the generalized rush hour puzzle.

[BibT_eX]

[DOI]

Proceedings of the 15th Canadian Conference on Computational Geometry, 2003

2002

On Graph Powers for Leaf-Labeled Trees.

[BibT_eX]

[DOI]

Mohammad Taghi Hajiaghayi

J. Algorithms, 2002

2001

Fast approximation schemes for K3, 3-minor-free or K5-minor-free graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2001

A Fixed-Parameter Approach to Two-Layer Planarization.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 9th International Symposium, 2001

On the Parameterized Complexity of Layered Graph Drawing.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2001

2000

Finding Smallest Supertrees Under Minor Containment.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2000

1998

Characterizing Multiterminal Flow Networks and Computing Flows in Networks of Small Treewidth.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1998

Interval Routing on k-Trees.

[BibT_eX]

[DOI]

Lata Narayanan

J. Algorithms, 1998

Finding Largest Subtrees and Smallest Supertrees.

[BibT_eX]

[DOI]

Algorithmica, 1998

1996

The Complexity of Subgraph Isomorphism for Classes of Partial k-Trees.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1996

Pointers versus Arithmetic in PRAMs.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1996

Characterizing the Complexity of Subgraph Isomorphism for Graphs of Bounded Path-Width.

[BibT_eX]

[DOI]

Proceedings of the STACS 96, 1996

µDatabase: Parallelism in a Memory-Mapped Environment.

[BibT_eX]

[DOI]

Proceedings of the 8th Annual ACM Symposium on Parallel Algorithms and Architectures, 1996

Parallel Pointer-Based Join Algorithms in Memory-mapped Environments.

[BibT_eX]

[DOI]

Proceedings of the Twelfth International Conference on Data Engineering, February 26, 1996

1995

Efficient Asynchronous Simulation of a Class of Synchronous Parallel Algorithms.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1995

The Parallel Complexity of Tree Embedding Problems.

[BibT_eX]

[DOI]

J. Algorithms, 1995

Finding Largest Common Embeddable Subtrees.

[BibT_eX]

[DOI]

Proceedings of the STACS 95, 1995

Characterizations of k-Terminal Flow Networks and Computing Network Flows in Partial k-Trees.

[BibT_eX]

[DOI]

Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 1995

finding Smallest Supertrees.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 6th International Symposium, 1995

1994

Restricted CRCW PRAM.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1994

A Model for Asynchronous Shared Memory Parallel Computation.

[BibT_eX]

[DOI]

SIAM J. Comput., 1994

Sequential and Parallel Algorithms for Embedding Problems on Classes of Partial k-Trees.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Theory, 1994

1992

The Parallel Complexity of Tree Embedding Problems (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the STACS 92, 1992

1991

Asynchrony in shared memory parallel computation.

[BibT_eX]

[DOI]

PhD thesis, 1991

Asynchronous shared memory parallel computation (preliminary version).

[BibT_eX]

[DOI]

SIGARCH Comput. Archit. News, 1991

1990

Asynchronous Shared Memory Parallel Computation.

[BibT_eX]

[DOI]

Proceedings of the 2nd Annual ACM Symposium on Parallel Algorithms and Architectures, 1990

1989

Complexity Issues in Tree-Based Version Control.

[BibT_eX]

[DOI]