Graph rewriting: an algebraic and logic approach
Handbook of theoretical computer science (vol. B)
Logical definability of NP optimization problems
Information and Computation
Approximation properties of NP minimization classes
Journal of Computer and System Sciences
Towards a syntactic characterization of PTAS
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Deciding first-order properties of locally tree-decomposable structures
Journal of the ACM (JACM)
Fixed-Parameter Tractability, Definability, and Model-Checking
SIAM Journal on Computing
Algorithmic Graph Minor Theory: Decomposition, Approximation, and Coloring
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Approximation Schemes for First-Order Definable Optimisation Problems
LICS '06 Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science
LICS '07 Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science
Compact labelings for efficient first-order model-checking
Journal of Combinatorial Optimization
Testing first-order properties for subclasses of sparse graphs
Journal of the ACM (JACM)
Hi-index | 0.00 |