We give an O(n log n) algorithm for computing the girth (shortest cycle) of an undirected n-vertex planar graph. Our solution extends to any graph of bounded genus. This improves u...
The Workshop on Organizing Workshops, Conferences, and Symposia for Computer Systems (WOWCS) was organized to "bring together conference organizers (past, present, and future...
We define a small-step operational semantics for the ECMAScript standard language corresponding to JavaScript, as a basis for analyzing security properties of web applications and ...
Abstract. Group communication is a programming abstraction that allows a distributed group of processes to provide a reliable service in spite of the possibility of failures within...
Abstract. The Berth Allocation Problem (BAP) consists on programming and allocating ships to berthing areas along a quay. The BAP is modeled as a vehicle routing problem and a rece...
Geraldo R. Mauri, Alexandre C. M. Oliveira, Luiz A...