EN FR
EN FR




Bibliography

Major publications by the team in recent years
  • 1E. Altman, P. Nain, J.-C. Bermond.

    Distributed Storage Management of Evolving Files in Delay Tolerant Ad Hoc Networks, in: INFOCOM 2009, Rio De Janeiro, Brazil, April 2009, p. 1431 - 1439.

    http://dx.doi.org/10.1109/INFCOM.2009.5062059
  • 2J.-C. Bermond, F. Ergincan, M. Syska.

    Line Directed Hypergraphs, in: Quisquater Festschrift, D. Naccache (editor), Lecture Notes in Computer Science, Springer-Verlag, Berlin Heidelberg, 2011, vol. 6805, p. 25-34.
  • 3C. Caillouet, S. Pérennes, H. Rivano.

    Framework for Optimizing the Capacity of Wireless Mesh Networks, in: Computer Communications, 2011, vol. 34, no 13, p. 1645-1659. [ DOI : 10.1016/j.comcom.2011.03.002 ]

    http://hal.inria.fr/inria-00572967/en
  • 4I. Caragiannis, A. Ferreira, C. Kaklamanis, S. Pérennes, H. Rivano.

    Fractional Path Coloring in Bounded Degree Trees with Applications, in: Algorithmica, 2010, vol. 58, no 2, p. 516-540.

    http://dx.doi.org/10.1007/s00453-009-9278-3
  • 5N. Cohen, D. Coudert, D. Mazauric, N. Nepomuceno, N. Nisse.

    Tradeoffs in process strategy games with application in the WDM reconfiguration problem, in: Theoretical Computer Science (TCS), August 2011, vol. 412, no 35, p. 4675-4687.

    http://dx.doi.org/10.1016/j.tcs.2011.05.002
  • 6D. Coudert, P. Datta, S. Pérennes, H. Rivano, M.-E. Voge.

    Shared Risk Resource Group: Complexity and Approximability issues, in: Parallel Processing Letters, June 2007, vol. 17, no 2, p. 169-184.
  • 7O. Dalle, E. Mancini.

    Traces Generation to Simulate Large-Scale Distributed Applications, in: Winter Simulation Conference, Phoenix, AZ, United States, S. Jain, R. R. Creasey, J. Himmelspach, K. P. White, M. Fu (editors), 2011.

    http://hal.inria.fr/inria-00634620/en/
  • 8F. V. Fomin, P. Fraigniaud, N. Nisse.

    Nondeterministic Graph Searching: From Pathwidth to Treewidth, in: Algorithmica, 2009, vol. 53, no 3, p. 358-373.

    http://www.springerlink.com/content/42g5tp1588w89186/
  • 9F. Giroire.

    Order statistics and estimating cardinalities of massive data sets, in: Discrete Applied Mathematics, 2009, vol. 157, no 2, p. 406-427.

    http://dx.doi.org/10.1016/j.dam.2008.06.020
  • 10F. Giroire, D. Mazauric, J. Moulierac, B. Onfroy.

    Minimizing Routing Energy Consumption: from Theoretical to Practical Results, in: IEEE/ACM International Conference on Green Computing and Communications (GreenCom'10), Hangzhou, China, 2010, 8 p.
  • 11D. Gonçalves, F. Havet, A. Pinlou, S. Thomassé.

    Spanning galaxies in digraphs, in: European Conference on Combinatorics, Graph Theory and Applications (Eurocomb 2009), Bordeaux, France, Electronic Notes on Discrete Mathematics, September 2009, vol. 34, p. 139–143.
  • 12F. Havet, M. Klazar, J. Kratochvíl, D. Kratsch, M. Liedloff.

    Exact algorithms for L(2,1)-labelling, in: Algorithmica, 2011, vol. 59, no 2, p. 169–194.
Publications of the year

Doctoral Dissertations and Habilitation Theses

Articles in International Peer-Reviewed Journal

  • 17V. Andova, N. Cohen, R. Škrekovski.

    Graph Classes (Dis)satisfying the Zagreb Indices Inequality, in: MATCH Commun. Math. Comput. Chem., 2011, vol. 65, no 3, p. 647-658.
  • 18J. Araújo, N. Cohen, F. Giroire, F. Havet.

    Good edge-labelling of graphs, in: Discrete Applied Mathematics, 2011, In press. [ DOI : 10.1016/j.dam.2011.07.021 ]

    http://hal.inria.fr/inria-00383343_v4/
  • 19J. Araújo, C. L. Sales.

    On the Grundy number of graphs with few P4's, in: Discrete Applied Mathematics, 2011, In press. [ DOI : 10.1016/j.dam.2011.08.016 ]

    http://www.sciencedirect.com/science/article/pii/S0166218X11003258
  • 20S. Baruah, V. Bonifaci, G. D'Angelo, H. Li, A. Marchetti-Spaccamela, N. Megow, L. Stougie.

    Scheduling Real-time Mixed-criticality Jobs, in: IEEE Transactions on Computers, July 2011, In press. [ DOI : 10.1109/TC.2011.142 ]

    http://hal.inria.fr/hal-00643942/en/
  • 21M. Basavaraju, L. S. Chandran, N. Cohen, F. Havet, T. Müller.

    Acyclic edge-coloring of planar graphs, in: SIAM Journal of Discrete Mathematics, 2011, vol. 25, no 2, p. 463–478.
  • 22J. Beauquier, J. Burman, S. Kutten.

    A self-stabilizing Transformer for Population Protocols with Covering, in: Theoretical Computer Science, 2011, vol. 412, no 33, p. 4247-4259. [ DOI : 10.1016/j.tcs.2010.09.016 ]
  • 23J.-C. Bermond, Y. M. Chee, N. Cohen, X. Zhang.

    The α-Arboricity of Complete Uniform Hypergraphs, in: SIAM Journal on Discrete Mathematics, 2011, vol. 25, no 2, p. 600-610.
  • 24J.-C. Bermond, X. Muñoz, I. Sau.

    Traffic Grooming in Bidirectional WDM Ring Networks, in: Networks, 2011, vol. 58, no 1, p. 20-35.

    http://dx.doi.org/10.1002/net.20410
  • 25B. Brešar, F. Kardoš, J. Katrenič, G. Semanišin.

    Minimum k-path vertex cover, in: Discrete Applied Mathematics, 2011, vol. 159, no 12, p. 1189-1195.
  • 26C. Caillouet, S. Pérennes, H. Rivano.

    Framework for Optimizing the Capacity of Wireless Mesh Networks, in: Computer Communications, 2011, vol. 34, no 13, p. 1645-1659. [ DOI : 10.1016/j.comcom.2011.03.002 ]

    http://hal.inria.fr/inria-00572967/en
  • 27J. Chalopin, V. Chepoi, N. Nisse, Y. Vaxès.

    Cop and robber games when the robber can hide and ride, in: SIAM Journal of Discrete Maths., 2011, vol. 25, no 1, p. 333-359.

    http://hal.archives-ouvertes.fr/inria-00448243/fr/
  • 28N. Cohen, D. Coudert, D. Mazauric, N. Nepomuceno, N. Nisse.

    Tradeoffs in process strategy games with application in the WDM reconfiguration problem, in: Theoretical Computer Science (TCS), August 2011, vol. 412, no 35, p. 4675-4687.

    http://dx.doi.org/10.1016/j.tcs.2011.05.002
  • 29N. Cohen, F. Havet.

    Linear and 2-Frugal Choosability of Graphs of Small Maximum Average Degree, in: Graphs and Combinatorics, 2011, vol. 27, no 6, p. 831-849.

    http://hal.inria.fr/inria-00459692/
  • 30D. Coudert, F. Giroire, I. Sau.

    Circuits in graphs through a prescribed set of ordered vertices, in: Journal of Interconnection Networks (JOIN), 2011, vol. 11, no 3-4, p. 121-141.

    http://dx.doi.org/10.1142/S0219265910002763
  • 31D. Coudert, F. Huc, D. Mazauric.

    A distributed algorithm for computing the process number in trees, in: Algorithmica, 2011, In press.

    http://dx.doi.org/10.1007/s00453-011-9524-3
  • 32D. Coudert, J.-S. Sereni.

    Characterization of graphs and digraphs with small process number, in: Discrete Applied Mathematics (DAM), jul 2011, vol. 159, no 11, p. 1094-1109.

    http://dx.doi.org/10.1016/j.dam.2011.03.010
  • 33J. Czap, S. Jendrol', F. Kardoš.

    Facial parity edge colouring, in: Ars Mathematica Contemporanea, 2011, vol. 4, no 2, p. 255-269.
  • 34J. Czap, S. Jendrol', F. Kardoš.

    On the strong parity chromatic number, in: Discussiones Mathematicae Graph Theory, 2011, vol. 31, p. 587-600.
  • 35J. Czap, S. Jendrol', F. Kardoš, J. Miškuf.

    Looseness of Plane Graphs, in: Graphs and Combinatorics, 2011, vol. 27, no 1, p. 73-85.
  • 36G. D'Angelo, G. Di Stefano, A. Navarra.

    Minimize the Maximum Duty in Multi-interface Networks, in: Algorithmica, May 2011, In press. [ DOI : 10.1007/s00453-011-9531-4 ]

    http://hal.inria.fr/hal-00643961/en/
  • 37G. D'Angelo, G. Di Stefano, A. Navarra, C. Pinotti.

    Recoverable Robust Timetables: An Algorithmic Approach on Trees, in: IEEE Transactions on Computers, March 2011, vol. 60, no 3, p. 433 - 446. [ DOI : 10.1109/TC.2010.142 ]

    http://hal.inria.fr/hal-00643980/en/
  • 38R. Erman, F. Havet, B. Lidický, O. Pangrác.

    5-colouring graphs with 4 crossings, in: SIAM Journal on Discrete Mathematics, 2011, vol. 25, no 1, p. 401-422.
  • 39L. Esperet, F. Kardoš, A. D. King, D. Král', S. Norine.

    Exponentially many perfect matchings in cubic graphs, in: Advances in Mathematics, 2011, vol. 227, no 4, p. 1646-1664.
  • 40L. Esperet, F. Kardoš, D. Král'.

    A superlinear bound on the number of perfect matchings in cubic bridgeless graphs, in: European Journal of Combinatorics, 2011, In press. [ DOI : 10.1016/j.ejc.2011.09.027 ]
  • 41F. Havet, S. Jendrol', R. Soták, E. Škrabul'áková.

    Facial non-repetitive edge-colouring of plane graphs, in: Journal of Graph Theory, 2011, vol. 66, no 1, p. 38–48.

    http://hal.inria.fr/inria-00366589/en/
  • 42F. Havet, M. Klazar, J. Kratochvíl, D. Kratsch, M. Liedloff.

    Exact algorithms for L(2,1)-labelling, in: Algorithmica, 2011, vol. 59, no 2, p. 169–194.
  • 43F. Havet, C. L. Sales, L. Sampaio.

    b-coloring of tight graphs, in: Discrete Applied Mathematics, 2011, In press. [ DOI : 10.1016/j.dam.2011.10.017 ]

    http://www.sciencedirect.com/science/article/pii/S0166218X11003921
  • 44F. Kardoš, J. Katrenič, I. Schiermeyer.

    On computing the minimum 3-path vertex cover and dissociation number of graphs, in: Theoretical Computer Science, 2011, vol. 412, no 50, p. 7009-7017.
  • 45F. Kardoš, D. Král', J. Volec.

    Fractional colorings of cubic graphs with large girth, in: SIAM Journal on Discrete Mathematics, 2011, vol. 25, no 3, p. 1454-1476.

Articles in Non Peer-Reviewed Journal

  • 46O. Dalle.

    Should Simulation Products Use Software Engineering Techniques or Should They Reuse Products of Software Engineering? – Part 1, in: Modeling & Simulation Magazine, 07 2011, vol. 11, no 3, Online publication.

    http://hal.inria.fr/inria-00638553
  • 47O. Dalle.

    Should Simulation Products Use Software Engineering Techniques or Should They Reuse Products of Software Engineering? – Part 2, in: Modeling & Simulation Magazine, 10 2011, vol. 11, no 4, Online publication.

    http://hal.inria.fr/inria-00638555_v1/

International Conferences with Proceedings

  • 48J. Araújo, J.-C. Bermond, F. Giroire, F. Havet, D. Mazauric, R. Modrzejewski.

    Weighted Improper Colouring, in: Proceedings of International Workshop on Combinatorial Algorithms (IWOCA'11), Victoria, Canada, Lecture Notes in Computer Science, Springer-Verlag, June 2011, vol. 7056, p. 1-18.
  • 49J. Araújo, V. Campos, F. Giroire, L. Sampaio, R. Soares.

    On the hull number of some graph classes, in: Proceedings of European Conference on Combinatorics, Graph Theory and Applications (EuroComb'11), Budapest, Hungary, September 2011.
  • 50J. Araújo, F. Giroire, J. Monteiro.

    Hybrid Approaches for Distributed Storage Systems, in: Proceedings of Fourth International Conference on Data Management in Grid and P2P Systems (Globe'11), Toulouse, France, September 2011.

    http://hal.inria.fr/inria-00635781/fr/
  • 51J. Bang-Jensen, F. Havet, N. Trotignon.

    Finding an induced subdivision of a digraph, in: VI Latin-American Algorithms, Graphs and Optimization Symposium (LAGOS 2011), Bariloche, Argentina, 04 2011, vol. 37, p. 09-14.
  • 52S. Baruah, V. Bonifaci, G. D'Angelo, A. Marchetti-Spaccamela, S. Ster, L. Stougie.

    Mixed-Criticality Scheduling of Sporadic Task Systems, in: 19th Annual European Symposium on Algorithms (ESA 2011), Saarbruecken, Germany, C. Demetrescu, M. M. Halldórsson (editors), Lecture Notes in Computer Science, Springer, August 2011, vol. 6942, p. 555-566. [ DOI : 10.1007/978-3-642-23719-5_47 ]

    http://hal.inria.fr/hal-00643987/en/
  • 53J. Beauquier, P. Blanchard, J. Burman, S. Delaet.

    Computing Time Complexity of Population Protocols with Cover Times - the ZebraNet Example, in: 13th International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS 2011, Lecture Notes in Computer Science, Springer, 2011, p. 47-61. [ DOI : 10.1007/978-3-642-24550-3_6 ]

    http://hal.inria.fr/hal-00639583/en/
  • 54J. Beauquier, J. Burman.

    Self-stabilizing Mutual Exclusion and Group Mutual Exclusion for Population Protocols with Covering, in: 15th International Conference On Principles Of Distributed Systems, OPODIS 2011, Lecture Notes in Computer Science, Springer, 2011.

    http://hal.inria.fr/hal-00639651/en/
  • 55F. Becker, M. Matamala, N. Nisse, I. Rapaport, K. Suchan, I. Todinca.

    Adding a referee to an interconnection network: What can(not) be computed in one round, in: 25th IEEE International Parallel & Distributed Processing Symposium (IPDPS), IEEE, 2011, p. 508-514.

    http://arxiv.org/abs/1009.4447
  • 56J.-C. Bermond, L. Gargano, S. Pérennes, A. Rescigno, U. Vaccaro.

    Optimal Time Data Gathering in Wireless Networks with Omni-Directional Antennas, in: SIROCCO 2011, Gdansk, Poland, Lecture Notes in Computer Science, Springer-Verlag, June 2011, vol. 6796, p. 306-317.
  • 57C. Caillouet, X. Li, T. Razafindralambo.

    A Multi-objective Approach for Data Collection in Wireless Sensor Networks, in: 10th International Conference on Ad Hoc Networks and Wireless (AdHocNow), Padderborn, Germany, July 2011.

    http://hal.inria.fr/inria-00601679/en
  • 58V. Campos, C. Linhares Sales, K. Maia, N. Martins, R. Sampaio.

    Restricted coloring problems on graphs with few P 4 's, in: LAGOS'11 - VI Latin-American Algorithms, Graphs and Optimization Symposium, 2011, vol. 37, no 0, p. 57–62. [ DOI : 10.1016/j.endm.2011.05.011 ]

    http://www.sciencedirect.com/science/article/pii/S1571065311000126
  • 59G. Claßen, D. Coudert, A. Koster, N. Nepomuceno.

    A Chance-Constrained Model & Cutting Planes for Fixed Broadband Wireless Networks, in: International Network Optimization Conference (INOC), Hamburg, Germany, Lecture Notes in Computer Science, June 2011, vol. 6701, p. 37-42. [ DOI : 10.1007/978-3-642-21527-8_5 ]
  • 60G. Claßen, D. Coudert, A. Koster, N. Nepomuceno.

    Bandwidth assignment for reliable fixed broadband wireless networks, in: 12th IEEE International Symposium on a World of Wireless Mobile and Multimedia Networks (WoWMoM), Lucca, Italy, IEEE, June 2011, p. 1-6. [ DOI : 10.1109/WoWMoM.2011.5986471 ]
  • 61D. Coudert, N. Nepomuceno, I. Tahiri.

    Energy saving in fixed wireless broadband networks, in: International Network Optimization Conference (INOC), Hamburg, Germany, Lecture Notes in Computer Science, June 2011, vol. 6701, p. 484-489. [ DOI : 10.1007/978-3-642-21527-8_53 ]
  • 62G. D'Angelo, M. D'Emidio, D. Frigioni, V. Maurizio.

    A Speed-Up Technique for Distributed Shortest Paths Computation, in: 11th International Conference on Computational Science and Its Applications (ICCSA 2011), Santander, Spain, B. Murgante, O. Gervasi, A. Iglesias, D. Taniar, B. O. Apduhan (editors), Lecture Notes in Computer Science, Springer, June 2011, vol. 6783, p. 578-593. [ DOI : 10.1007/978-3-642-21887-3_44 ]

    http://hal.inria.fr/hal-00644049/en/
  • 63G. D'Angelo, G. Di Stefano, A. Navarra.

    Bandwidth Constrained Multi-interface Networks, in: 37th Conference on Current Trends in Theory and Practice of Computer Science, Nový Smokovec, Slovakia, I. Cerná, T. Gyimóthy, J. Hromkovic, K. Jefferey, R. Královic, M. Vukolic, S. Wolf (editors), Lecture Notes in Computer Science, Springer, January 2011, vol. 6543, p. 202-213. [ DOI : 10.1007/978-3-642-18381-2_17 ]

    http://hal.inria.fr/hal-00644104/en/
  • 64G. D'Angelo, G. Di Stefano, A. Navarra.

    Gathering of Six Robots on Anonymous Symmetric Rings, in: Structural Information and Communication Complexity, Gdansk, Poland, A. Kosowski, M. Yamashita (editors), Lecture Notes in Computer Science, Springer, July 2011, vol. 6796, p. 174-185. [ DOI : 10.1007/978-3-642-22212-2_16 ]

    http://hal.inria.fr/hal-00644039/en/
  • 65G. D'Angelo, G. Di Stefano, A. Navarra.

    Maximum Flow and Minimum-Cost Flow in Multi-Interface Networks, in: 5th International Conference on Ubiquitous Information Management and Communication, Seoul, Korea, Republic Of, ACM, February 2011, 19 p. [ DOI : 10.1145/1968613.1968637 ]

    http://hal.inria.fr/hal-00644073/en/
  • 66G. D'Angelo, G. Di Stefano, A. Navarra.

    Min-Max Coverage in Multi-interface Networks, in: 37th Conference on Current Trends in Theory and Practice of Computer Science, Nový Smokovec, Slovakia, I. Cerná, T. Gyimóthy, J. Hromkovic, K. Jefferey, R. Královic, M. Vukolic, S. Wolf (editors), Lecture Notes in Computer Science, Springer, January 2011, vol. 6543, p. 190-201. [ DOI : 10.1007/978-3-642-18381-2_16 ]

    http://hal.inria.fr/hal-00644084/en/
  • 67G. D'Angelo, D. Frigioni, C. Vitale.

    Dynamic Arc-Flags in Road Networks, in: 10th International Symposium, SEA 2011, Kolimpari, Chania, Crete, Greece, P. M. Pardalos, S. Rebennack (editors), Lecture Notes in Computer Science, Springer, April 2011, vol. 6630, p. 88-99. [ DOI : 10.1007/978-3-642-20662-7_8 ]

    http://hal.inria.fr/hal-00644054/en/
  • 68O. Dalle, E. Mancini.

    Traces Generation to Simulate Large-Scale Distributed Applications, in: Winter Simulation Conference, Phoenix, AZ, United States, S. Jain, R. R. Creasey, J. Himmelspach, K. P. White, M. Fu (editors), 2011.

    http://hal.inria.fr/inria-00634620/en/
  • 69O. Dalle, J. Ribault.

    Some Desired Features for the DEVS Architecture Description Language, in: Proceedings of the Symposium On Theory of Modeling and Simulation – DEVS Integrative M&S Symposium (TMS/DEVS 2011), Boston, MA, USA, 04 2011, vol. Book 4 – Symposium on Theory of Modeling & Simulation - DEVS Integrative M&S Symposium (TMS/DEVS), p. 258-263.

    http://hal.inria.fr/inria-00638565/en/
  • 70S. Felix, J. Galtier.

    Shortest Paths and Probabilities on Time-Dependent Graphs - Applications to Transport Networks, in: Proceedings of the 11th International Conference on ITS Telecommunications, Saint Petersburg, Russia, August 2011, p. 56–62.

    http://ieeexplore.ieee.org/stamp/stamp.jsp?arnumber=06060121
  • 71Y. Liu, G. Simon.

    Peer-Assisted Time-shifted Streaming Systems: Design and Promises, in: IEEE International Conference on Communications (ICC'2011), Kyoto, Japan, IEEE, 06 2011.

    ftp://ftp-sop.inria.fr/mascotte/Publications/LS+11.pdf

National Conferences with Proceeding

  • 72J. Beauquier, J. Burman, V. Malykh.

    ZebraNet Analysé dans le Modéle des Protocoles de Population, in: 13es Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel), Cap Estérel, France, B. Ducourthial, P. Felber (editors), 2011.

    http://hal.inria.fr/inria-00586503/fr/
  • 73F. Becker, M. Matamala, N. Nisse, I. Rapaport, K. Suchan, I. Todinca.

    Reconstruire un graphe en une ronde, in: 13es Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel), Cap Estérel, France, B. Ducourthial, P. Felber (editors), 2011.

    http://hal.inria.fr/inria-00587250/en
  • 74S. Belhareth, D. Coudert, D. Mazauric, N. Nisse, I. Tahiri.

    Reconfiguration avec contraintes physiques dans les réseaux WDM, in: 13es Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel), Cap Estérel, France, B. Ducourthial, P. Felber (editors), 2011.

    http://hal.inria.fr/inria-00583829/en
  • 75C. Caillouet, A. Koster.

    Routage et Ordonnancement Robustes dans les Réseaux Radio Maillés, in: 13es Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel), Cap Estérel, France, B. Ducourthial, P. Felber (editors), 2011.

    http://hal.inria.fr/inria-00586698/en
  • 76C. Caillouet, T. Razafindralambo.

    Compromis énergie-délai pour la collecte de données dans les réseaux de capteurs, in: 13es Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel), Cap Estérel, France, B. Ducourthial, P. Felber (editors), 2011.

    http://hal.inria.fr/inria-00586681/en
  • 77D. Coudert, N. Nepomuceno, I. Tahiri.

    Optimisation de la consommation énergétique dans les réseaux sans fil fixes, in: 13es Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel), Cap Estérel France, P. Ducourthial (editor), 2011.

    http://hal.inria.fr/inria-00588129/en/
  • 78F. Giroire, D. Mazauric, J. Moulierac.

    Routage efficace en énergie, in: 13es Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel), Cap Estérel, France, B. Ducourthial, P. Felber (editors), 2011.

    http://hal.inria.fr/inria-00587944/fr
  • 79F. Maffray, G. Morel.

    Algorithmes linéaires pour les graphes sans P5 3-colorables, in: 12e congrès annuel de la ROADEF, 2011.

