| Publication | Date of Publication | Type |
|---|
| Sparse temporal spanners with low stretch | 2025-06-19 | Paper |
| Approximation algorithms for node-weighted directed Steiner problems | 2025-02-28 | Paper |
| 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
Models, Languages, and Tools for Concurrent and Distributed Programming | 2024-02-23 | Paper |
Blackout-tolerant temporal spanners
Journal of Computer and System Sciences | 2024-01-22 | Paper |
On the maximum connectivity improvement problem
Algorithms for Sensor Systems | 2023-10-20 | Paper |
Blackout-tolerant temporal spanners
Algorithmics of Wireless Networks | 2023-08-04 | Paper |
Better bounds on the adaptivity gap of influence maximization under full-adoption feedback
Artificial Intelligence | 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
Information and Computation | 2022-12-08 | Paper |
Multi-winner Election Control via Social Influence
Structural Information and Communication Complexity | 2022-09-01 | Paper |
Election control through social influence with voters' uncertainty
Journal of Combinatorial Optimization | 2022-08-26 | Paper |
Fairness in Influence Maximization through Randomization
Journal of Artificial Intelligence Research | 2022-05-16 | Paper |
Generalized budgeted submodular set function maximization
Information and Computation | 2021-11-25 | Paper |
Generalized budgeted submodular set function maximization
(available as arXiv preprint) | 2021-08-04 | Paper |
Algorithms for hierarchical and semi-partitioned parallel scheduling
Journal of Computer and System Sciences | 2021-06-30 | Paper |
Election control through social influence with unknown preferences
(available as arXiv preprint) | 2021-04-21 | Paper |
Group-Harmonic and Group-Closeness Maximization – Approximation and Engineering
2021 Proceedings of the Workshop on Algorithm Engineering and Experiments (ALENEX) | 2021-01-27 | Paper |
On the fixed-parameter tractability of the maximum connectivity improvement problem
Theory of Computing Systems | 2020-08-26 | Paper |
scientific article; zbMATH DE number 7204409 (Why is no real title available?)
(available as arXiv preprint) | 2020-05-26 | Paper |
| scientific article; zbMATH DE number 7121837 (Why is no real title available?) | 2019-10-24 | Paper |
| scientific article; zbMATH DE number 7075920 (Why is no real title available?) | 2019-07-03 | Paper |
Fully Dynamic 2-Hop Cover Labeling
ACM Journal of Experimental Algorithmics | 2019-03-27 | Paper |
Recommending links through influence maximization
Theoretical Computer Science | 2019-03-13 | Paper |
Improving the betweenness centrality of a node by adding links
ACM Journal of Experimental Algorithmics | 2018-11-20 | Paper |
| Approximation bounds for the minimum \(k\)-storage problem | 2018-10-17 | Paper |
What can be verified locally?
Journal of Computer and System Sciences | 2018-09-07 | Paper |
Fully dynamic update of arc-flags
Networks | 2018-05-23 | Paper |
| What can be verified locally? | 2018-04-19 | Paper |
Engineering graph-based models for dynamic timetable information systems
Journal of Discrete Algorithms | 2017-11-09 | Paper |
Recoverable Robust Timetables: An Algorithmic Approach on Trees
IEEE Transactions on Computers | 2017-07-27 | Paper |
Scheduling Real-Time Mixed-Criticality Jobs
IEEE Transactions on Computers | 2017-07-12 | Paper |
Flow Problems in Multi-Interface Networks
IEEE Transactions on Computers | 2017-06-20 | Paper |
A unified approach for gathering and exclusive searching on rings under weak assumptions
Distributed Computing | 2017-03-29 | Paper |
Gathering asynchronous and oblivious robots on basic graph topologies under the look-compute-move model
Search Theory | 2017-02-20 | Paper |
Distance Queries in Large-Scale Fully Dynamic Complex Networks
Lecture Notes in Computer Science | 2016-09-29 | Paper |
| On the maximum betweenness improvement problem | 2016-08-05 | Paper |
Preemptive uniprocessor scheduling of mixed-criticality sporadic task systems
Journal of the ACM | 2016-03-24 | Paper |
Enhancing the computation of distributed shortest paths on power-law networks in dynamic scenarios
Theory of Computing Systems | 2016-01-28 | Paper |
Gathering of robots on anonymous grids and trees without multiplicity detection
Theoretical Computer Science | 2015-12-10 | Paper |
Computing on rings by oblivious robots: a unified approach for different tasks
Algorithmica | 2015-09-02 | Paper |
The minimum \(k\)-storage problem on directed graphs
Theoretical Computer Science | 2015-07-24 | Paper |
Finding disjoint paths in networks with star shared risk link groups
Theoretical Computer Science | 2015-05-18 | Paper |
Gathering on rings under the look-compute-move model
Distributed Computing | 2015-02-23 | Paper |
Gathering six oblivious robots on anonymous symmetric rings
Journal of Discrete Algorithms | 2014-04-28 | Paper |
A loop-free shortest-path routing algorithm for dynamic networks
Theoretical Computer Science | 2013-12-13 | Paper |
Recoverable robustness for train shunting problems
Algorithmic Operations Research | 2013-12-11 | Paper |
Engineering a new algorithm for distributed shortest paths on dynamic networks
Algorithmica | 2013-05-16 | Paper |
Enhancing the computation of distributed shortest paths on real dynamic networks
Lecture Notes in Computer Science | 2013-04-19 | Paper |
How to gather asynchronous oblivious robots on anonymous rings
Lecture Notes in Computer Science | 2013-03-13 | Paper |
The shortcut problem - complexity and algorithms
Journal of Graph Algorithms and Applications | 2012-12-04 | Paper |
| Robust algorithms and price of robustness in shunting problems | 2012-09-28 | Paper |
| Arc-flags in dynamic graphs | 2012-09-28 | Paper |
| 15. Maintenance of multi-level overlay graphs for timetable queries | 2012-09-28 | Paper |
Minimize the maximum duty in multi-interface networks
Algorithmica | 2012-04-26 | Paper |
Mixed-criticality scheduling of sporadic task systems
Algorithms – ESA 2011 | 2011-09-16 | Paper |
Bandwidth constrained multi-interface networks
SOFSEM 2011: Theory and Practice of Computer Science | 2011-02-15 | Paper |
Min-max coverage in multi-interface networks
SOFSEM 2011: Theory and Practice of Computer Science | 2011-02-15 | Paper |
Minimizing the Maximum Duty for Connectivity in Multi-Interface Networks
Combinatorial Optimization and Applications | 2011-01-10 | Paper |
Scheduling real-time mixed-criticality jobs
Mathematical Foundations of Computer Science 2010 | 2010-09-03 | Paper |
Partially dynamic efficient algorithms for distributed shortest paths
Theoretical Computer Science | 2010-03-09 | Paper |
Evaluation of recoverable-robust timetables on tree networks
Lecture Notes in Computer Science | 2009-12-11 | Paper |
Recoverable Robustness in Shunting and Timetabling
Robust and Online Large-Scale Optimization | 2009-12-03 | Paper |
Recoverable robust timetabling for single delay: Complexity and polynomial algorithms for special cases
Journal of Combinatorial Optimization | 2009-12-02 | Paper |
Recoverable Robust Timetables on Trees
Combinatorial Optimization and Applications | 2009-07-07 | Paper |
The Shortcut Problem – Complexity and Approximation
Lecture Notes in Computer Science | 2009-02-03 | Paper |
Delay Management Problem: Complexity Results and Robust Algorithms
Combinatorial Optimization and Applications | 2009-01-27 | Paper |
Dynamic multi-level overlay graphs for shortest paths
Mathematics in Computer Science | 2008-09-08 | Paper |
