scientific article; zbMATH DE number 7205214
From MaRDI portal
Publication:5111890
DOI10.4230/LIPICS.IPEC.2017.30zbMATH Open1443.68220MaRDI QIDQ5111890FDOQ5111890
Nimrod Talmon, Holger Dell, Mathias Weller, Christian Komusiewicz
Publication date: 27 May 2020
Title of this publication is not available (Why is that?)
Cites Work
- DynASP2.5: Dynamic Programming on Tree Decompositions in Action
- Jdrasil: A Modular Library for Computing Tree Decompositions
- Title not available (Why is that?)
- Title not available (Why is that?)
- Integrally Closed Domains, Minimal Polynomials, and Null Ideals of Matrices
- Fixed-parameter tractability of graph modification problems for hereditary properties
- Decomposition by clique separators
- Treewidth and minimum fill-in: Grouping the minimal separators
- Exact Algorithms for Treewidth and Minimum Fill-In
- Computing the Minimum Fill-In is NP-Complete
- Tractability of Parameterized Completion Problems on Chordal, Strongly Chordal, and Proper Interval Graphs
- Subexponential Parameterized Algorithm for Minimum Fill-In
- A Faster Algorithm for Dominating Set Analyzed by the Potential Method
- A characterisation of rigid circuit graphs
- All structured programs have small tree width and good register allocation
- \textsc{ToTo}: an open database for computation, storage and retrieval of tree decompositions
- A Polynomial Approximation Algorithm for the Minimum Fill-In Problem
- Faster parameterized algorithms for \textsc{Minimum Fill-in}
- Answer set solving with bounded treewidth revisited
- On the treewidth of toroidal grids
- SAT-encodings for special treewidth and pathwidth
- Positive-instance driven dynamic programming for treewidth
- A Benders Approach to the Minimum Chordal Completion Problem
- Optimal Reachability and a Space-Time Tradeoff for Distance Queries in Constant-Treewidth Graphs
- Computing treewidth on the GPU
Cited In (29)
- Solving Graph Problems via Potential Maximal Cliques
- IASCAR: incremental answer set counting by anytime refinement
- Title not available (Why is that?)
- Title not available (Why is that?)
- Exploiting Database Management Systems and Treewidth for Counting
- The algorithm selection competitions 2015 and 2017
- Finding Hamiltonian Cycle in Graphs of Bounded Treewidth
- Solving projected model counting by utilizing treewidth and its limits
- Practical access to dynamic programming on tree decompositions
- Efficient interprocedural data-flow analysis using treedepth and treewidth
- Computing Tree Decompositions
- An analysis of the parameterized complexity of periodic timetabling
- Title not available (Why is that?)
- On integer linear programs for treewidth based on perfect elimination orderings
- DynASP2.5: Dynamic Programming on Tree Decompositions in Action
- Finding optimal triangulations parameterized by edge clique cover
- Proof complexity of symbolic QBF reasoning
- Practical Access to Dynamic Programming on Tree Decompositions
- Treewidth-aware reductions of normal \textsc{ASP} to \textsc{SAT} - is normal \textsc{ASP} Harder than \textsc{SAT} after all?
- Efficient Knowledge Compilation Beyond Weighted Model Counting
- Experimental Analysis of Treewidth
- The tree-width of C
- The PACE 2020 Parameterized Algorithms and Computational Experiments Challenge: Treedepth.
- Title not available (Why is that?)
- As Time Goes By: Reflections on Treewidth for Temporal Graphs
- Computing partial hypergraphs of bounded width
- Parameterized algorithms and data reduction for the short secluded s‐t‐path problem
- Title not available (Why is that?)
- Decoding tree decompositions from permutations
Uses Software
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 Q5111890)
