Isomorphism testing for embeddable graphs through definability
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
On first-order topological queries
ACM Transactions on Computational Logic (TOCL)
Definability and Descriptive Complexity on Databases of Bounded Tree-Width
ICDT '99 Proceedings of the 7th International Conference on Database Theory
Relational Databases and Homogeneity in Logics with Counting
FoIKS '02 Proceedings of the Second International Symposium on Foundations of Information and Knowledge Systems
Large finite structures with few Lk-types
Information and Computation - Special issue: LICS'97
The first order definability of graphs with separators via the Ehrenfeucht game
Theoretical Computer Science - Game theory meets theoretical computer science
Relational databases and homogeneity in logics with counting
Acta Cybernetica
On the Descriptive Complexity of Linear Algebra
WoLLIC '08 Proceedings of the 15th international workshop on Logic, Language, Information and Computation
CFI Construction and Balanced Graphs
FAW '09 Proceedings of the 3d International Workshop on Frontiers in Algorithmics
Planar graphs: logical complexity and parallel isomorphism tests
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Properties of Almost All Graphs and Generalized Quantifiers
Fundamenta Informaticae - Bridging Logic and Computer Science: to Johann A. Makowsky for his 60th birthday
Fixed-point definability and polynomial time
CSL'09/EACSL'09 Proceedings of the 23rd CSL international conference and 18th EACSL Annual conference on Computer science logic
Decidable relationships between consistency notions for constraint satisfaction problems
CSL'09/EACSL'09 Proceedings of the 23rd CSL international conference and 18th EACSL Annual conference on Computer science logic
Database theory: query languages
Algorithms and theory of computation handbook
From polynomial time queries to graph structure theory
Communications of the ACM
Fixed-point definability and polynomial time on chordal graphs and line graphs
Fields of logic and computation
Sherali-Adams relaxations and indistinguishability in counting logics
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
On graph isomorphism for restricted graph classes
CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers
ICDT'05 Proceedings of the 10th international conference on Database Theory
Testing graph isomorphism in parallel by playing a game
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Fixed-point definability and polynomial time on graphs with excluded minors
Journal of the ACM (JACM)
Finite model theory on tame classes of structures
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
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
Experiments with reduction finding
SAT'13 Proceedings of the 16th international conference on Theory and Applications of Satisfiability Testing
Hi-index | 0.02 |