Gianlorenzo D'Angelo

Hugo Gilbert

Proceedings of the CIKM '21: The 30th ACM International Conference on Information and Knowledge Management, Virtual Event, Queensland, Australia, November 1, 2021

The Multi-budget Maximum Weighted Coverage Problem.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Complexity - 12th International Conference, 2021

Maximizing Influence-Based Group Shapley Centrality.

[BibT_eX]

[DOI]

Ruben Becker

Alexander van der Grinten

Hugo Gilbert

Proceedings of the AAMAS '21: 20th International Conference on Autonomous Agents and Multiagent Systems, 2021

Group-Harmonic and Group-Closeness Maximization - Approximation and Engineering.

[BibT_eX]

[DOI]

Henning Meyerhenke

Proceedings of the Symposium on Algorithm Engineering and Experiments, 2021

Unveiling the Truth in Liquid Democracy with Misinformed Voters.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Decision Theory - 7th International Conference, 2021

2020

On the Fixed-Parameter Tractability of the Maximum Connectivity Improvement Problem.

[BibT_eX]

[DOI]

Vahan Mkrtchyan

Theory Comput. Syst., 2020

Multi-Winner Election Control via Social Influence: Hardness and Algorithms for Restricted Cases.

[BibT_eX]

[DOI]

Algorithms, 2020

Adding Edges for Maximizing Weighted Reachability.

[BibT_eX]

[DOI]

Cristina M. Pinotti

Algorithms, 2020

Asynchronous Silent Programmable Matter Achieves Leader Election and Compaction.

[BibT_eX]

[DOI]

IEEE Access, 2020

Multi-winner Election Control via Social Influence.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2020

Election Control Through Social Influence with Unknown Preferences.

[BibT_eX]

[DOI]

Emilio Cruciani

Proceedings of the Computing and Combinatorics - 26th International Conference, 2020

Leader Election and Compaction for Asynchronous Silent Programmable Matter.

[BibT_eX]

[DOI]

Proceedings of the 19th International Conference on Autonomous Agents and Multiagent Systems, 2020

Balancing Spreads of Influence in a Social Network.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

2019

Recommending links through influence maximization.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

Fully Dynamic 2-Hop Cover Labeling.

[BibT_eX]

[DOI]

ACM J. Exp. Algorithmics, 2019

Introduction to the Special Issue SEA 2018.

[BibT_eX]

[DOI]

ACM J. Exp. Algorithmics, 2019

Election Control with Voters' Uncertainty: Hardness and Approximation Results.

[BibT_eX]

[DOI]

Emilio Cruciani

CoRR, 2019

Recommending Links to Control Elections via Social Influence.

[BibT_eX]

[DOI]

Algorithms, 2019

Recommending Links to Maximize the Influence in Social Networks.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

Exploiting Social Influence to Control Elections Based on Scoring Rules.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

Models and Algorithms for Election Control through Influence Maximization.

[BibT_eX]

[DOI]

Proceedings of the 20th Italian Conference on Theoretical Computer Science, 2019

Building International Doctoral Schools in Computer Science in Italy, De Nicola's Way.

[BibT_eX]

[DOI]

Proceedings of the Models, Languages, and Tools for Concurrent and Distributed Programming, 2019

Vote For Me!: Election Control via Social Influence in Arbitrary Scoring Rule Voting Systems.

[BibT_eX]

[DOI]

Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems, 2019

Coverage Centrality Maximization in Undirected Networks.

[BibT_eX]

[DOI]

Martin Olsen

Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

2018

Improving the Betweenness Centrality of a Node by Adding Links.

[BibT_eX]

[DOI]

ACM J. Exp. Algorithmics, 2018

What can be verified locally?

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2018

Report on SEA 2018.

[BibT_eX]

[DOI]

Bull. EATCS, 2018

On the Maximum Connectivity Improvement Problem.

[BibT_eX]

[DOI]

Federico Coro

Cristina M. Pinotti

Proceedings of the Algorithms for Sensor Systems, 2018

Approximation and Exact Algorithms for Optimally Placing a Limited Number of Storage Nodes in a Wireless Sensor Network.

[BibT_eX]

Proceedings of the Handbook of Approximation Algorithms and Metaheuristics, 2018

2017

