Toward a Unified Approach for the Classification of NP-Complete Optimization Problems. - Giorgio Ausiello; Alberto Marchetti-Spaccamela; Marco Protasi (Theor. Comput. Sci., 1980)

Full Approximatibility of a Class of Problems over Power Sets. - Giorgio Ausiello; Alberto Marchetti-Spaccamela; Marco Protasi (CAAP, 1981)

Probabilistic Analysis of the Performance of Greedy Strategies over Different Classes of Combinatorial Problems. - Giorgio Ausiello; Alberto Marchetti-Spaccamela; Marco Protasi (FCT, 1981)

Analysis of a Class of Graph Partitioning Problems. - Paola Bertolazzi; Mario Lucertini; Alberto Marchetti-Spaccamela (RAIRO Theor. Informatics Appl., 1982)

Probabilistic Analysis of Graph Colouring Algorithms. - Alberto Marchetti-Spaccamela; Maurizio Talamo (CAAP, 1983)

Probabilistic Analysis of Two Euclidean Location Problems. - Alberto Marchetti-Spaccamela; Maurizio Talamo (RAIRO Theor. Informatics Appl., 1983)

The Largest Tree in a Random Graph. - Alberto Marchetti-Spaccamela; Marco Protasi (Theor. Comput. Sci., 1983)

On Finding the Exact Solution of a Zero-One Knapsack Problem - Andrew V. Goldberg; Alberto Marchetti-Spaccamela (STOC, 1984)

A Probabilistic Analysis of Multidimensional Bin Packing Problems - Richard M. Karp; Michael Luby; Alberto Marchetti-Spaccamela (STOC, 1984)

Hierarchical vehicle routing problems. - Alberto Marchetti-Spaccamela; A. H. G. Rinnooy Kan; Leen Stougie (Networks, 1984)

New Protocols for the Election od a Leader in a Ring. - Alberto Marchetti-Spaccamela (FSTTCS, 1985)

On Different Approximation Criteria for Subset Product Problems. - Alberto Marchetti-Spaccamela; Giovanni Romano 002 (Inf. Process. Lett., 1985)

Near Optimal Algorithms for Finding Minimum Steiner Trees on Random Graphs. - Ludek Kucera; Alberto Marchetti-Spaccamela; Marco Protasi; Maurizio Talamo (MFCS, 1986)

Efficient On-Line Algorithms for the Knapsack Problem (Extended Abstract). - Alberto Marchetti-Spaccamela; Carlo Vercellis (ICALP, 1987)

Worst-case Complexity Analysis of Methods for Logic Query Implementation. - Alberto Marchetti-Spaccamela; Antonella Pelaggi; Domenico Saccà (PODS, 1987)

Worst Case Analysis of Two Heuristics for The Set Partitioning Problem. - Alberto Marchetti-Spaccamela; Antonella Pelaggi (RAIRO Theor. Informatics Appl., 1987)

New Protocols for the Election of a Leader in a Ring. - Alberto Marchetti-Spaccamela (Theor. Comput. Sci., 1987)

On the Learnability of DNF Formulae. - Ludek Kucera; Alberto Marchetti-Spaccamela; Marco Protasi (ICALP, 1988)

Dynamic Maintenance of Paths and Path Expressions on Graphs. - Giorgio Ausiello; Alberto Marchetti-Spaccamela; Umberto Nanni (ISSAC, 1988)

On the Estimate of a Directed Graph. - Alberto Marchetti-Spaccamela (WG, 1988)

Learning Under Uniform Distribution. - Alberto Marchetti-Spaccamela; Marco Protasi (FCT, 1989)

Dynamic Data Structures for Series Parallel Digraphs (Preliminary Version). - Giuseppe F. Italiano; Alberto Marchetti-Spaccamela; Umberto Nanni (WADS, 1989)

Competitive Algorithms for the Weighted List Update Problem. - Fabrizio d'Amore; Alberto Marchetti-Spaccamela; Umberto Nanni (WADS, 1991)

Incremental Algorithms for Minimal Length Paths. - Giorgio Ausiello; Giuseppe F. Italiano; Alberto Marchetti-Spaccamela; Umberto Nanni (J. Algorithms, 1991)

Comparison of Methods for Logic-Query Implementation. - Alberto Marchetti-Spaccamela; Antonella Pelaggi; Domenico Saccà (J. Log. Program., 1991)

