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
2015
NEW JOURNAL OF PHYSICS, 17, pp. 83052. ISSN 1367-2630
Exact sampling of graphs with prescribed degree correlations
In: Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (8845) Society for Industrial and Applied Mathematics (SIAM), Philadelphia, pp. 616-629.
Characterizing the easy-to-find subgraphs from the viewpoint of polynomial-time algorithms, kernels, and Turing kernels
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: Algorithms - ESA 2015. 23rd Annual European Symposium, Patras, Greece, September 14-16, 2015, Proceedings Lecture Notes in Computer Science (9294) Springer, Berlin, pp. 865-877.
Optimal Parameterized Algorithms for Planar Facility Location Problems Using Voronoi Diagrams
In: 2017 Workshops of the International Conference on Extending Database Technology and the International Conference on Database Theory, EDBT/ICDT 2017 CEUR Workshop Proceedings (1810) CEUR-WS.org, Aachen, pp. 1-1. ISSN 1613-0073
STREAMLINE - Streamlined analysis of data at rest and data in motion
In: Poceedings of the 2017 IEEE International Conference on Computer Communications (IEEE INFOCOM) IEEE Communications Society, Piscataway (NJ), pp. 1-9.
List of Shared Risk Link Groups Representing Regional Failures with Limited Size