In 2000 Alber et al. [SWAT 2000 ] obtained the first parameterized subexponential algorithm on undirected planar graphs by showing that k-DOMINATING SET is solvable in time 2O( ...
Frederic Dorn, Fedor V. Fomin, Daniel Lokshtanov, ...
Bidimensionality theory appears to be a powerful framework in the development of meta-algorithmic techniques. It was introduced by Demaine et al. [J. ACM 2005 ] as a tool to obtai...
Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, ...
We introduce four measures for the change of coalitions in social networks. The first one measures the change of the agents in the network over time, The second one measures the ...
Guido Boella, Leendert van der Torre, Serena Villa...
In this paper, the problem of deriving sensible information from a collection of argumentation systems coming from different agents is addressed. The underlying argumentation the...
In this paper the theory of evolution semigroups is developed and used to provide a framework to study the stability of general linear control systems. These include autonomous and...
Stephen Clark, Yuri Latushkin, Stephen Montgomery-...