Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Igor Razgon
@article{DBLP:journals/siamdm/AlecuLQRRZ24,
author = {Bogdan Alecu and
Vadim V. Lozin and
Daniel A. Quiroz and
Roman Rabinovich and
Igor Razgon and
Viktor Zamaraev},
title = {The Treewidth and Pathwidth of Graph Unions},
journal = {{SIAM} J. Discret. Math.},
volume = {38},
number = {1},
pages = {261--276},
year = {2024},
url = {https://doi.org/10.1137/22m1524047},
doi = {10.1137/22M1524047},
timestamp = {Thu, 29 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamdm/AlecuLQRRZ24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/LanzingerR24,
author = {Matthias Lanzinger and
Igor Razgon},
editor = {Olaf Beyersdorff and
Mamadou Moustapha Kant{\'{e}} and
Orna Kupferman and
Daniel Lokshtanov},
title = {{FPT} Approximation of Generalised Hypertree Width for Bounded Intersection
Hypergraphs},
booktitle = {41st International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2024, March 12-14, 2024, Clermont-Ferrand, France},
series = {LIPIcs},
volume = {289},
pages = {48:1--48:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2024},
url = {https://doi.org/10.4230/LIPIcs.STACS.2024.48},
doi = {10.4230/LIPICS.STACS.2024.48},
timestamp = {Mon, 11 Mar 2024 15:43:27 +0100},
biburl = {https://dblp.org/rec/conf/stacs/LanzingerR24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/GottlobLPR23,
author = {Georg Gottlob and
Matthias Lanzinger and
Reinhard Pichler and
Igor Razgon},
title = {Fractional covers of hypergraphs with bounded multi-intersection},
journal = {Theor. Comput. Sci.},
volume = {979},
pages = {114204},
year = {2023},
url = {https://doi.org/10.1016/j.tcs.2023.114204},
doi = {10.1016/J.TCS.2023.114204},
timestamp = {Fri, 08 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/GottlobLPR23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/BergougnouxKR23,
author = {Benjamin Bergougnoux and
Tuukka Korhonen and
Igor Razgon},
editor = {Dani{\"{e}}l Paulusma and
Bernard Ries},
title = {New Width Parameters for Independent Set: One-Sided-Mim-Width and
Neighbor-Depth},
booktitle = {Graph-Theoretic Concepts in Computer Science - 49th International
Workshop, {WG} 2023, Fribourg, Switzerland, June 28-30, 2023, Revised
Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {14093},
pages = {72--85},
publisher = {Springer},
year = {2023},
url = {https://doi.org/10.1007/978-3-031-43380-1\_6},
doi = {10.1007/978-3-031-43380-1\_6},
timestamp = {Sat, 14 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/BergougnouxKR23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2302-10643,
author = {Benjamin Bergougnoux and
Tuukka Korhonen and
Igor Razgon},
title = {New Width Parameters for Independent Set: One-sided-mim-width and
Neighbor-depth},
journal = {CoRR},
volume = {abs/2302.10643},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2302.10643},
doi = {10.48550/ARXIV.2302.10643},
eprinttype = {arXiv},
eprint = {2302.10643},
timestamp = {Fri, 24 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2302-10643.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2309-17049,
author = {Matthias Lanzinger and
Igor Razgon},
title = {{FPT} Approximation of Generalised Hypertree Width for Bounded Intersection
Hypergraphs},
journal = {CoRR},
volume = {abs/2309.17049},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2309.17049},
doi = {10.48550/ARXIV.2309.17049},
eprinttype = {arXiv},
eprint = {2309.17049},
timestamp = {Tue, 17 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2309-17049.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/LozinR22,
author = {Vadim V. Lozin and
Igor Razgon},
title = {Tree-width dichotomy},
journal = {Eur. J. Comb.},
volume = {103},
pages = {103517},
year = {2022},
url = {https://doi.org/10.1016/j.ejc.2022.103517},
doi = {10.1016/J.EJC.2022.103517},
timestamp = {Thu, 05 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ejc/LozinR22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2201-02173,
author = {Igor Razgon},
title = {The splitting power of branching programs of bounded repetition and
CNFs of bounded width},
journal = {CoRR},
volume = {abs/2201.02173},
year = {2022},
url = {https://arxiv.org/abs/2201.02173},
eprinttype = {arXiv},
eprint = {2201.02173},
timestamp = {Mon, 10 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2201-02173.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2202-07752,
author = {Bogdan Alecu and
Vadim V. Lozin and
Daniel A. Quiroz and
Roman Rabinovich and
Igor Razgon and
Viktor Zamaraev},
title = {The treewidth and pathwidth of graph unions},
journal = {CoRR},
volume = {abs/2202.07752},
year = {2022},
url = {https://arxiv.org/abs/2202.07752},
eprinttype = {arXiv},
eprint = {2202.07752},
timestamp = {Wed, 30 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2202-07752.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2212-13423,
author = {Igor Razgon},
title = {{FPT} algoritms providing constant ratio approximation of hypertree
width parameters for hypergraphs of bounded rank},
journal = {CoRR},
volume = {abs/2212.13423},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2212.13423},
doi = {10.48550/ARXIV.2212.13423},
eprinttype = {arXiv},
eprint = {2212.13423},
timestamp = {Wed, 04 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2212-13423.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/GottlobLPR21,
author = {Georg Gottlob and
Matthias Lanzinger and
Reinhard Pichler and
Igor Razgon},
title = {Complexity Analysis of Generalized and Fractional Hypertree Decompositions},
journal = {J. {ACM}},
volume = {68},
number = {5},
pages = {38:1--38:50},
year = {2021},
url = {https://doi.org/10.1145/3457374},
doi = {10.1145/3457374},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/GottlobLPR21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/Razgon21,
author = {Igor Razgon},
editor = {Petr A. Golovach and
Meirav Zehavi},
title = {Classification of {OBDD} Size for Monotone 2-CNFs},
booktitle = {16th International Symposium on Parameterized and Exact Computation,
{IPEC} 2021, September 8-10, 2021, Lisbon, Portugal},
series = {LIPIcs},
volume = {214},
pages = {25:1--25:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.IPEC.2021.25},
doi = {10.4230/LIPICS.IPEC.2021.25},
timestamp = {Tue, 23 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/iwpec/Razgon21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2103-09115,
author = {Igor Razgon},
title = {Classification of {OBDD} size for monotone 2-CNFs},
journal = {CoRR},
volume = {abs/2103.09115},
year = {2021},
url = {https://arxiv.org/abs/2103.09115},
eprinttype = {arXiv},
eprint = {2103.09115},
timestamp = {Wed, 24 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2103-09115.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Razgon21,
author = {Igor Razgon},
title = {Classification of {OBDD} size for monotone 2-CNFs},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR21-107}},
year = {2021},
url = {https://eccc.weizmann.ac.il/report/2021/107},
eprinttype = {ECCC},
eprint = {TR21-107},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Razgon21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/GottlobLPR20,
author = {Georg Gottlob and
Matthias Lanzinger and
Reinhard Pichler and
Igor Razgon},
editor = {Javier Esparza and
Daniel Kr{\'{a}}l'},
title = {Fractional Covers of Hypergraphs with Bounded Multi-Intersection},
booktitle = {45th International Symposium on Mathematical Foundations of Computer
Science, {MFCS} 2020, August 24-28, 2020, Prague, Czech Republic},
series = {LIPIcs},
volume = {170},
pages = {41:1--41:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.MFCS.2020.41},
doi = {10.4230/LIPICS.MFCS.2020.41},
timestamp = {Mon, 21 Dec 2020 13:23:22 +0100},
biburl = {https://dblp.org/rec/conf/mfcs/GottlobLPR20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2002-05239,
author = {Georg Gottlob and
Matthias Lanzinger and
Reinhard Pichler and
Igor Razgon},
title = {Complexity Analysis of General and Fractional Hypertree Decompositions},
journal = {CoRR},
volume = {abs/2002.05239},
year = {2020},
url = {https://arxiv.org/abs/2002.05239},
eprinttype = {arXiv},
eprint = {2002.05239},
timestamp = {Fri, 14 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2002-05239.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2007-01830,
author = {Georg Gottlob and
Matthias Lanzinger and
Reinhard Pichler and
Igor Razgon},
title = {Fractional Covers of Hypergraphs with Bounded Multi-Intersection},
journal = {CoRR},
volume = {abs/2007.01830},
year = {2020},
url = {https://arxiv.org/abs/2007.01830},
eprinttype = {arXiv},
eprint = {2007.01830},
timestamp = {Mon, 06 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2007-01830.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2012-01115,
author = {Vadim V. Lozin and
Igor Razgon},
title = {Tree-width dichotomy},
journal = {CoRR},
volume = {abs/2012.01115},
year = {2020},
url = {https://arxiv.org/abs/2012.01115},
eprinttype = {arXiv},
eprint = {2012.01115},
timestamp = {Fri, 04 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2012-01115.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1905-10867,
author = {Andrea Cal{\`{\i}} and
Igor Razgon},
title = {Regular resolution for {CNF} of bounded incidence treewidth with few
long clauses},
journal = {CoRR},
volume = {abs/1905.10867},
year = {2019},
url = {http://arxiv.org/abs/1905.10867},
eprinttype = {arXiv},
eprint = {1905.10867},
timestamp = {Mon, 03 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1905-10867.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/LozinRZZZ18,
author = {Vadim V. Lozin and
Igor Razgon and
Viktor Zamaraev and
Elena Zamaraeva and
Nikolai Yu. Zolotykh},
title = {Linear read-once and related Boolean functions},
journal = {Discret. Appl. Math.},
volume = {250},
pages = {16--27},
year = {2018},
url = {https://doi.org/10.1016/j.dam.2018.05.001},
doi = {10.1016/J.DAM.2018.05.001},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/LozinRZZZ18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/LozinRZ18,
author = {Vadim V. Lozin and
Igor Razgon and
Viktor Zamaraev},
title = {Well-quasi-ordering versus clique-width},
journal = {J. Comb. Theory, Ser. {B}},
volume = {130},
pages = {1--18},
year = {2018},
url = {https://doi.org/10.1016/j.jctb.2017.09.012},
doi = {10.1016/J.JCTB.2017.09.012},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/LozinRZ18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1805-10159,
author = {Vadim V. Lozin and
Igor Razgon and
Viktor Zamaraev and
Elena Zamaraeva and
Nikolai Yu. Zolotykh},
title = {Linear read-once and related Boolean functions},
journal = {CoRR},
volume = {abs/1805.10159},
year = {2018},
url = {http://arxiv.org/abs/1805.10159},
eprinttype = {arXiv},
eprint = {1805.10159},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1805-10159.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/Razgon17,
author = {Igor Razgon},
title = {On Oblivious Branching Programs with Bounded Repetition that Cannot
Efficiently Compute CNFs of Bounded Treewidth},
journal = {Theory Comput. Syst.},
volume = {61},
number = {3},
pages = {755--776},
year = {2017},
url = {https://doi.org/10.1007/s00224-016-9714-0},
doi = {10.1007/S00224-016-9714-0},
timestamp = {Tue, 22 Aug 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/Razgon17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alt/LozinRZZZ17,
author = {Vadim V. Lozin and
Igor Razgon and
Viktor Zamaraev and
Elena Zamaraeva and
Nikolai Yu. Zolotykh},
editor = {Steve Hanneke and
Lev Reyzin},
title = {Specifying a positive threshold function via extremal points},
booktitle = {International Conference on Algorithmic Learning Theory, {ALT} 2017,
15-17 October 2017, Kyoto University, Kyoto, Japan},
series = {Proceedings of Machine Learning Research},
volume = {76},
pages = {208--222},
publisher = {{PMLR}},
year = {2017},
url = {http://proceedings.mlr.press/v76/lozin17a.html},
timestamp = {Wed, 03 Apr 2019 18:17:23 +0200},
biburl = {https://dblp.org/rec/conf/alt/LozinRZZZ17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/amw/CaliMRU17,
author = {Andrea Cal{\`{\i}} and
Davide Martinenghi and
Igor Razgon and
Mart{\'{\i}}n Ugarte},
editor = {Juan L. Reutter and
Divesh Srivastava},
title = {Querying the Deep Web: Back to the Foundations},
booktitle = {Proceedings of the 11th Alberto Mendelzon International Workshop on
Foundations of Data Management and the Web, Montevideo, Uruguay, June
7-9, 2017},
series = {{CEUR} Workshop Proceedings},
volume = {1912},
publisher = {CEUR-WS.org},
year = {2017},
url = {https://ceur-ws.org/Vol-1912/paper10.pdf},
timestamp = {Fri, 10 Mar 2023 16:23:19 +0100},
biburl = {https://dblp.org/rec/conf/amw/CaliMRU17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/LozinRZZZ17,
author = {Vadim V. Lozin and
Igor Razgon and
Victor Zamaraev and
Elena Zamaraeva and
Nikolai Yu. Zolotykh},
title = {Specifying a positive threshold function via extremal points},
journal = {CoRR},
volume = {abs/1706.01747},
year = {2017},
url = {http://arxiv.org/abs/1706.01747},
eprinttype = {arXiv},
eprint = {1706.01747},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/LozinRZZZ17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1708-07767,
author = {Andrea Cal{\`{\i}} and
Florent Capelli and
Igor Razgon},
title = {Non-FPT lower bounds for structural restrictions of decision {DNNF}},
journal = {CoRR},
volume = {abs/1708.07767},
year = {2017},
url = {http://arxiv.org/abs/1708.07767},
eprinttype = {arXiv},
eprint = {1708.07767},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1708-07767.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1709-08890,
author = {Igor Razgon},
title = {Partial matching width and its application to lower bounds for branching
programs},
journal = {CoRR},
volume = {abs/1709.08890},
year = {2017},
url = {http://arxiv.org/abs/1709.08890},
eprinttype = {arXiv},
eprint = {1709.08890},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1709-08890.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Razgon16,
author = {Igor Razgon},
title = {On the Read-Once Property of Branching Programs and CNFs of Bounded
Treewidth},
journal = {Algorithmica},
volume = {75},
number = {2},
pages = {277--294},
year = {2016},
url = {https://doi.org/10.1007/s00453-015-0059-x},
doi = {10.1007/S00453-015-0059-X},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Razgon16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/LachishR16,
author = {Oded Lachish and
Igor Razgon},
title = {Non-deterministic branching programs with logarithmic repetition cannot
efficiently compute small monotone CNFs},
journal = {CoRR},
volume = {abs/1604.01560},
year = {2016},
url = {http://arxiv.org/abs/1604.01560},
eprinttype = {arXiv},
eprint = {1604.01560},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/LachishR16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cp/Razgon15,
author = {Igor Razgon},
editor = {Gilles Pesant},
title = {Quasipolynomial Simulation of {DNNF} by a Non-determinstic Read-Once
Branching Program},
booktitle = {Principles and Practice of Constraint Programming - 21st International
Conference, {CP} 2015, Cork, Ireland, August 31 - September 4, 2015,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9255},
pages = {367--375},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-23219-5\_26},
doi = {10.1007/978-3-319-23219-5\_26},
timestamp = {Tue, 14 May 2019 10:00:45 +0200},
biburl = {https://dblp.org/rec/conf/cp/Razgon15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/LozinRZ15,
author = {Vadim V. Lozin and
Igor Razgon and
Victor Zamaraev},
editor = {Ernst W. Mayr},
title = {Well-quasi-ordering Does Not Imply Bounded Clique-width},
booktitle = {Graph-Theoretic Concepts in Computer Science - 41st International
Workshop, {WG} 2015, Garching, Germany, June 17-19, 2015, Revised
Papers},
series = {Lecture Notes in Computer Science},
volume = {9224},
pages = {351--359},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-662-53174-7\_25},
doi = {10.1007/978-3-662-53174-7\_25},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wg/LozinRZ15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/LozinRZ15,
author = {Vadim V. Lozin and
Igor Razgon and
Victor Zamaraev},
title = {Well-quasi-ordering does not imply bounded clique-width},
journal = {CoRR},
volume = {abs/1503.00571},
year = {2015},
url = {http://arxiv.org/abs/1503.00571},
eprinttype = {arXiv},
eprint = {1503.00571},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/LozinRZ15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/Razgon15,
author = {Igor Razgon},
title = {On oblivious branching programs with bounded repetition that cannot
efficiently compute CNFs of bounded treewidth},
journal = {CoRR},
volume = {abs/1510.02951},
year = {2015},
url = {http://arxiv.org/abs/1510.02951},
eprinttype = {arXiv},
eprint = {1510.02951},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/Razgon15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/Razgon15a,
author = {Igor Razgon},
title = {Two types of branching programs with bounded repetition that cannot
efficiently compute monotone 3-CNFs},
journal = {CoRR},
volume = {abs/1510.05486},
year = {2015},
url = {http://arxiv.org/abs/1510.05486},
eprinttype = {arXiv},
eprint = {1510.05486},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/Razgon15a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/MarxR14,
author = {D{\'{a}}niel Marx and
Igor Razgon},
title = {Fixed-Parameter Tractability of Multicut Parameterized by the Size
of the Cutset},
journal = {{SIAM} J. Comput.},
volume = {43},
number = {2},
pages = {355--388},
year = {2014},
url = {https://doi.org/10.1137/110855247},
doi = {10.1137/110855247},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/MarxR14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/Razgon14,
author = {Igor Razgon},
editor = {Marek Cygan and
Pinar Heggernes},
title = {No Small Nondeterministic Read-Once Branching Programs for CNFs of
Bounded Treewidth},
booktitle = {Parameterized and Exact Computation - 9th International Symposium,
{IPEC} 2014, Wroclaw, Poland, September 10-12, 2014. Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {8894},
pages = {319--331},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-13524-3\_27},
doi = {10.1007/978-3-319-13524-3\_27},
timestamp = {Sat, 19 Oct 2019 20:25:35 +0200},
biburl = {https://dblp.org/rec/conf/iwpec/Razgon14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/kr/Razgon14,
author = {Igor Razgon},
editor = {Chitta Baral and
Giuseppe De Giacomo and
Thomas Eiter},
title = {On OBDDs for CNFs of Bounded Treewidth},
booktitle = {Principles of Knowledge Representation and Reasoning: Proceedings
of the Fourteenth International Conference, {KR} 2014, Vienna, Austria,
July 20-24, 2014},
publisher = {{AAAI} Press},
year = {2014},
url = {http://www.aaai.org/ocs/index.php/KR/KR14/paper/view/7982},
timestamp = {Tue, 09 Feb 2021 08:33:43 +0100},
biburl = {https://dblp.org/rec/conf/kr/Razgon14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sebd/CaliR14,
author = {Andrea Cal{\`{\i}} and
Igor Razgon},
editor = {Sergio Greco and
Antonio Picariello},
title = {Complexity of Conjunctive Query Answering under Access Limitations
(Preliminary Report)},
booktitle = {22nd Italian Symposium on Advanced Database Systems, {SEBD} 2014,
Sorrento Coast, Italy, June 16-18, 2014},
pages = {256--263},
year = {2014},
timestamp = {Fri, 14 Nov 2014 14:33:58 +0100},
biburl = {https://dblp.org/rec/conf/sebd/CaliR14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/HebrardMOR14,
author = {Emmanuel Hebrard and
D{\'{a}}niel Marx and
Barry O'Sullivan and
Igor Razgon},
title = {Soft Constraints of Difference and Equality},
journal = {CoRR},
volume = {abs/1401.3879},
year = {2014},
url = {http://arxiv.org/abs/1401.3879},
eprinttype = {arXiv},
eprint = {1401.3879},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/HebrardMOR14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/Razgon14,
author = {Igor Razgon},
title = {No small nondeterministic read-once branching programs for CNFs of
bounded treewidth},
journal = {CoRR},
volume = {abs/1407.0491},
year = {2014},
url = {http://arxiv.org/abs/1407.0491},
eprinttype = {arXiv},
eprint = {1407.0491},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/Razgon14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/Razgon14a,
author = {Igor Razgon},
title = {On the read-once property of branching programs and CNFs of bounded
treewidth},
journal = {CoRR},
volume = {abs/1411.0264},
year = {2014},
url = {http://arxiv.org/abs/1411.0264},
eprinttype = {arXiv},
eprint = {1411.0264},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/Razgon14a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/order/KorpelainenLR13,
author = {Nicholas Korpelainen and
Vadim V. Lozin and
Igor Razgon},
title = {Boundary Properties of Well-Quasi-Ordered Sets of Graphs},
journal = {Order},
volume = {30},
number = {3},
pages = {723--735},
year = {2013},
url = {https://doi.org/10.1007/s11083-012-9272-2},
doi = {10.1007/S11083-012-9272-2},
timestamp = {Mon, 06 Nov 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/order/KorpelainenLR13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/MarxOR13,
author = {D{\'{a}}niel Marx and
Barry O'Sullivan and
Igor Razgon},
title = {Finding small separators in linear time via treewidth reduction},
journal = {{ACM} Trans. Algorithms},
volume = {9},
number = {4},
pages = {30:1--30:35},
year = {2013},
url = {https://doi.org/10.1145/2500119},
doi = {10.1145/2500119},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/MarxOR13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sat/RazgonP13,
author = {Igor Razgon and
Justyna Petke},
editor = {Matti J{\"{a}}rvisalo and
Allen Van Gelder},
title = {Cliquewidth and Knowledge Compilation},
booktitle = {Theory and Applications of Satisfiability Testing - {SAT} 2013 - 16th
International Conference, Helsinki, Finland, July 8-12, 2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7962},
pages = {335--350},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-39071-5\_25},
doi = {10.1007/978-3-642-39071-5\_25},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sat/RazgonP13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1303-4081,
author = {Igor Razgon and
Justyna Petke},
title = {Cliquewidth and Knowledge Compilation},
journal = {CoRR},
volume = {abs/1303.4081},
year = {2013},
url = {http://arxiv.org/abs/1303.4081},
eprinttype = {arXiv},
eprint = {1303.4081},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1303-4081.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/Razgon13,
author = {Igor Razgon},
title = {On OBDDs for CNFs of bounded treewidth},
journal = {CoRR},
volume = {abs/1308.3829},
year = {2013},
url = {http://arxiv.org/abs/1308.3829},
eprinttype = {arXiv},
eprint = {1308.3829},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/Razgon13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/AtminasLR12,
author = {Aistis Atminas and
Vadim V. Lozin and
Igor Razgon},
editor = {Fedor V. Fomin and
Petteri Kaski},
title = {Linear Time Algorithm for Computing a Small Biclique in Graphs without
Long Induced Paths},
booktitle = {Algorithm Theory - {SWAT} 2012 - 13th Scandinavian Symposium and Workshops,
Helsinki, Finland, July 4-6, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7357},
pages = {142--152},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-31155-0\_13},
doi = {10.1007/978-3-642-31155-0\_13},
timestamp = {Tue, 14 May 2019 10:00:39 +0200},
biburl = {https://dblp.org/rec/conf/swat/AtminasLR12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jair/HebrardMOR11,
author = {Emmanuel Hebrard and
D{\'{a}}niel Marx and
Barry O'Sullivan and
Igor Razgon},
title = {Soft Constraints of Difference and Equality},
journal = {J. Artif. Intell. Res.},
volume = {41},
pages = {97--130},
year = {2011},
url = {https://doi.org/10.1613/jair.3197},
doi = {10.1613/JAIR.3197},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jair/HebrardMOR11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/MarxR11,
author = {D{\'{a}}niel Marx and
Igor Razgon},
editor = {Lance Fortnow and
Salil P. Vadhan},
title = {Fixed-parameter tractability of multicut parameterized by the size
of the cutset},
booktitle = {Proceedings of the 43rd {ACM} Symposium on Theory of Computing, {STOC}
2011, San Jose, CA, USA, 6-8 June 2011},
pages = {469--478},
publisher = {{ACM}},
year = {2011},
url = {https://doi.org/10.1145/1993636.1993699},
doi = {10.1145/1993636.1993699},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/MarxR11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1104-5361,
author = {Igor Razgon},
title = {Large Isolating Cuts Shrink the Multiway Cut},
journal = {CoRR},
volume = {abs/1104.5361},
year = {2011},
url = {http://arxiv.org/abs/1104.5361},
eprinttype = {arXiv},
eprint = {1104.5361},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1104-5361.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1110-4765,
author = {D{\'{a}}niel Marx and
Barry O'Sullivan and
Igor Razgon},
title = {Finding small separators in linear time via treewidth reduction},
journal = {CoRR},
volume = {abs/1110.4765},
year = {2011},
url = {http://arxiv.org/abs/1110.4765},
eprinttype = {arXiv},
eprint = {1110.4765},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1110-4765.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/MarxOR10,
author = {D{\'{a}}niel Marx and
Barry O'Sullivan and
Igor Razgon},
editor = {Jean{-}Yves Marion and
Thomas Schwentick},
title = {Treewidth Reduction for Constrained Separation and Bipartization Problems},
booktitle = {27th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2010, March 4-6, 2010, Nancy, France},
series = {LIPIcs},
volume = {5},
pages = {561--572},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2010},
url = {https://doi.org/10.4230/LIPIcs.STACS.2010.2485},
doi = {10.4230/LIPICS.STACS.2010.2485},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/stacs/MarxOR10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1010-3633,
author = {D{\'{a}}niel Marx and
Igor Razgon},
title = {Fixed-parameter tractability of multicut parameterized by the size
of the cutset},
journal = {CoRR},
volume = {abs/1010.3633},
year = {2010},
url = {http://arxiv.org/abs/1010.3633},
eprinttype = {arXiv},
eprint = {1010.3633},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1010-3633.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1011-6267,
author = {Igor Razgon},
title = {Computing multiway cut within the given excess over the largest minimum
isolating cut},
journal = {CoRR},
volume = {abs/1011.6267},
year = {2010},
url = {http://arxiv.org/abs/1011.6267},
eprinttype = {arXiv},
eprint = {1011.6267},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1011-6267.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/MarxR09,
author = {D{\'{a}}niel Marx and
Igor Razgon},
title = {Constant ratio fixed-parameter approximation of the edge multicut
problem},
journal = {Inf. Process. Lett.},
volume = {109},
number = {20},
pages = {1161--1166},
year = {2009},
url = {https://doi.org/10.1016/j.ipl.2009.07.016},
doi = {10.1016/J.IPL.2009.07.016},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/MarxR09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/RazgonO09,
author = {Igor Razgon and
Barry O'Sullivan},
title = {Almost 2-SAT is fixed-parameter tractable},
journal = {J. Comput. Syst. Sci.},
volume = {75},
number = {8},
pages = {435--450},
year = {2009},
url = {https://doi.org/10.1016/j.jcss.2009.04.002},
doi = {10.1016/J.JCSS.2009.04.002},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/RazgonO09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/Razgon09,
author = {Igor Razgon},
title = {Faster computation of maximum independent set and parameterized vertex
cover for graphs with maximum degree 3},
journal = {J. Discrete Algorithms},
volume = {7},
number = {2},
pages = {191--212},
year = {2009},
url = {https://doi.org/10.1016/j.jda.2008.09.004},
doi = {10.1016/J.JDA.2008.09.004},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/Razgon09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/GutinRK09,
author = {Gregory Z. Gutin and
Igor Razgon and
Eun Jung Kim},
title = {Minimum leaf out-branching and related problems},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {45},
pages = {4571--4579},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.03.036},
doi = {10.1016/J.TCS.2009.03.036},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/GutinRK09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cp/HebrardMOR09,
author = {Emmanuel Hebrard and
D{\'{a}}niel Marx and
Barry O'Sullivan and
Igor Razgon},
editor = {Ian P. Gent},
title = {Constraints of Difference and Equality: {A} Complete Taxonomic Characterisation},
booktitle = {Principles and Practice of Constraint Programming - {CP} 2009, 15th
International Conference, {CP} 2009, Lisbon, Portugal, September 20-24,
2009, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5732},
pages = {424--438},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-04244-7\_35},
doi = {10.1007/978-3-642-04244-7\_35},
timestamp = {Tue, 14 May 2019 10:00:45 +0200},
biburl = {https://dblp.org/rec/conf/cp/HebrardMOR09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/MarxR09,
author = {D{\'{a}}niel Marx and
Igor Razgon},
editor = {Amos Fiat and
Peter Sanders},
title = {Constant Ratio Fixed-Parameter Approximation of the Edge Multicut
Problem},
booktitle = {Algorithms - {ESA} 2009, 17th Annual European Symposium, Copenhagen,
Denmark, September 7-9, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5757},
pages = {647--658},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-04128-0\_58},
doi = {10.1007/978-3-642-04128-0\_58},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/esa/MarxR09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/GutinKR09,
author = {Gregory Z. Gutin and
Daniel Karapetyan and
Igor Razgon},
editor = {Jianer Chen and
Fedor V. Fomin},
title = {Fixed-Parameter Algorithms in Analysis of Heuristics for Extracting
Networks in Linear Programs},
booktitle = {Parameterized and Exact Computation, 4th International Workshop, {IWPEC}
2009, Copenhagen, Denmark, September 10-11, 2009, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {5917},
pages = {222--233},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-11269-0\_18},
doi = {10.1007/978-3-642-11269-0\_18},
timestamp = {Tue, 14 May 2019 10:00:45 +0200},
biburl = {https://dblp.org/rec/conf/iwpec/GutinKR09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sat/JohannsenRW09,
author = {Daniel Johannsen and
Igor Razgon and
Magnus Wahlstr{\"{o}}m},
editor = {Oliver Kullmann},
title = {Solving {SAT} for {CNF} Formulas with a One-Sided Restriction on Variable
Occurrences},
booktitle = {Theory and Applications of Satisfiability Testing - {SAT} 2009, 12th
International Conference, {SAT} 2009, Swansea, UK, June 30 - July
3, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5584},
pages = {80--85},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-02777-2\_10},
doi = {10.1007/978-3-642-02777-2\_10},
timestamp = {Tue, 14 May 2019 10:00:41 +0200},
biburl = {https://dblp.org/rec/conf/sat/JohannsenRW09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0902-3780,
author = {D{\'{a}}niel Marx and
Barry O'Sullivan and
Igor Razgon},
title = {Treewidth reduction for constrained separation and bipartization problems},
journal = {CoRR},
volume = {abs/0902.3780},
year = {2009},
url = {http://arxiv.org/abs/0902.3780},
eprinttype = {arXiv},
eprint = {0902.3780},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0902-3780.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0906-1359,
author = {Gregory Z. Gutin and
Daniel Karapetyan and
Igor Razgon},
title = {{FPT} Algorithms in Analysis of Heuristics for Extracting Networks
in Linear Programs},
journal = {CoRR},
volume = {abs/0906.1359},
year = {2009},
url = {http://arxiv.org/abs/0906.1359},
eprinttype = {arXiv},
eprint = {0906.1359},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0906-1359.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/FominGPR08,
author = {Fedor V. Fomin and
Serge Gaspers and
Artem V. Pyatkin and
Igor Razgon},
title = {On the Minimum Feedback Vertex Set Problem: Exact and Enumeration
Algorithms},
journal = {Algorithmica},
volume = {52},
number = {2},
pages = {293--307},
year = {2008},
url = {https://doi.org/10.1007/s00453-007-9152-0},
doi = {10.1007/S00453-007-9152-0},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/FominGPR08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/ChenLLOR08,
author = {Jianer Chen and
Yang Liu and
Songjian Lu and
Barry O'Sullivan and
Igor Razgon},
title = {A fixed-parameter algorithm for the directed feedback vertex set problem},
journal = {J. {ACM}},
volume = {55},
number = {5},
pages = {21:1--21:19},
year = {2008},
url = {https://doi.org/10.1145/1411509.1411511},
doi = {10.1145/1411509.1411511},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/ChenLLOR08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aaim/GutinRK08,
author = {Gregory Z. Gutin and
Igor Razgon and
Eun Jung Kim},
editor = {Rudolf Fleischer and
Jinhui Xu},
title = {Minimum Leaf Out-Branching Problems},
booktitle = {Algorithmic Aspects in Information and Management, 4th International
Conference, {AAIM} 2008, Shanghai, China, June 23-25, 2008. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5034},
pages = {235--246},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-68880-8\_23},
doi = {10.1007/978-3-540-68880-8\_23},
timestamp = {Tue, 14 May 2019 10:00:41 +0200},
biburl = {https://dblp.org/rec/conf/aaim/GutinRK08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cp/HebrardOR08,
author = {Emmanuel Hebrard and
Barry O'Sullivan and
Igor Razgon},
editor = {Peter J. Stuckey},
title = {A Soft Constraint of Equality: Complexity and Approximability},
booktitle = {Principles and Practice of Constraint Programming, 14th International
Conference, {CP} 2008, Sydney, Australia, September 14-18, 2008. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5202},
pages = {358--371},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-85958-1\_24},
doi = {10.1007/978-3-540-85958-1\_24},
timestamp = {Tue, 14 May 2019 10:00:45 +0200},
biburl = {https://dblp.org/rec/conf/cp/HebrardOR08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/RazgonO08,
author = {Igor Razgon and
Barry O'Sullivan},
editor = {Luca Aceto and
Ivan Damg{\aa}rd and
Leslie Ann Goldberg and
Magn{\'{u}}s M. Halld{\'{o}}rsson and
Anna Ing{\'{o}}lfsd{\'{o}}ttir and
Igor Walukiewicz},
title = {Almost 2-SAT Is Fixed-Parameter Tractable (Extended Abstract)},
booktitle = {Automata, Languages and Programming, 35th International Colloquium,
{ICALP} 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part
{I:} Tack {A:} Algorithms, Automata, Complexity, and Games},
series = {Lecture Notes in Computer Science},
volume = {5125},
pages = {551--562},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-70575-8\_45},
doi = {10.1007/978-3-540-70575-8\_45},
timestamp = {Fri, 27 Mar 2020 09:02:59 +0100},
biburl = {https://dblp.org/rec/conf/icalp/RazgonO08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ChenLL08,
author = {Jianer Chen and
Yang Liu and
Songjian Lu and
Barry O'Sullivan and
Igor Razgon},
editor = {Cynthia Dwork},
title = {A fixed-parameter algorithm for the directed feedback vertex set problem},
booktitle = {Proceedings of the 40th Annual {ACM} Symposium on Theory of Computing,
Victoria, British Columbia, Canada, May 17-20, 2008},
pages = {177--186},
publisher = {{ACM}},
year = {2008},
url = {https://doi.org/10.1145/1374376.1374404},
doi = {10.1145/1374376.1374404},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/ChenLL08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0801-1300,
author = {Igor Razgon and
Barry O'Sullivan},
title = {Almost 2-SAT is Fixed-Parameter Tractable},
journal = {CoRR},
volume = {abs/0801.1300},
year = {2008},
url = {http://arxiv.org/abs/0801.1300},
eprinttype = {arXiv},
eprint = {0801.1300},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0801-1300.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0801-1979,
author = {Gregory Z. Gutin and
Eun Jung Kim and
Igor Razgon},
title = {Minimum Leaf Out-Branching Problems},
journal = {CoRR},
volume = {abs/0801.1979},
year = {2008},
url = {http://arxiv.org/abs/0801.1979},
eprinttype = {arXiv},
eprint = {0801.1979},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0801-1979.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/constraints/RazgonM07,
author = {Igor Razgon and
Amnon Meisels},
title = {A {CSP} Search Algorithm with Responsibility Sets and Kernels},
journal = {Constraints An Int. J.},
volume = {12},
number = {2},
pages = {151--177},
year = {2007},
url = {https://doi.org/10.1007/s10601-007-9016-x},
doi = {10.1007/S10601-007-9016-X},
timestamp = {Fri, 13 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/constraints/RazgonM07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Razgon07,
author = {Igor Razgon},
title = {A 2\({}^{\mbox{O(k)}}\)poly(n) algorithm for the parameterized Convex
Recoloring problem},
journal = {Inf. Process. Lett.},
volume = {104},
number = {2},
pages = {53--58},
year = {2007},
url = {https://doi.org/10.1016/j.ipl.2007.05.007},
doi = {10.1016/J.IPL.2007.05.007},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Razgon07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/ChorFRRRS07,
author = {Benny Chor and
Michael R. Fellows and
Mark A. Ragan and
Igor Razgon and
Frances A. Rosamond and
Sagi Snir},
editor = {Guohui Lin},
title = {Connected Coloring Completion for General Graphs: Algorithms and Complexity},
booktitle = {Computing and Combinatorics, 13th Annual International Conference,
{COCOON} 2007, Banff, Canada, July 16-19, 2007, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4598},
pages = {75--85},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-73545-8\_10},
doi = {10.1007/978-3-540-73545-8\_10},
timestamp = {Tue, 14 May 2019 10:00:35 +0200},
biburl = {https://dblp.org/rec/conf/cocoon/ChorFRRRS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/csclp/RazgonOP07,
author = {Igor Razgon and
Barry O'Sullivan and
Gregory M. Provan},
editor = {Fran{\c{c}}ois Fages and
Francesca Rossi and
Sylvain Soliman},
title = {Generalizing Global Constraints Based on Network Flows},
booktitle = {Recent Advances in Constraints, 12th Annual {ERCIM} International
Workshop on Constraint Solving and Constraint Logic Programming, {CSCLP}
2007, Rocquencourt, France, June 7-8, 2007, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {5129},
pages = {127--141},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-89812-2\_9},
doi = {10.1007/978-3-540-89812-2\_9},
timestamp = {Tue, 23 Jan 2024 13:25:46 +0100},
biburl = {https://dblp.org/rec/conf/csclp/RazgonOP07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ictcs/Razgon07,
author = {Igor Razgon},
editor = {Giuseppe F. Italiano and
Eugenio Moggi and
Luigi Laura},
title = {Computing Minimum Directed Feedback Vertex Set in O(1.9977\({}^{\mbox{n}}\))},
booktitle = {Theoretical Computer Science, 10th Italian Conference, {ICTCS} 2007,
Rome, Italy, October 3-5, 2007, Proceedings},
pages = {70--81},
publisher = {World Scientific},
year = {2007},
timestamp = {Wed, 11 Jun 2008 08:55:26 +0200},
biburl = {https://dblp.org/rec/conf/ictcs/Razgon07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dagstuhl/RazgonO07,
author = {Igor Razgon and
Barry O'Sullivan},
editor = {Erik D. Demaine and
Gregory Z. Gutin and
D{\'{a}}niel Marx and
Ulrike Stege},
title = {Directed Feedback Vertex Set is Fixed-Parameter Tractable},
booktitle = {Structure Theory and {FPT} Algorithmics for Graphs, Digraphs and Hypergraphs,
08.07. - 13.07.2007},
series = {Dagstuhl Seminar Proceedings},
volume = {07281},
publisher = {Internationales Begegnungs- und Forschungszentrum fuer Informatik
(IBFI), Schloss Dagstuhl, Germany},
year = {2007},
url = {http://drops.dagstuhl.de/opus/volltexte/2007/1236},
timestamp = {Thu, 10 Jun 2021 13:02:09 +0200},
biburl = {https://dblp.org/rec/conf/dagstuhl/RazgonO07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0707-0282,
author = {Igor Razgon and
Barry O'Sullivan},
title = {Directed Feedback Vertex Set is Fixed-Parameter Tractable},
journal = {CoRR},
volume = {abs/0707.0282},
year = {2007},
url = {http://arxiv.org/abs/0707.0282},
eprinttype = {arXiv},
eprint = {0707.0282},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0707-0282.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/acid/Razgon06,
author = {Igor Razgon},
editor = {Hajo Broersma and
Stefan S. Dantchev and
Matthew Johnson and
Stefan Szeider},
title = {A Faster Solving of the Maximum Independent Set Problem for Graphs
with Maximal Degree 3},
booktitle = {Algorithms and Complexity in Durham 2006 - Proceedings of the Second
ACiD Workshop, 18-20 September 2006, Durham, {UK}},
series = {Texts in Algorithmics},
volume = {7},
pages = {131--142},
publisher = {King's College, London},
year = {2006},
timestamp = {Tue, 24 Jul 2007 20:35:24 +0200},
biburl = {https://dblp.org/rec/conf/acid/Razgon06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/csclp/RazgonO06,
author = {Igor Razgon and
Barry O'Sullivan},
editor = {Francisco Azevedo and
Pedro Barahona and
Fran{\c{c}}ois Fages and
Francesca Rossi},
title = {Efficient Recognition of Acyclic Clustered Constraint Satisfaction
Problems},
booktitle = {Recent Advances in Constraints, 11th Annual {ERCIM} International
Workshop on Constraint Solving and Contraint Logic Programming, {CSCLP}
2006, Caparica, Portugal, June 26-28, 2006, Revised Selected and Invited
Papers},
series = {Lecture Notes in Computer Science},
volume = {4651},
pages = {154--168},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/978-3-540-73817-6\_10},
doi = {10.1007/978-3-540-73817-6\_10},
timestamp = {Tue, 23 Jan 2024 13:25:46 +0100},
biburl = {https://dblp.org/rec/conf/csclp/RazgonO06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Razgon06,
author = {Igor Razgon},
editor = {Lars Arge and
Rusins Freivalds},
title = {Exact Computation of Maximum Induced Forest},
booktitle = {Algorithm Theory - {SWAT} 2006, 10th ScandinavianWorkshop on Algorithm
Theory, Riga, Latvia, July 6-8, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4059},
pages = {160--171},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11785293\_17},
doi = {10.1007/11785293\_17},
timestamp = {Tue, 14 May 2019 10:00:39 +0200},
biburl = {https://dblp.org/rec/conf/swat/Razgon06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/csclp/RazgonM05,
author = {Igor Razgon and
Amnon Meisels},
editor = {Brahim Hnich and
Mats Carlsson and
Fran{\c{c}}ois Fages and
Francesca Rossi},
title = {A {CSP} Search Algorithm with Reduced Branching Factor},
booktitle = {Recent Advances in Constraints, Joint ERCIM/CoLogNET International
Workshop on Constraint Solving and Constraint Logic Programming, {CSCLP}
2005, Uppsala, Sweden, June 20-22, 2005, Revised Selected and Invited
Papers},
series = {Lecture Notes in Computer Science},
volume = {3978},
pages = {59--72},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11754602\_5},
doi = {10.1007/11754602\_5},
timestamp = {Tue, 23 Jan 2024 13:25:46 +0100},
biburl = {https://dblp.org/rec/conf/csclp/RazgonM05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/csclp/Razgon05,
author = {Igor Razgon},
editor = {Brahim Hnich and
Mats Carlsson and
Fran{\c{c}}ois Fages and
Francesca Rossi},
title = {Complexity Analysis of Heuristic {CSP} Search Algorithms},
booktitle = {Recent Advances in Constraints, Joint ERCIM/CoLogNET International
Workshop on Constraint Solving and Constraint Logic Programming, {CSCLP}
2005, Uppsala, Sweden, June 20-22, 2005, Revised Selected and Invited
Papers},
series = {Lecture Notes in Computer Science},
volume = {3978},
pages = {88--99},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11754602\_7},
doi = {10.1007/11754602\_7},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/csclp/Razgon05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ijcai/RazgonM05,
author = {Igor Razgon and
Amnon Meisels},
editor = {Leslie Pack Kaelbling and
Alessandro Saffiotti},
title = {{CSP} Search with Responsibility Sets and Kernels},
booktitle = {IJCAI-05, Proceedings of the Nineteenth International Joint Conference
on Artificial Intelligence, Edinburgh, Scotland, UK, July 30 - August
5, 2005},
pages = {1533--1534},
publisher = {Professional Book Center},
year = {2005},
url = {http://ijcai.org/Proceedings/05/Papers/post-0120.pdf},
timestamp = {Tue, 20 Aug 2019 16:16:29 +0200},
biburl = {https://dblp.org/rec/conf/ijcai/RazgonM05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/csclp/RazgonM04,
author = {Igor Razgon and
Amnon Meisels},
editor = {Boi Faltings and
Adrian Petcu and
Fran{\c{c}}ois Fages and
Francesca Rossi},
title = {Pruning by Equally Constrained Variables},
booktitle = {Recent Advances in Constraints, Joint ERCIM/CoLogNet International
Workshop on Constraint Solving and Constraint Logic Programming, {CSCLP}
2004, Lausanne, Switzerland, June 23-25, 2004, Revised Selected and
Invited Papers},
series = {Lecture Notes in Computer Science},
volume = {3419},
pages = {26--40},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/11402763\_3},
doi = {10.1007/11402763\_3},
timestamp = {Tue, 23 Jan 2024 13:25:46 +0100},
biburl = {https://dblp.org/rec/conf/csclp/RazgonM04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cp/RazgonM03,
author = {Igor Razgon and
Amnon Meisels},
editor = {Francesca Rossi},
title = {Maintaining Dominance Consistency},
booktitle = {Principles and Practice of Constraint Programming - {CP} 2003, 9th
International Conference, {CP} 2003, Kinsale, Ireland, September 29
- October 3, 2003, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2833},
pages = {945--949},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/978-3-540-45193-8\_84},
doi = {10.1007/978-3-540-45193-8\_84},
timestamp = {Tue, 23 Jan 2024 13:25:46 +0100},
biburl = {https://dblp.org/rec/conf/cp/RazgonM03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-04-25 02:45 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
