Jonas Costa Ferreira da Silva

According to our database, Jonas Costa Ferreira da Silva authored at least 8 papers between 2020 and 2025.

Collaborative distances:

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

2025

Minimum cost flow decomposition on arc-coloured networks.

Claudio Carvalho Neto, Ana Karolinna Maia, Cláudia Linhares Sales, Jonas Costa Ferreira da Silva

CoRR, March, 2025

Exploring monotone priority queues for Dijkstra optimization.

Jonas Costa Ferreira da Silva, Lucas Castro, Rosiane de Freitas

RAIRO Oper. Res., 2025

2024

On b-greedy colourings and z-colourings.

Jonas Costa Ferreira da Silva, Frédéric Havet

Discret. Appl. Math., 2024

Exploring monotonic priority queues for Dijkstra optimization.

Jonas Costa Ferreira da Silva, Lucas Castro, Rosiane de Freitas

CoRR, 2024

2023

From branchings to flows: a study of an Edmonds' like property to arc-disjoint branching flows.

Cláudio Carvalho, Jonas Costa Ferreira da Silva, Raul Lopes, Ana Karolinna Maia, Nicolas Nisse, Cláudia Linhares Sales

Discret. Math. Theor. Comput. Sci., 2023

New Menger-Like Dualities in Digraphs and Applications to Half-Integral Linkages.

Victor A. Campos, Jonas Costa Ferreira da Silva, Raul Lopes, Ignasi Sau

Proceedings of the 31st Annual European Symposium on Algorithms, 2023

2021

On the inversion number of oriented graphs.

Jørgen Bang-Jensen, Jonas Costa Ferreira da Silva, Frédéric Havet

Discret. Math. Theor. Comput. Sci., 2021

2020

Inversion number of an oriented graph and related parameters.

Jørgen Bang-Jensen, Jonas Costa Ferreira da Silva, Frédéric Havet

Proceedings of the First International Conference "Algebras, graphs and ordered sets", 2020