Naomi Nishimura

From MaRDI portal
Person:346507

Available identifiers

zbMath Open nishimura.naomiMaRDI QIDQ346507

List of research outcomes

PublicationDate of PublicationType
Sequential and parallel algorithms for embedding problems on classes of partial k-trees2022-12-09Paper
The parallel complexity of tree embedding problems (extended abstract)2022-08-18Paper
Incremental optimization of independent sets under the reconfiguration framework2022-07-18Paper
Parameterized complexity of reconfiguration of atoms2022-07-13Paper
A survey on the parameterized complexity of the independent set and (connected) dominating set reconfiguration problems2022-04-22Paper
https://portal.mardi4nfdi.de/entity/Q50051792021-08-04Paper
On Directed Covering and Domination Problems2020-11-25Paper
Incremental optimization of independent sets under the reconfiguration framework2020-02-24Paper
Reconfiguring spanning and induced subgraphs2020-01-16Paper
Introduction to reconfiguration2019-10-29Paper
https://portal.mardi4nfdi.de/entity/Q57434282019-05-10Paper
On directed covering and domination problems2019-03-28Paper
Reconfiguring spanning and induced subgraphs2018-10-04Paper
Computing $k$-Atomicity in Polynomial Time2018-04-24Paper
Reconfiguration of graph minors2018-04-24Paper
Graph editing to a given neighbourhood degree list is fixed-parameter tractable2018-03-26Paper
Finding largest common embeddable subtrees2017-12-04Paper
Characterizing the complexity of subgraph isomorphism for graphs of bounded path-width2017-11-16Paper
Shortest Reconfiguration Paths in the Solution Space of Boolean Formulas2017-09-27Paper
On the parameterized complexity of reconfiguration problems2017-05-11Paper
The complexity of dominating set reconfiguration2017-03-16Paper
Reconfiguration of dominating sets2016-11-29Paper
Computing Weak Consistency in Polynomial Time2016-03-23Paper
The Complexity of Dominating Set Reconfiguration2015-10-30Paper
Shortest Reconfiguration Paths in the Solution Space of Boolean Formulas2015-10-27Paper
Homotopy types and Nielsen numbers of periodic homotopy idempotents on tori2015-10-07Paper
The Complexity of Bounded Length Graph Recoloring and CSP Reconfiguration2015-09-15Paper
Reconfiguration over Tree Decompositions2015-09-15Paper
Vertex Cover Reconfiguration and Beyond2015-09-11Paper
FINDING SMALLEST SUPERTREES UNDER MINOR CONTAINMENT2015-04-29Paper
Reconfiguration of dominating sets2014-09-26Paper
On the parameterized complexity of reconfiguration problems2013-12-10Paper
Parameterized Enumeration of (Locally-) Optimal Aggregations2013-08-12Paper
Enumerating Neighbour and Closest Strings2013-01-07Paper
Faster fixed-parameter tractable algorithms for matching and packing problems2008-12-02Paper
On the parameterized complexity of layered graph drawing2008-12-02Paper
Solving \#SAT using vertex covers2007-12-10Paper
Solving #SAT Using Vertex Covers2007-09-04Paper
Subgraph isomorphism, log-bounded fragmentation, and graphs of (locally) bounded treewidth2007-05-30Paper
Fast approximation schemes for K3, 3-minor-free or K5-minor-free graphs2007-05-29Paper
Algorithms and Data Structures2006-10-25Paper
A fixed-parameter approach to 2-layer planarization2006-08-11Paper
Fast fixed-parameter tractable algorithms for nontrivial generalizations of vertex cover2005-12-27Paper
Parameterized and Exact Computation2005-08-23Paper
Algorithms – ESA 20042005-08-18Paper
Embeddings of \(k\)-connected graphs of pathwidth \(k\)2005-02-22Paper
Approximation algorithms for classes of graphs excluding single-crossing graphs as minors2004-10-01Paper
https://portal.mardi4nfdi.de/entity/Q30437002004-08-06Paper
https://portal.mardi4nfdi.de/entity/Q47085792003-06-18Paper
https://portal.mardi4nfdi.de/entity/Q47961972003-03-02Paper
https://portal.mardi4nfdi.de/entity/Q47785442002-11-18Paper
On Graph Powers for Leaf-Labeled Trees2002-03-07Paper
https://portal.mardi4nfdi.de/entity/Q27219722001-07-11Paper
https://portal.mardi4nfdi.de/entity/Q27219732001-07-11Paper
Efficient asynchronous simulation of a class of synchronous parallel algorithms2000-07-06Paper
https://portal.mardi4nfdi.de/entity/Q49449892000-03-22Paper
Characterizing multiterminal flow networks and computing flows in networks of small treewidth1999-02-21Paper
Interval Routing onk-Trees1998-06-23Paper
Finding largest subtrees and smallest supertrees1998-06-08Paper
Pointers versus arithmetic in PRAMs1997-03-31Paper
The complexity of subgraph isomorphism for classes of partial k-trees1997-02-27Paper
https://portal.mardi4nfdi.de/entity/Q48861001996-08-22Paper
The Parallel Complexity of Tree Embedding Problems1995-04-09Paper
A Model for Asynchronous Shared Memory Parallel Computation1995-04-06Paper
Restricted CRCW PRAMs1994-02-22Paper
https://portal.mardi4nfdi.de/entity/Q40289091993-03-28Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Naomi Nishimura