On the public citation graph
Efficient algorithms for combinatorial problems on graphs with bounded decomposability — A survey
0 signed · 334 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/net.3230110402openalex-snapshot
Series‐parallel reduction for difficult measures of network reliability
inferredcites →https://doi.org/10.1002/net.3230130202openalex-snapshot
Steiner trees, partial 2–trees, and minimum IFI networks
inferredcites →https://doi.org/10.1007/3-540-13345-3_11openalex-snapshot
Concurrent transmissions in broadcast networks
inferredcites →https://doi.org/10.1016/0012-365x(74)90042-9openalex-snapshot
On simple characterizations of k-trees
inferredcites →https://doi.org/10.1016/0012-365x(85)90051-2openalex-snapshot
Decomposition by clique separators
inferredcites →https://doi.org/10.1016/0020-0190(81)90072-7openalex-snapshot
An algorithm for finding clique cut-sets
inferredcites →https://doi.org/10.1016/0022-247x(65)90125-3openalex-snapshot
Topology of series-parallel networks
inferredcites →https://doi.org/10.1016/0022-247x(70)90282-9openalex-snapshot
Triangulated graphs and the elimination process
inferredcites →https://doi.org/10.1016/0166-218x(81)90013-5openalex-snapshot
Complement reducible graphs
inferredcites →https://doi.org/10.1016/0196-6774(83)90038-xopenalex-snapshot
The NP-completeness column: An ongoing guide
inferredcites →https://doi.org/10.1016/b978-0-12-115350-2.50017-8openalex-snapshot
Equations and Rewrite Rules: A Survey
inferredcites →https://doi.org/10.1016/s0076-5392(08)x6010-2openalex-snapshot
Nonserial Dynamic Programming
inferredcites →https://doi.org/10.1109/sfcs.1983.2openalex-snapshot
A polynomial algorithm for the MIN CUT linear arrangement of trees
inferredcites →https://doi.org/10.1109/tr.1978.5220267openalex-snapshot
Reduced State EnumerationߞAnother Algorithm for Reliability Evaluation
inferredcites →https://doi.org/10.1112/s0025579300008500openalex-snapshot
Properties and characterizations of k ‐trees
inferredcites →https://doi.org/10.1126/science.220.4598.671openalex-snapshot
Optimization by Simulated Annealing
inferredcites →https://doi.org/10.1137/0132031openalex-snapshot
Computing the Reliability of Complex Networks
inferredcites →https://doi.org/10.1137/0134037openalex-snapshot
Complexity Results for Bandwidth Minimization
inferredcites →https://doi.org/10.1137/0201013openalex-snapshot
Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph
inferredcites →https://doi.org/10.1137/0211004openalex-snapshot
Dynamic Programming is Optimal for Nonserial Optimization Problems
inferredcites →https://doi.org/10.1137/0602010openalex-snapshot
Computing the Minimum Fill-In is NP-Complete
inferredcites →https://doi.org/10.1145/321033.321034openalex-snapshot
A Computing Procedure for Quantification Theory
inferredcites →https://doi.org/10.1145/322326.322328openalex-snapshot
Linear-time computability of combinatorial problems on series-parallel graphs
inferredcites →https://doi.org/10.1145/359642.359654openalex-snapshot
Synthesizing constraint expressions
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/ett.1533openalex-snapshot
Optimal distributed interference avoidance: potential game and learning
inferred← citeshttps://doi.org/10.1002/rsa.20802openalex-snapshot
Graph limits of random graphs from a subset of connected k‐trees
inferred← citeshttps://doi.org/10.1006/jagm.1993.1001openalex-snapshot
On Linear Time Minor Tests with Depth-First Search
inferred← citeshttps://doi.org/10.1006/jagm.1996.0049openalex-snapshot
Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs
inferred← citeshttps://doi.org/10.1006/jagm.1998.0961openalex-snapshot
All-Pairs Min-Cut in Sparse Networks
inferred← citeshttps://doi.org/10.1006/jagm.1999.1048openalex-snapshot
Fully Dynamic Algorithms for Maintaining Shortest Paths Trees
inferred← citeshttps://doi.org/10.1006/jcss.1996.0013openalex-snapshot
Finite Languages for the Representation of Finite Graphs
inferred← citeshttps://doi.org/10.1006/jcss.2001.1809openalex-snapshot
Hypertree Decompositions and Tractable Queries
inferred← citeshttps://doi.org/10.1006/jctb.2000.1962openalex-snapshot
Surfaces, Tree-Width, Clique-Minors, and Partitions
inferred← citeshttps://doi.org/10.1007/10692760_8openalex-snapshot
A Generalization of AT-free Graphs and a Generic Algorithm for Solving Treewidth, Minimum Fill-In and Vertex Ranking
inferred← citeshttps://doi.org/10.1007/11427186_11openalex-snapshot
Degree-Based Treewidth Lower Bounds
inferred← citeshttps://doi.org/10.1007/11775096_24openalex-snapshot
A Branch and Bound Algorithm for Exact, Upper, and Lower Bounds on Treewidth
inferred← citeshttps://doi.org/10.1007/11917496_1openalex-snapshot
Treewidth: Characterizations, Applications, and Computations
inferred← citeshttps://doi.org/10.1007/3-540-17218-1_56openalex-snapshot
On some generalizations of outerplanar graphs: Results and open problems
inferred← citeshttps://doi.org/10.1007/3-540-19487-8_26openalex-snapshot
Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees
inferred← citeshttps://doi.org/10.1007/3-540-19488-6_105openalex-snapshot
Problems easy for tree-decomposable graphs extended abstract
inferred← citeshttps://doi.org/10.1007/3-540-19488-6_110openalex-snapshot
Dynamic programming on graphs with bounded treewidth
inferred← citeshttps://doi.org/10.1007/3-540-44634-6_8openalex-snapshot
Fast Fixed-Parameter Tractable Algorithms for Nontrivial Generalizations of Vertex Cover
inferred← citeshttps://doi.org/10.1007/3-540-44634-6_9openalex-snapshot
Deciding Clique-Width for Graphs of Bounded Tree-Width
inferred← citeshttps://doi.org/10.1007/3-540-44679-6_33openalex-snapshot
Counting H-Colorings of Partial k-Trees
inferred← citeshttps://doi.org/10.1007/3-540-44693-1_32openalex-snapshot
Polynomial Time Approximation Schemes for MAX-BISECTION on Planar and Geometric Graphs
inferred← citeshttps://doi.org/10.1007/3-540-45349-0_22openalex-snapshot
Boosting Search with Variable Elimination
inferred← citeshttps://doi.org/10.1007/3-540-45471-3_40openalex-snapshot
Computing the Treewidth and the Minimum Fill-in with the Modular Decomposition
inferred← citeshttps://doi.org/10.1007/3-540-45477-2_15openalex-snapshot
Graph Subcolorings: Complexity and Algorithms
inferred← citeshttps://doi.org/10.1007/3-540-45578-7_24openalex-snapshot
A General Scheme for Multiple Lower Bound Computation in Constraint Optimization
inferred← citeshttps://doi.org/10.1007/3-540-46674-6_29openalex-snapshot
Separators Are as Simple as Cutsets
inferred← citeshttps://doi.org/10.1007/3-540-48224-5_37openalex-snapshot
The Longest Common Subsequence Problem for Sequences with Nested Arc Annotations
inferred← citeshttps://doi.org/10.1007/3-540-48321-7_47openalex-snapshot
Deriving formulas for domination numbers of fasciagraphs and rotagraphs
inferred← citeshttps://doi.org/10.1007/3-540-50728-0_32openalex-snapshot
NC-algorithms for graphs with small treewidth
inferred← citeshttps://doi.org/10.1007/3-540-51486-4_66openalex-snapshot
Parallel complexity of lexicographically first problems for tree-structured graphs
inferred← citeshttps://doi.org/10.1007/3-540-51517-8_142openalex-snapshot
A combinatorial and logical approach to linear-time computability (extended abstract)
inferred← citeshttps://doi.org/10.1007/3-540-51542-9_48openalex-snapshot
On linear time minor tests and depth first search
inferred← citeshttps://doi.org/10.1007/3-540-52292-1_17openalex-snapshot
Improved self-reduction algorithms for graphs with bounded treewidth
inferred← citeshttps://doi.org/10.1007/3-540-52846-6_100openalex-snapshot
Canonical representations of partial 2-and 3-trees
inferred← citeshttps://doi.org/10.1007/3-540-52846-6_99openalex-snapshot
The pathwidth and treewidth of cographs
inferred← citeshttps://doi.org/10.1007/3-540-54233-7_162openalex-snapshot
Better algorithms for the pathwidth and treewidth of graphs
inferred← citeshttps://doi.org/10.1007/3-540-54458-5_50openalex-snapshot
Graph theoretical methods for the design of parallel algorithms
inferred← citeshttps://doi.org/10.1007/3-540-55121-2_1openalex-snapshot
Approximating treewidth, pathwidth, and minimum elimination tree height
inferred← citeshttps://doi.org/10.1007/3-540-55719-9_80openalex-snapshot
Two strikes against perfect phylogeny
inferred← citeshttps://doi.org/10.1007/3-540-56279-6_64openalex-snapshot
Approximating treewidth and pathwidth of some classes of perfect graphs
inferred← citeshttps://doi.org/10.1007/3-540-56939-1_66openalex-snapshot
Treewidth and pathwidth of permutation graphs
inferred← citeshttps://doi.org/10.1007/3-540-57273-2_61openalex-snapshot
Computing treewidth and minimum fill-in: All you need are the minimal separators
inferred← citeshttps://doi.org/10.1007/3-540-57785-8_188openalex-snapshot
Finding all minimal separators of a graph
inferred← citeshttps://doi.org/10.1007/3-540-57785-8_189openalex-snapshot
On the complexity of the maximum cut problem
inferred← citeshttps://doi.org/10.1007/3-540-57787-4_3openalex-snapshot
Decomposability helps for deciding logics of knowledge and belief
inferred← citeshttps://doi.org/10.1007/3-540-58715-2_118openalex-snapshot
Incremental algorithms for the single-source shortest path problem
inferred← citeshttps://doi.org/10.1007/3-540-59071-4_59openalex-snapshot
Fugitive-search games on graphs and related parameters
inferred← citeshttps://doi.org/10.1007/3-540-60084-1_78openalex-snapshot
Shortest path queries in digraphs of small treewidth
inferred← citeshttps://doi.org/10.1007/3-540-60313-1_132openalex-snapshot
Optimal parallel shortest paths in small treewidth digraphs
inferred← citeshttps://doi.org/10.1007/3-540-60692-0_61openalex-snapshot
All-pairs min-cut in sparse networks
inferred← citeshttps://doi.org/10.1007/3-540-61422-2_129openalex-snapshot
Vertex partitioning problems on partial k-trees
inferred← citeshttps://doi.org/10.1007/3-540-62559-3_20openalex-snapshot
Definability equals recognizability of partial 3-trees
inferred← citeshttps://doi.org/10.1007/3-540-62592-5_58openalex-snapshot
The optimum cost chromatic partition problem
inferred← citeshttps://doi.org/10.1007/3-540-63165-8_217openalex-snapshot
Constructive linear time algorithms for branchwidth
inferred← citeshttps://doi.org/10.1007/978-0-387-09690-2openalex-snapshot
Managing and Mining Uncertain Data
inferred← citeshttps://doi.org/10.1007/978-0-387-09690-2_4openalex-snapshot
Graphical Models for Uncertain Data
inferred← citeshttps://doi.org/10.1007/978-1-4419-7997-1_26openalex-snapshot
Algorithmic Aspects of Domination in Graphs
inferred← citeshttps://doi.org/10.1007/978-1-4612-1782-4_20openalex-snapshot
Exact Methods to Compute Network Reliability
inferred← citeshttps://doi.org/10.1007/978-1-4613-0303-9_28openalex-snapshot
Algorithmic Aspects of Domination in Graphs
inferred← citeshttps://doi.org/10.1007/978-1-4613-8788-6_11openalex-snapshot
Network-Based Heuristics for Constraint-Satisfaction Problems
inferred← citeshttps://doi.org/10.1007/978-3-030-51051-0_17openalex-snapshot
On the Treewidth of Planar Minor Free Graphs
inferred← citeshttps://doi.org/10.1007/978-3-031-63735-3_6openalex-snapshot
Extending the Tractability of the Clique Problem via Graph Classes Generalizing Treewidth
inferred← citeshttps://doi.org/10.1007/978-3-319-08001-7_4openalex-snapshot
On the max min vertex cover Problem
inferred← citeshttps://doi.org/10.1007/978-3-319-08783-2_26openalex-snapshot
Fixed Parameter Tractable Algorithms in Combinatorial Topology
inferred← citeshttps://doi.org/10.1007/978-3-540-24587-2_56openalex-snapshot
Improved Approximation Algorithms for Optimization Problems in Graphs with Superlogarithmic Treewidth
inferred← citeshttps://doi.org/10.1007/978-3-540-24605-3_24openalex-snapshot
Guiding SAT Diagnosis with Tree Decompositions
inferred← citeshttps://doi.org/10.1007/978-3-540-30201-8_56openalex-snapshot
The Impact of AND/OR Search Spaces on Constraint Satisfaction and Counting
inferred← citeshttps://doi.org/10.1007/978-3-540-39989-6_15openalex-snapshot
Lower Bounds for Oblivious Single-Packet End-to-End Communication
inferred← citeshttps://doi.org/10.1007/978-3-540-70575-8_46openalex-snapshot
On Problems without Polynomial Kernels (Extended Abstract)
inferred← citeshttps://doi.org/10.1007/978-3-540-72951-8_3openalex-snapshot
Treewidth: Structure and Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-540-73420-8_31openalex-snapshot
Sharp Tractability Borderlines for Finding Connected Motifs in Vertex-Colored Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-73817-6_10openalex-snapshot
Efficient Recognition of Acyclic Clustered Constraint Satisfaction Problems
inferred← citeshttps://doi.org/10.1007/978-3-540-78582-8_72openalex-snapshot
A Note on Root Choice for Parallel Processing of Tree Decompositions
inferred← citeshttps://doi.org/10.1007/978-3-642-01085-9_8openalex-snapshot
Graph-Based Local Elimination Algorithms in Discrete Optimization
inferred← citeshttps://doi.org/10.1007/978-3-642-01206-8_9openalex-snapshot
Generalized Attachment Models for the Genesis of Graphs with High Clustering Coefficient
inferred← citeshttps://doi.org/10.1007/978-3-642-04500-4_10openalex-snapshot
Baumweitebeschränkte Graphen
inferred← citeshttps://doi.org/10.1007/978-3-642-11269-0_12openalex-snapshot
Well-Quasi-Orders in Subclasses of Bounded Treewidth Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-14165-2_32openalex-snapshot
Dynamic Programming for Graphs on Surfaces
inferred← citeshttps://doi.org/10.1007/978-3-642-30891-8_12openalex-snapshot
Fixed-Parameter Tractability of Treewidth and Pathwidth
inferred← citeshttps://doi.org/10.1007/978-3-642-32241-9_8openalex-snapshot
Dynamic Programming for H-minor-free Graphs
inferred← citeshttps://doi.org/10.1007/978-3-662-48350-3_63openalex-snapshot
On the Equivalence among Problems of Bounded Width
inferred← citeshttps://doi.org/10.1007/978-3-7091-9076-0_1openalex-snapshot
Efficient Computations in Tree-Like Graphs
inferred← citeshttps://doi.org/10.1007/978-94-011-5014-9_4openalex-snapshot
Bucket Elimination: A Unifying Framework for Probabilistic Inference
inferred← citeshttps://doi.org/10.1007/978-981-15-1120-2_6openalex-snapshot
Matching Heterogeneous User Demands: Localized Self-organization Game and MARL Based Network Selection
inferred← citeshttps://doi.org/10.1007/978-981-16-8759-4_70openalex-snapshot
Modelling of Dispatching Functions in the Language of Decision Tables Using the Negation and Minimization Algorithms for Disjunctive Normal Forms
inferred← citeshttps://doi.org/10.1007/b94771openalex-snapshot
Algorithms and computation : 14th International Symposium, ISAAC 2003, Kyoto, Japan, December 15-17, 2003 : proceedings
inferred← citeshttps://doi.org/10.1007/bf01293664openalex-snapshot
Generation of polynomial-time algorithms for some optimization problems on tree-decomposable graphs
inferred← citeshttps://doi.org/10.1007/bf01462229openalex-snapshot
Treewidth of cocomparability graphs and a new order-theoretic parameter
inferred← citeshttps://doi.org/10.1007/bf01758777openalex-snapshot
Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families
inferred← citeshttps://doi.org/10.1007/bf01994877openalex-snapshot
Canonical representations of partial 2- and 3-trees
inferred← citeshttps://doi.org/10.1007/bf02115752openalex-snapshot
Algorithms for recognition of regular properties and decomposition of recursive graph families
inferred← citeshttps://doi.org/10.1007/bfb0017382openalex-snapshot
An algebraic theory of graph reduction
inferred← citeshttps://doi.org/10.1007/bfb0017410openalex-snapshot
Tree automata, tree decomposition and hyperedge replacement
inferred← citeshttps://doi.org/10.1007/bfb0026094openalex-snapshot
Decomposition trees: Structured graph representation and efficient algorithms
inferred← citeshttps://doi.org/10.1007/pl00009224openalex-snapshot
Semidynamic Algorithms for Maintaining Single-Source Shortest Path Trees
inferred← citeshttps://doi.org/10.1007/pl00009227openalex-snapshot
Maintaining Regular Properties Dynamically in k-Terminal Graphs
inferred← citeshttps://doi.org/10.1007/s00224-016-9685-1openalex-snapshot
The Behavior of Clique-Width under Graph Operations and Graph Transformations
inferred← citeshttps://doi.org/10.1007/s00224-019-09919-xopenalex-snapshot
Comparing Linear Width Parameters for Directed Graphs
inferred← citeshttps://doi.org/10.1007/s00453-001-0091-xopenalex-snapshot
A Generalization of AT-Free Graphs and a Generic Algorithm for Solving Triangulation Problems
inferred← citeshttps://doi.org/10.1007/s00453-003-1026-5openalex-snapshot
Computing the Treewidth and the Minimum Fill-In with the Modular Decomposition
inferred← citeshttps://doi.org/10.1007/s00453-011-9545-yopenalex-snapshot
Well Quasi Orders in Subclasses of Bounded Treewidth Graphs and Their Algorithmic Applications
inferred← citeshttps://doi.org/10.1007/s00453-015-0033-7openalex-snapshot
Between Treewidth and Clique-Width
inferred← citeshttps://doi.org/10.1007/s00453-015-0039-1openalex-snapshot
An Asymptotic Analysis of Labeled and Unlabeled k-Trees
inferred← citeshttps://doi.org/10.1007/s004530010016openalex-snapshot
Shortest Paths in Digraphs of Small Treewidth. Part I: Sequential Algorithms
inferred← citeshttps://doi.org/10.1007/s004530010022openalex-snapshot
Evaluating Network Reliability and 2-Edge-Connected Reliability in Linear Time for Bounded Pathwidth Graphs
inferred← citeshttps://doi.org/10.1007/s00778-009-0153-2openalex-snapshot
PrDB: managing and exploiting rich correlations in probabilistic databases
inferred← citeshttps://doi.org/10.1007/s10107-020-01563-5openalex-snapshot
New limits of treewidth-based tractability in optimization
inferred← citeshttps://doi.org/10.1007/s10601-015-9198-6openalex-snapshot
Tractability in constraint satisfaction problems: a survey
inferred← citeshttps://doi.org/10.1007/s10817-010-9170-5openalex-snapshot
Portfolios in Stochastic Local Search: Efficiently Computing Most Probable Explanations in Bayesian Networks
inferred← citeshttps://doi.org/10.1007/s11390-005-0003-7openalex-snapshot
Parameterized Computation and Complexity: A New Approach Dealing with NP-Hardness
inferred← citeshttps://doi.org/10.1007/s11434-011-4775-6openalex-snapshot
Social welfare maximization for SRSNs using bio-inspired community cooperation mechanism
inferred← citeshttps://doi.org/10.1016/0004-3702(87)90002-6openalex-snapshot
Network-based heuristics for constraint-satisfaction problems
inferred← citeshttps://doi.org/10.1016/0004-3702(91)90006-6openalex-snapshot
Temporal constraint networks
inferred← citeshttps://doi.org/10.1016/0004-3702(92)90009-mopenalex-snapshot
Structure identification in relational data
inferred← citeshttps://doi.org/10.1016/0012-365x(90)90292-popenalex-snapshot
Forbidden minors characterization of partial 3-trees
inferred← citeshttps://doi.org/10.1016/0012-365x(90)90365-oopenalex-snapshot
Bibliography on domination in graphs and some basic definitions of domination parameters
inferred← citeshttps://doi.org/10.1016/0012-365x(92)90646-wopenalex-snapshot
Precoloring extension. I. Interval graphs
inferred← citeshttps://doi.org/10.1016/0020-0190(95)00190-5openalex-snapshot
A simple linear-time algorithm for finding path-decompositions of small width
inferred← citeshttps://doi.org/10.1016/0022-0000(90)90031-fopenalex-snapshot
Decomposing a relation into a tree of binary relations
inferred← citeshttps://doi.org/10.1016/0166-218x(89)90031-0openalex-snapshot
Linear time algorithms for NP-hard problems restricted to partial k-trees
inferred← citeshttps://doi.org/10.1016/0166-218x(90)90142-yopenalex-snapshot
The basic algorithm for pseudo-Boolean programming revisited
inferred← citeshttps://doi.org/10.1016/0166-218x(92)00122-3openalex-snapshot
On some optimization problems on k-trees and partial k-trees
inferred← citeshttps://doi.org/10.1016/0166-218x(93)90035-mopenalex-snapshot
General vertex disjoint paths in series-parallel graphs
inferred← citeshttps://doi.org/10.1016/0166-218x(94)90018-3openalex-snapshot
Improved self-reduction algorithms for graphs with bounded treewidth
inferred← citeshttps://doi.org/10.1016/0166-218x(94)90025-6openalex-snapshot
Regularity and locality in k-terminal graphs
inferred← citeshttps://doi.org/10.1016/0166-218x(95)00032-mopenalex-snapshot
A decomposition algorithm for network reliability evaluation
inferred← citeshttps://doi.org/10.1016/0166-218x(95)00058-yopenalex-snapshot
Algebraic approach to fasciagraphs and rotagraphs
inferred← citeshttps://doi.org/10.1016/0166-218x(95)00095-9openalex-snapshot
Triangulating graphs without asteroidal triples
inferred← citeshttps://doi.org/10.1016/0196-6774(90)90013-5openalex-snapshot
Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees
inferred← citeshttps://doi.org/10.1016/0196-6774(91)90006-kopenalex-snapshot
Easy problems for tree-decomposable graphs
inferred← citeshttps://doi.org/10.1016/0304-3975(93)90357-yopenalex-snapshot
Complexity of path-forming games
inferred← citeshttps://doi.org/10.1016/j.amc.2019.01.051openalex-snapshot
Connectivity of the graph induced by contractible edges of a k-tree
inferred← citeshttps://doi.org/10.1016/j.artint.2004.11.004openalex-snapshot
Partition-based logical reasoning for first-order and propositional theories
inferred← citeshttps://doi.org/10.1016/j.artint.2005.04.004openalex-snapshot
Unifying tree decompositions for reasoning in graphical models
inferred← citeshttps://doi.org/10.1016/j.artint.2006.09.003openalex-snapshot
Controlled generation of hard and easy Bayesian networks: Impact on maximal clique size in tree clustering
inferred← citeshttps://doi.org/10.1016/j.artint.2006.11.003openalex-snapshot
AND/OR search spaces for graphical models
inferred← citeshttps://doi.org/10.1016/j.artint.2007.05.006openalex-snapshot
A logical approach to efficient Max-SAT solving
inferred← citeshttps://doi.org/10.1016/j.artint.2009.10.003openalex-snapshot
Bounded treewidth as a key to tractability of knowledge representation and reasoning
inferred← citeshttps://doi.org/10.1016/j.comcom.2023.05.014openalex-snapshot
Construction of FANETs for user coverage and information transmission in disaster rescue scenarios
inferred← citeshttps://doi.org/10.1016/j.comnet.2005.09.025openalex-snapshot
Header-size lower bounds for end-to-end communication in memoryless networks
inferred← citeshttps://doi.org/10.1016/j.cosrev.2014.07.001openalex-snapshot
DAG-based attack and defense modeling: Don’t miss the forest for the attack trees
inferred← citeshttps://doi.org/10.1016/j.cosrev.2014.08.001openalex-snapshot
Practical algorithms for MSO model-checking on tree-decomposable graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2005.02.029openalex-snapshot
Fast fixed-parameter tractable algorithms for nontrivial generalizations of vertex cover
inferred← citeshttps://doi.org/10.1016/j.dam.2014.06.001openalex-snapshot
On the max min vertex cover problem
inferred← citeshttps://doi.org/10.1016/j.dam.2021.02.039openalex-snapshot
A polynomial time algorithm to compute the connected treewidth of a series–parallel graph
inferred← citeshttps://doi.org/10.1016/j.dam.2024.12.001openalex-snapshot
Discrete isoperimetric method for bandwidth, pathwidth and treewidth of hypercubes
inferred← citeshttps://doi.org/10.1016/j.disc.2005.12.060openalex-snapshot
Tree-decompositions with bags of small diameter
inferred← citeshttps://doi.org/10.1016/j.disc.2017.08.028openalex-snapshot
Locating a robber with multiple probes
inferred← citeshttps://doi.org/10.1016/j.ejc.2017.06.019openalex-snapshot
On the generalised colouring numbers of graphs that exclude a fixed minor
inferred← citeshttps://doi.org/10.1016/j.endm.2009.07.099openalex-snapshot
On the Tree-Width of Planar Graphs
inferred← citeshttps://doi.org/10.1016/j.ic.2009.03.008openalex-snapshot
Treewidth computations I. Upper bounds
inferred← citeshttps://doi.org/10.1016/j.ic.2011.04.003openalex-snapshot
Treewidth computations II. Lower bounds
inferred← citeshttps://doi.org/10.1016/j.ipl.2004.12.017openalex-snapshot
Approximation algorithms for optimization problems in graphs with superlogarithmic treewidth
inferred← citeshttps://doi.org/10.1016/j.jcss.2009.04.001openalex-snapshot
On problems without polynomial kernels
inferred← citeshttps://doi.org/10.1016/j.jcss.2010.07.003openalex-snapshot
Upper and lower bounds for finding connected motifs in vertex-colored graphs
inferred← citeshttps://doi.org/10.1016/j.orl.2020.07.017openalex-snapshot
The k-path coloring problem in graphs of bounded treewidth: An application in integrated circuit manufacturing
inferred← citeshttps://doi.org/10.1016/j.tcs.2006.01.024openalex-snapshot
Degree-constrained decompositions of graphs: Bounded treewidth and planarity
inferred← citeshttps://doi.org/10.1016/j.tcs.2006.12.021openalex-snapshot
Approximating the maximum clique minor and some subgraph homeomorphism problems
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.12.021openalex-snapshot
On switching classes, NLC-width, cliquewidth and treewidth
inferred← citeshttps://doi.org/10.1016/j.tcs.2013.10.001openalex-snapshot
On permuted super-secondary structures of transmembrane β -barrel proteins
inferred← citeshttps://doi.org/10.1016/j.tcs.2020.11.047openalex-snapshot
How to compute digraph width measures on directed co-graphs
inferred← citeshttps://doi.org/10.1016/s0004-3702(00)00050-3openalex-snapshot
Topological parameters for time-space tradeoff
inferred← citeshttps://doi.org/10.1016/s0004-3702(00)00075-8openalex-snapshot
A sufficiently fast algorithm for finding close to optimal clique trees
inferred← citeshttps://doi.org/10.1016/s0004-3702(02)00120-0openalex-snapshot
Backjump-based backtracking for constraint satisfaction problems
inferred← citeshttps://doi.org/10.1016/s0004-3702(99)00059-4openalex-snapshot
Bucket elimination: A unifying framework for reasoning
inferred← citeshttps://doi.org/10.1016/s0012-365x(98)00113-7openalex-snapshot
An algorithm for the Tutte polynomials of graphs of bounded treewidth
inferred← citeshttps://doi.org/10.1016/s0020-0190(03)00286-2openalex-snapshot
A spectral lower bound for the treewidth of a graph and its consequences
inferred← citeshttps://doi.org/10.1016/s0022-0000(02)00004-1openalex-snapshot
The longest common subsequence problem for sequences with nested arc annotations
inferred← citeshttps://doi.org/10.1016/s0166-218x(02)00425-0openalex-snapshot
Splitting a graph into disjoint induced paths or cycles
inferred← citeshttps://doi.org/10.1016/s0166-218x(97)00031-0openalex-snapshot
Treewidth for graphs with small chordality
inferred← citeshttps://doi.org/10.1016/s0166-218x(98)00026-2openalex-snapshot
Triangulating multitolerance graphs
inferred← citeshttps://doi.org/10.1016/s0166-218x(98)00115-2openalex-snapshot
Triangulating graphs with few P4's
inferred← citeshttps://doi.org/10.1016/s0167-5060(08)71054-9openalex-snapshot
Bibliography on Domination in Graphs and Some Basic Definitions of Domination Parameters
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00017-8openalex-snapshot
Counting H-colorings of partial k-trees
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00177-6openalex-snapshot
Fugitive-search games on graphs and related parameters
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)00228-4openalex-snapshot
A partial k-arboretum of graphs with bounded treewidth
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)83809-1openalex-snapshot
Efficient enumeration of all minimal separators in a graph
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)86737-0openalex-snapshot
Local and global relational consistency
inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00021-8openalex-snapshot
Shortest paths in digraphs of small treewidth. Part II: Optimal parallel algorithms
inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00226-6openalex-snapshot
Generating irregular partitionable data structures
inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00342-9openalex-snapshot
The hardness of perfect phylogeny, feasible register assignment and other problems on thin colored graphs
inferred← citeshttps://doi.org/10.1016/s1571-0653(04)00379-8openalex-snapshot
Fast approximation schemes for K3, 3-minor-free or K5-minor-free graphs
inferred← citeshttps://doi.org/10.1016/s1574-6526(06)80011-8openalex-snapshot
Tractable Structures for Constraint Satisfaction Problems
showing the first 200 of 308 · page through all 308
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.