Learning DNF Formulae Under Classes of Probability Distributions. - Michele Flammini; Alberto Marchetti-Spaccamela; Ludek Kucera (COLT, 1992)

The Complexity of Existential Quantification in Concept Languages. - Francesco M. Donini; Maurizio Lenzerini; Daniele Nardi; Bernhard Hollunder; Werner Nutt; Alberto Marchetti-Spaccamela (Artif. Intell., 1992)

Probabilistic analysis of the minimum weighted flowtime scheduling problem. - Alberto Marchetti-Spaccamela; Wan Soo Rhee; Leen Stougie; Sara A. van de Geer (Oper. Res. Lett., 1992)

On-Line Computation of Minimal and Maximal Length Paths. - Giorgio Ausiello; Giuseppe F. Italiano; Alberto Marchetti-Spaccamela; Umberto Nanni (Theor. Comput. Sci., 1992)

Average Case Analysis of Fully Dynamic Connectivity for Directed Graphs. - Paola Alimonti; Stefano Leonardi 001; Alberto Marchetti-Spaccamela; Xavier Messeguer (WG, 1993)

On-line Graph Algorithms for Incremental Compilation. - Alberto Marchetti-Spaccamela; Umberto Nanni; Hans Rohnert (WG, 1993)

Dynamic algorithms for shortest paths in planar graphs. - Esteban Feuerstein; Alberto Marchetti-Spaccamela (Theor. Comput. Sci., 1993)

The Weighted List Update Problem and the Lazy Adversary. - Fabrizio d'Amore; Alberto Marchetti-Spaccamela; Umberto Nanni (Theor. Comput. Sci., 1993)

Dynamization of Backtrack-Free Search for the Constraint Satisfaction Problem. - Daniele Frigioni; Alberto Marchetti-Spaccamela; Umberto Nanni (CIAC, 1994)

Incremental Algorithms for the Single-Source Shortest Path Problem. - Daniele Frigioni; Alberto Marchetti-Spaccamela; Umberto Nanni (FSTTCS, 1994)

On Learning Monotone DNF Formulae under Uniform Distributions - Ludek Kucera; Alberto Marchetti-Spaccamela; Marco Protasi (Inf. Comput., 1994)

On-line Resource Management with Applications to Routing and Scheduling. - Stefano Leonardi 001; Alberto Marchetti-Spaccamela (ICALP, 1995)

Stochastic on-line knapsack problems. - Alberto Marchetti-Spaccamela; Carlo Vercellis (Math. Program., 1995)

Induced Broadcasting Algorithms in Iterated Line Digraphs. - Jean-Claude Bermond; Xavier Muñoz; Alberto Marchetti-Spaccamela (Euro-Par, Vol. I, 1996)

Efficient Token-Based Control in Rings (Abstract). - Esteban Feuerstein; Stefano Leonardi 001; Alberto Marchetti-Spaccamela; Nicola Santoro (PODC, 1996)

Fully Dynamic Output Bounded Single Source Shortest Path Problem (Extended Abstract). - Daniele Frigioni; Alberto Marchetti-Spaccamela; Umberto Nanni (SODA, 1996)

Maintaining a Topological Order Under Edge Insertions. - Alberto Marchetti-Spaccamela; Umberto Nanni; Hans Rohnert (Inf. Process. Lett., 1996)

Average Case Analysis of Fully Dynamic Reachability for Directed Graphs. - Paola Alimonti; Stefano Leonardi 001; Alberto Marchetti-Spaccamela (RAIRO Theor. Informatics Appl., 1996)

On the Embedding of Refinements of 2-dimensional Grids. - Fabrizio d'Amore; Luca Becchetti; Sergei L. Bezrukov; Alberto Marchetti-Spaccamela; M. Ottaviani; Robert Preis; Markus Röttger; Ulf-Peter Schroeder (Euro-Par, 1997)

Fully Dynamic Shortest Paths and Negative Cycles Detection on Digraphs with Arbitrary Arc Weights. - Daniele Frigioni; Alberto Marchetti-Spaccamela; Umberto Nanni (ESA, 1998)

On-Line Routing Problems for Broadband Networks. - Alberto Marchetti-Spaccamela (SOFSEM, 1998)

Semidynamic Algorithms for Maintaining Single-Source Shortest Path Trees. - Daniele Frigioni; Alberto Marchetti-Spaccamela; Umberto Nanni (Algorithmica, 1998)

