No. Title Author Year
1 Quasi-4-Connected Components Grohe, Martin 2016
2 Theory and Practice of SAT Solving (Dagstuhl Seminar 15171) Biere, Armin et al. 2015
3 Colour Refinement: A Simple Partitioning Algorithm with Applications From Graph Isomorphism Testing to Machine Learning (Invited Talk) Grohe, Martin 2014
4 Characterisations of Nowhere Dense Graphs (Invited Talk) Grohe, Martin et al. 2013
5 Pebble Games and Linear Equations Grohe, Martin et al. 2012
6 Computational Complexity of Discrete Problems (Dagstuhl Seminar 11121) Grohe, Martin et al. 2011
7 L-Recursion and a new Logic for Logarithmic Space Grohe, Martin et al. 2011
8 09441 Abstracts Collection -- The Constraint Satisfaction Problem: Complexity and Approximability Bulatov, Andrei A. et al. 2010
9 09441 Executive Summary -- The Constraint Satisfaction Problem: Complexity and Approximability Bulatov, Andrei A. et al. 2010
10 A Complexity Dichotomy for Partition Functions with Mixed Signs Goldberg, Leslie Ann et al. 2009
Current Page :
Number of result pages: 2
Number of documents: 14


DROPS-Home | Fulltext Search | Imprint Published by LZI