scientific article; zbMATH DE number 7561357
From MaRDI portal
Publication:5090992
DOI10.4230/LIPIcs.ISAAC.2018.3MaRDI QIDQ5090992
Publication date: 21 July 2022
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (1)
Cites Work
- Unnamed Item
- A simplified NP-complete satisfiability problem
- Pathwidth of cubic graphs and exact algorithms
- A probabilistic remark on algebraic program testing
- Algorithms for propositional model counting
- Faster exponential-time algorithms in graphs of bounded average degree
- The traveling salesman problem in bounded degree graphs
- An Improved Exact Algorithm for Cubic Graph TSP
- Fast Probabilistic Algorithms for Verification of Polynomial Identities
- Hamiltonian Cycles and Uniquely Edge Colourable Graphs
- Fast Hamiltonicity Checking Via Bases of Perfect Matchings
- Reducibility among Combinatorial Problems
- Directed Hamiltonicity and Out-Branchings via Generalized Laplacians
- A Bound on the Pathwidth of Sparse Graphs with Applications to Exact Algorithms
- The Traveling Salesman Problem for Cubic Graphs
- Determinant Sums for Undirected Hamiltonicity
- Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time
- Computing and Combinatorics
- Functional analysis
This page was built for publication:
