Mario Salvatierra

According to our database, Mario Salvatierra authored at least 10 papers between 2013 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 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

2018

Choosability in bounded sequential list coloring.

Simone Gama, Rosiane de Freitas, Mário Salvatierra

CoRR, 2018

2017

Choosability in coloring problems of graphs with restricted color lists.

Simone Gama, Rosiane de Freitas, Mario Salvatierra

Proceedings of the 2017 XLIII Latin American Computer Conference, 2017

2015

An incremental technique for real-time bioacoustic signal segmentation.

Juan Gabriel Colonna, Marco Cristo, Mario Salvatierra, Eduardo Freire Nakamura

Expert Syst. Appl., 2015

Response time schedulability analysis for hard real-time systems accounting DVFS latency on heterogeneous cluster-based platform.

Eduardo Valentin, Mario Salvatierra, Rosiane de Freitas, Raimundo S. Barreto

Proceedings of the 25th International Workshop on Power and Timing Modeling, 2015

2013

Sphere intersection algorithms for Molecular Distance Geometry Problem.

Clarice Santos, Rosiane de Freitas, Mario Salvatierra

Proceedings of the 2013 XXXIX Latin American Computing Conference (CLEI), 2013

A Quasi-Newton optimization algorithm to solve Molecular Distance Geometry Problems.

Mario Salvatierra

Proceedings of the 2013 XXXIX Latin American Computing Conference (CLEI), 2013