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
2010
Springer, Berlin, pp. 340-347.
Interest point and segmentation-based photo annotation
In: 24th Annual European Symposium on Algorithms (ESA 2016) Leibniz International Proceedings in Informatics (LIPIcs) (57) Schloss Dagstuhl Leibniz-Zentrum für Informatik, Dagstuhl, pp. 33:1-33:17. ISSN 1868-8969
Counting Matchings with k Unmatched Vertices in Planar Graphs
In: 41st International Symposium on Mathematical Foundations of Computer Science, MFCS 2016 Leibniz International Proceedings in Informatics (LIPIcs) (58) Schloss Dagstuhl Leibniz-Zentrum für Informatik, Dagstuhl, pp. 34:1-34:14. ISSN 1868-8969
A Single-Exponential Fixed-Parameter Algorithm for Distance-Hereditary Vertex Deletion
In: 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016) Leibniz International Proceedings in Informatics (LIPIcs) (55) Schloss Dagstuhl Leibniz-Zentrum für Informatik, Dagstuhl, pp. 28:1-28:15. ISSN 1868-8969
Double-Exponential and Triple-Exponential Bounds for Choosability Problems Parameterized by Treewidth.