Browsing by Subject GRAPHIC METHODS

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 11 of 11
Issue DateTitleAuthor(s)
2014Balanced circle packings for planar graphsAlam, M. J.; Eppstein, D.; Goodrich, M. T.; Kobourov, S. G.; Pupyrev, 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.
2018Fighting with the sparsity of synonymy dictionaries for automatic synset inductionUstalov, D.; Chernoskutov, M.; Biemann, C.; Panchenko, A.
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.
2018Stabbing line segments with disks: Complexity and approximation algorithmsKobylkin, K.
2013Threshold-coloring and unit-cube contact representation of graphsAlam, Md. J.; Chaplick, S.; Fijavž, G.; Kaufmann, M.; Kobourov, S. G.; Pupyrev, S.
2017Threshold-coloring and unit-cube contact representation of planar graphsAlam, M. J.; Chaplick, S.; Fijavž, G.; Kaufmann, M.; Kobourov, S. G.; Pupyrev, S.; Toeniskoetter, J.
2017Watset: Automatic induction of synsets from a graph of synonymsUstalov, D.; Panchenko, A.; Biemann, C.
2016Weak unit disk and interval representation of graphsAlam, M. J.; Kobourov, S. G.; Pupyrev, S.; Toeniskoetter, J.