Putting Recommendations on the Map -- Visualizing Clusters and Relations (2009)
Gansner, Emden, Hu, Yifan, Kobourov, Stephen, Volinsky, Chris
For users, recommendations can sometimes seem odd or counterintuitive. Visualizing recommendations can remove some of this mystery, showing how a recommendation is grouped with other choices. A...
Error-Correcting Graphs for (2009)
Software Watermarking, Christian Collberg, Stephen Kobourov, Edward Carter, Clark Thomborson
Abstract. In this paper, we discuss graph-theoretic approaches to software watermarking and fingerprinting. Software watermarking is used to discourage intellectual property theft and software...
Constrained Simultaneous and (2008)
Studi Di, Roma Tre, Near-simultaneous Embeddings, Fabrizio Frati, Michael Kaufmann, ...
The research for this paper was done when the first author was visiting the Tübingen university. A geometric simultaneous embedding of two graphs G1 = (V1, E1) and G2 = (V2, E2) with a bijective...
Christian A. Duncan, Alon Efrat, Stephen Kobourov, Carola Wenk
Communicated by Editor’s name Traditionally, graph drawing algorithms represent vertices as circles and edges as curves connecting the vertices. We introduce the problem of drawing with “fat ”...
PEACOCK A Programmer’s Cockpit for Comprehensive Program Comprehension (2008)
Christian S. Collberg, John H. Hartman, Stephen Kobourov
The goal of this project is to use inexpensive but massive computational resources and displays to enhance large program comprehension. B.1 Intellectual Merit Real world programs are large, complex,...
Constrained Simultaneous and Near-Simultaneous Embeddings (2008)
Fabrizio Frati, Michael Kaufmann, Stephen Kobourov
Abstract. A geometric simultaneous embedding of two graphs G1 = (V1, E1) and G2 = (V2, E2) with a bijective mapping of their vertex sets γ: V1 → V2 is a pair of planar straightline drawings Γ1 of...
Visualizing the Behavior of Dynamically Modifiable Code (2008)
Bradley Dux, Anand Iyer, Saumya Debray, David Forrester, Stephen Kobourov
Recent years have seen an increased recognition of some of the advantages offered by dynamically modifiable code, i.e., code that changes during the execution of the program. In its full generality,...
Selected Open Problems in Graph Drawing (2008)
Franz Br, Michael T. Goodrich, Stephen Kobourov, Petra Mutzel
Abstract. In this manuscript, we present several challenging and interesting open problems in graph drawing. The goal of the listing in this paper is to stimulate future research in graph drawing. 1
Borgatti, Stephen, Kobourov, Stephen, Kohlbacher, Oliver, Mutzel, Petra
Graph drawing deals with the problem of communicating the structure of relational data through diagrams, or drawings. The ability to represent relational information in a graphical form is a powerful...
Borgatti, Stephen, Kobourov, Stephen, Kohlbacher, Oliver, Mutzel, Petra
From May 4 to May 9, 2008, the Dagstuhl Seminar 08191 ``Graph Drawing with Applications to Bioinformatics and Social Sciences'' was held in the International Conference and Research Center (IBFI),...
08191 Working Group Report -- Visualization of Trajectories (2008)
Borgatti, Stephen, Brandes, Ulrik, Kaufmann, Michael, Kobourov, Stephen, Lubiw, Anna, Wagner, Dorothea
We considered the following problem: Given a set of vertices V and a set of paths P, where each path is a sequence of vertices, represent these paths somehow. We explored representations in different...
TetraTetris: A Study of Multi-User Touch-Based Interaction Using DiamondTouch (2007)
Christian Collberg, Stephen Kobourov, Steven Kobes, Ben Smith, Stephen Trush, Gary Yee
The DiamondTouch table is a touch-sensitive input device that allows several users to interact with a program at the same time and do so using their hands. We describe our exploration of the...
05191 Executive Summary -- Graph Drawing (2006)
Jünger, Michael, Kobourov, Stephen, Mutzel, Petra
This paper summarizes the topics, aims, and achievements of the Dagstuhl Seminar 05191 on Graph Drawing.
05191 Abstracts Collection -- Graph Drawing (2006)
Jünger, Michael, Mutzel, Petra, Kobourov, Stephen
From 08.05.05 to 13.05.05, the Dagstuhl Seminar 05191 ``Graph Drawing'' was held in the International Conference and Research Center (IBFI), Schloss Dagstuhl. During the seminar, several participants...
Visualizing the behavior of dynamically modifiable code (2005)
Bradley Dux, Anand Iyer, Saumya Debray, David Forrester, Stephen Kobourov
Recent years have seen an increased recognition of some of the advantages offered by dynamically modifiable code, i.e., code that changes during the execution of the program. In its full generality,...
Self-Plagiarism in Computer Science (2005)
Christian Collberg, Stephen Kobourov
We are all too aware of the ravages of scientific misconduct in the academic community. Students submit assignments inherited from their friends who took the course the year before, on-line...
A system for graph-based visualization of the evolution of software (2003)
Christian Collberg, Stephen Kobourov, Jasvir Nagra, Jacob Pitts, Kevin Wampler
We describe Gevol, a system that visualizes the evolution of software using a novel graph drawing technique for visualization of large graphs with a temporal component. Gevol extracts information...
Self-Plagiarism in Computer Science (2003)
Christian Collberg Stephen, Stephen Kobourov, Stephen Ambrose, Pulitzer Prize Winner
this paper is to revive a discussion about a very specific form of scientific misconduct, namely self-plagiarism. Apart from Samuelson's [18] 1994 CACM article about the legal and ethical...
Error-Correcting Graphs for Software Watermarking (2003)
Christian Collberg, Stephen Kobourov, Edward Carter, Clark Thomborson
In this paper, we discuss graph-theoretic approaches to software watermarking and fingerprinting.
A System for Graph-Based Visualization of the Evolution of Software (2003)
Christian Collberg, Stephen Kobourov, Jasvir Nagra, Jacob Pitts, Kevin Wampler
We describe Gevol, a system that visualizes the evolution of software using a novel graph drawing technique for visualization of large graphs with temporal component. Gevol extracts information about...
SPlaT: A System for Self-Plagiarism Detection (2003)
Christian Collberg, Stephen Kobourov, Joshua Louie, Thomas Slattery
This paper presents a system for self-plagiarism detection, SPLAT. The system uses a WebL web spider that crawls through the web sites of the top fifty Computer Science departments, downloading...
A study of selfplagiarism in computer science (2003)
Christian Collberg, Stephen Kobourov, Joshua Louie, Thomas Slattery
We present a web spider that crawls through the web sites of the top fifty Computer Science departments, downloading research papers to search for instances of self-plagiarism by Computer Science...
GRIP: Graph Drawing with Intelligent Placement (2002)
This paper describes a system for Graph dRawing with Intelligent Placement, GRIP. The system is designed for drawing large graphs and uses a novel multi-dimensional force-directed method together...
Balanced Aspect Ratio Trees: Combining the Advantages of (1999)
Trees And Octrees, Christian A. Duncan, Michael T. Goodrich, Stephen Kobourov
Given a set S of n points in IR d , we show, for fixed d, how to construct in O(n log n) time a data structure we call the Balanced Aspect Ratio (BAR) tree. A BAR tree is a binary space partition...
Balanced Aspect Ratio Trees: Combining the Advantages of k-d Trees and Octrees (1999)
Christian A. Duncan, Michael T. Goodrich, Stephen Kobourov
Given a set S of n points in IR d , we show, for fixed d, how to construct in O(n log n) time a data structure we call the Balanced Aspect Ratio (BAR) tree. A BAR tree is a binary space partition...
Balanced Aspect Ratio Trees: Combining the Advantages of k-d Trees and Octrees (1999)
Christian A. Duncan, Michael T. Goodrich, Stephen Kobourov
Given a set S of n points in IR d , we show, for fixed d, how to construct in O(n log n) time a data structure we call the Balanced Aspect Ratio (BAR) tree. A BAR tree is a binary space partition...
Balanced aspect ratio trees: Combining the advantages of k-d trees and octrees (1999)
Christian A. Duncan, Michael T. Goodrich, Stephen Kobourov
Given a set S of n points on � d, we show, for fixed d, how to construct in Onlog Ž n. time a data structure we call the balanced aspect ratio Ž BAR. tree. A BAR tree is a binary space partition...
Polylogarithmic-Overhead Piecemeal Graph Exploration (1998)
Baruch Awerbuch, Stephen Kobourov
We introduce a new traversal technique in the context of piecemeal exploration of unknown graphs. The problem of learning a graph via piecemeal exploration requires a robot to create a complete map...