The following pages link to Naomi Nishimura (Q346507):
Displaying 50 items.
- Reconfiguration of dominating sets (Q346508) (← links)
- Homotopy types and Nielsen numbers of periodic homotopy idempotents on tori (Q499948) (← links)
- The complexity of dominating set reconfiguration (Q517018) (← links)
- On the parameterized complexity of reconfiguration problems (Q527426) (← links)
- The complexity of subgraph isomorphism for classes of partial k-trees (Q671437) (← links)
- Subgraph isomorphism, log-bounded fragmentation, and graphs of (locally) bounded treewidth (Q881594) (← links)
- (Q958206) (redirect page) (← links)
- Faster fixed-parameter tractable algorithms for matching and packing problems (Q958209) (← links)
- On the parameterized complexity of layered graph drawing (Q958215) (← links)
- Characterizing multiterminal flow networks and computing flows in networks of small treewidth (Q1278042) (← links)
- Restricted CRCW PRAMs (Q1314395) (← links)
- Finding largest subtrees and smallest supertrees (Q1387834) (← links)
- Graph editing to a given neighbourhood degree list is fixed-parameter tractable (Q1708604) (← links)
- On directed covering and domination problems (Q1735678) (← links)
- Embeddings of \(k\)-connected graphs of pathwidth \(k\) (Q1764809) (← links)
- Pointers versus arithmetic in PRAMs (Q1816730) (← links)
- Approximation algorithms for classes of graphs excluding single-crossing graphs as minors (Q1880778) (← links)
- Efficient asynchronous simulation of a class of synchronous parallel algorithms (Q1892209) (← links)
- Parameterized complexity of reconfiguration of atoms (Q2154105) (← links)
- Introduction to reconfiguration (Q2331456) (← links)
- Solving \#SAT using vertex covers (Q2464035) (← links)
- A fixed-parameter approach to 2-layer planarization (Q2498928) (← links)
- Fast fixed-parameter tractable algorithms for nontrivial generalizations of vertex cover (Q2576350) (← links)
- (Q2721972) (← links)
- (Q2721973) (← links)
- On Graph Powers for Leaf-Labeled Trees (Q2777607) (← links)
- Computing Weak Consistency in Polynomial Time (Q2796276) (← links)
- Parameterized Enumeration of (Locally-) Optimal Aggregations (Q2842187) (← links)
- Vertex Cover Reconfiguration and Beyond (Q2942651) (← links)
- The Complexity of Bounded Length Graph Recoloring and CSP Reconfiguration (Q2946012) (← links)
- Reconfiguration over Tree Decompositions (Q2946023) (← links)
- (Q3043700) (← links)
- Fast approximation schemes for K3, 3-minor-free or K5-minor-free graphs (Q3438969) (← links)
- Shortest Reconfiguration Paths in the Solution Space of Boolean Formulas (Q3448854) (← links)
- The Complexity of Dominating Set Reconfiguration (Q3449837) (← links)
- (Q4028909) (← links)
- A Model for Asynchronous Shared Memory Parallel Computation (Q4327420) (← links)
- The Parallel Complexity of Tree Embedding Problems (Q4327818) (← links)
- Interval Routing onk-Trees (Q4386452) (← links)
- Characterizing the complexity of subgraph isomorphism for graphs of bounded path-width (Q4593952) (← links)
- Finding largest common embeddable subtrees (Q4596639) (← links)
- Computing $k$-Atomicity in Polynomial Time (Q4637504) (← links)
- (Q4708579) (← links)
- (Q4778544) (← links)
- (Q4796197) (← links)
- (Q4886100) (← links)
- Enumerating Neighbour and Closest Strings (Q4899258) (← links)
- (Q4944989) (← links)
- (Q5005179) (← links)
- Sequential and parallel algorithms for embedding problems on classes of partial k-trees (Q5054759) (← links)
