Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDStéphane Pérennes
Stephane Perennes
Person information
- affiliation: INRIA, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2023
[j71]Frédéric Giroire, Stéphane Pérennes, Thibaud Trolliet
:
A random growth model with any real or theoretical degree distribution. Theor. Comput. Sci. 940(Part): 36-51 (2023)- 2022
- [c69]Hicham Lesfari, Frédéric Giroire, Stéphane Pérennes:
Biased Majority Opinion Dynamics: Exploiting Graph k-domination. IJCAI 2022: 377-383 - 2021
- [j70]Fionn Mc Inerney, Nicolas Nisse, Stéphane Pérennes:
Eternal Domination: D-Dimensional Cartesian and Strong Grids and Everything in Between. Algorithmica 83(5): 1459-1492 (2021) - [j69]Andrea Tomassilli, Giuseppe Di Lena, Frédéric Giroire, Issam Tahiri, Damien Saucez, Stéphane Pérennes, Thierry Turletti, Ruslan Sadykov, François Vanderbeck, Chidung Lac:
Design of robust programmable networks with bandwidth-optimal failure recovery scheme. Comput. Networks 192: 108043 (2021) - [j68]Thibaud Trolliet, Nathann Cohen, Frédéric Giroire, Luc Hogie, Stéphane Pérennes:
Interest clustering coefficient: a new metric for directed networks like Twitter. J. Complex Networks 10(1) (2021) - 2020
- [j67]Nathann Cohen, Fionn Mc Inerney, Nicolas Nisse, Stéphane Pérennes:
Study of a Combinatorial Game in Graphs Through Linear Programming. Algorithmica 82(2): 212-244 (2020) - [j66]Julien Bensmail, Dorian Mazauric, Fionn Mc Inerney, Nicolas Nisse, Stéphane Pérennes:
Sequential Metric Dimension. Algorithmica 82(10): 2867-2901 (2020) - [c68]Frédéric Giroire, Stéphane Pérennes, Thibaud Trolliet:
A Random Growth Model with Any Real or Theoretical Degree Distribution. COMPLEX NETWORKS (2) 2020: 437-449 - [c67]Thibaud Trolliet, Nathann Cohen, Frédéric Giroire, Luc Hogie, Stéphane Pérennes:
Interest Clustering Coefficient: A New Metric for Directed Networks Like Twitter. COMPLEX NETWORKS (2) 2020: 597-609 - [i5]Thibaud Trolliet, Nathann Cohen, Frédéric Giroire, Luc Hogie, Stéphane Pérennes:
Interest Clustering Coefficient: a New Metric for Directed Networks like Twitter. CoRR abs/2008.00517 (2020) - [i4]Frédéric Giroire, Stéphane Pérennes, Thibaud Trolliet:
A Random Growth Model with any Real or Theoretical Degree Distribution. CoRR abs/2008.03831 (2020)
2010 – 2019
- 2019
- [c66]Fionn Mc Inerney, Nicolas Nisse, Stéphane Pérennes:
Eternal Domination in Grids. CIAC 2019: 311-322 - [c65]Andrea Tomassilli, Giuseppe Di Lena, Frédéric Giroire, Issam Tahiri, Damien Saucez, Stephane Perennes, Thierry Turletti, Ruslan Sadykov, François Vanderbeck, Chidung Lac:
Bandwidth-optimal Failure Recovery Scheme for Robust Programmable Networks. CloudNet 2019: 1-6 - [c64]Frédéric Giroire, Nicolas Huin, Andrea Tomassilli, Stéphane Pérennes:
When Network Matters: Data Center Scheduling with Network Tasks. INFOCOM 2019: 2278-2286 - [c63]Andrea Tomassilli, Chidung Lac, Giuseppe Di Lena, Frédéric Giroire, Issam Tahiri, Damien Saucez, Stéphane Pérennes, Thierry Turletti, Ruslan Sadykov, François Vanderbeck:
Poster: design of survivable SDN/NFV-enabled networks with bandwidth-optimal failure recovery. Networking 2019: 1-2 - 2018
- [j65]Frédéric Giroire, Stephane Perennes, Issam Tahiri:
Grid spanners with low forwarding index for energy efficient networks. Discret. Appl. Math. 246: 99-107 (2018) - [j64]Nathann Cohen, Nicolas Almeida Martins, Fionn Mc Inerney, Nicolas Nisse, Stéphane Pérennes, Rudini M. Sampaio:
Spy-game on graphs: Complexity and simple topologies. Theor. Comput. Sci. 725: 1-15 (2018) - [c62]Andrea Tomassilli, Frédéric Giroire, Nicolas Huin, Stéphane Pérennes:
Provably Efficient Algorithms for Placement of Service Function Chains with Ordering Constraints. INFOCOM 2018: 774-782 - [c61]Julien Bensmail, Dorian Mazauric, Fionn Mc Inerney, Nicolas Nisse, Stéphane Pérennes:
Sequential Metric Dimension. WAOA 2018: 36-50 - 2017
- [j63]Frédéric Giroire, Remigiusz Modrzejewski, Nicolas Nisse, Stéphane Pérennes:
Maintaining balanced trees for structured distributed streaming systems. Discret. Appl. Math. 232: 176-188 (2017) - [j62]Euripides Markou, Nicolas Nisse, Stéphane Pérennes:
Exclusive graph searching vs. pathwidth. Inf. Comput. 252: 243-260 (2017) - [c60]Nathann Cohen, Fionn Mc Inerney, Nicolas Nisse, Stéphane Pérennes:
Study of a Combinatorial Game in Graphs Through Linear Programming. ISAAC 2017: 22:1-22:13 - 2016
- [j61]David Coudert, Stéphane Pérennes, Hervé Rivano, Marie-Emilie Voge:
Combinatorial optimization in networks with Shared Risk Link Groups. Discret. Math. Theor. Comput. Sci. 18(3) (2016) - [j60]Frédéric Giroire, Stephane Perennes, Issam Tahiri:
Grid spanners with low forwarding index for energy efficient networks. Electron. Notes Discret. Math. 52: 141-148 (2016) - [c59]Nathann Cohen, Mathieu Hilaire, Nicolas Almeida Martins, Nicolas Nisse, Stéphane Pérennes:
Spy-Game on Graphs. FUN 2016: 10:1-10:16 - [c58]Jean-Claude Bermond, Nathann Cohen, David Coudert, Dimitrios Letsios, Ioannis Milis, Stéphane Pérennes, Vassilis Zissimopoulos:
Bin Packing with Colocations. WAOA 2016: 40-51 - 2015
- [j59]Frédéric Giroire, Stéphane Pérennes, Issam Tahiri:
On the complexity of equal shortest path routing. Networks 65(4): 344-352 (2015) - [j58]Olivier Delmas, Frédéric Havet, Mickaël Montassier, Stéphane Pérennes:
Design of fault-tolerant on-board networks with variable switch sizes. Theor. Comput. Sci. 562: 75-89 (2015) - [j57]Frédéric Giroire, Ioannis Lamprou, Dorian Mazauric, Nicolas Nisse, Stéphane Pérennes, R. Soares:
Connected surveillance game. Theor. Comput. Sci. 584: 131-143 (2015) - [c57]Frédéric Giroire, Stéphane Pérennes, Issam Tahiri:
How to Design Graphs with Low Forwarding Index and Limited Number of Edges. IWOCA 2015: 221-234 - 2014
- [j56]Stéphane Caron, Frédéric Giroire, Dorian Mazauric, Julian Monteiro, Stéphane Pérennes:
P2P storage systems: Study of different placement policies. Peer-to-Peer Netw. Appl. 7(4): 427-443 (2014) - [j55]Júlio Araújo, Nicolas Nisse, Stéphane Pérennes:
Weighted Coloring in Trees. SIAM J. Discret. Math. 28(4): 2029-2041 (2014) - [c56]Júlio Araújo, Nicolas Nisse, Stéphane Pérennes:
Weighted Coloring in Trees. STACS 2014: 75-86 - 2013
- [j54]Jean-Claude Bermond, Ralf Klasing, Nelson Morales, Stéphane Pérennes, Patricio Reyes:
Gathering Radio Messages in the Path. Discret. Math. Algorithms Appl. 5(1) (2013) - [j53]Frédéric Giroire, Stéphane Pérennes, Issam Tahiri:
On the Hardness of Equal Shortest Path Routing. Electron. Notes Discret. Math. 41: 439-446 (2013) - [j52]Jean-Claude Bermond, Michel Cosnard, Stéphane Pérennes:
Directed acyclic graphs with the unique dipath property. Theor. Comput. Sci. 504: 5-11 (2013) - [j51]Jean-Claude Bermond, Luisa Gargano, Stéphane Pérennes, Adele A. Rescigno, Ugo Vaccaro:
Optimal time data gathering in wireless networks with multidirectional antennas. Theor. Comput. Sci. 509: 122-139 (2013) - [c55]Deepesh Agarwal, Júlio César Silva Araújo, Christelle Caillouet, Frédéric Cazals, David Coudert, Stéphane Pérennes:
Connectivity Inference in Mass Spectrometry Based Structure Determination. ESA 2013: 289-300 - [c54]Frédéric Giroire, Sandeep Kumar Gupta, Remigiusz Modrzejewski, Julian Monteiro, Stéphane Pérennes:
Repair Time in Distributed Storage Systems. Globe 2013: 99-110 - [c53]Frédéric Giroire, Dorian Mazauric, Nicolas Nisse, Stéphane Pérennes, Ronan Pardo Soares:
Connected Surveillance Game. SIROCCO 2013: 68-79 - [c52]Frédéric Giroire, Remigiusz Modrzejewski, Nicolas Nisse, Stéphane Pérennes:
Maintaining Balanced Trees for Structured Distributed Streaming Systems. SIROCCO 2013: 177-188 - [i3]David Coudert, Luc Hogie, Aurélien Lancin, Dimitri Papadimitriou, Stéphane Pérennes, Issam Tahiri:
Feasibility study on distributed simulations of BGP. CoRR abs/1304.4750 (2013) - 2012
- [j50]Omid Amini, David Peleg, Stéphane Pérennes, Ignasi Sau, Saket Saurabh:
On the approximability of some degree-constrained subgraph problems. Discret. Appl. Math. 160(12): 1661-1679 (2012) - [j49]Jean-Claude Bermond, David Coudert, Joanna Moulierac, Stéphane Pérennes, Ignasi Sau, Fernando Solano Donado:
GMPLS label space minimization through hypergraph layouts. Theor. Comput. Sci. 444: 3-16 (2012) - [c51]David Coudert, Luc Hogie, Aurélien Lancin, Dimitri Papadimitriou, Stéphane Pérennes, Issam Tahiri:
Feasibility Study on Distributed Simulations of BGP. PADS 2012: 96-98 - [i2]David Coudert, Luc Hogie, Aurélien Lancin, Dimitri Papadimitriou, Stéphane Pérennes, Issam Tahiri:
Feasibility study on distributed simulations of BGP. CoRR abs/1209.0943 (2012) - 2011
- [j48]Christelle Caillouet, Stéphane Pérennes, Hervé Rivano:
Framework for optimizing the capacity of wireless mesh networks. Comput. Commun. 34(13): 1645-1659 (2011) - [c50]Jean-Claude Bermond, Luisa Gargano, Stéphane Pérennes, Adele A. Rescigno, Ugo Vaccaro:
Optimal Time Data Gathering in Wireless Networks with Omni-Directional Antennas. SIROCCO 2011: 306-317 - 2010
- [j47]Ioannis Caragiannis, Afonso Ferreira, Christos Kaklamanis, Stéphane Pérennes, Hervé Rivano:
Fractional Path Coloring in Bounded Degree Trees with Applications. Algorithmica 58(2): 516-540 (2010) - [j46]Christelle Caillouet, Stéphane Pérennes, Hervé Rivano:
Cross line and column generation for the cut covering problem in wireless networks. Electron. Notes Discret. Math. 36: 255-262 (2010) - [j45]Omid Amini, Frédéric Giroire, Stéphane Pérennes, Florian Huc:
Minimal selectors and fault tolerant networks. Networks 55(4): 326-340 (2010) - [c49]Stéphane Caron, Frédéric Giroire, Dorian Mazauric, Julian Monteiro, Stéphane Pérennes:
Data Life Time for Different Placement Policies in P2P Storage Systems. Globe 2010: 75-88 - [c48]Frédéric Giroire, Julian Monteiro, Stéphane Pérennes:
Peer-to-Peer Storage Systems: A Practical Guideline to be Lazy. GLOBECOM 2010: 1-6 - [c47]Christelle Caillouet, Florian Huc, Nicolas Nisse, Stéphane Pérennes, Hervé Rivano:
Stability of a localized and greedy routing algorithm. IPDPS Workshops 2010: 1-8
2000 – 2009
- 2009
- [j44]Ralf Klasing, Zvi Lotker, Alfredo Navarra, Stéphane Pérennes:
From Balls and Bins to Points and Vertices. Algorithmic Oper. Res. 4(2): 133-143 (2009) - [j43]Aubin Jarry, Stéphane Pérennes:
Disjoint paths in symmetric digraphs. Discret. Appl. Math. 157(1): 90-97 (2009) - [j42]Omid Amini, Florian Huc, Stéphane Pérennes:
On the Path-Width of Planar Graphs. SIAM J. Discret. Math. 23(3): 1311-1316 (2009) - [j41]Omid Amini, Stéphane Pérennes, Ignasi Sau:
Hardness and approximation of traffic grooming. Theor. Comput. Sci. 410(38-40): 3751-3760 (2009) - [c46]Frédéric Giroire, Julian Monteiro, Stéphane Pérennes:
P2P storage systems: How much locality can they tolerate? LCN 2009: 320-323 - [c45]Jean-Claude Bermond, David Coudert, Joanna Moulierac, Stéphane Pérennes, Hervé Rivano, Ignasi Sau, Fernando Solano Donado:
MPLS Label Stacking on the Line Network. Networking 2009: 809-820 - [c44]Olivier Dalle, Frédéric Giroire, Julian Monteiro, Stephane Perennes:
Analysis of Failure Correlation Impact on Peer-to-Peer Storage Systems. Peer-to-Peer Computing 2009: 184-193 - [c43]Jean-Claude Bermond, David Coudert, Joanna Moulierac, Stéphane Pérennes, Ignasi Sau, Fernando Solano Donado:
Designing Hypergraph Layouts to GMPLS Routing Strategies. SIROCCO 2009: 57-71 - 2008
- [j40]Michele Flammini, Luca Moscardelli, Alfredo Navarra, Stéphane Pérennes:
Asymptotically Optimal Solutions for Small World Graphs. Theory Comput. Syst. 42(4): 632-650 (2008) - [j39]Ralf Klasing, Nelson Morales, Stéphane Pérennes:
On the complexity of bandwidth allocation in radio networks. Theor. Comput. Sci. 406(3): 225-239 (2008) - [j38]Michele Flammini, Ralf Klasing, Alfredo Navarra, Stephane Perennes:
Tightening the upper bound for the minimum energy broadcasting. Wirel. Networks 14(5): 659-669 (2008) - [c42]Christelle Molle, Fabrice Peix, Stéphane Pérennes, Hervé Rivano:
Optimal Routing and Call Scheduling in Wireless Mesh Networks with Localized Informations. TGC 2008: 171-185 - [c41]Omid Amini, David Peleg, Stéphane Pérennes, Ignasi Sau, Saket Saurabh:
Degree-Constrained Subgraph Problems: Hardness and Approximation Results. WAOA 2008: 29-42 - 2007
- [j37]Michele Flammini, Ralf Klasing, Alfredo Navarra, Stephane Perennes:
Improved Approximation Results for the Minimum Energy Broadcasting Problem. Algorithmica 49(4): 318-336 (2007) - [j36]David Coudert, Pallab Datta, Stephane Perennes, Hervé Rivano, Marie-Emilie Voge:
Shared Risk Resource Group Complexity and Approximability Issues. Parallel Process. Lett. 17(2): 169-184 (2007) - [j35]Jean-Claude Bermond, Afonso Ferreira, Stéphane Pérennes, Joseph G. Peters:
Neighborhood Broadcasting in Hypercubes. SIAM J. Discret. Math. 21(4): 823-843 (2007) - [c40]Omid Amini, Stéphane Pérennes, Ignasi Sau:
Hardness and Approximation of Traffic Grooming. ISAAC 2007: 561-573 - [c39]Jean-Claude Bermond, Frédéric Giroire, Stéphane Pérennes:
Design of Minimal Fault Tolerant On-Board Networks: Practical Constructions. SIROCCO 2007: 261-273 - 2006
- [j34]Michele Flammini, Alfredo Navarra, Stephane Perennes:
The "real" approximation factor of the MST heuristic for the minimum energy broadcasting. ACM J. Exp. Algorithmics 11 (2006) - [j33]Jean-Claude Bermond, Jérôme Galtier, Ralf Klasing, Nelson Morales, Stephane Perennes:
Hardness and Approximation of Gathering in Static Radio Networks. Parallel Process. Lett. 16(2): 165-184 (2006) - [c38]Jean-Claude Bermond, Michel Cosnard, David Coudert, Stéphane Pérennes:
Optimal Solution of the Maximum All Request Path Grooming Problem. AICT/ICIW 2006: 28 - [c37]Rudi Cilibrasi, Zvi Lotker, Alfredo Navarra, Stephane Perennes, Paul M. B. Vitányi:
About the Lifespan of Peer to Peer Networks, . OPODIS 2006: 290-304 - [c36]Jean-Claude Bermond, Nelson Morales, Stéphane Pérennes, Jérôme Galtier, Ralf Klasing:
Hardness and approximation of Gathering in static radio networks. PerCom Workshops 2006: 75-79 - [i1]Rudi Cilibrasi, Zvi Lotker, Alfredo Navarra, Stéphane Pérennes, Paul M. B. Vitányi:
About the Lifespan of Peer to Peer Networks. CoRR abs/cs/0612043 (2006) - 2005
- [j32]Sébastien Choplin, Aubin Jarry, Stéphane Pérennes:
Virtual network embedding in the cycle. Discret. Appl. Math. 145(3): 368-375 (2005) - [j31]Michele Flammini, Stéphane Pérennes:
Lower bounds on systolic gossip. Inf. Comput. 196(2): 71-94 (2005) - [c35]Ralf Klasing, Zvi Lotker, Alfredo Navarra, Stephane Perennes:
From Balls and Bins to Points and Vertices. ISAAC 2005: 757-766 - [c34]Michele Flammini, Luca Moscardelli, Alfredo Navarra, Stéphane Pérennes:
Asymptotically Optimal Solutions for Small World Graphs. DISC 2005: 414-428 - [c33]Michele Flammini, Alfredo Navarra, Stéphane Pérennes:
The "Real" Approximation Factor of the MST Heuristic for the Minimum Energy Broadcasting. WEA 2005: 22-31 - 2004
- [j30]Ioannis Caragiannis, Afonso Ferreira, Christos Kaklamanis, Stephane Perennes, Pino Persiano, Hervé Rivano:
Approximate constrained bipartite edge coloring. Discret. Appl. Math. 143(1-3): 54-61 (2004) - [j29]Cyril Gavoille, David Peleg, Stéphane Pérennes, Ran Raz:
Distance labeling in graphs. J. Algorithms 53(1): 85-112 (2004) - [j28]Michele Flammini, Stéphane Pérennes:
Lower Bounds on the Broadcasting and Gossiping Time of Restricted Protocols. SIAM J. Discret. Math. 17(4): 521-540 (2004) - [c32]Zvi Lotker, Marc Martinez de Albeniz, Stephane Perennes:
Range-Free Ranking in Sensors Networks and Its Applications to Localization. ADHOC-NOW 2004: 158-171 - [c31]Michele Flammini, Alfredo Navarra, Ralf Klasing, Stéphane Pérennes:
Improved approximation results for the minimum energy broadcasting problem. DIALM-POMC 2004: 85-91 - [c30]Ralf Klasing, Alfredo Navarra, Aris A. Papadopoulos, Stephane Perennes:
Adaptive Broadcast Consumption (ABC), a New Heuristic and New Bounds for the Minimum Energy Broadcast Routing Problem. NETWORKING 2004: 866-877 - 2003
- [j27]Andrea E. F. Clementi, Paolo Penna, Afonso Ferreira, Stephane Perennes, Riccardo Silvestri:
The Minimum Range Assignment Problem on Linear Radio Networks. Algorithmica 35(2): 95-110 (2003) - [j26]Jean-Claude Bermond, Johny Bond, David Peleg, Stephane Perennes:
The Power of Small Coalitions in Graphs. Discret. Appl. Math. 127(3): 399-414 (2003) - [j25]Jean-Claude Bermond, Miriam Di Ianni, Michele Flammini, Stephane Perennes:
Deadlock Prevention by Acyclic Orientations. Discret. Appl. Math. 129(1): 31-47 (2003) - [j24]Jérôme Galtier, Ferran Hurtado, Marc Noy, Stephane Perennes, Jorge Urrutia:
Simultaneous Edge Flipping in Triangulations. Int. J. Comput. Geom. Appl. 13(2): 113-133 (2003) - [j23]Jean-Claude Bermond, Sébastien Choplin, Stephane Perennes:
Hierarchical Ring Network design. Theory Comput. Syst. 36(6): 663-682 (2003) - [j22]Jean-Claude Bermond, Nausica Marlin, David Peleg, Stephane Perennes:
Directed virtual path layouts in ATM networks. Theor. Comput. Sci. 291(1): 3-28 (2003) - [j21]Afonso Ferreira, Stephane Perennes, Hervé Rivano, Andréa W. Richa, Nicolás E. Stier Moses:
Models, Complexity and Algorithms for the Design of Multi-fiber WDM Networks. Telecommun. Syst. 24(2-4): 123-138 (2003) - 2002
- [j20]David Coudert, Afonso Ferreira, Stephane Perennes:
Isomorphisms of the De Bruijn digraph and free-space optical networks. Networks 40(3): 155-164 (2002) - [c29]Gurvan Huiban, Stéphane Pérennes, Michel Syska:
Traffic grooming in WDM networks with multi-layer switches. ICC 2002: 2896-2901 - [c28]Jean-Claude Bermond, Sébastien Choplin, Stephane Perennes:
Hierarchical Ring Network Design. SIROCCO 2002: 1-16 - [c27]Aubin Jarry, Stephane Perennes:
Disjoint Paths in Symmetric Digraphs. SIROCCO 2002: 211-222 - 2001
- [j19]Pierre Fraigniaud, Andrzej Pelc, David Peleg, Stephane Perennes:
Assigning labels in an unknown anonymous network with a leader. Distributed Comput. 14(3): 163-183 (2001) - [j18]Marie-Claude Heydemann, Nausica Marlin, Stéphane Pérennes:
Complete Rotations in Cayley Graphs. Eur. J. Comb. 22(2): 179-196 (2001) - [j17]Luisa Gargano, Pavol Hell, Stephane Perennes:
Coloring all directed paths in a symmetric tree, with an application to optical networks. J. Graph Theory 38(4): 183-196 (2001) - [j16]Bruno Beauquier, Stephane Perennes, Olivier Delmas:
Tight Bounds for Broadcasting in the Linear Cost Model. J. Interconnect. Networks 2(2): 175-188 (2001) - [j15]Luisa Gargano, Andrzej Pelc, Stephane Perennes, Ugo Vaccaro:
Efficient communication in unknown networks. Networks 38(1): 39-49 (2001) - [j14]Michele Flammini, Stephane Perennes:
On the Optimality of General Lower Bounds for Broadcasting and Gossiping. SIAM J. Discret. Math. 14(2): 267-282 (2001) - [c26]Ioannis Caragiannis, Afonso Ferreira, Christos Kaklamanis, Stephane Perennes, Hervé Rivano:
Fractional Path Coloring with Applications to WDM Networks. ICALP 2001: 732-743 - [c25]Cyril Gavoille, David Peleg, Stephane Perennes, Ran Raz:
Distance labeling in graphs. SODA 2001: 210-219 - [c24]Ioannis Caragiannis, Afonso Ferreira, Christos Kaklamanis, Stephane Perennes, Pino Persiano, Hervé Rivano:
Approximate Constrained Bipartite Edge Coloring. WG 2001: 21-31 - 2000
- [j13]Pascal Berthomé, Afonso Ferreira, Bruce M. Maggs, Stephane Perennes, C. Greg Plaxton:
Sorting-Based Selection Algorithms for Hypercubic Networks. Algorithmica 26(2): 237-254 (2000) - [j12]Marie-Claude Heydemann, Nausica Marlin, Stéphane Pérennes:
Rotational Cayley Graphs on Transposition Generated Groups. Electron. Notes Discret. Math. 5: 177-180 (2000) - [j11]Jean-Claude Bermond, Luisa Gargano, Stephane Perennes, Adele A. Rescigno, Ugo Vaccaro:
Efficient collective communication in optical networks. Theor. Comput. Sci. 233(1-2): 165-189 (2000) - [c23]Andrea E. F. Clementi, Afonso Ferreira, Paolo Penna, Stephane Perennes, Riccardo Silvestri:
The Minimum Range Assignment Problem on Linear Radio Networks. ESA 2000: 143-154 - [c22]