Arne Leitert

According to our database, Arne Leitert authored at least 12 papers between 2012 and 2022.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2022

Injective Hulls of Various Graph Classes.

Heather M. Guarnera, Feodor F. Dragan, Arne Leitert

Graphs Comb., 2022

2021

Computing the Union Join and Subset Graph of Acyclic Hypergraphs in Subquadratic Time.

Arne Leitert

Proceedings of the Algorithms and Data Structures - 17th International Symposium, 2021

2019

Equivalence between pathbreadth and strong pathbreadth.

Guillaume Ducoffe, Arne Leitert

Discret. Appl. Math., 2019

2017

3-colouring for dually chordal graphs and generalisations.

Arne Leitert

Inf. Process. Lett., 2017

Parameterized Approximation Algorithms for Some Location Problems in Graphs.

Arne Leitert, Feodor F. Dragan

Proceedings of the Combinatorial Optimization and Applications, 2017

2016

On Strong Tree-Breadth.

Arne Leitert, Feodor F. Dragan

Proceedings of the Combinatorial Optimization and Applications, 2016

2015

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

Minimum Eccentricity Shortest Paths in Some Structured Graph Classes.

Feodor F. Dragan, Arne Leitert

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2015

On the Minimum Eccentricity Shortest Path Problem.

Feodor F. Dragan, Arne Leitert

Proceedings of the Algorithms and Data Structures - 14th International Symposium, 2015

2014

Line-Distortion, Bandwidth and Path-Length of a Graph.

Feodor F. Dragan, Ekkehard Köhler, Arne Leitert

Proceedings of the Algorithm Theory - SWAT 2014, 2014

2012

3-Colourability of Dually Chordal Graphs in Linear Time

Arne Leitert

CoRR, 2012

Efficient Dominating and Edge Dominating Sets for Graphs and Hypergraphs.

Andreas Brandstädt, Arne Leitert, Dieter Rautenbach

Proceedings of the Algorithms and Computation - 23rd International Symposium, 2012