D-Index & Metrics Best Publications

D-Index & Metrics D-index (Discipline H-index) only includes papers and citation values for an examined discipline in contrast to General H-index which accounts for publications across all disciplines.

Discipline name D-index D-index (Discipline H-index) only includes papers and citation values for an examined discipline in contrast to General H-index which accounts for publications across all disciplines. Citations Publications World Ranking National Ranking
Computer Science D-index 53 Citations 18,677 206 World Ranking 3113 National Ranking 76

Overview

What is he best known for?

The fields of study he is best known for:

  • Artificial intelligence
  • Statistics
  • Algorithm

Ulrik Brandes spends much of his time researching Theoretical computer science, Graph drawing, Centrality, Network theory and Betweenness centrality. His Theoretical computer science research incorporates elements of Machine learning, Graph, Computation and Graph. His Graph drawing study incorporates themes from Social network analysis, Data visualization and Electronic data interchange.

Betweenness centrality is a component of his Katz centrality and Random walk closeness centrality studies. Ulrik Brandes interconnects Alpha centrality and Network controllability in the investigation of issues within Katz centrality. His biological study spans a wide range of topics, including Binary logarithm, Measure, Girvan–Newman algorithm and Range.

His most cited work include:

  • A faster algorithm for betweenness centrality (2987 citations)
  • On Modularity Clustering (856 citations)
  • On variants of shortest-path betweenness centrality and their generic computation ☆ (560 citations)

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

His primary areas of study are Theoretical computer science, Graph drawing, Combinatorics, Graph and Graph. The Theoretical computer science study combines topics in areas such as Betweenness centrality, Centrality, Graph Layout and Algorithm, Computation. His Betweenness centrality research focuses on Katz centrality and Random walk closeness centrality.

The Graph drawing study which covers Force-directed graph drawing that intersects with Lattice graph. His work focuses on many connections between Combinatorics and other disciplines, such as Discrete mathematics, that overlap with his field of interest in Tree. His research investigates the link between Graph and topics such as Cluster analysis that cross with problems in Graph partition.

He most often published in these fields:

  • Theoretical computer science (22.78%)
  • Graph drawing (20.68%)
  • Combinatorics (16.88%)

What were the highlights of his more recent work (between 2014-2020)?

  • Centrality (9.28%)
  • Algorithm (12.24%)
  • Network science (5.49%)

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

His main research concerns Centrality, Algorithm, Network science, Theoretical computer science and Graph. His Centrality research incorporates themes from Discrete mathematics and Network theory. His biological study deals with issues like Duality, which deal with fields such as Combinatorics.

His Algorithm study combines topics from a wide range of disciplines, such as Space, Embedding, Preprocessor and Aggregate. His Theoretical computer science research is multidisciplinary, relying on both Sampling, Network model, Computation and Subroutine. He has researched Graph in several fields, including Model of computation and Graph.

Between 2014 and 2020, his most popular works were:

  • Maintaining the duality of closeness and betweenness centrality (84 citations)
  • Investigating human geographic origins using dual-isotope (87Sr/86Sr, δ18O) assignment approaches. (47 citations)
  • Quality Metrics for Information Visualization (45 citations)

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

  • Artificial intelligence
  • Statistics
  • Algorithm

The scientist’s investigation covers issues in Centrality, Katz centrality, Betweenness centrality, Network theory and Random walk closeness centrality. His Katz centrality research includes elements of Axiom, Conceptual framework and Correlation. To a larger extent, Ulrik Brandes studies Combinatorics with the aim of understanding Betweenness centrality.

His work carried out in the field of Random walk closeness centrality brings together such families of science as Star, Property, Generalization and Pairwise comparison. His study looks at the intersection of Network controllability and topics like Topology with Theoretical computer science. His Theoretical computer science study integrates concerns from other disciplines, such as Basis, Social network analysis and Graph drawing, Graph embedding, Graph.

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.

Best Publications

A faster algorithm for betweenness centrality

Ulrik Brandes.
Journal of Mathematical Sociology (2001)

5145 Citations

Network Analysis: Methodological Foundations

