2026 Alberto Marchetti-Spaccamela: Computer Science Researcher – H-Index, Publications & Awards

Discipline name	D-Index	World Ranking	Current World Ranking	National Ranking	Current National Ranking	Publications	Citations
Computer Science	47	6407	6221	148	146	213	10714

Alberto Marchetti-Spaccamela publication distribution in Computer Science in 2026

The chart shows the distribution of publications by all Research.com ranked scientists in the field of Computer Science in 2026. The highlighted bar marks where Alberto Marchetti-Spaccamela sits on this spectrum.

32 publications 991+

This scientist: 213 publications — 51st percentile

51% of scientists in this discipline score the same or lower.

The last bar groups every scientist with 991 publications or more.

Alberto Marchetti-Spaccamela D-index placement in Computer Science in 2026

The chart shows the D-index (discipline H-index) distribution of Computer Science scientists ranked by Research.com in 2026. The highlighted bar marks where Alberto Marchetti-Spaccamela sits on this spectrum.

30 D-Index 131+

This scientist: 47 D-Index — 56th percentile

56% of scientists in this discipline score the same or lower.

The last bar groups every scientist with 131 D-Index or more.

Overview

Alberto Marchetti-Spaccamela is affiliated with Sapienza University of Rome in Italy. Their research spans several key areas in computer science and engineering, focusing largely on algorithms, scheduling, and optimization in computing systems.

The main fields of study for their work include:

Computer Science
Engineering

The subfields they contribute to encompass:

Computer Networks and Communications
Industrial and Manufacturing Engineering
Hardware and Architecture
Computational Theory and Mathematics
Artificial Intelligence

Within these fields, their research topics are centered around:

Scheduling and Optimization Algorithms
Optimization and Search Problems
Real-Time Systems Scheduling
Distributed and Parallel Computing Systems
Complexity and Algorithms in Graphs
Embedded Systems Design Techniques
Formal Methods in Verification

Notable recent publications by Alberto Marchetti-Spaccamela include:

"An industry 4.0 approach to large scale production of satellite constellations. The case study of composite sandwich panel manufacturing," 2021, Acta Astronautica
"Algorithms for hierarchical and semi-partitioned parallel scheduling," 2021, Journal of Computer and System Sciences
"The Computational Complexity of Feasibility Analysis for Conditional DAG Tasks," 2023, ACM Transactions on Parallel Computing
"Submodular maximization subject to a knapsack constraint: Combinatorial algorithms with near-optimal adaptive complexity," 2025, Theoretical Computer Science
"Constructing Strings Avoiding Forbidden Substrings," 2021, Leibniz-Zentrum für Informatik (Schloss Dagstuhl)

The venues where they frequently publish include:

arXiv (Cornell University)
UNC Libraries
Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
Theoretical Computer Science
Acta Astronautica

Frequent co-authors collaborating with Alberto Marchetti-Spaccamela are:

Leen Stougie
Vincenzo Bonifaci
Thomas Bosman
Martijn van Ee
Leonardo Querzoni

Best Publications

Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties

Giorgio Ausiello;Pierluigi Crescenzi;Giorgio Gambosi;Viggo Kann

2489
Citations
Complexity and Approximation

Giorgio Ausiello;Alberto Marchetti-Spaccamela;Pierluigi Crescenzi;Giorgio Gambosi

1350
Citations
Multiprocessor Scheduling with Rejection

Yair Bartal;Stefano Leonardi;Alberto Marchetti-Spaccamela;Jirí Sgall

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

S. Baruah;V. Bonifaci;G. DAngelo;H. Li

326
Citations
Counting triangles in data streams

Luciana S. Buriol;Gereon Frahling;Stefano Leonardi;Alberto Marchetti-Spaccamela

311
Citations
Fully Dynamic Algorithms for Maintaining Shortest Paths Trees

Daniele Frigioni;Alberto Marchetti-Spaccamela;Umberto Nanni

271
Citations
Scheduling Real-Time Mixed-Criticality Jobs

S. Baruah;V. Bonifaci;G. D'Angelo;Haohan Li

270
Citations
Incremental algorithms for minimal length paths

Giorgio Ausiello;Giuseppe F. Italiano;Giuseppe F. Italiano;Alberto Marchetti Spaccamela;Umberto Nanni

