D. Barth

Available identifiers

zbMath Open barth.dominiqueMaRDI QIDQ705132

List of research outcomes

Publication	Date of Publication	Type
Configuring an heterogeneous smartgrid network: complexity and approximations for tree topologies	2024-05-06	Paper
A Graph-Based Similarity Approach to Classify Recurrent Complex Motifs from Their Context in RNA Structures	2023-06-23	Paper
A polynomial algorithm for deciding the validity of an electrical distribution tree	2022-04-07	Paper
Optimisation of electrical network configuration: complexity and algorithms for ring topologies	2021-02-15	Paper
Minimizing the Hamming distance between a graph and a line-graph to discover the topology of an electrical network	2020-09-04	Paper
https://portal.mardi4nfdi.de/entity/Q4630433	2019-03-26	Paper
https://portal.mardi4nfdi.de/entity/Q4630485	2019-03-26	Paper
https://portal.mardi4nfdi.de/entity/Q4630494	2019-03-26	Paper
Parameterized complexity and approximability of coverability problems in weighted Petri nets	2018-08-20	Paper
Automated prediction of three-way junction topological families in RNA secondary structures	2017-06-28	Paper
Directed Steiner trees with diffusion costs	2016-11-29	Paper
An FPT algorithm in polynomial space for the directed Steiner tree problem with limited number of diffusing nodes	2014-12-09	Paper
Directed Steiner Tree with Branching Constraint	2014-09-26	Paper
Steiner Problems with Limited Number of Branching Nodes	2013-12-17	Paper
QoS commitment between vertically integrated autonomous systems	2011-08-19	Paper
Distributed learning of equilibria in a routing game	2010-09-29	Paper
On the shape of decomposable trees	2009-12-09	Paper
Transit Prices Negotiation: Combined Repeated Game and Distributed Algorithmic Approach	2009-03-17	Paper
Distributed Learning of Wardrop Equilibria	2008-12-02	Paper
Shuffling biological sequences with motif constraints	2008-08-08	Paper
On the \(b\)-continuity property of graphs	2007-09-18	Paper
https://portal.mardi4nfdi.de/entity/Q3439688	2007-05-29	Paper
A degree bound on decomposable trees	2006-04-28	Paper
Periodic gossiping in commuted networks	2005-01-25	Paper
https://portal.mardi4nfdi.de/entity/Q4813143	2004-08-12	Paper
The permutation-path coloring problem on trees.	2003-08-17	Paper
Uniform emulations of Cartesian-product and Cayley graphs	2002-08-25	Paper
Undirected graphs rearrangeable by 2-length walks	2002-07-21	Paper
https://portal.mardi4nfdi.de/entity/Q4508388	2001-08-06	Paper
Scattering and multi-scattering in trees and meshes, with local routing and without buffering	2000-01-12	Paper
Routing permutations on graphs via factors	1999-09-13	Paper
Parallel matrix product algorithm in the de Bruijn network using emulation of meshes of trees	1998-07-23	Paper
A new digraphs composition with applications to de Bruijn and generalized de Bruijn digraphs	1997-12-18	Paper
On bandwidth, cutwidth, and quotient graphs	1997-11-16	Paper
Optimal broadcasting in the back to back d-ary trees	1997-02-27	Paper
Two edge-disjoint hamiltonian cycles in the butterfly graph	1994-09-25	Paper

Research outcomes over time

This page was built for person: D. Barth