Algorithmic meta-theorems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5018 LNCS, Issue , 2008, Pages 10-12

  Kreutzer, Stephan ^a  

^a UNIVERSITY OF OXFORD   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 44649127517     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-79723-4_3     Document Type: Conference Paper

References (14)

1. Courcelle, B.: Graph rewriting: An algebraic and logic approach. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science, pp. 194-242. Elsevier, Amsterdam (1990)
2. Courcelle, B., Makowsky, J., Rotics, U.: Linear time solvable optimization problems on graphs of bounded clique-width. Theory Comput. Systems 33, 125-150 (2000)
3. Dawar, A., Grohe, M., Kreutzer, S.: Locally excluding a minor. In: Proc. of the 22nd IEEE Symp. on Logic in Computer Science, pp. 270-279 (2007)
4. Dawar, A., Grohe, M., Kreutzer, S., Schweikardt, S.: Approximation schemes for first-order definable optimisation problems. In: Proc. of the 21st IEEE Symp. on Logic in Computer Science, pp. 411-420 (2006)
5. Demaine, E., Hajiaghayi, M., Kawarabayashi, K.: Algorithmic graph minor theory: Decomposition, approximation, and coloring. In: Symposium on Foundations of Computer Science (FOCS), pp. 637-646 (2005)
6. Flum, J., Grohe, M.: Fixed-parameter tractability, definability, and model checking. SIAM Journal on Computing 31, 113-145 (2001)
7. Frick, M., Grohe, M.: Deciding first-order properties of locally tree-decomposable structures. Journal of the ACM 48, 1184-1206 (2001)
8. Grohe, M.: Logic, graphs, and algorithms. In: Wilke, T., Flum, J., Grädel, E. (eds.) Logic and Automata History and Perspectives, Amsterdam University Press (2007)
9. Khanna, S., Motwani, R.: Towards a syntactic characterization of PTAS. In: Proc. of STOC 1996, pp. 329-337 (1996)
10. Kolaitis, P.G., Thakur, M.N.: Logical definability of NP optimization problems. Information and Computation 115(2), 321-353 (1994)
11. Kolaitis, P.G., Thakur, M.N.: Approximation properties of NP minimization classes. Journal of Computer and System Sciences 50, 391-411 (1995)
12. Kreutzer, S.: Finite model-theory of tree-like structures, http://web.comlab. ox.ac.uk/oucl/work/stephan.kreutzer/publications.html
13. Papadimitriou, C.H., Yannakakis, M.: Optimization, approximation, and complexity classes. Journal of Computer and System Sciences 43, 425-440 (1991)
14. Seese, D.: Linear time computable problems and first-order descriptions. Mathematical Structures in Computer Science 2, 505-526 (1996)