Related Research Articles
John Edward Hopcroft is an American theoretical computer scientist. His textbooks on theory of computation and data structures are regarded as standards in their fields. He is the IBM Professor of Engineering and Applied Mathematics in Computer Science at Cornell University, Co-Director of the Center on Frontiers of Computing Studies at Peking University, and the Director of the John Hopcroft Center for Computer Science at Shanghai Jiao Tong University.
In order theory, a Hasse diagram is a type of mathematical diagram used to represent a finite partially ordered set, in the form of a drawing of its transitive reduction. Concretely, for a partially ordered set one represents each element of as a vertex in the plane and draws a line segment or curve that goes upward from one vertex to another vertex whenever covers . These curves may cross each other but must not touch any vertices other than their endpoints. Such a diagram, with labeled vertices, uniquely determines its partial order.
In computer science, a graph is an abstract data type that is meant to implement the undirected graph and directed graph concepts from the field of graph theory within mathematics.
Professor Sartaj Kumar Sahni is a computer scientist based in the United States, and is one of the pioneers in the field of data structures. He is a distinguished professor in the Department of Computer and Information Science and Engineering at the University of Florida.
David Arthur Eppstein is an American computer scientist and mathematician. He is a Distinguished Professor of computer science at the University of California, Irvine. He is known for his work in computational geometry, graph algorithms, and recreational mathematics. In 2011, he was named an ACM Fellow.
Franco P. Preparata is a computer scientist, the An Wang Professor, Emeritus, of Computer Science at Brown University.
Edward M. Reingold is a computer scientist active in the fields of algorithms, data structures, graph drawing, and calendrical calculations.
A program structure tree (PST) is a hierarchical diagram that displays the nesting relationship of single-entry single-exit (SESE) fragments/regions, showing the organization of a computer program. Nodes in this tree represent SESE regions of the program, while edges represent nesting regions. The PST is defined for all control flow graphs.
In graph theory, the planarity testing problem is the algorithmic problem of testing whether a given graph is a planar graph (that is, whether it can be drawn in the plane without edge intersections). This is a well-studied problem in computer science for which many practical algorithms have emerged, many taking advantage of novel data structures. Most of these methods operate in O(n) time (linear time), where n is the number of edges (or vertices) in the graph, which is asymptotically optimal. Rather than just being a single Boolean value, the output of a planarity testing algorithm may be a planar graph embedding, if the graph is planar, or an obstacle to planarity such as a Kuratowski subgraph if it is not.
Layered graph drawing or hierarchical graph drawing is a type of graph drawing in which the vertices of a directed graph are drawn in horizontal rows or layers with the edges generally directed downwards. It is also known as Sugiyama-style graph drawing after Kozo Sugiyama, who first developed this drawing style.
In computer science, the Brodal queue is a heap/priority queue structure with very low worst case time bounds: for insertion, find-minimum, meld and decrease-key and for delete-minimum and general deletion. They are the first heap variant to achieve these bounds without resorting to amortization of operational costs. Brodal queues are named after their inventor Gerth Stølting Brodal.
In graph drawing, the angular resolution of a drawing of a graph is the sharpest angle formed by any two edges that meet at a common vertex of the drawing.
Peter D. Eades is an Australian computer scientist, an emeritus professor in the School of Information Technologies at the University of Sydney, known for his expertise in graph drawing.
In combinatorial mathematics and theoretical computer science, heavy path decomposition is a technique for decomposing a rooted tree into a set of paths. In a heavy path decomposition, each non-leaf node selects one "heavy edge", the edge to the child that has the greatest number of descendants. The selected edges form the paths of the decomposition.
Anna Lubiw is a computer scientist known for her work in computational geometry and graph theory. She is currently a professor at the University of Waterloo.
In graph drawing, the area used by a drawing is a commonly used way of measuring its quality.
Mohammad Taghi Hajiaghayi is a computer scientist known for his work in algorithms, game theory, social networks, network design, graph theory, and big data. He has over 200 publications with over 185 collaborators and 10 issued patents.
Giuseppe Francesco (Pino) Italiano is an Italian computer scientist. He is a professor of computer science at LUISS University in Rome. He is known for his work in graph algorithms, data structures and algorithm engineering.
Daniel Mier Gusfield is an American computer scientist, Distinguished Professor of Computer Science at the University of California, Davis. Gusfield is known for his research in combinatorial optimization and computational biology.
Isabel Cruz was an American Portuguese computer scientist known for her research on databases, knowledge representation, geographic information systems, AI, visual languages, graph drawing, user interfaces, multimedia, information retrieval, and security. She was a University of Illinois Chicago Distinguished Professor and a Professor Computer Science in the College of Engineering at the University of Illinois Chicago. She was a Fellow of the American Association for the Advancement of Science.
References
- 1 2 3 4 5 Curriculum vitae from Tamassia's web site, retrieved 2009-07-16.
- ↑ TCS Genealogy, ACM SIGACT.
- ↑ Profs. Preparata and Tamassia Among Most Highly Cited Computer Scientists, Brown Univ. Computer Science Dept., February 19, 2007.
- ↑ Journal of Graph Algorithms and Applications web site.
- ↑ Ward, Bob (2008), "Computer Society Connection", IEEE Computer, 41 (2): 82–87, doi:10.1109/MC.2008.45 .
- ↑ Roberto Tamassia Named IEEE Fellow, Brown Univ. Computer Science Dept., December 12, 2008.
- ↑ "Introducing the new class of fellows", The Institute, March 2009.
- ↑ ACM Fellows Named for Computing Innovations that Advance Technologies in Information Age Archived 2012-12-12 at the Wayback Machine , ACM, December 11, 2012.
- ↑ "AAAS Members Elected as Fellows", Science , 338 (6111): 1168–1171, November 30, 2012, doi:10.1126/science.338.6111.1166 .
- ↑ Tamassia, Roberto, Isabel Cruz , retrieved 2023-05-25
