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 M."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Multicoloring trees
Magnús M. Halldórsson
,
Guy Kortsarz
,
Andrzej Proskurowski
,
Ravit Salman
,
Hadas Shachnai
,
Jan Arne Telle
Information and Computation
180
(2), 2003, pp. 113-129
Approximating the domatic number
Uriel Feige
,
Magnús M. Halldórsson
,
Guy Kortsarz
,
Aravind Srinivasan
SIAM Journal on Computing
32
(1), 2002-2003, pp. 172-195
Online independent sets
Magnús M. Halldórsson
,
Kazuo Iwama
,
Shuichi Miyazaki
,
Shiro Taketomi
Theoretical Computer Science
289
(2), 2002, pp. 953-962
Tools for multicoloring with applications to planar graphs and partial
k
-trees
Magnús M. Halldórsson
,
Guy Kortsarz
Journal of Algorithms
42
(2), 2002, pp. 334-366
Approximation for the general block distribution of a matrix
Bengt Aspvall
,
Magnús M. Halldórsson
,
Fredrik Manne
Theoretical Computer Science
262
(1-2), 2001, pp. 145-160
Approximation algorithms for dispersion problems
Barun Chandra
,
Magnús M. Halldórsson
Journal of Algorithms
38
(2), 2001, pp. 438-465
On the approximation of largest common subtrees and largest common point sets
Tatsuya Akutsu
,
Magnús M. Halldórsson
Theoretical Computer Science
233
(1-2), 2000, pp. 33-50
Sum multicoloring of graphs
Amotz Bar-Noy
,
Magnús M. Halldórsson
,
Guy Kortsarz
,
Ravit Salman
,
Hadas Shachnai
Journal of Algorithms
37
(2), 2000, pp. 422-450
Online independent sets
Magnús M. Halldórsson
,
Kazuo Iwama
,
Shuichi Miyazaki
,
Shiro Taketomi
Lecture Notes in Computer Science
1858
, 2000, pp. 202-209
Independent sets with domination constraints
Magnús M. Halldórsson
,
Jan Kratochvíl
,
Jan Arne Telle
Discrete Applied Mathematics
99
(1-3), 2000, pp. 39-54
Mod-2 independence and domination in graphs
Magnús M. Halldórsson
,
Jan Kratochvíl
,
Jan Arne Telle
International Journal of Foundations of Computer Science
11
(3), 2000, pp. 355-363
Sum multi-coloring of graphs
Amotz Bar-Noy
,
Magnús M. Halldórsson
,
Guy Kortsarz
,
Ravit Salman
,
Hadas Shachnai
Lecture Notes in Computer Science
1643
, 1999, pp. 390-401
Greedy local improvement and weighted set packing approximation
Barun Chandra
,
Magnús M. Halldórsson
Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'99 (Baltimore, Maryland, January 17-19, 1999)
, 1999, pp. 169-176
Multi-coloring trees
Magnús M. Halldórsson
,
Guy Kortsarz
,
Andrzej Proskurowski
,
Rabit Salman
,
Hadas Shachnai
,
Jan Arne Telle
Lecture Notes in Computer Science
1627
, 1999, pp. 271-280
Multicoloring planar graphs and partial
k
-trees
Magnús M. Halldórsson
,
Guy Kortsarz
Lecture Notes in Computer Science
1671
, 1999, pp. 73-84
Mod-2 independence and domination in graphs
Magnús M. Halldórsson
,
Jan Kratochvíl
,
Jan Arne Telle
Lecture Notes in Computer Science
1665
, 1999, pp. 101-109
Approximations of weighted independent set and hereditary subset problems
Magnús M. Halldórsson
Lecture Notes in Computer Science
1627
, 1999, pp. 261-270
Online Coloring known graphs
Magnús M. Halldórsson
Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'99 (Baltimore, Maryland, January 17-19, 1999)
, 1999, pp. 917-918
Approximations for the general block distribution of a matrix
Bengt Aspvall
,
Magnús M. Halldórsson
,
Fredrik Manne
Lecture Notes in Computer Science
1432
, 1998, pp. 47-58
Independent sets with domination constraints
Magnús M. Halldórsson
,
Jan Kratochvíl
,
Jan Arne Telle
Lecture Notes in Computer Science
1443
, 1998, pp. 176-187
Approximations of independent sets in graphs
Magnús M. Halldórsson
Lecture Notes in Computer Science
1444
, 1998, pp. 1-13
Parallel and on-line graph coloring
Magnús M. Halldórsson
Journal of Algorithms
23
(2), 1997, pp. 265-280
Facility dispersion and remote subgraphs
Barun Chandra
,
Magnús M. Halldórsson
Lecture Notes in Computer Science
1097
, 1996, pp. 53-65
Approximation and special cases of common subtrees and editing distance
Magnús M. Halldórsson
,
Keisuke Tanaka
Lecture Notes in Computer Science
1178
, 1996, pp. 75-84
Approximating
k
-set cover and complementary graph coloring
Magnús M. Halldórsson
Lecture Notes in Computer Science
1084
, 1996, pp. 118-131
Seiten 1
2
>