( en | de | ru )

 

Disambiguation of "Razgon, Igor"

Author of the publication

copydeleteadd this publication to your clipboard
Linear read-once and related Boolean functions.

, , , , and . Discret. Appl. Math., (2018)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Igor Barabash

Das Bildzitat im Internet. Uni München, (2009)

Igor Yakushev

Igor Pilawski

Igor Barsukov

Igor Pribicevic

 

Other publications of authors with the same name

A 2O(k)poly(n) algorithm for the parameterized Convex Recoloring problem.. Inf. Process. Lett., 104 (2): 53-58 (2007)Linear Time Algorithm for Computing a Small Biclique in Graphs without Long Induced Paths., , and . SWAT, volume 7357 of Lecture Notes in Computer Science, page 142-152. Springer, (2012)Tree-width dichotomy., and . CoRR, (2020)Complexity Analysis of Generalized and Fractional Hypertree Decompositions., , , and . J. ACM, 68 (5): 38:1-38:50 (2021)Linear read-once and related Boolean functions., , , , and . Discret. Appl. Math., (2018)Generalizing Global Constraints Based on Network Flows., , and . CSCLP, volume 5129 of Lecture Notes in Computer Science, page 127-141. Springer, (2007)On the Read-Once Property of Branching Programs and CNFs of Bounded Treewidth.. Algorithmica, 75 (2): 277-294 (2016)Partial matching width and its application to lower bounds for branching programs.. CoRR, (2017)Fixed-Parameter Algorithms in Analysis of Heuristics for Extracting Networks in Linear Programs., , and . IWPEC, volume 5917 of Lecture Notes in Computer Science, page 222-233. Springer, (2009)Connected Coloring Completion for General Graphs: Algorithms and Complexity., , , , , and . COCOON, volume 4598 of Lecture Notes in Computer Science, page 75-85. Springer, (2007)