Finding approximate separators and computing tree width quickly
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
On the equivalence of recursive and nonrecursive datalog programs
PODS '92 Proceedings of the eleventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Efficient decision procedures for graph properties on context-free graph languages
Journal of the ACM (JACM)
POPL '93 Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
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)
The complexity of connectivity problems on context-free graph languages
Journal of Computer and System Sciences
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
The maximum subforest problem: approximation and exact algorithms
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Make it practical: a generic linear-time algorithm for solving maximum-weightsum problems
ICFP '00 Proceedings of the fifth ACM SIGPLAN international conference on Functional programming
Theoretical Computer Science
Exploiting structure in quantified formulas
Journal of Algorithms
Uniform and nonuniform recognizability
Theoretical Computer Science
Deciding Clique-Width for Graphs of Bounded Tree-Width
WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Infinite Series-Parallel Posets: Logic and Languages
ICALP '00 Proceedings of the 27th 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
A Model Theoretic Proof of Büchi-Type Theorems and First-Order Logic for N-Free Pomsets
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Branch-Width, Parse Trees, and Monadic Second-Order Logic for Matroids
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Pomsets for Local Trace Languages - Recognizability, Logic & Petri Nets
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
Counting H-Colorings of Partial k-Trees
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
Synchronized Tree Languages Revisited and New Applications
FoSSaCS '01 Proceedings of the 4th International Conference on Foundations of Software Science and Computation Structures
Tutorial Introduction to Graph Transformation: A Software Engineering Perspective
ICGT '02 Proceedings of the First International Conference on Graph Transformation
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
Graph Subcolorings: Complexity and Algorithms
WG '01 Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science
Second-Order Logic over Strings: Regular and Non-regular Fragments
DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
Recognizable Sets of N-Free Pomsets Are Monadically Axiomatizable
DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
Pomsets for local trace languages
Journal of Automata, Languages and Combinatorics - Selected papers of the workshop on logic and algebra for concurrency
The monadic second-order logic of graphs XIV: uniformly sparse graphs and edge set quantifications
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"
Existential second-order logic over graphs: Charting the tractability frontier
Journal of the ACM (JACM)
On the logical definability of centrain graph and poset languages
Journal of Automata, Languages and Combinatorics
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)
Algebraic recognizability of regular tree languages
Theoretical Computer Science - The art of theory
Linear time low tree-width partitions and algorithmic consequences
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Compatibility of unrooted phylogenetic trees is FPT
Theoretical Computer Science - Parameterized and exact computation
The recognizability of sets of graphs is a robust property
Theoretical Computer Science
Branch-width, parse trees, and monadic second-order logic for matroids
Journal of Combinatorial Theory Series B
Message-passing automata are expressively equivalent to EMSO logic
Theoretical Computer Science - Concurrency theory (CONCUR 2004)
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Vertex-minors, monadic second-order logic, and a conjecture by Seese
Journal of Combinatorial Theory Series B
Tree-edges deletion problems with bounded diameter obstruction sets
Discrete Applied Mathematics
Algorithms for finding distance-edge-colorings of graphs
Journal of Discrete Algorithms
Planar Branch Decompositions I: The Ratcatcher
INFORMS Journal on Computing
Computational properties of argument systems satisfying graph-theoretic constraints
Artificial Intelligence
On the complexity of dominating set problems related to the minimum all-ones problem
Theoretical Computer Science
Tree decomposition and discrete optimization problems: A survey
Cybernetics and Systems Analysis
The computational complexity of the parallel knock-out problem
Theoretical Computer Science
Grad and classes with bounded expansion I. Decompositions
European Journal of Combinatorics
Grad and classes with bounded expansion II. Algorithmic aspects
European Journal of Combinatorics
Planar graph bipartization in linear time
Discrete Applied Mathematics
Querying business processes with BP-QL
Information Systems
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
On the Recognizability of Arrow and Graph Languages
ICGT '08 Proceedings of the 4th international conference on Graph Transformations
Type inference and type checking for queries on execution traces
Proceedings of the VLDB Endowment
Querying web-based applications under models of uncertainty
Proceedings of the VLDB Endowment
Solving problems on recursively constructed graphs
ACM Computing Surveys (CSUR)
Minimum cycle cover and Chinese postman problems on mixed graphs with bounded tree-width
Discrete Applied Mathematics
Treewidth and logical definability of graph products
Theoretical Computer Science
The parameterized complexity of the induced matching problem
Discrete Applied Mathematics
Datalog±: a unified approach to ontologies and integrity constraints
Proceedings of the 12th International Conference on Database Theory
TOP-K projection queries for probabilistic business processes
Proceedings of the 12th International Conference on Database Theory
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
A Practical Approach to Courcelle's Theorem
Electronic Notes in Theoretical Computer Science (ENTCS)
Regular tree languages definable in FO and in FOmod
ACM Transactions on Computational Logic (TOCL)
Induced Packing of Odd Cycles in a Planar Graph
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Parameterizing Cut Sets in a Graph by the Number of Their Components
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
On parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-width
Discrete Applied Mathematics
The specker-blatter theorem revisited
COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
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
On the complexity of some colorful problems parameterized by treewidth
COCOA'07 Proceedings of the 1st international conference on Combinatorial optimization and applications
Querying structural and behavioral properties of business processes
DBPL'07 Proceedings of the 11th international conference on Database programming languages
Distance constrained labelings of trees
TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
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
Monadic datalog over finite structures of bounded treewidth
ACM Transactions on Computational Logic (TOCL)
Decomposition width of matroids
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Parameterized modal satisfiability
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
Algorithmic properties of millstream systems
DLT'10 Proceedings of the 14th international conference on Developments in language theory
Algorithms and theory of computation handbook
Approximation algorithms for intersection graphs
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Algorithmic meta-theorems for restrictions of treewidth
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Spanners of bounded degree graphs
Information Processing Letters
Optimal top-k query evaluation for weighted business processes
Proceedings of the VLDB Endowment
On the complexity of some colorful problems parameterized by treewidth
Information and Computation
Recognizable graph languages for the verification of dynamic systems
ICGT'10 Proceedings of the 5th international conference on Graph transformations
Querying probabilistic business processes for sub-flows
Proceedings of the 14th International Conference on Database Theory
European Journal of Combinatorics
The model checking problem for prefix classes of second-order logic: a survey
Fields of logic and computation
Computing role assignments of proper interval graphs in polynomial time
IWOCA'10 Proceedings of the 21st international conference on Combinatorial algorithms
On rules with existential variables: Walking the decidability line
Artificial Intelligence
Contracting planar graphs to contractions of triangulations
Journal of Discrete Algorithms
Discrete Applied Mathematics
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
Journal of Computer and System Sciences
Contracting a chordal graph to a split graph or a tree
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
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
Enumeration of minimal dominating sets and variants
FCT'11 Proceedings of the 18th international conference on Fundamentals of computation theory
Ontological query answering with existential rules
RR'11 Proceedings of the 5th international conference on Web reasoning and rule systems
Parameterizing cut sets in a graph by the number of their components
Theoretical Computer Science
Parameterized complexity results for 1-safe Petri nets
CONCUR'11 Proceedings of the 22nd international conference on Concurrency theory
On Bounded-Degree Vertex Deletion parameterized by treewidth
Discrete Applied Mathematics
Treewidth: characterizations, applications, and computations
WG'06 Proceedings of the 32nd international conference on Graph-Theoretic Concepts in Computer Science
Finding an induced path of given parity in planar graphs in polynomial 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
Logics for unranked trees: an overview
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Distance constrained labelings of graphs of bounded treewidth
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
The complexity of two graph orientation problems
Discrete Applied Mathematics
Induced packing of odd cycles in planar graphs
Theoretical Computer Science
Model-checking hierarchical structures
Journal of Computer and System Sciences
Algorithms for finding distance-edge-colorings of graphs
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Type inference and type checking for queries over execution traces
The VLDB Journal — The International Journal on Very Large Data Bases
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
L(2, 1, 1)-labeling is NP-complete for trees
TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
Automata and logics for unranked and unordered trees
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
Towards a characterization of order-invariant queries over tame structures
CSL'05 Proceedings of the 19th international conference on Computer Science Logic
Elegant distance constrained labelings of trees
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
Tree-width of hypergraphs and surface duality
Journal of Combinatorial Theory Series B
Distance three labelings of trees
Discrete Applied Mathematics
On graph contractions and induced minors
Discrete Applied Mathematics
On the model-checking of monadic second-order formulas with edge set quantifications
Discrete Applied Mathematics
Decomposition width of matroids
Discrete Applied Mathematics
Random separation: a new method for solving fixed-cardinality optimization problems
IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
Automata on directed graphs: edge versus vertex marking
ICGT'06 Proceedings of the Third international conference on Graph Transformations
Algorithmic aspects of dominator colorings in graphs
IWOCA'11 Proceedings of the 22nd international conference on Combinatorial Algorithms
The computational complexity of the parallel knock-out problem
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
Exploiting bounded treewidth with datalog (a survey)
Datalog'10 Proceedings of the First international conference on Datalog Reloaded
Generalized above guarantee vertex cover and r-partization
WALCOM'12 Proceedings of the 6th international conference on Algorithms and computation
A combinatorial optimization algorithm for solving the branchwidth problem
Computational Optimization and Applications
Towards fixed-parameter tractable algorithms for abstract argumentation
Artificial Intelligence
Computing role assignments of proper interval graphs in polynomial time
Journal of Discrete Algorithms
Size and Treewidth Bounds for Conjunctive Queries
Journal of the ACM (JACM)
Contracting graphs to paths and trees
IPEC'11 Proceedings of the 6th international conference on Parameterized and Exact Computation
Increasing the minimum degree of a graph by contractions
IPEC'11 Proceedings of the 6th international conference on Parameterized and Exact Computation
Parameterized complexity and fixed-parameter tractability of description logic reasoning
LPAR'12 Proceedings of the 18th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
The dag-width of directed graphs
Journal of Combinatorial Theory Series B
Walking the complexity lines for generalized guarded existential rules
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
Extending decidable existential rules by joining acyclicity and guardedness
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
On the algorithmic effectiveness of digraph decompositions and complexity measures
Discrete Optimization
On the feedback vertex set polytope of a series-parallel graph
Discrete Optimization
Partial degree bounded edge packing problem
FAW-AAIM'12 Proceedings of the 6th international Frontiers in Algorithmics, and Proceedings of the 8th international conference on Algorithmic Aspects in Information and Management
Fixed-Parameter tractability of treewidth and pathwidth
The Multivariate Algorithmic Revolution and Beyond
Deciding first order properties of matroids
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
WAW'12 Proceedings of the 9th international conference on Algorithms and Models for the Web Graph
A single-exponential FPT algorithm for the K4- minor cover problem
SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
Cluster vertex deletion: a parameterization between vertex cover and clique-width
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
When trees grow low: shrubs and fast MSO1
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Obtaining planarity by contracting few edges
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
A LOWER BOUND ON THE GROWTH OF FUNCTIONS COMPUTED BY TREE TRANSDUCERS
Fundamenta Informaticae
Counterpart Semantics for a Second-Order μ-Calculus
Fundamenta Informaticae - Recent Developments in the Theory of Graph Transformation, 2010
Parameterized algorithms for directed maximum leaf problems
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
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
European Journal of Combinatorics
Computability of width of submodular partition functions
European Journal of Combinatorics
Weighted counting of k-matchings is #w[1]-hard
IPEC'12 Proceedings of the 7th international conference on Parameterized and Exact Computation
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
Efficient symbolic implementation of graph automata with applications to invariant checking
ICGT'12 Proceedings of the 6th international conference on Graph Transformations
Optimization problems in dotted interval graphs
WG'12 Proceedings of the 38th international conference on Graph-Theoretic Concepts in Computer Science
Set graphs. I. Hereditarily finite sets and extensional acyclic orientations
Discrete Applied Mathematics
Obtaining planarity by contracting few edges
Theoretical Computer Science
Parameterized complexity of discrete morse theory
Proceedings of the twenty-ninth annual symposium on Computational geometry
Fast hamiltonicity checking via bases of perfect matchings
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Testing first-order properties for subclasses of sparse graphs
Journal of the ACM (JACM)
Proceedings of the 2nd ACM SIGPLAN workshop on Functional high-performance computing
Counting matchings of size k is # W[1]-hard
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
Model checking lower bounds for simple graphs
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
FO model checking of interval graphs
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
FCT'13 Proceedings of the 19th international conference on Fundamentals of Computation Theory
Lower bounds on the complexity of MSO1 model-checking
Journal of Computer and System Sciences
The Cunningham-Geelen Method in Practice: Branch-Decompositions and Integer Programming
INFORMS Journal on Computing
Preprocessing subgraph and minor problems: When does a small vertex cover help?
Journal of Computer and System Sciences
Kernel bounds for path and cycle problems
Theoretical Computer Science
Algorithms for decision problems in argument systems under preferred semantics
Artificial Intelligence
Coloring graphs without short cycles and long induced paths
Discrete Applied Mathematics
Taming the infinite chase: query answering under expressive relational constraints
Journal of Artificial Intelligence Research
Digraphs of bounded elimination width
Discrete Applied Mathematics
| Hi-index | 0.01 |