Finding approximate separators and computing tree width quickly
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Efficient decision procedures for graph properties on context-free graph languages
Journal of the ACM (JACM)
A linear time algorithm for finding tree-decompositions of small treewidth
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
An algebraic theory of graph reduction
Journal of the ACM (JACM)
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
A data structure for dynamically maintaining rooted trees
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Approximating the minimum equivalent digraph
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
The maximum subforest problem: approximation and exact algorithms
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Approximating the domatic number
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
On local search and placement of meters in networks
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Colored Tutte polynomials and Kaufman brackets for graphs of bounded tree width
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
The parameterized complexity of database queries
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
The complexity of acyclic conjunctive queries
Journal of the ACM (JACM)
Proceedings of the 2001 international symposium on Symbolic and algebraic computation
The complexity of the Kn,n-problem for node replacement graph languages
Information and Computation
Information and Computation
Counting H-colorings of partial k-trees
Theoretical Computer Science
Exploiting structure in quantified formulas
Journal of Algorithms
Query evaluation via tree-decompositions
Journal of the ACM (JACM)
Query Evaluation via Tree-Decompositions
ICDT '01 Proceedings of the 8th International Conference on Database Theory
Deciding Clique-Width for Graphs of Bounded Tree-Width
WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures
Deciding First-Order Properties of Locally Tree-Decomposalbe Graphs
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Total Colorings of Degenerated Graphs
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
The Edge-Disjoint Paths Problem is NP-Complete for Partial k-Trees
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
A Linear Algorithm for Finding Total Colorings of Partial k-Trees
ISAAC '99 Proceedings of the 10th International Symposium on Algorithms and Computation
Efficient Algorithms for Weighted Colorings of Series-Parallel Graphs
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
Generalized Model-Checking Problems for First-Order Logic
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Generalized Model-Checking over Locally Tree-Decomposable Classes
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Algorithm for the Cost Edge-Coloring of Trees
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
Counting H-Colorings of Partial k-Trees
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
Algorithms for the Multicolorings of Partial k-Trees
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
Efficient Analysis of Graphs with Small Minimal Separators
WG '99 Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science
An Improved Algorithm for Finding Tree Decompositions of Small Width
WG '99 Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science
The Tree-Width of Clique-Width Bounded Graphs Without Kn, n
WG '00 Proceedings of the 26th International Workshop on Graph-Theoretic Concepts in Computer Science
Descriptive and Parameterized Complexity
CSL '99 Proceedings of the 13th International Workshop and 8th Annual Conference of the EACSL on Computer Science Logic
Farrell polynomials on graphs of bounded tree width
Advances in Applied Mathematics - Special issue on: Formal power series and algebraic combinatorics in memory of Rodica Simion, 1955-2000
Algorithms for vertex-partitioning problems on graphs with fixed clique-width
Theoretical Computer Science
Parameterized complexity of vertex colouring
Discrete Applied Mathematics
Tree-width and the monadic quantifier hierarchy
Theoretical Computer Science - Logic and complexity in computer science
Splitting a graph into disjoint induced paths or cycles
Discrete Applied Mathematics - Special issue: The second international colloquium, "journées de l'informatique messine"
Fusion in relational structures and the verification of monadic second-order properties
Mathematical Structures in Computer Science
Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width
Journal of Algorithms
Approximation algorithms for partial covering problems
Journal of Algorithms
A polynomial time algorithm for strong edge coloring of partial k-trees
Discrete Applied Mathematics
Querying Linguistic Treebanks with Monadic Second-Order Logic in Linear Time
Journal of Logic, Language and Information
Coloured Tutte polynomials and Kauffman brackets for graphs of bounded tree width
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Space-efficient construction variants of dynamic programming
Nordic Journal of Computing
Fixed-parameter algorithms for (k, r)-center in planar graphs and map graphs
ACM Transactions on Algorithms (TALG)
On algorithms for (P5,gem)-free graphs
Theoretical Computer Science - Graph colorings
Compatibility of unrooted phylogenetic trees is FPT
Theoretical Computer Science - Parameterized and exact computation
Trees, grids, and MSO decidability: from graphs to matroids
Theoretical Computer Science - Parameterized and exact computation
Efficient Parameterized Algorithms for Biopolymer Structure-Sequence Alignment
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Approximation algorithms for optimization problems in graphs with superlogarithmic treewidth
Information Processing Letters
Tree-edges deletion problems with bounded diameter obstruction sets
Discrete Applied Mathematics
Algorithms for finding distance-edge-colorings of graphs
Journal of Discrete Algorithms
Subgraph isomorphism, log-bounded fragmentation, and graphs of (locally) bounded treewidth
Journal of Computer and System Sciences
MSOL partitioning problems on graphs of bounded treewidth and clique-width
Theoretical Computer Science
A logical approach to multicut problems
Information Processing Letters
Planar Branch Decompositions I: The Ratcatcher
INFORMS Journal on Computing
Planar Branch Decompositions II: The Cycle Method
INFORMS Journal on Computing
Generalized hypertree decompositions: np-hardness and tractable variants
Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Monadic datalog over finite structures with bounded treewidth
Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
First-order queries on structures of bounded degree are computable with constant delay
ACM Transactions on Computational Logic (TOCL)
Maximum independent sets in graphs of low degree
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Computational properties of argument systems satisfying graph-theoretic constraints
Artificial Intelligence
Tree decomposition and discrete optimization problems: A survey
Cybernetics and Systems Analysis
Planar graph bipartization in linear time
Discrete Applied Mathematics
Optimal branch-decomposition of planar graphs in O(n3) Time
ACM Transactions on Algorithms (TALG)
Solving some NP-complete problems using split decomposition
Discrete Applied Mathematics
The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number
CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
A PTAS for the Sparsest Spanners Problem on Apex-Minor-Free Graphs
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
Monadic Second Order Logic on Graphs with Local Cardinality Constraints
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
Solving problems on recursively constructed graphs
ACM Computing Surveys (CSUR)
Approximability of partitioning graphs with supply and demand
Journal of Discrete Algorithms
Minimum cycle cover and Chinese postman problems on mixed graphs with bounded tree-width
Discrete Applied Mathematics
Fast Counting with Bounded Treewidth
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Clique-width: on the price of generality
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Complexity of the Packing Coloring Problem for Trees
Graph-Theoretic Concepts in Computer Science
Triangulation of Bayesian networks with recursive estimation of distribution algorithms
International Journal of Approximate Reasoning
Partitioning graphs of supply and demand
Discrete Applied Mathematics
Size and treewidth bounds for conjunctive queries
Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Generalized hypertree decompositions: NP-hardness and tractable variants
Journal of the ACM (JACM)
Bounded treewidth as a key to tractability of knowledge representation and reasoning
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
A Practical Approach to Courcelle's Theorem
Electronic Notes in Theoretical Computer Science (ENTCS)
Belief Revision with Bounded Treewidth
LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
A comparison of structural CSP decomposition methods
IJCAI'99 Proceedings of the 16th international joint conference on Artifical intelligence - Volume 1
Bounded treewidth as a key to tractability of knowledge representation and reasoning
Artificial Intelligence
Algorithms and complexity results for pursuit-evasion problems
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
On the complexity of compact coalitional games
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
A Short Cut to Optimal Sequences
APLAS '09 Proceedings of the 7th Asian Symposium on Programming Languages and Systems
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Coloured Tutte polynomials and Kauffman brackets for graphs of bounded tree width
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Splitting a graph into disjoint induced paths or cycles
Discrete Applied Mathematics
Approximation algorithms for optimization problems in graphs with superlogarithmic treewidth
Information Processing Letters
minimum dominating set of queens: A trivial programming exercise?
Discrete Applied Mathematics
Complexity of the packing coloring problem for trees
Discrete Applied Mathematics
Treewidth: structure and algorithms
SIROCCO'07 Proceedings of the 14th international conference on Structural information and communication complexity
Computing representations of matroids of bounded branch-width
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Kernelizations for parameterized counting problems
TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
Easy problems for grid-structured graphs
FAW'07 Proceedings of the 1st annual international conference on Frontiers in algorithmics
On the complexity of some colorful problems parameterized by treewidth
COCOA'07 Proceedings of the 1st international conference on Combinatorial optimization and applications
A note on root choice for parallel processing of tree decompositions
KES-AMSTA'08 Proceedings of the 2nd KES International conference on Agent and multi-agent systems: technologies and applications
Computing branch decomposition of large planar graphs
WEA'08 Proceedings of the 7th international conference on Experimental algorithms
Optimization and recognition for K5-minor free graphs in linear time
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Tree-width in Algebraic Complexity
Fundamenta Informaticae - Bridging Logic and Computer Science: to Johann A. Makowsky for his 60th birthday
Optimal root choice for parallel processing of tree decompositions
International Journal of Intelligent Information and Database Systems
Linkless and flat embeddings in 3-space and the unknot problem
Proceedings of the twenty-sixth annual symposium on Computational geometry
Monadic datalog over finite structures of bounded treewidth
ACM Transactions on Computational Logic (TOCL)
Tractability in Value-based Argumentation
Proceedings of the 2010 conference on Computational Models of Argument: Proceedings of COMMA 2010
A practical algorithm for finding optimal triangulations
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
Monadic second order logic on graphs with local cardinality constraints
ACM Transactions on Computational Logic (TOCL)
Decomposition width of matroids
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Algorithmic meta-theorems for restrictions of treewidth
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Compact labelings for efficient first-order model-checking
Journal of Combinatorial Optimization
On the complexity of some colorful problems parameterized by treewidth
Information and Computation
Approximation of minimum weight spanners for sparse graphs
Theoretical Computer Science
Counting and enumeration problems with bounded treewidth
LPAR'10 Proceedings of the 16th international conference on Logic for programming, artificial intelligence, and reasoning
New results on the complexity of the max- and min-rep problems
SOFSEM'11 Proceedings of the 37th international conference on Current trends in theory and practice of computer science
Intractability of Clique-Width Parameterizations
SIAM Journal on Computing
Monadic second-order model-checking on decomposable matroids
Discrete Applied Mathematics
Theoretical Computer Science
Maximal matching and path matching counting in polynomial time for graphs of bounded clique width
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
Linear-time algorithms for graphs of bounded rankwidt: a fresh look using game theory
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
On the complexity of core, kernel, and bargaining set
Artificial Intelligence
Problems parameterized by treewidth tractable in single exponential time: a logical approach
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
Guard games on graphs: Keep the intruder out!
Theoretical Computer Science
Efficient approximation for triangulation of minimum treewidth
UAI'01 Proceedings of the Seventeenth conference on Uncertainty in artificial intelligence
A sufficiently fast algorithm for finding close to optimal junction trees
UAI'96 Proceedings of the Twelfth international conference on Uncertainty in artificial intelligence
Treewidth: characterizations, applications, and computations
WG'06 Proceedings of the 32nd international conference on Graph-Theoretic Concepts in Computer Science
Approximate tree decompositions of planar graphs in linear time
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Bidimensionality and geometric graphs
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
A logic of reachable patterns in linked data-structures
FOSSACS'06 Proceedings of the 9th European joint conference on Foundations of Software Science and Computation Structures
Optimal branch-decomposition of planar graphs in O(n3) time
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Approximation and complexity of k–splittable flows
WAOA'05 Proceedings of the Third international conference on Approximation and Online Algorithms
The complexity of two graph orientation problems
Discrete Applied Mathematics
MSO queries on tree decomposable structures are computable with linear delay
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
Algorithms for finding distance-edge-colorings of graphs
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Partitioning a multi-weighted graph to connected subgraphs of almost uniform size
COCOON'06 Proceedings of the 12th annual international conference on Computing and Combinatorics
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Efficient parameterized algorithm for biopolymer structure-sequence alignment
WABI'05 Proceedings of the 5th International conference on Algorithms in Bioinformatics
Elegant distance constrained labelings of trees
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
Coloring a graph using split decomposition
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
Partitioning a weighted graph to connected subgraphs of almost uniform size
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
Decomposition width of matroids
Discrete Applied Mathematics
On the OBDD size for graphs of bounded tree- and clique-width
IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
Fixed-parameter tractability results for full-degree spanning tree and its dual
IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
Random separation: a new method for solving fixed-cardinality optimization problems
IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
Approximability of partitioning graphs with supply and demand
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Multicut algorithms via tree decompositions
CIAC'10 Proceedings of the 7th international conference on Algorithms and Complexity
Algorithmic aspects of dominator colorings in graphs
IWOCA'11 Proceedings of the 22nd international conference on Combinatorial Algorithms
Exploiting bounded treewidth with datalog (a survey)
Datalog'10 Proceedings of the First international conference on Datalog Reloaded
Recognizing polar planar graphs using new results for monopolarity
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
A combinatorial optimization algorithm for solving the branchwidth problem
Computational Optimization and Applications
Size and Treewidth Bounds for Conjunctive Queries
Journal of the ACM (JACM)
Parameterized complexity of firefighting revisited
IPEC'11 Proceedings of the 6th international conference on Parameterized and Exact Computation
Research paper: Combinatorial and computational aspects of graph packing and graph decomposition
Computer Science Review
On the directed Full Degree Spanning Tree problem
Discrete Optimization
Paths of bounded length and their cuts: Parameterized complexity and algorithms
Discrete Optimization
On the feedback vertex set polytope of a series-parallel graph
Discrete Optimization
Tree-width and the Sherali-Adams operator
Discrete Optimization
Fixed-Parameter tractability of treewidth and pathwidth
The Multivariate Algorithmic Revolution and Beyond
Graph minors and parameterized algorithm design
The Multivariate Algorithmic Revolution and Beyond
Strong backdoors to nested satisfiability
SAT'12 Proceedings of the 15th international conference on Theory and Applications of Satisfiability Testing
Thue Specifications and Their Monadic Second-order Properties
Fundamenta Informaticae
Connected coloring completion for general graphs: algorithms and complexity
COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics
Quadratic kernelization for convex recoloring of trees
COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics
Hyper-T-width and hyper-D-width: Stable connectivity measures for hypergraphs
Theoretical Computer Science
Constrained cycle covers in Halin graphs
ESCAPE'07 Proceedings of the First international conference on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies
Abstract argumentation via monadic second order logic
SUM'12 Proceedings of the 6th international conference on Scalable Uncertainty Management
European Journal of Combinatorics
Polar permutation graphs are polynomial-time recognisable
European Journal of Combinatorics
Computability of width of submodular partition functions
European Journal of Combinatorics
A unified approach to polynomial algorithms on graphs of bounded (bi-)rank-width
European Journal of Combinatorics
Probabilistic inference and monadic second order logic
TCS'12 Proceedings of the 7th IFIP TC 1/WG 202 international conference on Theoretical Computer Science
Efficient algorithms for the max k-vertex cover problem
TCS'12 Proceedings of the 7th IFIP TC 1/WG 202 international conference on Theoretical Computer Science
Enumeration of first-order queries on classes of structures with bounded expansion
Proceedings of the 32nd symposium on Principles of database systems
Proceedings of the 2nd ACM SIGPLAN workshop on Functional high-performance computing
Effective computation of immersion obstructions for unions of graph classes
Journal of Computer and System Sciences
The Cunningham-Geelen Method in Practice: Branch-Decompositions and Integer Programming
INFORMS Journal on Computing
Algorithms for unipolar and generalized split graphs
Discrete Applied Mathematics
Kernel bounds for path and cycle problems
Theoretical Computer Science
Polynomial-time algorithms for special cases of the maximum confluent flow problem
Discrete Applied Mathematics
Algorithms for decision problems in argument systems under preferred semantics
Artificial Intelligence
Model Checking for Successor-Invariant First-Order Logic on Minor-Closed Graph Classes
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
| Hi-index | 0.01 |