The PACE 2017 parameterized algorithms and computational experiments challenge: the second iteration
From MaRDI portal
Publication:5111890
Recommendations
- The PACE 2018 parameterized algorithms and computational experiments challenge: the third iteration
- Computing tree width: from theory to practice and back
- Solving graph problems via potential maximal cliques: an experimental evaluation of the Bouchitté-Todinca algorithm
- Positive-instance driven dynamic programming for treewidth
- Positive-instance driven dynamic programming for treewidth
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- A Benders approach to the minimum chordal completion problem
- A Polynomial Approximation Algorithm for the Minimum Fill-In Problem
- A characterisation of rigid circuit graphs
- A faster algorithm for dominating set analyzed by the potential method
- All structured programs have small tree width and good register allocation
- Answer set solving with bounded treewidth revisited
- Computing the Minimum Fill-In is NP-Complete
- Computing treewidth on the GPU
- Decomposition by clique separators
- DynASP2.5: Dynamic Programming on Tree Decompositions in Action
- Exact Algorithms for Treewidth and Minimum Fill-In
- Faster parameterized algorithms for \textsc{Minimum Fill-in}
- Fixed-parameter tractability of graph modification problems for hereditary properties
- Integrally Closed Domains, Minimal Polynomials, and Null Ideals of Matrices
- Jdrasil: a modular library for computing tree decompositions
- On the treewidth of toroidal grids
- Optimal reachability and a space-time tradeoff for distance queries in constant-treewidth graphs
- Positive-instance driven dynamic programming for treewidth
- SAT-encodings for special treewidth and pathwidth
- Subexponential parameterized algorithm for minimum fill-in
- Tractability of Parameterized Completion Problems on Chordal, Strongly Chordal, and Proper Interval Graphs
- Treewidth and minimum fill-in: Grouping the minimal separators
- Turbocharging treewidth heuristics
- \textsc{ToTo}: an open database for computation, storage and retrieval of tree decompositions
Cited in
(30)- Proof complexity of symbolic QBF reasoning
- Treewidth-aware reductions of normal \textsc{ASP} to \textsc{SAT} - is normal \textsc{ASP} Harder than \textsc{SAT} after all?
- Solving graph problems via potential maximal cliques: an experimental evaluation of the Bouchitté-Todinca algorithm
- Computing partial hypergraphs of bounded width
- On integer linear programs for treewidth based on perfect elimination orderings
- Finding optimal triangulations parameterized by edge clique cover
- Exploiting Database Management Systems and Treewidth for Counting
- The PACE 2021 parameterized algorithms and computational experiments challenge: cluster editing
- The PACE 2020 Parameterized Algorithms and Computational Experiments Challenge: Treedepth.
- Graph and string parameters: connections between pathwidth, cutwidth and the locality number
- Decoding tree decompositions from permutations
- Efficient Knowledge Compilation Beyond Weighted Model Counting
- Experimental Analysis of Treewidth
- Practical access to dynamic programming on tree decompositions
- Efficient interprocedural data-flow analysis using treedepth and treewidth
- Practical access to dynamic programming on tree decompositions
- scientific article; zbMATH DE number 7764113 (Why is no real title available?)
- scientific article; zbMATH DE number 7286685 (Why is no real title available?)
- As Time Goes By: Reflections on Treewidth for Temporal Graphs
- Computing Tree Decompositions
- Solving projected model counting by utilizing treewidth and its limits
- The tree-width of C
- Finding Hamiltonian cycle in graphs of bounded treewidth. Experimental evaluation
- The algorithm selection competitions 2015 and 2017
- Parameterized algorithms and data reduction for the short secluded s‐t‐path problem
- The PACE 2018 parameterized algorithms and computational experiments challenge: the third iteration
- An analysis of the parameterized complexity of periodic timetabling
- IASCAR: incremental answer set counting by anytime refinement
- scientific article; zbMATH DE number 7378698 (Why is no real title available?)
- DynASP2.5: Dynamic Programming on Tree Decompositions in Action
This page was built for publication: The PACE 2017 parameterized algorithms and computational experiments challenge: the second iteration
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5111890)
