Author of the publication

Hardness and Algorithms for Rainbow Connectivity.

, , , and . STACS, volume 3 of LIPIcs, page 243-254. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany, (2009)

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 Matsliah, Arie
add a person with the name Matsliah, Arie
 

Other publications of authors with the same name

Approximate Hypergraph Partitioning and Applications., , and . SIAM J. Comput., 39 (7): 3155-3185 (2010)The non-adaptive query complexity of testing k-parities, , , and . CoRR, (2012)Nearly Tight Bounds for Testing Function Isomorphism., , and . Electronic Colloquium on Computational Complexity (ECCC), (2010)Perfect Hashing and CNF Encodings of Cardinality Constraints., , , and . SAT, volume 7317 of Lecture Notes in Computer Science, page 397-409. Springer, (2012)Monotonicity Testing and Shortest-Path Routing on the Cube., , , and . APPROX-RANDOM, volume 6302 of Lecture Notes in Computer Science, page 462-475. Springer, (2010)Detecting and exploiting near-sortedness for efficient relational query evaluation., , , , , and . ICDT, page 256-267. ACM, (2011)On the query complexity of testing orientations for being Eulerian., , , , and . ACM Trans. Algorithms, 8 (2): 15:1-15:41 (2012)Query Complexity Lower Bounds for Reconstruction of Codes., , and . Theory of Computing, (2014)Query Complexity Lower Bounds for Reconstruction of Codes., , and . Electronic Colloquium on Computational Complexity (ECCC), (2010)Using cross-entropy for satisfiability., , , , and . SAC, page 1196-1203. ACM, (2013)