4 papers
Exploring Monotone Priority Queues for Dijkstra Optimization
Jonas Costa, Lucas Castro, Rosiane de Freitas
This paper presents a comprehensive overview of monotone priority queues, focusing on their evolution and application in shortest path algorithms. Monotone priority queues are char…
ESBMC-Jimple: Verifying Kotlin Programs via Jimple Intermediate Representation
Rafael Menezes, Daniel Moura, Helena Cavalcante +2
In this work, we describe and evaluate the first model checker for verifying Kotlin programs through the Jimple intermediate representation. The verifier, named ESBMC-Jimple, is bu…
Empirical Evaluation of Project Scheduling Algorithms for Maximization of the Net Present Value
Isac M. Lacerda, Eber A. Schmitz, Jayme L. Szwarcfiter +1
This paper presents an empirical performance analysis of three project scheduling algorithms dealing with maximizing projects' net present value with unrestricted resources. The se…
Choosability in bounded sequential list coloring
Simone Gama, Rosiane de Freitas, Mário Salvatierra
The list coloring problem is a variation of the classical vertex coloring problem, extensively studied in recent years, where each vertex has a restricted list of allowed colors, a…