Editorial Board
Editorʼs foreword
Computing optimal outcomes under an expressive representation of settings with externalities
Truthful randomized mechanisms for combinatorial auctions
View-based query answering in Description Logics: Semantics and complexity
Conjunctive query answering in the description logic SH using knots
Synonymous theories and knowledge representations in answer set programming
Markov network based ontology matching
An action-based approach to the formal specification and automatic analysis of business processes under authorization constraints
An improved two-party identity-based authenticated key agreement protocol using pairings
Every ternary permutation constraint satisfaction problem parameterized above average has a kernel with a quadratic number of variables
A three-string approach to the closest string problem
Editing graphs to satisfy degree constraints: A parameterized approach
Accurate and precise aggregation counting
The tractability frontier for NFA minimization
A 2k kernel for the cluster editing problem
Learning finite cover automata from queries
Scheduling malleable tasks with precedence constraints
Optimal sampling from sliding windows
A new efficient indexing algorithm for one-dimensional real scaled patterns
Improved approximation algorithms for Directed Steiner Forest
On restricted context-free grammars
A universally fastest algorithm for Max 2-Sat, Max 2-CSP, and everything in between
On bounded block decomposition problems for under-specified systems of equations
Generic local computation
Maintaining awareness using policies; Enabling agents to identify relevance of information
Contents
