GranSassoScienceInst

research

∙ 04/28/2021

Dynamic Mode Decomposition in Adaptive Mesh Refinement and Coarsening Simulations

Dynamic Mode Decomposition (DMD) is a powerful data-driven method used t...

Gabriel F. Barros, et al. ∙

research

∙ 07/15/2019

Subspace Determination through Local Intrinsic Dimensional Decomposition: Theory and Experimentation

Axis-aligned subspace clustering generally entails searching through eno...

Ruben Becker, et al. ∙

research

∙ 11/09/2017

On Colorful Bin Packing Games

We consider colorful bin packing games in which selfish players control ...

Vittorio Bilò, et al. ∙

research

∙ 01/31/2018

Hardness, Approximability, and Fixed-Parameter Tractability of the Clustered Shortest-Path Tree Problem

Given an n-vertex non-negatively real-weighted graph G, whose vertices a...

Mattia D'Emidio, et al. ∙

research

∙ 02/23/2018

A Matrix Approach for Weighted Argumentation Frameworks: a Preliminary Report

The assignment of weights to attacks in a classical Argumentation Framew...

Stefano Bistarelli, et al. ∙

research

∙ 02/22/2018

On Looking for Local Expansion Invariants in Argumentation Semantics

We study invariant local expansion operators for conflict-free and admis...

Stefano Bistarelli, et al. ∙

research

∙ 05/03/2018

On the Metastability of Quadratic Majority Dynamics on Clustered Graphs and its Biological Implications

We investigate the behavior of a simple majority dynamics on network top...

Emilio Cruciani, et al. ∙

research

∙ 07/05/2018

Rule Formats for Nominal Process Calculi

The nominal transition systems (NTSs) of Parrow et al. describe the oper...

Luca Aceto, et al. ∙

research

∙ 10/22/2018

Coalition Resilient Outcomes in Max k-Cut Games

We investigate strong Nash equilibria in the max k-cut game, where we ar...

Raffaello Carosi, et al. ∙

research

∙ 11/11/2018

Coverage Centrality Maximization in Undirected Networks

Centrality metrics are among the main tools in social network analysis. ...

Gianlorenzo D'Angelo, et al. ∙

research

∙ 02/13/2019

The Cost of Monitoring Alone

We compare the succinctness of two monitoring systems for properties of ...

Luca Aceto, et al. ∙

research

∙ 03/25/2019

A linear bound on the k-rendezvous time for primitive sets of NZ matrices

A set of nonnegative matrices is called primitive if there exists a prod...

Umer Azfar, et al. ∙

research

∙ 04/19/2019

On the fixed-parameter tractability of the maximum 2-edge-colorable subgraph problem

A k-edge-coloring of a graph is an assignment of colors {1,...,k} to edg...

Alessandro Aloisio, et al. ∙

research

∙ 04/26/2019

Parameterized algorithms for Partial vertex covers in bipartite graphs

In the weighted partial vertex cover problem (WPVC), we are given a grap...

Vahan Mkrtchyan, et al. ∙

research

∙ 04/26/2019

On the fixed-parameter tractability of the maximum connectivity improvement problem

In the Maximum Connectivity Improvement (MCI) problem, we are given a di...

Federico Corò, et al. ∙

research

∙ 06/15/2019

Social Cost Guarantees in Smart Route Guidance

We model and study the problem of assigning traffic in an urban road net...

Paolo Serafino, et al. ∙

research

∙ 07/16/2019

Step-by-Step Community Detection for Volume-Regular Graphs

Spectral techniques have proved amongst the most effective approaches to...

Luca Becchetti, et al. ∙

research

∙ 08/21/2019

Technical Report on Implementing Ranking-Based Semantics in ConArg

ConArg is a suite of tools that offers a wide series of applications for...

Stafano Bistarelli, et al. ∙

research

∙ 08/21/2019

Implementing Ranking-Based Semantics in ConArg: a Preliminary Report

ConArg is a suite of tools that offers a wide series of applications for...

Stafano Bistarelli, et al. ∙

research

∙ 09/09/2019

Do you really follow them? Automatic detection of credulous Twitter users

Online Social Media represent a pervasive source of information able to ...

Alessandro Balestrucci, et al. ∙

research

∙ 09/19/2019

Parametrized Complexity of Manipulating Sequential Allocation

The sequential allocation protocol is a simple and popular mechanism to ...

Hugo Gilbert, et al. ∙

research

∙ 11/14/2019

