In the minimum entropy set cover problem, one is given a collection of k sets which collectively cover an n-element ground set. A feasible solution of the problem is a partition o...
ISPs operate "abuse" teams to deal with reports of inappropriate email being sent by their customers. Currently, the majority of this work is dealing with insecure syste...
Complementing recent progress on classical complexity and polynomial-time approximability of feedback set problems in (bipartite) tournaments, we extend and partially improve fixed...
This article deals with an approach for managing scheduling in semiconductor manufacturing facilities. The proposed approach ensures consistency between global and local schedulin...
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...