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
Hilfe
Suche: Author="Halld{\'o}rsson, Magn{\'u}s"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Wireless capacity with arbitrary gain matrix
Magnús M. Halldórsson
,
Pradipta Mitra
Theoretical Computer Science
553
, 2014, pp. 57-63
SDP-based algorithms for maximum independent set problems on hypergraphs
Geir Agnarsson
,
Magnús M. Halldórsson
,
Elena Losievskaja
Theoretical Computer Science
470
, 2013, pp. 1-9
Approximation and parameterized algorithms for common subtrees and edit distance between unordered trees
Tatsuya Akutsu
,
Daiji Fukagawa
,
Magnús M. Halldórsson
,
Atsuhiro Takasu
,
Keisuke Tanaka
Theoretical Computer Science
470
, 2013, pp. 10-22
Online selection of intervals and
t
-intervals
Unnar Th. Bachmann
,
Magnús M. Halldórsson
,
Hadas Shachnai
Information and Computation
233
, 2013, pp. 1-11
Online scheduling with interval conflicts
Magnús M. Halldórsson
,
Boaz Patt-Shamir
,
Dror Rawitz
Theory of Computing Systems
53
(2), 2013, pp. 300-317
Online set packing
Yuval Emek
,
Magnús M. Halldórsson
,
Yishay Mansour
,
Boaz Patt-Shamir
,
Jaikumar Radhakrishnan
,
Dror Rawitz
SIAM Journal on Computing
41
(4), 2012, pp. 728-746
Space-constrained interval selection
Yuval Emek
,
Magnús M. Halldórsson
,
Adi Rosén
Lecture Notes in Computer Science
7391
, 2012, pp. 302-313
Streaming and communication complexity of clique approximation
Magnús M. Halldórsson
,
Xiaoming Sun
,
Mario Szegedy
,
Chengu Wang
Lecture Notes in Computer Science
7391
, 2012, pp. 449-460
Improved approximation algorithms for Bipartite Correlation Clustering
Nir Ailon
,
Noa Avigdor-Elgrabli
,
Edo Liberty
,
Anke van Zuylen
Lecture Notes in Computer Science
6942
, 2011, pp. 25-36
AdCell: Ad allocation in cellular networks
Saeed Alaei
,
Mohammad T. Hajiaghayi
,
Vahid Liaghat
,
Dan Pei
,
Barna Saha
Lecture Notes in Computer Science
6942
, 2011, pp. 311-322
Can nearest neighbor searching be simple and always fast?
Victor Alvarez
,
David G. Kirkpatrick
,
Raimund Seidel
Lecture Notes in Computer Science
6942
, 2011, pp. 82-92
Submodular Max-SAT
Yossi Azar
,
Iftah Gamzu
,
Ran Roth
Lecture Notes in Computer Science
6942
, 2011, pp. 323-334
Optimal discovery strategies in white space networks
Yossi Azar
,
Ori Gurel-Gurevich
,
Eyal Lubetzky
,
Thomas Moscibroda
Lecture Notes in Computer Science
6942
, 2011, pp. 713-722
Deterministic discrepancy minimization
Nikhil Bansal
,
Joel Spencer
Lecture Notes in Computer Science
6942
, 2011, pp. 408-420
Mixed-criticality scheduling of sporadic task systems
Sanjoy K. Baruah
,
Vincenzo Bonifaci
,
Gianlorenzo D'Angelo
,
Alberto Marchetti-Spaccamela
,
Suzanne van der Ster
,
Leen Stougie
Lecture Notes in Computer Science
6942
, 2011, pp. 555-566
Alphabet-independent compressed text indexing
Djamal Belazzougui
,
Gonzalo Navarro
Lecture Notes in Computer Science
6942
, 2011, pp. 748-759
Passenger flow-oriented train disposition
Annabell Berger
,
Christian Blaar
,
Andreas Gebhardt
,
Matthias Müller-Hannemann
,
Mathias Schnee
Lecture Notes in Computer Science
6942
, 2011, pp. 227-238
Cover-decomposition and polychromatic numbers
Béla Bollobás
,
David Pritchard
,
Thomas Rothvoß
,
Alex Scott
Lecture Notes in Computer Science
6942
, 2011, pp. 799-810
Recoverable robustness by column generation
P.C. Bouman
,
J.M. van den Akker
,
J.A. Hoogeveen
Lecture Notes in Computer Science
6942
, 2011, pp. 215-226
Smoothed performance guarantees for local search
Tobias Brunsch
,
Heiko Röglin
,
Cyriel Rutten
,
Tjark Vredeveld
Lecture Notes in Computer Science
6942
, 2011, pp. 772-783
Resource allocation for covering time varying demands
Venkatesan T. Chakaravarthy
,
Amit Kumar
,
Sambuddha Roy
,
Yogish Sabharwal
Lecture Notes in Computer Science
6942
, 2011, pp. 543-554
How profitable are strategic behaviors in a market?
Ning Chen
,
Xiaotie Deng
,
Jie Zhang
Lecture Notes in Computer Science
6942
, 2011, pp. 106-118
A nearly optimal algorithm for finding
L_1
shortest paths among polygonal obstacles in the plane
Danny Z. Chen
,
Haitao Wang
Lecture Notes in Computer Science
6942
, 2011, pp. 481-492
Improving the price of anarchy for Selfish Routing via coordination mechanisms
George Christodoulou
,
Kurt Mehlhorn
,
Evangelia Pyrga
Lecture Notes in Computer Science
6942
, 2011, pp. 119-130
Better bounds for incremental frequency allocation in bipartite graphs
Marek Chrobak
,
Łukasz Jeż
,
Jiȓí Sgall
Lecture Notes in Computer Science
6942
, 2011, pp. 251-262
Seiten 1
2
3
4
5
6
7
8
9
10
11
12
>