scientific article; zbMATH DE number 7559154
From MaRDI portal
Publication:5090495
DOI10.4230/LIPIcs.STACS.2019.45MaRDI QIDQ5090495
Robert Krauthgamer, Ohad Trabelsi
Publication date: 18 July 2022
Full work available at URL: https://arxiv.org/abs/1711.08041
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (3)
Tree-Depth and the Formula Complexity of Subgraph Isomorphism ⋮ A Faster Exponential Time Algorithm for Bin Packing With a Constant Number of Bins via Additive Combinatorics ⋮ Parameterized Pre-Coloring Extension and List Coloring Problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Constrained multilinear detection and generalized graph motifs
- On finding rainbow and colorful paths
- On the complexity of finding iso- and other morphisms for partial \(k\)- trees
- Faster algorithms for subgraph isomorphism of \(k\)-connected partial \(k\)-trees
- Which problems have strongly exponential complexity?
- Subgraph isomorphism for biconnected outerplanar graphs in cubic time
- Narrow sieves for parameterized paths and packings
- Matching Triangles and Basing Hardness on an Extremely Popular Conjecture
- Everything you always wanted to know about the parameterized complexity of Subgraph Isomorphism (but were afraid to ask).
- Dynamic Programming Treatment of the Travelling Salesman Problem
- A Dynamic Programming Approach to Sequencing Problems
- The Parity of Set Systems Under Random Restrictions with Applications to Exponential Time Problems
- On the Equivalence among Problems of Bounded Width
- Set Partitioning via Inclusion-Exclusion
- Partitioning into Sets of Bounded Cardinality
- Color-coding
- Tight Bounds for Graph Homomorphism and Subgraph Isomorphism
- Dynamic Parameterized Problems
- LIMITS and Applications of Group Algebras for Parameterized Problems
- On Problems as Hard as CNF-SAT
- Reducibility among Combinatorial Problems
- SETH-Based Lower Bounds for Subset Sum and Bicriteria Path
- Determinant Sums for Undirected Hamiltonicity
- Graph-Theoretic Concepts in Computer Science
- On the complexity of \(k\)-SAT
This page was built for publication:
