| Publication | Date of Publication | Type |
|---|
| Budgeted out-tree maximization with submodular prizes | 2024-09-11 | Paper |
| Single-source shortest \(p\)-disjoint paths: fast computation and sparse preservers | 2024-04-23 | Paper |
| Building international doctoral schools in computer science in Italy, De Nicola's way | 2024-02-23 | Paper |
| Blackout-tolerant temporal spanners | 2024-01-22 | Paper |
| On the maximum connectivity improvement problem | 2023-10-20 | Paper |
| Blackout-tolerant temporal spanners | 2023-08-04 | Paper |
| Better bounds on the adaptivity gap of influence maximization under full-adoption feedback | 2023-06-27 | Paper |
| Unveiling the truth in liquid democracy with misinformed voters | 2023-03-31 | Paper |
| The multi-budget maximum weighted coverage problem | 2023-03-22 | Paper |
| Exploiting social influence to control elections based on positional scoring rules | 2022-12-08 | Paper |
| Multi-winner Election Control via Social Influence | 2022-09-01 | Paper |
| Election control through social influence with voters' uncertainty | 2022-08-26 | Paper |
| Fairness in Influence Maximization through Randomization | 2022-05-16 | Paper |
| Generalized budgeted submodular set function maximization | 2021-11-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5005131 | 2021-08-04 | Paper |
| Algorithms for hierarchical and semi-partitioned parallel scheduling | 2021-06-30 | Paper |
| Election control through social influence with unknown preferences | 2021-04-21 | Paper |
| Group-Harmonic and Group-Closeness Maximization – Approximation and Engineering | 2021-01-27 | Paper |
| On the fixed-parameter tractability of the maximum connectivity improvement problem | 2020-08-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5111292 | 2020-05-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5240129 | 2019-10-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4967220 | 2019-07-03 | Paper |
| Fully Dynamic 2-Hop Cover Labeling | 2019-03-27 | Paper |
| Recommending links through influence maximization | 2019-03-13 | Paper |
| Improving the Betweenness Centrality of a Node by Adding Links | 2018-11-20 | Paper |
| Approximation bounds for the minimum \(k\)-storage problem | 2018-10-17 | Paper |
| What can be verified locally? | 2018-09-07 | Paper |
| Fully dynamic update of arc-flags | 2018-05-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4636605 | 2018-04-19 | Paper |
| Engineering graph-based models for dynamic timetable information systems | 2017-11-09 | Paper |
| Recoverable Robust Timetables: An Algorithmic Approach on Trees | 2017-07-27 | Paper |
| Scheduling Real-Time Mixed-Criticality Jobs | 2017-07-12 | Paper |
| Flow Problems in Multi-Interface Networks | 2017-06-20 | Paper |
| A unified approach for gathering and exclusive searching on rings under weak assumptions | 2017-03-29 | Paper |
| Gathering Asynchronous and Oblivious Robots on Basic Graph Topologies Under the Look-Compute-Move Model | 2017-02-20 | Paper |
| Distance Queries in Large-Scale Fully Dynamic Complex Networks | 2016-09-29 | Paper |
| On the maximum betweenness improvement problem | 2016-08-05 | Paper |
| Preemptive Uniprocessor Scheduling of Mixed-Criticality Sporadic Task Systems | 2016-03-24 | Paper |
| Enhancing the computation of distributed shortest paths on power-law networks in dynamic scenarios | 2016-01-28 | Paper |
| Gathering of robots on anonymous grids and trees without multiplicity detection | 2015-12-10 | Paper |
| Computing on rings by oblivious robots: a unified approach for different tasks | 2015-09-02 | Paper |
| The minimum \(k\)-storage problem on directed graphs | 2015-07-24 | Paper |
| Finding disjoint paths in networks with star shared risk link groups | 2015-05-18 | Paper |
| Gathering on rings under the look-compute-move model | 2015-02-23 | Paper |
| Gathering six oblivious robots on anonymous symmetric rings | 2014-04-28 | Paper |
| A loop-free shortest-path routing algorithm for dynamic networks | 2013-12-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2867368 | 2013-12-11 | Paper |
| Engineering a new algorithm for distributed shortest paths on dynamic networks | 2013-05-16 | Paper |
| Enhancing the Computation of Distributed Shortest Paths on Real Dynamic Networks | 2013-04-19 | Paper |
| How to Gather Asynchronous Oblivious Robots on Anonymous Rings | 2013-03-13 | Paper |
| The Shortcut Problem - Complexity and Algorithms | 2012-12-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2917325 | 2012-09-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2917368 | 2012-09-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2917373 | 2012-09-28 | Paper |
| Minimize the maximum duty in multi-interface networks | 2012-04-26 | Paper |
| Mixed-Criticality Scheduling of Sporadic Task Systems | 2011-09-16 | Paper |
| Min-Max Coverage in Multi-interface Networks | 2011-02-15 | Paper |
| Bandwidth Constrained Multi-interface Networks | 2011-02-15 | Paper |
| Minimizing the Maximum Duty for Connectivity in Multi-Interface Networks | 2011-01-10 | Paper |
| Scheduling Real-Time Mixed-Criticality Jobs | 2010-09-03 | Paper |
| Partially dynamic efficient algorithms for distributed shortest paths | 2010-03-09 | Paper |
| Evaluation of Recoverable-Robust Timetables on Tree Networks | 2009-12-11 | Paper |
| Recoverable Robustness in Shunting and Timetabling | 2009-12-03 | Paper |
| Recoverable robust timetabling for single delay: Complexity and polynomial algorithms for special cases | 2009-12-02 | Paper |
| Recoverable Robust Timetables on Trees | 2009-07-07 | Paper |
| The Shortcut Problem – Complexity and Approximation | 2009-02-03 | Paper |
| Delay Management Problem: Complexity Results and Robust Algorithms | 2009-01-27 | Paper |
| Dynamic multi-level overlay graphs for shortest paths | 2008-09-08 | Paper |
