Méthodes Algorithmiques, Simulation et Combinatoire pour l'OpTimisation des TElécommunications

Fabrice Theoleyre | Afonso Ferreira | Omid Amini | Alfredo Navarra | Jean-Claude Bermond | Olivier Dalle | Faouzi Kaabi | Aubin Jarry | Ralf Klasing | Vincent Siles | Frédéric Havet | Jérôme Galtier | Hervé Rivano | Ephie Deriche | Jean-François Lalande | David Coudert | Michel Cosnard | Zvi Lotker | Stéphane Bessy | Louigi Addario-Berry | Tobias Muller | Tomasz Radzik | Florian Huc | Fabrice Peix | Marie-Emilie Voge | Colin Cooper | Cyrine Mrabet | Philippe Mussi | Pallab Datta | Jean-Sébastien Sereni | Alexandre Laugier | Fabiano Sarracco | Gurvan Huiban | Yannick Brehon | Michel Syska | Joseph Peters | Cristiana Gomes | Joseph Yu | Patricia Lachaume | Stéphane Pérennes | Stéphane Thomassé | Raphael Chand | Pierre-Francois Dutot | Nelson Morales | Séverine Petat | Ricardo Correa | Ross Kang | Marcelo Luis Vinagreiro | Yves Baumes | Foued Ben Hfaiedh | Marie-Laure Gnemmi | Duc Phong Le | Clement Lepelletier | Benjamin Nosenzo | Amar Patel | Ignasi Sau Valls | Christelle Savio | D. Coudert | M. Cosnard | Fabrice Théoleyre | J. Lalande | J. Bermond | Hervé Rivano | F. Huc | Philippe Mussi | Ephie Deriche | P. Lachaume | Afonso Ferreira | Frédéric Havet | Ralf Klasing | S. Pérennes | S. Thomasse | O. Dalle | M. Syska | J. Galtier | A. Laugier | Cyrine Mrabet | Fabrice Peix | Stéphane Bessy | Raphael Chand | Pallab Datta | Pierre-François Dutot | Omid Amini | Gurvan Huiban | Aubin Jarry | Nelson Morales | Séverine Petat | Jean-Sébastien Sereni | M. Voge | Louigi Addario-Berry | Yannick Bréhon | Colin S. Cooper | R. Correa | Ross Kang | Zvi Lotker | Tobias Muller | Alfredo Navarra | J. Peters | Tomasz Radzik | Fabiano Sarracco | Joseph Yu | Yves Baumes | Marie-Laure Gnemmi | Cristiana Gomes | D. Le | Faouzi Kaabi | C. Lepelletier | Benjamin Nosenzo | Amar Patel | I. Valls | C. Savio | Vincent Siles

[1]  Abdelfettah Belghith,et al.  mQMA: Multi-Constrained QoS Multicast Aggregation , 2007, IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference.

[2]  Stéphane Pérennes,et al.  Hardness and approximation of traffic grooming , 2007, Theor. Comput. Sci..

[3]  Nicolas Nisse,et al.  The Cost of Monotonicity in Distributed Graph Searching , 2007, OPODIS.

[4]  Jérôme Galtier,et al.  Tournament MAC with Constant Size Congestion Window for WLAN , 2007, ArXiv.

[5]  Luigi Liquori,et al.  Logical Networks: Towards Foundations for Programmable Overlay Networks and Overlay Computing Systems , 2007, TGC.

