On finite rank perturbations of selfadjoint operators in Krein spaces and eigenvalues in spectral gaps. - In: Complex analysis and operator theory, ISSN 1661-8262, Bd. 8 (2014), 4, S. 925-936
https://doi.org/10.1007/s11785-013-0318-2
An upper bound on the sum of powers of the degrees of simple 1-planar graphs. - In: Discrete applied mathematics, ISSN 1872-6771, Bd. 165 (2014), S. 146-151
https://doi.org/10.1016/j.dam.2012.11.001
Global and local behavior of zeros of nonpositive type. - In: Journal of mathematical analysis and applications, ISSN 1096-0813, Bd. 414 (2014), 1, S. 273-284
https://doi.org/10.1016/j.jmaa.2014.01.004
GPU and CPU acceleration of a class of kinetic lattice group models. - In: Computers and mathematics with applications, ISSN 1873-7668, Bd. 67 (2014), 2, S. 452-461
http://dx.doi.org/10.1016/j.camwa.2013.07.002
Discrete kinetic models in the fluid dynamic limit. - In: Computers and mathematics with applications, ISSN 1873-7668, Bd. 67 (2014), 2, S. 256-271
http://dx.doi.org/10.1016/j.camwa.2013.07.005
The average degree of minimally contraction-critically 5-connected graphs. - In: Journal of graph theory, ISSN 1097-0118, Bd. 75 (2014), 4, S. 331-354
https://doi.org/10.1002/jgt.21741
Stability and performance guarantees for model predictive control algorithms without terminal constraints. - In: ZAMM, ISSN 1521-4001, Bd. 94 (2014), 4, S. 317-330
http://dx.doi.org/10.1002/zamm.201100133
Construction of codimension one homoclinic cycles. - In: Dynamical systems, ISSN 1468-9375, Bd. 29 (2014), 1, S. 133-151
http://dx.doi.org/10.1080/14689367.2013.860085
Distributed and networked model predictive control. - In: Control theory of digitally networked dynamic systems, (2014), S. 111-167
A k-server problem with parallel requests and unit distances. - In: Information processing letters, ISSN 1872-6119, Bd. 114 (2014), 5, S. 239-246
In this paper we consider k-server problems with parallel requests where several servers can also be located on one point. We will distinguish the surplus-situation where the request can be completely fulfilled by means of the k servers and the scarcity-situation where the request cannot be completely met. We use the method of the potential function by Bartal and Grove in order to prove that a corresponding Harmonic algorithm is competitive for the more general k-server problem in the case of unit distances. For this purpose we partition the set of points in relation to the online and offline servers' positions and then use detailed considerations related to sets of certain partitions.
http://dx.doi.org/10.1016/j.ipl.2013.12.011