No abstract

In this paper we give a structural characterization and extend the tractability frontier of the Simple Temporal Problem (STP) by defining the class of the Extended Simple Temporal Problem (ESTP), which augments STP with strict inequalities and monotone Boolean formulae on inequations (i.e., formulae involving the operations of conjunction, disjunction and parenthesization). A polynomial-time algorithm is provided to solve ESTP, faster than previous state-of-the-art algorithms for other extensions of STP that had been considered in the literature, all encompassed by ESTP. We show the practical competitiveness of our approach through a proof-of-concept implementation and an experimental evaluation involving also state-of-the-art SMT solvers.

No abstract

The COVID-19 pandemic is having a pervasive effect worldwide, including local, national and international Olympiads in Informatics. Most national Olympiads had to be moved online, a process which poses a number of serious challenges. Help across countries is of uttermost importance in this context, to enable a successful continuation of the IOI during globally hard times. In this paper, we share the experience gained and tools produced during a year of online Olympiads in Italy, hoping that other countries can take profit of these (freely available) tools and suggestions for their own Olympiads.

No abstract