| Complexity and approximation: Combinatorial optimization problems and their approximability properties G Ausiello, P Crescenzi, G Gambosi, V Kann, A Marchetti-Spaccamela, ... Springer Science & Business Media, 2012 | 2288 | 2012 |
| Multiprocessor scheduling with rejection Y Bartal, S Leonardi, A Marchetti-Spaccamela, J Sgall, L Stougie SIAM Journal on Discrete Mathematics 13 (1), 64-78, 2000 | 326 | 2000 |
| Counting triangles in data streams LS Buriol, G Frahling, S Leonardi, A Marchetti-Spaccamela, C Sohler Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on …, 2006 | 269 | 2006 |
| The preemptive uniprocessor scheduling of mixed-criticality implicit-deadline sporadic task systems S Baruah, V Bonifaci, G DAngelo, H Li, A Marchetti-Spaccamela, ... 2012 24th Euromicro Conference on Real-Time Systems, 145-154, 2012 | 248 | 2012 |
| Fully dynamic algorithms for maintaining shortest paths trees D Frigioni, A Marchetti-Spaccamela, U Nanni Journal of Algorithms 34 (2), 251-281, 2000 | 248 | 2000 |
| Scheduling real-time mixed-criticality jobs S Baruah, V Bonifaci, G d'Angelo, H Li, A Marchetti-Spaccamela, ... IEEE Transactions on Computers 61 (8), 1140-1152, 2011 | 227 | 2011 |
| Incremental algorithms for minimal length paths G Ausiello, GF Italiano, AM Spaccamela, U Nanni Journal of Algorithms 12 (4), 615-638, 1991 | 222 | 1991 |
| A generalized parallel task model for recurrent real-time processes S Baruah, V Bonifaci, A Marchetti-Spaccamela, L Stougie, A Wiese 2012 IEEE 33rd Real-Time Systems Symposium, 63-72, 2012 | 172 | 2012 |
| Mixed-criticality scheduling of sporadic task systems SK Baruah, V Bonifaci, G d’Angelo, A Marchetti-Spaccamela, ... European Symposium on Algorithms, 555-566, 2011 | 168 | 2011 |
| The complexity of existential quantification in concept languages FM Donini, M Lenzerini, D Nardi, B Hollunder, W Nutt, AM Spaccamela Artificial Intelligence 53 (2-3), 309-327, 1992 | 161 | 1992 |
| Stochastic on-line knapsack problems A Marchetti-Spaccamela, C Vercellis Mathematical Programming 68 (1), 73-104, 1995 | 148 | 1995 |
| Feasibility analysis in the sporadic dag task model V Bonifaci, A Marchetti-Spaccamela, S Stiller, A Wiese 2013 25th Euromicro conference on real-time systems, 225-233, 2013 | 140 | 2013 |
| A probabilistic analysis of multidimensional bin packing problems RM Karp, M Luby, A Marchetti-Spaccamela Proceedings of the sixteenth annual ACM symposium on Theory of computing …, 1984 | 128 | 1984 |
| Modes and cuts in metabolic networks: Complexity and algorithms MF Acuna Vicente, Chierichietti Flavio, Marchetti, L Stougie Biosystems 95, 51-60, 2009 | 120 | 2009 |
| Semidynamic algorithms for maintaining single-source shortest path trees D Frigioni, A Marchetti-Spaccamela, U Nanni Algorithmica 22 (3), 250-274, 1998 | 93 | 1998 |
| Average-case and smoothed competitive analysis of the multilevel feedback algorithm L Becchetti, S Leonardi, A Marchetti-Spaccamela, G Schäfer, T Vredeveld Mathematics of Operations Research 31 (1), 85-108, 2006 | 91 | 2006 |
| Response-time analysis of conditional dag tasks in multiprocessor systems A Melani, M Bertogna, V Bonifaci, A Marchetti-Spaccamela, GC Buttazzo 2015 27th Euromicro Conference on Real-Time Systems, 211-221, 2015 | 87 | 2015 |
| On the complexity of the regenerator placement problem in optical networks M Flammini, A Marchetti-Spaccamela, G Monaco, L Moscardelli, S Zaks IEEE/ACM Transactions on Networking 19 (2), 498-511, 2010 | 87 | 2010 |
| Fully dynamic output bounded single source shortest path problem D Frigioniyz, A Marchetti-Spaccamelaz, U Nanniz | 87 | 1996 |
| Fully dynamic shortest paths in digraphs with arbitrary arc weights D Frigioni, A Marchetti-Spaccamela, U Nanni Journal of Algorithms 49 (1), 86-113, 2003 | 75* | 2003 |
Leen StougieSenior Researcher CWI, Prof. of Operations Research Vrije Universiteit, AmsterdamVerified email at cwi.nl