The Complexity of Interval Routing on Random Graphs. - Michele Flammini; Jan van Leeuwen; Alberto Marchetti-Spaccamela (Comput. J., 1998)

Efficient Token-Based Control in Rings. - Esteban Feuerstein; Stefano Leonardi 001; Alberto Marchetti-Spaccamela; Nicola Santoro (Inf. Process. Lett., 1998)

Memory Paging for Connectivity and Path Problems in Graphs. - Esteban Feuerstein; Alberto Marchetti-Spaccamela (J. Graph Algorithms Appl., 1998)

Complexity and approximation: combinatorial optimization problems and their approximability properties. - Giorgio Ausiello; Alberto Marchetti-Spaccamela; Pierluigi Crescenzi; Giorgio Gambosi; Marco Protasi; Viggo Kann (Springer, 1999)

On-Line Resource Management with Application to Routing and Scheduling. - Stefano Leonardi 001; Alberto Marchetti-Spaccamela (Algorithmica, 1999)

Computing Surveys' Electronic Symposium on the Theory of Computation. - Pierpaolo Degano; Roberto Gorrieri; Alberto Marchetti-Spaccamela; Peter Wegner (ACM Comput. Surv., 1999)

On Salesmen, Repairmen, Spiders, and Other Traveling Agents. - Giorgio Ausiello; Stefano Leonardi 001; Alberto Marchetti-Spaccamela (CIAC, 2000)

Timestamping Algorithms: A Characterization and a Few Properties. - Giovanna Melideo; Marco Mechelli; Roberto Baldoni; Alberto Marchetti-Spaccamela (Euro-Par, 2000)

Approximation Algorithms for Bandwidth and Storage Allocation Problems under Real Time Constraints. - Stefano Leonardi 001; Alberto Marchetti-Spaccamela; Andrea Vitaletti (FSTTCS, 2000)

Maintaining Shortest Paths in Digraphs with Arbitrary Arc Weights: An Experimental Study. - Camil Demetrescu; Daniele Frigioni; Alberto Marchetti-Spaccamela; Umberto Nanni (WAE, 2000)

Fully Dynamic Algorithms for Maintaining Shortest Paths Trees. - Daniele Frigioni; Alberto Marchetti-Spaccamela; Umberto Nanni (J. Algorithms, 2000)

Multiprocessor Scheduling with Rejection. - Yair Bartal; Stefano Leonardi 001; Alberto Marchetti-Spaccamela; Jirí Sgall; Leen Stougie (SIAM J. Discret. Math., 2000)

A Broadcasting Protocol in Line Digraphs. - Jean-Claude Bermond; Xavier Muñoz; Alberto Marchetti-Spaccamela (J. Parallel Distributed Comput., 2001)

On-line Randomized Call Control Revisited . - Stefano Leonardi 001; Alberto Marchetti-Spaccamela; Alessio Presciutti; Adi Rosén (SIAM J. Comput., 2001)

Dynamic algorithms for classes of constraint satisfaction problems. - Daniele Frigioni; Alberto Marchetti-Spaccamela; Umberto Nanni (Theor. Comput. Sci., 2001)

Preface. - Stefano Leonardi 001; Alberto Marchetti-Spaccamela (Theor. Comput. Sci., 2001)

Non-abusiveness Helps: An O(1)-Competitive Algorithm for Minimizing the Maximum Flow Time in the Online Traveling Salesman Problem. - Sven Oliver Krumke; Luigi Laura; Maarten Lipmann; Alberto Marchetti-Spaccamela; Willem de Paepe; Diana Poensgen; Leen Stougie (APPROX, 2002)

Approximation algorithms for routing and call scheduling in all-optical chains and rings. - Luca Becchetti; Miriam Di Ianni; Alberto Marchetti-Spaccamela (Theor. Comput. Sci., 2002)

Scheduling to Minimize Flow Time Metrics. - Luca Becchetti; Stefano Leonardi 001; Alberto Marchetti-Spaccamela; Guido Schäfer (IPDPS, 2003)

Foreword. - Maurizio A. Bonuccelli; Alberto Marchetti-Spaccamela (Discret. Appl. Math., 2003)

Preface. - Bert Gerards; Alberto Marchetti-Spaccamela (ATMOS, 2003)

Fully dynamic shortest paths in digraphs with arbitrary arc weights. - Daniele Frigioni; Alberto Marchetti-Spaccamela; Umberto Nanni (J. Algorithms, 2003)

