Sergey Pupyrev

Citace

	Všechny	Od 2020
Citace	1361	847
h-index	20	16
i10-index	35	21

200

100

150

2012201320142015201620172018201920202021202220232024202518 31 28 49 68 71 86 134 133 161 155 187 182 28

Veřejný přístup

Zobrazit všechny

8 článků

0 článků

dostupné

nedostupné

Vychází ze zplnomocnění pro financování

Spoluautoři

Stephen KobourovProfessor of Computer Science, Technical University MunichE-mailová adresa ověřena na: tum.de
Michael KaufmannProfessor of Computer Science, Tübingen UniversityE-mailová adresa ověřena na: uni-tuebingen.de
Muhammad Jawaherul AlamPh.D., Computer Science, University of ArizonaE-mailová adresa ověřena na: cs.arizona.edu
Michael A. BekosAssistant Professor, Department of Mathematics, University of Ioannina, GreeceE-mailová adresa ověřena na: uoi.gr
Torsten UeckerdtKarlsruhe Institute of TechnologyE-mailová adresa ověřena na: kit.edu
Lev NachmansonMicrosoftE-mailová adresa ověřena na: microsoft.com
Martin GronemannNoneE-mailová adresa ověřena na: uni-osnabrueck.de
Sergey BeregAssociate Professor, University of Texas at DallasE-mailová adresa ověřena na: utdallas.edu
Alexander WolffChair for Algorithms and Complexity, Institute of Computer Science, University of WürzburgE-mailová adresa ověřena na: uni-wuerzburg.de
Alon ShalitaE-mailová adresa ověřena na: cs.tau.ac.il
Lukas BarthKarlsruhe Institute of TechnologyE-mailová adresa ověřena na: lukas-barth.net
Jackson ToeniskoetterResearch Assistant, University of ArizonaE-mailová adresa ověřena na: email.arizona.edu
Brian KarrerResearch Science Manager, MetaE-mailová adresa ověřena na: fb.com
Julián MestreSchool of Computer Science, The University of SydneyE-mailová adresa ověřena na: sydney.edu.au
Chrysanthi RaftopoulouPostdoctoral researcher, National Technical University of AthensE-mailová adresa ověřena na: mail.ntua.gr
Martin NöllenburgProfessor, Algorithms and Complexity Group, TU WienE-mailová adresa ověřena na: ac.tuwien.ac.at
David EppsteinDistinguished Professor of Computer Science, University of California, IrvineE-mailová adresa ověřena na: uci.edu
Christian KroerAssociate Professor, Columbia UniversityE-mailová adresa ověřena na: columbia.edu
Philipp KindermannUniversität TrierE-mailová adresa ověřena na: uni-trier.de
Joachim SpoerhaseDepartment of Computer Science, University of Liverpool, UKE-mailová adresa ověřena na: liverpool.ac.uk

Sledovat

Sergey Pupyrev

Applied Research

E-mailová adresa ověřena na: uran.ru - Domovská stránka

algorithms graph theory compilers


Název Seřadit podle citací Seřadit podle roku Seřadit podle názvu	Citace Citace	Rok
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	134	2016
Bandana: Using non-volatile memory for storing deep learning models A Eisenman, M Naumov, D Gardner, M Smelyanskiy, S Pupyrev, ... Proceedings of machine learning and systems 1, 40-52, 2019	100	2019
Experimental Comparison of Semantic Word Clouds L Barth, SG Kobourov, S Pupyrev Symposium on Experimental Algorithms, 247-258, 2014	76	2014
Improving layered graph layouts with edge bundling S Pupyrev, L Nachmanson, M Kaufmann Graph Drawing, 329-340, 2011	76	2011
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	74	2017
Are crossings important for drawing large graphs? SG Kobourov, S Pupyrev, B Saket Graph Drawing: 22nd International Symposium, GD 2014, Würzburg, Germany …, 2014	68	2014
Edge Routing with Ordered Bundles S Pupyrev, L Nachmanson, S Bereg, AE Holroyd Graph Drawing, 136-147, 2012	62	2012
Four pages are indeed necessary for planar graphs MA Bekos, M Kaufmann, F Klute, S Pupyrev, C Raftopoulou, T Ueckerdt Journal of Computational Geometry 11 (1), 332–353, 2020	52	2020
MapSets: Visualizing embedded and clustered graphs A Efrat, Y Hu, SG Kobourov, S Pupyrev Graph Drawing: 22nd International Symposium, GD 2014, Würzburg, Germany …, 2014	45	2014
Queue Layouts of Planar 3-Trees JM Alam, MA Bekos, M Gronemann, M Kaufmann, S Pupyrev Algorithmica, 1-22, 2020	44	2020
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	42	2014
Mixed linear layouts of planar graphs S Pupyrev Graph Drawing and Network Visualization: 25th International Symposium, GD …, 2018	34	2018
Visualizing graphs as maps with contiguous regions SG Kobourov, S Pupyrev, P Simonetto EuroVis14, 31-35, 2014	33	2014
Improved basic block reordering A Newell, S Pupyrev IEEE Transactions on Computers 69 (12), 1784-1794, 2020	28	2020
Matching Algorithms for Blood Donation DC McElfresh, C Kroer, S Pupyrev, E Sodomka, K Sankararaman, ... arXiv preprint arXiv:2108.04862, 2021	26	2021
Contact representations of graphs in 3D J Alam, W Evans, S Kobourov, S Pupyrev, J Toeniskoetter, T Ueckerdt Algorithms and Data Structures: 14th International Symposium, WADS 2015 …, 2015	24	2015
Multi-dimensional balanced graph partitioning via projected gradient descent D Avdiukhin, S Pupyrev, G Yaroslavtsev arXiv preprint arXiv:1902.03522, 2019	23	2019
On dispersable book embeddings JM Alam, MA Bekos, V Dujmović, M Gronemann, M Kaufmann, S Pupyrev Theoretical Computer Science 861, 1-22, 2021	21	2021
Metro-line crossing minimization: Hardness, approximations, and tractable cases M Fink, S Pupyrev International Symposium on Graph Drawing, 328-339, 2013	21	2013
Ordering metro lines by block crossings M Fink, S Pupyrev International Symposium on Mathematical Foundations of Computer Science, 397-408, 2013	21	2013

Systém momentálně nemůže danou operaci provést. Zkuste to znovu později.

Články 1–20

Citace za rok

Duplicitní citace

Sloučené citace

Přidat spoluautorySpoluautoři

Sledovat

Citace

Spoluautoři