Search the dblp DataBase

Publications of Author

1. Igor Razgon
   A Faster Solving of the Maximum Independent Set Problem for Graphs with Maximal Degree 3. [Citation Graph (0, 0)][DBLP]
   ACiD, 2006, pp:131-142 [Conf]
   
2. Igor Razgon, Amnon Meisels
   Maintaining Dominance Consistency. [Citation Graph (0, 0)][DBLP]
   CP, 2003, pp:945-949 [Conf]
   
3. Igor Razgon
   Complexity Analysis of Heuristic CSP Search Algorithms. [Citation Graph (0, 0)][DBLP]
   CSCLP, 2005, pp:88-99 [Conf]
   
4. Igor Razgon, Amnon Meisels
   Pruning by Equally Constrained Variables. [Citation Graph (0, 0)][DBLP]
   CSCLP, 2004, pp:26-40 [Conf]
   
5. Igor Razgon, Amnon Meisels
   A CSP Search Algorithm with Reduced Branching Factor. [Citation Graph (0, 0)][DBLP]
   CSCLP, 2005, pp:59-72 [Conf]
   
6. Igor Razgon, Amnon Meisels
   CSP Search with Responsibility Sets and Kernels. [Citation Graph (0, 0)][DBLP]
   IJCAI, 2005, pp:1533-1534 [Conf]
   
7. Igor Razgon
   Exact Computation of Maximum Induced Forest. [Citation Graph (0, 0)][DBLP]
   SWAT, 2006, pp:160-171 [Conf]
   
8. Benny Chor, Michael R. Fellows, Mark A. Ragan, Igor Razgon, Frances A. Rosamond, Sagi Snir
   Connected Coloring Completion for General Graphs: Algorithms and Complexity. [Citation Graph (0, 0)][DBLP]
   COCOON, 2007, pp:75-85 [Conf]
   
9. Igor Razgon, Barry O'Sullivan
   Efficient Recognition of Acyclic Clustered Constraint Satisfaction Problems. [Citation Graph (0, 0)][DBLP]
   CSCLP, 2006, pp:154-168 [Conf]
   
10. Igor Razgon, Amnon Meisels
    A CSP Search Algorithm with Responsibility Sets and Kernels. [Citation Graph (0, 0)][DBLP]
    Constraints, 2007, v:12, n:2, pp:151-177 [Journal]
    
11. Igor Razgon, Barry O'Sullivan
    Directed Feedback Vertex Set is Fixed-Parameter Tractable [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
    
12. Igor Razgon
    A 2^O(k)poly(n) algorithm for the parameterized Convex Recoloring problem. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2007, v:104, n:2, pp:53-58 [Journal]
    
13. 
    Minimum Leaf Out-Branching Problems. [Citation Graph (, )][DBLP]
    
    
14. 
    A Soft Constraint of Equality: Complexity and Approximability. [Citation Graph (, )][DBLP]
    
    
15. 
    Constraints of Difference and Equality: A Complete Taxonomic Characterisation. [Citation Graph (, )][DBLP]
    
    
16. 
    Generalizing Global Constraints Based on Network Flows. [Citation Graph (, )][DBLP]
    
    
17. 
    Directed Feedback Vertex Set is Fixed-Parameter Tractable. [Citation Graph (, )][DBLP]
    
    
18. 
    Constant Ratio Fixed-Parameter Approximation of the Edge Multicut Problem. [Citation Graph (, )][DBLP]
    
    
19. 
    Almost 2-SAT Is Fixed-Parameter Tractable (Extended Abstract). [Citation Graph (, )][DBLP]
    
    
20. 
    Computing Minimum Directed Feedback Vertex Set in O(1.9977ⁿ). [Citation Graph (, )][DBLP]
    
    
21. 
    Fixed-Parameter Algorithms in Analysis of Heuristics for Extracting Networks in Linear Programs. [Citation Graph (, )][DBLP]
    
    
22. 
    Solving SAT for CNF Formulas with a One-Sided Restriction on Variable Occurrences. [Citation Graph (, )][DBLP]
    
    
23. 
    Treewidth Reduction for Constrained Separation and Bipartization Problems. [Citation Graph (, )][DBLP]
    
    
24. 
    A fixed-parameter algorithm for the directed feedback vertex set problem. [Citation Graph (, )][DBLP]
    
    
25. 
    On the Minimum Feedback Vertex Set Problem: Exact and Enumeration Algorithms. [Citation Graph (, )][DBLP]
    
    
26. 
    Almost 2-SAT is Fixed-Parameter Tractable [Citation Graph (, )][DBLP]
    
    
27. 
    Minimum Leaf Out-Branching Problems [Citation Graph (, )][DBLP]
    
    
28. 
    Treewidth reduction for constrained separation and bipartization problems [Citation Graph (, )][DBLP]
    
    
29. 
    FPT Algorithms in Analysis of Heuristics for Extracting Networks in Linear Programs [Citation Graph (, )][DBLP]