Arne Leitert
Refine list

refinements active!
zoomed in on ?? of ?? records
view refined list in
showing all ?? records
2010 – today
- 2017
- [j5]Feodor F. Dragan, Ekkehard Köhler, Arne Leitert:
Line-Distortion, Bandwidth and Path-Length of a Graph. Algorithmica 77(3): 686-713 (2017) - [j4]Arne Leitert:
3-colouring for dually chordal graphs and generalisations. Inf. Process. Lett. 128: 21-26 (2017) - [j3]Feodor F. Dragan, Arne Leitert:
On the minimum eccentricity shortest path problem. Theor. Comput. Sci. 694: 66-78 (2017) - [c6]Arne Leitert, Feodor F. Dragan:
Parameterized Approximation Algorithms for Some Location Problems in Graphs. COCOA (2) 2017: 348-361 - [i6]Arne Leitert, Feodor F. Dragan:
Parameterized Approximation Algorithms for some Location Problems in Graphs. CoRR abs/1706.07475 (2017) - 2016
- [j2]Feodor F. Dragan, Arne Leitert:
Minimum Eccentricity Shortest Paths in some Structured Graph Classes. J. Graph Algorithms Appl. 20(2): 299-322 (2016) - [c5]
- 2015
- [j1]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): 256-262 (2015) - [c4]Feodor F. Dragan, Arne Leitert:
On the Minimum Eccentricity Shortest Path Problem. WADS 2015: 276-288 - [c3]Feodor F. Dragan, Arne Leitert:
Minimum Eccentricity Shortest Paths in Some Structured Graph Classes. WG 2015: 189-202 - [i5]Feodor F. Dragan, Arne Leitert:
Minimum Eccentricity Shortest Paths in some Structured Graph Classes. CoRR abs/1511.05109 (2015) - 2014
- [c2]Feodor F. Dragan, Ekkehard Köhler, Arne Leitert:
Line-Distortion, Bandwidth and Path-Length of a Graph. SWAT 2014: 158-169 - [i4]Feodor F. Dragan, Ekkehard Köhler, Arne Leitert:
Line-distortion, Bandwidth and Path-length of a graph. CoRR abs/1409.8389 (2014) - [i3]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 abs/1410.0770 (2014) - 2012
- [c1]Andreas Brandstädt, Arne Leitert, Dieter Rautenbach:
Efficient Dominating and Edge Dominating Sets for Graphs and Hypergraphs. ISAAC 2012: 267-277 - [i2]
- [i1]Andreas Brandstädt, Arne Leitert, Dieter Rautenbach:
Efficient Dominating and Edge Dominating Sets for Graphs and Hypergraphs. CoRR abs/1207.0953 (2012)
Coauthor Index
data released under the ODC-BY 1.0 license; see also our legal information page
last updated on 2017-12-10 23:10 CET by the dblp team