The following pages link to Igor Razgon (Q309787):
Displaying 44 items.
- On the read-once property of branching programs and CNFs of bounded treewidth (Q309788) (← links)
- Boundary properties of well-quasi-ordered sets of graphs (Q382896) (← links)
- On the minimum feedback vertex set problem: Exact and enumeration algorithms (Q958216) (← links)
- Constant ratio fixed-parameter approximation of the edge multicut problem (Q990949) (← links)
- Faster computation of maximum independent set and parameterized vertex cover for graphs with maximum degree 3 (Q1026228) (← links)
- Almost 2-SAT is fixed-parameter tractable (Q1034100) (← links)
- Minimum leaf out-branching and related problems (Q1035689) (← links)
- Graphs without large bicliques and well-quasi-orderability by the induced subgraph relation (Q1713790) (← links)
- Well-quasi-ordering versus clique-width (Q1745730) (← links)
- Linear read-once and related Boolean functions (Q1801039) (← links)
- Tree-width dichotomy (Q2136198) (← links)
- A \(2^{O(k)}\)poly\((n)\) algorithm for the parameterized convex recoloring problem (Q2379996) (← links)
- On oblivious branching programs with bounded repetition that cannot efficiently compute CNFs of bounded treewidth (Q2408558) (← links)
- A CSP search algorithm with responsibility sets and kernels (Q2454814) (← links)
- Well-quasi-ordering Does Not Imply Bounded Clique-width (Q2827822) (← links)
- Linear Time Algorithm for Computing a Small Biclique in Graphs without Long Induced Paths (Q2904550) (← links)
- Finding small separators in linear time via treewidth reduction (Q2933661) (← links)
- No Small Nondeterministic Read-Once Branching Programs for CNFs of Bounded Treewidth (Q2946031) (← links)
- Soft Constraints of Difference and Equality (Q3007560) (← links)
- Treewidth reduction for constrained separation and bipartization problems (Q3113780) (← links)
- A fixed-parameter algorithm for the directed feedback vertex set problem (Q3452187) (← links)
- Minimum Leaf Out-Branching Problems (Q3511432) (← links)
- Almost 2-SAT Is Fixed-Parameter Tractable (Extended Abstract) (Q3521946) (← links)
- (Q3549698) (← links)
- Efficient Recognition of Acyclic Clustered Constraint Satisfaction Problems (Q3608451) (← links)
- Connected Coloring Completion for General Graphs: Algorithms and Complexity (Q3608833) (← links)
- Solving SAT for CNF Formulas with a One-Sided Restriction on Variable Occurrences (Q3637160) (← links)
- Constant Ratio Fixed-Parameter Approximation of the Edge Multicut Problem (Q3639279) (← links)
- Fixed-Parameter Algorithms in Analysis of Heuristics for Extracting Networks in Linear Programs (Q3656864) (← links)
- Specifying a positive threshold function via extremal points (Q4645645) (← links)
- Complexity Analysis of Generalized and Fractional Hypertree Decompositions (Q5056426) (← links)
- (Q5089208) (← links)
- Generalizing Global Constraints Based on Network Flows (Q5302729) (← links)
- Cliquewidth and Knowledge Compilation (Q5326474) (← links)
- Fixed-parameter tractability of multicut parameterized by the size of the cutset (Q5419117) (← links)
- Fixed-Parameter Tractability of Multicut Parameterized by the Size of the Cutset (Q5494921) (← links)
- Recent Advances in Constraints (Q5703908) (← links)
- Exact Computation of Maximum Induced Forest (Q5757894) (← links)
- Recent Advances in Constraints (Q5899109) (← links)
- Recent Advances in Constraints (Q5899111) (← links)
- Fractional covers of hypergraphs with bounded multi-intersection (Q6057846) (← links)
- The Treewidth and Pathwidth of Graph Unions (Q6141861) (← links)
- (Q6192493) (← links)
- The splitting power of branching programs of bounded repetition and CNFs of bounded width (Q6648277) (← links)
