Pages that link to "Item:Q4561499"
From MaRDI portal
The following pages link to Fast Hamiltonicity Checking Via Bases of Perfect Matchings (Q4561499):
Displayed 41 items.
- Edge bipartization faster than \(2^k\) (Q666655) (← links)
- On exploring always-connected temporal graphs of small pathwidth (Q1628692) (← links)
- Fixed-parameter algorithms for rectilinear Steiner tree and rectilinear traveling salesman problem in the plane (Q1651693) (← links)
- Clifford algebras meet tree decompositions (Q1725639) (← links)
- A note on equitable Hamiltonian cycles (Q1983122) (← links)
- Algebraic methods in the congested clique (Q2010605) (← links)
- Faster deterministic \textsc{Feedback Vertex Set} (Q2015151) (← links)
- On parameterized algorithms for fixed-order book thickness with respect to the pathwidth of the vertex ordering (Q2034395) (← links)
- Subexponential parameterized algorithms and kernelization on almost chordal graphs (Q2037110) (← links)
- On fixed-order book thickness parameterized by the pathwidth of the vertex ordering (Q2039665) (← links)
- Measuring what matters: a hybrid approach to dynamic programming with treewidth (Q2040028) (← links)
- Many-visits TSP revisited (Q2051856) (← links)
- A generic convolution algorithm for join operations on tree decompositions (Q2117110) (← links)
- Computing the chromatic number using graph decompositions via matrix rank (Q2330132) (← links)
- Speeding up dynamic programming with representative sets: an experimental evaluation of algorithms for Steiner Tree on tree decompositions (Q2343089) (← links)
- Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth (Q2347800) (← links)
- On the parameterized complexity of the connected flow and many visits TSP problem (Q2672424) (← links)
- A $c^k n$ 5-Approximation Algorithm for Treewidth (Q2799353) (← links)
- The Parity of Set Systems Under Random Restrictions with Applications to Exponential Time Problems (Q3448788) (← links)
- Known Algorithms for Edge Clique Cover are Probably Optimal (Q3464061) (← links)
- Matching Triangles and Basing Hardness on an Extremely Popular Conjecture (Q4571929) (← links)
- Finding Hamiltonian Cycle in Graphs of Bounded Treewidth (Q4984872) (← links)
- (Q5009461) (← links)
- (Q5009465) (← links)
- Computing the Chromatic Number Using Graph Decompositions via Matrix Rank (Q5009610) (← links)
- Algorithms for NP-Hard Problems via Rank-Related Parameters of Matrices (Q5042455) (← links)
- Fast Algorithms for Join Operations on Tree Decompositions (Q5042462) (← links)
- (Q5089192) (← links)
- (Q5090992) (← links)
- Measuring what Matters: A Hybrid Approach to Dynamic Programming with Treewidth. (Q5092404) (← links)
- Lower Bounds for Dynamic Programming on Planar Graphs of Bounded Cutwidth (Q5131225) (← links)
- Finding Hamiltonian Cycle in Graphs of Bounded Treewidth: Experimental Evaluation (Q5140740) (← links)
- Derandomizing Isolation in Space-Bounded Settings (Q5232318) (← links)
- On the Exact Complexity of Hamiltonian Cycle and q-Colouring in Disk Graphs (Q5283382) (← links)
- Spotting Trees with Few Leaves (Q5346548) (← links)
- (Q5495800) (redirect page) (← links)
- (Q5874519) (← links)
- Fast exact algorithms for survivable network design with uniform requirements (Q5918784) (← links)
- The Asymmetric Travelling Salesman Problem In Sparse Digraphs. (Q6089670) (← links)
- An ETH-Tight Exact Algorithm for Euclidean TSP (Q6156029) (← links)
- Hamiltonian Cycle Parameterized by Treedepth in Single Exponential Time and Polynomial Space (Q6170447) (← links)