Scheduling against an adversarial network. - Stefano Leonardi 001; Alberto Marchetti-Spaccamela; Friedhelm Meyer auf der Heide (SPAA, 2004)

Approximating call-scheduling makespan in all-optical networks. - Luca Becchetti; Miriam Di Ianni; Alberto Marchetti-Spaccamela (J. Discrete Algorithms, 2004)

Semi-clairvoyant scheduling. - Luca Becchetti; Stefano Leonardi 001; Alberto Marchetti-Spaccamela; Kirk Pruhs (Theor. Comput. Sci., 2004)

Average Case and Smoothed Competitive Analysis of the Multi-Level Feedback Algorithm. - Luca Becchetti; Stefano Leonardi 001; Alberto Marchetti-Spaccamela; Guido Schäfer; Tjark Vredeveld (Algorithms for Optimization with Incomplete Information, 2005)

On Minimizing the Maximum Flow Time in the Online Dial-a-Ride Problem. - Sven Oliver Krumke; Willem de Paepe; Diana Poensgen; Maarten Lipmann; Alberto Marchetti-Spaccamela; Leen Stougie (WAOA, 2005)

Parallel scheduling problems in next generation wireless networks. - Luca Becchetti; Stefano Leonardi 001; Alberto Marchetti-Spaccamela; Andrea Vitaletti; Suhas N. Diggavi; S. Muthukrishnan 001; Thyagarajan Nandagopal (Networks, 2005)

Counting triangles in data streams. - Luciana S. Buriol; Gereon Frahling; Stefano Leonardi 001; Alberto Marchetti-Spaccamela; Christian Sohler (PODS, 2006)

Online weighted flow time and deadline scheduling. - Luca Becchetti; Stefano Leonardi 001; Alberto Marchetti-Spaccamela; Kirk Pruhs (J. Discrete Algorithms, 2006)

Preface. - Giuseppe F. Italiano; Alberto Marchetti-Spaccamela (J. Discrete Algorithms, 2006)

Average-Case and Smoothed Competitive Analysis of the Multilevel Feedback Algorithm. - Luca Becchetti; Stefano Leonardi 001; Alberto Marchetti-Spaccamela; Guido Schäfer; Tjark Vredeveld (Math. Oper. Res., 2006)

Prize-Collecting Traveling Salesman and Related Problems. - Alberto Marchetti-Spaccamela; Vincenzo Bonifaci; Stefano Leonardi 001; Giorgio Ausiello (Handbook of Approximation Algorithms and Metaheuristics, 2007)

Minimizing Average Flow Time in Sensor Data Gathering. - Vincenzo Bonifaci; Peter Korteweg; Alberto Marchetti-Spaccamela; Leen Stougie (ALGOSENSORS, 2008)

Self-Adaptive Recommendation Systems: Models and Experimental Analysis. - Luca Becchetti; Ugo Maria Colesanti; Alberto Marchetti-Spaccamela; Andrea Vitaletti (SASO, 2008)

Enumerating Precursor Sets of Target Metabolites in a Metabolic Network. - Ludovic Cottret; Paulo Vieira Milreu; Vicente Acuña; Alberto Marchetti-Spaccamela; Fábio Viduani Martinez; Marie-France Sagot; Leen Stougie (WABI, 2008)

An approximation algorithm for the wireless gathering problem. - Vincenzo Bonifaci; Peter Korteweg; Alberto Marchetti-Spaccamela; Leen Stougie (Oper. Res. Lett., 2008)

Flow Time Minimization. - Luca Becchetti; Stefano Leonardi 001; Alberto Marchetti-Spaccamela; Kirk Pruhs (Encyclopedia of Algorithms, 2008)

Implementation of a Speedup-Optimal Global EDF Schedulability Test. - Sanjoy K. Baruah; Vincenzo Bonifaci; Alberto Marchetti-Spaccamela; Sebastian Stiller (ECRTS, 2009)

Modes and cuts in metabolic networks: Complexity and algorithms. - Vicente Acuña; Flavio Chierichetti; Vincent Lacroix; Alberto Marchetti-Spaccamela; Marie-France Sagot; Leen Stougie (Biosyst., 2009)

Latency-constrained aggregation in sensor networks. - Luca Becchetti; Alberto Marchetti-Spaccamela; Andrea Vitaletti; Peter Korteweg; Martin Skutella; Leen Stougie (ACM Trans. Algorithms, 2009)

