Submodular Functions and Valued Constraint Satisfaction Problems over Infinite Domains. - Manuel Bodirsky; Marcello Mamino; Caterina Viola (CSL, 2018)

Piecewise Linear Valued Constraint Satisfaction Problems with Fixed Number of Variables. - Manuel Bodirsky; Marcello Mamino; Caterina Viola (CoRR, 2020)

Valued Constraint Satisfaction Problems over Infinite Domains - Caterina Viola (2020)

The Combined Basic LP and Affine IP Relaxation for Promise VCSPs on Infinite Domains. - Caterina Viola; Stanislav Zivný (ACM Trans. Algorithms, 2021)

An Application of Farkas' Lemma to Finite-Valued Constraint Satisfaction Problems over Infinite Domains. - Friedrich Martin Schneider; Caterina Viola (CoRR, 2022)

Piecewise Linear Valued CSPs Solvable by Linear Programming Relaxation. - Manuel Bodirsky; Marcello Mamino; Caterina Viola (ACM Trans. Comput. Log., 2022)

Quantum Circuits for Fixed Substring Matching Problems. - Domenico Cantone; Simone Faro; Arianna Pavone; Caterina Viola (CoRR, 2023)

Longest Common Substring and Longest Palindromic Substring in Õ(√n) Time. - Domenico Cantone; Simone Faro; Arianna Pavone; Caterina Viola (CoRR, 2023)

Quantum Circuit Based Longest Common Substring. - Domenico Cantone; Simone Faro; Arianna Pavone; Caterina Viola (ICTCS, 2024)

Families of Constant-Depth Quantum Circuits for Rotations and Permutations. - Simone Faro; Arianna Pavone; Caterina Viola (ICTCS, 2024)

Algebraic Approach to Approximation. - Libor Barto; Silvia Butti; Alexandr Kazda; Caterina Viola; Stanislav Zivný (LICS, 2024)

Quantum Circuits for Fixed Matching Substring Problems. - Domenico Cantone; Simone Faro; Arianna Pavone; Caterina Viola (SAI (3), 2024)

A Quantum Circuit for the Cyclic String Matching Problem. - Arianna Pavone; Caterina Viola (PSC, 2024)

Quantum Path Parallelism: A Circuit-Based Approach to Text Searching. - Simone Faro; Arianna Pavone; Caterina Viola (TAMC, 2024)

The Quantum Cyclic Rotation Gate. - Arianna Pavone; Caterina Viola (SN Comput. Sci., 2024)

Bridging Classical and Quantum String Matching: A Computational Reformulation of Bit-Parallelism. - Simone Faro; Arianna Pavone; Caterina Viola (CoRR, 2025)