scientific article; zbMATH DE number 7561371
From MaRDI portal
Publication:5091007
DOI10.4230/LIPICS.ISAAC.2018.17MaRDI QIDQ5091007FDOQ5091007
Mikko Koivisto, Petteri Kaski, Thore Husfeldt, Andreas Björklund
Publication date: 21 July 2022
Title of this publication is not available (Why is that?)
Cites Work
- Powers of tensors and fast matrix multiplication
- Which problems have strongly exponential complexity?
- Mixing Color Coding-Related Techniques
- Multiplying matrices faster than coppersmith-winograd
- Finding and counting given length cycles
- Counting Paths and Packings in Halves
- Counting Thin Subgraphs via Packings Faster than Meet-in-the-Middle Time
- Paw-free graphs
- Finding and counting small induced subgraphs efficiently
- Title not available (Why is that?)
- Finding a Minimum Circuit in a Graph
- Faster algorithms for finding and counting subgraphs
- Understanding the Complexity of Induced Subgraph Isomorphisms
- The parameterised complexity of counting connected subgraphs and graph motifs
- Counting subgraphs via homomorphisms
- On the complexity of fixed parameter clique and dominating set
- Balanced families of perfect hash functions and their applications
- Operations with structures
- Some hard families of parameterized counting problems
- Homomorphisms are a good basis for counting small subgraphs
- The challenges of unbounded treewidth in parameterised subgraph counting problems
- If the Current Clique Algorithms Are Optimal, so Is Valiant's Parser
- Finding Four-Node Subgraphs in Triangle Time
- Finding, minimizing, and counting weighted subgraphs
- Counting Matchings of Size k Is $\sharp$ W[1]-Hard
- An algorithmic framework for fixed-cardinality optimization in sparse graphs applied to dense subgraph problems
- Deterministic polynomial-time approximation algorithms for partition functions and graph polynomials
- Detecting and Counting Small Pattern Graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5091007)
