Author of the publication

On the speed of constraint propagation and the time complexity of arc consistency testing

, and . CoRR, (2013)

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.

No persons found for author name Verbitsky, Oleg
add a person with the name Verbitsky, Oleg
 

Other publications of authors with the same name

The first order definability of graphs: Upper bounds for quantifier depth., , and . Discrete Applied Mathematics, 154 (17): 2511-2529 (2006)Descriptive complexity of finite structures: Saving the quantifier rank., and . J. Symb. Log., 70 (2): 419-450 (2005)On collinear sets in straight line drawings, and . CoRR, (2008)Fermat's Spiral and the Line Between Yin and Yang., , and . The American Mathematical Monthly, 117 (9): 786-800 (2010)Testing Graph Isomorphism in Parallel by Playing a Game., and . ICALP (1), volume 4051 of Lecture Notes in Computer Science, page 3-14. Springer, (2006)On the Speed of Constraint Propagation and the Time Complexity of Arc Consistency Testing., and . MFCS, volume 8087 of Lecture Notes in Computer Science, page 159-170. Springer, (2013)On Collinear Sets in Straight-Line Drawings., and . WG, volume 6986 of Lecture Notes in Computer Science, page 295-306. Springer, (2011)The Complexity of Drawing Graphs on Few Lines and Few Planes., , , , , and . WADS, volume 10389 of Lecture Notes in Computer Science, page 265-276. Springer, (2017)How complex are random graphs in first order logic?, , , and . Random Struct. Algorithms, 26 (1-2): 119-145 (2005)Interval Graphs: Canonical Representations in Logspace., , , and . SIAM J. Comput., 40 (5): 1292-1315 (2011)