Sergey Pupyrev
Sergey Pupyrev
Dirección de correo verificada de - Página principal
Citado por
Citado por
Improving layered graph layouts with edge bundling
S Pupyrev, L Nachmanson, M Kaufmann
Graph Drawing, 329-340, 2011
Edge Routing with Ordered Bundles
S Pupyrev, L Nachmanson, S Bereg, AE Holroyd
Graph Drawing, 136-147, 2012
Experimental Comparison of Semantic Word Clouds
L Barth, SG Kobourov, S Pupyrev
Symposium on Experimental Algorithms, 247-258, 2014
Compressing graphs and indexes with recursive graph bisection
L Dhulipala, I Kabiljo, B Karrer, G Ottaviano, S Pupyrev, A Shalita
Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge …, 2016
Are crossings important for drawing large graphs?
SG Kobourov, S Pupyrev, B Saket
International Symposium on Graph Drawing, 234-245, 2014
Social hash partitioner: a scalable distributed hypergraph partitioner
I Kabiljo, B Karrer, M Pundir, S Pupyrev, A Shalita, A Presta, Y Akhremtsev
arXiv preprint arXiv:1707.06665, 2017
Semantic word cloud representations: Hardness and approximation algorithms
L Barth, SI Fabrikant, SG Kobourov, A Lubiw, M Nöllenburg, Y Okamoto, ...
Latin American Symposium on Theoretical Informatics, 514-525, 2014
Visualizing graphs as maps with contiguous regions
SG Kobourov, S Pupyrev, P Simonetto
EuroVis14, 31-35, 2014
Visualizing a layered graph using edge bundling
LB Nachmanson, S Pupyrev
US Patent 8,933,937, 2015
Bandana: Using non-volatile memory for storing deep learning models
A Eisenman, M Naumov, D Gardner, M Smelyanskiy, S Pupyrev, ...
arXiv preprint arXiv:1811.05922, 2018
Contact representations of graphs in 3D
J Alam, W Evans, S Kobourov, S Pupyrev, J Toeniskoetter, T Ueckerdt
Workshop on Algorithms and Data Structures, 14-27, 2015
Balanced circle packings for planar graphs
MJ Alam, D Eppstein, MT Goodrich, SG Kobourov, S Pupyrev
International Symposium on Graph Drawing, 125-136, 2014
MapSets: visualizing embedded and clustered graphs
A Efrat, Y Hu, SG Kobourov, S Pupyrev
International Symposium on Graph Drawing, 452-463, 2014
Metro-line crossing minimization: Hardness, approximations, and tractable cases
M Fink, S Pupyrev
International Symposium on Graph Drawing, 328-339, 2013
Queue Layouts of Planar 3-Trees
JM Alam, MA Bekos, M Gronemann, M Kaufmann, S Pupyrev
Algorithmica, 1-22, 2020
Drawing permutations with few corners
S Bereg, AE Holroyd, L Nachmanson, S Pupyrev
International Symposium on Graph Drawing, 484-495, 2013
Analyzing conversations with dynamic graph visualization
S Pupyrev, A Tikhonov
2010 10th International Conference on Intelligent Systems Design and …, 2010
Routing edges with ordered bundles
LB Nachmanson, S Pupyrev, S Bereg, AE Holroyd
US Patent 9,443,334, 2016
Edge routing with ordered bundles
S Pupyrev, L Nachmanson, S Bereg, AE Holroyd
Computational Geometry 52, 18-33, 2016
Colored non-crossing Euclidean Steiner forest
S Bereg, K Fleszar, P Kindermann, S Pupyrev, J Spoerhase, A Wolff
International Symposium on Algorithms and Computation, 429-441, 2015
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20