B. Ravindra, K. Ahuja, T. L. Magnanti, and J. B. Orlin, Network Flows -Theory, Algorithms , and Applications, 1993.

K. Ravindra, D. S. Ahuja, J. B. Hochbaum, and . Orlin, Solving the Convex Cost Integer Dual Network Flow Problem, 7th International IPCO Conference, 1999.

J. F. Allen, Maintaining knowledge about temporal intervals, Communications of the ACM, vol.26, issue.11, pp.832-843, 1983.
DOI : 10.1145/182.358434

J. F. Allen, Time and time again: The many ways to represent time, International Journal of Intelligent Systems, vol.6, issue.4, pp.341-355, 1991.
DOI : 10.1002/int.4550060403

H. Matthew and . Austern, Generic Programming and the STL: Using and Extending the C++ Standard Template Library, 1999.

B. Bachelet, G. Boisnard, and J. Braud, Synchronisation dans les documents hypermédia, 2001.

B. Bachelet, C. Duhamel, L. Masson, and A. Villeger, Conception d'un éditeur de graphe en Java, 2002.

B. Bachelet, Creation of Libraries of Reusable Model Components for the Visual Simulation Environment, 1998.

B. Bachwb, . Bachelet, . B++, and . Library, Site Web

[. Baïou and A. Mahjoub, Steiner 2-Edge Connected Subgraph Polytopes on Series-Parallel Graphs, SIAM Journal on Discrete Mathematics, vol.10, issue.3, pp.505-514, 1997.
DOI : 10.1137/S0895480193259813

O. Balci, Verifi cation, Validation and Accreditation, Winter Simulation Conference, pp.41-48, 1998.

]. R. Bell58 and . Bellman, On a Routing Problem, Dans Quaterly of Applied Mathematics, vol.16, pp.87-90, 1958.

]. M. Bern87, E. L. Bern, A. L. Lawler, and . Wong, Linear-time computation of optimal subgraphs of decomposable graphs, Journal of Algorithms, vol.8, issue.2, pp.216-235, 1987.
DOI : 10.1016/0196-6774(87)90039-3

