Marcos M. Salvatierra

According to our database, Marcos M. Salvatierra authored at least 6 papers between 2021 and 2025.

Collaborative distances:

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

2025

An efficient alternative strategy for finding prices in envy-free perfect matchings.

Marcos M. Salvatierra, Juan Gabriel Colonna, Mario Salvatierra, Alcides de C. Amorim Neto

Acta Informatica, December, 2025

2024

On Complexity Classes of Envy-Free Pricing Problems: A Short Survey.

Marcos M. Salvatierra, Juan Gabriel Colonna, Mário Salvatierra Jr., Alcides de C. Amorim Neto

Oper. Res. Forum, December, 2024

2023

A note on solving the envy-free perfect matching problem with qualities of items.

Marcos M. Salvatierra

CoRR, 2023

A note on improving the search of optimal prices in envy-free perfect matchings.

Marcos M. Salvatierra, Juan Gabriel Colonna, Mário Salvatierra Jr., Alcides de C. Amorim Neto

CoRR, 2023

2021

Short Communication: Optimally Solving the Unit-Demand Envy-Free Pricing Problem with Metric Substitutability in Cubic Time.

Marcos M. Salvatierra, Mario Salvatierra, Juan Gabriel Colonna

Algorithms, 2021

Optimal scheduling of arborescences using the Gangal-Ranade algorithm.

Rosiane de Freitas, Elton Lever, Raquel Folz, Yuri Gagarin Soares, Fábio Pimentel, Marcos M. Salvatierra

Proceedings of the XLVII Latin American Computing Conference, 2021