Pages that link to "Item:Q5711519"
From MaRDI portal
The following pages link to SOFSEM 2005: Theory and Practice of Computer Science (Q5711519):
Displaying 46 items.
- A note on planar graphs with large width parameters and small grid-minors (Q423947) (← links)
- Treewidth computations. II. Lower bounds (Q549673) (← links)
- Collective tree spanners in graphs with bounded parameters (Q848633) (← links)
- Every minor-closed property of sparse graphs is testable (Q962147) (← links)
- Treewidth computations. I: Upper bounds (Q964001) (← links)
- Minimum dominating set of queens: a trivial programming exercise? (Q968146) (← links)
- Minimum fill-in and treewidth of split \(+ ke\) and split \(+kv\) graphs (Q972334) (← links)
- Treewidth. Computations and approximations (Q1338451) (← links)
- Computing tree width: from theory to practice and back (Q1670723) (← links)
- Pushdown reachability with constant treewidth (Q1675921) (← links)
- Reconfiguration in bounded bandwidth and tree-depth (Q1686224) (← links)
- \(2K_2\)-partition of some classes of graphs (Q1759842) (← links)
- Approximation algorithms via contraction decomposition (Q1945289) (← links)
- Faster algorithms for quantitative verification in bounded treewidth graphs (Q2058390) (← links)
- A parameterized view on the complexity of dependence logic (Q2151403) (← links)
- Postman problems on series-parallel mixed graphs (Q2183202) (← links)
- An improvement of Reed's treewidth approximation (Q2232243) (← links)
- Algorithms for propositional model counting (Q2266937) (← links)
- On exteriority notions in book embeddings and treewidth (Q2297721) (← links)
- Backdoors to tractable answer set programming (Q2341833) (← links)
- Applying clique-decomposition for computing Gromov hyperbolicity (Q2399620) (← links)
- Space saving by dynamic algebraization based on tree-depth (Q2411033) (← links)
- Tractable cases of the extended global cardinality constraint (Q2430356) (← links)
- Tree decompositions of graphs: saving memory in dynamic programming (Q2465936) (← links)
- Tree decomposition and discrete optimization problems: a survey (Q2480502) (← links)
- Introducing directed tree width (Q2741376) (← links)
- The algorithmic theory of treewidth (Q2816059) (← links)
- Parameterized complexity of discrete Morse theory (Q2828168) (← links)
- On planar graphs with large tree-width and small grid minors (Q2839208) (← links)
- Fixed-Parameter Tractability of Treewidth and Pathwidth (Q2908539) (← links)
- Parameters Tied to Treewidth (Q2978180) (← links)
- Algorithms for Propositional Model Counting (Q3498488) (← links)
- Domino Treewidth (Q4349700) (← links)
- Solving Graph Problems via Potential Maximal Cliques (Q4629543) (← links)
- (Q4966374) (← links)
- An Improvement of Reed’s Treewidth Approximation (Q5049997) (← links)
- (Q5088974) (← links)
- Computing treewidth on the GPU (Q5111889) (← links)
- (Q5115814) (← links)
- Minimum Fill-In and Treewidth of Split+ ke and Split+ kv Graphs (Q5387822) (← links)
- On the $AC^0$ Complexity of Subgraph Isomorphism (Q5737815) (← links)
- (Q5743498) (← links)
- Tree decompositions and social graphs (Q5856440) (← links)
- On the pathwidth of hyperbolic 3-manifolds (Q5881542) (← links)
- Computing optimal hypertree decompositions with SAT (Q6067037) (← links)
- Quasi-optimal recombination operator (Q6084518) (← links)
