scientific article; zbMATH DE number 566078
From MaRDI portal
Publication:4291429
Recommendations
Cited in
(only showing first 100 items - show all)- Bounds on isoperimetric values of trees
- A spectral lower bound for the treewidth of a graph and its consequences
- On two techniques of combining branching and treewidth
- Complexity results for minimum sum edge coloring
- On spanning tree congestion of graphs
- All structured programs have small tree width and good register allocation
- Efficient Union-Find for planar graphs and other sparse graph classes
- Shortest paths in digraphs of small treewidth. II: Optimal parallel algorithms
- A partial k-arboretum of graphs with bounded treewidth
- Treewidth of cocomparability graphs and a new order-theoretic parameter
- Complexity of list coloring problems with a fixed total number of colors
- Treewidth for graphs with small chordality
- Characterizations and algorithmic applications of chordal graph embeddings
- Fugitive-search games on graphs and related parameters
- On treewidth and minimum fill-in of asteroidal triple-free graphs
- Triangulating multitolerance graphs
- The obnoxious center problem on weighted cactus graphs.
- A survey on interval routing
- An algorithm for the Tutte polynomials of graphs of bounded treewidth
- Listing all potential maximal cliques of a graph
- Perfect edge domination and efficient edge domination in graphs
- Scaffolding problems revisited: complexity, approximation and fixed parameter tractable algorithms, and some special cases
- Treewidth distance on phylogenetic trees
- Fixed-parameter algorithms for rectilinear Steiner tree and rectilinear traveling salesman problem in the plane
- Pushdown reachability with constant treewidth
- Reconfiguration in bounded bandwidth and tree-depth
- The multi-stripe travelling salesman problem
- Matchings with lower quotas: algorithms and complexity
- The critical node detection problem in networks: a survey
- Querying linguistic treebanks with monadic second-order logic in linear time
- Approximation algorithms for classes of graphs excluding single-crossing graphs as minors
- Triangulating graphs without asteroidal triples
- \(W[2]\)-hardness of precedence constrained \(K\)-processor scheduling
- Improved Steiner tree algorithms for bounded treewidth
- Efficient exact algorithms on planar graphs: Exploiting sphere cut decompositions
- Faster algorithms for quantitative verification in bounded treewidth graphs
- Notes on graph product structure theory
- A generic convolution algorithm for join operations on tree decompositions
- Treewidth of the generalized Kneser graphs
- A parameterized view on the complexity of dependence logic
- On strictly chordality-\(k\) graphs
- Maximum parsimony distance on phylogenetic trees: a linear kernel and constant factor approximation algorithm
- Tight bounds for online coloring of basic graph classes
- New width parameters for SAT and \#SAT
- On the intersection graph of the disks with diameters the sides of a convex \(n\)-gon
- Algorithms for propositional model counting
- Backdoors to tractable answer set programming
- Semiring induced valuation algebras: exact and approximate local computation algorithms
- Identifying the minor set cover of dense connected bipartite graphs via random matching edge sets
- Tractable cases of the extended global cardinality constraint
- The theory of guaranteed search on graphs
- Digraph width measures in parameterized algorithmics
- Counting solutions to CSP using generating polynomials
- Adiabatic quantum programming: minor embedding with hard faults
- Vertex-minor reductions can simulate edge contractions
- Tree decomposition and discrete optimization problems: a survey
- An exact method for graph coloring
- Branch-width, parse trees, and monadic second-order logic for matroids.
- On the complexity of the FIFO stack-up problem
- Some notes on bounded starwidth graphs
- Boxicity and treewidth
- The stable set problem and the thinness of a graph
- Improving robustness of next-hop routing
- On structural parameterizations of Node Kayles
- On treewidth, separators and Yao's garbling
- Solving frequency assignment problems via tree-decomposition
- On the tree-width of planar graphs
- On advice complexity of the k-server problem under sparse metrics
- Bounding the clique-width of H-free chordal graphs
- Parameters tied to treewidth
- Computing directed pathwidth in O(1.89ⁿ) time
- Tight bounds for linkages in planar graphs
- Compact navigation and distance oracles for graphs with small treewidth
- On recognizing graphs by numbers of homomorphisms
- Approximate tree decompositions of planar graphs in linear time
- Reduction rules for the maximum parsimony distance on phylogenetic trees
- An efficient partitioning oracle for bounded-treewidth graphs
- Graphical Models and Message-Passing Algorithms: Some Introductory Lectures
- Directed pathwidth and palletizers
- Algorithms for Propositional Model Counting
- Complexity and Algorithms for Well-Structured k-SAT Instances
- How to Use Planarity Efficiently: New Tree-Decomposition Based Algorithms
- Isoperimetric Problem and Meta-fibonacci Sequences
- Integer Maximum Flow in Wireless Sensor Networks with Energy Constraint
- Tight Bounds and a Fast FPT Algorithm for Directed Max-Leaf Spanning Tree
- Limit Set Reachability in Asynchronous Graph Dynamical Systems
- The complexity of the matching-cut problem for planar graphs and other graph classes
- Graph minors. II. Algorithmic aspects of tree-width
- Optimization problems in dotted interval graphs
- scientific article; zbMATH DE number 176762 (Why is no real title available?)
- Treewidth of the Kneser graph and the Erdős-Ko-Rado theorem
- Courcelle's theorem -- a game-theoretic approach
- The complexity of two graph orientation problems
- Treewidth of Erdős-Rényi random graphs, random intersection graphs, and scale-free random graphs
- Enumerating homomorphisms
- Polynomial-time recognition of clique-width 3 graphs
- Satisfiability, branch-width and Tseitin tautologies
- Treewidth governs the complexity of target set selection
- Graph bisection with Pareto optimization
- Subexponential parameterized algorithms
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 Q4291429)
