default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDArne Leitert
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j8]Heather M. Guarnera
, Feodor F. Dragan, Arne Leitert:
Injective Hulls of Various Graph Classes. Graphs Comb. 38(4): 112 (2022)- 2021
- [c7]Arne Leitert:
Computing the Union Join and Subset Graph of Acyclic Hypergraphs in Subquadratic Time. WADS 2021: 571-584 - [i9]Arne Leitert:
Computing the Union Join and Subset Graph of Acyclic Hypergraphs in Subquadratic Time. CoRR abs/2104.06636 (2021) - 2020
- [i8]Heather M. Guarnera, Feodor F. Dragan, Arne Leitert:
Injective hulls of various graph classes. CoRR abs/2007.14377 (2020)
2010 – 2019
- 2019
- [j7]Guillaume Ducoffe, Arne Leitert:
Equivalence between pathbreadth and strong pathbreadth. Discret. Appl. Math. 262: 185-188 (2019) - [j6]Arne Leitert, Feodor F. Dragan:
Parameterized approximation algorithms for some location problems in graphs. Theor. Comput. Sci. 755: 48-64 (2019) - 2018
- [i7]Guillaume Ducoffe, Arne Leitert:
Equivalence between pathbreadth and strong pathbreadth. CoRR abs/1809.06041 (2018) - 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]Arne Leitert, Feodor F. Dragan:
On Strong Tree-Breadth. COCOA 2016: 62-76 - 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]Arne Leitert:
3-Colourability of Dually Chordal Graphs in Linear Time. CoRR abs/1206.0233 (2012) - [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
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:16 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
