- Home
- Search Results
- Page 1 of 1
Search for: All records
-
Total Resources3
- Resource Type
-
30000
- Availability
-
30
- Author / Contributor
- Filter by Author / Creator
-
-
Kobourov, S. (3)
-
Kryven, M. (3)
-
Ahmed, R. (1)
-
Bekos, M. (1)
-
Forster, H. (1)
-
Goessmann, I. (1)
-
Kaufmann, M. (1)
-
Klawitter, J. (1)
-
Klemz, B. (1)
-
Klesen, F. (1)
-
Kuckuk, A. (1)
-
Schlipf, L. (1)
-
Wolff, A. (1)
-
Zink, J. (1)
-
#Tyler Phillips, Kenneth E. (0)
-
#Willis, Ciara (0)
-
& Abreu-Ramos, E. D. (0)
-
& Abramson, C. I. (0)
-
& Adams, S.G. (0)
-
& Ahmed, K. (0)
-
- Filter by Editor
-
-
& Spizer, S. M. (0)
-
& . Spizer, S. (0)
-
& Ahn, J. (0)
-
& Bateiha, S. (0)
-
& Bosch, N. (0)
-
& Brennan K. (0)
-
& Brennan, K. (0)
-
& Chen, B. (0)
-
& Chen, Bodong (0)
-
& Drown, S. (0)
-
& Ferretti, F. (0)
-
& Higgins, A. (0)
-
& J. Peters (0)
-
& Kali, Y. (0)
-
& Ruiz-Arias, P.M. (0)
-
& S. Spitzer (0)
-
& Spitzer, S. (0)
-
& Spitzer, S.M. (0)
-
(submitted - in Review for IEEE ICASSP-2024) (0)
-
- (0)
-
-
Have feedback or suggestions for a way to improve these results?
!
Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher.
Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?
Some links on this page may take you to non-federal websites. Their policies may differ from this site.
-
When interacting with a visualization of a bipartite graph, one of the most common tasks requires identifying the neighbors of a given vertex. In interactive visualizations, selecting a vertex of interest usually highlights the edges to its neighbors while hiding/shading the rest of the graph. If the graph is large, the highlighted subgraph may not fit in the display window. This motivates a natural optimization task: find an arrangement of the vertices along two layers that reduces the size of the window needed to see a selected vertex and all its neighbors. We consider two variants of the problem; for one we present an efficient algorithm, while for the other we show NP-hardness and give a 2-approximation.more » « less
-
Ahmed, R. ; Kobourov, S. ; Kryven, M. ( , 30th International Symposium on Graph Drawing and Network Visualization (GD))
-
Goessmann, I. ; Klawitter, J. ; Klemz, B. ; Klesen, F. ; Kobourov, S. ; Kryven, M. ; Wolff, A. ; Zink, J. ( , 48th International Workshop on Graph-Theoretic Concepts in Computer Science (WG))