Dominique Barth

According to our database1, Dominique Barth authored at least 106 papers between 1992 and 2020.

Collaborative distances:



In proceedings 
PhD thesis 




Minimizing the Hamming distance between a graph and a line-graph to discover the topology of an electrical network.
J. Graph Algorithms Appl., 2020

Guidelines for Action Space Definition in Reinforcement Learning-Based Traffic Signal Control Systems.
Proceedings of the Thirtieth International Conference on Automated Planning and Scheduling, 2020

Popularity prediction-based caching in content delivery networks.
Ann. des Télécommunications, 2019

Deterministic Contention Management for Low Latency Cloud RAN over an Optical Ring.
Proceedings of the Optical Network Design and Modeling, 2019

A new graph modelisation for molecule similarity.
CoRR, 2018

Deterministic Scheduling of Periodic Messages for Cloud RAN.
CoRR, 2018

Scalable deterministic scheduling for WDM slot switching Xhaul with zero-jitter.
Proceedings of the 2018 International Conference on Optical Network Design and Modeling, 2018

Deterministic Scheduling of Periodic Messages for Cloud RAN.
Proceedings of the 25th International Conference on Telecommunications, 2018

GARN2: coarse-grained prediction of 3D structure of large RNA molecules by regret minimization.
Bioinform., 2017

A learning algorithm to minimize the expectation time of finding a parking place in urban area.
Proceedings of the 2017 IEEE Symposium on Computers and Communications, 2017

Coalition game for video content clustering in content delivery networks.
Proceedings of the 14th IEEE Annual Consumer Communications & Networking Conference, 2017

Parameterized Complexity and Approximability of Coverability Problems in Weighted Petri Nets.
Proceedings of the Application and Theory of Petri Nets and Concurrency, 2017

Discovery of Energy Network Topology from Uncertain Flow Measurements.
Proceedings of the Algorithmic Decision Theory - 5th International Conference, 2017

Directed Steiner trees with diffusion costs.
J. Comb. Optim., 2016

Learning techniques for cloud demands aggregation in cloud service brokering.
Int. J. Cloud Comput., 2016

Centralized Mobile Users Assignment Strategies for Energy Management in Het-LTE Networks.
EAI Endorsed Trans. Energy Web, 2016

Caching strategies based on popularity prediction in content delivery networks.
Proceedings of the 12th IEEE International Conference on Wireless and Mobile Computing, 2016

Mobile users assignment control strategies for LTE networks.
Proceedings of the 2016 Wireless Days, 2016

Expert-based on-line learning and prediction in Content Delivery Networks.
Proceedings of the 2016 International Wireless Communications and Mobile Computing Conference (IWCMC), 2016

An FPT algorithm in polynomial space for the Directed Steiner Tree problem with Limited number of Diffusing nodes.
Inf. Process. Lett., 2015

Efficient Generation of Stable Planar Cages for Chemistry.
Proceedings of the Experimental Algorithms - 14th International Symposium, 2015

Popularity prediction in content delivery networks.
Proceedings of the 26th IEEE Annual International Symposium on Personal, 2015

A New Graph Algorithm for the Analysis of Conformational Dynamics of Molecules.
Proceedings of the Information Sciences and Systems 2015, 2015

A Packing Problem Approach to Lightpath Assignment in an Optical Ring.
Comput. J., 2014

Parallel Biological In Silico Simulation.
Proceedings of the Information Sciences and Systems 2014, 2014

Directed Steiner Tree with Branching Constraint.
Proceedings of the Computing and Combinatorics - 20th International Conference, 2014

Stock provisioning strategies for QoS at the interdomain level.
Telecommun. Syst., 2013

An Algorithmic Game-Theory Approach for Coarse-Grain Prediction of RNA 3D Structure.
IEEE ACM Trans. Comput. Biol. Bioinform., 2013

Path computation in multi-layer multi-domain networks: A language theoretic approach.
Comput. Commun., 2013

Risk-aware SLA negotiation.
Proceedings of the 7th International Conference on Performance Evaluation Methodologies and Tools, 2013

Steiner Problems with Limited Number of Branching Nodes.
Proceedings of the Structural Information and Communication Complexity, 2013

Femtocells sharing management using mobility prediction model.
Proceedings of the 16th ACM International Conference on Modeling, 2013

La théorie des jeux pour l'établissement des contrats dans les réseaux interdomaines
CoRR, 2012

Tree decomposition and parameterized algorithms for RNA structure-sequence alignment including tertiary interactions and pseudoknots.
CoRR, 2012

