2009 |
24 | EE | Dániel Marx,
Barry O'Sullivan,
Igor Razgon:
Treewidth reduction for constrained separation and bipartization problems
CoRR abs/0902.3780: (2009) |
2008 |
23 | EE | Gregory Gutin,
Igor Razgon,
Eun Jung Kim:
Minimum Leaf Out-Branching Problems.
AAIM 2008: 235-246 |
22 | EE | Emmanuel Hebrard,
Barry O'Sullivan,
Igor Razgon:
A Soft Constraint of Equality: Complexity and Approximability.
CP 2008: 358-371 |
21 | EE | Igor Razgon,
Barry O'Sullivan:
Almost 2-SAT Is Fixed-Parameter Tractable (Extended Abstract).
ICALP (1) 2008: 551-562 |
20 | EE | Jianer Chen,
Yang Liu,
Songjian Lu,
Barry O'Sullivan,
Igor Razgon:
A fixed-parameter algorithm for the directed feedback vertex set problem.
STOC 2008: 177-186 |
19 | EE | Fedor V. Fomin,
Serge Gaspers,
Artem V. Pyatkin,
Igor Razgon:
On the Minimum Feedback Vertex Set Problem: Exact and Enumeration Algorithms.
Algorithmica 52(2): 293-307 (2008) |
18 | EE | Igor Razgon,
Barry O'Sullivan:
Almost 2-SAT is Fixed-Parameter Tractable
CoRR abs/0801.1300: (2008) |
17 | EE | Gregory Gutin,
Eun Jung Kim,
Igor Razgon:
Minimum Leaf Out-Branching Problems
CoRR abs/0801.1979: (2008) |
16 | EE | Jianer Chen,
Yang Liu,
Songjian Lu,
Barry O'Sullivan,
Igor Razgon:
A fixed-parameter algorithm for the directed feedback vertex set problem.
J. ACM 55(5): (2008) |
2007 |
15 | EE | Benny Chor,
Michael R. Fellows,
Mark A. Ragan,
Igor Razgon,
Frances A. Rosamond,
Sagi Snir:
Connected Coloring Completion for General Graphs: Algorithms and Complexity.
COCOON 2007: 75-85 |
14 | EE | Igor Razgon,
Barry O'Sullivan,
Gregory M. Provan:
Generalizing Global Constraints Based on Network Flows.
CSCLP 2007: 127-141 |
13 | | Igor Razgon:
Computing Minimum Directed Feedback Vertex Set in O(1.9977n).
ICTCS 2007: 70-81 |
12 | EE | Igor Razgon,
Barry O'Sullivan:
Directed Feedback Vertex Set is Fixed-Parameter Tractable.
Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs 2007 |
11 | EE | Igor Razgon,
Barry O'Sullivan:
Directed Feedback Vertex Set is Fixed-Parameter Tractable
CoRR abs/0707.0282: (2007) |
10 | EE | Igor Razgon,
Amnon Meisels:
A CSP Search Algorithm with Responsibility Sets and Kernels.
Constraints 12(2): 151-177 (2007) |
9 | EE | Igor Razgon:
A 2O(k)poly(n) algorithm for the parameterized Convex Recoloring problem.
Inf. Process. Lett. 104(2): 53-58 (2007) |
2006 |
8 | | Igor Razgon:
A Faster Solving of the Maximum Independent Set Problem for Graphs with Maximal Degree 3.
ACiD 2006: 131-142 |
7 | EE | Igor Razgon,
Barry O'Sullivan:
Efficient Recognition of Acyclic Clustered Constraint Satisfaction Problems.
CSCLP 2006: 154-168 |
6 | EE | Igor Razgon:
Exact Computation of Maximum Induced Forest.
SWAT 2006: 160-171 |
2005 |
5 | EE | Igor Razgon,
Amnon Meisels:
A CSP Search Algorithm with Reduced Branching Factor.
CSCLP 2005: 59-72 |
4 | EE | Igor Razgon:
Complexity Analysis of Heuristic CSP Search Algorithms.
CSCLP 2005: 88-99 |
3 | EE | Igor Razgon,
Amnon Meisels:
CSP Search with Responsibility Sets and Kernels.
IJCAI 2005: 1533-1534 |
2004 |
2 | EE | Igor Razgon,
Amnon Meisels:
Pruning by Equally Constrained Variables.
CSCLP 2004: 26-40 |
2003 |
1 | EE | Igor Razgon,
Amnon Meisels:
Maintaining Dominance Consistency.
CP 2003: 945-949 |