[6]  M. Cosnard,et al.  Weaving Arigatoni with a Graph Topology , 2007, International Conference on Advanced Engineering Computing and Applications in Sciences (ADVCOMP'07).

[7]  Gurvan Huiban,et al.  Multiobjective Analysis in Wireless Mesh Networks , 2007, 2007 15th International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems.

[8]  G. Huiban,et al.  Multi-metrics reconfiguration in core WDM networks , 2007, 2007 6th International Workshop on Design and Reliable Communication Networks.

[9]  Júlio Araújo,et al.  Teorema de Hajós para Coloração Ponderada , 2007 .

[10]  Jérôme Galtier,et al.  Analysis and optimization of MAC with constant size congestion window for WLAN , 2007, 2007 Second International Conference on Systems and Networks Communications (ICSNC 2007).

[11]  Bruce A. Reed,et al.  Properly 2-Colouring Linear Hypergraphs , 2007, APPROX-RANDOM.

[12]  Bruce A. Reed,et al.  List Colouring Squares of Planar Graphs , 2007, Electron. Notes Discret. Math..

[13]  Olivier Dalle,et al.  The OSA project: an example of component based software engineering techniques applied to simulation , 2007, SCSC.

[14]  Gabriel A. Wainer,et al.  An open issue on applying sharing modeling patterns in DEVS , 2007, SCSC.

[15]  Afonso Ferreira,et al.  On the Evaluation of Shortest Journeys in Dynamic Networks , 2007, Sixth IEEE International Symposium on Network Computing and Applications (NCA 2007).

[16]  Hervé Rivano,et al.  Models for Optimal Wireless Mesh Network Design , 2007 .

[17]  Stéphan Thomassé,et al.  Paths with two blocks in n-chromatic digraphs , 2007, J. Comb. Theory, Ser. B.

[18]  Nicolas Nisse,et al.  Monotonicity of non-deterministic graph searching , 2007, Theor. Comput. Sci..

[19]  Bruce A. Reed,et al.  Computing crossing number in linear time , 2007, STOC '07.

[20]  Stéphane Pérennes,et al.  Design of Minimal Fault Tolerant On-Board Networks: Practical Constructions , 2007, SIROCCO.

[21]  Hervé Rivano,et al.  Shared Risk Resource Group Complexity and Approximability Issues , 2007, Parallel Process. Lett..

[22]  Luigi Liquori,et al.  Virtual Organizations in Arigatoni , 2007, Electron. Notes Theor. Comput. Sci..

[23]  Omid Amini,et al.  Frugal Colouring of Graphs , 2007, ArXiv.

[24]  Hervé Rivano,et al.  Placement Optimal de points d'accès dans les réseaux radio maillés , 2007 .

[25]  Jean-Claude Bermond,et al.  Allocation de fréquences et coloration impropre des graphes hexagonaux pondérés , 2007 .

[26]  Jean-Claude Bermond,et al.  Vertex disjoint routings of cycles over tori , 2007, Networks.

[27]  Jean-Sébastien Sereni,et al.  Pathwidth of outerplanar graphs , 2007, J. Graph Theory.

[28]  Luigi Liquori,et al.  A Framework for Defining Logical Frameworks , 2007, Computation, Meaning, and Logic.

[29]  Jean-Claude Bermond,et al.  Minimum number of wavelengths equals load in a DAG without internal cycle , 2007, 2007 IEEE International Parallel and Distributed Processing Symposium.

[30]  Luigi Liquori,et al.  Improving Resource Discovery in the Arigatoni Overlay Network , 2007, ARCS.

[31]  Jean-Sébastien Sereni,et al.  Two proofs of Bermond-Thomassen conjecture for regular tournaments , 2007, Electron. Notes Discret. Math..

[32]  Bruce A. Reed,et al.  The Erdős–Pósa Property For Long Circuits , 2007, Comb..

[33]  Jérôme Galtier,et al.  Flow on Data Network and a Positive Semidefinite Representable Delay Function , 2007, J. Interconnect. Networks.

[34]  E. Ng,et al.  On the row merge tree for sparse LU factorization with partial pivoting , 2007 .

[35]  Olivier Dalle,et al.  Component-based Discrete Event Simulation Using the Fractal Component Model , 2007 .

[36]  Bruce A. Reed,et al.  Vertex-Colouring Edge-Weightings , 2007, Comb..

[37]  Stéphane Pérennes,et al.  Asymptotically Optimal Solutions for Small World Graphs , 2005, Theory of Computing Systems.

[38]  Nicolas Nisse,et al.  Nondeterministic Graph Searching: From Pathwidth to Treewidth , 2005, Algorithmica.

[39]  Vasilis Friderikos,et al.  European Conference on Operational Research EURO XXII , 2007 .

[40]  Aline Alves da Silva.  DecomposiÃÃo e largura em Ãrvore de grafos planares livres de ciclos pares induzidos. , 2007 .

[41]  Morales Varela,et al.  Algorithmique des réseaux de communication radio modélisés par de [sic] graphes , 2007 .

[42]  Hervé Rivano,et al.  Shared Risk Resource Groups and Colored Graph: Polynomial Cases and Transformation Issues , 2007 .

[43]  Ignasi Sau Valls.  Optimal Permutation Routing on Mesh Networks , 2007 .

[44]  Jean-Sébastien Sereni,et al.  Orders With Ten Elements Are Circle Order , 2007 .

[45]  Hervé Rivano,et al.  Fair Joint Routing and Scheduling Problem in Wireless Mesh Networks , 2007 .

[46]  Afonso Ferreira,et al.  Using Evolving Graphs Foremost Journeys to Evaluate Ad-Hoc Routing Protocols , 2007 .

[47]  Alberto Ciaffaglione,et al.  Reasoning about Object-based Calculi in (Co)Inductive Type Theory and the Theory of Contexts , 2007, Journal of Automated Reasoning.

[48]  Anders Yeo,et al.  The Minimum Feedback Arc Set Problem is NP-Hard for Tournaments , 2006, Combinatorics, Probability and Computing.

[49]  Jean-Sébastien Sereni,et al.  3-facial Colouring of Plane Graphs , 2006, ArXiv.

[50]  Richard Mateosian,et al.  Old and New , 2006, IEEE Micro.

[51]  Hervé Rivano,et al.  Capacity Evaluation Framework and Validation of Self-Organized Routing Schemes , 2006, 2006 3rd Annual IEEE Communications Society on Sensor and Ad Hoc Communications and Networks.

[52]  Jean-Claude Bermond,et al.  Traffic Grooming in Bidirectional WDM Ring Networks , 2006, 2006 International Conference on Transparent Optical Networks.

[53]  Olivier Dalle,et al.  OSA: an Open Component-based Architecture for Discrete-Event Simulation , 2006 .

[54]  B. Reed,et al.  Faster Mixing and Small Bottlenecks , 2006 .

[55]  Stéphane Pérennes,et al.  Hardness and approximation of gathering in static radio networks , 2006, Fourth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOMW'06).

[56]  Jérôme Galtier,et al.  An integer programming approach to routing in daisy networks , 2006, Networks.

[57]  Luigi Liquori,et al.  Arigatoni: Overlaying Internet via Low Level Network Protocols , 2006 .

[58]  Hervé Rivano,et al.  Optimal positioning of active and passive monitoring devices , 2005, CoNEXT '05.

[59]  Bruce A. Reed,et al.  Degree constrained subgraphs , 2005, Discret. Appl. Math..

[60]  Bruce A. Reed,et al.  Planar graph bipartization in linear time , 2005, Discret. Appl. Math..

[61]  Bruce A. Reed,et al.  Fractionally total colouring Gn, p , 2005, Discret. Appl. Math..

[62]  David Coudert,et al.  Traffic grooming on the path , 2005, Theor. Comput. Sci..

[63]  Stéphane Pérennes,et al.  On the Pathwidth of Planar Graphs , 2005 .

[64]  Bruce A. Reed,et al.  Approximate Min-max Relations for Odd Cycles in Planar Graphs , 2005, IPCO.

[65]  Jean-Sébastien Sereni,et al.  On improper colouring of unit disk graphs , 2005 .

[66]  Laurent Grisoni,et al.  HABILITATION A DIRIGER DES RECHERCHES , 2005 .

[67]  Luigi Liquori,et al.  Towards an Intersection Typed System à la Church , 2005, ITRS.

[68]  Frédéric Havet,et al.  Stable set meeting every longest path , 2004, Discret. Math..

[69]  Stéphane Pérennes,et al.  Improved Approximation Results for the Minimum Energy Broadcasting Problem , 2004, DIALM-POMC '04.

[70]  Luigi Liquori,et al.  iRho: an imperative rewriting calculus , 2004, PPDP '04.

[71]  Charles J. Colbourn,et al.  Grooming in unidirectional rings: K4-e designs , 2004, Discret. Math..

[72]  Stéphane Pérennes,et al.  Adaptive Broadcast Consumption (ABC), a New Heuristic and New Bounds for the Minimum Energy Broadcast Routing Problem , 2004, NETWORKING.

[73]  Hervé Rivano,et al.  Approximate constrained bipartite edge coloring , 2001, Discret. Appl. Math..

[74]  Jean-François Lalande,et al.  Mascopt - A Network Optimization Library: Graph Manipulation , 2004 .

[75]  P. Hell,et al.  Graph Problems Arising from Wavelength-Routing in All-Optical Networks , 2004 .

[76]  Nelson Morales,et al.  Robust models for simultaneous open pit and underground mines , 2003 .

[77]  Hervé Rivano,et al.  Algorithmique et télécommunications : Coloration et multiflot approchés et applications aux réseaux d'infrastructure. (Algorithms and telecommunications : Approximate coloring and multicommodity flow with applications to backbone networks) , 2003 .

[78]  Afonso Ferreira,et al.  Complexity of Connected Components in Evolving Graphs and the Computation of Multicast Trees in Dynamic Networks , 2003, ADHOC-NOW.

[79]  Hervé Rivano,et al.  Models, Complexity and Algorithms for the Design of Multi-fiber WDM Networks , 2003, Telecommun. Syst..

[80]  Jean-Claude Bermond,et al.  On Hamilton cycle decompositions of the tensor product of complete graphs , 2003, Discret. Math..

[81]  Afonso Ferreira,et al.  Generalized Parametric Multi-terminal Flows Problem , 2003, WG.

[82]  Hervé Rivano,et al.  Approximate Multicommodity Flow for WDM Networks Design , 2003, SIROCCO.

[83]  Guido Proietti,et al.  On k-Edge-Connectivity Problems with Sharpened Triangle Inequality , 2003, CIAC.

[84]  Hervé Rivano,et al.  Approximation Combinatoire de Multiflot Factionnaire : Améliorations , 2003 .

[85]  David Coudert,et al.  Traffic grooming in unidirectional WDM ring networks using design theory , 2003, IEEE International Conference on Communications, 2003. ICC '03..

[86]  Frédéric Havet,et al.  Upper bound for the span of (s,1)-total labelling of graphs , 2003 .

[87]  Andrea E. F. Clementi,et al.  On the approximation ratio of the MST based heuristic for the energy-efficient broadcast problem in static ad-hoc radio networks , 2003, Proceedings International Parallel and Distributed Processing Symposium.

[88]  Eitan Altman,et al.  SLOT ALLOCATION IN A TDMA SATELLITE SYSTEM: SIMULATED ANNEALING APPROACH , 2003 .

[89]  Eitan Altman,et al.  RADIO PLANNING IN MULTIBEAM GEOSTATIONARY SATELLITE NETWORKS , 2003 .

[90]  Afonso Ferreira,et al.  Computing Shortest, Fastest, and Foremost Journeys in Dynamic Networks , 2003, Int. J. Found. Comput. Sci..

[91]  Marc Noy,et al.  Simultaneous Edge Flipping in Triangulations , 2003, Int. J. Comput. Geom. Appl..

[92]  Afonso Ferreira,et al.  Evolving graphs and least cost journeys in dynamic networks , 2003 .

[93]  Jean-Claude Bermond,et al.  Minimizing SONET ADMs in unidirectional WDM rings with grooming ratio 3 , 2003, Networks.

[94]  F. Havet,et al.  On Unavoidability of Trees with k Leaves , 2003, Graphs Comb..

[95]  Stéphane Pérennes,et al.  Groupage dans les réseaux dorsaux WDM , 2003 .

[96]  David Coudert,et al.  On DRC‐covering of Kn by cycles , 2003 .

[97]  Sophia Antipolis Cedex,et al.  Graph theory and traffic grooming in WDM rings , 2003 .

[98]  Jean-Claude Bermond,et al.  Traffic Grooming in Unidirectional WDM Ring Networks: the all-to-all unitary case , 2003 .

[99]  Ivan Stojmenovic,et al.  Addressing and Routing in Hexagonal Networks with Applications for Tracking Mobile Users and Connection Rerouting in Cellular Networks , 2002, IEEE Trans. Parallel Distributed Syst..

[100]  Min-Li Yu.  On DRC-Covering of K n by Cycles , 2002 .

[101]  F. Gomes,et al.  UNIVERSIDADE FEDERAL DO CEARÁ , 2002 .

[102]  Dimitri Papadimitriou,et al.  Inference of Shared Risk Link Groups , 2001 .

[103]  Hervé Rivano,et al.  On the design of multifiber WDM networks , 2001 .

[104]  Hervé Rivano,et al.  Fractional path coloring on bounded degree trees , 2001 .

[105]  Frédéric Havet,et al.  Channel assignment and multicolouring of the induced subgraphs of the triangular lattice , 2001, Discret. Math..

[106]  J. Bermond,et al.  Cycle Covering , 2001, SIROCCO.

[107]  X. Munoz,et al.  A multihop multi-OPS optical interconnection network , 2000, Journal of Lightwave Technology.

[108]  Afonso Ferreira,et al.  The Minimum Range Assignment Problem on Linear Radio Networks , 2000, ESA.

[109]  R. Ayani,et al.  Proceedings 8th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems , 2000 .

[110]  Éric Fleury,et al.  ALGOTEL 2000 : 2es rencontres francophones sur les Aspects Algorithmiques des Télécommunications , 2000 .

[111]  Juraj Hromkovic,et al.  Towards the Notion of Stability of Approximation for Hard Optimization Tasks and the Traveling Salesman Problem , 2000, CIAC.

[112]  André Schaff,et al.  Colloque Francophone sur l'Ingénierie des Protocoles - CFIP'99 , 1999 .

[113]  D. Peleg,et al.  Directed virtual path layouts in ATM networks , 2003, Theor. Comput. Sci..

[114]  Jon M. Kleinberg,et al.  Decision algorithms for unsplittable flow and the half-disjoint paths problem , 1998, STOC '98.

[115]  Stéphane Pérennes,et al.  Optimal Wavelength-routed Multicasting , 1998, Discret. Appl. Math..

[116]  Wayne Goddard,et al.  Defective coloring revisited , 1997, J. Graph Theory.

[117]  W. Altemeier,et al.  Miscellaneous , 1848, Brain Research.

[118]  J. Huisman.  The Netherlands , 1996, The Lancet.

[119]  Stéphane Pérennes,et al.  Acyclic Orientations for Deadlock Prevention in Usual Networks , 1996 .

[120]  Stéphane Pérennes,et al.  The Power of Small Coalitions in Graphs , 2003, Discret. Appl. Math..

[121]  Peter L. Hammer,et al.  Discrete Applied Mathematics , 1993 .

[122]  Afonso Ferreira,et al.  Neighbourhood Broadcasting in Hypercubes , 1991 .

[123]  R. Acevedo,et al.  Research report , 1967, Revista odontologica de Puerto Rico.

[124]  H. Grundel,et al.  The London School of Economics , 1938, Nature.

[125]  Vaidy,et al.  8th workshop on Graph Classes, Optimization and Width Parameters , 2022 .

[126]  F. Havet,et al.  Graph colouring and applications , 2022 .