In this paper, we enumerate the number of combinatorial changes of the the Euclidean minimum spanning tree (EMST) of a set of n moving points in 2dimensional space. We assume that...
The crossing number of a graph is the least number of pairwise edge crossings in a drawing of the graph in the plane. We provide an O(n log n) time constant factor approximation al...
This work is inspired by a paper of Hertel and Pott on maximum non-linear functions [8]. Geometrically, these functions correspond with quasi-quadrics; objects introduced in [5]. ...
Bulk-arrival queues with single servers that provide bulk service are widespread in the real world, e.g., elevators in buildings, people-movers in amusement parks, air-cargo deliv...
Order Type Extension and New Results ectilinear Crossing Number - Extended Abstract Oswin Aichholzer∗ Hannes Krasser† We provide a complete data base of all realizable order t...