Shortest Tour of a Sequence of Disjoint Segments in L1 (2008)
Esther Arkin, Alon Efrat, Cesim Erten, Ferran Hurtado, Joseph Mitchell
Abstract Given a sequence s1,..., sK of K disjoint segments in the plane, a start point s and a target point t, we seek a path, that starts at s, visits in order each of the segments, and ends at t,...
Crossing Minimization in Weighted Bipartite Graphs ⋆ (2008)
Olca A. Çakıro¯glu, Cesim Erten, Melih Sözdinler
Abstract. Given a bipartite graph G = (L0, L1, E) and a fixed ordering of the nodes in L0, the problem of finding an ordering of the nodes in L1 that minimizes the number of crossings has received...
algorithms with sensor localization and robot motion planning applications, Adjunct Lecturer, Computer Science Department-University of Arizona 2001-2004 Research Assistant, Research on algorithms...
A force-directed approach to sensor localization (2008)
Alon Efrat, David Forrester, Stephen G. Kobourov, Cesim Erten
We consider the centralized, anchor-free sensor localization problem. We consider the case where the sensor network reports range information and the case where in addition to the range, we also have...
Colored Simultaneous Geometric Embeddings (2007)
Brandes, Ulrik, Erten, Cesim, Fowler, J. Joseph, Frati, Fabrizio, Geyer, Markus, Gutwenger, Carsten, ...
We introduce the concept of colored simultaneous geometric embeddings as a generalization of simultaneous graph embeddings with and without mapping. We show that there exists a universal pointset of...
GraphAEL: Graph Animations with Evolving Layouts (2004)
Erten, Cesim, Harding, Philipp J., Kobourov, Stephen G., Wampler, Kevin, Yee, Gary V.
GraphAEL extracts three types of evolving graphs from the Graph Drawing literature and creates 2D and 3D animations of the evolutions. We study citation graphs, topic graphs, and collaboration...
Fixed-Location Circular-Arc Drawing of Planar Graphs (2004)
Efrat, Alon, Erten, Cesim, Kobourov, Stephen G.
In this paper we consider the problem of drawing a planar graph using circular-arcs as edges, given a one-to-one mapping between the vertices of the graph and a set of n points on the plane, where n...
Intersection-Free Morphing of Planar Graphs (2004)
Erten, Cesim, Kobourov, Stephen G., Pitta, Chandan
Given two different drawings of a planar graph we consider the problem of morphing one drawing into the other. We designed and implemented an algorithm for intersection-free morphing of planar...
Simultaneous Graph Drawing: Layout Algorithms and Visualization Schemes (2004)
Erten, Cesim, Kobourov, Stephen G., Le, Vu, Navabi, Armand
In this paper we consider the problem of drawing and displaying a series of related graphs, i.e., graphs that share all, or parts of the same vertex set. We designed and implemented three different...
Simultaneous Embedding of Planar Graphs with Few Bends (2004)
Erten, Cesim, Kobourov, Stephen G.
We present an O(n) time algorithm for simultaneous embedding of pairs of planar graphs on the O(n^2)× O(n^2) grid, with at most three bends per edge, where n is the number of vertices. For the case...
GraphAEL: Graph Animations with Evolving Layouts (2004)
Erten, Cesim, Harding, Philipp J., Kobourov, Stephen G., Wampler, Kevin, Yee, Gary V.
GraphAEL extracts three types of evolving graphs from the Graph Drawing literature and creates 2D and 3D animations of the evolutions. We study citation graphs, topic graphs, and collaboration...
Fixed-Location Circular-Arc Drawing of Planar Graphs (2004)
Efrat, Alon, Erten, Cesim, Kobourov, Stephen G.
In this paper we consider the problem of drawing a planar graph using circular-arcs as edges, given a one-to-one mapping between the vertices of the graph and a set of n points on the plane, where n...
Intersection-Free Morphing of Planar Graphs (2004)
Erten, Cesim, Kobourov, Stephen G., Pitta, Chandan
Given two different drawings of a planar graph we consider the problem of morphing one drawing into the other. We designed and implemented an algorithm for intersection-free morphing of planar...
Simultaneous Graph Drawing: Layout Algorithms and Visualization Schemes (2004)
Erten, Cesim, Kobourov, Stephen G., Le, Vu, Navabi, Armand
In this paper we consider the problem of drawing and displaying a series of related graphs, i.e., graphs that share all, or parts of the same vertex set. We designed and implemented three different...
Simultaneous Embedding of Planar Graphs with Few Bends (2004)
Erten, Cesim, Kobourov, Stephen G.
We present an O(n) time algorithm for simultaneous embedding of pairs of planar graphs on the O(n^2)× O(n^2) grid, with at most three bends per edge, where n is the number of vertices. For the case...
GraphAEL: Graph Animations with Evolving Layouts (2004)
Erten, Cesim, Harding, Philipp J., Kobourov, Stephen G., Wampler, Kevin, Yee, Gary V.
GraphAEL extracts three types of evolving graphs from the Graph Drawing literature and creates 2D and 3D animations of the evolutions. We study citation graphs, topic graphs, and collaboration...
Fixed-Location Circular-Arc Drawing of Planar Graphs (2004)
Efrat, Alon, Erten, Cesim, Kobourov, Stephen G.
In this paper we consider the problem of drawing a planar graph using circular-arcs as edges, given a one-to-one mapping between the vertices of the graph and a set of n points on the plane, where n...
Intersection-Free Morphing of Planar Graphs (2004)
Erten, Cesim, Kobourov, Stephen G., Pitta, Chandan
Given two different drawings of a planar graph we consider the problem of morphing one drawing into the other. We designed and implemented an algorithm for intersection-free morphing of planar...
Simultaneous Graph Drawing: Layout Algorithms and Visualization Schemes (2004)
Erten, Cesim, Kobourov, Stephen G., Le, Vu, Navabi, Armand
In this paper we consider the problem of drawing and displaying a series of related graphs, i.e., graphs that share all, or parts of the same vertex set. We designed and implemented three different...
Simultaneous Embedding of Planar Graphs with Few Bends (2004)
Erten, Cesim, Kobourov, Stephen G.
We present an O(n) time algorithm for simultaneous embedding of pairs of planar graphs on the O(n^2)× O(n^2) grid, with at most three bends per edge, where n is the number of vertices. For the case...
Simultaneous embedding of planar graphs with few bends (2004)
Cesim Erten, Stephen G. Kobourov
We consider several variations of the simultaneous embedding problem for planar graphs. We begin with a simple proof that not all pairs of planar graphs have simultaneous geometric embedding....
Simultaneous embedding of planar graphs with few bends (2004)
Cesim Erten, Stephen G Kobourov
Abstract. We present an O(n) time algorithm for simultaneous embedding of pairs of planar graphs on the O(n 2)×O(n 2) grid, with at most three bends per edge, where n is the number of vertices. For...
Simultaneous embedding of planar graphs with few bends (2004)
Cesim Erten, Stephen G. Kobourov
We consider several variations of the simultaneous embedding problem for planar graphs. We begin with a simple proof that not all pairs of planar graphs have simultaneous geometric embeddings....
Intersection-free morphing of planar graphs (2003)
Cesim Erten, Stephen G. Kobourov, An Pitta
Abstract. Given two different drawings of a planar graph we consider the problem of morphing one drawing into the other. We designed and implemented an algorithm for intersection-free morphing of...
Fixed-location circular-arc drawing of planar graphs (2003)
Alon Efrat, Cesim Erten, Stephen G. Kobourov
Abstract. In this paper we consider the problem of drawing a planar graph using circular-arcs as edges and given a one-to-one mapping between the vertices of the graph and a set of n points on the...
Fixed-location circular-arc drawing of planar graphs (2003)
Alon Efrat, Cesim Erten, Stephen G. Kobourov
In this paper we consider the problem of drawing a planar graph using circular arcs as edges, given a one-to-one mapping between the vertices of the graph and a set of points in the plane. If for...
Simultaneous Embedding of a Planar Graph and Its Dual on the Grid (2002)
Cesim Erten, Stephen G. Kobourov
Traditional representations of graphs and their duals suggest the requirement that the dual vertices should be placed inside their corresponding primal faces, and the edges of the dual graph should...
Simultaneous embedding of a planar graph and its dual on the grid (2002)
Cesim Erten, Stephen G. Kobourov
Abstract. Traditional representations of graphs and their duals suggest the requirement that the dual vertices should be placed inside their corresponding primal faces, and the edges of the dual...