| 2008 |
|---|
| 73 | | Andrea Lodi,
Alessandro Panconesi,
Giovanni Rinaldi:
Integer Programming and Combinatorial Optimization, 13th International Conference, IPCO 2008, Bertinoro, Italy, May 26-28, 2008, Proceedings
Springer 2008 |
| 72 | EE | Flavio Chierichetti,
Silvio Lattanzi,
Alessandro Panconesi:
Gossiping (via mobile?) in social networks.
DIALM-POMC 2008: 27-28 |
| 71 | EE | Alessandro Panconesi,
Mauro Sozio:
Fast distributed scheduling via primal-dual.
SPAA 2008: 229-235 |
| 70 | EE | Flavio Chierichetti,
Silvio Lattanzi,
Federico Mari,
Alessandro Panconesi:
On placing skips optimally in expectation.
WSDM 2008: 15-24 |
| 69 | EE | Roberto Di Pietro,
Luigi V. Mancini,
Alessandro Mei,
Alessandro Panconesi,
Jaikumar Radhakrishnan:
Redoubtable Sensor Networks.
ACM Trans. Inf. Syst. Secur. 11(3): (2008) |
| 68 | EE | Fabrizio Grandoni,
Jochen Könemann,
Alessandro Panconesi:
Distributed weighted vertex cover via maximal matchings.
ACM Transactions on Algorithms 5(1): (2008) |
| 67 | EE | Fabrizio Grandoni,
Jochen Könemann,
Alessandro Panconesi,
Mauro Sozio:
A Primal-Dual Bicriteria Distributed Algorithm for Capacitated Vertex Cover.
SIAM J. Comput. 38(3): 825-840 (2008) |
| 2007 |
|---|
| 66 | EE | Emilio De Santis,
Fabrizio Grandoni,
Alessandro Panconesi:
Fast Low Degree Connectivity of Ad-Hoc Networks Via Percolation.
ESA 2007: 206-217 |
| 65 | EE | Flavio Chierichetti,
Alessandro Panconesi,
Prabhakar Raghavan,
Mauro Sozio,
Alessandro Tiberi,
Eli Upfal:
Finding near neighbors through cluster pruning.
PODS 2007: 103-112 |
| 64 | EE | Alessandro Panconesi:
Fast Distributed Algorithms Via Primal-Dual (Extended Abstract).
SIROCCO 2007: 1-6 |
| 63 | EE | Alessandro Panconesi:
Foreword.
Algorithmica 47(3): 215 (2007) |
| 62 | EE | Devdatt P. Dubhashi,
Olle Häggström,
Lorenzo Orecchia,
Alessandro Panconesi,
Chiara Petrioli,
Andrea Vitaletti:
Localized Techniques for Broadcasting in Wireless Sensor Networks.
Algorithmica 49(4): 412-446 (2007) |
| 61 | | Thomas Erlebach,
Alexander Hall,
Alessandro Panconesi,
Danica Vukadinovic:
Cuts and Disjoint Paths in the Valley-Free Model.
Internet Mathematics 3(3): (2007) |
| 60 | EE | Devdatt P. Dubhashi,
Olle Häggström,
Gabriele Mambrini,
Alessandro Panconesi,
Chiara Petrioli:
Blue pleiades, a new solution for device discovery and scatternet formation in multi-hop Bluetooth networks.
Wireless Networks 13(1): 107-125 (2007) |
| 2006 |
|---|
| 59 | EE | Thomas Erlebach,
Alexander Hall,
Linda S. Moonen,
Alessandro Panconesi,
Frits C. R. Spieksma,
Danica Vukadinovic:
Robustness of the Internet at the Topology and Routing Level.
Research Results of the DICS Program 2006: 260-274 |
| 58 | EE | Carlos Castillo,
Alberto Nelli,
Alessandro Panconesi:
A Memory-Efficient Strategy for Exploring the Web.
Web Intelligence 2006: 680-686 |
| 57 | EE | Harry Buhrman,
Alessandro Panconesi,
Riccardo Silvestri,
Paul M. B. Vitányi:
On the importance of having an identity or, is consensus really universal?.
Distributed Computing 18(3): 167-176 (2006) |
| 56 | EE | Stefano Basagni,
Michele Mastrogiovanni,
Alessandro Panconesi,
Chiara Petrioli:
Localized Protocols for Ad Hoc Clustering and Backbone Formation: A Performance Comparison.
IEEE Trans. Parallel Distrib. Syst. 17(4): 292-306 (2006) |
| 2005 |
|---|
| 55 | EE | Fabrizio Grandoni,
Jochen Könemann,
Alessandro Panconesi:
Distributed Weighted Vertex Cover via Maximal Matchings.
COCOON 2005: 839-848 |
| 54 | EE | Fabrizio Grandoni,
Jochen Könemann,
Alessandro Panconesi,
Mauro Sozio:
Primal-dual based distributed algorithms for vertex cover with semi-hard capacities.
PODC 2005: 118-125 |
| 53 | EE | Devdatt P. Dubhashi,
C. Johansson,
Olle Häggström,
Alessandro Panconesi,
Mauro Sozio:
Irrigating ad hoc networks in constant time.
SPAA 2005: 106-115 |
| 52 | EE | Devdatt P. Dubhashi,
Alessandro Mei,
Alessandro Panconesi,
Jaikumar Radhakrishnan,
Aravind Srinivasan:
Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons.
J. Comput. Syst. Sci. 71(4): 467-479 (2005) |
| 2004 |
|---|
| 51 | EE | Thomas Erlebach,
Alexander Hall,
Alessandro Panconesi,
Danica Vukadinovic:
Cuts and Disjoint Paths in the Valley-Free Path Model of Internet BGP Routing.
CAAN 2004: 49-62 |
| 50 | EE | Lorenzo Orecchia,
Alessandro Panconesi,
Chiara Petrioli,
Andrea Vitaletti:
Localized techniques for broadcasting in wireless sensor networks.
DIALM-POMC 2004: 41-51 |
| 49 | EE | Fabrizio Ferraguto,
Gabriele Mambrini,
Alessandro Panconesi,
Chiara Petrioli:
A New Approach to Device Discovery and Scatternet Formation in Bluetooth Networks.
IPDPS 2004 |
| 48 | EE | Roberto Di Pietro,
Luigi V. Mancini,
Alessandro Mei,
Alessandro Panconesi,
Jaikumar Radhakrishnan:
Connectivity properties of secure wireless sensor networks.
SASN 2004: 53-58 |
| 47 | EE | Alessandro Panconesi,
Jaikumar Radhakrishnan:
Expansion properties of (secure) wireless networks.
SPAA 2004: 281-285 |
| 46 | EE | Alessandro Panconesi,
Mauro Sozio:
Fast Hare: A Fast Heuristic for Single Individual SNP Haplotype Reconstruction.
WABI 2004: 266-277 |
| 45 | EE | Madhav V. Marathe,
Alessandro Panconesi,
Larry D. Risinger Jr.:
An experimental study of a simple, distributed edge-coloring algorithm.
ACM Journal of Experimental Algorithmics 9: (2004) |
| 44 | EE | Irene Finocchi,
Alessandro Panconesi,
Riccardo Silvestri:
An Experimental Analysis of Simple, Distributed Vertex Coloring Algorithms.
Algorithmica 41(1): 1-23 (2004) |
| 43 | EE | Louigi Addario-Berry,
Benny Chor,
Michael T. Hallett,
Jens Lagergren,
Alessandro Panconesi,
Todd Wareham:
Ancestral Maximum Likelihood of Evolutionary Trees Is Hard.
J. Bioinformatics and Computational Biology 2(2): 257-272 (2004) |
| 42 | EE | Alberto Caprara,
Alessandro Panconesi,
Romeo Rizzi:
Packing cuts in undirected graphs.
Networks 44(1): 1-11 (2004) |
| 2003 |
|---|
| 41 | EE | Devdatt P. Dubhashi,
Luigi Laura,
Alessandro Panconesi:
Analysis and Experimental Evaluation of a Simple Algorithm for Collaborative Filtering in Planted Partition Models: Extended Abstract.
FSTTCS 2003: 168-182 |
| 40 | EE | Devdatt P. Dubhashi,
Alessandro Mei,
Alessandro Panconesi,
Jaikumar Radhakrishnan,
Aravind Srinivasan:
Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons.
SODA 2003: 717-724 |
| 39 | EE | Louigi Addario-Berry,
Benny Chor,
Michael T. Hallett,
Jens Lagergren,
Alessandro Panconesi,
Todd Wareham:
Ancestral Maximum Likelihood of Evolutionary Trees Is Hard.
WABI 2003: 202-215 |
| 38 | EE | Alberto Caprara,
Alessandro Panconesi,
Romeo Rizzi:
Packing cycles in undirected graphs.
J. Algorithms 48(1): 239-256 (2003) |
| 2002 |
|---|
| 37 | EE | Irene Finocchi,
Alessandro Panconesi,
Riccardo Silvestri:
Experimental analysis of simple, distributed vertex coloring algorithms.
SODA 2002: 606-615 |
| 36 | EE | Harry Buhrman,
Alessandro Panconesi,
Riccardo Silvestri,
Paul M. B. Vitányi:
On the Importance of Having an Identity or, is Consensus really Universal?
CoRR cs.DC/0201006: (2002) |
| 35 | EE | Alberto Caprara,
Giuseppe F. Italiano,
G. Mohan,
Alessandro Panconesi,
Aravind Srinivasan:
Wavelength rerouting in optical networks, or the Venetian Routing problem.
J. Algorithms 45(2): 93-125 (2002) |
| 34 | EE | Tibor Jordán,
Alessandro Panconesi:
Preface.
Random Struct. Algorithms 20(3): 261 (2002) |
| 2001 |
|---|
| 33 | EE | Alberto Caprara,
Alessandro Panconesi,
Romeo Rizzi:
Packing Cycles and Cuts in Undirected Graphs.
ESA 2001: 512-523 |
| 32 | EE | Alessandro Panconesi,
Romeo Rizzi:
Some simple distributed algorithms for sparse networks.
Distributed Computing 14(2): 97-100 (2001) |
| 31 | EE | Michal Hanckowiak,
Michal Karonski,
Alessandro Panconesi:
On the Distributed Complexity of Computing Maximal Matchings.
SIAM J. Discrete Math. 15(1): 41-57 (2001) |
| 2000 |
|---|
| 30 | EE | Alberto Caprara,
Giuseppe F. Italiano,
G. Mohan,
Alessandro Panconesi,
Aravind Srinivasan:
Wavelength rerouting in optical networks, or the Venetian routing problem.
APPROX 2000: 72-83 |
| 29 | EE | Harry Buhrman,
Alessandro Panconesi,
Riccardo Silvestri,
Paul M. B. Vitányi:
On the Importance of Having an Identity or is Consensus Really Universal?
DISC 2000: 134-148 |
| 28 | EE | Madhav V. Marathe,
Alessandro Panconesi,
Larry D. Risinger Jr.:
An experimental study of a simple, distributed edge coloring algorithm.
SPAA 2000: 166-175 |
| 27 | | David A. Grable,
Alessandro Panconesi:
Fast Distributed Algorithms for Brooks-Vizing Colorings.
J. Algorithms 37(1): 85-120 (2000) |
| 1999 |
|---|
| 26 | EE | Michal Hanckowiak,
Michal Karonski,
Alessandro Panconesi:
A Faster Distributed Algorithm for Computing Maximal Matchings Deterministically.
PODC 1999: 219-228 |
| 1998 |
|---|
| 25 | | Michal Hanckowiak,
Michal Karonski,
Alessandro Panconesi:
On the Distributed Complexity of Computing Maximal Matchings.
SODA 1998: 219-225 |
| 24 | | David A. Grable,
Alessandro Panconesi:
Fast Distributed Algorithms for {Brooks-Vizing} Colourings.
SODA 1998: 473-480 |
| 23 | EE | Alessandro Panconesi,
Marina Papatriantafilou,
Philippas Tsigas,
Paul M. B. Vitányi:
Randomized Naming Using Wait-Free Shared Variables.
Distributed Computing 11(3): 113-124 (1998) |
| 22 | EE | Viggo Kann,
Jens Lagergren,
Alessandro Panconesi:
Approximate Max k-Cut with Subgraph Guarantee.
Inf. Process. Lett. 65(3): 145-150 (1998) |
| 21 | EE | Devdatt P. Dubhashi,
David A. Grable,
Alessandro Panconesi:
Near-Optimal, Distributed Edge Colouring via the Nibble Method.
Theor. Comput. Sci. 203(2): 225-251 (1998) |
| 20 | EE | Ewa Malesinska,
Alessandro Panconesi:
On the Hardness of Allocating Frequences for Hybrid Networks.
Theor. Comput. Sci. 209(1-2): 347-363 (1998) |
| 1997 |
|---|
| 19 | | David A. Grable,
Alessandro Panconesi:
Nearly Optimal Distributed Edge Colouring in O(log log n) Rounds.
SODA 1997: 278-285 |
| 18 | EE | Viggo Kann,
Sanjeev Khanna,
Jens Lagergren,
Alessandro Panconesi:
On the Hardness of Approximating Max k-Cut and its Dual.
Chicago J. Theor. Comput. Sci. 1997: (1997) |
| 17 | | David A. Grable,
Alessandro Panconesi:
Nearly optimal distributed edge coloring in O(log log n) rounds.
Random Struct. Algorithms 10(3): 385-405 (1997) |
| 16 | | Alessandro Panconesi,
Aravind Srinivasan:
Randomized Distributed Edge Coloring via an Extension of the Chernoff-Hoeffding Bounds.
SIAM J. Comput. 26(2): 350-368 (1997) |
| 1996 |
|---|
| 15 | | Viggo Kann,
Sanjeev Khanna,
Jens Lagergren,
Alessandro Panconesi:
On the Hardness of Approximating Max k-Cut and Its Dual.
ISTCS 1996: 61-67 |
| 14 | | Ewa Malesinska,
Alessandro Panconesi:
On the Hardness of Allocating Frequencies for Hybrid Networks.
WG 1996: 308-322 |
| 13 | EE | Viggo Kann,
Jens Lagergren,
Alessandro Panconesi:
Approximability of Maximum Splitting of k-Sets and Some Other Apx-Complete Problems.
Inf. Process. Lett. 58(3): 105-110 (1996) |
| 12 | | Alessandro Panconesi,
Aravind Srinivasan:
On the Complexity of Distributed Network Decomposition.
J. Algorithms 20(2): 356-374 (1996) |
| 1995 |
|---|
| 11 | | Devdatt P. Dubhashi,
Alessandro Panconesi:
Near-Optimal Distributed Edge Coloring.
ESA 1995: 448-459 |
| 10 | | Alessandro Panconesi,
Aravind Srinivasan:
The Local Natur of Delta-Coloring and its Algorithmic Applications.
Combinatorica 15(2): 255-280 (1995) |
| 1994 |
|---|
| 9 | | Alessandro Panconesi,
Marina Papatriantafilou,
Philippas Tsigas,
Paul M. B. Vitányi:
Randomized Wait-Free Naming.
ISAAC 1994: 83-91 |
| 1993 |
|---|
| 8 | | Alessandro Panconesi,
Desh Ranjan:
Quantifiers and Approximation.
Theor. Comput. Sci. 107(1): 145-163 (1993) |
| 1992 |
|---|
| 7 | | Alessandro Panconesi,
Aravind Srinivasan:
Fast Randomized Algorithms for Distributed Edge Coloring (Extended Abstract).
PODC 1992: 251-262 |
| 6 | | Alessandro Panconesi,
Aravind Srinivasan:
Improved Distributed Algorithms for Coloring and Network Decomposition Problems
STOC 1992: 581-592 |
| 1991 |
|---|
| 5 | | Pierluigi Crescenzi,
Alessandro Panconesi:
Completeness in Approximation Classes
Inf. Comput. 93(2): 241-262 (1991) |
| 1990 |
|---|
| 4 | | Alessandro Panconesi,
Desh Ranjan:
Quantifiers and Approximation (Extended Abstract)
STOC 1990: 446-456 |
| 3 | | Alessandro Panconesi,
Desh Ranjan:
Quantifiers and Approximation (Abstract).
Structure in Complexity Theory Conference 1990: 244 |
| 1989 |
|---|
| 2 | | Pierluigi Crescenzi,
Alessandro Panconesi:
Completeness in Approximation Classes.
FCT 1989: 116-126 |
| 1988 |
|---|
| 1 | | Claudio Arbib,
Giuseppe F. Italiano,
Alessandro Panconesi:
Predicting deadlock in Store-and-Forward Networks.
FSTTCS 1988: 123-142 |
