Alberto Marchetti-Spaccamela

Vincenzo Bonifaci, Alberto Marchetti-Spaccamela, Sebastian Stiller: A Constant-Approximate Feasibility Test for Multiprocessor Real-Time Scheduling. Algorithmica 62(3-4): 1034-1049 (2012)

Vincenzo Bonifaci, Alberto Marchetti-Spaccamela: Feasibility Analysis of Sporadic Real-Time Multiprocessor Task Systems. Algorithmica 63(4): 763-780 (2012)

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

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

Vincenzo Bonifaci, Ho-Leung Chan, Alberto Marchetti-Spaccamela, Nicole Megow: Algorithms and complexity for periodic real-time scheduling. ACM Transactions on Algorithms 9(1): 6 (2012)

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

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

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

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

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

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

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

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

Vincenzo Bonifaci, Peter Korteweg, Alberto Marchetti-Spaccamela, Leen Stougie: Minimizing flow time in the wireless gathering problem. ACM Transactions on Algorithms 7(3): 33 (2011)

Vincenzo Bonifaci, Peter Korteweg, Alberto Marchetti-Spaccamela, Leen Stougie: The distributed wireless gathering problem. Theor. Comput. Sci. 412(8-10): 633-641 (2011)

Susanne Albers, Alberto Marchetti-Spaccamela: Preface. Theor. Comput. Sci. 412(24): 2563 (2011)

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

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

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

Alberto Marchetti-Spaccamela: Structures and Hyperstructures in Metabolic Networks. WG 2011: 1-4

Alberto Marchetti-Spaccamela, Michael Segal (Eds.): Theory and Practice of Algorithms in (Computer) Systems - First International ICST Conference, TAPAS 2011, Rome, Italy, April 18-20, 2011. Proceedings. Lecture Notes in Computer Science 6595, Springer 2011, isbn 978-3-642-19753-6

Vicente Acuña, Alberto Marchetti-Spaccamela, Marie-France Sagot, Leen Stougie: A note on the complexity of finding and enumerating elementary modes. Biosystems 99(3): 210-214 (2010)

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

Sanjoy K. Baruah, Vincenzo Bonifaci, Alberto Marchetti-Spaccamela, Sebastian Stiller: Improved multiprocessor global schedulability analysis. Real-Time Systems 46(1): 3-24 (2010)

Vincenzo Bonifaci, Alberto Marchetti-Spaccamela: Feasibility Analysis of Sporadic Real-Time Multiprocessor Task Systems. ESA (2) 2010: 230-241

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

Sanjoy K. Baruah, Vincenzo Bonifaci, Gianlorenzo D'Angelo, Haohan Li, Alberto Marchetti-Spaccamela, Nicole Megow, Leen Stougie: Scheduling Real-Time Mixed-Criticality Jobs. MFCS 2010: 90-101

Vincenzo Bonifaci, Ho-Leung Chan, Alberto Marchetti-Spaccamela, Nicole Megow: Algorithms and Complexity for Periodic Real-Time Scheduling. SODA 2010: 1350-1359

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

Vincenzo Bonifaci, Alberto Marchetti-Spaccamela: Feasibility Analysis of Sporadic Real-Time Multiprocessor Task Systems. CoRR abs/1004.2033 (2010)

Josep Díaz, Alberto Marchetti-Spaccamela, Dieter Mitsche, Paolo Santi, Julinda Stefa: Social-Aware Forwarding Improves Routing Performance in Pocket Switched Networks. CoRR abs/1007.5240 (2010)

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

Luca Becchetti, Alberto Marchetti-Spaccamela, Andrea Vitaletti, Peter Korteweg, Martin Skutella, Leen Stougie: Latency-constrained aggregation in sensor networks. ACM Transactions on Algorithms 6(1) (2009)

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

Josep Díaz, Fabrizio Grandoni, Alberto Marchetti-Spaccamela: Balanced cut approximation in random geometric graphs. Theor. Comput. Sci. 410(27-29): 2725-2731 (2009)

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

