Magnús M. Halldórsson - researchr alias

researchr

You are not signed in
Sign in
Sign up

2011

Sum edge coloring of multigraphs via configuration LPMagnús M. Halldórsson, Guy Kortsarz, Maxim Sviridenko. talg, 7(2):22, 2011. [doi]

Wireless Capacity with Oblivious Power in General MetricsMagnús M. Halldórsson, Pradipta Mitra. soda 2011: 1538-1548 [doi]

Nearly Optimal Bounds for Distributed Wireless Scheduling in the SINR ModelMagnús M. Halldórsson, Pradipta Mitra. icalp 2011: 625-636 [doi]

2010

Vertex coloring the square of outerplanar graphs of low degreeGeir Agnarsson, Magnús M. Halldórsson. dmgt, 30(4):619-636, 2010. [doi]

Online Selection of Intervals and ::::t::::-IntervalsUnnar Th. Bachmann, Magnús M. Halldórsson, Hadas Shachnai. swat 2010: 383-394 [doi]

Online set packing and competitive scheduling of multi-part tasksYuval Emek, Magnús M. Halldórsson, Yishay Mansour, Boaz Patt-Shamir, Jaikumar Radhakrishnan, Dror Rawitz. podc 2010: 440-449 [doi]

On spectrum sharing gamesMagnús M. Halldórsson, Joseph Y. Halpern, Erran L. Li, Vahab S. Mirrokni. dc, 22(4):235-248, 2010. [doi]

Return of the Boss Problem: Competing Online against a Non-adaptive AdversaryMagnús M. Halldórsson, Hadas Shachnai. fun 2010: 237-248 [doi]

Streaming Algorithms for Independent SetsBjarni V. Halldórsson, Magnús M. Halldórsson, Elena Losievskaja, Mario Szegedy. icalp 2010: 641-652 [doi]

Online coloring of hypergraphsMagnús M. Halldórsson. ipl, 110(10):370-372, 2010. [doi]

Graphs Capturing Alternations in WordsMagnús M. Halldórsson, Sergey Kitaev, Artem V. Pyatkin. dlt 2010: 436-437 [doi]

2008

Automata, Languages and Programming, 35th International Colloquium, ICALP 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part I: Tack A: Algorithms, Automata, Complexity, and GamesLuca Aceto, Ivan Damgård, Leslie Ann Goldberg, Magnús M. Halldórsson, Anna Ingólfsdóttir, Igor Walukiewicz, editors, Volume 5125 of Lecture Notes in Computer Science, Springer, 2008.

Automata, Languages and Programming, 35th International Colloquium, ICALP 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part II - Track B: Logic, Semantics, and Theory of Programming & Track C: Security and Cryptography FoundationsLuca Aceto, Ivan Damgård, Leslie Ann Goldberg, Magnús M. Halldórsson, Anna Ingólfsdóttir, Igor Walukiewicz, editors, Volume 5126 of Lecture Notes in Computer Science, Springer, 2008.

Vertex coloring acyclic digraphs and their corresponding hypergraphsGeir Agnarsson, Ágúst S. Egilsson, Magnús M. Halldórsson. DAM, 156(10):1918-1928, 2008. [doi]

Robust cost coloringsTakuro Fukunaga, Magnús M. Halldórsson, Hiroshi Nagamochi. soda 2008: 1204-1212 [doi]

Improved bounds for scheduling conflicting jobs with minsum criteriaRajiv Gandhi, Magnús M. Halldórsson, Guy Kortsarz, Hadas Shachnai. talg, 4(1), 2008. [doi]

Min Sum Edge Coloring in Multigraphs Via Configuration LPMagnús M. Halldórsson, Guy Kortsarz, Maxim Sviridenko. ipco 2008: 359-373 [doi]

Minimizing interference of a wireless ad-hoc network in a planeMagnús M. Halldórsson, Takeshi Tokuyama. TCS, 402(1):29-42, 2008. [doi]

