SOFSEM 2005: Theory and Practice of Computer Science
From MaRDI portal
Recommendations
Cited in
(63)- Treewidth. Computations and approximations
- Computing tree width: from theory to practice and back
- Pushdown reachability with constant treewidth
- Reconfiguration in bounded bandwidth and tree-depth
- \(2K_2\)-partition of some classes of graphs
- Approximation algorithms via contraction decomposition
- Faster algorithms for quantitative verification in bounded treewidth graphs
- A parameterized view on the complexity of dependence logic
- Postman problems on series-parallel mixed graphs
- An improvement of Reed's treewidth approximation
- Algorithms for propositional model counting
- Positive-instance driven dynamic programming for graph searching
- On exteriority notions in book embeddings and treewidth
- Backdoors to tractable answer set programming
- Applying clique-decomposition for computing Gromov hyperbolicity
- Space saving by dynamic algebraization based on tree-depth
- Tractable cases of the extended global cardinality constraint
- Tree decompositions of graphs: saving memory in dynamic programming
- Tree decomposition and discrete optimization problems: a survey
- Introducing directed tree width
- The algorithmic theory of treewidth
- On planar graphs with large tree-width and small grid minors
- Fixed-parameter tractability of treewidth and pathwidth
- Parameters tied to treewidth
- Deleting edges to restrict the size of an epidemic: a new application for treewidth
- Algorithms for Propositional Model Counting
- Treewidth: Characterizations, Applications, and Computations
- A note on planar graphs with large width parameters and small grid-minors
- scientific article; zbMATH DE number 566078 (Why is no real title available?)
- Domino Treewidth
- Solving graph problems via potential maximal cliques: an experimental evaluation of the Bouchitté-Todinca algorithm
- scientific article; zbMATH DE number 1361465 (Why is no real title available?)
- The clique minimal separator decomposition of a hypergraph
- Seeing Arboretum for the (partial k-) Trees
- As Time Goes By: Reflections on Treewidth for Temporal Graphs
- Possible and Impossible Attempts to Solve the Treewidth Problem via ILPs
- Surprising Applications of Treewidth Bounds for Planar Graphs
- Experimental Analysis of Treewidth
- An improvement of Reed's treewidth approximation
- 3-manifold triangulations with small treewidth
- An Experimental Study of the Treewidth of Real-World Graph Data
- Computing treewidth on the GPU
- scientific article; zbMATH DE number 7236450 (Why is no real title available?)
- Computational aspects of treewidth for graph
- Minimum Fill-In and Treewidth of Split+ ke and Split+ kv Graphs
- Weighted Treewidth Algorithmic Techniques and Results
- Treewidth computations. II. Lower bounds
- On the \(\mathrm{AC}^0\) complexity of subgraph isomorphism
- Directed nowhere dense classes of graphs
- Tree decompositions and social graphs
- On the pathwidth of hyperbolic 3-manifolds
- Computing optimal hypertree decompositions with SAT
- Edge-treewidth: algorithmic and combinatorial properties
- Quasi-optimal recombination operator
- Separator theorem and algorithms for planar hyperbolic graphs
- On approximability of propositional model counting
- Current algorithms for detecting subgraphs of bounded treewidth are probably optimal
- Planar stories of graph drawings: algorithms and experiments
- Collective tree spanners in graphs with bounded parameters
- Every minor-closed property of sparse graphs is testable
- Treewidth computations. I: Upper bounds
- Minimum dominating set of queens: a trivial programming exercise?
- Minimum fill-in and treewidth of split \(+ ke\) and split \(+kv\) graphs
This page was built for publication: SOFSEM 2005: Theory and Practice of Computer Science
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5711519)
