Arne Leitert

24 papers B 4C 1Journal 17Unranked 2
YearRankTypeTitle / Venue / Authors
2022 J jnl
Injective Hulls of Various Graph Classes.
Graphs Comb.
Heather M. Guarnera, Feodor F. Dragan, Arne Leitert
2021 B conf
Computing the Union Join and Subset Graph of Acyclic Hypergraphs in Subquadratic Time.
WADS
Arne Leitert
2021 J jnl
Computing the Union Join and Subset Graph of Acyclic Hypergraphs in Subquadratic Time.
CoRR
Arne Leitert
2020 J jnl
Injective hulls of various graph classes.
CoRR
Heather M. Guarnera, Feodor F. Dragan, Arne Leitert
2019 J jnl
Equivalence between pathbreadth and strong pathbreadth.
Discret. Appl. Math.
Guillaume Ducoffe, Arne Leitert
2019 J jnl
Parameterized approximation algorithms for some location problems in graphs.
Theor. Comput. Sci.
Arne Leitert, Feodor F. Dragan
2018 J jnl
Equivalence between pathbreadth and strong pathbreadth.
CoRR
Guillaume Ducoffe, Arne Leitert
2017 J jnl
3-colouring for dually chordal graphs and generalisations.
Inf. Process. Lett.
Arne Leitert
2017 J jnl
Line-Distortion, Bandwidth and Path-Length of a Graph.
Algorithmica
Feodor F. Dragan, Ekkehard Köhler, Arne Leitert
2017 J jnl
On the minimum eccentricity shortest path problem.
Theor. Comput. Sci.
Feodor F. Dragan, Arne Leitert
2017 — conf
Parameterized Approximation Algorithms for Some Location Problems in Graphs.
COCOA (2)
Arne Leitert, Feodor F. Dragan
2017 J jnl
Parameterized Approximation Algorithms for some Location Problems in Graphs.
CoRR
Arne Leitert, Feodor F. Dragan
2016 J jnl
Minimum Eccentricity Shortest Paths in some Structured Graph Classes.
J. Graph Algorithms Appl.
Feodor F. Dragan, Arne Leitert
2016 C conf
On Strong Tree-Breadth.
COCOA
Arne Leitert, Feodor F. Dragan
2015 B conf
Minimum Eccentricity Shortest Paths in Some Structured Graph Classes.
WG
Feodor F. Dragan, Arne Leitert
2015 J jnl
Minimum Eccentricity Shortest Paths in some Structured Graph Classes.
CoRR
Feodor F. Dragan, Arne Leitert
2015 B conf
On the Minimum Eccentricity Shortest Path Problem.
WADS
Feodor F. Dragan, Arne Leitert
2015 J jnl
Polynomial-time algorithms for weighted efficient domination problems in AT-free graphs and dually chordal graphs.
Inf. Process. Lett.
Andreas Brandstädt, Pavel Ficur, Arne Leitert, Martin Milanic
2014 — conf
Line-Distortion, Bandwidth and Path-Length of a Graph.
SWAT
Feodor F. Dragan, Ekkehard Köhler, Arne Leitert
2014 J jnl
Line-distortion, Bandwidth and Path-length of a graph.
CoRR
Feodor F. Dragan, Ekkehard Köhler, Arne Leitert
2014 J jnl
Polynomial-time Algorithms for Weighted Efficient Domination Problems in AT-free Graphs and Dually Chordal Graphs.
CoRR
Andreas Brandstädt, Pavel Ficur, Arne Leitert, Martin Milanic
2012 J jnl
3-Colourability of Dually Chordal Graphs in Linear Time
CoRR
Arne Leitert
2012 J jnl
Efficient Dominating and Edge Dominating Sets for Graphs and Hypergraphs
CoRR
Andreas Brandstädt, Arne Leitert, Dieter Rautenbach
2012 B conf
Efficient Dominating and Edge Dominating Sets for Graphs and Hypergraphs.
ISAAC
Andreas Brandstädt, Arne Leitert, Dieter Rautenbach