Ulrik Brandes;Thomas Erlebach.
(2010)

1363 Citations

On Modularity Clustering

U. Brandes;D. Delling;M. Gaertler;R. Gorke.
IEEE Transactions on Knowledge and Data Engineering (2008)

1361 Citations

On variants of shortest-path betweenness centrality and their generic computation ☆

Ulrik Brandes.
Social Networks (2008)

913 Citations

Analysis and Visualization of Social Networks.

Ulrik Brandes;Dorothea Wagner.
graph drawing (2004)

509 Citations

Experiments on Graph Clustering Algorithms

Ulrik Brandes;Marco Gaertler;Dorothea Wagner.
european symposium on algorithms (2003)

459 Citations

Centrality measures based on current flow

Ulrik Brandes;Daniel Fleischer.
symposium on theoretical aspects of computer science (2005)

409 Citations

Centrality Estimation in Large Networks

Ulrik Brandes;Christian Pich.
International Journal of Bifurcation and Chaos (2007)

392 Citations

GraphML Progress Report Structural Layer Proposal

Ulrik Brandes;Markus Eiglsperger;Ivan Herman;Michael Himsolt.
graph drawing (2001)

381 Citations

Efficient generation of large random networks.

Vladimir Batagelj;Ulrik Brandes.
Physical Review E (2005)

312 Citations

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

Contact us

Best Scientists Citing Ulrik Brandes

Stephen G. Kobourov

Stephen G. Kobourov

University of Arizona

Publications: 61

Dorothea Wagner

Dorothea Wagner

Karlsruhe Institute of Technology

Publications: 50

Mason A. Porter

Mason A. Porter

University of California, Los Angeles

Publications: 33

David A. Bader

David A. Bader

New Jersey Institute of Technology

Publications: 31

Daniel Weiskopf

Daniel Weiskopf

University of Stuttgart

Publications: 29

Peter Eades

Peter Eades

University of Sydney

Publications: 27

Kwan-Liu Ma

Kwan-Liu Ma

University of California, Davis

Publications: 24

Alain Barrat

Alain Barrat

Centre de Physique Théorique

Publications: 22

Michael Kaufmann

Michael Kaufmann

University of Tübingen

Publications: 22

Haizhong An

Haizhong An

China University of Geosciences

Publications: 21

Xiangyun Gao

Xiangyun Gao

China University of Geosciences

Publications: 20

Peter J. Mucha

Peter J. Mucha

Dartmouth College

Publications: 20

Michael Burch

Michael Burch

Eindhoven University of Technology

Publications: 19

Giuseppe Liotta

Giuseppe Liotta

University of Perugia

Publications: 19

Michael T. Goodrich

Michael T. Goodrich

University of California, Irvine

Publications: 19

Philip S. Yu

Philip S. Yu

University of Illinois at Chicago

Publications: 19

Trending Scientists

Marco Conti

Marco Conti

Consiglio Nazionale delle Ricerche - CNR

Leonid Sigal

Leonid Sigal

University of British Columbia

Liehuang Zhu

Liehuang Zhu

Beijing Institute of Technology

Damien Trentesaux

Damien Trentesaux

Centre national de la recherche scientifique, CNRS

Laurence R. Rilett

Laurence R. Rilett

University of Nebraska–Lincoln

Bruno Ameduri

Bruno Ameduri

University of Montpellier

Stefan Mecking

Stefan Mecking

University of Konstanz

Wenhan Lin

Wenhan Lin

Peking University

Jan Komdeur

Jan Komdeur

University of Groningen

Andrew A. Amoscato

Andrew A. Amoscato

University of Pittsburgh

David R. Greenwood

David R. Greenwood

Brandon University

Shigeo Uchida

Shigeo Uchida

National Institutes for Quantum and Radiological Science and Technology

Shuk-Mei Ho

Shuk-Mei Ho

University of Arkansas for Medical Sciences

Donna D. Baird

Donna D. Baird

National Institutes of Health

Allan M. Williams

Allan M. Williams

University of Surrey

Something went wrong. Please try again later.