Allen Ibiapina

According to our database, Allen Ibiapina authored at least 10 papers between 2019 and 2025.

Collaborative distances:

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

2025

On the Complexity of Computing a Fastest Temporal Path in Interval Temporal Graphs.

Guillaume Aubian, Filippo Brunelli, Feodor F. Dragan, Guillaume Ducoffe, Michel Habib, Allen Ibiapina, Laurent Viennot

CoRR, January, 2025

2024

Mengerian graphs: Characterization and recognition.

Allen Ibiapina, Ana Silva

J. Comput. Syst. Sci., February, 2024

Snapshot disjointness in temporal graphs.

Allen Ibiapina, Ana Silva

Theor. Comput. Sci., 2024

2022

On the Nash number and the diminishing Grundy number of a graph.

Frédéric Havet, Allen Ibiapina, Leonardo S. Rocha

Discret. Appl. Math., 2022

Menger's Theorem for Temporal Paths (Not Walks).

Allen Ibiapina, Raul Lopes, Andrea Marino, Ana Silva

CoRR, 2022

2021

Coloring Problems on Bipartite Graphs of Small Diameter.

Victor A. Campos, Guilherme de C. M. Gomes, Allen Ibiapina, Raul Lopes, Ignasi Sau, Ana Silva

Electron. J. Comb., 2021

Mengerian Temporal Graphs Revisited.

Allen Ibiapina, Ana Silva

Proceedings of the Fundamentals of Computation Theory - 23rd International Symposium, 2021

2020

b-continuity and partial Grundy coloring of graphs with large girth.

Allen Ibiapina, Ana Silva

Discret. Math., 2020

2019

Graphs with Girth at Least 8 are b-continuous.

Allen Ibiapina, Ana Silva

Proceedings of the tenth Latin and American Algorithms, Graphs and Optimization Symposium, 2019

On Orthogonal Vector Edge Coloring.

Ana Silva, Allen Ibiapina

CoRR, 2019