The following pages link to (Q3688439):
Displaying 50 items.
- Finding and counting small induced subgraphs efficiently (Q294749) (← links)
- An improved algorithm for Klee's measure problem on fat boxes (Q419375) (← links)
- Method for quickly inferring the mechanisms of large-scale complex networks based on the census of subgraph concentrations (Q473025) (← links)
- Efficient algorithms for the \textsc{max~\(k\)-vertex cover problem} (Q489714) (← links)
- Finding and counting given length cycles (Q675293) (← links)
- Advice classes of parametrized tractability (Q676315) (← links)
- On first-order definitions of subgraph isomorphism properties (Q679970) (← links)
- On the complexity of fixed parameter clique and dominating set (Q703534) (← links)
- The complexity ecology of parameters: An illustration using bounded max leaf number (Q733736) (← links)
- Improved simulation of nondeterministic Turing machines (Q764330) (← links)
- Finding and counting cliques and independent sets in \(r\)-uniform hypergraphs (Q845699) (← links)
- Strong computational lower bounds via parameterized complexity (Q856413) (← links)
- Graph factors and factorization: 1985--2003: a survey (Q868347) (← links)
- Induced subgraph isomorphism: are some patterns substantially easier than others? (Q888440) (← links)
- Sublinear separators, fragility and subexponential expansion (Q896068) (← links)
- On low tree-depth decompositions (Q897253) (← links)
- The complexity of regular subgraph recognition (Q912615) (← links)
- Very large cliques are easy to detect (Q932700) (← links)
- Efficient algorithms for clique problems (Q976087) (← links)
- A (slightly) faster algorithm for Klee's measure problem (Q1037647) (← links)
- A note on the complexity of finding regular subgraphs (Q1059641) (← links)
- The monotone circuit complexity of Boolean functions (Q1094870) (← links)
- Parameterized circuit complexity and the \(W\) hierarchy (Q1127315) (← links)
- On the complexity of the k-chain subgraph cover problem (Q1275070) (← links)
- On the complexity of finite subgraphs of the curve graph (Q1626407) (← links)
- Pushdown reachability with constant treewidth (Q1675921) (← links)
- Are unique subgraphs not easier to find? (Q1707980) (← links)
- Efficient algorithms for subgraph listing (Q1736617) (← links)
- A fast deterministic detection of small pattern graphs in graphs without large cliques (Q1740697) (← links)
- Computing the number of induced copies of a fixed graph in a bounded degree graph (Q1741847) (← links)
- Special issues on The satisfiability problem (pp. 1--244) including papers from the 1st workshop on satisfiability, Certosa di Pontignano, Italy, April 29--May 3, 1996 and Boolean functions (pp. 245--479) (Q1961443) (← links)
- Algebraic methods in the congested clique (Q2010605) (← links)
- Beating treewidth for average-case subgraph isomorphism (Q2041983) (← links)
- Faster algorithms for counting subgraphs in sparse graphs (Q2041986) (← links)
- Large clique is hard on average for resolution (Q2117104) (← links)
- Some aspects of the database resilience (Q2119956) (← links)
- First-order definitions of subgraph isomorphism through the adjacency and order relations (Q2211263) (← links)
- New tools and connections for exponential-time approximation (Q2272598) (← links)
- Grad and classes with bounded expansion. II: Algorithmic aspects (Q2426457) (← links)
- On the sum-max graph partitioning problem (Q2453173) (← links)
- Open problems around exact algorithms (Q2473037) (← links)
- Tight lower bounds for certain parameterized NP-hard problems (Q2568440) (← links)
- Parameterized computation and complexity: a new approach dealing with NP-hardness (Q2576825) (← links)
- A new algorithm for optimal 2-constraint satisfaction and its implications (Q2581276) (← links)
- Counting Subgraphs in Relational Event Graphs (Q2803823) (← links)
- Algorithms on subgraph overlap graphs (Q2875683) (← links)
- Many Facets of Dualities (Q2971613) (← links)
- A Fast Deterministic Detection of Small Pattern Graphs in Graphs Without Large Cliques (Q2980911) (← links)
- The Complexity of Acyclic Subhypergraph Problems (Q3078379) (← links)
- (Q3121527) (← links)
