Pages that link to "Item:Q2817636"

The following pages link to Beyond <i>NP</i>-completeness for problems of bounded width (extended abstract) (Q2817636):

Displaying 41 items.

• Bandwidth of chain graphs (Q293476) (← links)
• An exponential time 2-approximation algorithm for bandwidth (Q392018) (← links)
• Bandwidth and distortion revisited (Q412348) (← links)
• Parameterized complexity and approximability of the longest compatible sequence problem (Q456697) (← links)
• Confronting intractability via parameters (Q465686) (← links)
• Bandwidth on AT-free graphs (Q650939) (← links)
• Exact and approximate bandwidth (Q708223) (← links)
• The complexity ecology of parameters: An illustration using bounded max leaf number (Q733736) (← links)
• Online promise problems with online width metrics (Q859981) (← links)
• Bandwidth of bipartite permutation graphs in polynomial time (Q1044045) (← links)
• Parameterized circuit complexity and the \(W\) hierarchy (Q1127315) (← links)
• Threshold dominating sets and an improved characterization of \(W[2]\) (Q1274918) (← links)
• On fixed-parameter tractability and approximability of NP optimization problems (Q1362338) (← links)
• The parameterized complexity of sequence alignment and consensus (Q1367540) (← links)
• Characterizations and algorithmic applications of chordal graph embeddings (Q1372739) (← links)
• The hardness of perfect phylogeny, feasible register assignment and other problems on thin colored graphs (Q1575712) (← links)
• Approximating the bandwidth via volume respecting embeddings (Q1577009) (← links)
• Fixed-parameter tractability and completeness. IV: On completeness for W\([\) P\(]\) and PSPACE analogues (Q1892937) (← links)
• \(W[2]\)-hardness of precedence constrained \(K\)-processor scheduling (Q1919171) (← links)
• The complexity of irredundant sets parameterized by size (Q1971218) (← links)
• From the \(W\)-hierarchy to XNLP. Classes of fixed parameter intractability (Q2154075) (← links)
• Alternative parameterizations of \textsc{Metric Dimension} (Q2285127) (← links)
• Parameterized computation and complexity: a new approach dealing with NP-hardness (Q2576825) (← links)
• Parameterized complexity of \textsc{bandwidth} of \textsc{caterpillars} and \textsc{weighted path emulation} (Q2672420) (← links)
• Myhill-Nerode Methods for Hypergraphs (Q2872101) (← links)
• The Birth and Early Years of Parameterized Complexity (Q2908529) (← links)
• A Basic Parameterized Complexity Primer (Q2908536) (← links)
• Graph Minors and Parameterized Algorithm Design (Q2908540) (← links)
• Surfing with Rod (Q2973715) (← links)
• The Proper Interval Colored Graph problem for caterpillar trees (Q3439122) (← links)
• Parameterized Complexity and Approximability of the SLCS Problem (Q3503583) (← links)
• On the proper intervalization of colored caterpillar trees (Q3653091) (← links)
• Well-Quasi-Orders in Subclasses of Bounded Treewidth Graphs (Q3656858) (← links)
• An Exponential Time 2-Approximation Algorithm for Bandwidth (Q3656860) (← links)
• Intervalizing k-colored graphs (Q4645169) (← links)
• Faster Exact Bandwidth (Q5302047) (← links)
• Bandwidth of Bipartite Permutation Graphs in Polynomial Time (Q5458530) (← links)
• Hardness of computing width parameters based on branch decompositions over the vertex set (Q5899662) (← links)
• On approximation intractability of the path-distance-width problem (Q5936467) (← links)
• Bandwidth and topological bandwidth of graphs with few \(P_4\)'s (Q5954243) (← links)
• On intervalizing \(k\)-colored graphs for DNA physical mapping (Q5961618) (← links)