Balanced cut approximation in random geometric graphs. - Josep Díaz; Fabrizio Grandoni 001; Alberto Marchetti-Spaccamela (Theor. Comput. Sci., 2009)

Data aggregation in sensor networks: Balancing communication and delay costs. - Peter Korteweg; Alberto Marchetti-Spaccamela; Leen Stougie; Andrea Vitaletti (Theor. Comput. Sci., 2009)

Data Gathering in Wireless Networks. - Vincenzo Bonifaci; Ralf Klasing; Peter Korteweg; Leen Stougie; Alberto Marchetti-Spaccamela (Graphs and Algorithms in Communication Networks, 2010)

Universal Sequencing on a Single Machine. - Leah Epstein; Asaf Levin; Alberto Marchetti-Spaccamela; Nicole Megow; Julián Mestre; Martin Skutella; Leen Stougie (IPCO, 2010)

Enumerating Chemical Organisations in Consistent Metabolic Networks: Complexity and Algorithms. - Paulo Vieira Milreu; Vicente Acuña; Etienne Birmelé; Pierluigi Crescenzi; Alberto Marchetti-Spaccamela; Marie-France Sagot; Leen Stougie; Vincent Lacroix (WABI, 2010)

A note on the complexity of finding and enumerating elementary modes. - Vicente Acuña; Alberto Marchetti-Spaccamela; Marie-France Sagot; Leen Stougie (Biosyst., 2010)

Graph-Based Analysis of the Metabolic Exchanges between Two Co-Resident Intracellular Symbionts, Baumannia cicadellinicola and Sulcia muelleri, with Their Insect Host, Homalodisca coagulata. - Ludovic Cottret; Paulo Vieira Milreu; Vicente Acuña; Alberto Marchetti-Spaccamela; Leen Stougie; Hubert Charles; Marie-France Sagot (PLoS Comput. Biol., 2010)

Improved multiprocessor global schedulability analysis. - Sanjoy K. Baruah; Vincenzo Bonifaci; Alberto Marchetti-Spaccamela; Sebastian Stiller (Real Time Syst., 2010)

Mixed-Criticality Scheduling of Sporadic Task Systems. - Sanjoy K. Baruah; Vincenzo Bonifaci; Gianlorenzo D'Angelo; Alberto Marchetti-Spaccamela; Suzanne van der Ster; Leen Stougie (ESA, 2011)

Social-Aware Forwarding Improves Routing Performance in Pocket Switched Networks. - Josep Díaz; Alberto Marchetti-Spaccamela; Dieter Mitsche; Paolo Santi; Julinda Stefa (ESA, 2011)

Structures and Hyperstructures in Metabolic Networks. - Alberto Marchetti-Spaccamela (WG, 2011)

Nonclairvoyant Speed Scaling for Flow and Energy. - Ho-Leung Chan; Jeff Edmonds; Tak Wah Lam; Lap-Kei Lee; Alberto Marchetti-Spaccamela; Kirk Pruhs (Algorithmica, 2011)

Recommending items in pervasive scenarios: models and experimental analysis. - Luca Becchetti; Ugo Maria Colesanti; Alberto Marchetti-Spaccamela; Andrea Vitaletti (Knowl. Inf. Syst., 2011)

Minimizing flow time in the wireless gathering problem. - Vincenzo Bonifaci; Peter Korteweg; Alberto Marchetti-Spaccamela; Leen Stougie (ACM Trans. Algorithms, 2011)

Preface. - Susanne Albers; Alberto Marchetti-Spaccamela (Theor. Comput. Sci., 2011)

The distributed wireless gathering problem. - Vincenzo Bonifaci; Peter Korteweg; Alberto Marchetti-Spaccamela; Leen Stougie (Theor. Comput. Sci., 2011)

On the complexity of the regenerator placement problem in optical networks. - Michele Flammini; Alberto Marchetti-Spaccamela; Gianpiero Monaco; Luca Moscardelli; Shmuel Zaks (IEEE/ACM Trans. Netw., 2011)

The Preemptive Uniprocessor Scheduling of Mixed-Criticality Implicit-Deadline Sporadic Task Systems. - Sanjoy K. Baruah; Vincenzo Bonifaci; Gianlorenzo D'Angelo; Haohan Li; Alberto Marchetti-Spaccamela; Suzanne van der Ster; Leen Stougie (ECRTS, 2012)

