An algebraic theory of graph reduction
Journal of the ACM (JACM)
Software architecture styles as graph grammars
SIGSOFT '96 Proceedings of the 4th ACM SIGSOFT symposium on Foundations of software engineering
Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
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
The parameterized complexity of database queries
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Computing crossing numbers in quadratic time
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Datalog LITE: a deductive query language with linear time model checking
ACM Transactions on Computational Logic (TOCL)
Node rewriting in graphs and hypergraphs: a categorical framework
Theoretical Computer Science
Deciding first-order properties of locally tree-decomposable structures
Journal of the ACM (JACM)
Monadic datalog and the expressive power of languages for web information extraction
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Query automata over finite trees
Theoretical Computer Science
A unified language processing methodology
Theoretical Computer Science
Query evaluation via tree-decompositions
Journal of the ACM (JACM)
Describing Software Architecture Styles Using Graph Grammars
IEEE Transactions on Software Engineering
Parameterized complexity for the database theorist
ACM SIGMOD Record
On infinite transition graphs having a decidable monadic theory
Theoretical Computer Science
Uniform and nonuniform recognizability
Theoretical Computer Science
An operational and denotational approach to non-context-freeness
Theoretical Computer Science - Algebraic methods in language processing
Definability and Descriptive Complexity on Databases of Bounded Tree-Width
ICDT '99 Proceedings of the 7th International Conference on Database Theory
Query Evaluation via Tree-Decompositions
ICDT '01 Proceedings of the 8th International Conference on Database Theory
Automatic Graphs and Graph D0L-Systems
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
Regularity of Congruential Graphs
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
Rational Graphs Trace Context-Sensitive Languages
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Hypertree Decompositions: A Survey
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
On Infinite Terms Having a Decidable Monadic Theory
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Deciding First-Order Properties of Locally Tree-Decomposalbe Graphs
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Hypergraphs in Model Checking: Acyclicity and Hypertree-Width versus Clique-Width
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
On Families of Graphs Having a Decidable First Order Theory with Reachability
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
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
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
Counting H-Colorings of Partial k-Trees
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
FOSSACS '00 Proceedings of the Third International Conference on Foundations of Software Science and Computation Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software,ETAPS 2000
On Word Rewriting Systems Having a Rational Derivation
FOSSACS '00 Proceedings of the Third International Conference on Foundations of Software Science and Computation Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software,ETAPS 2000
Structured Formal Verification of a Fragment of the IBM S/390 Clock Chip
FM-Trends 98 Proceedings of the International Workshop on Current Trends in Applied Formal Method: Applied Formal Methods
Graph Subcolorings: Complexity and Algorithms
WG '01 Proceedings of the 27th 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
On the Transition Graphs of Turing Machines
MCU '01 Proceedings of the Third International Conference on Machines, Computations, and Universality
UnQL: a query language and algebra for semistructured data based on structural recursion
The VLDB Journal — The International Journal on Very Large Data Bases
On the transition graphs of Turing machines
Theoretical Computer Science
Iterative-free program analysis
ICFP '03 Proceedings of the eighth ACM SIGPLAN international conference on Functional programming
Monadic datalog and the expressive power of languages for Web information extraction
Journal of the ACM (JACM)
The parametrized complexity of knot polynomials
Journal of Computer and System Sciences - Special issue on Parameterized computation and complexity
Computing crossing numbers in quadratic time
Journal of Computer and System Sciences - STOC 2001
Finite state machines for strings over infinite alphabets
ACM Transactions on Computational Logic (TOCL)
Logic-based web information extraction
ACM SIGMOD Record
Journal of Automata, Languages and Combinatorics
Querying Linguistic Treebanks with Monadic Second-Order Logic in Linear Time
Journal of Logic, Language and Information
The Lixto data extraction project: back and forth between theory and practice
PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
On the decidability of containment of recursive datalog queries - preliminary report
PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Datalog programs and their persistency numbers
ACM Transactions on Computational Logic (TOCL)
Fixed-parameter algorithms for (k, r)-center in planar graphs and map graphs
ACM Transactions on Algorithms (TALG)
Linear time low tree-width partitions and algorithmic consequences
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Tractable database design through bounded treewidth
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Processing queries on tree-structured data efficiently
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Improved bottleneck domination algorithms
Discrete Applied Mathematics
Using MONA for querying linguistic treebanks
HLT '05 Proceedings of the conference on Human Language Technology and Empirical Methods in Natural Language Processing
Quickly deciding minor-closed parameters in general graphs
European Journal of Combinatorics
A logical approach to multicut problems
Information Processing Letters
Computing crossing number in linear time
Proceedings of the thirty-ninth annual ACM symposium on Theory of 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
Digraph measures: Kelly decompositions, games, and orderings
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Tree decomposition and discrete optimization problems: A survey
Cybernetics and Systems Analysis
On the fixed-parameter tractability of parameterized model-checking problems
Information Processing Letters
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Modeling and Verifying Graph Transformations in Proof Assistants
Electronic Notes in Theoretical Computer Science (ENTCS)
Digraph measures: Kelly decompositions, games, and orderings
Theoretical Computer Science
An Algorithm for Approximating the Satisfiability Problem of High-level Conditions
Electronic Notes in Theoretical Computer Science (ENTCS)
On Integer Programming and the Branch-Width of the Constraint Matrix
IPCO '07 Proceedings of the 12th international conference on Integer Programming and Combinatorial Optimization
Monadic Second Order Logic on Graphs with Local Cardinality Constraints
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
Resolution-Like Theorem Proving for High-Level Conditions
ICGT '08 Proceedings of the 4th international conference on Graph Transformations
ACM Computing Surveys (CSUR)
Fast Counting with Bounded Treewidth
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Graph-Theoretic Concepts in Computer Science
Correctness of high-level transformation systems relative to nested conditions†
Mathematical Structures in Computer Science
Representing, Querying and Transforming Social Networks with RDF/SPARQL
ESWC 2009 Heraklion Proceedings of the 6th European Semantic Web Conference on The Semantic Web: Research and Applications
Generalized hypertree decompositions: NP-hardness and tractable variants
Journal of the ACM (JACM)
SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
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
Efficient datalog abduction through bounded treewidth
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 2
Abduction with bounded treewidth: from theoretical tractability to practically efficient computation
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 3
Bounded treewidth as a key to tractability of knowledge representation and reasoning
Artificial Intelligence
Undecidability and intractability results concerning datalog programs and their persistency numbers
ACM Transactions on Computational Logic (TOCL)
On the complexity of compact coalitional games
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Answer-set programming with bounded treewidth
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
Tractable database design and datalog abduction through bounded treewidth
Information Systems
Bounded fixed-parameter tractability and log2n nondeterministic bits
Journal of Computer and System Sciences
Automatic verification of sequential infinite-state processes
Automatic verification of sequential infinite-state processes
Fixed-parameter algorithms for the (k, r)-center in planar graphs and map graphs
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Obtaining a planar graph by vertex deletion
WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science
From tree-based generators to delegation networks
CAI'07 Proceedings of the 2nd international conference on Algebraic informatics
Undirected graphs of entanglement 2
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
IWPEC'08 Proceedings of the 3rd international conference on Parameterized and exact computation
On the parameterised intractability of monadic second-order logic
CSL'09/EACSL'09 Proceedings of the 23rd CSL international conference and 18th EACSL Annual conference on Computer science logic
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)
Reasoning in Argumentation Frameworks of Bounded Clique-Width
Proceedings of the 2010 conference on Computational Models of Argument: Proceedings of COMMA 2010
Journal of Automated Reasoning
On brambles, grid-like minors, and parameterized intractability of monadic second-order logic
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Monadic second order logic on graphs with local cardinality constraints
ACM Transactions on Computational Logic (TOCL)
Algorithmic properties of millstream systems
DLT'10 Proceedings of the 14th international conference on Developments in language theory
Parity games with partial information played on graphs of bounded complexity
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
On monadic second-order theories of multidominance structures
MOL'07/09 Proceedings of the 10th and 11th Biennial conference on The mathematics of language
Counting and enumeration problems with bounded treewidth
LPAR'10 Proceedings of the 16th international conference on Logic for programming, artificial intelligence, and reasoning
On the Boolean-width of a graph: structure and applications
WG'10 Proceedings of the 36th international conference on Graph-theoretic concepts in computer science
On making a distinguished vertex minimum degree by vertex deletion
SOFSEM'11 Proceedings of the 37th international conference on Current trends in theory and practice of computer science
The complexity status of problems related to sparsest cuts
IWOCA'10 Proceedings of the 21st international conference on Combinatorial algorithms
On the complexity of core, kernel, and bargaining set
Artificial Intelligence
Faster parameterized algorithms for minor containment
Theoretical Computer Science
Dominating set is fixed parameter tractable in claw-free graphs
Theoretical Computer Science
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Highly acyclic groups, hypergraph covers, and the guarded fragment
Journal of the ACM (JACM)
Faster approximation schemes and parameterized algorithms on (odd-)H-minor-free graphs
Theoretical Computer Science
Model-checking hierarchical structures
Journal of Computer and System Sciences
MSO queries on tree decomposable structures are computable with linear delay
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
On the expressive power of graph logic
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
A formal comparison of visual web wrapper generators
SOFSEM'06 Proceedings of the 32nd conference on Current Trends in Theory and Practice of Computer Science
Faster parameterized algorithms for minor containment
SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
Decidability of MSO theories of tree structures
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
Matrix approach to graph transformation: matching and sequences
ICGT'06 Proceedings of the Third international conference on Graph Transformations
Synchronization of pushdown automata
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
A linear time algorithm for the minimum spanning caterpillar problem for bounded treewidth graphs
SIROCCO'10 Proceedings of the 17th international conference on Structural Information and Communication Complexity
Multicut algorithms via tree decompositions
CIAC'10 Proceedings of the 7th international conference on Algorithms and Complexity
Exploiting bounded treewidth with datalog (a survey)
Datalog'10 Proceedings of the First international conference on Datalog Reloaded
The complexity of finding uniform sparsest cuts in various graph classes
Journal of Discrete Algorithms
On the parameterized complexity of default logic and autoepistemic logic
LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
Model checking languages of data words
FOSSACS'12 Proceedings of the 15th international conference on Foundations of Software Science and Computational Structures
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
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
The parameterized complexity of k-edge induced subgraphs
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
First-Order and Monadic Second-Order Model-Checking on Ordered Structures
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
A strategy language for graph rewriting
LOPSTR'11 Proceedings of the 21st international conference on Logic-Based Program Synthesis and Transformation
Test generation from recursive tiles systems
TAP'12 Proceedings of the 6th international conference on Tests and Proofs
Thue Specifications and Their Monadic Second-order Properties
Fundamenta Informaticae
(UN-)DECIDABILITY OF GEOMETRIC PROPERTIES OF PICTURES GENERATED BY COLLAGE GRAMMARS
Fundamenta Informaticae
Fundamenta Informaticae
DEFINING OPERATIONAL BEHAVIOR OF OBJECT SPECIFICATIONS BY ATTRIBUTED GRAPH TRANSFORMATIONS
Fundamenta Informaticae
Finite model theory on tame classes of structures
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Model-checking first-order logic: automata and locality
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
The power of counting logics on restricted classes of finite structures
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
The complexity of approximating bounded-degree Boolean #CSP
Information and Computation
On the complexity of metric dimension
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
Abstract argumentation via monadic second order logic
SUM'12 Proceedings of the 6th international conference on Scalable Uncertainty Management
Verification of graph programs
ICGT'12 Proceedings of the 6th international conference on Graph Transformations
On the parameterized complexity of finding separators with non-hereditary properties
WG'12 Proceedings of the 38th international conference on Graph-Theoretic Concepts in Computer Science
D-flat: Declarative problem solving using tree decompositions and answer-set programming
Theory and Practice of Logic Programming
Enumeration of first-order queries on classes of structures with bounded expansion
Proceedings of the 32nd symposium on Principles of database systems
A trichotomy for regular simple path queries on graphs
Proceedings of the 32nd symposium on Principles of database systems
Finding small separators in linear time via treewidth reduction
ACM Transactions on Algorithms (TALG)
Enumeration of monadic second-order queries on trees
ACM Transactions on Computational Logic (TOCL)
Complexity of finding maximum regular induced subgraphs with prescribed degree
FCT'13 Proceedings of the 19th international conference on Fundamentals of Computation Theory
Hi-index | 0.01 |