Michele Flammini, Alberto Marchetti-Spaccamela, Gianpiero Monaco, Luca Moscardelli, Shmuel Zaks: On the complexity of the regenerator placement problem in optical networks. SPAA 2009: 154-162

Ho-Leung Chan, Jeff Edmonds, Tak Wah Lam, Lap-Kei Lee, Alberto Marchetti-Spaccamela, Kirk Pruhs: Nonclairvoyant Speed Scaling for Flow and Energy. STACS 2009: 255-264

Susanne Albers, Alberto Marchetti-Spaccamela, Yossi Matias, Sotiris E. Nikoletseas, Wolfgang Thomas (Eds.): Automata, Languages and Programming, 36th International Colloquium, ICALP 2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part I. Lecture Notes in Computer Science 5555, Springer 2009, isbn 978-3-642-02926-4

Susanne Albers, Alberto Marchetti-Spaccamela, Yossi Matias, Sotiris E. Nikoletseas, Wolfgang Thomas (Eds.): Automata, Languages and Programming, 36th Internatilonal Collogquium, ICALP 2009, Rhodes, greece, July 5-12, 2009, Proceedings, Part II. Lecture Notes in Computer Science 5556, Springer 2009, isbn 978-3-642-02929-5

Ho-Leung Chan, Jeff Edmonds, Tak Wah Lam, Lap-Kei Lee, Alberto Marchetti-Spaccamela, Kirk Pruhs: Nonclairvoyant Speed Scaling for Flow and Energy. CoRR abs/0902.1260 (2009)

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

Vincenzo Bonifaci, Peter Korteweg, Alberto Marchetti-Spaccamela, Leen Stougie: The Distributed Wireless Gathering Problem. AAIM 2008: 72-83

Vincenzo Bonifaci, Peter Korteweg, Alberto Marchetti-Spaccamela, Leen Stougie: Minimizing Average Flow Time in Sensor Data Gathering. ALGOSENSORS 2008: 18-29

Vincenzo Bonifaci, Alberto Marchetti-Spaccamela, Sebastian Stiller: A Constant-Approximate Feasibility Test for Multiprocessor Real-Time Scheduling. ESA 2008: 210-221

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

Vincenzo Bonifaci, Peter Korteweg, Alberto Marchetti-Spaccamela: Minimizing Flow Time in the Wireless Gathering Problem. STACS 2008: 109-120

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

Luca Becchetti, Stefano Leonardi, Alberto Marchetti-Spaccamela, Kirk Pruhs: Flow Time Minimization. Encyclopedia of Algorithms 2008

Vincenzo Bonifaci, Peter Korteweg, Alberto Marchetti-Spaccamela, Leen Stougie: Minimizing Flow Time in the Wireless Gathering Problem. CoRR abs/0802.2836 (2008)

Peter Korteweg, Alberto Marchetti-Spaccamela, Leen Stougie, Andrea Vitaletti: Data Aggregation in Sensor Networks: Balancing Communication and Delay Costs. SIROCCO 2007: 139-150

Giuseppe F. Italiano, Alberto Marchetti-Spaccamela: Preface. J. Discrete Algorithms 4(3): 337-338 (2006)

Luca Becchetti, Stefano Leonardi, Alberto Marchetti-Spaccamela, Kirk Pruhs: Online weighted flow time and deadline scheduling. J. Discrete Algorithms 4(3): 339-352 (2006)

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

Luca Becchetti, Peter Korteweg, Alberto Marchetti-Spaccamela, Martin Skutella, Leen Stougie, Andrea Vitaletti: Latency Constrained Aggregation in Sensor Networks. ESA 2006: 88-99

Josep Díaz, Fabrizio Grandoni, Alberto Marchetti-Spaccamela: Balanced Cut Approximation in Random Geometric Graphs. ISAAC 2006: 527-536

Luciana S. Buriol, Gereon Frahling, Stefano Leonardi, Alberto Marchetti-Spaccamela, Christian Sohler: Counting triangles in data streams. PODS 2006: 253-262

Vincenzo Bonifaci, Peter Korteweg, Alberto Marchetti-Spaccamela, Leen Stougie: An Approximation Algorithm for the Wireless Gathering Problem. SWAT 2006: 328-338

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

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

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