Assigning Sporadic Tasks to Unrelated Parallel Machines. - Alberto Marchetti-Spaccamela; Cyriel Rutten; Suzanne van der Ster; Andreas Wiese (ICALP (1), 2012)

A Generalized Parallel Task Model for Recurrent Real-time Processes. - Sanjoy K. Baruah; Vincenzo Bonifaci; Alberto Marchetti-Spaccamela; Leen Stougie; Andreas Wiese (RTSS, 2012)

Feasibility Analysis of Sporadic Real-Time Multiprocessor Task Systems. - Vincenzo Bonifaci; Alberto Marchetti-Spaccamela (Algorithmica, 2012)

A Constant-Approximate Feasibility Test for Multiprocessor Real-Time Scheduling. - Vincenzo Bonifaci; Alberto Marchetti-Spaccamela; Sebastian Stiller (Algorithmica, 2012)

Algorithms and complexity of enumerating minimal precursor sets in genome-wide metabolic networks. - Vicente Acuña; Paulo Vieira Milreu; Ludovic Cottret; Alberto Marchetti-Spaccamela; Leen Stougie; Marie-France Sagot (Bioinform., 2012)

Feasibility Tests for Recurrent Real-Time Tasks in the Sporadic DAG Model - Vincenzo Bonifaci; Alberto Marchetti-Spaccamela; Sebastian Stiller; Andreas Wiese (CoRR, 2012)

Universal Sequencing on an Unreliable Machine. - Leah Epstein; Asaf Levin; Alberto Marchetti-Spaccamela; Nicole Megow; Julián Mestre; Martin Skutella; Leen Stougie (SIAM J. Comput., 2012)

Algorithms and complexity for periodic real-time scheduling. - Vincenzo Bonifaci; Ho-Leung Chan; Alberto Marchetti-Spaccamela; Nicole Megow (ACM Trans. Algorithms, 2012)

Scheduling Real-Time Mixed-Criticality Jobs. - Sanjoy K. Baruah; Vincenzo Bonifaci; Gianlorenzo D'Angelo; Haohan Li; Alberto Marchetti-Spaccamela; Nicole Megow; Leen Stougie (IEEE Trans. Computers, 2012)

Telling stories: Enumerating maximal directed acyclic graphs with a constrained set of sources and targets. - Vicente Acuña; Etienne Birmelé; Ludovic Cottret; Pierluigi Crescenzi; Fabien Jourdan; Vincent Lacroix; Alberto Marchetti-Spaccamela; Andrea Marino 001; Paulo Vieira Milreu; Marie-France Sagot; Leen Stougie (Theor. Comput. Sci., 2012)

Algorithms for Secure Communication. - Alberto Marchetti-Spaccamela (The Power of Algorithms, 2013)

Feasibility Analysis in the Sporadic DAG Task Model. - Vincenzo Bonifaci; Alberto Marchetti-Spaccamela; Sebastian Stiller; Andreas Wiese (ECRTS, 2013)

Polynomial-Time Exact Schedulability Tests for Harmonic Real-Time Tasks. - Vincenzo Bonifaci; Alberto Marchetti-Spaccamela; Nicole Megow; Andreas Wiese (RTSS, 2013)

Preface. - Camil Demetrescu; Stefano Leonardi 001; Alberto Marchetti-Spaccamela (Theor. Comput. Sci., 2013)

Scheduling over Scenarios on Two Machines. - Esteban Feuerstein; Alberto Marchetti-Spaccamela; Frans Schalekamp; René Sitters; Suzanne van der Ster; Leen Stougie; Anke van Zuylen (COCOON, 2014)

Telling metabolic stories to explore metabolomics data: a case study on the yeast response to cadmium exposure. - Paulo Vieira Milreu; Cecilia Coimbra Klein; Ludovic Cottret; Vicente Acuña; Etienne Birmelé; Michele Borassi; Christophe Junot; Alberto Marchetti-Spaccamela; Andrea Marino 001; Leen Stougie; Fabien Jourdan; Pierluigi Crescenzi; et al. (Bioinform., 2014)

The Global EDF Scheduling of Systems of Conditional Sporadic DAG Tasks. - Sanjoy K. Baruah; Vincenzo Bonifaci; Alberto Marchetti-Spaccamela (ECRTS, 2015)

