Dominique Barth - researchr alias

researchr

You are not signed in
Sign in
Sign up

2011

Mobility Prediction Using Mobile User ProfilesDominique Barth, Samir Bellahsene, Leïla Kloul. mascots 2011: 286-294 [doi]

QoS commitment between vertically integrated autonomous systemsHélène Le Cadre, Dominique Barth, Hélia Pouyllau. eor, 214(3):627-643, 2011. [doi]

2010

PARINET: A tunable access method for in-network trajectoriesIulian Sandu Popa, Karine Zeitouni, Vincent Oria, Dominique Barth, Sandrine Vial. icde 2010: 177-188 [doi]

2009

Impact of Alliances on End-to-End QoS Satisfaction in an Interdomain NetworkDominique Barth, Thierry Mautor, Daniel Villa Monteiro. icc 2009: 1-6 [doi]

On the shape of decomposable treesDominique Barth, Hervé Fournier, Romain Ravaux. DM, 309(12):3882-3887, 2009. [doi]

Distributed Learning of Equilibria in a Routing GameDominique Barth, Johanne Cohen, Olivier Bournez, Octave Boussaton. ppl, 19(2):189-204, 2009. [doi]

A hierarchical prediction model for two nodes-based IP mobile networksSamir Bellahsene, LeÃ¯la Kloul, Dominique Barth. mswim 2009: 173-180 [doi]

Minimizing Routing Delay Variation in Case of MobilityYacine Benallouche, Dominique Barth, Olivier MarcÃ©. wimob 2009: 370-375 [doi]

Efficient Micro-Mobility with Congestion Avoiding in Two-Nodes Mobile IP Network ArchitectureYacine Benallouche, Dominique Barth, Salah Karouia, Marc-Antoine Weisser. ntms 2009: 1-6 [doi]

Bandwidth Optimization for Multicast Transmissions in Virtual Circuit NetworksVincent Reinhard, Joanna Tomasik, Dominique Barth, Marc-Antoine Weisser. networking 2009: 859-870 [doi]

2008

Optimal Transit Price Negotiation: The Distributed Learning PerspectiveDominique Barth, Loubna Echabbi, Chahinez Hamlaoui. jucs, 14(5):745-765, 2008.

Distributed Learning of Wardrop EquilibriaDominique Barth, Olivier Bournez, Octave Boussaton, Johanne Cohen. uc 2008: 19-32 [doi]

Shuffling biological sequences with motif constraintsRomain Rivière, Dominique Barth, Johanne Cohen, Alain Denise. jda, 6(2):192-204, 2008. [doi]

Congestion Avoiding Mechanism Based on Inter-domain HierarchyMarc-Antoine Weisser, Joanna Tomasik, Dominique Barth. networking 2008: 470-481 [doi]

2007

On the b-continuity property of graphsDominique Barth, Johanne Cohen, Taoufik Faik. DAM, 155(13):1761-1768, 2007. [doi]

Transit Prices Negotiation: Combined Repeated Game and Distributed Algorithmic ApproachDominique Barth, Johanne Cohen, Loubna Echabbi, Chahinez Hamlaoui. netcoop 2007: 266-275 [doi]

2006

A degree bound on decomposable treesDominique Barth, Hervé Fournier. DM, 306(5):469-477, 2006. [doi]

Multicast tree allocation algorithms for Distributed Interactive SimulationDominique Barth, Johanne Cohen, Corentin Durbach. ijhpcn, 4(3/4):137-151, 2006. [doi]

Revisiting parametric multi-terminal problems: Maximum flows, minimum cuts and cut-tree computationsDominique Barth, Pascal Berthomé, Madiagne Diallo, Afonso Ferreira. disopt, 3(3):195-205, 2006. [doi]

2005

The Complexity of the Maximal Requests Satisfaction Problem in Multipoint CommunicationDominique Barth, Pascal Berthomé, Paraskevi Fragopoulou. ppl, 15(1-2):209-222, 2005. [doi]

Detecting flows congesting a target network linkDominique Barth, Pascal Berthomé, Madiagne Diallo. endm, 19:233-239, 2005. [doi]

2004

2003

The permutation-path coloring problem on treesSylvie Corteel, Mario Valencia-Pabon, Danièle Gardy, Dominique Barth, Alain Denise. TCS, 297(1-3):119-143, 2003. [doi]

2002

2000

On the Complexity of Routing Permutations on Trees by Arc-Disjoint Paths. Extended AbstractDominique Barth, Sylvie Corteel, Alain Denise, Danièle Gardy, Mario Valencia-Pabon. latin 2000: 308-317

1999

Message Scheduling on Trees under a Generalized Line-Communication ModelDominique Barth, Mario Valencia-Pabon. ispan 1999: 10-15 [doi]

Compact Multicast Algorithms on Grids Without Intermediate BufferingDominique Barth, Paraskevi Fragopoulou. pdpta 1999: 1599-1605

Scattering and multi-scattering in trees and meshes, with local routing and without bufferingDominique Barth, Christian Laforest. pc, 25(8):1035-1057, 1999.

1998

Undirected graphs rearrangeable by 2-length walksDominique Barth, Petrisor Panaite. networks, 31(4):239-247, 1998. [doi]

Routing Permutations on Graphs via FactorsDominique Barth, Petrisor Panaite. jpdc, 54(2):162-182, 1998.

1997

Approximation Algorithms for Structured Communication ProblemsDominique Barth, Pierre Fraigniaud. spaa 1997: 180-188 [doi]

Parallel Matrix Product Algorithm in the de Bruijn Network Using Emulation of Meshes of TreesDominique Barth. pc, 22(12):1563-1578, 1997.

A New Digraphs Composition with Applications to De Bruijn and Generalized De Bruijn DigraphsDominique Barth, Marie-Claude Heydemann. DAM, 80(1):115, 1997. [doi]

A New Digraphs Composition with Applications to De Bruijn and Generalized De Bruijn DigraphsDominique Barth, Marie-Claude Heydemann. DAM, 77(2):99-118, 1997. [doi]

1996

Bandwidth and Cutwidth of the Mesh of ::::d::::-Ary TreesDominique Barth. europar 1996: 243-246

Emulating Networks by Bus Networks: Application to Trees and HypermeshesDominique Barth, Anne Germa, Marie-Claude Heydemann, Dominique Sotteau. sirocco 1996: 241-254

Optimal Broadcasting in the Back to Back d-ary TreesDominique Barth. ipl, 59(2):85-89, 1996. [doi]

1995

Compatible Eulerian Circuits in K::n::**Dominique Barth, Johny Bond, André Raspaud. DAM, 56(2-3):127-136, 1995. [doi]

On Bandwidth, Cutwidth, and Quotient GraphsDominique Barth, François Pellegrini, André Raspaud, Jean Roman. ita, 29(6):487-508, 1995.

1994

Two Edge-Disjoint Hamiltonian Cycles in the Butterfly GraphDominique Barth, André Raspaud. ipl, 51(4):175-179, 1994.

1993

Embedding Meshes of d-Ary Trees into de Bruijn GraphsDominique Barth. ppl, 3:115-127, 1993.

1992

An Algorithm of Broadcasting in the Mesh of TreesDominique Barth. conpar 1992: 843-844