Bert Gerards, Alberto Marchetti-Spaccamela: Preface. Electr. Notes Theor. Comput. Sci. 91: 1-2 (2004)

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

Luca Becchetti, Stefano Leonardi, Alberto Marchetti-Spaccamela, Kirk Pruhs: Semi-clairvoyant scheduling. Theor. Comput. Sci. 324(2-3): 325-335 (2004)

Stefano Leonardi, Alberto Marchetti-Spaccamela, Friedhelm Meyer auf der Heide: Scheduling against an adversarial network. SPAA 2004: 151-159

Maurizio A. Bonuccelli, Alberto Marchetti-Spaccamela: Foreword. Discrete Applied Mathematics 129(1): 1 (2003)

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

Luca Becchetti, Stefano Leonardi, Alberto Marchetti-Spaccamela, Kirk Pruhs: Semi-clairvoyant Scheduling. ESA 2003: 67-77

Luca Becchetti, Stefano Leonardi, Alberto Marchetti-Spaccamela, Guido Schäfer, Tjark Vredeveld: Average Case and Smoothed Competitive Analysis of the Multi-Level Feedback Algorithm. FOCS 2003: 462-471

Luca Becchetti, Stefano Leonardi, Alberto Marchetti-Spaccamela, Guido Schäfer: Scheduling to Minimize Flow Time Metrics. IPDPS 2003: 223

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

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

Luca Becchetti, Suhas N. Diggavi, Stefano Leonardi, Alberto Marchetti-Spaccamela, S. Muthukrishnan, Thyagarajan Nandagopal, Andrea Vitaletti: Parallel scheduling problems in next generation wireless networks. SPAA 2002: 238-247

Jean-Claude Bermond, Xavier Muñoz, Alberto Marchetti-Spaccamela: A Broadcasting Protocol in Line Digraphs. J. Parallel Distrib. Comput. 61(8): 1013-1032 (2001)

Stefano Leonardi, Alberto Marchetti-Spaccamela, Alessio Presciutti, Adi Rosén: On-line Randomized Call Control Revisited . SIAM J. Comput. 31(1): 86-112 (2001)

Daniele Frigioni, Alberto Marchetti-Spaccamela, Umberto Nanni: Dynamic algorithms for classes of constraint satisfaction problems. Theor. Comput. Sci. 259(1-2): 287-305 (2001)

Stefano Leonardi, Alberto Marchetti-Spaccamela: Preface. Theor. Comput. Sci. 268(1): 1 (2001)

Luca Becchetti, Stefano Leonardi, Alberto Marchetti-Spaccamela, Kirk Pruhs: Online Weighted Flow Time and Deadline Scheduling. RANDOM-APPROX 2001: 36-47

Gerth Stølting Brodal, Daniele Frigioni, Alberto Marchetti-Spaccamela (Eds.): Algorithm Engineering, 5th International Workshop, WAE 2001 Aarhus, Denmark, August 28-31, 2001, Proceedings. Lecture Notes in Computer Science 2141, Springer 2001, isbn 3-540-42500-4

Daniele Frigioni, Alberto Marchetti-Spaccamela, Umberto Nanni: Fully Dynamic Algorithms for Maintaining Shortest Paths Trees. J. Algorithms 34(2): 251-281 (2000)

Yair Bartal, Stefano Leonardi, Alberto Marchetti-Spaccamela, Jiri Sgall, Leen Stougie: Multiprocessor Scheduling with Rejection. SIAM J. Discrete Math. 13(1): 64-78 (2000)

Giorgio Ausiello, Stefano Leonardi, Alberto Marchetti-Spaccamela: On Salesmen, Repairmen, Spiders, and Other Traveling Agents. CIAC 2000: 1-16

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

Stefano Leonardi, Alberto Marchetti-Spaccamela, Andrea Vitaletti: Approximation Algorithms for Bandwidth and Storage Allocation Problems under Real Time Constraints. FSTTCS 2000: 409-420

Camil Demetrescu, Daniele Frigioni, Alberto Marchetti-Spaccamela, Umberto Nanni: Maintaining Shortest Paths in Digraphs with Arbitrary Arc Weights: An Experimental Study. Algorithm Engineering 2000: 218-229