Response-Time Analysis of Conditional DAG Tasks in Multiprocessor Systems. - Alessandra Melani; Marko Bertogna; Vincenzo Bonifaci; Alberto Marchetti-Spaccamela; Giorgio C. Buttazzo (ECRTS, 2015)

Memory-processor co-scheduling in fixed priority systems. - Alessandra Melani; Marko Bertogna; Vincenzo Bonifaci; Alberto Marchetti-Spaccamela; Giorgio C. Buttazzo (RTNS, 2015)

Preemptive Uniprocessor Scheduling of Mixed-Criticality Sporadic Task Systems. - Sanjoy K. Baruah; Vincenzo Bonifaci; Gianlorenzo D'Angelo; Haohan Li; Alberto Marchetti-Spaccamela; Suzanne van der Ster; Leen Stougie (J. ACM, 2015)

Strong LP formulations for scheduling splittable jobs on unrelated machines. - José Correa 001; Alberto Marchetti-Spaccamela; Jannik Matuschke; Leen Stougie; Ola Svensson; Víctor Verdugo; José Verschae (Math. Program., 2015)

Assigning sporadic tasks to unrelated machines. - Alberto Marchetti-Spaccamela; Cyriel Rutten; Suzanne van der Ster; Andreas Wiese (Math. Program., 2015)

ILP-Based Approaches to Partitioning Recurrent Workloads Upon Heterogeneous Multiprocessors. - Sanjoy K. Baruah; Vincenzo Bonifaci; Renato Bruni; Alberto Marchetti-Spaccamela (ECRTS, 2016)

Multiprocessor Real-Time Scheduling with Hierarchical Processor Affinities. - Vincenzo Bonifaci; Björn B. Brandenburg; Gianlorenzo D'Angelo; Alberto Marchetti-Spaccamela (ECRTS, 2016)

Enumeration of minimal stoichiometric precursor sets in metabolic networks. - Ricardo Andrade; Martin Wannagat; Cecilia Coimbra Klein; Vicente Acuña; Alberto Marchetti-Spaccamela; Paulo Vieira Milreu; Leen Stougie; Marie-France Sagot (Algorithms Mol. Biol., 2016)

Flow Time Minimization. - Luca Becchetti; Stefano Leonardi 001; Alberto Marchetti-Spaccamela; Kirk Pruhs (Encyclopedia of Algorithms, 2016)

A scheduling model inspired by control theory. - Sanjoy K. Baruah; Vincenzo Bonifaci; Alberto Marchetti-Spaccamela; Victor Verdugo (RTNS, 2017)

Performance improvements for search systems using an integrated cache of lists + intersections. - Gabriel Tolosa; Esteban Feuerstein; Luca Becchetti; Alberto Marchetti-Spaccamela (Inf. Retr. J., 2017)

Minimizing worst-case and average-case makespan over scenarios. - Esteban Feuerstein; Alberto Marchetti-Spaccamela; Frans Schalekamp; René Sitters; Suzanne van der Ster; Leen Stougie; Anke van Zuylen (J. Sched., 2017)

Schedulability Analysis of Conditional Parallel Task Graphs in Multicore Systems. - Alessandra Melani; Marko Bertogna; Vincenzo Bonifaci; Alberto Marchetti-Spaccamela; Giorgio C. Buttazzo (IEEE Trans. Computers, 2017)

Exact Response Time Analysis for Fixed Priority Memory-Processor Co-Scheduling. - Alessandra Melani; Marko Bertogna; Robert I. Davis 001; Vincenzo Bonifaci; Alberto Marchetti-Spaccamela; Giorgio C. Buttazzo (IEEE Trans. Computers, 2017)

Prize Collecting Traveling Salesman and Related Problems. - Giorgio Ausiello; Vincenzo Bonifaci; Stefano Leonardi 001; Alberto Marchetti-Spaccamela (Handbook of Approximation Algorithms and Metaheuristics (1), 2018)

ILP models for the allocation of recurrent workloads upon heterogeneous multiprocessors. - Sanjoy K. Baruah; Vincenzo Bonifaci; Renato Bruni; Alberto Marchetti-Spaccamela (J. Sched., 2019)

A Generalized Parallel Task Model for Recurrent Real-Time Processes. - Vincenzo Bonifaci; Andreas Wiese; Sanjoy K. Baruah; Alberto Marchetti-Spaccamela; Sebastian Stiller; Leen Stougie (ACM Trans. Parallel Comput., 2019)