[. Berthouzoz, P. Fabian, and G. Dotzel, Oberon: extensibilité et persistance, 1995.

L. Hans, . Bodlaender, . Babette, and . Fluiter, Parallel Algorithms for Series Parallel Graphs, 4th Annual European Symposium on Algorithms, pp.277-289, 1996.

G. Booch, Software Engineering with Ada, 1987.

G. Booch, Object-Oriented Design with Applications, 1991.

A. W. Brown, Foundations for Component-Based Software Engineering. Dans Component- Based Software Engineering, pages vii?x, 1996.

M. , C. Buchanan-et-polle, and T. Zellweger, Automatic Temporal Layout Mechanisms, ACM Multimedia 93, pp.341-350, 1993.

M. , C. Buchanan-et-polle, and T. Zellweger, Automatically Generating Consistent Schedules for Multimedia Documents, Multimedia Systems, pp.55-67, 1993.

C. A. Dick, L. Bulterman, J. Hardman, K. Jansen, L. Sjoerd-mullender et al., GRiNS: a GRaphical INterface for Creating and Playing SMIL Documents, Dans Computer Networks and ISDN Systems, pp.519-529, 1998.

A. Campos, Une architecture logicielle pour le développement de simulations visuelles et interactives individu-centrées, Thèse de Doctorat, 2000.

[. Ho, S. Hsieh, and G. Chen, Parallel Decomposition of Generalized Series-Parallel Graphs, Journal of Information Science and EngineeringJISE, vol.153, pp.407-417, 1999.

C. Paul and . Clements, From Subroutines to Subsystems: Component-Based Software Development . Dans Component-Based Software Engineering, pp.3-6, 1996.

]. Codewb, . Codemesh, and . Junc++ion, Site Web

S. Cohen and L. M. Northrop, Object-oriented technology and domain analysis, Proceedings. Fifth International Conference on Software Reuse (Cat. No.98TB100203), pp.86-93, 1998.
DOI : 10.1109/ICSR.1998.685733

[. Coulange, Software Reuse, 1998.
DOI : 10.1007/978-1-4471-1511-3

J. P. Courtiat, M. Diaz, R. C. De-oliveira, and P. Sénac, Formal models for the description of timed behaviors of multimedia and hypermedia distributed systems, Computer Communications, pp.1134-1150, 1996.
DOI : 10.1016/S0140-3664(96)01148-6

A. Kumar-datta-et-ranjan-kumar-sen, An Effi cient Scheme to Solve Two Problems for Two- Terminal Series Parallel Graphs, Information Processing Letters, vol.71, pp.9-15, 1999.

K. Driesen and U. Hölzle, The Direct Cost of Virtual Function Calls in C++, ACM Conference on Object-Oriented Programming, Systems, Languages and Applications, 1996.

M. Ferreira, S. , and C. Werner, Packaging Reusable Components Using Patterns and Hypermedia, 4th International Conference on Software Reuse, pp.146-154, 1996.

]. R. Duff65 and . Duffin, Topology of Series-Parallel Networks, Journal of Mathematical Analysis and Applications, vol.10, pp.303-318, 1965.

A. Duret-lutz, T. Géraud, and A. Demaille, Generic Design Patterns in C++, 6th USENIX Conference on Object-Oriented Technologies and Systems, pp.189-202, 2001.

J. Edmonds and R. M. Karp, Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems, Journal of the ACM, vol.19, issue.2, pp.248-264, 1972.
DOI : 10.1145/321694.321699

D. Eppstein, Parallel recognition of series-parallel graphs, Information and Computation, vol.98, issue.1, pp.41-55, 1992.
DOI : 10.1016/0890-5401(92)90041-D

H. Fargier, M. Jourdan, N. Layaïda, and T. Vidal, Using Temporal Constraints Networks to Manage Temporal Scenario of Multimedia Documents, ECAI 98 Workshop on Spatial and Temporal Reasoning, 1998.

S. Foldes and F. Soumis, PERT and crashing revisited: Mathematical generalizations, European Journal of Operational Research, vol.64, issue.2, pp.286-294, 1993.
DOI : 10.1016/0377-2217(93)90183-N

M. Forster, A. Pick, and M. Raitner, The Graph Template Library. Site Web

]. D. Fulk61 and . Fulkerson, An Out-of-Kilter Method for Minimal Cost Flow Problems, Dans SIAM Journal on Applied Mathematics, vol.9, pp.18-27, 1961.

[. Gamma, R. Helm, R. Johnson, and J. Vlissides, Design Patterns: Elements of Reusable Object-Oriented Software, 1995.

]. A. Gold87, R. E. Goldberg, and . Tarjan, Solving Minimum Cost Flow Problem by Successive Approximation, 19th ACM Symposium on the Theory of Computing, pp.7-18, 1987.

M. Hadjiat, Problèmes de tension sur un graphe -Algorithmes et complexité, Thèse de Doctorat, 1996.

S. Haney and J. Crotinger, How Templates Enable High-Performance Scientifi c Computing in C++, IEEE Computing in Science and Engineering, vol.104, 1999.

]. I. Herm98, N. Herman, D. A. Correia, D. J. Duce, G. J. Duke et al., A Standard Model for Multimedia Synchronization: PREMO Synchronization Objects, Multimedia Systems, pp.88-101, 1998.

R. C. David and . Hill, Object-Oriented Analysis and Simulation, 1996.

M. Jazayeri, Component Programming ??? a fresh look at software components, 5th European Software Engineering Conference, pp.457-478, 1995.
DOI : 10.1007/3-540-60406-5_30

]. D. John02 and . Johnson, A Theoretician's Guide to the Experimental Analysis of Algorithms. Dans 5th and 6th DIMACS Implementation Challenges, 2002.

E. Ralph, J. Johnson, and . Zweig, Delegation in C++, Journal of Object-Oriented Programming, pp.22-35, 1991.

M. Jourdan, N. Layaïda, and C. Roisin, A Survey on Authoring Techniques for Temporal Scenarios of Multimedia Documents, HandBook of Multimedia Computing, 1998.

