![]() |
Stephane Perennes
List of publications from the DBLP Bibliography Server - FAQ
| 2009 | ||
|---|---|---|
| 82 | EE | 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 |
| 81 | EE | Aubin Jarry, Stéphane Pérennes: Disjoint paths in symmetric digraphs. Discrete Applied Mathematics 157(1): 90-97 (2009) |
| 2008 | ||
| 80 | EE | 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 |
| 79 | EE | Omid Amini, David Peleg, Stéphane Pérennes, Ignasi Sau, Saket Saurabh: Degree-Constrained Subgraph Problems: Hardness and Approximation Results. WAOA 2008: 29-42 |
| 78 | EE | 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) |
| 77 | EE | 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) |
| 76 | EE | Michele Flammini, Ralf Klasing, Alfredo Navarra, Stephane Perennes: Tightening the upper bound for the minimum energy broadcasting. Wireless Networks 14(5): 659-669 (2008) |
| 2007 | ||
| 75 | EE | Omid Amini, Stéphane Pérennes, Ignasi Sau: Hardness and Approximation of Traffic Grooming. ISAAC 2007: 561-573 |
| 74 | EE | 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 |
| 73 | EE | Michele Flammini, Ralf Klasing, Alfredo Navarra, Stephane Perennes: Improved Approximation Results for the Minimum Energy Broadcasting Problem. Algorithmica 49(4): 318-336 (2007) |
| 72 | EE | David Coudert, P. Datta, Stephane Perennes, Hervé Rivano, Marie-Emilie Voge: Shared Risk Resource Group Complexity and Approximability Issues. Parallel Processing Letters 17(2): 169-184 (2007) |
| 71 | EE | Jean-Claude Bermond, Afonso Ferreira, Stéphane Pérennes, Joseph G. Peters: Neighborhood Broadcasting in Hypercubes. SIAM J. Discrete Math. 21(4): 823-843 (2007) |
| 2006 | ||
| 70 | EE | 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 |
| 69 | EE | 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 |
| 68 | EE | 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 |
| 67 | EE | Michele Flammini, Alfredo Navarra, Stephane Perennes: The "real" approximation factor of the MST heuristic for the minimum energy broadcasting. ACM Journal of Experimental Algorithmics 11: (2006) |
| 66 | EE | 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) |
| 65 | EE | Jean-Claude Bermond, Jérôme Galtier, Ralf Klasing, Nelson Morales, Stephane Perennes: Hardness and Approximation of Gathering in Static Radio Networks. Parallel Processing Letters 16(2): 165-184 (2006) |
| 2005 | ||
| 64 | EE | Michele Flammini, Luca Moscardelli, Alfredo Navarra, Stéphane Pérennes: Asymptotically Optimal Solutions for Small World Graphs. DISC 2005: 414-428 |
| 63 | EE | Ralf Klasing, Zvi Lotker, Alfredo Navarra, Stephane Perennes: From Balls and Bins to Points and Vertices. ISAAC 2005: 757-766 |
| 62 | EE | 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 |
| 61 | EE | Sébastien Choplin, Aubin Jarry, Stéphane Pérennes: Virtual network embedding in the cycle. Discrete Applied Mathematics 145(3): 368-375 (2005) |
| 60 | EE | Michele Flammini, Stéphane Pérennes: Lower bounds on systolic gossip. Inf. Comput. 196(2): 71-94 (2005) |
| 2004 | ||
| 59 | EE | Zvi Lotker, Marc Martinez de Albeniz, Stephane Perennes: Range-Free Ranking in Sensors Networks and Its Applications to Localization. ADHOC-NOW 2004: 158-171 |
| 58 | EE | Michele Flammini, Alfredo Navarra, Ralf Klasing, Stéphane Pérennes: Improved approximation results for the minimum energy broadcasting problem. DIALM-POMC 2004: 85-91 |
| 57 | EE | 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 |
| 56 | EE | Ioannis Caragiannis, Afonso Ferreira, Christos Kaklamanis, Stephane Perennes, Pino Persiano, Hervé Rivano: Approximate constrained bipartite edge coloring. Discrete Applied Mathematics 143(1-3): 54-61 (2004) |
| 55 | EE | Cyril Gavoille, David Peleg, Stéphane Pérennes, Ran Raz: Distance labeling in graphs. J. Algorithms 53(1): 85-112 (2004) |
| 54 | EE | Michele Flammini, Stéphane Pérennes: Lower Bounds on the Broadcasting and Gossiping Time of Restricted Protocols. SIAM J. Discrete Math. 17(4): 521-540 (2004) |
| 2003 | ||
| 53 | EE | 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) |
| 52 | EE | Jean-Claude Bermond, Johny Bond, David Peleg, Stephane Perennes: The Power of Small Coalitions in Graphs. Discrete Applied Mathematics 127(3): 399-414 (2003) |
| 51 | EE | Jean-Claude Bermond, Miriam Di Ianni, Michele Flammini, Stephane Perennes: Deadlock Prevention by Acyclic Orientations. Discrete Applied Mathematics 129(1): 31-47 (2003) |
| 50 | EE | Jérôme Galtier, Ferran Hurtado, Marc Noy, Stephane Perennes, Jorge Urrutia: Simultaneous Edge Flipping in Triangulations. Int. J. Comput. Geometry Appl. 13(2): 113-133 (2003) |
| 49 | EE | 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. Telecommunication Systems 24(2-4): 123-138 (2003) |
| 48 | Jean-Claude Bermond, Nausica Marlin, David Peleg, Stephane Perennes: Directed virtual path layouts in ATM networks. Theor. Comput. Sci. 291(1): 3-28 (2003) | |
| 47 | EE | Jean-Claude Bermond, Sébastien Choplin, Stephane Perennes: Hierarchical Ring Network design. Theory Comput. Syst. 36(6): 663-682 (2003) |
| 2002 | ||
| 46 | Jean-Claude Bermond, Sébastien Choplin, Stephane Perennes: Hierarchical Ring Network Design. SIROCCO 2002: 1-16 | |
| 45 | Aubin Jarry, Stephane Perennes: Disjoint Paths in Symmetric Digraphs. SIROCCO 2002: 211-222 | |
| 44 | EE | David Coudert, Afonso Ferreira, Stephane Perennes: Isomorphisms of the De Bruijn digraph and free-space optical networks. Networks 40(3): 155-164 (2002) |
| 2001 | ||
| 43 | EE | Ioannis Caragiannis, Afonso Ferreira, Christos Kaklamanis, Stephane Perennes, Hervé Rivano: Fractional Path Coloring with Applications to WDM Networks. ICALP 2001: 732-743 |
| 42 | EE | Cyril Gavoille, David Peleg, Stephane Perennes, Ran Raz: Distance labeling in graphs. SODA 2001: 210-219 |
| 41 | EE | Ioannis Caragiannis, Afonso Ferreira, Christos Kaklamanis, Stephane Perennes, Pino Persiano, Hervé Rivano: Approximate Constrained Bipartite Edge Coloring. WG 2001: 21-31 |
| 40 | EE | Pierre Fraigniaud, Andrzej Pelc, David Peleg, Stephane Perennes: Assigning labels in an unknown anonymous network with a leader. Distributed Computing 14(3): 163-183 (2001) |
| 39 | EE | Marie-Claude Heydemann, Nausica Marlin, Stéphane Pérennes: Complete Rotations in Cayley Graphs. Eur. J. Comb. 22(2): 179-196 (2001) |
| 38 | Bruno Beauquier, Stephane Perennes, Olivier Delmas: Tight Bounds for Broadcasting in the Linear Cost Model. Journal of Interconnection Networks 2(2): 175-188 (2001) | |
| 37 | EE | Luisa Gargano, Andrzej Pelc, Stephane Perennes, Ugo Vaccaro: Efficient communication in unknown networks. Networks 38(1): 39-49 (2001) |
| 36 | EE | Michele Flammini, Stephane Perennes: On the Optimality of General Lower Bounds for Broadcasting and Gossiping. SIAM J. Discrete Math. 14(2): 267-282 (2001) |
| 2000 | ||
| 35 | 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 | |
| 34 | EE | Jean-Claude Bermond, Takako Kodate, Stephane Perennes, Alexis Bonnecaze, Patrick Solé: Broadcasting in Hypercubes in the Circuit Switched Model. IPDPS 2000: 21-26 |
| 33 | EE | David Coudert, Afonso Ferreira, Stephane Perennes: De Bruijn Isomorphisms and Free Space Optical Networks. IPDPS 2000: 769- |
| 32 | EE | Arunabha Sen, K. Selçuk Candan, Afonso Ferreira, Bruno Beauquier, Stephane Perennes: On Shortest Path Problems with "Non-Markovian" Link Contribution to Path Lengths. NETWORKING 2000: 859-870 |
| 31 | EE | Pierre Fraigniaud, Andrzej Pelc, David Peleg, Stephane Perennes: Assigning labels in unknown anonymous networks (extended abstract). PODC 2000: 101-111 |
| 30 | EE | Luisa Gargano, Andrzej Pelc, Stephane Perennes, Ugo Vaccaro: Efficient Communication in Unknown Networks. WG 2000: 172-183 |
| 29 | EE | 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) |
| 28 | EE | Marie-Claude Heydemann, Nausica Marlin, Stéphane Pérennes: Rotational Cayley Graphs on Transposition Generated Groups. Electronic Notes in Discrete Mathematics 5: 177-180 (2000) |
| 27 | EE | 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) |
| 1999 | ||
| 26 | EE | Bruno Beauquier, Stephane Perennes, David Tóth: All-to-All Routing and Coloring in Weighted Trees of Rings. SPAA 1999: 185-190 |
| 1998 | ||
| 25 | EE | Jean-Claude Bermond, Nausica Marlin, David Peleg, Stephane Perennes: Directed Virtual Path Layouts in ATM Networks. DISC 1998: 75-88 |
| 24 | EE | Stephane Perennes: Broadcasting and gossiping on de Bruijn, shuffle-exchange and similar networks. Discrete Applied Mathematics 83(1-3): 247-262 (1998) |
| 23 | EE | Bruno Beauquier, Pavol Hell, Stephane Perennes: Optimal Wavelength-routed Multicasting. Discrete Applied Mathematics 84(1-3): 15-20 (1998) |
| 22 | EE | Jean-Claude Bermond, Olivier Delmas, Éric Darrot, Stephane Perennes: Hamilton Circuits in the Directed Wrapped Butterfly Network. Discrete Applied Mathematics 84(1-3): 21-42 (1998) |
| 21 | EE | Jean-Claude Bermond, Luisa Gargano, Stephane Perennes: Optimal Sequential Gossiping by Short Messages. Discrete Applied Mathematics 86(2-3): 145-155 (1998) |
| 20 | EE | José Gómez, Carles Padró, Stephane Perennes: Large Generalized Cycles. Discrete Applied Mathematics 89(1-3): 107-123 (1998) |
| 19 | Satoshi Fujita, Stephane Perennes, Joseph G. Peters: Neighbourhood Gossiping in Hypercubes. Parallel Processing Letters 8(2): 189-195 (1998) | |
| 18 | Jean-Claude Bermond, Éric Darrot, Olivier Delmas, Stephane Perennes: Hamilton Cycle Decomposition of the Butterfly Network. Parallel Processing Letters 8(3): 371-385 (1998) | |
| 1997 | ||
| 17 | Luisa Gargano, Pavol Hell, Stephane Perennes: Colouring Paths in Directed Symmetric Trees with Applications to WDM Routing. ICALP 1997: 505-515 | |
| 16 | EE | Michele Flammini, Stephane Perennes: Lower Bounds on Systolic Gossip. IPPS 1997: 517-521 |
| 15 | Jean-Claude Bermond, Miriam Di Ianni, Michele Flammini, Stephane Perennes: Acyclic Orientations for Deadlock Prevention in Interconnection Networks (Extended Abstract). WG 1997: 52-64 | |
| 14 | EE | Stephane Perennes: A Proof of Jean De Rumeur's Conjecture. Discrete Applied Mathematics 74(3): 295-299 (1997) |
| 13 | Jean-Claude Bermond, Hovhannes A. Harutyunyan, Arthur L. Liestman, Stephane Perennes: A Note on the Dimensionality of Modified Knö;del Graphs. Int. J. Found. Comput. Sci. 8(2): 109- (1997) | |
| 1996 | ||
| 12 | Stephane Perennes: Lower Bounds on Broadcasting Time of de Bruijn Networks. Euro-Par, Vol. I 1996: 325-332 | |
| 11 | Satoshi Fujita, Christian Laforest, Stephane Perennes: A Gossip Algorithm for Bus Networks with Buses of Limited Length. Euro-Par, Vol. I 1996: 353-360 | |
| 10 | Olivier Delmas, Stephane Perennes: Circuit-Switched Gossiping in 3-Dimensional Torus Networks. Euro-Par, Vol. I 1996: 370-373 | |
| 9 | Jean-Claude Bermond, Luisa Gargano, Stephane Perennes, Adele A. Rescigno, Ugo Vaccaro: Efficient Collective Communication in Optical Networks. ICALP 1996: 574-585 | |
| 8 | Cyril Gavoille, Stephane Perennes: Memory Requirements for Routing in Distributed Networks (Extended Abstract). PODC 1996: 125-133 | |
| 7 | Jean-Claude Bermond, Johny Bond, David Peleg, Stephane Perennes: Tight Bounds on the Size of 2-Monopolies. SIROCCO 1996: 170-179 | |
| 6 | Cyril Gavoille, Stephane Perennes: Lower Bounds for Shortest Path Interval Routing. SIROCCO 1996: 88-103 | |
| 5 | EE | Pascal Berthomé, Afonso Ferreira, Stephane Perennes: Optimal Information Dissemination in Star and Pancake Networks. IEEE Trans. Parallel Distrib. Syst. 7(12): 1292-1300 (1996) |
| 1995 | ||
| 4 | Jean-Claude Bermond, Takako Kodate, Stephane Perennes: Gossiping in Cayley Graphs by Packets. Combinatorics and Computer Science 1995: 301-315 | |
| 3 | Jean-Claude Bermond, Stephane Perennes: Efficient Broadcasting Protocols on the de Bruijn and Similar Networks. SIROCCO 1995: 199-209 | |
| 1993 | ||
| 2 | Pascal Berthomé, Afonso Ferreira, Bruce M. Maggs, Stephane Perennes, C. Greg Plaxton: Sorting-Based Selection Algorithms for Hypercube Networks. IPPS 1993: 89-95 | |
| 1 | Afonso Ferreira, Pascal Berthomé, Stephane Perennes: Optimal Information Dissemination in Star and Pancake Networks. SPDP 1993: 720-725 | |