Luca Becchetti, Miriam Di Ianni, Alberto Marchetti-Spaccamela: Approximating Call-Scheduling Makespan in All-Optical Networks. WG 2000: 13-22

Stefano Leonardi, Alberto Marchetti-Spaccamela: On-Line Resource Management with Application to Routing and Scheduling. Algorithmica 24(1): 29-49 (1999)

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

Luca Becchetti, Miriam Di Ianni, Alberto Marchetti-Spaccamela: Approximation Algorithms for Routing and Call Scheduling in All-Optical Chains and Rings. FSTTCS 1999: 201-212

Daniele Frigioni, Alberto Marchetti-Spaccamela, Umberto Nanni: Semidynamic Algorithms for Maintaining Single-Source Shortest Path Trees. Algorithmica 22(3): 250-274 (1998)

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

Esteban Feuerstein, Stefano Leonardi, Alberto Marchetti-Spaccamela, Nicola Santoro: Efficient Token-Based Control in Rings. Inf. Process. Lett. 66(4): 175-180 (1998)

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

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

Stefano Leonardi, Alberto Marchetti-Spaccamela, Alessio Presciutti, Adi Rosén: On-line Randomized Call Control Revisited. SODA 1998: 323-332

Alberto Marchetti-Spaccamela: On-Line Routing Problems for Broadband Networks. SOFSEM 1998: 167

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

Pierpaolo Degano, Roberto Gorrieri, Alberto Marchetti-Spaccamela (Eds.): Automata, Languages and Programming, 24th International Colloquium, ICALP'97, Bologna, Italy, 7-11 July 1997, Proceedings. Lecture Notes in Computer Science 1256, Springer 1997, isbn 3-540-63165-8

Fabrizio d'Amore, Paolo Giulio Franciosa, Alberto Marchetti-Spaccamela (Eds.): Graph-Theoretic Concepts in Computer Science, 22nd International Workshop, WG '96, Cadenabbia (Como), Italy, June 12-14, 1996, Proceedings. Lecture Notes in Computer Science 1197, Springer 1997, isbn 3-540-62559-3

Alberto Marchetti-Spaccamela, Umberto Nanni, Hans Rohnert: Maintaining a Topological Order Under Edge Insertions. Inf. Process. Lett. 59(1): 53-58 (1996)

Paola Alimonti, Stefano Leonardi, Alberto Marchetti-Spaccamela: Average Case Analysis of Fully Dynamic Reachability for Directed Graphs. ITA 30(4): 305-318 (1996)

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

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

Yair Bartal, Stefano Leonardi, Alberto Marchetti-Spaccamela, Jiri Sgall, Leen Stougie: Multiprocessor Scheduling with Rejection. SODA 1996: 95-103

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

Alberto Marchetti-Spaccamela, Carlo Vercellis: Stochastic on-line knapsack problems. Math. Program. 68: 73-104 (1995)

Stefano Leonardi, Alberto Marchetti-Spaccamela: On-line Resource Management with Applications to Routing and Scheduling. ICALP 1995: 303-314

Michele Flammini, Jan van Leeuwen, Alberto Marchetti-Spaccamela: The Complexity of Interval Routing on Random Graphs. MFCS 1995: 37-49

Ludek Kucera, Alberto Marchetti-Spaccamela, Marco Protasi: On Learning Monotone DNF Formulae under Uniform Distributions. Inf. Comput. 110(1): 84-95 (1994)

Daniele Frigioni, Alberto Marchetti-Spaccamela, Umberto Nanni: Dynamization of Backtrack-Free Search for the Constraint Satisfaction Problem. CIAC 1994: 136-151

Daniele Frigioni, Alberto Marchetti-Spaccamela, Umberto Nanni: Incremental Algorithms for the Single-Source Shortest Path Problem. FSTTCS 1994: 113-124

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

Esteban Feuerstein, Alberto Marchetti-Spaccamela: Memory Paging for Connectivity and Path Problems in Graphs. ISAAC 1993: 416-425

