Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Stefano Leonardi
2010 – today
- 2013
[j40]Fabrizio Grandoni, Anupam Gupta, Stefano Leonardi, Pauli Miettinen, Piotr Sankowski, Mohit Singh: Set Covering with Our Eyes Closed. SIAM J. Comput. 42(3): 808-830 (2013)- [c66]Aris Anagnostopoulos, Fabrizio Grandoni, Stefano Leonardi, Andreas Wiese: Constant Integrality Gap LP Formulations of Unsplittable Flow on a Path. IPCO 2013: 25-36
- [c65]Sayan Bhattacharya, Elias Koutsoupias, Janardhan Kulkarni, Stefano Leonardi, Tim Roughgarden, Xiaoming Xu: Near-optimal multi-unit auctions with ordered bidders. ACM Conference on Electronic Commerce 2013: 91-102
- [e7]Stefano Leonardi, Alessandro Panconesi, Paolo Ferragina, Aristides Gionis (Eds.): Sixth ACM International Conference on Web Search and Data Mining, WSDM 2013, Rome, Italy, February 4-8, 2013. ACM 2013, ISBN 978-1-4503-1869-3
- 2012
- [j39]Alexander Kesselman, Stefano Leonardi: Game-theoretic analysis of Internet switching with selfish users. Theor. Comput. Sci. 452: 107-116 (2012)
- [c64]Marek Cygan, Fabrizio Grandoni, Stefano Leonardi, Marcin Pilipczuk, Piotr Sankowski: A Path-Decomposition Theorem with Applications to Pricing and Covering on Trees. ESA 2012: 349-360
- [c63]Riccardo Colini-Baldeschi, Monika Henzinger, Stefano Leonardi, Martin Starnberger: On Multiple Keyword Sponsored Search Auctions with Budgets. ICALP (2) 2012: 1-12
- [c62]Michal Feldman, Amos Fiat, Stefano Leonardi, Piotr Sankowski: Revenue maximizing envy-free multi-unit auctions with budgets. ACM Conference on Electronic Commerce 2012: 532-549
- [c61]
- [c60]Aris Anagnostopoulos, Luca Becchetti, Carlos Castillo, Aristides Gionis, Stefano Leonardi: Online team formation in social networks. WWW 2012: 839-848
- [i7]Aris Anagnostopoulos, Fabrizio Grandoni, Stefano Leonardi, Andreas Wiese: A Mazing 2+eps Approximation for Unsplittable Flow on a Path. CoRR abs/1211.2670 (2012)
- [i6]Elias Koutsoupias, Stefano Leonardi, Tim Roughgarden: Near-Optimal Multi-Unit Auctions with Ordered Bidders. CoRR abs/1212.2825 (2012)
- 2011
- [c59]Marek Cygan, Fabrizio Grandoni, Stefano Leonardi, Marcin Mucha, Marcin Pilipczuk, Piotr Sankowski: Approximation Algorithms for Union and Intersection Covering Problems. FSTTCS 2011: 28-40
- [c58]Amos Fiat, Stefano Leonardi, Jared Saia, Piotr Sankowski: Single valued combinatorial auctions with budgets. ACM Conference on Electronic Commerce 2011: 223-232
- [c57]Aris Anagnostopoulos, Luca Becchetti, Stefano Leonardi, Ida Mele, Piotr Sankowski: Stochastic query covering. WSDM 2011: 725-734
- [i5]Marek Cygan, Fabrizio Grandoni, Stefano Leonardi, Marcin Mucha, Marcin Pilipczuk, Piotr Sankowski: Approximation Algorithms for Union and Intersection Covering Problems. CoRR abs/1102.5105 (2011)
- [i4]Riccardo Colini-Baldeschi, Stefano Leonardi, Guido Schäfer: Multi-Unit Auction with Diminishing Marginal Valuations and Capacities. CoRR abs/1108.6033 (2011)
- [i3]Riccardo Colini-Baldeschi, Monika Henzinger, Stefano Leonardi, Martin Starnberger: On Multiple Round Sponsored Search Auctions with Budgets. CoRR abs/1112.6361 (2011)
- 2010
- [j38]Lisa Fleischer, Jochen Könemann, Stefano Leonardi, Guido Schäfer: Strict Cost Sharing Schemes for Steiner Forest. SIAM J. Comput. 39(8): 3616-3632 (2010)
- [j37]Luca Becchetti, Ilaria Bordino, Stefano Leonardi, Adi Rosén: Fully decentralized computation of aggregates over data streams. SIGKDD Explorations 12(2): 83-91 (2010)
- [c56]Aris Anagnostopoulos, Luca Becchetti, Carlos Castillo, Aristides Gionis, Stefano Leonardi: Power in unity: forming teams in large-scale community systems. CIKM 2010: 599-608
- [c55]Aris Anagnostopoulos, Fabrizio Grandoni, Stefano Leonardi, Piotr Sankowski: Online Network Design with Outliers. ICALP (1) 2010: 114-126
- [c54]Fabrizio Grandoni, Piotr Krysta, Stefano Leonardi, Carmine Ventre: Utilitarian Mechanism Design for Multi-Objective Optimization. SODA 2010: 573-584
- [i2]Amos Fiat, Stefano Leonardi, Jared Saia, Piotr Sankowski: Combinatorial Auctions with Budgets. CoRR abs/1001.1686 (2010)
2000 – 2009
- 2009
- [e6]Stefano Leonardi (Ed.): Internet and Network Economics, 5th International Workshop, WINE 2009, Rome, Italy, December 14-18, 2009. Proceedings. Lecture Notes in Computer Science 5929, Springer 2009, ISBN 978-3-642-10840-2
- 2008
- [j36]Jochen Könemann, Stefano Leonardi, Guido Schäfer, Stefan H. M. van Zwam: A Group-Strategyproof Cost Sharing Mechanism for the Steiner Forest Game. SIAM J. Comput. 37(5): 1319-1341 (2008)
- [j35]Luca Becchetti, Carlos Castillo, Debora Donato, Ricardo A. Baeza-Yates, Stefano Leonardi: Link analysis for Web spam detection. TWEB 2(1) (2008)
- [c53]Fabrizio Grandoni, Anupam Gupta, Stefano Leonardi, Pauli Miettinen, Piotr Sankowski, Mohit Singh: Set Covering with our Eyes Closed. FOCS 2008: 347-356
- [c52]Ilaria Bordino, Debora Donato, Aristides Gionis, Stefano Leonardi: Mining Large Networks with Subgraph Counting. ICDM 2008: 737-742
- [c51]Naveen Garg, Anupam Gupta, Stefano Leonardi, Piotr Sankowski: Stochastic analyses for online combinatorial optimization problems. SODA 2008: 942-951
- [r1]Luca Becchetti, Stefano Leonardi, Alberto Marchetti-Spaccamela, Kirk Pruhs: Flow Time Minimization. Encyclopedia of Algorithms 2008
- 2007
- [j34]Debora Donato, Stefano Leonardi, Panayiotis Tsaparas: Stability and Similarity of Link Analysis Ranking Algorithms. Internet Mathematics 3(4): 479-507 (2007)
- [j33]Stefano Leonardi, Danny Raz: Approximating total flow time on parallel machines. J. Comput. Syst. Sci. 73(6): 875-891 (2007)
- [j32]Roee Engelberg, Jochen Könemann, Stefano Leonardi, Joseph Naor: Cut problems in graphs with a budget constraint. J. Discrete Algorithms 5(2): 262-279 (2007)
- [j31]Luca Becchetti, Jochen Könemann, Stefano Leonardi, Martin Pál: Sharing the cost more efficiently: Improved approximation for multicommodity rent-or-buy. ACM Transactions on Algorithms 3(2) (2007)
- [j30]Debora Donato, Luigi Laura, Stefano Leonardi, Stefano Millozzi: The Web as a graph: How far we are. ACM Trans. Internet Techn. 7(1) (2007)
- [c50]Debora Donato, Mario Paniccia, Maddalena Selis, Carlos Castillo, Giovanni Cortese, Stefano Leonardi: New Metrics for Reputation Management in P2P Networks. AIRWeb 2007
- [c49]Vineet Goyal, Anupam Gupta, Stefano Leonardi, R. Ravi: Pricing Tree Access Networks with Connected Backbones. ESA 2007: 498-509
- [c48]Luciana S. Buriol, Gereon Frahling, Stefano Leonardi, Christian Sohler: Estimating Clustering Indexes in Data Streams. ESA 2007: 618-632
- [c47]Stefano Leonardi, Piotr Sankowski: Network formation games with local coalitions. PODC 2007: 299-305
- [c46]Anupam Gupta, Jochen Könemann, Stefano Leonardi, R. Ravi, Guido Schäfer: An efficient cost-sharing mechanism for the prize-collecting Steiner forest problem. SODA 2007: 1153-1162
- 2006
- [j29]Luca Becchetti, Stefano Leonardi, Alberto Marchetti-Spaccamela, Kirk Pruhs: Online weighted flow time and deadline scheduling. J. Discrete Algorithms 4(3): 339-352 (2006)
- [j28]Debora Donato, Luigi Laura, Stefano Leonardi, Ulrich Meyer, Stefano Millozzi, Jop F. Sibeyn: Algorithms and Experiments for the Webgraph. J. Graph Algorithms Appl. 10(2): 219-236 (2006)
- [j27]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)
- [j26]Giuseppe F. Italiano, Stefano Leonardi, Gianpaolo Oriolo: Design of trees in the hose model: The balanced case. Oper. Res. Lett. 34(6): 601-606 (2006)
- [j25]Yair Bartal, Amos Fiat, Stefano Leonardi: Lower Bounds for On-line Graph Problems with Application to On-line Circuit and Optical Routing. SIAM J. Comput. 36(2): 354-393 (2006)
- [j24]Carlos Castillo, Debora Donato, Luca Becchetti, Paolo Boldi, Stefano Leonardi, Massimo Santini, Sebastiano Vigna: A reference collection for web spam. SIGIR Forum 40(2): 11-24 (2006)
- [c45]Luca Becchetti, Carlos Castillo, Debora Donato, Stefano Leonardi, Ricardo A. Baeza-Yates: Link-Based Characterization and Detection of Web Spam. AIRWeb 2006: 1-8
- [c44]Yair Bartal, Stefano Leonardi, Gil Shallom, René Sitters: On the Value of Preemption in Scheduling. APPROX-RANDOM 2006: 39-48
- [c43]Roee Engelberg, Jochen Könemann, Stefano Leonardi, Joseph Naor: Cut Problems in Graphs with a Budget Constraint. LATIN 2006: 435-446
- [c42]Luciana S. Buriol, Gereon Frahling, Stefano Leonardi, Alberto Marchetti-Spaccamela, Christian Sohler: Counting triangles in data streams. PODS 2006: 253-262
- [c41]Lisa Fleischer, Jochen Könemann, Stefano Leonardi, Guido Schäfer: Simple cost sharing schemes for multicommodity rent-or-buy and stochastic Steiner tree. STOC 2006: 663-670
- [c40]Luciana S. Buriol, Carlos Castillo, Debora Donato, Stefano Leonardi, Stefano Millozzi: Temporal Analysis of the Wikigraph. Web Intelligence 2006: 45-51
- [e5]Stefano Leonardi, Friedhelm Meyer auf der Heide, Dorothea Wagner (Eds.): Algorithmic Aspects of Large and Complex Networks, 4.-9. September 2005. Dagstuhl Seminar Proceedings 05361, Internationales Begegnungs- und Forschungszentrum für Informatik (IBFI), Schloss Dagstuhl, Germany 2006
- [i1]Andrea Capocci, Vito Domenico Pietro Servedio, Francesca Colaiori, Luciana S. Buriol, Debora Donato, Stefano Leonardi, Guido Caldarelli: Preferential attachment in the growth of social networks: the case of Wikipedia. CoRR abs/physics/0602026 (2006)
- 2005
- [j23]Dimitris Achlioptas, Stefano Leonardi: Special Issue on Algorithms and Models for the Web-Graph. Internet Mathematics 2(3): 249 (2005)
- [j22]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)
- [c39]Özalp Babaoglu, Márk Jelasity, Alberto Montresor, Christof Fetzer, Stefano Leonardi, Aad P. A. van Moorsel: The Self-Star Vision. Self-star Properties in Complex Information Systems 2005: 1-20
- [c38]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
- [c37]Stefano Leonardi, Friedhelm Meyer auf der Heide, Dorothea Wagner: 05361 Abstracts Collection - Algorithmic Aspects of Large and Complex Networks. Algorithmic Aspects of Large and Complex Networks 2005
- [c36]Debora Donato, Stefano Leonardi, Panayiotis Tsaparas: Stability and Similarity of Link Analysis Ranking Algorithms. ICALP 2005: 717-729
- [c35]Jochen Könemann, Stefano Leonardi, Guido Schäfer, Stefan H. M. van Zwam: From Primal-Dual to Cost Shares and Back: A Stronger LP Relaxation for the Steiner Forest Problem. ICALP 2005: 930-942
- [c34]Luca Becchetti, Jochen Könemann, Stefano Leonardi, Martin Pál: Sharing the cost more efficiently: improved approximation for multicommodity rent-or-buy. SODA 2005: 375-384
- [c33]Jochen Könemann, Stefano Leonardi, Guido Schäfer: A group-strategyproof mechanism for Steiner forests. SODA 2005: 612-619
- [c32]Debora Donato, Stefano Leonardi, Stefano Millozzi, Panayiotis Tsaparas: Mining the inner structure of the Web graph. WebDB 2005: 145-150
- [c31]Alexander Kesselman, Stefano Leonardi, Vincenzo Bonifaci: Game-Theoretic Analysis of Internet Switching with Selfish Users. WINE 2005: 236-245
- [e4]Özalp Babaoglu, Márk Jelasity, Alberto Montresor, Christof Fetzer, Stefano Leonardi, Aad P. A. van Moorsel, Maarten van Steen (Eds.): Self-star Properties in Complex Information Systems, Conceptual and Practical Foundations [the book is a result from a workshop at Bertinoro, Italy, Summer 2004]. Lecture Notes in Computer Science 3460, Springer 2005, ISBN 3-540-26009-9
- [e3]Gerth Stølting Brodal, Stefano Leonardi (Eds.): Algorithms - ESA 2005, 13th Annual European Symposium, Palma de Mallorca, Spain, October 3-6, 2005, Proceedings. Lecture Notes in Computer Science 3669, Springer 2005, ISBN 3-540-29118-0
- 2004
- [j21]
- [j20]Luca Becchetti, Stefano Leonardi: Nonclairvoyant scheduling to minimize the total flow time on single and parallel machines. J. ACM 51(4): 517-539 (2004)
- [j19]Luca Becchetti, Stefano Leonardi, S. Muthukrishnan: Average stretch without migration. J. Comput. Syst. Sci. 68(1): 80-95 (2004)
- [j18]Luca Becchetti, Stefano Leonardi, Alberto Marchetti-Spaccamela, Kirk Pruhs: Semi-clairvoyant scheduling. Theor. Comput. Sci. 324(2-3): 325-335 (2004)
- [j17]Stefano Leonardi, Guido Schäfer: Cross-monotonic cost sharing methods for connected facility location games. Theor. Comput. Sci. 326(1-3): 431-442 (2004)
- [c30]Stefano Leonardi, Guido Schäfer: Cross-monotonic cost-sharing methods for connected facility location games. ACM Conference on Electronic Commerce 2004: 242-243
- [c29]Stefano Leonardi, Alberto Marchetti-Spaccamela, Friedhelm Meyer auf der Heide: Scheduling against an adversarial network. SPAA 2004: 151-159
- [e2]Stefano Leonardi (Ed.): Algorithms and Models for the Web-Graph: Third International Workshop, WAW 2004, Rome, Italy, October 16, 2004, Proceeedings. Lecture Notes in Computer Science 3243, Springer 2004, ISBN 3-540-23427-6
- 2003
- [j16]Monika Rauch Henzinger, Stefano Leonardi: Scheduling multicasts on unit-capacity trees and meshes. J. Comput. Syst. Sci. 66(3): 567-611 (2003)
- [c28]Luca Becchetti, Stefano Leonardi, Alberto Marchetti-Spaccamela, Kirk Pruhs: Semi-clairvoyant Scheduling. ESA 2003: 67-77
- [c27]Luigi Laura, Stefano Leonardi, Stefano Millozzi, Ulrich Meyer, Jop F. Sibeyn: Algorithms and Experiments for the Webgraph. ESA 2003: 703-714
- [c26]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
- [c25]Luca Becchetti, Stefano Leonardi, Alberto Marchetti-Spaccamela, Guido Schäfer: Scheduling to Minimize Flow Time Metrics. IPDPS 2003: 223
- 2002
- [j15]Baruch Awerbuch, Yossi Azar, Stefano Leonardi, Oded Regev: Minimizing the Flow Time Without Migration. SIAM J. Comput. 31(5): 1370-1382 (2002)
- [c24]Massimiliano Curcio, Stefano Leonardi, Andrea Vitaletti: An Experimental Study of Prefetching and Caching Algorithms for the World Wide Web. ALENEX 2002: 71-85
- [c23]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
- [e1]Klaus Jansen, Stefano Leonardi, Vijay V. Vazirani (Eds.): Approximation Algorithms for Combinatorial Optimization, 5th International Workshop, APPROX 2002, Rome, Italy, September 17-21, 2002, Proceedings. Lecture Notes in Computer Science 2462, Springer 2002, ISBN 3-540-44186-7
- 2001
- [j14]Giorgio Ausiello, Esteban Feuerstein, Stefano Leonardi, Leen Stougie, Maurizio Talamo: Algorithms for the On-Line Travelling Salesman. Algorithmica 29(4): 560-581 (2001)
- [j13]Baruch Awerbuch, Yossi Azar, Amos Fiat, Stefano Leonardi, Adi Rosén: On-Line Competitive Algorithms for Call Admission in Optical Networks. Algorithmica 31(1): 29-43 (2001)
- [j12]Stefano Leonardi, Alberto Marchetti-Spaccamela, Alessio Presciutti, Adi Rosén: On-line Randomized Call Control Revisited . SIAM J. Comput. 31(1): 86-112 (2001)
- [j11]
- [c22]Luca Becchetti, Stefano Leonardi, Alberto Marchetti-Spaccamela, Kirk Pruhs: Online Weighted Flow Time and Deadline Scheduling. RANDOM-APPROX 2001: 36-47
- [c21]Luca Becchetti, Stefano Leonardi: Non-clairvoyant scheduling to minimize the average flow time on single and parallel machines. STOC 2001: 94-103
- 2000
- [j10]Susanne Albers, Naveen Garg, Stefano Leonardi: Minimizing stall time in single and parallel disk systems. J. ACM 47(6): 969-986 (2000)
- [j9]Yair Bartal, Stefano Leonardi, Alberto Marchetti-Spaccamela, Jiri Sgall, Leen Stougie: Multiprocessor Scheduling with Rejection. SIAM J. Discrete Math. 13(1): 64-78 (2000)
- [c20]Giorgio Ausiello, Stefano Leonardi, Alberto Marchetti-Spaccamela: On Salesmen, Repairmen, Spiders, and Other Traveling Agents. CIAC 2000: 1-16
- [c19]Stefano Leonardi, Alberto Marchetti-Spaccamela, Andrea Vitaletti: Approximation Algorithms for Bandwidth and Storage Allocation Problems under Real Time Constraints. FSTTCS 2000: 409-420
- [c18]Luca Becchetti, Stefano Leonardi, S. Muthukrishnan: Scheduling to minimize average stretch without migration. SODA 2000: 548-557
1990 – 1999
- 1999
- [j8]Stefano Leonardi, Alberto Marchetti-Spaccamela: On-Line Resource Management with Application to Routing and Scheduling. Algorithmica 24(1): 29-49 (1999)
- [j7]Yossi Azar, Yair Bartal, Esteban Feuerstein, Amos Fiat, Stefano Leonardi, Adi Rosén: On Capital Investment. Algorithmica 25(1): 22-36 (1999)
- [j6]
- [j5]Yair Bartal, Stefano Leonardi: On-Line Routing in All-Optical Networks. Theor. Comput. Sci. 221(1-2): 19-39 (1999)
- [c17]Monika Rauch Henzinger, Stefano Leonardi: Scheduling Multicasts on Unit-Capacity Trees and Meshes. SODA 1999: 438-447
- [c16]Baruch Awerbuch, Yossi Azar, Stefano Leonardi, Oded Regev: Minimizing the Flow Time Without Migration. STOC 1999: 198-205
- 1998
- [j4]Esteban Feuerstein, Stefano Leonardi, Alberto Marchetti-Spaccamela, Nicola Santoro: Efficient Token-Based Control in Rings. Inf. Process. Lett. 66(4): 175-180 (1998)
- [c15]Stefano Leonardi, Andrea Vitaletti: Randomized Lower Bounds for Online Path Coloring. RANDOM 1998: 232-247
- [c14]Stefano Leonardi, Alberto Marchetti-Spaccamela, Alessio Presciutti, Adi Rosén: On-line Randomized Call Control Revisited. SODA 1998: 323-332
- [c13]Susanne Albers, Naveen Garg, Stefano Leonardi: Minimizing Stall Time in Single and Parallel Disk Systems. STOC 1998: 454-462
- 1997
- [j3]Maurizio A. Bonuccelli, Stefano Leonardi: On scheduling variable length broadcasts in wireless networks. Telecommunication Systems 8(2-4): 211-227 (1997)
- [c12]
- [c11]
- 1996
- [j2]Paola Alimonti, Stefano Leonardi, Alberto Marchetti-Spaccamela: Average Case Analysis of Fully Dynamic Reachability for Directed Graphs. ITA 30(4): 305-318 (1996)
- [j1]Bruno Becker, Paolo Giulio Franciosa, Stephan Gschwind, Stefano Leonardi, Thomas Ohler, Peter Widmayer: Enclosing a Set of Objects by Two Minimum Area Rectangles. J. Algorithms 21(3): 520-541 (1996)
- [c10]
- [c9]Baruch Awerbuch, Yossi Azar, Amos Fiat, Stefano Leonardi, Adi Rosén: On-line Competive Algorithms for Call Admission in Optical Networks. ESA 1996: 431-444
- [c8]Yossi Azar, Yair Bartal, Esteban Feuerstein, Amos Fiat, Stefano Leonardi, Adi Rosén: On Capital Investment. ICALP 1996: 429-441
- [c7]Esteban Feuerstein, Stefano Leonardi, Alberto Marchetti-Spaccamela, Nicola Santoro: Efficient Token-Based Control in Rings (Abstract). PODC 1996: 154
- [c6]Yair Bartal, Stefano Leonardi, Alberto Marchetti-Spaccamela, Jiri Sgall, Leen Stougie: Multiprocessor Scheduling with Rejection. SODA 1996: 95-103
- [c5]Yair Bartal, Amos Fiat, Stefano Leonardi: Lower Bounds for On-line Graph Problems with Application to On-line Circuit and Optical Routing. STOC 1996: 531-540
- 1995
- [c4]Stefano Leonardi, Alberto Marchetti-Spaccamela: On-line Resource Management with Applications to Routing and Scheduling. ICALP 1995: 303-314
- [c3]Giorgio Ausiello, Esteban Feuerstein, Stefano Leonardi, Leen Stougie, Maurizio Talamo: Competitive Algorithms for the On-line Traveling Salesman. WADS 1995: 206-217
- 1994
- [c2]Giorgio Ausiello, Esteban Feuerstein, Stefano Leonardi, Leen Stougie, Maurizio Talamo: Serving Requests with On-line Routing. SWAT 1994: 37-48
- 1993
- [c1]Paola Alimonti, Stefano Leonardi, Alberto Marchetti-Spaccamela, Xavier Messeguer: Average Case Analysis of Fully Dynamic Connectivity for Directed Graphs. WG 1993: 87-98
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-10-02 11:21 CEST by the dblp team