Igor Razgon

Available identifiers

List of research outcomes

Publication	Date of Publication	Type
https://portal.mardi4nfdi.de/entity/Q6192493	2024-02-12	Paper
The Treewidth and Pathwidth of Graph Unions	2024-01-23	Paper
Fractional covers of hypergraphs with bounded multi-intersection	2023-10-26	Paper
Complexity Analysis of Generalized and Fractional Hypertree Decompositions	2022-12-08	Paper
https://portal.mardi4nfdi.de/entity/Q5089208	2022-07-18	Paper
Tree-width dichotomy	2022-05-10	Paper
The splitting power of branching programs of bounded repetition and CNFs of bounded width	2022-01-06	Paper
Graphs without large bicliques and well-quasi-orderability by the induced subgraph relation	2019-01-28	Paper
Specifying a positive threshold function via extremal points	2019-01-10	Paper
Linear read-once and related Boolean functions	2018-10-26	Paper
Well-quasi-ordering versus clique-width	2018-04-18	Paper
On oblivious branching programs with bounded repetition that cannot efficiently compute CNFs of bounded treewidth	2017-10-12	Paper
Partial matching width and its application to lower bounds for branching programs	2017-09-26	Paper
Well-quasi-ordering Does Not Imply Bounded Clique-width	2016-10-21	Paper
On the read-once property of branching programs and CNFs of bounded treewidth	2016-09-07	Paper
A fixed-parameter algorithm for the directed feedback vertex set problem	2015-11-11	Paper
No Small Nondeterministic Read-Once Branching Programs for CNFs of Bounded Treewidth	2015-09-15	Paper
Finding small separators in linear time via treewidth reduction	2014-12-05	Paper
Fixed-Parameter Tractability of Multicut Parameterized by the Size of the Cutset	2014-07-30	Paper
Fixed-parameter tractability of multicut parameterized by the size of the cutset	2014-06-05	Paper
Boundary properties of well-quasi-ordered sets of graphs	2013-11-22	Paper
Cliquewidth and Knowledge Compilation	2013-08-05	Paper
Linear Time Algorithm for Computing a Small Biclique in Graphs without Long Induced Paths	2012-08-14	Paper
https://portal.mardi4nfdi.de/entity/Q3113780	2012-01-23	Paper
Soft Constraints of Difference and Equality	2011-06-16	Paper
Constant ratio fixed-parameter approximation of the edge multicut problem	2010-09-01	Paper
A \(2^{O(k)}\)poly\((n)\) algorithm for the parameterized convex recoloring problem	2010-03-24	Paper
Fixed-Parameter Algorithms in Analysis of Heuristics for Extracting Networks in Linear Programs	2010-01-14	Paper
Almost 2-SAT is fixed-parameter tractable	2009-11-10	Paper
Minimum leaf out-branching and related problems	2009-11-04	Paper
Constant Ratio Fixed-Parameter Approximation of the Edge Multicut Problem	2009-10-29	Paper
Solving SAT for CNF Formulas with a One-Sided Restriction on Variable Occurrences	2009-07-07	Paper
Faster computation of maximum independent set and parameterized vertex cover for graphs with maximum degree 3	2009-06-24	Paper
Connected Coloring Completion for General Graphs: Algorithms and Complexity	2009-03-06	Paper
Efficient Recognition of Acyclic Clustered Constraint Satisfaction Problems	2009-03-05	Paper
Generalizing Global Constraints Based on Network Flows	2009-01-13	Paper
https://portal.mardi4nfdi.de/entity/Q3549698	2009-01-05	Paper
On the minimum feedback vertex set problem: Exact and enumeration algorithms	2008-12-02	Paper
Almost 2-SAT Is Fixed-Parameter Tractable (Extended Abstract)	2008-08-28	Paper
Minimum Leaf Out-Branching Problems	2008-07-10	Paper
A CSP search algorithm with responsibility sets and kernels	2007-10-22	Paper
Exact Computation of Maximum Induced Forest	2007-09-07	Paper
Recent Advances in Constraints	2007-05-02	Paper
Recent Advances in Constraints	2007-05-02	Paper
Recent Advances in Constraints	2005-11-11	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Igor Razgon