BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Denmark
1 × Finland
1 × France
1 × Greece
1 × Switzerland
1 × United Kingdom
2 × Canada
3 × USA
Collaborated with:
G.Agnarsson E.Losievskaja G.Kortsarz T.Tonoyan M.Szegedy P.Mitra R.Wattenhofer J.Radhakrishnan Y.Emek A.Rosén S.Kitaev A.V.Pyatkin Á.S.Egilsson U.Feige J.Kratochvíl J.A.Telle X.Sun C.Wang B.V.Halldórsson R.Gandhi H.Shachnai
Talks about:
independ (4) set (4) wireless (3) approxim (3) graph (3) algorithm (2) communic (2) schedul (2) stream (2) bound (2)

Person: Magnús M. Halldórsson

DBLP DBLP: Halld=oacute=rsson:Magn=uacute=s_M=

Facilitated 5 volumes:

ICALP (1) 2015Ed
ICALP (2) 2015Ed
ICALP (1) 2008Ed
ICALP (2) 2008Ed
ICALP (2) 2008Ed

Contributed to:

STOC 20152015
ICALP (1) 20122012
ICALP (2) 20112011
DLT 20102010
ICALP (1) 20102010
ICALP (1) 20092009
ICALP 20042004
AGTIVE 20032003
STOC 20002000
ICALP 19981998
STOC 19941994

Wrote 13 papers:

STOC-2015-HalldorssonT #graph #how #question
How Well Can Graphs Represent Wireless Interference? (MMH, TT), pp. 635–644.
Space-Constrained Interval Selection (YE, MMH, AR), pp. 302–313.
ICALP-v1-2012-HalldorssonSSW #approximate #clique #communication #complexity #streaming
Streaming and Communication Complexity of Clique Approximation (MMH, XS, MS, CW), pp. 449–460.
ICALP-v2-2011-HalldorssonM #bound #distributed #scheduling
Nearly Optimal Bounds for Distributed Wireless Scheduling in the SINR Model (MMH, PM), pp. 625–636.
DLT-2010-HalldorssonKP #graph #word
Graphs Capturing Alternations in Words (MMH, SK, AVP), pp. 436–437.
ICALP-v1-2010-HalldorssonHLS #algorithm #independence #set #streaming
Streaming Algorithms for Independent Sets (BVH, MMH, EL, MS), pp. 641–652.
ICALP-v1-2009-AgnarssonHL #algorithm #independence #problem #set
SDP-Based Algorithms for Maximum Independent Set Problems on Hypergraphs (GA, MMH, EL), pp. 12–23.
ICALP-v1-2009-HalldorssonW #communication
Wireless Communication Is in APX (MMH, RW), pp. 525–536.
ICALP-2004-GandhiHKS #migration #scheduling
Improved Results for Data Migration and Open Shop Scheduling (RG, MMH, GK, HS), pp. 658–669.
AGTIVE-2003-AgnarssonEH #graph
Proper Down-Coloring Simple Acyclic Digraphs (GA, ÁSE, MMH), pp. 299–312.
STOC-2000-FeigeHK #approximate
Approximating the domatic number (UF, MMH, GK), pp. 134–143.
ICALP-1998-Telle #constraints #independence #set
Independent Sets with Domination Constraints (MMH, JK, JAT), pp. 176–187.
STOC-1994-HalldorssonR #approximate #bound #graph #independence #set
Greed is good: approximating independent sets in sparse and bounded-degree graphs (MMH, JR), pp. 439–448.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.