The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Dominique Barth: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  32. Impact of Alliances on End-to-End QoS Satisfaction in an Interdomain Network. [Citation Graph (, )][DBLP]


  33. PARINET: A tunable access method for in-network trajectories. [Citation Graph (, )][DBLP]


  34. A hierarchical prediction model for two nodes-based IP mobile networks. [Citation Graph (, )][DBLP]


  35. Bandwidth Optimization for Multicast Transmissions in Virtual Circuit Networks. [Citation Graph (, )][DBLP]


  36. Congestion Avoiding Mechanism Based on Inter-domain Hierarchy. [Citation Graph (, )][DBLP]


  37. Distributed Learning of Wardrop Equilibria. [Citation Graph (, )][DBLP]


  38. Minimizing Routing Delay Variation in Case of Mobility. [Citation Graph (, )][DBLP]


  39. Automatic Network Services Aligned with Grid Application Requirements in CARRIOCAS Project. [Citation Graph (, )][DBLP]


  40. Efficient Micro-Mobility with Congestion Avoiding in Two-Nodes Mobile IP Network Architecture. [Citation Graph (, )][DBLP]


  41. On the shape of decomposable trees. [Citation Graph (, )][DBLP]


Search in 0.004secs, Finished in 0.006secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002