The splitting power of branching programs of bounded repetition and CNFs of bounded width von Razgon, Igor

Volltext

Exact Computation of Maximum Induced Forest von Razgon, Igor

Volltext

On Oblivious Branching Programs with Bounded Repetition that Cannot Efficiently Compute CNFs of Bounded Treewidth von Razgon, Igor

Volltext

Fractional covers of hypergraphs with bounded multi-intersection von Gottlob, Georg, Lanzinger, Matthias, Pichler, Reinhard, Razgon, Igor

Volltext

Faster computation of maximum independent set and parameterized vertex cover for graphs with maximum degree 3 von Razgon, Igor

Volltext

Well-quasi-ordering versus clique-width von Lozin, Vadim, Razgon, Igor, Zamaraev, Viktor

Volltext

A CSP search algorithm with Responsibility sets and kernels von RAZGON, Igor, MEISELS, Amnon

Volltext

Complexity Analysis of Heuristic CSP Search Algorithms von Razgon, Igor

Volltext

No Small Nondeterministic Read-Once Branching Programs for CNFs of Bounded Treewidth von Razgon, Igor

Volltext

Minimum leaf out-branching and related problems von Gutin, Gregory, Razgon, Igor, Kim, Eun Jung

Volltext

Constant ratio FPT approximation of hypertree width parameters for hypergraphs of bounded rank von Razgon, Igor

Volltext

Well-quasi-ordering Does Not Imply Bounded Clique-width von Lozin, Vadim V., Razgon, Igor, Zamaraev, Viktor

Volltext

Soft Constraints of Difference and Equality von Hebrard, E., Marx, D., O'Sullivan, B., Razgon, I.

Volltext

The splitting power of branching programs of bounded repetition and CNFs of bounded width von Razgon, Igor

Volltext

Tree-width dichotomy von Lozin, Vadim, Razgon, Igor

Volltext bestellen

Partial matching width and its application to lower bounds for branching programs von Razgon, Igor

Volltext bestellen

Classification of OBDD size for monotone 2-CNFs von Razgon, Igor

Volltext

Regular resolution for CNFs with almost bounded one-sided treewidth von Cali, Andrea, Razgon, Igor

Volltext bestellen

A fixed-parameter algorithm for the directed feedback vertex set problem von Chen, Jianer, Liu, Yang, Lu, Songjian, O'sullivan, Barry, Razgon, Igor

Volltext

Linear Time Algorithm for Computing a Small Biclique in Graphs without Long Induced Paths von Atminas, Aistis, Lozin, Vadim V., Razgon, Igor

Volltext