Batch Coloring Flat Graphs and ThinMagnús M. Halldórsson, Hadas Shachnai. swat 2008: 198-209 [doi]

2007

Strongly simplicial vertices of powers of treesGeir Agnarsson, Magnús M. Halldórsson. DM, 307(21):2647-2652, 2007. [doi]

Rent-or-Buy Scheduling and Cost Coloring ProblemsTakuro Fukunaga, Magnús M. Halldórsson, Hiroshi Nagamochi. fsttcs 2007: 84-95 [doi]

Independent Sets in Bounded-Degree HypergraphsMagnús M. Halldórsson, Elena Losievskaja. wads 2007: 263-274 [doi]

Fixed-Parameter Tractability for Non-Crossing Spanning TreesMagnús M. Halldórsson, Christian Knauer, Andreas Spillner, Takeshi Tokuyama. wads 2007: 410-421 [doi]

Improved approximation results for the stable marriage problemMagnús M. Halldórsson, Kazuo Iwama, Shuichi Miyazaki, Hiroki Yanagisawa. talg, 3(3), 2007. [doi]

Complete partitions of graphsMagnús M. Halldórsson, Guy Kortsarz, Jaikumar Radhakrishnan, Sivaramakrishnan Sivasubramanian. combinatorica, 27(5):519-550, 2007. [doi]

2006

2005

Approximation algorithms for optimization problems in graphs with superlogarithmic treewidthArtur Czumaj, Magnús M. Halldórsson, Andrzej Lingas, Johan Nilsson. ipl, 94(2):49-53, 2005. [doi]

Approximation Algorithms for the Weighted Independent Set ProblemAkihisa Kako, Takao Ono, Tomio Hirata, Magnús M. Halldórsson. criwg 2005: 341-350 [doi]

2004

Strong Colorings of HypergraphsGeir Agnarsson, Magnús M. Halldórsson. waoa 2005: 253-266 [doi]

On colorings of squares of outerplanar graphsGeir Agnarsson, Magnús M. Halldórsson. soda 2004: 244-253 [doi]

Improved Bounds for Sum Multicoloring and Scheduling Dependent Jobs with Minsum CriteriaRajiv Gandhi, Magnús M. Halldórsson, Guy Kortsarz, Hadas Shachnai. waoa 2005: 68-82 [doi]

Improved Results for Data Migration and Open Shop SchedulingRajiv Gandhi, Magnús M. Halldórsson, Guy Kortsarz, Hadas Shachnai. icalp 2004: 658-669 [doi]

Multicoloring: Problems and TechniquesMagnús M. Halldórsson, Guy Kortsarz. mfcs 2004: 25-41 [doi]

On spectrum sharing gamesMagnús M. Halldórsson, Joseph Y. Halpern, Erran L. Li, Vahab S. Mirrokni. podc 2004: 107-114 [doi]

Randomized approximation of the stable marriage problemMagnús M. Halldórsson, Kazuo Iwama, Shuichi Miyazaki, Hiroki Yanagisawa. TCS, 325(3):439-465, 2004. [doi]

2003

Proper Down-Coloring Simple Acyclic DigraphsGeir Agnarsson, Ágúst S. Egilsson, Magnús M. Halldórsson. agtive 2004: 299-312 [doi]

Coloring Powers of Planar GraphsGeir Agnarsson, Magnús M. Halldórsson. siamdm, 16(4):651-662, 2003. [doi]

Powers of geometric intersection graphs and dispersion algorithmsGeir Agnarsson, Peter Damaschke, Magnús M. Halldórsson. DAM, 132(1-3):3-16, 2003. [doi]

Approximation algorithms for the test cover problemKoen M. J. De Bontridder, Bjarni V. Halldórsson, Magnús M. Halldórsson, Cor A. J. Hurkens, Jan Karel Lenstra, R. Ravi, Leen Stougie. mp, 98(1-3):477-491, 2003. [doi]

