Travelled to:1 × Austria
1 × Canada
1 × Finland
1 × Iceland
1 × USA
1 × United Kingdom
Collaborated with:B.O'Sullivan ∅ J.Petke D.Marx D.Johannsen M.Wahlström J.Chen Y.Liu S.Lu
Talks about:paramet (3) fix (3) tractabl (2) sat (2) cliquewidth (1) treewidth (1) parameter (1) algorithm (1) restrict (1) multicut (1)
Person: Igor Razgon
DBLP: Razgon:Igor
Contributed to:
2014
2013
20112009
20082008Wrote 6 papers:
- KR-2014-Razgon #bound #on the
- On OBDDs for CNFs of Bounded Treewidth (IR).
- SAT-2013-RazgonP #clique #compilation
- Cliquewidth and Knowledge Compilation (IR, JP), pp. 335–350.
- STOC-2011-MarxR #multi #parametricity
- Fixed-parameter tractability of multicut parameterized by the size of the cutset (DM, IR), pp. 469–478.
- SAT-2009-JohannsenRW #satisfiability #strict
- Solving SAT for CNF Formulas with a One-Sided Restriction on Variable Occurrences (DJ, IR, MW), pp. 80–85.
- ICALP-A-2008-RazgonO #parametricity #satisfiability
- Almost 2-SAT Is Fixed-Parameter Tractable (IR, BO), pp. 551–562.
- STOC-2008-ChenLL #algorithm #feedback #parametricity #problem #set
- A fixed-parameter algorithm for the directed feedback vertex set problem (JC, YL, SL, BO, IR), pp. 177–186.