H-Index & Metrics Top Publications
Magnús M. Halldórsson

Magnús M. Halldórsson

H-Index & Metrics

Discipline name H-index Citations Publications World Ranking National Ranking
Computer Science H-index 41 Citations 7,668 168 World Ranking 4326 National Ranking 2

Research.com Recognitions

Awards & Achievements

2020 - European Association for Theoretical Computer Science (EATCS) Fellow For his development of abstract state machines and for outstanding contributions to algebra, logic, game theory, complexity theory and software engineering

Overview

What is he best known for?

The fields of study he is best known for:

  • Algorithm
  • Computer network
  • Combinatorics

His primary areas of investigation include Combinatorics, Approximation algorithm, Independent set, Discrete mathematics and Greedy algorithm. He has included themes like Upper and lower bounds, Scheduling and Special case in his Combinatorics study. His Approximation algorithm research incorporates themes from Time complexity, Graph theory, Stable marriage problem and Degree.

The study incorporates disciplines such as Graph coloring, Set packing and Maximal independent set in addition to Independent set. His biological study spans a wide range of topics, including Clique, Fractional coloring, Split graph and Bipartite graph. In his articles, Magnús M. Halldórsson combines various disciplines, including Discrete mathematics and k-minimum spanning tree.

His most cited work include:

  • Approximating maximum independent sets by excluding subgraphs (281 citations)
  • Approximating maximum independent sets by excluding subgraphs (281 citations)
  • Capacity of Arbitrary Wireless Networks (257 citations)

What are the main themes of his work throughout his whole career to date?

Magnús M. Halldórsson focuses on Combinatorics, Discrete mathematics, Approximation algorithm, Independent set and Wireless network. Combinatorics is a component of his Graph coloring, Greedy coloring, Graph, Vertex and Chordal graph studies. His Discrete mathematics research is multidisciplinary, incorporating perspectives in Distributed algorithm and Degree.

His biological study deals with issues like Greedy algorithm, which deal with fields such as Local search. The Independent set study which covers Maximal independent set that intersects with Combinatorial optimization. He has researched Wireless network in several fields, including Scheduling, Computer network, Distributed computing and Power control.

He most often published in these fields:

  • Combinatorics (50.84%)
  • Discrete mathematics (38.46%)
  • Approximation algorithm (25.08%)

What were the highlights of his more recent work (between 2017-2021)?

  • Combinatorics (50.84%)
  • Distributed algorithm (12.37%)
  • Discrete mathematics (38.46%)

In recent papers he was focusing on the following fields of study:

Magnús M. Halldórsson mainly investigates Combinatorics, Distributed algorithm, Discrete mathematics, Wireless network and Time complexity. Combinatorics is frequently linked to Upper and lower bounds in his study. His studies deal with areas such as Algorithm, Theory of computation and Independent set as well as Distributed algorithm.

His Discrete mathematics research incorporates elements of Online algorithm and Constant. His Wireless network study combines topics from a wide range of disciplines, such as Scheduling, Computer network, Partition and Power control. His Scheduling study integrates concerns from other disciplines, such as Hypergraph, Wireless scheduling, Computation and Approximation algorithm.

Between 2017 and 2021, his most popular works were:

  • Computing large independent sets in a single round (5 citations)
  • Efficient Randomized Distributed Coloring in CONGEST. (4 citations)
  • Simple and Local Independent Set Approximation (4 citations)

In his most recent research, the most cited papers focused on:

  • Algorithm
  • Computer network
  • Combinatorics

Magnús M. Halldórsson mainly focuses on Discrete mathematics, Combinatorics, Time complexity, Distributed algorithm and Power control. Magnús M. Halldórsson studies Randomized algorithm which is a part of Discrete mathematics. His Combinatorics research focuses on Vertex and Binary logarithm.

His Distributed algorithm research includes elements of Independent set and Theory of computation. The Power control study combines topics in areas such as Wireless, Wireless network, Transmission, Computer network and Topology. His work in Deterministic algorithm addresses issues such as Graph, which are connected to fields such as Approximation algorithm.

This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.

Top Publications

Approximating maximum independent sets by excluding subgraphs

Ravi Boppana;Ravi Boppana;Magnús M. Halldórsson;Magnús M. Halldórsson.
Bit Numerical Mathematics (1992)

420 Citations

Greed is good: Approximating independent sets in sparse and bounded-degree graphs

M. M. Halldórsson;J. Radhakrishnan.
Algorithmica (1997)

380 Citations

Capacity of Arbitrary Wireless Networks

O. Goussevskaia;R. Wattenhofer;M. M. Halldorsson;E. Welzl.
international conference on computer communications (2009)

280 Citations

Approximating the Domatic Number

Uriel Feige;Magnús M. Halldórsson;Guy Kortsarz;Aravind Srinivasan.
SIAM Journal on Computing (2003)

244 Citations

Approximating discrete collections via local improvements

Magnús M. Halldórsson.
symposium on discrete algorithms (1995)

206 Citations

Coloring Powers of Planar Graphs

Geir Agnarsson;Magnús M. Halldórsson.
SIAM Journal on Discrete Mathematics (2003)

199 Citations

On chromatic sums and distributed resource allocation

Amotz Bar-Noy;Mihir Bellare;Magnús M. Halldórsson;Hadas Shachnai.
Information & Computation (1998)

199 Citations

Scheduling Split Intervals

R. Bar-Yehuda;M. M. Halldórsson.
SIAM Journal on Computing (2006)

194 Citations

On spectrum sharing games

Magnús M. Halldórsson;Joseph Y. Halpern;Li Erran Li;Vahab S. Mirrokni.
Distributed Computing (2010)

188 Citations

Greedy Local Improvement and Weighted Set Packing Approximation

Barun Chandra;Magnús M Halldórsson.
Journal of Algorithms (2001)

174 Citations

Profile was last updated on December 6th, 2021.
Research.com Ranking is based on data retrieved from the Microsoft Academic Graph (MAG).
The ranking h-index is inferred from publications deemed to belong to the considered discipline.

If you think any of the details on this page are incorrect, let us know.

Contact us

Top Scientists Citing Magnús M. Halldórsson

Uriel Feige

Uriel Feige

Weizmann Institute of Science

Publications: 25

Anders Yeo

Anders Yeo

University of Johannesburg

Publications: 24

Kazuo Iwama

Kazuo Iwama

Kyoto University

Publications: 22

Roger Wattenhofer

Roger Wattenhofer

ETH Zurich

Publications: 21

Francis Chung-Ming Lau

Francis Chung-Ming Lau

Hong Kong Polytechnic University

Publications: 21

Dariusz R. Kowalski

Dariusz R. Kowalski

Augusta University

Publications: 20

Michael A. Henning

Michael A. Henning

University of Johannesburg

Publications: 20

Shuichi Miyazaki

Shuichi Miyazaki

Kyoto University

Publications: 19

Allan Borodin

Allan Borodin

University of Toronto

Publications: 19

David F. Manlove

David F. Manlove

University of Glasgow

Publications: 18

Jiguo Yu

Jiguo Yu

Qilu University of Technology

Publications: 18

Ruth Nussinov

Ruth Nussinov

U.S. Department of Health and Human Services

Publications: 17

Gregory Gutin

Gregory Gutin

Royal Holloway University of London

Publications: 17

Rolf Niedermeier

Rolf Niedermeier

Technical University of Berlin

Publications: 16

Refael Hassin

Refael Hassin

Tel Aviv University

Publications: 16

Something went wrong. Please try again later.