| 2008 |
|---|
| 33 | EE | Marc-Antoine Weisser,
Joanna Tomasik,
Dominique Barth:
Congestion Avoiding Mechanism Based on Inter-domain Hierarchy.
Networking 2008: 470-481 |
| 2007 |
|---|
| 32 | EE | Dominique Barth,
Johanne Cohen,
Loubna Echabbi,
Chahinez Hamlaoui:
Transit Prices Negotiation: Combined Repeated Game and Distributed Algorithmic Approach.
NET-COOP 2007: 266-275 |
| 31 | EE | Dominique Barth,
Johanne Cohen,
Taoufik Faik:
On the b-continuity property of graphs.
Discrete Applied Mathematics 155(13): 1761-1768 (2007) |
| 2006 |
|---|
| 30 | EE | Dominique Barth,
Hervé Fournier:
A degree bound on decomposable trees.
Discrete Mathematics 306(5): 469-477 (2006) |
| 29 | EE | Dominique Barth,
Johanne Cohen,
Corentin Durbach:
Multicast tree allocation algorithms for Distributed Interactive Simulation.
IJHPCN 4(3/4): 137-151 (2006) |
| 2005 |
|---|
| 28 | EE | Dominique Barth,
Pascal Berthomé,
Paraskevi Fragopoulou:
The Complexity of the Maximal Requests Satisfaction Problem in Multipoint Communication.
Parallel Processing Letters 15(1-2): 209-222 (2005) |
| 2004 |
|---|
| 27 | EE | Dominique Barth,
Johanne Cohen,
Lynda Gastal,
Thierry Mautor,
Stéphane Rousseau:
Fixed Size and Variable Size Packet Models in an Optical Ring Network: Complexity and Simulations.
ISCIS 2004: 238-246 |
| 26 | EE | Dominique Barth,
Loubna Echabbi:
Distributed Multi-link Auctions for Network Resource Reservation and Pricing.
QofIS 2004: 328-337 |
| 25 | EE | Dominique Barth,
Pascal Berthomé,
Johanne Cohen:
The Eulerian Stretch Of A Network Topology And The Ending Guarantee Of A Convergence Routing.
Journal of Interconnection Networks 5(2): 93-109 (2004) |
| 24 | EE | Dominique Barth,
Pascal Berthomé:
Periodic Gossiping in Commuted Networks.
Theory Comput. Syst. 37(5): 559-584 (2004) |
| 2003 |
|---|
| 23 | EE | Sylvie Corteel,
Mario Valencia-Pabon,
Danièle Gardy,
Dominique Barth,
Alain Denise:
The permutation-path coloring problem on trees.
Theor. Comput. Sci. 1-3(297): 119-143 (2003) |
| 2002 |
|---|
| 22 | EE | Dominique Barth,
Pascal Berthomé,
T. Czarchoski,
Jean-Michel Fourneau,
Christian Laforest,
Sandrine Vial:
A Mixed Deflection and Convergence Routing Algorithm: Design and Performance.
Euro-Par 2002: 767-774 |
| 21 | | Dominique Barth,
Paraskevi Fragopoulou,
Marie-Claude Heydemann:
Uniform emulations of Cartesian-product and Cayley graphs.
Discrete Applied Mathematics 116(1-2): 37-54 (2002) |
| 20 | | Dominique Barth,
Olivier Baudon,
Joël Puech:
Decomposable trees: a polynomial algorithm fortripodes.
Discrete Applied Mathematics 119(3): 205-216 (2002) |
| 19 | EE | Dominique Barth,
Paraskevi Fragopoulou:
Compact Multicast Algorithms on Grids and Tori Without Intermediate Buffering.
Parallel Processing Letters 12(1): 31-39 (2002) |
| 2000 |
|---|
| 18 | | Dominique Barth,
Sylvie Corteel,
Alain Denise,
Danièle Gardy,
Mario Valencia-Pabon:
On the Complexity of Routing Permutations on Trees by Arc-Disjoint Paths. Extended Abstract.
LATIN 2000: 308-317 |
| 1999 |
|---|
| 17 | EE | Dominique Barth,
Mario Valencia-Pabon:
Message Scheduling on Trees under a Generalized Line-Communication Model.
ISPAN 1999: 10-15 |
| 16 | | Dominique Barth,
Paraskevi Fragopoulou:
Compact Multicast Algorithms on Grids Without Intermediate Buffering.
PDPTA 1999: 1599-1605 |
| 15 | | Dominique Barth,
Christian Laforest:
Scattering and multi-scattering in trees and meshes, with local routing and without buffering.
Parallel Computing 25(8): 1035-1057 (1999) |
| 1998 |
|---|
| 14 | | Dominique Barth,
Petrisor Panaite:
Routing Permutations on Graphs via Factors.
J. Parallel Distrib. Comput. 54(2): 162-182 (1998) |
| 13 | EE | Dominique Barth,
Petrisor Panaite:
Undirected graphs rearrangeable by 2-length walks.
Networks 31(4): 239-247 (1998) |
| 1997 |
|---|
| 12 | EE | Dominique Barth,
Pierre Fraigniaud:
Approximation Algorithms for Structured Communication Problems.
SPAA 1997: 180-188 |
| 11 | EE | Dominique Barth,
Marie-Claude Heydemann:
A New Digraphs Composition with Applications to De Bruijn and Generalized De Bruijn Digraphs.
Discrete Applied Mathematics 77(2): 99-118 (1997) |
| 10 | EE | Dominique Barth,
Marie-Claude Heydemann:
A New Digraphs Composition with Applications to De Bruijn and Generalized De Bruijn Digraphs.
Discrete Applied Mathematics 80(1): 115 (1997) |
| 9 | | Dominique Barth:
Parallel Matrix Product Algorithm in the de Bruijn Network Using Emulation of Meshes of Trees.
Parallel Computing 22(12): 1563-1578 (1997) |
| 1996 |
|---|
| 8 | | Dominique Barth:
Bandwidth and Cutwidth of the Mesh of d-Ary Trees.
Euro-Par, Vol. I 1996: 243-246 |
| 7 | | Dominique Barth,
Anne Germa,
Marie-Claude Heydemann,
Dominique Sotteau:
Emulating Networks by Bus Networks: Application to Trees and Hypermeshes.
SIROCCO 1996: 241-254 |
| 6 | EE | Dominique Barth:
Optimal Broadcasting in the Back to Back d-ary Trees.
Inf. Process. Lett. 59(2): 85-89 (1996) |
| 1995 |
|---|
| 5 | EE | Dominique Barth,
Johny Bond,
André Raspaud:
Compatible Eulerian Circuits in Kn**.
Discrete Applied Mathematics 56(2-3): 127-136 (1995) |
| 4 | | Dominique Barth,
François Pellegrini,
André Raspaud,
Jean Roman:
On Bandwidth, Cutwidth, and Quotient Graphs.
ITA 29(6): 487-508 (1995) |
| 1994 |
|---|
| 3 | | Dominique Barth,
André Raspaud:
Two Edge-Disjoint Hamiltonian Cycles in the Butterfly Graph.
Inf. Process. Lett. 51(4): 175-179 (1994) |
| 1993 |
|---|
| 2 | | Dominique Barth:
Embedding Meshes of d-Ary Trees into de Bruijn Graphs.
Parallel Processing Letters 3: 115-127 (1993) |
| 1992 |
|---|
| 1 | | Dominique Barth:
An Algorithm of Broadcasting in the Mesh of Trees.
CONPAR 1992: 843-844 |