Optimal configuration of an optical network providing predefined multicast transmissions.
Comput. Networks, 2012

Automated prediction of three-way junction topological families in RNA secondary structures.
Comput. Biol. Chem., 2012

Tree Decomposition and Parameterized Algorithms for RNA Structure-Sequence Alignment Including Tertiary Interactions and Pseudoknots - (Extended Abstract).
Proceedings of the Algorithms in Bioinformatics - 12th International Workshop, 2012

SLA negotiation: Experimental observations on learning policies.
Proceedings of the 6th International ICST Conference on Performance Evaluation Methodologies and Tools, 2012

Path Computation in Multi-layer Multi-domain Networks.
Proceedings of the NETWORKING 2012, 2012

Reputation-Aware Learning for SLA Negotiation.
Proceedings of the NETWORKING 2012 Workshops, 2012

On the distributed learning of Nash equilibria with minimal information.
Proceedings of the 6th International Conference on Network Games, 2012

Combining local and global profiles for mobility prediction in LTE femtocells.
Proceedings of the 15th ACM International Conference on Modeling, 2012

Minimization of the Receiver Cost in an All-Optical Ring with a Limited Number of Wavelengths.
Proceedings of the Computer and Information Sciences III, 2012

Map Generation for<i> CO</i> <sub>2</sub> Cages.
Proceedings of the Computer and Information Sciences III, 2012

Cache management using temporal pattern based solicitation for content delivery.
Proceedings of the 19th International Conference on Telecommunications, 2012

Performances evaluation of different algorithms for PCIs self configuration in LTE.
Proceedings of the 18th IEEE International Conference on Networks, 2012

Indexing in-network trajectory flows.
VLDB J., 2011

Optimal dimensioning of the WDM unidirectional ECOFRAME optical packet ring.
Photonic Netw. Commun., 2011

QoS commitment between vertically integrated autonomous systems.
Eur. J. Oper. Res., 2011

SLA Establishment with Guaranteed QoS in the Interdomain Network: A Stock Model
CoRR, 2011

Model for sharing femto access.
Proceedings of the 5th International ICST Conference on Performance Evaluation Methodologies and Tools Communications, 2011

Techno-economics of small cell networks: The AWARE project.
Proceedings of the 5th International Conference on NETwork Games, COntrol and OPtimization, 2011

Competition among online-gaming service providers.
Proceedings of the 5th International Conference on NETwork Games, COntrol and OPtimization, 2011

Mobility Prediction Using Mobile User Profiles.
Proceedings of the MASCOTS 2011, 2011

Performance Improvement of an Optical Network Providing Services Based on Multicast.
Proceedings of the Computer and Information Sciences II, 2011

File Transfer Application For Sharing Femto Access.
Proceedings of the Computer and Information Sciences II, 2011

Coalition Stability under QoS Based-Market Segmentation.
Proceedings of the Game Theory for Networks - 2nd International ICST Conference, 2011

End-to-end quality of service in pseudo-wire networks.
Proceedings of The ACM CoNEXT Student Workshop, 2011

PARINET: A tunable access method for in-network trajectories.
Proceedings of the 26th International Conference on Data Engineering, 2010

Graph Embedding to Allocate Network Resources for Service Composition.
Proceedings of IEEE International Conference on Communications, 2010

Distributed Learning of Equilibria in a Routing Game.
Parallel Process. Lett., 2009

On the shape of decomposable trees.
Discret. Math., 2009

Minimizing Routing Delay Variation in Case of Mobility.
Proceedings of the 5th IEEE International Conference on Wireless and Mobile Computing, 2009

A dynamic approach for load balancing.
Proceedings of the 4th International Conference on Performance Evaluation Methodologies and Tools, 2009

Efficient Micro-Mobility with Congestion Avoiding in Two-Nodes Mobile IP Network Architecture.
Proceedings of the NTMS 2009, 2009

Bandwidth Optimization for Multicast Transmissions in Virtual Circuit Networks.
Proceedings of the NETWORKING 2009, 2009

A hierarchical prediction model for two nodes-based IP mobile networks.
Proceedings of the 12th International Symposium on Modeling Analysis and Simulation of Wireless and Mobile Systems, 2009

Impact of Alliances on End-to-End QoS Satisfaction in an Interdomain Network.
Proceedings of IEEE International Conference on Communications, 2009

Optimal Transit Price Negotiation: The Distributed Learning Perspective.
J. Univers. Comput. Sci., 2008

