Parameterized complexity/multivariate complexity algorithmics is an exciting field of modern
algorithm design and analysis, with a broad range of theoretical and practical aspects that …

The recently introduced series of description logics under the common monikerDL-Lite'has
attracted attention of the description logic and semantic web communities due to the low …

Interactive proofs (IPs) and arguments are cryptographic protocols that enable an untrusted
prover to provide a guarantee that it performed a requested computation correctly …

Ontologies provide a conceptualization of a domain of interest. Nowadays, they are typically
represented in terms of Description Logics (DLs), and are seen as the key technology used …

We show fully polynomial time randomized approximation schemes (FPRAS) for counting
matchings of a given size, or more generally sampling/counting monomer-dimer systems in …

The first-order theory of the integers with addition and order, commonly known as
Presburger arithmetic, has been a central topic in mathematical logic and computer science …

We develop a graph-theoretic characterization of controllability and observability of linear
systems over finite fields. Specifically, we show that a linear system will be structurally …

We develop a formal framework for comparing different versions of ontologies, and apply it
to ontologies formulated in terms of DL-Lite, a family of 'lightweight'description logics …

Nonlinear Discrete Optimization Page 1 Shmuel Onn Technion – Israel Institute of Technology
http://ie.technion.ac.il/~onn Nonlinear Discrete Optimization Based on several papers joint with …

The topic of exact, exponential-time algorithms for NP-hard problems has received a lot of
attention, particularly with the focus of producing algorithms with stronger theoretical …