The following pages link to Ivan A. Bliznets (Q1946834):
Displaying 27 items.
- (Q329300) (redirect page) (← links)
- Largest chordal and interval subgraphs faster than \(2^n\) (Q329301) (← links)
- Parameterized complexity of superstring problems (Q1679230) (← links)
- A new upper bound for \(( n , 3)\)-MAX-SAT (Q1946835) (← links)
- Maximizing happiness in graphs of bounded clique-width (Q2081605) (← links)
- Algorithms for \((n,3)\)-MAXSAT and parameterization above the all-true assignment (Q2283027) (← links)
- On happy colorings, cuts, and structural parameterizations (Q2301539) (← links)
- Upper and lower bounds for different parameterizations of (n,3)-MAXSAT (Q2327118) (← links)
- Kernelization lower bound for permutation pattern matching (Q2339595) (← links)
- Solving target set selection with bounded thresholds faster than \(2^n\) (Q2684482) (← links)
- Largest Chordal and Interval Subgraphs Faster Than 2 n (Q2849310) (← links)
- (Q2913032) (← links)
- Subexponential Parameterized Algorithm for I <scp>nterval</scp> C <scp>ompletion</scp> (Q4554363) (← links)
- Subexponential parameterized algorithm for Interval Completion (Q4575658) (← links)
- Lower bounds for the parameterized complexity of Minimum Fill-In and other completion problems (Q4575659) (← links)
- (Q4636433) (← links)
- A New Algorithm for Parameterized MAX-SAT (Q4899239) (← links)
- Hardness of Approximation for <i>H</i> -free Edge Modification Problems (Q4973877) (← links)
- Solving Target Set Selection with Bounded Thresholds Faster than 2^n (Q5009485) (← links)
- Parameterized Algorithms for Partitioning Graphs into Highly Connected Clusters (Q5111220) (← links)
- A Subexponential Parameterized Algorithm for Proper Interval Completion (Q5891808) (← links)
- A Subexponential Parameterized Algorithm for Proper Interval Completion (Q5899484) (← links)
- Lower bounds for the happy coloring problems (Q5918935) (← links)
- Fair division with minimal withheld information in social networks (Q6122612) (← links)
- Hardness of approximation for \(H\)-free edge modification problems: towards a dichotomy (Q6602441) (← links)
- Tight double exponential lower bounds (Q6636075) (← links)
- MaxCut above guarantee (Q6647649) (← links)