Shuffling biological sequences with motif constraints.
J. Discrete Algorithms, 2008

Distributed Learning of Wardrop Equilibria.
Proceedings of the Unconventional Computing, 7th International Conference, 2008

Congestion Avoiding Mechanism Based on Inter-domain Hierarchy.
Proceedings of the NETWORKING 2008, Ad Hoc and Sensor Networks, Wireless Networks, 2008

Automatic Network Services Aligned with Grid Application Requirements in CARRIOCAS Project.
Proceedings of the Networks for Grid Applications, Second International Conference, 2008

On the b-continuity property of graphs.
Discret. Appl. Math., 2007

Transit Prices Negotiation: Combined Repeated Game and Distributed Algorithmic Approach.
Proceedings of the Network Control and Optimization, 2007

Multicast tree allocation algorithms for Distributed Interactive Simulation.
Int. J. High Perform. Comput. Netw., 2006

A degree bound on decomposable trees.
Discret. Math., 2006

Revisiting parametric multi-terminal problems: Maximum flows, minimum cuts and cut-tree computations.
Discret. Optim., 2006

The Complexity of the Maximal Requests Satisfaction Problem in Multipoint Communication.
Parallel Process. Lett., 2005

Detecting flows congesting a target network link.
Electron. Notes Discret. Math., 2005

Periodic Gossiping in Commuted Networks.
Theory Comput. Syst., 2004

The Eulerian Stretch Of A Network Topology And The Ending Guarantee Of A Convergence Routing.
J. Interconnect. Networks, 2004

Distributed Multi-link Auctions for Network Resource Reservation and Pricing.
Proceedings of the Quality of Service in the Emerging Networking Panorama: Fifth International Workshop on Quality of Future Internet Services, 2004

Fixed Size and Variable Size Packet Models in an Optical Ring Network: Complexity and Simulations.
Proceedings of the Computer and Information Sciences, 2004

The permutation-path coloring problem on trees.
Theor. Comput. Sci., 2003

Compact Multicast Algorithms on Grids and Tori Without Intermediate Buffering.
Parallel Process. Lett., 2002

Uniform emulations of Cartesian-product and Cayley graphs.
Discret. Appl. Math., 2002

Decomposable trees: a polynomial algorithm fortripodes.
Discret. Appl. Math., 2002

A Mixed Deflection and Convergence Routing Algorithm: Design and Performance.
Proceedings of the Euro-Par 2002, 2002

On the Complexity of Routing Permutations on Trees by Arc-Disjoint Paths. Extended Abstract.
Proceedings of the LATIN 2000: Theoretical Informatics, 2000

Scattering and multi-scattering in trees and meshes, with local routing and without buffering.
Parallel Comput., 1999

Compact Multicast Algorithms on Grids Without Intermediate Buffering.
Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 1999

Message Scheduling on Trees under a Generalized Line-Communication Model.
Proceedings of the 1999 International Symposium on Parallel Architectures, 1999

Undirected graphs rearrangeable by 2-length walks.
Networks, 1998

Routing Permutations on Graphs via Factors.
J. Parallel Distributed Comput., 1998

Parallel Matrix Product Algorithm in the de Bruijn Network Using Emulation of Meshes of Trees.
Parallel Comput., 1997

A New Digraphs Composition with Applications to De Bruijn and Generalized De Bruijn Digraphs.
Discret. Appl. Math., 1997

Approximation Algorithms for Structured Communication Problems.
Proceedings of the 9th Annual ACM Symposium on Parallel Algorithms and Architectures, 1997

Optimal Broadcasting in the Back to Back d-ary Trees.
Inf. Process. Lett., 1996

Emulating Networks by Bus Networks: Application to Trees and Hypermeshes.
Proceedings of the SIROCCO'96, 1996

Bandwidth and Cutwidth of the Mesh of <i>d</i>-Ary Trees.
Proceedings of the Euro-Par '96 Parallel Processing, 1996

On Bandwidth, Cutwidth, and Quotient Graphs.
RAIRO Theor. Informatics Appl., 1995

Compatible Eulerian Circuits in K<sub>n</sub>**.
Discret. Appl. Math., 1995

Two Edge-Disjoint Hamiltonian Cycles in the Butterfly Graph.
Inf. Process. Lett., 1994

Embedding Meshes of d-Ary Trees into de Bruijn Graphs.
Parallel Process. Lett., 1993

An Algorithm of Broadcasting in the Mesh of Trees.
Proceedings of the Parallel Processing: CONPAR 92, 1992