Multicoloring treesMagnús M. Halldórsson, Guy Kortsarz, Andrzej Proskurowski, Ravit Salman, Hadas Shachnai, Jan Arne Telle. iandc, 180(2):113-129, 2003. [doi]

Approximability results for stable marriage problems with tiesMagnús M. Halldórsson, Robert W. Irving, Kazuo Iwama, David Manlove, Shuichi Miyazaki, Yasufumi Morita, Sandy Scott. TCS, 306(1-3):431-447, 2003. [doi]

Randomized Approximation of the Stable Marriage ProblemMagnús M. Halldórsson, Kazuo Iwama, Shuichi Miyazaki, Hiroki Yanagisawa. cocoon 2003: 339-350 [doi]

Improved Approximation of the Stable Marriage ProblemMagnús M. Halldórsson, Kazuo Iwama, Shuichi Miyazaki, Hiroki Yanagisawa. esa 2003: 266-277 [doi]

Sum Coloring Interval and k-Claw Free Graphs with Application to Scheduling Dependent JobsMagnús M. Halldórsson, Guy Kortsarz, Hadas Shachnai. algorithmica, 37(3):187-209, 2003. [doi]

2002

Powers of Geometric Intersection Graphs and Dispersion AlgorithmsGeir Agnarsson, Peter Damaschke, Magnús M. Halldórsson. swat 2002: 140-149 [doi]

Scheduling split intervalsReuven Bar-Yehuda, Magnús M. Halldórsson, Joseph Naor, Hadas Shachnai, Irina Shapira. soda 2002: 732-741 [doi]

Approximating the Domatic NumberUriel Feige, Magnús M. Halldórsson, Guy Kortsarz, Aravind Srinivasan. siamcomp, 32(1):172-195, 2002. [doi]

Inapproximability Results on Stable Marriage ProblemsMagnús M. Halldórsson, Kazuo Iwama, Shuichi Miyazaki, Yasufumi Morita. latin 2002: 554-568 [doi]

Online independent setsMagnús M. Halldórsson, Kazuo Iwama, Shuichi Miyazaki, Shiro Taketomi. TCS, 289(2):953-962, 2002.

Tools for Multicoloring with Applications to Planar Graphs and Partial k-TreesMagnús M. Halldórsson, Guy Kortsarz. jal, 42(2):334-366, 2002. [doi]

2001

2000

Coloring powers of planar graphsGeir Agnarsson, Magnús M. Halldórsson. soda 2000: 654-662 [doi]

On the approximation of largest common subtrees and largest common point setsTatsuya Akutsu, Magnús M. Halldórsson. TCS, 233(1-2):33-50, 2000. [doi]

Approximation Algorithms for the Maximum Power Consumption Problem on Combinatorial CircuitsTakao Asano, Magnús M. Halldórsson, Kazuo Iwama, Takeshi Matsuda. isaac 2000: 204-215 [doi]

Sum Multicoloring of GraphsAmotz Bar-Noy, Magnús M. Halldórsson, Guy Kortsarz, Ravit Salman, Hadas Shachnai. jal, 37(2):422-450, 2000.

Approximating the domatic numberUriel Feige, Magnús M. Halldórsson, Guy Kortsarz. stoc 2000: 134-143 [doi]

Algorithm Theory - SWAT 2000, 7th Scandinavian Workshop on Algorithm Theory, Bergen, Norway, July 5-7, 2000, ProceedingsMagnús M. Halldórsson, editor, Volume 1851 of Lecture Notes in Computer Science, Springer, 2000.

Approximations of Weighted Independent Set and Hereditary Subset ProblemsMagnús M. Halldórsson. jgaa, 4(1), 2000. [doi]

Online Independent SetsMagnús M. Halldórsson, Kazuo Iwama, Shuichi Miyazaki, Shiro Taketomi. cocoon 2000: 202-209 [doi]