Beyond Pairwise Comparisons in Social Choice: A Setwise Kemeny Aggregation Problem

In this paper, we advocate the use of setwise contests for aggregating a...

Hugo Gilbert, et al. ∙

research

∙ 02/24/2020

Vizing-Goldberg type bounds for the equitable chromatic number of block graphs

An equitable coloring of a graph G is a proper vertex coloring of G such...

Janusz Dybizbański, et al. ∙

research

∙ 05/07/2020

Credulous Users and Fake News: a Real Case Study on the Propagation in Twitter

Recent studies have confirmed a growing trend, especially among youngste...

Alessandro Balestrucci, et al. ∙

research

∙ 05/18/2020

Flexibility Is Key in Organizing a Global Professional Conference Online: The ICPE 2020 Experience in the COVID-19 Era

Organizing professional conferences online has never been more timely. R...

Alexandru Iosup, et al. ∙

research

∙ 06/27/2020

Better Bounds on the Adaptivity Gap of Influence Maximization under Full-adoption Feedback

In the influence maximization (IM) problem, we are given a social networ...

Gianlorenzo D'Angelo, et al. ∙

research

∙ 06/08/2020

Nonlinear Higher-Order Label Spreading

Label spreading is a general technique for semi-supervised learning with...

Francesco Tudisco, et al. ∙

research

∙ 07/15/2020

On Indexing and Compressing Finite Automata

An index for a finite automaton is a powerful data structure that suppor...

Nicola Cotumaccio, et al. ∙

research

∙ 07/16/2020

Improved Approximation Factor for Adaptive Influence Maximization via Simple Greedy Strategies

In the adaptive influence maximization problem, we are given a social ne...

Gianlorenzo D'Angelo, et al. ∙

research

∙ 10/29/2020

A passivation algorithm for linear time-invariant systems

We propose and study an algorithm for computing a nearest passive system...

Antonio Fazzi, et al. ∙

research

∙ 03/27/2021

A nonlinear diffusion method for semi-supervised learning on hypergraphs

Hypergraphs are a common model for multiway relationships in data, and h...

Francesco Tudisco, et al. ∙

research

∙ 06/23/2021

Finding single-source shortest p-disjoint paths: fast computation and sparse preservers

Let G be a directed graph with n vertices, m edges, and non-negative edg...

Davide Bilò, et al. ∙

research

∙ 09/13/2021

Computation of the nearest structured matrix triplet with common null space

We study computational methods for computing the distance to singularity...

Nicola Guglielmi, et al. ∙

research

∙ 10/12/2021

Coupled and Uncoupled Dynamic Mode Decomposition in Multi-Compartmental Systems with Applications to Epidemiological and Additive Manufacturing Problems

Dynamic Mode Decomposition (DMD) is an unsupervised machine learning met...

Alex Viguerie, et al. ∙

research

∙ 11/18/2021

The self-consistent field iteration for p-spectral clustering

The self-consistent field (SCF) iteration, combined with its variants, i...

Parikshit Upadhyaya, et al. ∙

research

∙ 01/04/2022

Nodal domain count for the generalized graph p-Laplacian

Inspired by the linear Schrödinger operator, we consider a generalized p...

Piero Deidda, et al. ∙

research

∙ 01/04/2022

Contour Integral Methods for time treatment in Reduced Basis Methods

In this paper we discuss a reduced basis method for linear evolution PDE...

Nicola Guglielmi, et al. ∙

research

∙ 01/28/2022

Regularized minimal-norm solution of an overdetermined system of first kind integral equations

Overdetermined systems of first kind integral equations appear in many a...

Patricia Díaz de Alba, et al. ∙

research

∙ 02/17/2022

Efficient Classification of Local Problems in Regular Trees

We give practical, efficient algorithms that automatically determine the...

Alkida Balliu, et al. ∙

research

∙ 02/23/2022

Monitoring hyperproperties with circuits

This paper presents an extension of the safety fragment of Hennessy-Miln...

Luca Aceto, et al. ∙

research

∙ 02/25/2022

Core-periphery detection in hypergraphs

Core-periphery detection is a key task in exploratory network analysis w...

Francesco Tudisco, et al. ∙

research

∙ 03/24/2022

Agile Beyond Teams and Feedback Beyond Software in Automotive Systems

In order to increase the ability to build complex, software-intensive sy...

S. Magnus Ågren, et al. ∙

GranSassoScienceInst

Featured Researchers