Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[2]
Hilfe
Suche: Journal=Algorithmica AND Volume=69
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
An intersection model for multitolerance graphs: Efficient algorithms and hierarchy
George B. Mertzios
Algorithmica
69
(3), 2014, pp. 540-581
On the Huffman and Alphabetic Tree Problem with general cost functions
Hiroshi Fujiwara
,
Tobias Jacobs
Algorithmica
69
(3), 2014, pp. 582-604
An SDP primal-dual algorithm for approximating the Lovász-Theta function
T.-H. Hubert Chan
,
Kevin L. Chang
,
Rajiv Raman
Algorithmica
69
(3), 2014, pp. 605-618
Improving the price of anarchy for selfish routing via coordination mechanisms
Giorgos Christodoulou
,
Kurt Mehlhorn
,
Evangelia Pyrga
Algorithmica
69
(3), 2014, pp. 619-640
Improved algorithms for partial curve matching
Anil Maheshwari
,
Jörg-Rüdiger Sack
,
Kaveh Shahbaz
,
Hamid Zarrabi-Zadeh
Algorithmica
69
(3), 2014, pp. 641-657
Sparse covers for planar graphs and graphs that exclude a fixed minor
Costas Busch
,
Ryan LaFortune
,
Srikanta Tirthapura
Algorithmica
69
(3), 2014, pp. 658-684
Inclusion/exclusion meets measure and conquer
Jesper Nederlof
,
Johan M.M. van Rooij
,
Thomas C. van Dijk
Algorithmica
69
(3), 2014, pp. 685-740
Better size estimation for sparse matrix products
Rasmus Resen Amossen
,
Andrea Campagna
,
Rasmus Pagh
Algorithmica
69
(3), 2014, pp. 741-757
Practical and efficient circle graph recognition
Emeric Gioan
,
Christophe Paul
,
Marc Tedder
,
Derek Corneil
Algorithmica
69
(4), 2014, pp. 759-788
Practical and efficient split decomposition via graph-labelled trees
Emeric Gioan
,
Christophe Paul
,
Marc Tedder
,
Derek Corneil
Algorithmica
69
(4), 2014, pp. 789-843
On the advantage of overlapping clusters for minimizing conductance
Rohit Khandekar
,
Guy Kortsarz
,
Vahab Mirrokni
Algorithmica
69
(4), 2014, pp. 844-863
Cache-oblivious hashing
Rasmus Pagh
,
Zhewei Wei
,
Ke Yi
,
Qin Zhang
Algorithmica
69
(4), 2014, pp. 864-883
An approximation algorithm for the tree
t
-spanner problem on unweighted graphs via generalized chordal graphs
Feodor F. Dragan
,
Ekkehard Köhler
Algorithmica
69
(4), 2014, pp. 884-905
Optimal indexes for sparse bit vectors
Alexander Golynski
,
Alessio Orlandi
,
Rajeev Raman
,
S. Srinivasa Rao
Algorithmica
69
(4), 2014, pp. 906-924
Computing the throughput of probabilistic and replicated streaming applications
Anne Benoit
,
Matthieu Gallet
,
Bruno Gaujal
,
Yves Robert
Algorithmica
69
(4), 2014, pp. 925-957
Multikey quickselect
Leonor Frias
,
Salvador Roura
Algorithmica
69
(4), 2014, pp. 958-973
Seiten
<
1
2