Stop the war!Остановите войну!
for scientists:
Google
Google Scholar
Semantic Scholar
IA Scholar
CiteSeerX
ORCIDSergey Pupyrev
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j14]Wenlei He, Julián Mestre, Sergey Pupyrev, Lei Wang, Hongtao Yu:
Profile inference revisited. Proc. ACM Program. Lang. 6(POPL): 1-24 (2022)- [i34]Amine Allouah, Christian Kroer, Xuan Zhang, Vashist Avadhanula, Anil Dania, Caner Gocmen, Sergey Pupyrev, Parikshit Shah, Nicolás Stier Moses:
Robust and fair work allocation. CoRR abs/2202.05194 (2022) - 2021
- [j13]Muhammad Jawaherul Alam, Michael A. Bekos, Vida Dujmovic, Martin Gronemann, Michael Kaufmann, Sergey Pupyrev:
On dispersable book embeddings. Theor. Comput. Sci. 861: 1-22 (2021) - [c34]Julián Mestre, Sergey Pupyrev, Seeun William Umboh
:
On the Extended TSP Problem. ISAAC 2021: 42:1-42:14 - [c33]Fabian Frank, Michael Kaufmann, Stephen G. Kobourov, Tamara Mchedlidze, Sergey Pupyrev, Torsten Ueckerdt, Alexander Wolff:
Using the Metro-Map Metaphor for Drawing Hypergraphs. SOFSEM 2021: 361-372 - [i33]Jawaherul Md. Alam, Michael A. Bekos, Martin Gronemann, Michael Kaufmann, Sergey Pupyrev:
The Mixed Page Number of Graphs. CoRR abs/2107.04993 (2021) - [i32]Julián Mestre, Sergey Pupyrev, Seeun William Umboh:
On the Extended TSP Problem. CoRR abs/2107.07815 (2021) - [i31]Martin Nöllenburg, Sergey Pupyrev:
On Families of Planar DAGs with Constant Stack Number. CoRR abs/2107.13658 (2021) - [i30]Duncan C. McElfresh, Christian Kroer, Sergey Pupyrev, Eric Sodomka, Karthik Abinav Sankararaman, Zack Chauvin, Neil Dexter, John P. Dickerson:
Matching Algorithms for Blood Donation. CoRR abs/2108.04862 (2021) - 2020
- [j12]Jawaherul Md. Alam, Michael A. Bekos, Martin Gronemann, Michael Kaufmann, Sergey Pupyrev:
Queue Layouts of Planar 3-Trees. Algorithmica 82(9): 2564-2585 (2020) - [j11]Sergey Pupyrev:
Improved Bounds for Track Numbers of Planar Graphs. J. Graph Algorithms Appl. 24(3): 323-341 (2020) - [j10]Michael A. Bekos, Michael Kaufmann, Fabian Klute, Sergey Pupyrev, Chrysanthi N. Raftopoulou, Torsten Ueckerdt:
Four Pages Are Indeed Necessary for Planar Graphs. J. Comput. Geom. 11(1): 332-353 (2020) - [j9]Andy Newell, Sergey Pupyrev:
Improved Basic Block Reordering. IEEE Trans. Computers 69(12): 1784-1794 (2020) - [c32]Jawaherul Md. Alam, Michael A. Bekos, Martin Gronemann, Michael Kaufmann, Sergey Pupyrev:
Lazy Queue Layouts of Posets. Graph Drawing 2020: 55-68 - [c31]Helen C. Purchase, Daniel Archambault, Stephen G. Kobourov, Martin Nöllenburg, Sergey Pupyrev, Hsiang-Yun Wu:
The Turing Test for Graph Drawing Algorithms. Graph Drawing 2020: 466-481 - [c30]Duncan C. McElfresh, Christian Kroer, Sergey Pupyrev, Eric Sodomka, Karthik Abinav Sankararaman, Zack Chauvin, Neil Dexter, John P. Dickerson:
Matching Algorithms for Blood Donation. EC 2020: 463-464 - [i29]Michael A. Bekos, Michael Kaufmann, Fabian Klute, Sergey Pupyrev, Chrysanthi N. Raftopoulou, Torsten Ueckerdt:
Four Pages Are Indeed Necessary for Planar Graphs. CoRR abs/2004.07630 (2020) - [i28]Sergey Pupyrev:
Book Embeddings of Graph Products. CoRR abs/2007.15102 (2020) - [i27]Helen C. Purchase, Daniel Archambault, Stephen G. Kobourov, Martin Nöllenburg, Sergey Pupyrev, Hsiang-Yun Wu:
The Turing Test for Graph Drawing Algorithms. CoRR abs/2008.04869 (2020) - [i26]Jawaherul Md. Alam, Michael A. Bekos, Martin Gronemann, Michael Kaufmann, Sergey Pupyrev:
Lazy Queue Layouts of Posets. CoRR abs/2008.10336 (2020)
2010 – 2019
- 2019
- [j8]Dmitrii Avdiukhin, Sergey Pupyrev, Grigory Yaroslavtsev:
Multi-Dimensional Balanced Graph Partitioning via Projected Gradient Descent. Proc. VLDB Endow. 12(8): 906-919 (2019) - [c29]Assaf Eisenman, Maxim Naumov, Darryl Gardner, Misha Smelyanskiy, Sergey Pupyrev, Kim M. Hazelwood, Asaf Cidon, Sachin Katti:
Bandana: Using Non-Volatile Memory for Storing Deep Learning Models. MLSys 2019 - [i25]Dmitrii Avdiukhin, Sergey Pupyrev, Grigory Yaroslavtsev:
Multi-Dimensional Balanced Graph Partitioning via Projected Gradient Descent. CoRR abs/1902.03522 (2019) - [i24]Sergey Pupyrev:
Improved Bounds for Track Numbers of Planar Graphs. CoRR abs/1910.14153 (2019) - 2018
- [c28]Jawaherul Md. Alam, Michael A. Bekos, Martin Gronemann, Michael Kaufmann, Sergey Pupyrev:
Queue Layouts of Planar 3-Trees. Graph Drawing 2018: 213-226 - [c27]Jawaherul Md. Alam, Michael A. Bekos, Martin Gronemann, Michael Kaufmann, Sergey Pupyrev:
On Dispersable Book Embeddings. WG 2018: 1-14 - [i23]Jawaherul Md. Alam, Michael A. Bekos, Martin Gronemann, Michael Kaufmann, Sergey Pupyrev:
On Dispersable Book Embeddings. CoRR abs/1803.10030 (2018) - [i22]Michael A. Bekos, Martin Gronemann, Michael Kaufmann, Sergey Pupyrev:
Queue Layouts of Planar 3-Trees. CoRR abs/1808.10841 (2018) - [i21]Andy Newell, Sergey Pupyrev:
Improved Basic Block Reordering. CoRR abs/1809.04676 (2018) - [i20]Assaf Eisenman, Maxim Naumov, Darryl Gardner, Misha Smelyanskiy, Sergey Pupyrev, Kim M. Hazelwood, Asaf Cidon, Sachin Katti:
Bandana: Using Non-volatile Memory for Storing Deep Learning Models. CoRR abs/1811.05922 (2018) - 2017
- [j7]Michael A. Bekos, Thomas C. van Dijk, Martin Fink, Philipp Kindermann, Stephen G. Kobourov, Sergey Pupyrev, Joachim Spoerhase, Alexander Wolff:
Improved Approximation Algorithms for Box Contact Representations. Algorithmica 77(3): 902-920 (2017) - [j6]Md. Jawaherul Alam, Steven Chaplick, Gasper Fijavz, Michael Kaufmann, Stephen G. Kobourov, Sergey Pupyrev, Jackson Toeniskoetter:
Threshold-coloring and unit-cube contact representation of planar graphs. Discret. Appl. Math. 216: 2-14 (2017) - [j5]Igor Kabiljo, Brian Karrer, Mayank Pundir, Sergey Pupyrev, Alon Shalita, Yaroslav Akhremtsev, Alessandro Presta:
Social Hash Partitioner: A Scalable Distributed Hypergraph Partitioner. Proc. VLDB Endow. 10(11): 1418-1429 (2017) - [c26]Sergey Pupyrev:
Mixed Linear Layouts of Planar Graphs. Graph Drawing 2017: 197-209 - [i19]Igor Kabiljo, Brian Karrer, Mayank Pundir, Sergey Pupyrev, Alon Shalita, Alessandro Presta, Yaroslav Akhremtsev:
Social Hash Partitioner: A Scalable Distributed Hypergraph Partitioner. CoRR abs/1707.06665 (2017) - [i18]Sergey Pupyrev:
Mixed Linear Layouts of Planar Graphs. CoRR abs/1709.00285 (2017) - 2016
- [j4]Sergey Pupyrev, Lev Nachmanson, Sergey Bereg, Alexander E. Holroyd:
Edge routing with ordered bundles. Comput. Geom. 52: 18-33 (2016) - [j3]Sergey Bereg, Alexander E. Holroyd, Lev Nachmanson, Sergey Pupyrev:
Representing Permutations with Few Moves. SIAM J. Discret. Math. 30(4): 1950-1977 (2016) - [c25]Md. Jawaherul Alam, Martin Fink, Sergey Pupyrev:
The Bundled Crossing Number. Graph Drawing 2016: 399-412 - [c24]Laxman Dhulipala, Igor Kabiljo, Brian Karrer, Giuseppe Ottaviano, Sergey Pupyrev, Alon Shalita:
Compressing Graphs and Indexes with Recursive Graph Bisection. KDD 2016: 1535-1544 - [i17]Laxman Dhulipala, Igor Kabiljo, Brian Karrer, Giuseppe Ottaviano, Sergey Pupyrev, Alon Shalita:
Compressing Graphs and Indexes with Recursive Graph Bisection. CoRR abs/1602.08820 (2016) - [i16]Md. Jawaherul Alam, Martin Fink, Sergey Pupyrev:
The Bundled Crossing Number. CoRR abs/1608.08161 (2016) - 2015
- [j2]Martin Fink, Sergey Pupyrev, Alexander Wolff:
Ordering Metro Lines by Block Crossings. J. Graph Algorithms Appl. 19(1): 111-153 (2015) - [j1]Alon Efrat, Yifan Hu, Stephen G. Kobourov, Sergey Pupyrev:
MapSets: Visualizing Embedded and Clustered Graphs. J. Graph Algorithms Appl. 19(2): 571-593 (2015) - [c23]Till Bruckdorfer, Michael Kaufmann, Stephen G. Kobourov, Sergey Pupyrev:
On Embeddability of Buses in Point Sets. Graph Drawing 2015: 395-408 - [c22]Sergey Bereg, Krzysztof Fleszar, Philipp Kindermann, Sergey Pupyrev, Joachim Spoerhase, Alexander Wolff:
Colored Non-crossing Euclidean Steiner Forest. ISAAC 2015: 429-441 - [c21]Md. Jawaherul Alam, David Eppstein, Michael Kaufmann, Stephen G. Kobourov, Sergey Pupyrev, André Schulz, Torsten Ueckerdt:
Contact Graphs of Circular Arcs. WADS 2015: 1-13 - [c20]Md. Jawaherul Alam, William S. Evans, Stephen G. Kobourov, Sergey Pupyrev, Jackson Toeniskoetter, Torsten Ueckerdt:
Contact Representations of Graphs in 3D. WADS 2015: 14-27 - [c19]Md. Jawaherul Alam, Stephen G. Kobourov, Sergey Pupyrev, Jackson Toeniskoetter:
Weak Unit Disk and Interval Representation of Graphs. WG 2015: 237-251 - [i15]Md. Jawaherul Alam, William S. Evans, Stephen G. Kobourov, Sergey Pupyrev, Jackson Toeniskoetter, Torsten Ueckerdt:
Primal-Dual Representations of Planar Graphs and L-Contact Representations of Optimal 1-Planar Graphs. CoRR abs/1501.00304 (2015) - [i14]Md. Jawaherul Alam, David Eppstein, Michael Kaufmann, Stephen G. Kobourov, Sergey Pupyrev, André Schulz, Torsten Ueckerdt:
Contact Representations of Sparse Planar Graphs. CoRR abs/1501.00318 (2015) - [i13]Till Bruckdorfer, Michael Kaufmann, Stephen G. Kobourov, Sergey Pupyrev:
On Embeddability of Buses in Point Sets. CoRR abs/1508.06760 (2015) - [i12]Sergey Bereg, Krzysztof Fleszar, Philipp Kindermann, Sergey Pupyrev, Joachim Spoerhase, Alexander Wolff:
Colored Non-Crossing Euclidean Steiner Forest. CoRR abs/1509.05681 (2015) - 2014
- [c18]Michael A. Bekos, Thomas C. van Dijk, Martin Fink, Philipp Kindermann, Stephen G. Kobourov, Sergey Pupyrev, Joachim Spoerhase, Alexander Wolff:
Improved Approximation Algorithms for Box Contact Representations. ESA 2014: 87-99 - [c17]Md. Jawaherul Alam, Stephen G. Kobourov, Sergey Pupyrev, Jackson Toeniskoetter:
Happy Edges: Threshold-Coloring of Regular Lattices. FUN 2014: 28-39 - [c16]Md. Jawaherul Alam, David Eppstein, Michael T. Goodrich, Stephen G. Kobourov, Sergey Pupyrev:
Balanced Circle Packings for Planar Graphs. Graph Drawing 2014: 125-136 - [c15]Stephen G. Kobourov, Sergey Pupyrev, Bahador Saket:
Are Crossings Important for Drawing Large Graphs? Graph Drawing 2014: 234-245 - [c14]Alon Efrat, Yifan Hu, Stephen G. Kobourov, Sergey Pupyrev:
MapSets: Visualizing Embedded and Clustered Graphs. Graph Drawing 2014: 452-463 - [c13]Md. Jawaherul Alam, Stephen G. Kobourov, Giuseppe Liotta, Sergey Pupyrev, Sankar Veeramoni:
3D proportional contact representations of graphs. IISA 2014: 27-32 - [c12]Michael A. Bekos, Martin Gronemann, Sergey Pupyrev, Chrysanthi N. Raftopoulou:
Perfect smooth orthogonal drawings. IISA 2014: 76-81 - [c11]Lukas Barth, Sara Irina Fabrikant, Stephen G. Kobourov, Anna Lubiw, Martin Nöllenburg, Yoshio Okamoto, Sergey Pupyrev, Claudio Squarcella, Torsten Ueckerdt, Alexander Wolff:
Semantic Word Cloud Representations: Hardness and Approximation Algorithms. LATIN 2014: 514-525 - [c10]Stephen G. Kobourov, Sergey Pupyrev, Paolo Simonetto:
Visualizing Graphs as Maps with Contiguous Regions. EuroVis (Short Papers) 2014 - [c9]Livio De La Cruz, Stephen G. Kobourov, Sergey Pupyrev, Paul S. Shen, Sankar Veeramoni:
Computing Consensus Curves. SEA 2014: 223-234 - [c8]Lukas Barth, Stephen G. Kobourov, Sergey Pupyrev:
Experimental Comparison of Semantic Word Clouds. SEA 2014: 247-258 - [i11]Michael A. Bekos, Thomas C. van Dijk, Martin Fink, Philipp Kindermann, Stephen G. Kobourov, Sergey Pupyrev, Joachim Spoerhase, Alexander Wolff:
Improved Approximation Algorithms for Box Contact Representations. CoRR abs/1403.4861 (2014) - [i10]Md. Jawaherul Alam, David Eppstein, Michael T. Goodrich, Stephen G. Kobourov, Sergey Pupyrev:
Balanced Circle Packings for Planar Graphs. CoRR abs/1408.4902 (2014) - [i9]Md. Jawaherul Alam, Stephen G. Kobourov, Sergey Pupyrev, Jackson Toeniskoetter:
Weak Unit Disk and Interval Representation of Planar Graphs. CoRR abs/1408.6928 (2014) - 2013
- [c7]Martin Fink, Sergey Pupyrev:
Metro-Line Crossing Minimization: Hardness, Approximations, and Tractable Cases. Graph Drawing 2013: 328-339 - [c6]Sergey Bereg, Alexander E. Holroyd, Lev Nachmanson, Sergey Pupyrev:
Drawing Permutations with Few Corners. Graph Drawing 2013: 484-495 - [c5]Martin Fink, Sergey Pupyrev:
Ordering Metro Lines by Block Crossings. MFCS 2013: 397-408 - [c4]Md. Jawaherul Alam, Steven Chaplick, Gasper Fijavz, Michael Kaufmann, Stephen G. Kobourov, Sergey Pupyrev:
Threshold-Coloring and Unit-Cube Contact Representation of Graphs. WG 2013: 26-37 - [i8]Md. Jawaherul Alam, Gasper Fijavz, Michael Kaufmann, Stephen G. Kobourov, Sergey Pupyrev:
Threshold Coloring and Unit-Cube Contact Representation of Graphs. CoRR abs/1302.6183 (2013) - [i7]Lukas Barth, Stephen G. Kobourov, Sergey Pupyrev, Torsten Ueckerdt:
On Semantic Word Cloud Representation. CoRR abs/1304.8016 (2013) - [i6]Martin Fink, Sergey Pupyrev:
Ordering Metro Lines by Block Crossings. CoRR abs/1305.0069 (2013) - [i5]Md. Jawaherul Alam, Stephen G. Kobourov, Sergey Pupyrev, Jackson Toeniskoetter:
Threshold-Coloring of Archimedean and Laves Lattices. CoRR abs/1306.2053 (2013) - [i4]Martin Fink, Sergey Pupyrev:
Metro-Line Crossing Minimization: Hardness, Approximations, and Tractable Cases. CoRR abs/1306.2079 (2013) - [i3]Sergey Bereg, Alexander E. Holroyd, Lev Nachmanson, Sergey Pupyrev:
Drawing Permutations with Few Corners. CoRR abs/1306.4048 (2013) - [i2]Lukas Barth, Sara Irina Fabrikant, Stephen G. Kobourov, Anna Lubiw, Martin Nöllenburg, Yoshio Okamoto, Sergey Pupyrev, Claudio Squarcella, Torsten Ueckerdt, Alexander Wolff:
Semantic Word Cloud Representations: Hardness and Approximation Algorithms. CoRR abs/1311.4778 (2013) - 2012
- [i1]Sergey Bereg, Alexander E. Holroyd, Lev Nachmanson, Sergey Pupyrev:
Edge Routing with Ordered Bundles. CoRR abs/1209.4227 (2012) - 2011
- [c3]Sergey Pupyrev, Lev Nachmanson, Sergey Bereg, Alexander E. Holroyd:
Edge Routing with Ordered Bundles. Graph Drawing 2011: 136-147 - 2010
- [c2]Sergey Pupyrev, Lev Nachmanson, Michael Kaufmann:
Improving Layered Graph Layouts with Edge Bundling. Graph Drawing 2010: 329-340 - [c1]Sergey Pupyrev, Alexey Tikhonov:
Analyzing conversations with dynamic graph visualization. ISDA 2010: 748-753
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
load content from web.archive.org
Privacy notice: By enabling the option above, your browser will contact the API of web.archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
Tweets on dblp homepage
Show tweets from 
on the dblp homepage.
Privacy notice: By enabling the option above, your browser will contact twitter.com and twimg.com to load tweets curated by our Twitter account. At the same time, Twitter will persistently store several cookies with your web browser. While we did signal Twitter to not track our users by setting the "dnt" flag, we do not have any control over how Twitter uses your data. So please proceed with care and consider checking the Twitter privacy policy.
last updated on 2022-06-25 01:16 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp has been originally created in 1993 at:
since 2018, dblp is operated and maintained by:
the dblp computer science bibliography is funded and supported by:
