dblp.uni-trier.dewww.uni-trier.de

Alberto Marchetti-Spaccamela Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo
Home Page

*2009
109EESusanne Albers, Alberto Marchetti-Spaccamela, Yossi Matias, Sotiris E. Nikoletseas, Wolfgang Thomas: Automata, Languages and Programming, 36th International Colloquium, ICALP 2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part I Springer 2009
108EESusanne Albers, Alberto Marchetti-Spaccamela, Yossi Matias, Sotiris E. Nikoletseas, Wolfgang Thomas: Automata, Languages and Programming, 36th Internatilonal Collogquium, ICALP 2009, Rhodes, greece, July 5-12, 2009, Proceedings, Part II Springer 2009
107EEMichele 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
106EEHo-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
105EEHo-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)
104EEPeter 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)
103EEJosep Díaz, Fabrizio Grandoni, Alberto Marchetti-Spaccamela: Balanced cut approximation in random geometric graphs. Theor. Comput. Sci. 410(27-29): 2725-2731 (2009)
2008
102EEVincenzo Bonifaci, Peter Korteweg, Alberto Marchetti-Spaccamela, Leen Stougie: The Distributed Wireless Gathering Problem. AAIM 2008: 72-83
101EEVincenzo Bonifaci, Peter Korteweg, Alberto Marchetti-Spaccamela, Leen Stougie: Minimizing Average Flow Time in Sensor Data Gathering. ALGOSENSORS 2008: 18-29
100EEVincenzo Bonifaci, Alberto Marchetti-Spaccamela, Sebastian Stiller: A Constant-Approximate Feasibility Test for Multiprocessor Real-Time Scheduling. ESA 2008: 210-221
99EELuca Becchetti, Ugo Maria Colesanti, Alberto Marchetti-Spaccamela, Andrea Vitaletti: Self-Adaptive Recommendation Systems: Models and Experimental Analysis. SASO 2008: 479-480
98EEVincenzo Bonifaci, Peter Korteweg, Alberto Marchetti-Spaccamela: Minimizing Flow Time in the Wireless Gathering Problem. STACS 2008: 109-120
97EELudovic 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
96EELuca Becchetti, Stefano Leonardi, Alberto Marchetti-Spaccamela, Kirk Pruhs: Flow Time Minimization. Encyclopedia of Algorithms 2008
95EEVincenzo Bonifaci, Peter Korteweg, Alberto Marchetti-Spaccamela, Leen Stougie: Minimizing Flow Time in the Wireless Gathering Problem CoRR abs/0802.2836: (2008)
94EEVincenzo Bonifaci, Peter Korteweg, Alberto Marchetti-Spaccamela, Leen Stougie: An approximation algorithm for the wireless gathering problem. Oper. Res. Lett. 36(5): 605-608 (2008)
2007
93EEPeter Korteweg, Alberto Marchetti-Spaccamela, Leen Stougie, Andrea Vitaletti: Data Aggregation in Sensor Networks: Balancing Communication and Delay Costs. SIROCCO 2007: 139-150
2006
92EELuca Becchetti, Peter Korteweg, Alberto Marchetti-Spaccamela, Martin Skutella, Leen Stougie, Andrea Vitaletti: Latency Constrained Aggregation in Sensor Networks. ESA 2006: 88-99
91EEJosep Díaz, Fabrizio Grandoni, Alberto Marchetti-Spaccamela: Balanced Cut Approximation in Random Geometric Graphs. ISAAC 2006: 527-536
90EELuciana S. Buriol, Gereon Frahling, Stefano Leonardi, Alberto Marchetti-Spaccamela, Christian Sohler: Counting triangles in data streams. PODS 2006: 253-262
89EEVincenzo Bonifaci, Peter Korteweg, Alberto Marchetti-Spaccamela, Leen Stougie: An Approximation Algorithm for the Wireless Gathering Problem. SWAT 2006: 328-338
88EEGiuseppe F. Italiano, Alberto Marchetti-Spaccamela: Preface. J. Discrete Algorithms 4(3): 337-338 (2006)
87EELuca Becchetti, Stefano Leonardi, Alberto Marchetti-Spaccamela, Kirk Pruhs: Online weighted flow time and deadline scheduling. J. Discrete Algorithms 4(3): 339-352 (2006)
86EELuca 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)
2005
85EELuca 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
84EESven 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
83EELuca 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)
2004
82EEStefano Leonardi, Alberto Marchetti-Spaccamela, Friedhelm Meyer auf der Heide: Scheduling against an adversarial network. SPAA 2004: 151-159
81EELuca Becchetti, Miriam Di Ianni, Alberto Marchetti-Spaccamela: Approximating call-scheduling makespan in all-optical networks. J. Discrete Algorithms 2(4): 501-515 (2004)
80EELuca Becchetti, Stefano Leonardi, Alberto Marchetti-Spaccamela, Kirk Pruhs: Semi-clairvoyant scheduling. Theor. Comput. Sci. 324(2-3): 325-335 (2004)
2003
79EELuca Becchetti, Stefano Leonardi, Alberto Marchetti-Spaccamela, Kirk Pruhs: Semi-clairvoyant Scheduling. ESA 2003: 67-77
78EELuca 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
77EELuca Becchetti, Stefano Leonardi, Alberto Marchetti-Spaccamela, Guido Schäfer: Scheduling to Minimize Flow Time Metrics. IPDPS 2003: 223
76EEMaurizio A. Bonuccelli, Alberto Marchetti-Spaccamela: Foreword. Discrete Applied Mathematics 129(1): 1 (2003)
75EEDaniele Frigioni, Alberto Marchetti-Spaccamela, Umberto Nanni: Fully dynamic shortest paths in digraphs with arbitrary arc weights. J. Algorithms 49(1): 86-113 (2003)
2002
74EESven 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
73EELuca 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
72 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)
2001
71 Gerth Stølting Brodal, Daniele Frigioni, Alberto Marchetti-Spaccamela: Algorithm Engineering, 5th International Workshop, WAE 2001 Aarhus, Denmark, August 28-31, 2001, Proceedings Springer 2001
70EELuca Becchetti, Stefano Leonardi, Alberto Marchetti-Spaccamela, Kirk Pruhs: Online Weighted Flow Time and Deadline Scheduling. RANDOM-APPROX 2001: 36-47
69EEJean-Claude Bermond, Xavier Muñoz, Alberto Marchetti-Spaccamela: A Broadcasting Protocol in Line Digraphs. J. Parallel Distrib. Comput. 61(8): 1013-1032 (2001)
68EEStefano Leonardi, Alberto Marchetti-Spaccamela, Alessio Presciutti, Adi Rosén: On-line Randomized Call Control Revisited . SIAM J. Comput. 31(1): 86-112 (2001)
67EEDaniele Frigioni, Alberto Marchetti-Spaccamela, Umberto Nanni: Dynamic algorithms for classes of constraint satisfaction problems. Theor. Comput. Sci. 259(1-2): 287-305 (2001)
66EEStefano Leonardi, Alberto Marchetti-Spaccamela: Preface. Theor. Comput. Sci. 268(1): 1 (2001)
2000
65EECamil 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
64EEGiorgio Ausiello, Stefano Leonardi, Alberto Marchetti-Spaccamela: On Salesmen, Repairmen, Spiders, and Other Traveling Agents. CIAC 2000: 1-16
63EEGiovanna Melideo, Marco Mechelli, Roberto Baldoni, Alberto Marchetti-Spaccamela: Timestamping Algorithms: A Characterization and a Few Properties. Euro-Par 2000: 609-616
62EEStefano Leonardi, Alberto Marchetti-Spaccamela, Andrea Vitaletti: Approximation Algorithms for Bandwidth and Storage Allocation Problems under Real Time Constraints. FSTTCS 2000: 409-420
61EELuca Becchetti, Miriam Di Ianni, Alberto Marchetti-Spaccamela: Approximating Call-Scheduling Makespan in All-Optical Networks. WG 2000: 13-22
60 Daniele Frigioni, Alberto Marchetti-Spaccamela, Umberto Nanni: Fully Dynamic Algorithms for Maintaining Shortest Paths Trees. J. Algorithms 34(2): 251-281 (2000)
59EEYair Bartal, Stefano Leonardi, Alberto Marchetti-Spaccamela, Jiri Sgall, Leen Stougie: Multiprocessor Scheduling with Rejection. SIAM J. Discrete Math. 13(1): 64-78 (2000)
1999
58EELuca Becchetti, Miriam Di Ianni, Alberto Marchetti-Spaccamela: Approximation Algorithms for Routing and Call Scheduling in All-Optical Chains and Rings. FSTTCS 1999: 201-212
57EEPierpaolo 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)
56EEStefano Leonardi, Alberto Marchetti-Spaccamela: On-Line Resource Management with Application to Routing and Scheduling. Algorithmica 24(1): 29-49 (1999)
1998
55EEDaniele Frigioni, Alberto Marchetti-Spaccamela, Umberto Nanni: Fully Dynamic Shortest Paths and Negative Cycles Detection on Digraphs with Arbitrary Arc Weights. ESA 1998: 320-331
54 Stefano Leonardi, Alberto Marchetti-Spaccamela, Alessio Presciutti, Adi Rosén: On-line Randomized Call Control Revisited. SODA 1998: 323-332
53EEAlberto Marchetti-Spaccamela: On-Line Routing Problems for Broadband Networks. SOFSEM 1998: 167
52EEDaniele Frigioni, Alberto Marchetti-Spaccamela, Umberto Nanni: Semidynamic Algorithms for Maintaining Single-Source Shortest Path Trees. Algorithmica 22(3): 250-274 (1998)
51 Michele Flammini, Jan van Leeuwen, Alberto Marchetti-Spaccamela: The Complexity of Interval Routing on Random Graphs. Comput. J. 41(1): 16-25 (1998)
50EEEsteban Feuerstein, Stefano Leonardi, Alberto Marchetti-Spaccamela, Nicola Santoro: Efficient Token-Based Control in Rings. Inf. Process. Lett. 66(4): 175-180 (1998)
49EEEsteban Feuerstein, Alberto Marchetti-Spaccamela: Memory Paging for Connectivity and Path Problems in Graphs. J. Graph Algorithms Appl. 2(2): (1998)
1997
48 Fabrizio d'Amore, Paolo Giulio Franciosa, Alberto Marchetti-Spaccamela: Graph-Theoretic Concepts in Computer Science, 22nd International Workshop, WG '96, Cadenabbia (Como), Italy, June 12-14, 1996, Proceedings Springer 1997
47 Pierpaolo Degano, Roberto Gorrieri, Alberto Marchetti-Spaccamela: Automata, Languages and Programming, 24th International Colloquium, ICALP'97, Bologna, Italy, 7-11 July 1997, Proceedings Springer 1997
46EEFabrizio 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
1996
45EEJean-Claude Bermond, Xavier Muñoz, Alberto Marchetti-Spaccamela: Induced Broadcasting Algorithms in Iterated Line Digraphs. Euro-Par, Vol. I 1996: 313-324
44 Esteban Feuerstein, Stefano Leonardi, Alberto Marchetti-Spaccamela, Nicola Santoro: Efficient Token-Based Control in Rings (Abstract). PODC 1996: 154
43 Daniele Frigioni, Alberto Marchetti-Spaccamela, Umberto Nanni: Fully Dynamic Output Bounded Single Source Shortest Path Problem (Extended Abstract). SODA 1996: 212-221
42 Yair Bartal, Stefano Leonardi, Alberto Marchetti-Spaccamela, Jiri Sgall, Leen Stougie: Multiprocessor Scheduling with Rejection. SODA 1996: 95-103
41 Paola Alimonti, Stefano Leonardi, Alberto Marchetti-Spaccamela: Average Case Analysis of Fully Dynamic Reachability for Directed Graphs. ITA 30(4): 305-318 (1996)
40EEAlberto Marchetti-Spaccamela, Umberto Nanni, Hans Rohnert: Maintaining a Topological Order Under Edge Insertions. Inf. Process. Lett. 59(1): 53-58 (1996)
1995
39EEStefano Leonardi, Alberto Marchetti-Spaccamela: On-line Resource Management with Applications to Routing and Scheduling. ICALP 1995: 303-314
38EEMichele Flammini, Jan van Leeuwen, Alberto Marchetti-Spaccamela: The Complexity of Interval Routing on Random Graphs. MFCS 1995: 37-49
37 Alberto Marchetti-Spaccamela, Carlo Vercellis: Stochastic on-line knapsack problems. Math. Program. 68: 73-104 (1995)
1994
36EEDaniele Frigioni, Alberto Marchetti-Spaccamela, Umberto Nanni: Dynamization of Backtrack-Free Search for the Constraint Satisfaction Problem. CIAC 1994: 136-151
35EEDaniele Frigioni, Alberto Marchetti-Spaccamela, Umberto Nanni: Incremental Algorithms for the Single-Source Shortest Path Problem. FSTTCS 1994: 113-124
34 Ludek Kucera, Alberto Marchetti-Spaccamela, Marco Protasi: On Learning Monotone DNF Formulae under Uniform Distributions Inf. Comput. 110(1): 84-95 (1994)
1993
33EEEsteban Feuerstein, Alberto Marchetti-Spaccamela: Memory Paging for Connectivity and Path Problems in Graphs. ISAAC 1993: 416-425
32EEAlberto Marchetti-Spaccamela, Umberto Nanni, Hans Rohnert: On-line Graph Algorithms for Incremental Compilation. WG 1993: 70-86
31EEPaola Alimonti, Stefano Leonardi, Alberto Marchetti-Spaccamela, Xavier Messeguer: Average Case Analysis of Fully Dynamic Connectivity for Directed Graphs. WG 1993: 87-98
30 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)
1992
29EEMichele Flammini, Alberto Marchetti-Spaccamela, Ludek Kucera: Learning DNF Formulae Under Classes of Probability Distributions. COLT 1992: 85-92
28 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)
27 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)
1991
26 Fabrizio d'Amore, Alberto Marchetti-Spaccamela, Umberto Nanni: Competitive Algorithms for the Weighted List Update Problem. WADS 1991: 240-248
25EEEsteban Feuerstein, Alberto Marchetti-Spaccamela: Dynamic Algorithms for Shortest Paths in Planar Graphs. WG 1991: 187-197
24 Giorgio Ausiello, Giuseppe F. Italiano, Alberto Marchetti-Spaccamela, Umberto Nanni: Incremental Algorithms for Minimal Length Paths. J. Algorithms 12(4): 615-638 (1991)
23 Alberto Marchetti-Spaccamela, Antonella Pelaggi, Domenico Saccà: Comparison of Methods for Logic-Query Implementation. J. Log. Program. 10(1/2/3&4): 333-360 (1991)
1990
22 Giorgio Ausiello, Giuseppe F. Italiano, Alberto Marchetti-Spaccamela, Umberto Nanni: Incremental Algorithms for Minimal Length Paths. SODA 1990: 12-21
1989
21 Alberto Marchetti-Spaccamela, Marco Protasi: Learning Under Uniform Distribution. FCT 1989: 327-338
20 Giuseppe F. Italiano, Alberto Marchetti-Spaccamela, Umberto Nanni: Dynamic Data Structures for Series Parallel Digraphs (Preliminary Version). WADS 1989: 352-372
1988
19EELudek Kucera, Alberto Marchetti-Spaccamela, Marco Protasi: On the Learnability of DNF Formulae. ICALP 1988: 347-361
18 Giorgio Ausiello, Alberto Marchetti-Spaccamela, Umberto Nanni: Dynamic Maintenance of Paths and Path Expressions on Graphs. ISSAC 1988: 1-12
17EEAlberto Marchetti-Spaccamela: On the Estimate of a Directed Graph. WG 1988: 317-326
1987
16EEAlberto Marchetti-Spaccamela, Carlo Vercellis: Efficient On-Line Algorithms for the Knapsack Problem (Extended Abstract). ICALP 1987: 445-456
15EEAlberto Marchetti-Spaccamela, Antonella Pelaggi, Domenico Saccà: Worst-case Complexity Analysis of Methods for Logic Query Implementation. PODS 1987: 294-301
14 Alberto Marchetti-Spaccamela, Antonella Pelaggi: Worst Case Analysis of Two Heuristics for The Set Partitioning Problem. ITA 21(1): 11-23 (1987)
13 Alberto Marchetti-Spaccamela: New Protocols for the Election of a Leader in a Ring. Theor. Comput. Sci. 54: 53-64 (1987)
1986
12EELudek Kucera, Alberto Marchetti-Spaccamela, Marco Protasi, Maurizio Talamo: Near Optimal Algorithms for Finding Minimum Steiner Trees on Random Graphs. MFCS 1986: 501-511
1985
11EEAlberto Marchetti-Spaccamela: New Protocols for the Election od a Leader in a Ring. FSTTCS 1985: 101-115
10 Alberto Marchetti-Spaccamela, G. Romano: On Different Approximation Criteria for Subset Product Problems. Inf. Process. Lett. 21(4): 213-218 (1985)
1984
9 Richard M. Karp, Michael Luby, Alberto Marchetti-Spaccamela: A Probabilistic Analysis of Multidimensional Bin Packing Problems STOC 1984: 289-298
8 Andrew V. Goldberg, Alberto Marchetti-Spaccamela: On Finding the Exact Solution of a Zero-One Knapsack Problem STOC 1984: 359-368
1983
7EEAlberto Marchetti-Spaccamela, Maurizio Talamo: Probabilistic Analysis of Graph Colouring Algorithms. CAAP 1983: 332-340
6 Alberto Marchetti-Spaccamela, Maurizio Talamo: Probabilistic Analysis of Two Euclidean Location Problems. ITA 17(4): 387-395 (1983)
5 Alberto Marchetti-Spaccamela, Marco Protasi: The Largest Tree in a Random Graph. Theor. Comput. Sci. 23: 273-286 (1983)
1982
4 Paola Bertolazzi, M. Lucertini, Alberto Marchetti-Spaccamela: Analysis of a Class of Graph Partitioning Problems. ITA 16(3): 255-261 (1982)
1981
3EEGiorgio Ausiello, Alberto Marchetti-Spaccamela, Marco Protasi: Full Approximatibility of a Class of Problems over Power Sets. CAAP 1981: 76-87
2 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
1980
1 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)

