BIROn - Birkbeck Institutional Research Online
    Up a level
    Export as [feed] Atom [feed] RSS
    Group by: Item Type | Date | Journal or Publication Title | No Grouping
    Number of items: 9.

    Marx, D. and O'Sullivan, B. and Razgon, Igor (2013) Finding small separators in linear time via treewidth reduction. ACM Transactions on Algorithms 9 (4), p. 30. ISSN 1549-6325.

    Hebrard, E. and Marx, D. and O'Sullivan, B. and Razgon, Igor (2011) Soft constraints of difference and equality. Journal of Artificial Intelligence Research 41 , pp. 97-130. ISSN 1076-9757.

    Marx, D. and O'Sullivan, B. and Razgon, Igor (2010) Treewidth reduction for constrained separation and bipartization problems. In: Marion, J.-Y. and Schwentick, T. (eds.) 27th International Symposium on Theoretical Aspects of Computer Science. Leibniz International Proceedings in Informatics. Dagstuhl, Germany: Schloss Dagstuhl, pp. 561-572. ISBN 9783939897163.

    Razgon, Igor and O'Sullivan, B. (2009) Almost 2-SAT is fixed-parameter tractable. Journal of Computer and System Sciences 75 (8), pp. 435-450. ISSN 0022-0000.

    Chen, J. and Liu, Y. and Lu, S. and O'Sullivan, B. and Razgon, Igor (2008) A fixed-parameter algorithm for the directed feedback vertex set problem. Journal of the ACM 55 (5), pp. 1-19. ISSN 0004-5411.

    Chen, J. and Liu, Y. and Lu, S. and O'Sullivan, B. and Razgon, Igor (2008) A fixed-parameter algorithm for the directed feedback vertex set problem. In: UNSPECIFIED (ed.) Proceedings of the fourtieth annual ACM symposium on Theory of computing. New York, USA: ACM Publications, pp. 177-186. ISBN 9781605580470.

    Razgon, Igor and O'Sullivan, B. (2007) Directed feedback vertex set is fixed-parameter tractable. In: Demaine, E.D. and Gutin, G.Z. and Marx, D. and Stege, U. (eds.) Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs. Dagstuhl Seminar Proceedings 07281. Internationales Begegnungs- und Forschungszentrum fuer Informatik.

    Razgon, Igor and O'Sullivan, B. (2006) Efficient recognition of acyclic clustered constraint satisfaction problems. In: Azevedo, F. and Barahona, P. and Fages, F. and Rossi, F. (eds.) CSCLP 2006: Recent Advances in Constraints. Lecture Notes in Computer Science 4651. Springer, pp. 154-168. ISBN 9783540738169.

    Razgon, Igor and O'Sullivan, B. and Provan, G.M. Generalizing global constraints based on network flows. In: Fages, F. and Rossi, F. and Soliman, S. (eds.) CSCLP 2007: Recent Advances in Constraints. Lecture Notes in Computer Science 5129. Springer, pp. 127-141. ISBN 978-3-540-89811-5.

    This list was generated on Thu Mar 28 06:29:34 2024 GMT.