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
250
(11),
pp. 16-27.
ISSN 0166-218X.
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.
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.
New York, U.S.: Springer.
pp. 351-359.
ISBN 9783662531730.
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.
Berlin, Germany: Springer Verlag.
pp. 335-350.
ISSN 0302-9743.
ISBN 9783642390715.
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.
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.
Internationales Begegnungs- und Forschungszentrum fuer Informatik.
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.
Springer.
pp. 160-171.
ISBN 9783540357537.
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.
Springer.
pp. 154-168.
ISBN 9783540738169.
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.
Springer.
pp. 88-99.
ISBN 9783540342151.
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.
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 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.
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.
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.
Springer.
pp. 127-141.
ISBN 978-3-540-89811-5.