M. Jourdan, C. Roisin, and L. Tardif, Constraint Techniques for Authoring Multimedia Documents, pp.1-17, 1999.

. Keytwb, . Key-technology, and . Assistant, Site Web

Y. Michelle, J. Kim, and . Song, Multimedia Documents with Elastic Time, Dans Multimedia '95, pp.143-154, 1995.

]. D. Knut81, M. F. Knuth, and . Plass, Breaking Paragraphs into Lines. Dans Software -Practice and Experience, pp.1119-1184, 1981.

D. Kühl, Design Patterns for the Implementation of Graph Algorithms Mémoire de DEA, 1996.

L. Layaïda, C. Sabry-ismail, and . Roisin, Dealing with Uncertain Durations in Synchronized Multimedia Presentations, Multimedia Tools and Applications Journal, pp.213-231, 2002.

]. N. Laya96b, L. Layaïda, and . Sabry-ismail, Maintaining Temporal Consistency of Multimedia Documents using Constraint Networks, Multimedia Computing and Networking, pp.124-135, 1996.

. Layaïda, Madeus: système d'édition et de présentation de documents structurés multimédia, Thèse de Doctorat, 1997.

R. J. Leach, Software Reuse, 1997.

[. Lee, The High Performance Generic Graph Component Library Mémoire de DEA, 1999.

S. Liang, The Java Native Interface, 1999.

B. Stanley and . Lippman, Le modèle objets du C++ [Litt90] T. Little et A. Ghafoor. Synchronization and Storage Models for Multimedia Objects, IEEE Journal on Selected Areas in Communications, vol.183, pp.413-427, 1990.

]. P. Liu77, R. Liu, and . Geldmacher, On the Deletion of Nonplanar Edges of a Graph, 10th Conference on Combinatorics, Graph Theory and Computing, pp.727-738, 1977.

M. Macowicz, Approche générique des traitements de graphes, Thèse de Doctorat, INSA, 1997.

]. O. Mang69 and . Mangasarian, Nonlinear Programming. Mac-Graw Hill, 1969.

M. Mattsson, Object-Oriented Frameworks -A Survey of Methodological Issues Rapport Technique, 1996.

B. Mcnamara and Y. Smaragdakis, Static Interfaces in C++, C++ Template Programming, 2000.

]. M. Medi02, C. C. Medina, L. F. Ribeiro, and . Soares, Automatic Scheduling of Hypermedia Documents with Elastic Times, Parallel Processing Letters, 2002.

B. Meyer, Object-Oriented Software Construction, MicrWb] Microsoft Corporation. Microsoft Visual C++. Site Web, 1997.

]. G. Mint61 and . Minty, Solving Stady-State Non Linear Networks of Monotone Elements, IRE Transactions on Circuit Theory, pp.99-104, 1961.

R. David, A. A. Musser, and . Stepanov, Generic Programming. Dans Lecture Notes in Computer Science, pp.13-25, 1989.

R. Steven, . Newcomb, A. Neill, V. T. Kipp, and . Newcomb, The "HyTime", Hypermedia / Time-Based Document Structuring Language, Communications of the ACM, pp.34-45, 1991.

[. Niemeyer and J. Peck, Exploring Java, 1997.

[. Group, Unifi ed Modeling Language Specifi cation. Site Web

J. Martin and . O-'riordan, Technical Report on C++ Performance Rapport Technique, International Standardization Working Group ISO, 2002.

M. Pidd, N. Oses, and R. J. Brooks, Component-based simulation on the Web?, Proceedings of the 31st conference on Winter simulation Simulation---a bridge to the future, WSC '99, pp.1438-1444, 1999.
DOI : 10.1145/324898.325297

J. Pla, An ???out-of-kilter??? algorithm for solving minimum cost potential problems, Mathematical Programming, pp.275-290, 1971.
DOI : 10.1007/BF01584092

M. J. Pérez-luque and T. D. Little, A temporal reference framework for multimedia synchronization, IEEE Journal on Selected Areas in Communications, vol.14, issue.1, pp.36-51, 1996.
DOI : 10.1109/49.481692

]. R. Rock70 and . Rockefellar, Convex Analysis, 1970.

]. R. Rock84 and . Rockafellar, Network Flows and Monotropic Optimization, Rous98] Franck Rousseau et Andrzej Duda. Synchronized Multimedia for the WWW. Dans Computer Networks and ISDN Systems, pp.417-429, 1984.

