scientific article; zbMATH DE number 1361465
From MaRDI portal
Publication:4699283
zbMATH Open0941.05057MaRDI QIDQ4699283FDOQ4699283
Authors: Hans L. Bodlaender 
Publication date: 3 August 2000
Title of this publication is not available (Why is that?)
Recommendations
Cited In (only showing first 100 items - show all)
- The parametrized complexity of knot polynomials
- Practical algorithms for MSO model-checking on tree-decomposable graphs
- Title not available (Why is that?)
- Guard games on graphs: keep the intruder out!
- Complexity and monotonicity results for domination games
- An algorithmic metatheorem for directed treewidth
- Predecessor existence problems for finite discrete dynamical systems
- The dag-width of directed graphs
- On the algorithmic effectiveness of digraph decompositions and complexity measures
- Treewidth: Characterizations, Applications, and Computations
- Computing LOGCFL certificates
- Algorithmic uses of the Feferman-Vaught theorem
- Special issue: Treewidth
- Upper and lower bounds for finding connected motifs in vertex-colored graphs
- An FPT-algorithm for modifying a graph of bounded treewidth to decrease the size of its dominating set using minimum modification
- Safe separators for treewidth
- Digraph measures: Kelly decompositions, games, and orderings
- The complexity status of problems related to sparsest cuts
- Approximation algorithms for treewidth
- Dynamic programming and planarity: improved tree-decomposition based algorithms
- SOFSEM 2005: Theory and Practice of Computer Science
- Empirical evaluation of approximation algorithms for generalized graph coloring and uniform quasi-wideness
- Online promise problems with online width metrics
- Tree-decompositions of small pathwidth
- On the extension of a partial metric to a tree metric
- Digraph Decompositions and Monotonicity in Digraph Searching
- Small drawings of outerplanar graphs, series-parallel graphs, and other planar graphs
- Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree
- A comparison of structural CSP decomposition methods
- Preprocessing for Treewidth: A Combinatorial Analysis through Kernelization
- Definability in first order theories of graph orderings
- The complexity of finding uniform sparsest cuts in various graph classes
- Subgraph isomorphism, log-bounded fragmentation, and graphs of (locally) bounded treewidth
- Treewidth. Computations and approximations
- Obtaining a planar graph by vertex deletion
- Complexity of the packing coloring problem for trees
- Treewidth: Structure and Algorithms
- Parameterized complexity of minimum membership dominating set
- Tree decompositions of graphs: saving memory in dynamic programming
- Subexponential parameterized algorithms
- Directed elimination games
- Counting truth assignments of formulas of bounded tree-width or clique-width
- Listing all potential maximal cliques of a graph
- The parameterized complexity of the induced matching problem
- Counting \(H-\)colorings of partial \(k-\)trees
- The relative clique-width of a graph
- Models and solution techniques for frequency assignment problems
- On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic
- On exact algorithms for treewidth
- Modeling and analyzing social network dynamics using stochastic discrete graphical dynamical systems
- The algorithmic theory of treewidth
- Treewidth and pathwidth parameterized by the vertex cover number
- Derivation of algorithms for cutwidth and related graph layout parameters
- Approximation algorithms for classes of graphs excluding single-crossing graphs as minors
- Consensus models: computational complexity aspects in modern approaches to the list coloring problem
- Digraph decompositions and monotonicity in digraph searching
- Complexity results for minimum sum edge coloring
- On treewidth approximations
- Backdoors to tractable answer set programming
- Binary jumbled pattern matching on trees and tree-like structures
- Directed nowhere dense classes of graphs
- Experimental evaluation of a tree decomposition-based algorithm for vertex cover on planar graphs
- Complexity and exact algorithms for vertex multicut in interval and bounded treewidth graphs
- Boxicity and treewidth
- Augmenting graphs to minimize the radius
- Title not available (Why is that?)
- Tree Decompositions of Graphs: Saving Memory in Dynamic Programming
- AND/OR search spaces for graphical models
- Exact algorithms for edge domination
- Bandwidth consecutive multicolorings of graphs
- \textsc{ToTo}: an open database for computation, storage and retrieval of tree decompositions
- Fixed-parameter tractability of treewidth and pathwidth
- Maximum \(k\)-splittable \(s, t\)-flows
- Coloured Tutte polynomials and Kauffman brackets for graphs of bounded tree width
- Exact algorithms and applications for tree-like Weighted Set Cover
- Fast approximation schemes for K3, 3-minor-free or K5-minor-free graphs
- Solving the problem of finding an independent \(\{K_1,K_2\}\)-packing of maximum weight on graphs of bounded treewidth
- Tree decomposition and discrete optimization problems: a survey
- Threshold Treewidth and Hypertree Width
- Semi-nice tree-decompositions: the best of branchwidth, treewidth and pathwidth with one algorithm
- A generic convolution algorithm for join operations on tree decompositions
- Tree-decompositions of small pathwidth
- A Branch and Bound Algorithm for Exact, Upper, and Lower Bounds on Treewidth
- Width, depth, and space: tradeoffs between branching and dynamic programming
- Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-wideness
- Triangulating planar graphs while keeping the pathwidth small
- Parameterized complexity of spare capacity allocation and the multicost Steiner subgraph problem
- Algorithms for graphs with small octopus
- On some efficiently solvable classes of the network facility location problem with constraints on the capacities of communication lines
- Polynomial-time algorithms for special cases of the maximum confluent flow problem
- Edge-maximal graphs of branchwidth \(k\): The \(k\)-branches
- Complexity of list coloring problems with a fixed total number of colors
- Eccentricity queries and beyond using hub labels
- Fast Algorithms for Join Operations on Tree Decompositions
- Title not available (Why is that?)
- Inductive computations on graphs defined by clique-width expressions
- Four Shorts Stories on Surprising Algorithmic Uses of Treewidth
- How to Use Planarity Efficiently: New Tree-Decomposition Based Algorithms
- Witnessing subsystems for probabilistic systems with low tree width
- Default logic and bounded treewidth
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 Q4699283)
