Line-Distortion, Bandwidth and Path-Length of a Graph (English)
- New search for: Dragan, Feodor F.
- New search for: Köhler, Ekkehard
- New search for: Leitert, Arne
- New search for: Dragan, Feodor F.
- New search for: Köhler, Ekkehard
- New search for: Leitert, Arne
In:
Algorithmica
;
77
, 3
; 686-713
;
2015
-
ISSN:
- Article (Journal) / Print
-
Title:Line-Distortion, Bandwidth and Path-Length of a Graph
-
Contributors:
-
Published in:Algorithmica ; 77, 3 ; 686-713
-
Publisher:
- New search for: Springer US
- New search for: Springer
-
Place of publication:New York, N.Y.
-
Publication date:2015
-
ISSN:
-
ZDBID:
-
DOI:
-
Type of media:Article (Journal)
-
Type of material:Print
-
Language:English
- New search for: 54.00
- Further information on Basic classification
- New search for: 770/3145/3155
-
Keywords:
-
Classification:
BKL: 54.00 Informatik: Allgemeines Local classification TIB: 770/3145/3155 -
Source:
Table of contents – Volume 77, Issue 3
The tables of contents are generated automatically and are based on the data records of the individual contributions available in the index of the TIB portal. The display of the Tables of Contents may therefore be incomplete.
- 619
-
A Polynomial Turing-Kernel for Weighted Independent Set in Bull-Free GraphsThomassé, Stéphan / Trotignon, Nicolas / Vušković, Kristina et al. | 2015
- 642
-
Exact Algorithms for Minimum Weighted Dominating Induced MatchingLin, Min Chih / Mizrahi, Michel J. / Szwarcfiter, Jayme L. et al. | 2015
- 661
-
Evaluation of Monotone DNF FormulasAllen, Sarah R. / Hellerstein, Lisa / Kletenik, Devorah / Ünlüyurt, Tonguç et al. | 2015
- 686
-
Line-Distortion, Bandwidth and Path-Length of a GraphDragan, Feodor F. / Köhler, Ekkehard / Leitert, Arne et al. | 2015
- 714
-
I/O-Efficient Path Traversal in Succinct Planar GraphsDillabaugh, Craig / He, Meng / Maheshwari, Anil / Zeh, Norbert et al. | 2015
- 756
-
Combinatorial Auctions Without MoneyFotakis, Dimitris / Krysta, Piotr / Ventre, Carmine et al. | 2015
- 786
-
Efficient Algorithms for Clique-Colouring and Biclique-Colouring Unichord-Free GraphsFilho, H. B. Macêdo / Machado, R. C. S. / Figueiredo, C. M. H. et al. | 2016
- 815
-
Combinatorial Relaxation Algorithm for the Entire Sequence of the Maximum Degree of MinorsSato, Shun et al. | 2016
- 836
-
The Price of Optimum: Complexity and Approximation for a Matching GameEscoffier, Bruno / Gourvès, Laurent / Monnot, Jérôme et al. | 2016
- 867
-
Online Square-into-Square PackingFekete, Sándor P. / Hoffmann, Hella-Franziska et al. | 2016
- 902
-
Improved Approximation Algorithms for Box Contact RepresentationsBekos, Michael A. / Dijk, Thomas C. / Fink, Martin / Kindermann, Philipp / Kobourov, Stephen / Pupyrev, Sergey / Spoerhase, Joachim / Wolff, Alexander et al. | 2016
- 921
-
The Price of Anarchy in Bilateral Network Formation in an Adversary ModelKliemann, Lasse et al. | 2016
- 942
-
Exclusive Graph SearchingBlin, Lélia / Burman, Janna / Nisse, Nicolas et al. | 2016