31 citations · 31 across the 7 of their papers we have counts for
8 papers
Canonical Join Trees
Arne Leitert
A rooted join tree of an acyclic hypergraph is canonical if each of its nodes has minimum possible depth among all join trees with the same root. Luo et al. [ICDT 2026, article 17]…
Computing the Union Join and Subset Graph of Acyclic Hypergraphs in Subquadratic Time
Arne Leitert
We investigate the two problems of computing the union join graph as well as computing the subset graph for acyclic hypergraphs and their subclasses. In the union join graph of…
Injective hulls of various graph classes
Heather M. Guarnera, Feodor F. Dragan, Arne Leitert
A graph is Helly if its disks satisfy the Helly property, i.e., every family of pairwise intersecting disks in G has a common intersection. It is known that for every graph G, ther…
Equivalence between pathbreadth and strong pathbreadth
Guillaume Ducoffe, Arne Leitert
We say that a given graph has \emph{pathbreadth} at most , denoted $\pb(G) \leq ρ$, if there exists a Roberston and Seymour's path decomposition where every bag is…
Parameterized Approximation Algorithms for some Location Problems in Graphs
Arne Leitert, Feodor F. Dragan
We develop efficient parameterized, with additive error, approximation algorithms for the (Connected) -Domination problem and the (Connected) -Center problem for unweighted a…
Polynomial-time Algorithms for Weighted Efficient Domination Problems in AT-free Graphs and Dually Chordal Graphs
Andreas Brandstädt, Pavel Fičur, Arne Leitert +1
An efficient dominating set (or perfect code) in a graph is a set of vertices the closed neighborhoods of which partition the vertex set of the graph. The minimum weight efficient…
Line-distortion, Bandwidth and Path-length of a graph
Feodor F. Dragan, Ekkehard Köhler, Arne Leitert
We investigate the minimum line-distortion and the minimum bandwidth problems on unweighted graphs and their relations with the minimum length of a Robertson-Seymour's path-decompo…
3-Colourability of Dually Chordal Graphs in Linear Time
Arne Leitert
A graph G is dually chordal if there is a spanning tree T of G such that any maximal clique of G induces a subtree in T. This paper investigates the Colourability problem on dually…