Arne Leitert

Publication Activity (10 Years)

Years Active: 2012-2022
Publications (10 Years): 14

Top Topics

Top Venues

Inf. Process. Lett.

Theor. Comput. Sci.

Publications

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