Treewidth. Computations and approximations
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- The degree distribution of random \(k\)-trees
- The parameterized complexity of the induced matching problem
- Approximation algorithms for optimization problems in graphs with superlogarithmic treewidth
- A partial k-arboretum of graphs with bounded treewidth
- Triangulating graphs with few \(P_4\)'s
- Characterizations and algorithmic applications of chordal graph embeddings
- On interval routing schemes and treewidth
- The algorithmic use of hypertree structure and maximum neighbourhood orderings
- On treewidth and minimum fill-in of asteroidal triple-free graphs
- Interval degree and bandwidth of a graph
- Splitting a graph into disjoint induced paths or cycles.
- Generating irregular partitionable data structures
- Edge and node searching problems on trees
- A survey on interval routing
- Counting \(H-\)colorings of partial \(k-\)trees
- An implementation of the iterative proportional fitting procedure by propagation trees.
- Perfect edge domination and efficient edge domination in graphs
- Safe sets in graphs: graph classes and structural parameters
- Deleting edges to restrict the size of an epidemic: a new application for treewidth
- On the parameterized complexity of monotone and antimonotone weighted circuit satisfiability
- Bivariate complexity analysis of \textsc{Almost Forest Deletion}
- Matchings with lower quotas: algorithms and complexity
- Clifford algebras meet tree decompositions
- On directed covering and domination problems
- Explicit linear kernels for packing problems
- Counting linear extensions: parameterizations by treewidth
- Network pollution games
- Towards fixed-parameter tractable algorithms for abstract argumentation
- \(\mathcal Q\)-Ramsey classes of graphs
- Computing the branchwidth of interval graphs
- Strong branchwidth and local transversals
- Parameterized complexity of length-bounded cuts and multicuts
- Triangulating graphs without asteroidal triples
- Improved Steiner tree algorithms for bounded treewidth
- Spanners of bounded degree graphs
- Exact algorithms for edge domination
- Decomposable convexities in graphs and hypergraphs
- The parameterized complexity of some minimum label problems
- On the vertex ranking problem for trapezoid, circular-arc and other graphs
- A linear time algorithm for minimum fill-in and treewidth for distance hereditary graphs
- Crossing number for graphs with bounded pathwidth
- On tradeoffs between width- and fill-like graph parameters
- On some tractable and hard instances for partial incentives and target set selection
- Complexity and algorithms for injective edge-coloring in graphs
- On structural parameterizations of the edge disjoint paths problem
- Finding cuts of bounded degree: complexity, FPT and exact algorithms, and kernelization
- A (probably) optimal algorithm for \textsc{bisection} on bounded-treewidth graphs
- Measuring what matters: a hybrid approach to dynamic programming with treewidth
- Hitting forbidden induced subgraphs on bounded treewidth graphs
- Upper and lower degree-constrained graph orientation with minimum penalty
- Structurally parameterized \(d\)-scattered set
- Orthogonal planarity testing of bounded treewidth graphs
- Fast and parallel decomposition of constraint satisfaction problems
- Defensive alliances in graphs
- On coloring a class of claw-free and hole-twin-free graphs
- Measuring power in coalitional games with friends, enemies and allies
- On the tree-depth and tree-width in heterogeneous random graphs
- Parameterized complexity of stable roommates with ties and incomplete lists through the lens of graph parameters
- Weighted modulo orientations of graphs and signed graphs
- A generic convolution algorithm for join operations on tree decompositions
- Parameterized complexity of \((A,\ell)\)-path packing
- A new approach on locally checkable problems
- On the parameterized complexity of the expected coverage problem
- An analysis of the parameterized complexity of periodic timetabling
- On structural parameterizations of the offensive alliance problem
- Parameterized complexity of immunization in the threshold model
- Vertex partitioning problems on graphs with bounded tree width
- Complexity of edge monitoring on some graph classes
- Sparse obstructions for minor-covering parameters
- Parameterized complexity of conflict-free matchings and paths
- Parameterized complexity of happy coloring problems
- On the extremal sizes of maximal graphs without \(( k + 1 )\)-connected subgraphs
- Contractible graphs for flow index less than three
- Sketched representations and orthogonal planarity of bounded treewidth graphs
- On caterpillar factors in graphs
- On structural parameterizations of the bounded-degree vertex deletion problem
- Fixed-treewidth-efficient algorithms for edge-deletion to interval graph classes
- The small set vertex expansion problem
- Discrete optimization methods for group model selection in compressed sensing
- Coloring temporal graphs
- New width parameters for SAT and \#SAT
- Detecting fixed patterns in chordal graphs in polynomial time
- On the strong chromatic index and maximum induced matching of tree-cographs, permutation graphs and chordal bipartite graphs
- Parameterized complexity of spare capacity allocation and the multicost Steiner subgraph problem
- An extended tree-width notion for directed graphs related to the computation of permanents
- Algorithms for propositional model counting
- Complexity of the multicut problem, in its vanilla, partial and generalized versions, in graphs of bounded treewidth
- Hitting minors on bounded treewidth graphs. II. Single-exponential algorithms
- Using decomposition-parameters for QBF: mind the prefix!
- Computing the number of \(k\)-component spanning forests of a graph with bounded treewidth
- Algorithms and complexity for Turaev-Viro invariants
- Deleting vertices to graphs of bounded genus
- The parameterized complexity of the minimum shared edges problem
- Using contracted solution graphs for solving reconfiguration problems
- On the hardness of palletizing bins using FIFO queues
- Computing the numbers of independent sets and matchings of all sizes for graphs with bounded treewidth
- Mim-width. III. Graph powers and generalized distance domination problems
- On the maximum weight minimal separator
- The complexity of finding harmless individuals in social networks
- Separator-based graph embedding into multidimensional grids with small edge-congestion
This page was built for publication: Treewidth. Computations and approximations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1338451)
