Searching for authors named "Igor Razgon" – sorted by Relevance.
10 documents found, showing 1 through 10.
-
Nogood Learning for Classical Planning
- …Nogood Learning for Classical Planning Work in progress report Igor Razgon Computer Science…
- Add To MetaCart
-
Directed Feedback Vertex Set is Fixed-Parameter Tractable
- …Directed Feedback Vertex Set is Fixed-Parameter Tractable Igor Razgon, Barry O’Sullivan Computer…
- Cited by 1 (1 self) – Add To MetaCart
-
Almost 2-sat is fixed-parameter tractable. To appear in
- …arXiv:0801.1300v3 [cs.DS] 18 Feb 2008 Almost 2-SAT is Fixed-Parameter Tractable Igor Razgon…
- Cited by 2 (0 self) – Add To MetaCart
-
CSP Search Algorithms with Responsibility Sets and Kernels ∗
- …CSP Search Algorithms with Responsibility Sets and Kernels ∗ Igor Razgon and Amnon Meisels…
- Add To MetaCart
-
Distributed forward-checking with conflict-based backjumping and dynamic ordering
- … Meisels and Igor Razgon Department of Computer Science Ben-Gurion University of the Negev Beer-Sheva, 84…
- Add To MetaCart
-
Distributed Forward Checking with Dynamic Ordering
- …Distributed Forward Checking with Dynamic Ordering Amnon Meisels and Igor Razgon Department…
- Cited by 9 (2 self) – Add To MetaCart
-
Comparing Performance of Distributed Constraints Processing Algorithms
- … Kaplansky, Igor Razgon and Roie Zivan Dept. of Computer Science Ben-Gurion University Beer-Sheva 84105…
- Cited by 40 (14 self) – Add To MetaCart
-
Minimum Leaf Out-branching and Related Problems ∗
- …Minimum Leaf Out-branching and Related Problems ∗ Gregory Gutin † Igor Razgon ‡ Eun Jung Kim…
- Add To MetaCart
-
Minimum Leaf Out-Branching Problems
- …Parameterized Minimum Leaf Out-Branching Problems Gregory Gutin 1 , Igor Razgon 2 , and Eun Jung…
- Cited by 2 (2 self) – Add To MetaCart
-
On the minimum feedback vertex set problem: Exact and enumeration algorithms ∗
- … †‡ Serge Gaspers †‡ Artem V. Pyatkin §‡ Igor Razgon ¶ November 26, 2007 Abstract We present a time O(1…
- Add To MetaCart
Showing 1 through 10.
