Ralf Klasing

Distributed graph coloring: an approach based on the calling behavior of Japanese tree frogs

On the k-tuple domination of generalized de Brujin and Kautz digraphs

A secure control framework for resource-limited adversaries

Secure Estimation and Control for Cyber-Physical Systems Under Adversarial Attacks

Graph clustering

Context Aware Computing for The Internet of Things: A Survey

A control-theoretic approach to disseminating values and overcoming malicious links in wireless networks

ubiSOAP: A Service-Oriented Middleware for Ubiquitous Networking

A comprehensive review of firefly algorithms

Attack Detection and Identification in Cyber-Physical Systems

A survey of graph layout problems

Bipolar fuzzy graphs

Secure State Estimation and Control of Cyber-Physical Systems: A Survey

Distributed Function Calculation via Linear Iterative Strategies in the Presence of Malicious Agents

Cost minimization in wireless networks with a bounded and unbounded number of interfaces

Dissemination of Information in Communication Networks: Broadcasting, Gossiping, Leader Election, and Fault-Tolerance (Texts in Theoretical Computer Science. An EATCS Series)

On the complexity of distributed graph coloring with local minimality constraints

The relationship between the gossip complexity in vertex-disjoint paths mode and the vertex bisection width

Optimal Embedding of Complete Binary Trees into Lines and Grid

Hardness results and approximation algorithms of k-tuple domination in graphs