Engineering graph-based models for dynamic timetable information systems.

[BibT_eX]

[DOI]

Kalliopi Giannakopoulou

Andreas Paraskevopoulos

Christos D. Zaroliagis

J. Discrete Algorithms, 2017

A unified approach for gathering and exclusive searching on rings under weak assumptions.

[BibT_eX]

[DOI]

Nicolas Nisse

Distributed Comput., 2017

Selecting Nodes and Buying Links to Maximize the Information Diffusion in a Network.

[BibT_eX]

[DOI]

Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science, 2017

2016

The Minimum k-Storage Problem: Complexity, Approximation, and Experimental Analysis.

[BibT_eX]

[DOI]

IEEE Trans. Mob. Comput., 2016

Greedily Improving Our Own Closeness Centrality in a Network.

[BibT_eX]

[DOI]

ACM Trans. Knowl. Discov. Data, 2016

Gathering of robots on anonymous grids and trees without multiplicity detection.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2016

Approximation bounds for centrality maximization problems.

[BibT_eX]

[DOI]

Bull. EATCS, 2016

Local Distributed Verification.

[BibT_eX]

[DOI]

CoRR, 2016

Distance Queries in Large-Scale Fully Dynamic Complex Networks.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 27th International Workshop, 2016

Influence Maximization in the Independent Cascade Model.

[BibT_eX]

[DOI]

Proceedings of the 17th Italian Conference on Theoretical Computer Science, 2016

Multiprocessor Real-Time Scheduling with Hierarchical Processor Affinities.

[BibT_eX]

[DOI]

Vincenzo Bonifaci

Björn B. Brandenburg

Proceedings of the 28th Euromicro Conference on Real-Time Systems, 2016

2015

The minimum k-storage problem on directed graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

Finding disjoint paths in networks with star shared risk link groups.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

Enhancing the Computation of Distributed Shortest Paths on Power-law Networks in Dynamic Scenarios.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2015

Preemptive Uniprocessor Scheduling of Mixed-Criticality Sporadic Task Systems.

[BibT_eX]

[DOI]

Suzanne van der Ster

J. ACM, 2015

On the Maximum Betweenness Improvement Problem.

[BibT_eX]

[DOI]

Proceedings of the 16th Italian Conference on Theoretical Computer Science, 2015

Computing on Rings by Oblivious Robots: A Unified Approach for Different Tasks.

[BibT_eX]

[DOI]

Algorithmica, 2015

Greedily Improving Our Own Centrality in A Network.

[BibT_eX]

[DOI]

Proceedings of the Experimental Algorithms - 14th International Symposium, 2015

2014

A loop-free shortest-path routing algorithm for dynamic networks.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2014

Flow Problems in Multi-Interface Networks.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 2014

Fully dynamic update of arc-flags.

[BibT_eX]

[DOI]

Networks, 2014

Gathering six oblivious robots on anonymous symmetric rings.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2014

Gathering on rings under the Look-Compute-Move model.

[BibT_eX]

[DOI]

Distributed Comput., 2014

Optimal placement of storage nodes in a wireless sensor network.

[BibT_eX]

[DOI]

Daniele Diodati

Proceedings of the 15th Italian Conference on Theoretical Computer Science, 2014

Gathering and Exclusive Searching on Rings under Minimal Assumptions.

[BibT_eX]

[DOI]

Nicolas Nisse

Proceedings of the Distributed Computing and Networking - 15th International Conference, 2014

Understanding the Power of Stigmergy of Anonymous Agents in Discrete Environments.

[BibT_eX]

[DOI]

Xavier Défago

Nicolas Nisse

Proceedings of the Second International Symposium on Computing and Networking, 2014

2013

Pruning the Computation of Distributed Shortest Paths in Power-law Networks.

[BibT_eX]

[DOI]

Informatica (Slovenia), 2013

Engineering a New Algorithm for Distributed Shortest Paths on Dynamic Networks.

[BibT_eX]

[DOI]

Algorithmica, 2013

A Unified Approach for Different Tasks on Rings in Robot-Based Computing Systems.

[BibT_eX]

[DOI]

Proceedings of the 2013 IEEE International Symposium on Parallel & Distributed Processing, 2013

SRLG-diverse routing with the star property.

[BibT_eX]

[DOI]

