Pages that link to "Item:Q703534"

The following pages link to On the complexity of fixed parameter clique and dominating set (Q703534):

Displaying 45 items.

• Arboricity, \(h\)-index, and dynamic algorithms (Q418737) (← links)
• Finding and counting cliques and independent sets in \(r\)-uniform hypergraphs (Q845699) (← links)
• Induced subgraph isomorphism: are some patterns substantially easier than others? (Q888440) (← links)
• Efficient algorithms for clique problems (Q976087) (← links)
• Are unique subgraphs not easier to find? (Q1707980) (← links)
• Hardness of RNA folding problem with four symbols (Q1711829) (← links)
• A fast deterministic detection of small pattern graphs in graphs without large cliques (Q1740697) (← links)
• On the query complexity of clique size and maximum satisfiability (Q1816736) (← links)
• Algebraic methods in the congested clique (Q2010605) (← links)
• Beating treewidth for average-case subgraph isomorphism (Q2041983) (← links)
• Detecting and enumerating small induced subgraphs in \(c\)-closed graphs (Q2043376) (← links)
• Open problems around exact algorithms (Q2473037) (← links)
• Map graphs having witnesses of large girth (Q2632022) (← links)
• (Q2721971) (← links)
• Counting Subgraphs in Relational Event Graphs (Q2803823) (← links)
• Unique subgraphs are not easier to find (Q2855752) (← links)
• A Fast Deterministic Detection of Small Pattern Graphs in Graphs Without Large Cliques (Q2980911) (← links)
• (Q3121527) (← links)
• The h-Index of a Graph and Its Application to Dynamic Subgraph Statistics (Q3183462) (← links)
• If the Current Clique Algorithms Are Optimal, so Is Valiant's Parser (Q4562283) (← links)
• Matching Triangles and Basing Hardness on an Extremely Popular Conjecture (Q4571929) (← links)
• (Q5002697) (← links)
• Logical complexity of induced subgraph isomorphism for certain families of graphs (Q5003303) (← links)
• (Q5090377) (← links)
• (Q5090953) (← links)
• (Q5091007) (← links)
• (Q5091155) (← links)
• Fine-Grained Reductions and Quantum Speedups for Dynamic Programming. (Q5091156) (← links)
• A Simple Gap-Producing Reduction for the Parameterized Set Cover Problem (Q5091240) (← links)
• Finding small satisfying assignments faster than brute force: a fine-grained perspective into boolean constraint satisfaction (Q5092478) (← links)
• On Approximating the Number of $k$-Cliques in Sublinear Time (Q5115700) (← links)
• On the Parameterized Complexity of Approximating Dominating Set (Q5215462) (← links)
• Exact Weight Subgraphs and the k-Sum Conjecture (Q5326545) (← links)
• Detecting and Counting Small Pattern Graphs (Q5502097) (← links)
• Graph Pattern Detection: Hardness for all Induced Patterns and Faster Noninduced Cycles (Q5860479) (← links)
• Counting Subgraphs in Degenerate Graphs (Q5889797) (← links)
• Approximately Counting Independent Sets of a Given Size in Bounded-Degree Graphs (Q5890038) (← links)
• When can graph hyperbolicity be computed in linear time? (Q5915992) (← links)
• Rare siblings speed-up deterministic detection and counting of small pattern graphs (Q5925690) (← links)
• Intersection graphs of non-crossing paths (Q6041577) (← links)
• A faster interior-point method for sum-of-squares optimization (Q6053475) (← links)
• Streaming deletion problems Parameterized by vertex cover (Q6057830) (← links)
• On linear algebraic algorithms for the subgraph matching problem and its variants (Q6164954) (← links)
• Faster combinatorial \(k\)-clique algorithms (Q6547932) (← links)
• Finding and counting small tournaments in large tournaments (Q6652454) (← links)