Alberto Marchetti-Spaccamela, Umberto Nanni, Hans Rohnert: On-line Graph Algorithms for Incremental Compilation. WG 1993: 70-86

Paola Alimonti, Stefano Leonardi, Alberto Marchetti-Spaccamela, Xavier Messeguer: Average Case Analysis of Fully Dynamic Connectivity for Directed Graphs. WG 1993: 87-98

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

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

Michele Flammini, Alberto Marchetti-Spaccamela, Ludek Kucera: Learning DNF Formulae Under Classes of Probability Distributions. COLT 1992: 85-92

Giorgio Ausiello, Giuseppe F. Italiano, Alberto Marchetti-Spaccamela, Umberto Nanni: Incremental Algorithms for Minimal Length Paths. J. Algorithms 12(4): 615-638 (1991)

Alberto Marchetti-Spaccamela, Antonella Pelaggi, Domenico Saccà: Comparison of Methods for Logic-Query Implementation. J. Log. Program. 10(3&4): 333-360 (1991)

Fabrizio d'Amore, Alberto Marchetti-Spaccamela, Umberto Nanni: Competitive Algorithms for the Weighted List Update Problem. WADS 1991: 240-248

Esteban Feuerstein, Alberto Marchetti-Spaccamela: Dynamic Algorithms for Shortest Paths in Planar Graphs. WG 1991: 187-197

Giorgio Ausiello, Giuseppe F. Italiano, Alberto Marchetti-Spaccamela, Umberto Nanni: Incremental Algorithms for Minimal Length Paths. SODA 1990: 12-21

Alberto Marchetti-Spaccamela, Marco Protasi: Learning Under Uniform Distribution. FCT 1989: 327-338

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

Ludek Kucera, Alberto Marchetti-Spaccamela, Marco Protasi: On the Learnability of DNF Formulae. ICALP 1988: 347-361

Giorgio Ausiello, Alberto Marchetti-Spaccamela, Umberto Nanni: Dynamic Maintenance of Paths and Path Expressions on Graphs. ISSAC 1988: 1-12

Alberto Marchetti-Spaccamela: On the Estimate of a Directed Graph. WG 1988: 317-326

Alberto Marchetti-Spaccamela, Antonella Pelaggi: Worst Case Analysis of Two Heuristics for The Set Partitioning Problem. ITA 21(1): 11-23 (1987)

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

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

Alberto Marchetti-Spaccamela, Antonella Pelaggi, Domenico Saccà: Worst-case Complexity Analysis of Methods for Logic Query Implementation. PODS 1987: 294-301

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

Alberto Marchetti-Spaccamela, G. Romano: On Different Approximation Criteria for Subset Product Problems. Inf. Process. Lett. 21(4): 213-218 (1985)

Alberto Marchetti-Spaccamela: New Protocols for the Election od a Leader in a Ring. FSTTCS 1985: 101-115

Alberto Marchetti-Spaccamela, A. H. G. Rinnooy Kan, Leen Stougie: Hierarchical vehicle routing problems. Networks 14(4): 571-586 (1984)

Richard M. Karp, Michael Luby, Alberto Marchetti-Spaccamela: A Probabilistic Analysis of Multidimensional Bin Packing Problems. STOC 1984: 289-298

Andrew V. Goldberg, Alberto Marchetti-Spaccamela: On Finding the Exact Solution of a Zero-One Knapsack Problem. STOC 1984: 359-368

Alberto Marchetti-Spaccamela, Maurizio Talamo: Probabilistic Analysis of Two Euclidean Location Problems. ITA 17(4): 387-395 (1983)

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

Alberto Marchetti-Spaccamela, Maurizio Talamo: Probabilistic Analysis of Graph Colouring Algorithms. CAAP 1983: 332-340

Paola Bertolazzi, M. Lucertini, Alberto Marchetti-Spaccamela: Analysis of a Class of Graph Partitioning Problems. ITA 16(3): 255-261 (1982)

Giorgio Ausiello, Alberto Marchetti-Spaccamela, Marco Protasi: Full Approximatibility of a Class of Problems over Power Sets. CAAP 1981: 76-87

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

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