Scientific Books (or Scientific Book chapters)

  • 80J.-C. Bermond, F. Ergincan, M. Syska.

    Line Directed Hypergraphs, in: Quisquater Festschrift, D. Naccache (editor), Lecture Notes in Computer Science, Springer-Verlag, Berlin Heidelberg, 2011, vol. 6805, p. 25-34.
  • 81G. Wainer, K. Al-Zoubi, O. Dalle, R. C. Hill, S. Mittal, J. L. R. Martìn, H. Sarjoughian, L. Touraille, M. K. Traoré, B. P. Zeigler.

    18 - Standardizing DEVS Simulation Middleware, in: Discrete-Event Modeling and Simulation: Theory and Applications, G. Wainer, P. Mosterman (editors), Taylor and Francis, 2011, p. 459-494.

    http://cell-devs.sce.carleton.ca/publications/2010/WADHMMSTTZ10
  • 82G. Wainer, K. Al-Zoubi, O. Dalle, R. C. Hill, S. Mittal, J. L. R. Martìn, H. Sarjoughian, L. Touraille, M. K. Traoré, B. P. Zeigler.

    17 - Standardizing DEVS model representation, in: Discrete-Event Modeling and Simulation: Theory and Applications, G. Wainer, P. Mosterman (editors), Taylor and Francis, 2011, p. 427-458.

    http://cell-devs.sce.carleton.ca/publications/2010/WADHMMSTTZ10

Internal Reports

References in notes
  • 97O. Dalle.

    OSA: an Open Component-based Architecture for Discrete-Event Simulation, INRIA, February 2006, no RR-5762, version 2.

    http://hal.inria.fr/inria-00070258/fr/
  • 98J.-F. Lalande, M. Syska, Y. Verhoeven.

    Mascopt - A Network Optimization Library: Graph Manipulation, INRIA Sophia Antipolis, 2004 route des lucioles - BP 93 - FR-06902 Sophia Antipolis, April 2004, no RT-0293.

    http://hal.inria.fr/inria-00069887/fr/
  • 99N. Nisse, I. Rapaport, K. Suchan.

    Distributed computing of efficient routing schemes in generalized chordal graphs, in: Proceedings of the 16th International Colloquium on Structural Information and Communication Complexity (SIROCCO), Piran, Slovenia, Lecture Notes in Computer Science, Springer-Verlag, 2009, vol. 5869, p. 252-265.

    http://www-sop.inria.fr/members/Nicolas.Nisse/publications/distribRouting.pdf