A major open question in communication complexity is if randomized and quantum communication are polynomially related for all total functions. So far, no gap larger than a power o...
We consider the problem of finding an unknown graph by using two types of queries with an additive property. Given a graph, an additive query asks the number of edges in a set of ...
Given a graph with a source and a sink node, the NP–hard maximum k–splittable flow (MkSF) problem is to find a flow of maximum value with a flow decomposition using at most...
Data exchange is the problem of transforming data structured under a schema (called source) into data structured under a different schema (called target). The emphasis of data exc...
Abstract. We extend the setting of Satisfiability Modulo Theories (SMT) by introducing a theory of costs C, where it is possible to model and reason about resource consumption and ...