242
Citations
A Generalized Parallel Task Model for Recurrent Real-time Processes

Sanjoy Baruah;Vincenzo Bonifaci;Alberto Marchetti-Spaccamela;Leen Stougie

225
Citations
Mixed-criticality scheduling of sporadic task systems

Sanjoy K. Baruah;Vincenzo Bonifaci;Gianlorenzo D'Angelo;Alberto Marchetti-Spaccamela

202
Citations
Feasibility Analysis in the Sporadic DAG Task Model

Vincenzo Bonifaci;Alberto Marchetti-Spaccamela;Sebastian Stiller;Andreas Wiese

192
Citations
Stochastic on-line knapsack problems

A. Marchetti-Spaccamela;C. Vercellis

190
Citations
The complexity of existential quantification in concept languages

Francesco M. Donini;Maurizio Lenzerini;Daniele Nardi;Bernhard Hollunder

168
Citations
Response-Time Analysis of Conditional DAG Tasks in Multiprocessor Systems

Alessandra Melani;Marko Bertogna;Vincenzo Bonifaci;Alberto Marchetti-Spaccamela

158
Citations
Modes and cuts in metabolic networks: complexity and algorithms.

Vicente Acuña;Flavio Chierichetti;Flavio Chierichetti;Flavio Chierichetti;Vincent Lacroix;Vincent Lacroix;Vincent Lacroix;Alberto Marchetti-Spaccamela;Alberto Marchetti-Spaccamela;Alberto Marchetti-Spaccamela

143
Citations
A probabilistic analysis of multidimensional bin packing problems

Richard M. Karp;Michael Luby;A. Marchetti-Spaccamela

138
Citations
Preemptive Uniprocessor Scheduling of Mixed-Criticality Sporadic Task Systems

Sanjoy Baruah;Vincenzo Bonifaci;Gianlorenzo D'angelo;Haohan Li

104
Citations
Average-Case and Smoothed Competitive Analysis of the Multilevel Feedback Algorithm

Luca Becchetti;Stefano Leonardi;Alberto Marchetti-Spaccamela;Guido Schfer

102
Citations
Semidynamic algorithms for maintaining single-source shortest path trees

Daniele Frigioni;Alberto Marchetti-Spaccamela;Umberto Nanni

100
Citations
Fully dynamic output bounded single source shortest path problem

Daniele Frigioni;Alberto Marchetti-Spaccamela;Umberto Nanni

92
Citations
A Generalized Parallel Task Model for Recurrent Real-Time Processes

Vincenzo Bonifaci;Andreas Wiese;Sanjoy K. Baruah;Alberto Marchetti-Spaccamela

12
Citations
Mixed-Criticality Scheduling of Sporadic Task Systems

V. Bonifaci;G. D'Angelo;A. Marchetti-Spaccamela;S.L. van der Ster

5
Citations

Frequent Co-Authors

Leen Stougie Centrum Wiskunde & Informatica

Stefano Leonardi Sapienza University of Rome

Marie-France Sagot Claude Bernard University Lyon 1

Sanjoy Baruah Washington University in St. Louis

Pierluigi Crescenzi Gran Sasso Science Institute

Kirk Pruhs University of Pittsburgh

Roberto Gorrieri University of Bologna

Martin Skutella Technical University of Berlin

Giorgio Buttazzo Sant'Anna School of Advanced Studies

Marko Bertogna University of Modena and Reggio Emilia

External Links

Personal website of Alberto Marchetti-Spaccamela Google Scholar page

If you think any of the details on this page are incorrect, let us know.

Related Online Degrees & Career Pathways

Exploring online degree options can complement or expand your career opportunities in Computer Science. Today, flexibility and affordability are crucial factors when choosing a degree program.

Many universities now offer online master’s degree options, which allow for faster completion rates and specialized training from anywhere in the world. For instance, pursuing an online masters degree can help you gain advanced expertise within just a year.

For individuals seeking affordability, programs such as the cheapest mba online or the cheapest online master's in artificial intelligence are excellent options. These affordable degrees open doors to management and AI-focused tech careers without a significant financial burden.

If you want to enter the workforce quickly, you may want to consider easy online degrees that pay well. These programs offer streamlined study paths to lucrative jobs in tech and related fields, giving you practical, in-demand skills with a shorter time commitment.