Browse by Series

Number of items: 3.

Book chapter

Paulusma, Daniel and Slivovksy, F. and Szeider, S. (2013) 'Model counting for CNF formuals of bounded module treewidth.', in 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013). Dagstuhl, Germany: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, pp. 55-66. Leibniz International Proceedings in Informatics (LIPIcs).

Mertzios, G.B. (2011) 'The recognition of triangle graphs.', in 28th International Symposium on Theoretical Aspects of Computer Science, STACS 2011, 10-12 March 2011, Dortmund, Germany ; proceedings. Dagstuhl, Germany: Schloss Dagstuhl, pp. 591-602. Leibniz International Proceedings in Informatics (LIPIcs). (9).

Mertzios, G.B. and Sau, I. and Zaks, S. (2010) 'The recognition of tolerance and bounded tolerance graphs.', in 27th International Symposium on Theoretical Aspects of Computer Science, STACS 2010, 4-6 March 2010 ; proceedings. Dagstuhl, Germany: Schloss Dagstuhl , pp. 585-596. Leibniz International Proceedings in Informatics (LIPICS)., 5

List was generated at Wed May 22 00:58:19 2013 BST.