Guest Editor s ForewordMagnús M. Halldórsson. njc, 7(3):149-150, 2000.

Mod-2 Independence and Domination in GraphsMagnús M. Halldórsson, Jan Kratochvíl, Jan Arne Telle. ijfcs, 11(3):355-363, 2000.

Online Coloring Known GraphsMagnús M. Halldórsson. combinatorics, 7, 2000. [doi]

Independent Sets with Domination ConstraintsMagnús M. Halldórsson, Jan Kratochvíl, Jan Arne Telle. DAM, 99(1-3):39-54, 2000. [doi]

1999

A Matched Approximation Bound for the Sum of a Greedy ColoringAmotz Bar-Noy, Magnús M. Halldórsson, Guy Kortsarz. ipl, 71(3-4):135-140, 1999. [doi]

Sum Multi-coloring of GraphsAmotz Bar-Noy, Magnús M. Halldórsson, Guy Kortsarz, Ravit Salman, Hadas Shachnai. esa 1999: 390-401 [doi]

Greedy Local Improvement and Weighted Set Packing ApproximationBarun Chandra, Magnús M. Halldórsson. soda 1999: 169-176 [doi]

Multi-coloring TreesMagnús M. Halldórsson, Guy Kortsarz, Andrzej Proskurowski, Ravit Salman, Hadas Shachnai, Jan Arne Telle. cocoon 1999: 271-280 [doi]

Finding Subsets Maximizing Minimum StructuresMagnús M. Halldórsson, Kazuo Iwano, Naoki Katoh, Takeshi Tokuyama. siamdm, 12(3):342-359, 1999. [doi]

Approximations of Weighted Independent Set and Hereditary Subset ProblemsMagnús M. Halldórsson. cocoon 1999: 261-270 [doi]

Mod-2 Independence and Domination in GraphsMagnús M. Halldórsson, Jan Kratochvíl, Jan Arne Telle. criwg 1999: 101-109 [doi]

Online Coloring Known GraphsMagnús M. Halldórsson. soda 1999: 917-918 [doi]

Multicoloring Planar Graphs and Partial k-TreesMagnús M. Halldórsson, Guy Kortsarz. random 1999: 73-84

1998

1997

Greed is Good: Approximating Independent Sets in Sparse and Bounded-Degree GraphsMagnús M. Halldórsson, Jaikumar Radhakrishnan. algorithmica, 18(1):145-163, 1997.

Parallel and On-Line Graph ColoringMagnús M. Halldórsson. jal, 23(2):265-280, 1997.

Low-degree Graph Partitioning via Local Search with Applications to Constraint Satisfaction, Max Cut, and ColoringMagnús M. Halldórsson, Hoong Chuin Lau. jgaa, 1, 1997. [doi]

1996

Facility Dispersion and Remote SubgraphsBarun Chandra, Magnús M. Halldórsson. swat 1996: 53-65

Approximation and Special Cases of Common Subtrees and Editing DistanceMagnús M. Halldórsson, Keisuke Tanaka. isaac 1996: 75-84

Approximating ::::k::::-Set Cover and Complementary Graph ColoringMagnús M. Halldórsson. ipco 1996: 118-131

1995

Finding Subsets Maximizing Minimum StructuresMagnús M. Halldórsson, Kazuo Iwano, Naoki Katoh, Takeshi Tokuyama. soda 1995: 150-159

Approximating Discrete Collections via Local ImprovementsMagnús M. Halldórsson. soda 1995: 160-169

Greedy Approximations of Independent Sets in Low Degree GraphsMagnús M. Halldórsson, Kiyohito Yoshihara. isaac 1995: 152-161

1994

1993

On Some Communication Complexity Problems Related to THreshold FunctionsMagnús M. Halldórsson, Jaikumar Radhakrishnan, K. V. Subrahmanyam. fsttcs 1993: 248-259

PreviousNext