Allen Ibiapina

Orcid: 0000-0002-6584-7718

According to our database1, Allen Ibiapina authored at least 16 papers between 2019 and 2026.

Collaborative distances:

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

On csauthors.net:

Bibliography

2026
Complexity Gaps Between Point and Interval Temporal Graphs for Some Reachability Problems.
Proceedings of the 5th Symposium on Algorithmic Foundations of Dynamic Networks, 2026

2025
Extension of the Gyárfás-Sumner conjecture to signed graphs.
CoRR, November, 2025

How to Color Temporal Graphs to Ensure Proper Transitions.
CoRR, May, 2025

Temporal Cycle Detection and Acyclic Temporization.
CoRR, March, 2025

On the Complexity of Computing a Fastest Temporal Path in Interval Temporal Graphs.
CoRR, January, 2025

Disjoint Temporal Walks Under Waiting Time Constraints.
Proceedings of the Algorithms and Complexity - 14th International Conference, 2025

Temporal Cycle Detection and Acyclic Temporalizations.
Proceedings of the Algorithmics of Wireless Networks - 21st International Symposium, 2025

2024
Mengerian graphs: Characterization and recognition.
J. Comput. Syst. Sci., February, 2024

2023
Snapshot Disjointness in Temporal Graphs.
Proceedings of the 2nd Symposium on Algorithmic Foundations of Dynamic Networks, 2023

2022
On the Nash number and the diminishing Grundy number of a graph.
Discret. Appl. Math., 2022

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

2021
Coloring Problems on Bipartite Graphs of Small Diameter.
Electron. J. Comb., 2021

Mengerian Temporal Graphs Revisited.
Proceedings of the Fundamentals of Computation Theory - 23rd International Symposium, 2021

2020
b-continuity and partial Grundy coloring of graphs with large girth.
Discret. Math., 2020

2019
Graphs with Girth at Least 8 are b-continuous.
Proceedings of the tenth Latin and American Algorithms, Graphs and Optimization Symposium, 2019

On Orthogonal Vector Edge Coloring.
CoRR, 2019


  Loading...