The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Magnús M. Halldórsson: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Geir Agnarsson, Agust S. Egilsson, Magnús M. Halldórsson
    Proper Down-Coloring Simple Acyclic Digraphs. [Citation Graph (0, 0)][DBLP]
    AGTIVE, 2003, pp:299-312 [Conf]
  2. Magnús M. Halldórsson, Takeshi Tokuyama
    Minimizing Interference of a Wireless Ad-Hoc Network in a Plane. [Citation Graph (0, 0)][DBLP]
    ALGOSENSORS, 2006, pp:71-82 [Conf]
  3. Magnús M. Halldórsson
    Approximations of Independent Sets in Graphs. [Citation Graph (0, 0)][DBLP]
    APPROX, 1998, pp:1-13 [Conf]
  4. Leah Epstein, Magnús M. Halldórsson, Asaf Levin, Hadas Shachnai
    Weighted Sum Coloring in Batch Scheduling of Conflicting Jobs. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2006, pp:116-127 [Conf]
  5. Magnús M. Halldórsson
    Approximations of Weighted Independent Set and Hereditary Subset Problems. [Citation Graph (0, 0)][DBLP]
    COCOON, 1999, pp:261-270 [Conf]
  6. Magnús M. Halldórsson, Kazuo Iwama, Shuichi Miyazaki, Shiro Taketomi
    Online Independent Sets. [Citation Graph (0, 0)][DBLP]
    COCOON, 2000, pp:202-209 [Conf]
  7. Magnús M. Halldórsson, Kazuo Iwama, Shuichi Miyazaki, Hiroki Yanagisawa
    Randomized Approximation of the Stable Marriage Problem. [Citation Graph (0, 0)][DBLP]
    COCOON, 2003, pp:339-350 [Conf]
  8. Magnús M. Halldórsson, Guy Kortsarz, Andrzej Proskurowski, Ravit Salman, Hadas Shachnai, Jan Arne Telle
    Multi-coloring Trees. [Citation Graph (0, 0)][DBLP]
    COCOON, 1999, pp:271-280 [Conf]
  9. Amotz Bar-Noy, Magnús M. Halldórsson, Guy Kortsarz, Ravit Salman, Hadas Shachnai
    Sum Multi-coloring of Graphs. [Citation Graph (0, 0)][DBLP]
    ESA, 1999, pp:390-401 [Conf]
  10. Bjarni V. Halldórsson, Magnús M. Halldórsson, R. Ravi
    On the Approximability of the Minimum Test Collection Problem. [Citation Graph (0, 0)][DBLP]
    ESA, 2001, pp:158-169 [Conf]
  11. Magnús M. Halldórsson, Kazuo Iwama, Shuichi Miyazaki, Hiroki Yanagisawa
    Improved Approximation of the Stable Marriage Problem. [Citation Graph (0, 0)][DBLP]
    ESA, 2003, pp:266-277 [Conf]
  12. Magnús M. Halldórsson, Jaikumar Radhakrishnan, K. V. Subrahmanyam
    Directed vs. Undirected Monotone Contact Networks for Threshold Functions [Citation Graph (0, 0)][DBLP]
    FOCS, 1993, pp:604-613 [Conf]
  13. Magnús M. Halldórsson, Jaikumar Radhakrishnan, K. V. Subrahmanyam
    On Some Communication Complexity Problems Related to THreshold Functions. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1993, pp:248-259 [Conf]
  14. Rajiv Gandhi, Magnús M. Halldórsson, Guy Kortsarz, Hadas Shachnai
    Improved Results for Data Migration and Open Shop Scheduling. [Citation Graph (0, 0)][DBLP]
    ICALP, 2004, pp:658-669 [Conf]
  15. Magnús M. Halldórsson, Jan Kratochvíl, Jan Arne Telle
    Independent Sets with Domination Constraints. [Citation Graph (0, 0)][DBLP]
    ICALP, 1998, pp:176-187 [Conf]
  16. Magnús M. Halldórsson
    Approximating k-Set Cover and Complementary Graph Coloring. [Citation Graph (0, 0)][DBLP]
    IPCO, 1996, pp:118-131 [Conf]
  17. Tatsuya Akutsu, Magnús M. Halldórsson
    On the Approximation of Largest Common Subtrees and Largest Common Point Sets. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1994, pp:405-413 [Conf]
  18. Takao Asano, Magnús M. Halldórsson, Kazuo Iwama, Takeshi Matsuda
    Approximation Algorithms for the Maximum Power Consumption Problem on Combinatorial Circuits. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2000, pp:204-215 [Conf]
  19. Magnús M. Halldórsson
    Parallel and On-line Graph Coloring Algorithms. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1992, pp:61-70 [Conf]
  20. Magnús M. Halldórsson, Keisuke Tanaka
    Approximation and Special Cases of Common Subtrees and Editing Distance. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1996, pp:75-84 [Conf]
  21. Magnús M. Halldórsson, Kiyohito Yoshihara
    Greedy Approximations of Independent Sets in Low Degree Graphs. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1995, pp:152-161 [Conf]
  22. Magnús M. Halldórsson, Kazuo Iwama, Shuichi Miyazaki, Yasufumi Morita
    Inapproximability Results on Stable Marriage Problems. [Citation Graph (0, 0)][DBLP]
    LATIN, 2002, pp:554-568 [Conf]
  23. Magnús M. Halldórsson, Guy Kortsarz
    Multicoloring: Problems and Techniques. [Citation Graph (0, 0)][DBLP]
    MFCS, 2004, pp:25-41 [Conf]
  24. Magnús M. Halldórsson, Joseph Y. Halpern, Erran L. Li, Vahab S. Mirrokni
    On spectrum sharing games. [Citation Graph (0, 0)][DBLP]
    PODC, 2004, pp:107-114 [Conf]
  25. Magnús M. Halldórsson, Guy Kortsarz
    Multicoloring Planar Graphs and Partial k-Trees. [Citation Graph (0, 0)][DBLP]
    RANDOM-APPROX, 1999, pp:73-84 [Conf]
  26. Magnús M. Halldórsson, Guy Kortsarz, Hadas Shachnai
    Minimizing Average Completion of Dedicated Tasks and Interval Graphs. [Citation Graph (0, 0)][DBLP]
    RANDOM-APPROX, 2001, pp:114-126 [Conf]
  27. Geir Agnarsson, Magnús M. Halldórsson
    Coloring powers of planar graphs. [Citation Graph (0, 0)][DBLP]
    SODA, 2000, pp:654-662 [Conf]
  28. Geir Agnarsson, Magnús M. Halldórsson
    On colorings of squares of outerplanar graphs. [Citation Graph (0, 0)][DBLP]
    SODA, 2004, pp:244-253 [Conf]
  29. Reuven Bar-Yehuda, Magnús M. Halldórsson, Joseph Naor, Hadas Shachnai, Irina Shapira
    Scheduling split intervals. [Citation Graph (0, 0)][DBLP]
    SODA, 2002, pp:732-741 [Conf]
  30. Barun Chandra, Magnús M. Halldórsson
    Greedy Local Improvement and Weighted Set Packing Approximation. [Citation Graph (0, 0)][DBLP]
    SODA, 1999, pp:169-176 [Conf]
  31. Magnús M. Halldórsson
    Approximating Discrete Collections via Local Improvements. [Citation Graph (0, 0)][DBLP]
    SODA, 1995, pp:160-169 [Conf]
  32. Magnús M. Halldórsson
    Online Coloring Known Graphs. [Citation Graph (0, 0)][DBLP]
    SODA, 1999, pp:917-918 [Conf]
  33. Magnús M. Halldórsson, Kazuo Iwano, Naoki Katoh, Takeshi Tokuyama
    Finding Subsets Maximizing Minimum Structures. [Citation Graph (0, 0)][DBLP]
    SODA, 1995, pp:150-159 [Conf]
  34. Magnús M. Halldórsson, Mario Szegedy
    Lower Bounds for On-Line Graph Coloring. [Citation Graph (0, 0)][DBLP]
    SODA, 1992, pp:211-216 [Conf]
  35. Uriel Feige, Magnús M. Halldórsson, Guy Kortsarz
    Approximating the domatic number. [Citation Graph (0, 0)][DBLP]
    STOC, 2000, pp:134-143 [Conf]
  36. Magnús M. Halldórsson, Jaikumar Radhakrishnan
    Greed is good: approximating independent sets in sparse and bounded-degree graphs. [Citation Graph (0, 0)][DBLP]
    STOC, 1994, pp:439-448 [Conf]
  37. Geir Agnarsson, Peter Damaschke, Magnús M. Halldórsson
    Powers of Geometric Intersection Graphs and Dispersion Algorithms. [Citation Graph (0, 0)][DBLP]
    SWAT, 2002, pp:140-149 [Conf]
  38. Ravi B. Boppana, Magnús M. Halldórsson
    Approximating Maximum Independent Sets by Excluding Subgraphs. [Citation Graph (0, 0)][DBLP]
    SWAT, 1990, pp:13-25 [Conf]
  39. Bengt Aspvall, Magnús M. Halldórsson, Fredrik Manne
    Approximations for the General Block Distribution of a Matrix. [Citation Graph (0, 0)][DBLP]
    SWAT, 1998, pp:47-58 [Conf]
  40. Barun Chandra, Magnús M. Halldórsson
    Facility Dispersion and Remote Subgraphs. [Citation Graph (0, 0)][DBLP]
    SWAT, 1996, pp:53-65 [Conf]
  41. Magnús M. Halldórsson, Jaikumar Radhakrishnan
    Improved Approximations of Independent Sets in Bounded-Degree Graphs. [Citation Graph (0, 0)][DBLP]
    SWAT, 1994, pp:195-206 [Conf]
  42. Geir Agnarsson, Magnús M. Halldórsson
    Strong Colorings of Hypergraphs. [Citation Graph (0, 0)][DBLP]
    WAOA, 2004, pp:253-266 [Conf]
  43. Rajiv Gandhi, Magnús M. Halldórsson, Guy Kortsarz, Hadas Shachnai
    Improved Bounds for Sum Multicoloring and Scheduling Dependent Jobs with Minsum Criteria. [Citation Graph (0, 0)][DBLP]
    WAOA, 2004, pp:68-82 [Conf]
  44. Akihisa Kako, Takao Ono, Tomio Hirata, Magnús M. Halldórsson
    Approximation Algorithms for the Weighted Independent Set Problem. [Citation Graph (0, 0)][DBLP]
    WG, 2005, pp:341-350 [Conf]
  45. Magnús M. Halldórsson, Ragnar K. Karlsson
    Strip Graphs: Recognition and Scheduling. [Citation Graph (0, 0)][DBLP]
    WG, 2006, pp:137-146 [Conf]
  46. Magnús M. Halldórsson, Jan Kratochvíl, Jan Arne Telle
    Mod-2 Independence and Domination in Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 1999, pp:101-109 [Conf]
  47. Magnús M. Halldórsson, Guy Kortsarz, Hadas Shachnai
    Sum Coloring Interval and k-Claw Free Graphs with Application to Scheduling Dependent Jobs. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2003, v:37, n:3, pp:187-209 [Journal]
  48. Magnús M. Halldórsson, Jaikumar Radhakrishnan
    Greed is Good: Approximating Independent Sets in Sparse and Bounded-Degree Graphs. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1997, v:18, n:1, pp:145-163 [Journal]
  49. Ravi B. Boppana, Magnús M. Halldórsson
    Approximating Maximum Independent Sets by Excluding Subgraphs. [Citation Graph (0, 0)][DBLP]
    BIT, 1992, v:32, n:2, pp:180-196 [Journal]
  50. Magnús M. Halldórsson
    Online Coloring Known Graphs. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2000, v:7, n:, pp:- [Journal]
  51. Geir Agnarsson, Peter Damaschke, Magnús M. Halldórsson
    Powers of geometric intersection graphs and dispersion algorithms. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:132, n:1-3, pp:3-16 [Journal]
  52. Magnús M. Halldórsson, Jan Kratochvíl, Jan Arne Telle
    Independent Sets with Domination Constraints. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2000, v:99, n:1-3, pp:39-54 [Journal]
  53. Amotz Bar-Noy, Mihir Bellare, Magnús M. Halldórsson, Hadas Shachnai, Tami Tamir
    On Chromatic Sums and Distributed Resource Allocation. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1998, v:140, n:2, pp:183-202 [Journal]
  54. Magnús M. Halldórsson, Guy Kortsarz, Andrzej Proskurowski, Ravit Salman, Hadas Shachnai, Jan Arne Telle
    Multicoloring trees. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2003, v:180, n:2, pp:113-129 [Journal]
  55. Magnús M. Halldórsson, Jan Kratochvíl, Jan Arne Telle
    Mod-2 Independence and Domination in Graphs. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2000, v:11, n:3, pp:355-363 [Journal]
  56. Esther M. Arkin, Magnús M. Halldórsson, Refael Hassin
    Approximating the Tree and Tour Covers of a Graph. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1993, v:47, n:6, pp:275-282 [Journal]
  57. Amotz Bar-Noy, Magnús M. Halldórsson, Guy Kortsarz
    A Matched Approximation Bound for the Sum of a Greedy Coloring. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1999, v:71, n:3-4, pp:135-140 [Journal]
  58. Artur Czumaj, Magnús M. Halldórsson, Andrzej Lingas, Johan Nilsson
    Approximation algorithms for optimization problems in graphs with superlogarithmic treewidth. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2005, v:94, n:2, pp:49-53 [Journal]
  59. Magnús M. Halldórsson
    A Still Better Performance Guarantee for Approximate Graph Coloring. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1993, v:45, n:1, pp:19-23 [Journal]
  60. Magnús M. Halldórsson
    Approximating the Minimum Maximal Independence Number. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1993, v:46, n:4, pp:169-172 [Journal]
  61. Amotz Bar-Noy, Magnús M. Halldórsson, Guy Kortsarz, Ravit Salman, Hadas Shachnai
    Sum Multicoloring of Graphs. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2000, v:37, n:2, pp:422-450 [Journal]
  62. Barun Chandra, Magnús M. Halldórsson
    Approximation Algorithms for Dispersion Problems. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2001, v:38, n:2, pp:438-465 [Journal]
  63. Barun Chandra, Magnús M. Halldórsson
    Greedy Local Improvement and Weighted Set Packing Approximation. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2001, v:39, n:2, pp:223-240 [Journal]
  64. Magnús M. Halldórsson
    Parallel and On-Line Graph Coloring. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1997, v:23, n:2, pp:265-280 [Journal]
  65. Magnús M. Halldórsson, Guy Kortsarz
    Tools for Multicoloring with Applications to Planar Graphs and Partial k-Trees. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2002, v:42, n:2, pp:334-366 [Journal]
  66. Magnús M. Halldórsson
    Approximations of Weighted Independent Set and Hereditary Subset Problems. [Citation Graph (0, 0)][DBLP]
    J. Graph Algorithms Appl., 2000, v:4, n:1, pp:- [Journal]
  67. Magnús M. Halldórsson, Hoong Chuin Lau
    Low-degree Graph Partitioning via Local Search with Applications to Constraint Satisfaction, Max Cut, and Coloring. [Citation Graph (0, 0)][DBLP]
    J. Graph Algorithms Appl., 1997, v:1, n:, pp:- [Journal]
  68. Magnús M. Halldórsson, Shuichi Ueno, Hiroshi Nakao, Yoji Kajitani
    Approximating Steiner trees in graphs with restricted weights. [Citation Graph (0, 0)][DBLP]
    Networks, 1998, v:31, n:4, pp:283-292 [Journal]
  69. Magnús M. Halldórsson
    Guest Editor's Foreword. [Citation Graph (0, 0)][DBLP]
    Nord. J. Comput., 2000, v:7, n:3, pp:149-150 [Journal]
  70. Magnús M. Halldórsson, Jaikumar Radhakrishnan
    Improved Approximations of Independent Sets in Bounded-Degree Graphs via Subgraph Removal. [Citation Graph (0, 0)][DBLP]
    Nord. J. Comput., 1994, v:1, n:4, pp:475-492 [Journal]
  71. Reuven Bar-Yehuda, Magnús M. Halldórsson, Joseph Naor, Hadas Shachnai, Irina Shapira
    Scheduling Split Intervals. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2006, v:36, n:1, pp:1-15 [Journal]
  72. Uriel Feige, Magnús M. Halldórsson, Guy Kortsarz, Aravind Srinivasan
    Approximating the Domatic Number. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2002, v:32, n:1, pp:172-195 [Journal]
  73. Geir Agnarsson, Magnús M. Halldórsson
    Coloring Powers of Planar Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2003, v:16, n:4, pp:651-662 [Journal]
  74. Magnús M. Halldórsson, Kazuo Iwano, Naoki Katoh, Takeshi Tokuyama
    Finding Subsets Maximizing Minimum Structures. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1999, v:12, n:3, pp:342-359 [Journal]
  75. Rajiv Gandhi, Magnús M. Halldórsson, Guy Kortsarz, Hadas Shachnai
    Improved results for data migration and open shop scheduling. [Citation Graph (0, 0)][DBLP]
    ACM Transactions on Algorithms, 2006, v:2, n:1, pp:116-129 [Journal]
  76. Tatsuya Akutsu, Magnús M. Halldórsson
    On the approximation of largest common subtrees and largest common point sets. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:233, n:1-2, pp:33-50 [Journal]
  77. Bengt Aspvall, Magnús M. Halldórsson, Fredrik Manne
    Approximations for the general block distribution of a matrix. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:262, n:1, pp:145-160 [Journal]
  78. Magnús M. Halldórsson, Robert W. Irving, Kazuo Iwama, David Manlove, Shuichi Miyazaki, Yasufumi Morita, Sandy Scott
    Approximability results for stable marriage problems with ties. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:306, n:1-3, pp:431-447 [Journal]
  79. Magnús M. Halldórsson, Kazuo Iwama, Shuichi Miyazaki, Shiro Taketomi
    Online independent sets. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:289, n:2, pp:953-962 [Journal]
  80. Magnús M. Halldórsson, Kazuo Iwama, Shuichi Miyazaki, Hiroki Yanagisawa
    Randomized approximation of the stable marriage problem. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:325, n:3, pp:439-465 [Journal]
  81. Magnús M. Halldórsson, Mario Szegedy
    Lower Bounds for On-Line Graph Coloring. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1994, v:130, n:1, pp:163-174 [Journal]
  82. Magnús M. Halldórsson, Christian Knauer, Andreas Spillner, Takeshi Tokuyama
    Fixed-Parameter Tractability for Non-Crossing Spanning Trees. [Citation Graph (0, 0)][DBLP]
    WADS, 2007, pp:410-421 [Conf]
  83. Magnús M. Halldórsson, Elena Losievskaja
    Independent Sets in Bounded-Degree Hypergraphs. [Citation Graph (0, 0)][DBLP]
    WADS, 2007, pp:263-274 [Conf]
  84. Geir Agnarsson, Magnús M. Halldórsson
    Strongly simplicial vertices of powers of trees. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:21, pp:2647-2652 [Journal]
  85. Magnús M. Halldórsson, Kazuo Iwama, Shuichi Miyazaki, Hiroki Yanagisawa
    Improved approximation results for the stable marriage problem. [Citation Graph (0, 0)][DBLP]
    ACM Transactions on Algorithms, 2007, v:3, n:3, pp:- [Journal]

  86. Graphs Capturing Alternations in Words. [Citation Graph (, )][DBLP]


  87. Wireless Scheduling with Power Control. [Citation Graph (, )][DBLP]


  88. "Rent-or-Buy" Scheduling and Cost Coloring Problems. [Citation Graph (, )][DBLP]


  89. SDP-Based Algorithms for Maximum Independent Set Problems on Hypergraphs. [Citation Graph (, )][DBLP]


  90. Wireless Communication Is in APX. [Citation Graph (, )][DBLP]


  91. Streaming Algorithms for Independent Sets. [Citation Graph (, )][DBLP]


  92. Capacity of Arbitrary Wireless Networks. [Citation Graph (, )][DBLP]


  93. Min Sum Edge Coloring in Multigraphs Via Configuration LP. [Citation Graph (, )][DBLP]


  94. Online set packing and competitive scheduling of multi-part tasks. [Citation Graph (, )][DBLP]


  95. Robust cost colorings. [Citation Graph (, )][DBLP]


  96. Batch Coloring Flat Graphs and Thin. [Citation Graph (, )][DBLP]


  97. Online Selection of Intervals and t-Intervals. [Citation Graph (, )][DBLP]


  98. Return of the Boss Problem: Competing Online against a Non-adaptive Adversary. [Citation Graph (, )][DBLP]


  99. Weighted Sum Coloring in Batch Scheduling of Conflicting Jobs. [Citation Graph (, )][DBLP]


  100. Complete partitions of graphs. [Citation Graph (, )][DBLP]


  101. Vertex coloring acyclic digraphs and their corresponding hypergraphs. [Citation Graph (, )][DBLP]


  102. Independent sets in bounded-degree hypergraphs. [Citation Graph (, )][DBLP]


  103. Approximation algorithms for the weighted independent set problem in sparse graphs. [Citation Graph (, )][DBLP]


Search in 5.258secs, Finished in 5.266secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002