BIROn - Birkbeck Institutional Research Online
    Up a level
    Export as [feed] Atom [feed] RSS
    Number of items: 45.

    Article

    Lozin, V. and Razgon, Igor and Zamaraev, V. and Zamaraeva, E. and Zolotykh, N. (2018) Linear read-once and related Boolean functions. Discrete Applied Mathematics , ISSN 0166-218X. (In Press)

    Lozin, V. and Razgon, Igor and Zamaraev, V. (2018) Well-quasi-ordering versus clique-width. Journal of Combinatorial Theory Series B 130 , pp. 1-18. ISSN 0095-8956.

    Razgon, Igor (2017) On oblivious branching programs with bounded repetition that cannot efficiently compute CNFs of bounded treewidth. Theory of Computing Systems 61 , pp. 755-776. ISSN 1432-4350.

    Razgon, Igor (2015) On the read-once property of branching programs and CNFs of bounded treewidth. Algorithmica 75 (2), pp. 277-294. ISSN 0178-4617.

    Marx, D. and Razgon, Igor (2014) Fixed-parameter tractability of multicut parameterized by the size of the cutset. SIAM Journal on Computing 43 (2), pp. 355-388. ISSN 0097-5397.

    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.

    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.

    Marx, D. and Razgon, Igor (2009) Constant ratio fixed-parameter approximation of the edge multicut problem. Information Processing Letters 109 (20), pp. 1161-1166. ISSN 0020-0190.

    Razgon, Igor (2009) Faster computation of maximum independent set and parameterized vertex cover for graphs with maximum degree 3. Journal of Discrete Algorithms 7 (2), pp. 191-212. ISSN 1570-8667.

    Gutin, G. and Razgon, Igor and Kim, E.J. (2009) Minimum leaf out-branching and related problems. Theoretical Computer Science 410 (45), pp. 4571-4579. ISSN 0304-3975.

    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.

    Fomin, F.V. and Gaspers, S. and Pyatkin, A.V. and Razgon, Igor (2008) On the minimum feedback vertex set problem: exact and enumeration algorithms. Algorithmica 52 (2), pp. 293-307. ISSN 0178-4617.

    Razgon, Igor (2007) A 2O(k)poly(n) algorithm for the parameterized convex recoloring problem. Information Processing Letters 104 (2), pp. 53-58. ISSN 0020-0190.

    Razgon, Igor and Meisels, A. (2007) A CSP search algorithm with responsibility sets and kernels. Constraints: An International Journal 12 , pp. 151-177. ISSN 1383-7133.

    Book Section

    Lozin, V.V. and Razgon, Igor and Zamaraev, V. (2016) Well-quasi-ordering does not imply bounded cliquewidth. In: Mayr, E.W. (ed.) Graph-Theoretic Concepts in Computer Science. Lecture Notes in Computer Science 9224. New York, U.S.: Springer, pp. 351-359. ISBN 9783662531730.

    Razgon, Igor (2015) Quasipolynomial simulation of DNNF by a non-determinstic read-once branching program. In: Pesant, G. (ed.) Principles and Practice of Constraint Programming. Lecture Notes in Computer Science 9255. New York, U.S.: Springer, pp. 367-375. ISBN 9783319232188.

    Calì, Andrea and Razgon, Igor (2014) Complexity of conjunctive query answering under access limitations (preliminary report). In: Greco, S. and Picariello, S. (eds.) 22nd Italian Symposium on Advanced Database Systems. New York, U.S.: Curran Associates, pp. 256-263. ISBN 9781634391450.

    Razgon, Igor (2014) No small nondeterministic read-once branching programs for CNFs of bounded treewidth. In: Cygan, M. and Heggernes, P. (eds.) Parameterized and Exact Computation. Lecture Notes in Computer Science 8894. New York, U.S.: Springer, pp. 319-331. ISBN 9783319135236.

    Razgon, Igor (2014) On OBDDs for CNFs of bounded treewidth. In: Baral, C. and De Giacomo, G. and Eiter, T. (eds.) Fourteenth International Conference on the Principles of Knowledge Representation and Reasoning. Palo Alto, U.S.: AAAI Press. ISBN 9781577356578.

    Razgon, Igor and Petke, J. (2013) Cliquewidth and knowledge compilation. In: Järvisalo, M. and Van Gelder, A. (eds.) Theory and Applications of Satisfiability Testing. Lecture Notes in Computer Science 7962. Berlin, Germany: Springer Verlag, pp. 335-350. ISBN 9783642390715.

    Atminas, A. and Lozin, V. and Razgon, Igor (2012) Linear time algorithm for computing a small biclique in graphs without long induced paths. In: Fomin, F.V. and Kaski, P. (eds.) Algorithm Theory – SWAT 2012. Lecture Notes in Computer Science 7357. Berlin, Germany: Springer Verlag, pp. 142-152. ISBN 9783642311550.

    Marx, D. and Razgon, Igor (2011) Fixed-parameter tractability of multicut parameterized by the size of the cutset. In: UNSPECIFIED (ed.) Proceedings of the 43rd annual ACM symposium on Theory of computing - STOC '11. New York, U.S.: ACM Press, pp. 469-478. ISBN 9781450306911.

    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.

    Marx, D. and Razgon, Igor (2009) Constant ratio fixed-parameter approximation of the edge multicut problem. In: Fiat, A. and Sanders, P. (eds.) Algorithms. Berlin, Germany: Springer Verlag, pp. 647-658. ISBN 9783642041280.

    Hebrard, E. and Marx, D. and O’Sullivan, B. and Razgon, Igor (2009) Constraints of difference and equality: a complete taxonomic characterisation. In: Gent, I.P. (ed.) Principles and Practice of Constraint Programming - CP 2009. Lecture Notes in Computer Science 5732. Berlin, Germany: Springer Verlag, pp. 424-438. ISBN 9783642042447.

    Gutin, G. and Karapetyan, D. and Razgon, Igor (2009) Fixed-parameter algorithms in analysis of heuristics for extracting networks in linear programs. In: Chen, J. and Fomin, F.V. (eds.) Parameterized and Exact Computation. Lecture Notes in Computer Science 5917. Berlin, Germany: Springer Verlag, pp. 222-233. ISBN 9783642112690.

    Johannsen, D. and Razgon, Igor and Wahlström, M. (2009) Solving SAT for CNF formulas with a one-sided restriction on variable occurrences. In: Kullmann, O. (ed.) Theory and Applications of Satisfiability Testing. Lecture Notes in Computer Science 5584. Berlin, Germany: Springer Verlag, pp. 80-85. ISBN 9783642027765.

    Razgon, Igor and O’Sullivan, B. (2008) Almost 2-SAT is fixed-parameter tractable (extended abstract). In: Aceto, L. and Damgård, I. and Goldberg, L.A. and Halldórsson, M.M. and Ingólfsdóttir, A. and Walukiewicz, I. (eds.) Automata, Languages and Programming. Lecture Notes in Computer Science 5125. Berlin, Germany: Springer Verlag, pp. 551-562. ISBN 9783540705758.

    Gutin, G. and Razgon, Igor and Kim, E.J. (2008) Minimum leaf out-branching problems. In: Fleischer, R. and Xu, J. (eds.) Algorithmic Aspects in Information and Management. Lecture Notes in Computer Science 5034. Berlin, Germany: Springer Verlag, pp. 235-246. ISBN 9783540688808.

    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.

    Hebrard, E. and O’Sullivan, B. and Razgon, Igor (2008) A soft constraint of equality: complexity and approximability. In: Stuckey, P.J. (ed.) Principles and Practice of Constraint Programming. Lecture Notes in Computer Science 5202. Berlin, Germany: Springer Verlag, pp. 358-371. ISBN 9783540859581.

    Razgon, Igor (2007) Computing minimum directed feedback vertex set in O(1.9977n). In: Italiano, G.F. and Moggi, E. and Luigi, L. (eds.) ICTCS 2007: Theoretical Computer Science. World Scientific, pp. 70-81.

    Chor, B. and Fellows, M.R. and Ragan, M.A. and Razgon, Igor and Rosamond, F.A. and Snir, S. (2007) Connected coloring completion for general graphs: algorithms and complexity. In: Snir, G. (ed.) COCOON 2007: Computing and Combinatorics. Lecture Notes in Computer Science 4598. Springer, pp. 75-85. ISBN 9783540735441.

    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 (2006) Exact computation of maximum induced forest. In: Arge, L. and Freivalds, R. (eds.) SWAT 2006: Algorithm Theory. Lecture Notes in Computer Science 4059. Springer, pp. 160-171. ISBN 9783540357537.

    Razgon, Igor (2006) A faster solving of the maximum independent set problem for graphs with maximal degree 3. In: Broersma, H. and Dantchev, S.S,. and Johnson, M. and Szeider, S. (eds.) Algorithms and Complexity 2006: Proceedings of the Second ACiD Workshop. Texts in Algorithmics 7. King's College, London, UK, pp. 131-142.

    Razgon, Igor and Meisels, A. (2005) A CSP search algorithm with reduced branching factor. In: Hnich, B. and Carlsson, M. and Fages, F. and Rossi, F. (eds.) CSCLP 2005: Recent Advances in Constraints. Lecture Notes in Computer Science 3978. Springer, pp. 59-72. ISBN 9783540342151.

    Razgon, Igor and Meisels, A. (2005) CSP search with responsibility sets and kernels. In: Pack Kaelbling, L. and Saffiotti, A. (eds.) IJCAI-05: Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence. Professional Book Center, pp. 1533-1534.

    Razgon, Igor (2005) Complexity analysis of heuristic CSP search algorithms. In: Hnich, B. and Carlsson, M. and Fages, F. and Rossi, F. (eds.) Recent Advances in Constraints: CSCLP 2005. Lecture Notes in Computer Science 3978. Springer, pp. 88-99. ISBN 9783540342151.

    Razgon, Igor and Meisels, A. (2004) Pruning by equally constrained variables. In: Faltings, B. and Petcu, A. and Fages, F. and Rossi, F. (eds.) Recent Advances in Constraints: CSCLP 2004. Lecture Notes in Computer Science 3419. Springer, pp. 26-40.

    Razgon, Igor and Meisels, A. (2003) Maintaining dominance consistency. In: Rossi, F. (ed.) CP 2003: Principles and Practice of Constraint Programming. Lecture Notes in Computer Science 2833. Springer, pp. 945-949. ISBN 9783540202028.

    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.

    Conference or Workshop Item

    Gottlob, G. and Lanzinger, M. and Pichler, R. and Razgon, Igor (2020) Fractional covers of Hypergraphs with bounded multi-intersection. In: 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020), 24-28 Oct 2020, Prague, Czech Republic.

    This list was generated on Wed Oct 20 17:10:31 2021 BST.