Proceedings of the 9th International Conference on the Design of Reliable Communication Networks, 2013

Approximation Bounds for the Minimum k-Storage Problem.

[BibT_eX]

[DOI]

Proceedings of the Algorithms for Sensor Systems, 2013

2012

Scheduling Real-Time Mixed-Criticality Jobs.

[BibT_eX]

[DOI]

Nicole Megow

IEEE Trans. Computers, 2012

The Shortcut Problem - Complexity and Algorithms.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2012

Minimize the Maximum Duty in Multi-interface Networks.

[BibT_eX]

[DOI]

Algorithmica, 2012

Fully Dynamic Maintenance of Arc-Flags in Road Networks.

[BibT_eX]

[DOI]

Proceedings of the Experimental Algorithms - 11th International Symposium, 2012

Engineering a New Loop-Free Shortest Paths Routing Algorithm.

[BibT_eX]

[DOI]

Proceedings of the Experimental Algorithms - 11th International Symposium, 2012

How to Gather Asynchronous Oblivious Robots on Anonymous Rings.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing - 26th International Symposium, 2012

Gathering of Robots on Anonymous Grids without Multiplicity Detection.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2012

Enhancing the Computation of Distributed Shortest Paths on Real Dynamic Networks.

[BibT_eX]

[DOI]

Proceedings of the Design and Analysis of Algorithms, 2012

The Preemptive Uniprocessor Scheduling of Mixed-Criticality Implicit-Deadline Sporadic Task Systems.

[BibT_eX]

[DOI]

Suzanne van der Ster

Proceedings of the 24th Euromicro Conference on Real-Time Systems, 2012

Diverse routing in networks with star SRLGs.

[BibT_eX]

[DOI]

Proceedings of the 2012 ACM conference on CoNEXT student workshop, 2012

2011

Recoverable Robust Timetables: An Algorithmic Approach on Trees.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 2011

Dynamic Arc-Flags in Road Networks.

[BibT_eX]

[DOI]

Camillo Vitale

Proceedings of the Experimental Algorithms - 10th International Symposium, 2011

Bandwidth Constrained Multi-interface Networks.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2011: Theory and Practice of Computer Science, 2011

Min-Max Coverage in Multi-interface Networks.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2011: Theory and Practice of Computer Science, 2011

Gathering of Six Robots on Anonymous Symmetric Rings.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2011

Maximum flow and minimum-cost flow in multi-interface networks.

[BibT_eX]

[DOI]

Proceedings of the 5th International Conference on Ubiquitous Information Management and Communication, 2011

A Speed-Up Technique for Distributed Shortest Paths Computation.

[BibT_eX]

[DOI]

Proceedings of the Computational Science and Its Applications - ICCSA 2011, 2011

Mixed-Criticality Scheduling of Sporadic Task Systems.

[BibT_eX]

[DOI]

Sanjoy K. Baruah

Vincenzo Bonifaci

Suzanne van der Ster

Proceedings of the Algorithms - ESA 2011, 2011

2010

Partially dynamic efficient algorithms for distributed shortest paths.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2010

A New Fully Dynamic Algorithm for Distributed Shortest Paths and Its Experimental Evaluation.

[BibT_eX]

[DOI]

Proceedings of the Experimental Algorithms, 9th International Symposium, 2010

Minimizing the Maximum Duty for Connectivity in Multi-Interface Networks.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2010

2009

Recoverable Robustness in Shunting and Timetabling.

[BibT_eX]

[DOI]

Proceedings of the Robust and Online Large-Scale Optimization: Models and Techniques for Transportation Systems, 2009

Recoverable robust timetabling for single delay: Complexity and polynomial algorithms for special cases.

[BibT_eX]

[DOI]

J. Comb. Optim., 2009

Recoverable Robustness for Train Shunting Problems.

[BibT_eX]

[DOI]

Algorithmic Oper. Res., 2009

The Shortcut Problem - Complexity and Approximation.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2009: Theory and Practice of Computer Science, 2009

Evaluation of Recoverable-Robust Timetables on Tree Networks.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms, 20th International Workshop, 2009

Recoverable Robust Timetables on Trees.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2009

Arc-Flags in Dynamic Graphs.

[BibT_eX]

[DOI]

Emanuele Berrettini