Coauthor Index

1Vicente Acuña [97]
2Susanne Albers [108] [109]
3Paola Alimonti [31] [41]
4Giorgio Ausiello [1] [2] [3] [18] [22] [24] [27] [64]
5Roberto Baldoni [63]
6Yair Bartal [42] [59]
7Luca Becchetti [46] [58] [61] [70] [72] [73] [77] [78] [79] [80] [81] [83] [85] [86] [87] [92] [96] [99]
8Jean-Claude Bermond [45] [69]
9Paola Bertolazzi [4]
10Sergei L. Bezrukov [46]
11Vincenzo Bonifaci [89] [94] [95] [98] [100] [101] [102]
12Maurizio A. Bonuccelli [76]
13Gerth Stølting Brodal [71]
14Luciana S. Buriol [90]
15Ho-Leung Chan [105] [106]
16Ugo Maria Colesanti [99]
17Ludovic Cottret [97]
18Pierpaolo Degano [47] [57]
19Camil Demetrescu [65]
20Josep Díaz [91] [103]
21Suhas N. Diggavi [73] [83]
22Francesco M. Donini [28]
23Jeff Edmonds [105] [106]
24Esteban Feuerstein [25] [33] [44] [49] [50]
25Michele Flammini [29] [38] [51] [107]
26Gereon Frahling [90]
27Paolo Giulio Franciosa [48]
28Daniele Frigioni [35] [36] [43] [52] [55] [60] [65] [67] [71] [75]
29Andrew V. Goldberg [8]
30Roberto Gorrieri [47] [57]
31Fabrizio Grandoni [91] [103]
32Friedhelm Meyer auf der Heide [82]
33Bernhard Hollunder [28]
34Miriam Di Ianni [58] [61] [72] [81]
35Giuseppe F. Italiano [20] [22] [24] [27] [88]
36Richard M. Karp [9]
37Peter Korteweg [89] [92] [93] [94] [95] [98] [101] [102] [104]
38Sven Oliver Krumke [74] [84]
39Ludek Kucera [12] [19] [29] [34]
40Tak Wah Lam [105] [106]
41Luigi Laura [74]
42Lap-Kei Lee [105] [106]
43Jan van Leeuwen [38] [51]
44Maurizio Lenzerini [28]
45Stefano Leonardi [31] [39] [41] [42] [44] [50] [54] [56] [59] [62] [64] [66] [68] [70] [73] [77] [78] [79] [80] [82] [83] [85] [86] [87] [90] [96]
46Maarten Lipmann [74] [84]
47Michael Luby [9]
48M. Lucertini [4]
49Fábio Viduani Martinez [97]
50Yossi Matias [108] [109]
51Marco Mechelli [63]
52Giovanna Melideo [63]
53Xavier Messeguer [31]
54Paulo Vieira Milreu [97]
55Gianpiero Monaco [107]
56Luca Moscardelli [107]
57Xavier Muñoz [45] [69]
58S. Muthukrishnan (S. Muthu Muthukrishnan) [73] [83]
59Thyaga Nandagopal (Thyagarajan Nandagopal) [73] [83]
60Umberto Nanni [18] [20] [22] [24] [26] [27] [30] [32] [35] [36] [40] [43] [52] [55] [60] [65] [67] [75]
61Daniele Nardi [28]
62Sotiris E. Nikoletseas [108] [109]
63Werner Nutt [28]
64M. Ottaviani [46]
65Willem de Paepe [74] [84]
66Antonella Pelaggi [14] [15] [23]
67Diana Poensgen [74] [84]
68Robert Preis [46]
69Alessio Presciutti [54] [68]
70Marco Protasi [1] [2] [3] [5] [12] [19] [21] [34]
71Kirk Pruhs [70] [79] [80] [87] [96] [105] [106]
72Hans Rohnert [32] [40]
73G. Romano [10]
74Adi Rosén [54] [68]
75Markus Röttger [46]
76Domenico Saccà [15] [23]
77Marie-France Sagot [97]
78Nicola Santoro [44] [50]
79Guido Schäfer [77] [78] [85] [86]
80Ulf-Peter Schroeder [46]
81Jiri Sgall [42] [59]
82Martin Skutella [92]
83Christian Sohler [90]
84Sebastian Stiller [100]
85Leen Stougie [42] [59] [74] [84] [89] [92] [93] [94] [95] [97] [101] [102] [104]
86Maurizio Talamo [6] [7] [12]
87Wolfgang Thomas [108] [109]
88Carlo Vercellis [16] [37]
89Andrea Vitaletti [62] [73] [83] [92] [93] [99] [104]
90Tjark Vredeveld [78] [85] [86]
91Peter Wegner [57]
92Shmuel Zaks [107]
93Fabrizio d'Amore [26] [30] [46] [48]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)