The SCEAS System
| |||||||

## Search the dblp DataBase
Igor Razgon:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- 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] - Igor Razgon, Amnon Meisels
**Maintaining Dominance Consistency.**[Citation Graph (0, 0)][DBLP] CP, 2003, pp:945-949 [Conf] - Igor Razgon
**Complexity Analysis of Heuristic CSP Search Algorithms.**[Citation Graph (0, 0)][DBLP] CSCLP, 2005, pp:88-99 [Conf] - Igor Razgon, Amnon Meisels
**Pruning by Equally Constrained Variables.**[Citation Graph (0, 0)][DBLP] CSCLP, 2004, pp:26-40 [Conf] - Igor Razgon, Amnon Meisels
**A CSP Search Algorithm with Reduced Branching Factor.**[Citation Graph (0, 0)][DBLP] CSCLP, 2005, pp:59-72 [Conf] - Igor Razgon, Amnon Meisels
**CSP Search with Responsibility Sets and Kernels.**[Citation Graph (0, 0)][DBLP] IJCAI, 2005, pp:1533-1534 [Conf] - Igor Razgon
**Exact Computation of Maximum Induced Forest.**[Citation Graph (0, 0)][DBLP] SWAT, 2006, pp:160-171 [Conf] - 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] - Igor Razgon, Barry O'Sullivan
**Efficient Recognition of Acyclic Clustered Constraint Satisfaction Problems.**[Citation Graph (0, 0)][DBLP] CSCLP, 2006, pp:154-168 [Conf] - 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] - 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] - Igor Razgon
**A 2**[Citation Graph (0, 0)][DBLP]^{O(k)}poly(n) algorithm for the parameterized Convex Recoloring problem. Inf. Process. Lett., 2007, v:104, n:2, pp:53-58 [Journal] **Minimum Leaf Out-Branching Problems.**[Citation Graph (, )][DBLP]**A Soft Constraint of Equality: Complexity and Approximability.**[Citation Graph (, )][DBLP]**Constraints of Difference and Equality: A Complete Taxonomic Characterisation.**[Citation Graph (, )][DBLP]**Generalizing Global Constraints Based on Network Flows.**[Citation Graph (, )][DBLP]**Directed Feedback Vertex Set is Fixed-Parameter Tractable.**[Citation Graph (, )][DBLP]**Constant Ratio Fixed-Parameter Approximation of the Edge Multicut Problem.**[Citation Graph (, )][DBLP]**Almost 2-SAT Is Fixed-Parameter Tractable (Extended Abstract).**[Citation Graph (, )][DBLP]**Computing Minimum Directed Feedback Vertex Set in O(1.9977**[Citation Graph (, )][DBLP]^{n}).**Fixed-Parameter Algorithms in Analysis of Heuristics for Extracting Networks in Linear Programs.**[Citation Graph (, )][DBLP]**Solving SAT for CNF Formulas with a One-Sided Restriction on Variable Occurrences.**[Citation Graph (, )][DBLP]**Treewidth Reduction for Constrained Separation and Bipartization Problems.**[Citation Graph (, )][DBLP]**A fixed-parameter algorithm for the directed feedback vertex set problem.**[Citation Graph (, )][DBLP]**On the Minimum Feedback Vertex Set Problem: Exact and Enumeration Algorithms.**[Citation Graph (, )][DBLP]**Almost 2-SAT is Fixed-Parameter Tractable**[Citation Graph (, )][DBLP]**Minimum Leaf Out-Branching Problems**[Citation Graph (, )][DBLP]**Treewidth reduction for constrained separation and bipartization problems**[Citation Graph (, )][DBLP]**FPT Algorithms in Analysis of Heuristics for Extracting Networks in Linear Programs**[Citation Graph (, )][DBLP]
Search in 0.002secs, Finished in 0.004secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |