Virginia Ardévol Martínez

According to our database, Virginia Ardévol Martínez authored at least 8 papers between 2023 and 2025.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2025

Recognizing unit multiple interval graphs is hard.

Virginia Ardévol Martínez, Romeo Rizzi, Florian Sikora, Stéphane Vialette

Discret. Appl. Math., 2025

2024

Parity Permutation Pattern Matching.

Virginia Ardévol Martínez, Florian Sikora, Stéphane Vialette

Algorithmica, August, 2024

Structural and algorithmic aspects of (multiple) interval graphs. (Aspects algorithmiques et structurels des graphes d'intervalles (multiples)).

Virginia Ardévol Martínez

PhD thesis, 2024

Relaxed Agreement Forests.

Virginia Ardévol Martínez, Steven Chaplick, Steven Kelk, Ruben Meuwese, Matús Mihalák, Georgios Stamoulis

Proceedings of the SOFSEM 2024: Theory and Practice of Computer Science, 2024

Generalizing Roberts' Characterization of Unit Interval Graphs.

Virginia Ardévol Martínez, Romeo Rizzi, Abdallah Saffidine, Florian Sikora, Stéphane Vialette

Proceedings of the 49th International Symposium on Mathematical Foundations of Computer Science, 2024

2023

A lower bound for constant-size local certification.

Virginia Ardévol Martínez, Marco Caoduro, Laurent Feuilloley, Jonathan Narboni, Pegah Pournajafi, Jean-Florent Raymond

Theor. Comput. Sci., September, 2023

Hardness of Balanced Mobiles.

Virginia Ardévol Martínez, Romeo Rizzi, Florian Sikora

Proceedings of the Combinatorial Algorithms - 34th International Workshop, 2023

Recognizing Unit Multiple Intervals Is Hard.

Virginia Ardévol Martínez, Romeo Rizzi, Florian Sikora, Stéphane Vialette

Proceedings of the 34th International Symposium on Algorithms and Computation, 2023