Igor Razgon

From MaRDI portal
Person:309787

Available identifiers

zbMath Open razgon.igorMaRDI QIDQ309787

List of research outcomes





PublicationDate of PublicationType
The splitting power of branching programs of bounded repetition and CNFs of bounded width2024-12-04Paper
New Width Parameters for Independent Set: One-Sided-Mim-Width and Neighbor-Depth2024-05-03Paper
https://portal.mardi4nfdi.de/entity/Q61924932024-02-12Paper
The Treewidth and Pathwidth of Graph Unions2024-01-23Paper
Fractional covers of hypergraphs with bounded multi-intersection2023-10-26Paper
Complexity Analysis of Generalized and Fractional Hypertree Decompositions2022-12-08Paper
https://portal.mardi4nfdi.de/entity/Q50892082022-07-18Paper
Tree-width dichotomy2022-05-10Paper
The splitting power of branching programs of bounded repetition and CNFs of bounded width2022-01-06Paper
Graphs without large bicliques and well-quasi-orderability by the induced subgraph relation2019-01-28Paper
Specifying a positive threshold function via extremal points2019-01-10Paper
Linear read-once and related Boolean functions2018-10-26Paper
Well-quasi-ordering versus clique-width2018-04-18Paper
On oblivious branching programs with bounded repetition that cannot efficiently compute CNFs of bounded treewidth2017-10-12Paper
Partial matching width and its application to lower bounds for branching programs2017-09-26Paper
Well-quasi-ordering Does Not Imply Bounded Clique-width2016-10-21Paper
On the read-once property of branching programs and CNFs of bounded treewidth2016-09-07Paper
A fixed-parameter algorithm for the directed feedback vertex set problem2015-11-11Paper
No Small Nondeterministic Read-Once Branching Programs for CNFs of Bounded Treewidth2015-09-15Paper
Finding small separators in linear time via treewidth reduction2014-12-05Paper
Fixed-Parameter Tractability of Multicut Parameterized by the Size of the Cutset2014-07-30Paper
Fixed-parameter tractability of multicut parameterized by the size of the cutset2014-06-05Paper
Boundary properties of well-quasi-ordered sets of graphs2013-11-22Paper
Cliquewidth and Knowledge Compilation2013-08-05Paper
Linear Time Algorithm for Computing a Small Biclique in Graphs without Long Induced Paths2012-08-14Paper
Treewidth reduction for constrained separation and bipartization problems2012-01-23Paper
Soft Constraints of Difference and Equality2011-06-16Paper
Constant ratio fixed-parameter approximation of the edge multicut problem2010-09-01Paper
A \(2^{O(k)}\)poly\((n)\) algorithm for the parameterized convex recoloring problem2010-03-24Paper
Fixed-Parameter Algorithms in Analysis of Heuristics for Extracting Networks in Linear Programs2010-01-14Paper
Almost 2-SAT is fixed-parameter tractable2009-11-10Paper
Minimum leaf out-branching and related problems2009-11-04Paper
Constant Ratio Fixed-Parameter Approximation of the Edge Multicut Problem2009-10-29Paper
Solving SAT for CNF Formulas with a One-Sided Restriction on Variable Occurrences2009-07-07Paper
Faster computation of maximum independent set and parameterized vertex cover for graphs with maximum degree 32009-06-24Paper
Connected Coloring Completion for General Graphs: Algorithms and Complexity2009-03-06Paper
Efficient Recognition of Acyclic Clustered Constraint Satisfaction Problems2009-03-05Paper
Generalizing Global Constraints Based on Network Flows2009-01-13Paper
https://portal.mardi4nfdi.de/entity/Q35496982009-01-05Paper
On the minimum feedback vertex set problem: Exact and enumeration algorithms2008-12-02Paper
Almost 2-SAT Is Fixed-Parameter Tractable (Extended Abstract)2008-08-28Paper
Minimum Leaf Out-Branching Problems2008-07-10Paper
A CSP search algorithm with responsibility sets and kernels2007-10-22Paper
Exact Computation of Maximum Induced Forest2007-09-07Paper
Recent Advances in Constraints2007-05-02Paper
Recent Advances in Constraints2007-05-02Paper
Recent Advances in Constraints2005-11-11Paper

Research outcomes over time

This page was built for person: Igor Razgon