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
2019
In: 35th International Symposium on Computational Geometry, SoCG 2019 Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, Dagstuhl, pp. 27:1-27:16.
Almost tight lower bounds for hard cutting problems in embedded graphs
In: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms Society for Industrial and Applied Mathematics, Philadelphia (PA), pp. 1711-1730.
Interval Vertex Deletion Admits a Polynomial Kernel
In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2018) Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, Dagstuhl, pp. 1:1-1:15.
Polylogarithmic approximation algorithms for weighted-F-Deletion problems
In: 25th Annual EurOMA Conference. To Serve, To Produce and to Servitize in the Era of Networks, Big Data and Analytics, 2018.06.24-2018.06.26, Budapest.
Real-time prediction of manufacturing lead times in complex production environments