F. Rousseau, Présentations multimédia synchronisées pour le WWW, Thèse de Doctorat, Institut National Polytechnique de, 1999.

]. P. Samp00a, J. P. Sampaio, and . Courtiat, A Formal Approach for the Presentation of Interactive Multimedia Documents, Dans ACM SIGMM Electronic, 2000.

]. C. Sant99, P. N. Santos, J. P. Sampaio, and . Courtiat, Revisiting the Concept of Hypermedia Document Consistency, ACM MM'99 Electronic, 1999.

W. John, T. U. Satzinger, and . Orvik, Object-Oriented Approach, 1996.

D. Schmidt, The Road to Reuse: Design Patterns, 4th International Conference on Software Reuse, pp.229-230, 1996.

J. Siek and A. Lumsdaine, Concept Checking: Binding Parametric Polymorphism in C++, First Workshop on C++ Template Programming, 2000.

J. Siek, L. Lee, and A. Lumsdaine, The Boost Graph Library. Site Web

]. D. Slea83, R. E. Sleator, and . Tarjan, A Data Structure for Dynamic Trees, Journal of Computer and System Sciences, vol.24, pp.362-391, 1983.

[. Fernando, G. Soares, R. F. Rodrigues, and C. Débora, Muchaluat Saade. Modeling, Authoring and Formatting Hypermedia Documents in the HyperProp System, Multimedia Systems, pp.118-134, 2000.

[. Song, G. Ramalingam, R. Miller, . Byoung-kee, and . Yi, Interactive authoring of multimedia documents in a constraint-based authoring system, Multimedia Systems, pp.424-437, 1999.
DOI : 10.1007/s005300050143

R. Steinmetz, Synchronization properties in multimedia systems, IEEE Journal on Selected Areas in Communications, vol.8, issue.3, pp.401-412, 1990.
DOI : 10.1109/49.53016

A. Stepanov, The Standard Template Library Rapport Technique, 1995.

B. Stroustrup, Why C++ is not just an Object-Oriented Language, ACM Conference on Object-oriented Programming, Systems, Languages, and Applications, 1995.
DOI : 10.1145/260094.260207
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.119.1625

B. Stroustrup, Language-technical aspects of reuse, Proceedings of Fourth IEEE International Conference on Software Reuse, pp.11-19, 1996.
DOI : 10.1109/ICSR.1996.496109

]. K. Taka82, T. Takamizawa, N. Nishizeki, and . Saito, Linear-Time Computability of Combinatorial Problems on Series-Parallel Graphs, Journal of the ACM, vol.29, pp.623-641, 1982.

J. Valdes, R. E. Tarjan-et-eugène, and L. Lawler, The recognition of Series Parallel digraphs, Proceedings of the eleventh annual ACM symposium on Theory of computing , STOC '79, pp.298-313, 1982.
DOI : 10.1145/800135.804393

. Dimitri-van-heesch and . Doxygen, Site Web

T. Vidal and H. Fargier, Contingent durations in temporal CSPs: from consistency to controllabilities, Proceedings of TIME '97: 4th International Workshop on Temporal Representation and Reasoning, 1997.
DOI : 10.1109/TIME.1997.600786

J. Guido-van-rossum, K. Jansen, . Sjoerd-mullender, C. A. Dick, and . Bulterman, CMIFed, Proceedings of the first ACM international conference on Multimedia , MULTIMEDIA '93, 1993.
DOI : 10.1145/166266.166287

T. Wagner and D. Towsley, Getting Started with POSIX Threads Site Web, 1995.

J. Waldo, The Solution to the Reuse Problem, 5th International Conference on Software Reuse, pp.369-370, 1998.

. Dominique-de-werra, Eléments de programmation linéaire avec application aux graphes, Presses Polytechniques Romandes, 1990.

]. X. Xorgwb and . Org, X Window System. Site Web