Italian National Framework for Cybersecurity and Data Protection. - Marco Angelini; Claudio Ciccotelli; Luisa Franchina; Alberto Marchetti-Spaccamela; Leonardo Querzoni (APF, 2020)

On the Complexity of Conditional DAG Scheduling in Multiprocessor Systems. - Alberto Marchetti-Spaccamela; Nicole Megow; Jens Schlöter; Martin Skutella; Leen Stougie (IPDPS, 2020)

MOOMIN - Mathematical explOration of 'Omics data on a MetabolIc Network. - Taneli Pusa; Mariana Galvao Ferrarini; Ricardo Andrade; Arnaud Mary; Alberto Marchetti-Spaccamela; Leen Stougie; Marie-France Sagot (Bioinform., 2020)

Constructing Strings Avoiding Forbidden Substrings. - Giulia Bernardini 001; Alberto Marchetti-Spaccamela; Solon P. Pissis; Leen Stougie; Michelle Sweering (CPM, 2021)

Feasibility Analysis of Conditional DAG Tasks. - Sanjoy K. Baruah; Alberto Marchetti-Spaccamela (ECRTS, 2021)

Submodular Maximization subject to a Knapsack Constraint: Combinatorial Algorithms with Near-optimal Adaptive Complexity. - Georgios Amanatidis; Federico Fusco; Philip Lazos; Stefano Leonardi 001; Alberto Marchetti-Spaccamela; Rebecca Reiffenhäuser (ICML, 2021)

Algorithms for hierarchical and semi-partitioned parallel scheduling. - Vincenzo Bonifaci; Gianlorenzo D'Angelo; Alberto Marchetti-Spaccamela (J. Comput. Syst. Sci., 2021)

A Universal Error Measure for Input Predictions Applied to Online Graph Problems. - Giulia Bernardini 001; Alexander Lindermayr; Alberto Marchetti-Spaccamela; Nicole Megow; Leen Stougie; Michelle Sweering (NeurIPS, 2022)

Approximation Algorithms for Replenishment Problems with Fixed Turnover Times. - Thomas Bosman; Martijn van Ee; Yang Jiao; Alberto Marchetti-Spaccamela; R. Ravi 001; Leen Stougie (Algorithmica, 2022)

The Safe and Effective Use of Low-Assurance Predictions in Safety-Critical Systems. - Kunal Agrawal 001; Sanjoy K. Baruah; Michael A. Bender; Alberto Marchetti-Spaccamela (ECRTS, 2023)

SoK: Cybersecurity Regulations, Standards and Guidelines for the Healthcare Sector. - Maria Patrizia Carello; Alberto Marchetti-Spaccamela; Leonardo Querzoni; Marco Angelini (ISI, 2023)

Total Completion Time Scheduling Under Scenarios. - Thomas Bosman; Martijn van Ee; Ekin Ergen; Csanád Imreh; Alberto Marchetti-Spaccamela; Martin Skutella; Leen Stougie (WAOA, 2023)

A Systematization of Cybersecurity Regulations, Standards and Guidelines for the Healthcare Sector. - Maria Patrizia Carello; Alberto Marchetti-Spaccamela; Leonardo Querzoni; Marco Angelini (CoRR, 2023)

The Computational Complexity of Feasibility Analysis for Conditional DAG Tasks. - Sanjoy K. Baruah; Alberto Marchetti-Spaccamela (ACM Trans. Parallel Comput., 2023)

The Safe and Effective Use of Optimistic Period Predictions. - Sanjoy K. Baruah; Pontus Ekberg; Alexander Lindermayr; Alberto Marchetti-Spaccamela; Nicole Megow; Leen Stougie (RTNS, 2024)

Analysis of EDF for Real-Time Multiprocessor Systems with Resource Sharing. - Kunal Agrawal 001; Sanjoy K. Baruah; Jeremy T. Fineman; Alberto Marchetti-Spaccamela; Jinhao Zhao (ECRTS, 2025)

Feasibility analysis of recurrent DAG tasks is PSPACE-hard. - Vincenzo Bonifaci; Alberto Marchetti-Spaccamela (Theor. Comput. Sci., 2025)

Missing value replacement in strings and applications. - Giulia Bernardini 001; Chang Liu 035; Grigorios Loukides; Alberto Marchetti-Spaccamela; Solon P. Pissis; Leen Stougie; Michelle Sweering (Data Min. Knowl. Discov., 2025)