Igor Razgon - RankMe

92 papers A* 4A 9B 6C 1Misc 1Journal 57Unranked 14

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	Decision DNNFs with imbalanced conjunction cannot efficiently represent CNFs of bounded width. CoRR Igor Razgon
2025	J	`jnl`	FPT Parameterisations of Fractional and Generalised Hypertree Width. CoRR Matthias Lanzinger, Igor Razgon, Daniel Unterberger
2025	J	`jnl`	On complexity of restricted fragments of Decision DNNF. CoRR Andrea Calì, Igor Razgon
2024	A	`conf`	FPT Approximation of Generalised Hypertree Width for Bounded Intersection Hypergraphs. STACS Matthias Lanzinger, Igor Razgon
2024	J	`jnl`	The Treewidth and Pathwidth of Graph Unions. SIAM J. Discret. Math. Bogdan Alecu, Vadim V. Lozin, Daniel A. Quiroz, Roman Rabinovich, Igor Razgon, Viktor Zamaraev
2024	J	`jnl`	The splitting power of branching programs of bounded repetition and CNFs of bounded width. Electron. Colloquium Comput. Complex. Igor Razgon
2023	J	`jnl`	FPT Approximation of Generalised Hypertree Width for Bounded Intersection Hypergraphs. CoRR Matthias Lanzinger, Igor Razgon
2023	J	`jnl`	Fractional covers of hypergraphs with bounded multi-intersection. Theor. Comput. Sci. Georg Gottlob, Matthias Lanzinger, Reinhard Pichler, Igor Razgon
2023	B	`conf`	New Width Parameters for Independent Set: One-Sided-Mim-Width and Neighbor-Depth. WG Benjamin Bergougnoux, Tuukka Korhonen, Igor Razgon
2023	J	`jnl`	New Width Parameters for Independent Set: One-sided-mim-width and Neighbor-depth. CoRR Benjamin Bergougnoux, Tuukka Korhonen, Igor Razgon
2022	J	`jnl`	FPT algoritms providing constant ratio approximation of hypertree width parameters for hypergraphs of bounded rank. CoRR Igor Razgon
2022	J	`jnl`	The splitting power of branching programs of bounded repetition and CNFs of bounded width. CoRR Igor Razgon
2022	J	`jnl`	The treewidth and pathwidth of graph unions. CoRR Bogdan Alecu, Vadim V. Lozin, Daniel A. Quiroz, Roman Rabinovich, Igor Razgon, Viktor Zamaraev
2022	J	`jnl`	Tree-width dichotomy. Eur. J. Comb. Vadim V. Lozin, Igor Razgon
2021	B	`conf`	Classification of OBDD Size for Monotone 2-CNFs. IPEC Igor Razgon
2021	J	`jnl`	Classification of OBDD size for monotone 2-CNFs. CoRR Igor Razgon
2021	J	`jnl`	Classification of OBDD size for monotone 2-CNFs. Electron. Colloquium Comput. Complex. Igor Razgon
2021	J	`jnl`	Complexity Analysis of Generalized and Fractional Hypertree Decompositions. J. ACM Georg Gottlob, Matthias Lanzinger, Reinhard Pichler, Igor Razgon
2020	J	`jnl`	Complexity Analysis of General and Fractional Hypertree Decompositions. CoRR Georg Gottlob, Matthias Lanzinger, Reinhard Pichler, Igor Razgon
2020	B	`conf`	Fractional Covers of Hypergraphs with Bounded Multi-Intersection. MFCS Georg Gottlob, Matthias Lanzinger, Reinhard Pichler, Igor Razgon
2020	J	`jnl`	Fractional Covers of Hypergraphs with Bounded Multi-Intersection. CoRR Georg Gottlob, Matthias Lanzinger, Reinhard Pichler, Igor Razgon
2020	J	`jnl`	Tree-width dichotomy. CoRR Vadim V. Lozin, Igor Razgon
2019	J	`jnl`	Regular resolution for CNF of bounded incidence treewidth with few long clauses. CoRR Andrea Calì, Igor Razgon
2018	J	`jnl`	Linear read-once and related Boolean functions. CoRR Vadim V. Lozin, Igor Razgon, Viktor Zamaraev, Elena Zamaraeva, Nikolai Yu. Zolotykh
2018	J	`jnl`	Linear read-once and related Boolean functions. Discret. Appl. Math. Vadim V. Lozin, Igor Razgon, Viktor Zamaraev, Elena Zamaraeva, Nikolai Yu. Zolotykh
2018	J	`jnl`	Well-quasi-ordering versus clique-width. J. Comb. Theory B Vadim V. Lozin, Igor Razgon, Viktor Zamaraev
2017	J	`jnl`	Non-FPT lower bounds for structural restrictions of decision DNNF. CoRR Andrea Calì, Florent Capelli, Igor Razgon
2017	J	`jnl`	On Oblivious Branching Programs with Bounded Repetition that Cannot Efficiently Compute CNFs of Bounded Treewidth. Theory Comput. Syst. Igor Razgon
2017	J	`jnl`	Partial matching width and its application to lower bounds for branching programs. CoRR Igor Razgon
2017	—	`conf`	Querying the Deep Web: Back to the Foundations. AMW Andrea Calì, Davide Martinenghi, Igor Razgon, Martín Ugarte
2017	B	`conf`	Specifying a positive threshold function via extremal points. ALT Vadim V. Lozin, Igor Razgon, Viktor Zamaraev, Elena Zamaraeva, Nikolai Yu. Zolotykh
2017	J	`jnl`	Specifying a positive threshold function via extremal points. CoRR Vadim V. Lozin, Igor Razgon, Victor Zamaraev, Elena Zamaraeva, Nikolai Yu. Zolotykh
2016	J	`jnl`	Non-deterministic branching programs with logarithmic repetition cannot efficiently compute small monotone CNFs. CoRR Oded Lachish, Igor Razgon
2016	J	`jnl`	On the Read-Once Property of Branching Programs and CNFs of Bounded Treewidth. Algorithmica Igor Razgon
2015	J	`jnl`	On oblivious branching programs with bounded repetition that cannot efficiently compute CNFs of bounded treewidth. CoRR Igor Razgon
2015	A	`conf`	Quasipolynomial Simulation of DNNF by a Non-determinstic Read-Once Branching Program. CP Igor Razgon
2015	J	`jnl`	Two types of branching programs with bounded repetition that cannot efficiently compute monotone 3-CNFs. CoRR Igor Razgon
2015	B	`conf`	Well-quasi-ordering Does Not Imply Bounded Clique-width. WG Vadim V. Lozin, Igor Razgon, Victor Zamaraev
2015	J	`jnl`	Well-quasi-ordering does not imply bounded clique-width. CoRR Vadim V. Lozin, Igor Razgon, Victor Zamaraev
2014	—	`conf`	Complexity of Conjunctive Query Answering under Access Limitations (Preliminary Report). SEBD Andrea Calì, Igor Razgon
2014	J	`jnl`	Fixed-Parameter Tractability of Multicut Parameterized by the Size of the Cutset. SIAM J. Comput. Dániel Marx, Igor Razgon
2014	B	`conf`	No Small Nondeterministic Read-Once Branching Programs for CNFs of Bounded Treewidth. IPEC Igor Razgon
2014	J	`jnl`	No small nondeterministic read-once branching programs for CNFs of bounded treewidth. CoRR Igor Razgon
2014	A*	`conf`	On OBDDs for CNFs of Bounded Treewidth. KR Igor Razgon
2014	J	`jnl`	On the read-once property of branching programs and CNFs of bounded treewidth. CoRR Igor Razgon
2014	J	`jnl`	Soft Constraints of Difference and Equality. CoRR Emmanuel Hebrard, Dániel Marx, Barry O'Sullivan, Igor Razgon
2013	J	`jnl`	Boundary Properties of Well-Quasi-Ordered Sets of Graphs. Order Nicholas Korpelainen, Vadim V. Lozin, Igor Razgon
2013	J	`jnl`	Cliquewidth and Knowledge Compilation CoRR Igor Razgon, Justyna Petke
2013	A	`conf`	Cliquewidth and Knowledge Compilation. SAT Igor Razgon, Justyna Petke
2013	J	`jnl`	Finding small separators in linear time via treewidth reduction. ACM Trans. Algorithms Dániel Marx, Barry O'Sullivan, Igor Razgon
2013	J	`jnl`	On OBDDs for CNFs of bounded treewidth. CoRR Igor Razgon
2012	—	`conf`	Linear Time Algorithm for Computing a Small Biclique in Graphs without Long Induced Paths. SWAT Aistis Atminas, Vadim V. Lozin, Igor Razgon
2011	J	`jnl`	Finding small separators in linear time via treewidth reduction CoRR Dániel Marx, Barry O'Sullivan, Igor Razgon
2011	A*	`conf`	Fixed-parameter tractability of multicut parameterized by the size of the cutset. STOC Dániel Marx, Igor Razgon
2011	J	`jnl`	Large Isolating Cuts Shrink the Multiway Cut CoRR Igor Razgon
2011	J	`jnl`	Soft Constraints of Difference and Equality. J. Artif. Intell. Res. Emmanuel Hebrard, Dániel Marx, Barry O'Sullivan, Igor Razgon
2010	J	`jnl`	Computing multiway cut within the given excess over the largest minimum isolating cut CoRR Igor Razgon
2010	J	`jnl`	Fixed-parameter tractability of multicut parameterized by the size of the cutset CoRR Dániel Marx, Igor Razgon
2010	A	`conf`	Treewidth Reduction for Constrained Separation and Bipartization Problems. STACS Dániel Marx, Barry O'Sullivan, Igor Razgon
2009	J	`jnl`	Almost 2-SAT is fixed-parameter tractable. J. Comput. Syst. Sci. Igor Razgon, Barry O'Sullivan
2009	A	`conf`	Constant Ratio Fixed-Parameter Approximation of the Edge Multicut Problem. ESA Dániel Marx, Igor Razgon
2009	J	`jnl`	Constant ratio fixed-parameter approximation of the edge multicut problem. Inf. Process. Lett. Dániel Marx, Igor Razgon
2009	A	`conf`	Constraints of Difference and Equality: A Complete Taxonomic Characterisation. CP Emmanuel Hebrard, Dániel Marx, Barry O'Sullivan, Igor Razgon
2009	J	`jnl`	FPT Algorithms in Analysis of Heuristics for Extracting Networks in Linear Programs CoRR Gregory Z. Gutin, Daniel Karapetyan, Igor Razgon
2009	J	`jnl`	Faster computation of maximum independent set and parameterized vertex cover for graphs with maximum degree 3. J. Discrete Algorithms Igor Razgon
2009	—	`conf`	Fixed-Parameter Algorithms in Analysis of Heuristics for Extracting Networks in Linear Programs. IWPEC Gregory Z. Gutin, Daniel Karapetyan, Igor Razgon
2009	J	`jnl`	Minimum leaf out-branching and related problems. Theor. Comput. Sci. Gregory Z. Gutin, Igor Razgon, Eun Jung Kim
2009	A	`conf`	Solving SAT for CNF Formulas with a One-Sided Restriction on Variable Occurrences. SAT Daniel Johannsen, Igor Razgon, Magnus Wahlström
2009	J	`jnl`	Treewidth reduction for constrained separation and bipartization problems CoRR Dániel Marx, Barry O'Sullivan, Igor Razgon
2008	A	`conf`	A Soft Constraint of Equality: Complexity and Approximability. CP Emmanuel Hebrard, Barry O'Sullivan, Igor Razgon
2008	A*	`conf`	A fixed-parameter algorithm for the directed feedback vertex set problem. STOC Jianer Chen, Yang Liu, Songjian Lu, Barry O'Sullivan, Igor Razgon
2008	J	`jnl`	A fixed-parameter algorithm for the directed feedback vertex set problem. J. ACM Jianer Chen, Yang Liu, Songjian Lu, Barry O'Sullivan, Igor Razgon
2008	—	`conf`	Almost 2-SAT Is Fixed-Parameter Tractable (Extended Abstract). ICALP (1) Igor Razgon, Barry O'Sullivan
2008	J	`jnl`	Almost 2-SAT is Fixed-Parameter Tractable CoRR Igor Razgon, Barry O'Sullivan
2008	J	`jnl`	Minimum Leaf Out-Branching Problems CoRR Gregory Z. Gutin, Eun Jung Kim, Igor Razgon
2008	C	`conf`	Minimum Leaf Out-Branching Problems. AAIM Gregory Z. Gutin, Igor Razgon, Eun Jung Kim
2008	J	`jnl`	On the Minimum Feedback Vertex Set Problem: Exact and Enumeration Algorithms. Algorithmica Fedor V. Fomin, Serge Gaspers, Artem V. Pyatkin, Igor Razgon
2007	J	`jnl`	A 2 Inf. Process. Lett. Igor Razgon
2007	J	`jnl`	A CSP Search Algorithm with Responsibility Sets and Kernels. Constraints An Int. J. Igor Razgon, Amnon Meisels
2007	—	`conf`	Computing Minimum Directed Feedback Vertex Set in O(1.9977 ICTCS Igor Razgon
2007	Misc	`conf`	Connected Coloring Completion for General Graphs: Algorithms and Complexity. COCOON Benny Chor, Michael R. Fellows, Mark A. Ragan, Igor Razgon, Frances A. Rosamond, Sagi Snir
2007	J	`jnl`	Directed Feedback Vertex Set is Fixed-Parameter Tractable CoRR Igor Razgon, Barry O'Sullivan
2007	—	`conf`	Directed Feedback Vertex Set is Fixed-Parameter Tractable. Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs Igor Razgon, Barry O'Sullivan
2007	—	`conf`	Generalizing Global Constraints Based on Network Flows. CSCLP Igor Razgon, Barry O'Sullivan, Gregory M. Provan
2006	—	`conf`	A Faster Solving of the Maximum Independent Set Problem for Graphs with Maximal Degree 3. ACiD Igor Razgon
2006	—	`conf`	Efficient Recognition of Acyclic Clustered Constraint Satisfaction Problems. CSCLP Igor Razgon, Barry O'Sullivan
2006	—	`conf`	Exact Computation of Maximum Induced Forest. SWAT Igor Razgon
2005	—	`conf`	A CSP Search Algorithm with Reduced Branching Factor. CSCLP Igor Razgon, Amnon Meisels
2005	A*	`conf`	CSP Search with Responsibility Sets and Kernels. IJCAI Igor Razgon, Amnon Meisels
2005	—	`conf`	Complexity Analysis of Heuristic CSP Search Algorithms. CSCLP Igor Razgon
2004	—	`conf`	Pruning by Equally Constrained Variables. CSCLP Igor Razgon, Amnon Meisels
2003	A	`conf`	Maintaining Dominance Consistency. CP Igor Razgon, Amnon Meisels