Society has reached a point of no return, one that leaves us completely reliant on omnipresent ICT-mediated communication. Mobile and sensor-rich portable devices connect millions of humans with Petabytes of data and numerous on-line services. However, tearing down the physical-digital barrier in a scalable fashion requires both radically novel algorithmic knowledge and in-depth understanding of humans and societies. We will deliver major theoretical advances in real-time intelligent information management of large datasets including online social networks, mobile devices and humans in physical space by delivering three functions: “alert”, by real-time location-aware knowledge acquisition, analysis and visualization; “response”, through on-demand composition and coordination of large teams; and effective “communication”, through recommendation and personalization.
Publication date
2013
ERCIM NEWS (95)., pp. 44-45. ISSN 0926-4981
Using the BonFIRE Testbed for Testing Scalability of the KOPI Service
In: 33rd International Symposium on Computational Geometry, SoCG 2017 Leibniz International Proceedings in Informatics, LIPIcs (77) Schloss Dagstuhl Leibniz-Zentrum für Informatik, Dagstuhl, pp. 18:1-18:16. ISSN 1868-8969
Fine-grained complexity of coloring unit disks and balls
In: 34th Symposium on Theoretical Aspects of Computer Science (STACS 2017) Leibniz International Proceedings in Informatics, LIPIcs (66) Schloss Dagstuhl Leibniz-Zentrum für Informatik, Dagstuhl, pp. 22:1-22:14. ISSN 1868-8969
Parameterized and approximation results for scheduling with a low rank processing time matrix
In: Algorithms – ESA 2013 21st Annual European Symposium, Sophia Antipolis, France, September 2-4, 2013. Proceedings Lecture Notes in Computer Science (8125) Springer-Verlag Wien, Berlin, pp. 313-324.
In: 11th International Symposium on Parameterized and Exact Computation, IPEC 2016 Leibniz International Proceedings in Informatics, LIPIcs (63) Schloss Dagstuhl Leibniz-Zentrum für Informatik, Dagstuhl, pp. 3:1-3:12. ISSN 1868-8969
H-free graphs, Independent Sets, and subexponential-time algorithms