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
2016
In: 33rd Symposium on Theoretical Aspects of Computer Science, STACS 2016 Leibniz International Proceedings in Informatics, LIPIcs (47) Schloss Dagstuhl Leibniz-Zentrum für Informatik, Dagstuhl, pp. 28:1-28:13. ISSN 1868-8969
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. 3:1-3:15. ISSN 1868-8969
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. 25:1-25:15. ISSN 1868-8969
Counting edge-injective homomorphisms and matchings on restricted graph classes
In: 25th International Joint Conference on Artificial Intelligence, IJCAI 2016 IJCAI International Joint Conference on Artificial Intelligence (2016-J) IJCAI, New York, pp. 109-115. ISSN 1045-0823
In: 33rd Symposium on Theoretical Aspects of Computer Science, STACS 2016 Leibniz International Proceedings in Informatics, LIPIcs (47) Schloss Dagstuhl Leibniz-Zentrum für Informatik, Dagstuhl, pp. 22:1-22:14. ISSN 1868-8969
Time-approximation trade-offs for inapproximable problems