1. Электронный научный архив УрФУ

Browsing by Author Pupyrev, S.

Jump to: 0-9 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
А Б В Г Д Е Ж З И Й К Л М Н О П Р С Т У Ф Х Ц Ч Ш Щ Ъ Ы Ь Э Ю Я
or enter first few letters:  
Showing results 1 to 20 of 23  next >
Issue DateTitleAuthor(s)
2014Are crossings important for drawing large graphs?Kobourov, S. G.; Pupyrev, S.; Saket, B.
2014Balanced circle packings for planar graphsAlam, M. J.; Eppstein, D.; Goodrich, M. T.; Kobourov, S. G.; Pupyrev, S.
2016The bundled crossing numberAlam, M. J.; Fink, M.; Pupyrev, S.
2015Colored non-crossing Euclidean Steiner forestBereg, S.; Fleszar, K.; Kindermann, P.; Pupyrev, S.; Spoerhase, J.; Wolff, A.
2014Computing consensus curvesDe, La, Cruz, L.; Kobourov, S.; Pupyrev, S.; Shen, P. S.; Veeramoni, S.
2015Contact graphs of circular arcsAlam, M. J.; Eppstein, D.; Kaufmann, M.; Kobourov, S. G.; Pupyrev, S.; Schulz, A.; Ueckerdt, T.
2015Contact representations of graphs in 3DAlam, J.; Evans, W.; Kobourov, S.; Pupyrev, S.; Toeniskoetter, J.; Ueckerdt, T.
2013Drawing permutations with few cornersBereg, S.; Holroyd, A. E.; Nachmanson, L.; Pupyrev, S.
2016Edge routing with ordered bundlesPupyrev, S.; Nachmanson, L.; Bereg, S.; Holroyd, A. E.
2014Happy edges: Threshold-coloring of regular latticesAlam, Md. J.; Kobourov, S. G.; Pupyrev, S.; Toeniskoetter, J.
2017Improved Approximation Algorithms for Box Contact RepresentationsBekos, M. A.; van Dijk, T. C.; Fink, M.; Kindermann, P.; Kobourov, S.; Pupyrev, S.; Spoerhase, J.; Wolff, A.
2014Improved approximation algorithms for box contact representationsBekos, M. A.; Van, Dijk, T. C.; Fink, M.; Kindermann, P.; Kobourov, S.; Pupyrev, S.; Spoerhase, J.; Wolff, A.
2011Improving layered graph layouts with edge bundlingPupyrev, S.; Nachmanson, L.; Kaufmann, M.
2015MapSets: Visualizing embedded and clustered graphsEfrat, A.; Hu, Y.; Kobourov, S. G.; Pupyrev, S.
2014MapSets: Visualizing embedded and clustered graphsEfrat, A.; Hu, Y.; Kobourov, S. G.; Pupyrev, S.
2013Metro-line crossing minimization: Hardness, approximations, and tractable casesFink, M.; Pupyrev, S.
2015On embeddability of buses in point setsBruckdorfer, T.; Kaufmann, M.; Kobourov, S. G.; Pupyrev, S.
2015Ordering metro lines by block crossingsFink, M.; Pupyrev, S.; Wolff, A.
2013Ordering metro lines by block crossingsFink, M.; Pupyrev, S.
2014Semantic word cloud representations: Hardness and approximation algorithmsBarth, L.; Fabrikant, S. I.; Kobourov, S. G.; Lubiw, A.; Nöllenburg, M.; Okamoto, Y.; Pupyrev, S.; Squarcella, C.; Ueckerdt, T.; Wolff, A.
Showing results 1 to 20 of 23  next >