#### Filter Results:

- Full text PDF available (30)

#### Publication Year

2010

2018

- This year (4)
- Last 5 years (35)
- Last 10 years (38)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Lukas Barth, Stephen G. Kobourov, Sergey Pupyrev
- SEA
- 2014

We study the problem of computing semantics-preserving word clouds in which semantically related words are close to each other. We implement three earlier algorithms for creating word clouds andâ€¦ (More)

Graph reordering is a powerful technique to increase the locality of the representations of graphs, which can be helpful in several applications. We study how the technique can be used to improveâ€¦ (More)

- Sergey Pupyrev, Lev Nachmanson, Sergey Bereg, Alexander E. Holroyd
- Graph Drawing
- 2011

We propose a new approach to edge bundling. The approach starts by routing the edge paths to minimize a weighted sum of the total length of the paths together with the ink required to draw them. Asâ€¦ (More)

- Stephen G. Kobourov, Sergey Pupyrev, Bahador Saket
- Graph Drawing
- 2014

Abstract. Reducing the number of edge crossings is considered one of the most important graph drawing aesthetics. While real-world graphs tend to be large and dense, most of the earlier work onâ€¦ (More)

- Alon Efrat, Yifan Hu, Stephen G. Kobourov, Sergey Pupyrev
- Graph Drawing
- 2014

We describe MapSets, a method for visualizing embedded and clustered graphs. The proposed method relies on a theoretically sound geometric algorithm which guarantees the contiguity and disjointnessâ€¦ (More)

- Martin Fink, Sergey Pupyrev
- MFCS
- 2013

A problem that arises in drawings of transportation networks is to minimize the number of crossings between different transportation lines. While this can be done efficiently under specificâ€¦ (More)

- Muhammad Jawaherul Alam, David Eppstein, +4 authors Torsten Ueckerdt
- ArXiv
- 2015

We study representations of graphs by contacts of circular arcs, CCA-representations for short, where the vertices are interior-disjoint circular arcs in the plane and each edge is realized by anâ€¦ (More)

- Lukas Barth, Sara Irina Fabrikant, +7 authors Alexander Wolff
- LATIN
- 2014

We study a geometric representation problem, where we are given a set R of axis-aligned rectangles with fixed dimensions and a graph with vertex set R. The task is to place the rectangles withoutâ€¦ (More)

- Sergey Pupyrev, Lev Nachmanson, Michael Kaufmann
- Graph Drawing
- 2010

We show how to improve the Sugiyama scheme by using edge bundling. Our method modifies the layout produced by the Sugiyama scheme by bundling some of the edges together. The bundles are created by aâ€¦ (More)

- Martin Fink, Sergey Pupyrev
- Graph Drawing
- 2013

Crossing minimization is one of the central problems in graph drawing. Recently, there has been an increased interest in the problem of minimizing crossings between paths in drawings of graphs. Thisâ€¦ (More)