Automatic induction of inter-domain hierarchy in randomly generated network topologies. - Marc-Antoine Weisser; Joanna Tomasik (SpringSim (1), 2007)

Congestion Avoiding Mechanism Based on Inter-domain Hierarchy. - Marc-Antoine Weisser; Joanna Tomasik; Dominique Barth (Networking, 2008)

Bandwidth Optimization for Multicast Transmissions in Virtual Circuit Networks. - Vincent Reinhard; Joanna Tomasik; Dominique Barth; Marc-Antoine Weisser (Networking, 2009)

Efficient Micro-Mobility with Congestion Avoiding in Two-Nodes Mobile IP Network Architecture. - Yacine Benallouche; Dominique Barth; Salah Karouia; Marc-Antoine Weisser (NTMS, 2009)

Internet topology on as-level: Model, generation methods and tool. - Joanna Tomasik; Marc-Antoine Weisser (IPCCC, 2010)

aSHIIP: Autonomous Generator of Random Internet-like Topologies with Inter-domain Hierarchy. - Joanna Tomasik; Marc-Antoine Weisser (MASCOTS, 2010)

Performance Improvement of an Optical Network Providing Services Based on Multicast. - Vincent Reinhard; Johanne Cohen; Joanna Tomasik; Dominique Barth; Marc-Antoine Weisser (ISCIS, 2011)

The inter-domain hierarchy in measured and randomly generated AS-level topologies. - Joanna Tomasik; Marc-Antoine Weisser (ICC, 2012)

Minimization of the Receiver Cost in an All-Optical Ring with a Limited Number of Wavelengths. - David Poulain; Joanna Tomasik; Marc-Antoine Weisser; Dominique Barth (ISCIS, 2012)

Optimal configuration of an optical network providing predefined multicast transmissions. - Vincent Reinhard; Johanne Cohen; Joanna Tomasik; Dominique Barth; Marc-Antoine Weisser (Comput. Networks, 2012)

Steiner Problems with Limited Number of Branching Nodes. - Dimitri Watel; Marc-Antoine Weisser; Cédric Bentz; Dominique Barth (SIROCCO, 2013)

Directed Steiner Tree with Branching Constraint. - Dimitri Watel; Marc-Antoine Weisser; Cédric Bentz; Dominique Barth (COCOON, 2014)

A Packing Problem Approach to Lightpath Assignment in an Optical Ring. - David Poulain; Joanna Tomasik; Marc-Antoine Weisser; Dominique Barth (Comput. J., 2014)

An FPT algorithm in polynomial space for the Directed Steiner Tree problem with Limited number of Diffusing nodes. - Dimitri Watel; Marc-Antoine Weisser; Cédric Bentz; Dominique Barth (Inf. Process. Lett., 2015)

Bin packing with fragmentable items: Presentation and approximations. - Bertrand Le Cun; Thierry Mautor; Franck Quessette; Marc-Antoine Weisser (Theor. Comput. Sci., 2015)

A practical greedy approximation for the directed Steiner tree problem. - Dimitri Watel; Marc-Antoine Weisser (J. Comb. Optim., 2016)

Directed Steiner trees with diffusion costs. - Dimitri Watel; Marc-Antoine Weisser; Cédric Bentz; Dominique Barth (J. Comb. Optim., 2016)

Parameterized Complexity and Approximability of Coverability Problems in Weighted Petri Nets. - Dimitri Watel; Marc-Antoine Weisser; Dominique Barth (Petri Nets, 2017)

A new graph modelisation for molecule similarity. - Stéfi Nouleho; Dominique Barth; Franck Quessette; Marc-Antoine Weisser; Dimitri Watel; Olivier David 003 (CoRR, 2018)

The First Approximation Algorithm for the Maximin Latin Hypercube Design Problem. - Kaourintin Le Guiban; Arpad Rimmel; Marc-Antoine Weisser; Joanna Tomasik (Oper. Res., 2018)

Completion of partial Latin Hypercube Designs: NP-completeness and inapproximability. - Kaourintin Le Guiban; Arpad Rimmel; Marc-Antoine Weisser; Joanna Tomasik (Theor. Comput. Sci., 2018)

Minimizing the Hamming distance between a graph and a line-graph to discover the topology of an electrical network. - Wilfried Joseph Ehounou; Dominique Barth; Arnaud De Moissac; Dimitri Watel; Marc-Antoine Weisser (J. Graph Algorithms Appl., 2020)

Optimisation of electrical network configuration: Complexity and algorithms for ring topologies. - Dominique Barth; Thierry Mautor; Arnaud De Moissac; Dimitri Watel; Marc-Antoine Weisser (Theor. Comput. Sci., 2021)

A polynomial algorithm for deciding the validity of an electrical distribution tree. - Dominique Barth; Thierry Mautor; Dimitri Watel; Marc-Antoine Weisser (Inf. Process. Lett., 2022)

Maximizing Minimum Cycle Bases Intersection. - Ylène Aboulfath; Dimitri Watel; Marc-Antoine Weisser; Thierry Mautor; Dominique Barth (IWOCA, 2024)

Maximal Line Digraphs. - Quentin Japhet; Dimitri Watel; Dominique Barth; Marc-Antoine Weisser (CoRR, 2024)

Configuring an heterogeneous smartgrid network: complexity and approximations for tree topologies. - Dominique Barth; Thierry Mautor; Dimitri Watel; Marc-Antoine Weisser (J. Glob. Optim., 2024)

Polymorphic Cycle Basis in a Sequence of Graphs to Analyze the Structural Evolution of a Molecular Dynamic Trajectory. - Ylène Aboulfath; Dominique Barth; Thierry Mautor; Dimitri Watel; Marc-Antoine Weisser (SEA, 2025)

Correcting a Graph Into a Linegraph Minimizing Hamming Distance Edition Is NP-Complete and FPT by Treewidth. - Dominique Barth; Dimitri Watel; Marc-Antoine Weisser (J. Graph Algorithms Appl., 2025)