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 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
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.
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.
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
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.
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)
A system for graph-based visualization of the evolution of software
Christian Collberg;Stephen Kobourov;Jasvir Nagra;Jacob Pitts.
software visualization (2003)
Spring Embedders and Force Directed Graph Drawing Algorithms
Stephen G. Kobourov.
arXiv: Computational Geometry (2012)
GraphAEL: Graph Animations with Evolving Layouts
Cesim Erten;Philipp J. Harding;Stephen G. Kobourov;Kevin Wampler.
graph drawing (2003)
A multi-dimensional approach to force-directed layouts of large graphs
Pawel Gajer;Michael T. Goodrich;Stephen G. Kobourov.
fall workshop computational geometry (2004)
Analysis of Network Clustering Algorithms and Cluster Quality Metrics at Scale.
Scott Emmons;Stephen G. Kobourov;Mike Gallant;Katy Börner.
PLOS ONE (2016)
GRIP: Graph dRawing with Intelligent Placement
Pawel Gajer;Stephen G. Kobourov.
graph drawing (2000)
Force-Directed Drawing Algorithms.
Stephen G. Kobourov.
graph drawing (2013)
Optimal constrained graph exploration
Christian A. Duncan;Stephen G. Kobourov;V. S. Anil Kumar.
ACM Transactions on Algorithms (2006)
On simultaneous planar graph embeddings
Peter Brass;Eowyn Cenek;Cristian A. Duncan;Alon Efrat.
Computational Geometry: Theory and Applications (2007)
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below: