Alessandro Aloisio

Orcid: 0000-0003-3911-4008

According to our database1, Alessandro Aloisio authored at least 30 papers between 2008 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Parameterized complexity of coverage in multi-interface IoT networks: Pathwidth.
Internet Things, 2024

Generalized Distance Polymatrix Games.
Proceedings of the SOFSEM 2024: Theory and Practice of Computer Science, 2024

Generalized Distance Polymatrix Games (short paper).
Proceedings of the 25th Italian Conference on Theoretical Computer Science, 2024

On Balancing Energy Consumption in Multi-Interface Networks (short paper).
Proceedings of the 25th Italian Conference on Theoretical Computer Science, 2024

Serious Games for ADHD: a narrative review.
Proceedings of the International Workshop on Digital Innovations for Learning and Neurodevelopmental Disorders (DILeND 2024), 2024

Intellectual Disabilities: how technologies can improve comminication skills, a review of litterature.
Proceedings of the International Workshop on Digital Innovations for Learning and Neurodevelopmental Disorders (DILeND 2024), 2024

Approximately Fair Allocation of Indivisible Items with Random Valuations.
Proceedings of the 23rd International Conference on Autonomous Agents and Multiagent Systems, 2024

On Coverage in Multi-Interface Networks with Bounded Pathwidth.
Proceedings of the Advanced Information Networking and Applications, 2024

Algorithmic Aspects of Distributing Energy Consumption in Multi-interface Networks.
Proceedings of the Advanced Information Networking and Applications, 2024

Fixed-Parameter Tractability for Branchwidth of the Maximum-Weight Edge-Colored Subgraph Problem.
Proceedings of the Advanced Information Networking and Applications, 2024

2023
Exploring the Potential of Immersive Virtual Reality in Italian Schools: A Practical Workshop with High School Teachers.
Multimodal Technol. Interact., December, 2023

Distance Hypergraph Polymatrix Coordination Games.
Proceedings of the 2023 International Conference on Autonomous Agents and Multiagent Systems, 2023

Distance Polymatrix Coordination Games (short paper).
Proceedings of the the Italian Workshop on Planning and Scheduling, 2023

2021
Distance Polymatrix Coordination Games.
Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, 2021

Algorithmic Aspects of the Maximum 2-edge-colorable Subgraph Problem.
Proceedings of the Advanced Information Networking and Applications, 2021

2020
Energy consumption balancing in multi-interface networks.
J. Ambient Intell. Humaniz. Comput., 2020

Budgeted constrained coverage on bounded carving-width and series-parallel multi-interface networks.
Internet Things, 2020

Constrained Connectivity in Bounded X-Width Multi-Interface Networks.
Algorithms, 2020

Unequal Rotating Energy Efficient Clustering for Heterogeneous Devices (UREECHD).
Proceedings of the Web, Artificial Intelligence and Network Applications, 2020

Budgeted Constrained Coverage on Series-Parallel Multi-interface Networks.
Proceedings of the Advanced Information Networking and Applications, 2020

Coverage Subject to a Budget on Multi-Interface Networks with Bounded Carving-Width.
Proceedings of the Web, Artificial Intelligence and Network Applications, 2020

The Impact of Selfishness in Hypergraph Hedonic Games.
Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

2019
On the fixed-parameter tractability of the maximum 2-edge-colorable subgraph problem.
CoRR, 2019

Distributing Energy Consumption in Multi-interface Series-Parallel Networks.
Proceedings of the Web, Artificial Intelligence and Network Applications, 2019

2018
Distributed Composition of Highly-Collaborative Services and Sensors in Tactical Domains.
Proceedings of 6th International Conference in Software Engineering for Defence Applications, 2018

2015
TACTICS: TACTICal Service Oriented Architecture.
CoRR, 2015

Balancing Energy Consumption for the Establishment of Multi-interface Networks.
Proceedings of the SOFSEM 2015: Theory and Practice of Computer Science, 2015

2011
On LP relaxations for the pattern minimization problem.
Networks, 2011

Cutting stock with no three parts per pattern: Work-in-process and pattern minimization.
Discret. Optim., 2011

2008
A Note on LP Relaxations for the 1D Cutting Stock Problem with Setup Costs.
Proceedings of the Seventh Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2008


  Loading...