H-Index & Metrics Top Publications

H-Index & Metrics

Discipline name H-index Citations Publications World Ranking National Ranking
Computer Science H-index 40 Citations 6,968 210 World Ranking 4505 National Ranking 2249

Overview

What is he best known for?

The fields of study he is best known for:

  • Artificial intelligence
  • Geometry
  • Algorithm

The scientist’s investigation covers issues in Graph drawing, Combinatorics, Theoretical computer science, Planar graph and Visualization. His biological study deals with issues like Distance, which deal with fields such as Path graph and Hypercube graph. His research in Combinatorics intersects with topics in Discrete mathematics and Range tree.

His Theoretical computer science research is multidisciplinary, incorporating elements of Correctness, Embedding, Graph theory and Information visualization. His Planar graph study incorporates themes from Upper and lower bounds, 1-planar graph, Bounded function and Force-directed graph drawing. His Visualization study combines topics in areas such as Relational database, Data science and Source code.

His most cited work include:

  • Identifying important places in people's lives from cellular network data (297 citations)
  • A system for graph-based visualization of the evolution of software (201 citations)
  • GraphAEL: Graph Animations with Evolving Layouts (130 citations)

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

His scientific interests lie mostly in Combinatorics, Planar graph, Discrete mathematics, Graph and Graph drawing. All of his Combinatorics and Book embedding, Outerplanar graph, 1-planar graph, Chordal graph and Vertex investigations are sub-components of the entire Combinatorics study. His research on Planar graph also deals with topics like

  • Planar straight-line graph, which have a strong connection to Graph embedding,
  • Planar which connect with Planarity testing.

His Graph drawing research is multidisciplinary, incorporating perspectives in Algorithm, Theoretical computer science and Force-directed graph drawing. Stephen G. Kobourov has included themes like Software and Graph in his Theoretical computer science study. His biological study spans a wide range of topics, including Information retrieval and Cluster analysis.

He most often published in these fields:

  • Combinatorics (51.27%)
  • Planar graph (30.46%)
  • Discrete mathematics (23.60%)

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

  • Combinatorics (51.27%)
  • Graph (22.08%)
  • Graph drawing (21.57%)

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

Stephen G. Kobourov mainly focuses on Combinatorics, Graph, Graph drawing, Algorithm and Theoretical computer science. He frequently studies issues relating to Spanner and Combinatorics. His Graph study integrates concerns from other disciplines, such as Pattern recognition, Pairwise comparison, Artificial intelligence and Homogeneous space.

Stephen G. Kobourov combines subjects such as Gradient descent, Adjacency matrix and Vertex with his study of Graph drawing. The Theoretical computer science study which covers Computational complexity theory that intersects with Graph. His work in Planar graph addresses issues such as Planarity testing, which are connected to fields such as A* search algorithm and Graph embedding.

Between 2018 and 2021, his most popular works were:

  • Node-Link or Adjacency Matrices: Old Question, New Insights. (18 citations)
  • Graph spanners: A tutorial review (12 citations)
  • A Test of The Risk Perception Attitude Framework as a Message Tailoring Strategy to Promote Diabetes Screening (7 citations)

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

  • Artificial intelligence
  • Geometry
  • Algorithm

His primary areas of investigation include Graph, Combinatorics, Graph drawing, Theoretical computer science and Spanner. As part of one scientific family, Stephen G. Kobourov deals mainly with the area of Graph, narrowing it down to issues related to the Computation, and often Data visualization, Information visualization and Animation. His research related to Time complexity, Approximation algorithm, Stretch factor, Planarity testing and Planar graph might be considered part of Combinatorics.

His Graph drawing study is focused on Visualization in general. The study incorporates disciplines such as Graph, Memorization, Computational complexity theory, Visual analytics and Graph property in addition to Theoretical computer science. His Spanner research also works with subjects such as

  • Shortest path problem which connect with Open problem and Metric space,
  • Additive error that connect with fields like Vertex and Measure.

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

Identifying important places in people's lives from cellular network data

Sibren Isaacman;Richard Becker;Ramón Cáceres;Stephen Kobourov.
international conference on pervasive computing (2011)

437 Citations

A system for graph-based visualization of the evolution of software

Christian Collberg;Stephen Kobourov;Jasvir Nagra;Jacob Pitts.
software visualization (2003)

331 Citations

A multi-dimensional approach to force-directed layouts of large graphs

Pawel Gajer;Michael T. Goodrich;Stephen G. Kobourov.
fall workshop computational geometry (2004)

197 Citations

GraphAEL: Graph Animations with Evolving Layouts

Cesim Erten;Philipp J. Harding;Stephen G. Kobourov;Kevin Wampler.
graph drawing (2003)

193 Citations

Spring Embedders and Force Directed Graph Drawing Algorithms

Stephen G. Kobourov.
arXiv: Computational Geometry (2012)

191 Citations

Force-Directed Drawing Algorithms.

Stephen G. Kobourov.
graph drawing (2013)

190 Citations

GRIP: Graph dRawing with Intelligent Placement

Pawel Gajer;Stephen G. Kobourov.
graph drawing (2000)

173 Citations

Optimal constrained graph exploration

Christian A. Duncan;Stephen G. Kobourov;V. S. Anil Kumar.
ACM Transactions on Algorithms (2006)

153 Citations

Analysis of Network Clustering Algorithms and Cluster Quality Metrics at Scale.

Scott Emmons;Stephen G. Kobourov;Mike Gallant;Katy Börner.
PLOS ONE (2016)

138 Citations

On simultaneous planar graph embeddings

Peter Brass;Eowyn Cenek;Cristian A. Duncan;Alon Efrat.
Computational Geometry: Theory and Applications (2007)

132 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 Stephen G. Kobourov

Michael Kaufmann

Michael Kaufmann

University of Tübingen

Publications: 48

David Eppstein

David Eppstein

University of California, Irvine

Publications: 47

Giuseppe Liotta

Giuseppe Liotta

University of Perugia

Publications: 46

Giuseppe Di Battista

Giuseppe Di Battista

Roma Tre University

Publications: 41

Michael T. Goodrich

Michael T. Goodrich

University of California, Irvine

Publications: 36

Andrzej Pelc

Andrzej Pelc

Université du Québec en Outaouais

Publications: 35

Ulrik Brandes

Ulrik Brandes

ETH Zurich

Publications: 24

Peter Eades

Peter Eades

University of Sydney

Publications: 20

Kwan-Liu Ma

Kwan-Liu Ma

University of California, Davis

Publications: 19

David R. Wood

David R. Wood

Monash University

Publications: 18

Dorothea Wagner

Dorothea Wagner

Karlsruhe Institute of Technology

Publications: 15

Daniel Weiskopf

Daniel Weiskopf

University of Stuttgart

Publications: 15

Helen C. Purchase

Helen C. Purchase

University of Glasgow

Publications: 14

Michael Jünger

Michael Jünger

University of Cologne

Publications: 14

Mark de Berg

Mark de Berg

Eindhoven University of Technology

Publications: 13

Something went wrong. Please try again later.