Efficient Dominating and Edge Dominating Sets for Graphs and Hypergraphs. - Andreas Brandstädt; Arne Leitert; Dieter Rautenbach (ISAAC, 2012)

3-Colourability of Dually Chordal Graphs in Linear Time - Arne Leitert (CoRR, 2012)

Polynomial-time algorithms for weighted efficient domination problems in AT-free graphs and dually chordal graphs. - Andreas Brandstädt; Pavel Ficur; Arne Leitert; Martin Milanic (Inf. Process. Lett., 2015)

On Strong Tree-Breadth. - Arne Leitert; Feodor F. Dragan (COCOA, 2016)

Minimum Eccentricity Shortest Paths in some Structured Graph Classes. - Feodor F. Dragan; Arne Leitert (J. Graph Algorithms Appl., 2016)

Line-Distortion, Bandwidth and Path-Length of a Graph. - Feodor F. Dragan; Ekkehard Köhler; Arne Leitert (Algorithmica, 2017)

3-colouring for dually chordal graphs and generalisations. - Arne Leitert (Inf. Process. Lett., 2017)

On the minimum eccentricity shortest path problem. - Feodor F. Dragan; Arne Leitert (Theor. Comput. Sci., 2017)

Equivalence between pathbreadth and strong pathbreadth. - Guillaume Ducoffe; Arne Leitert (Discret. Appl. Math., 2019)

Parameterized approximation algorithms for some location problems in graphs. - Arne Leitert; Feodor F. Dragan (Theor. Comput. Sci., 2019)

Computing the Union Join and Subset Graph of Acyclic Hypergraphs in Subquadratic Time. - Arne Leitert (WADS, 2021)

Injective Hulls of Various Graph Classes. - Heather M. Guarnera; Feodor F. Dragan; Arne Leitert (Graphs Comb., 2022)