Improving Layered Graph Layouts with Edge Bundling. - Sergey Pupyrev; Lev Nachmanson; Michael Kaufmann 001 (GD, 2010)

Analyzing conversations with dynamic graph visualization. - Sergey Pupyrev; Alexey Tikhonov (ISDA, 2010)

Drawing Permutations with Few Corners. - Sergey Bereg; Alexander E. Holroyd; Lev Nachmanson; Sergey Pupyrev (GD, 2013)

Metro-Line Crossing Minimization: Hardness, Approximations, and Tractable Cases. - Martin Fink 001; Sergey Pupyrev (GD, 2013)

Ordering Metro Lines by Block Crossings. - Martin Fink 001; Sergey Pupyrev (MFCS, 2013)

Threshold-Coloring and Unit-Cube Contact Representation of Graphs. - Md. Jawaherul Alam; Steven Chaplick; Gasper Fijavz; Michael Kaufmann 001; Stephen G. Kobourov; Sergey Pupyrev (WG, 2013)

Threshold-Coloring of Archimedean and Laves Lattices. - Md. Jawaherul Alam; Stephen G. Kobourov; Sergey Pupyrev; Jackson Toeniskoetter (CoRR, 2013)

Threshold Coloring and Unit-Cube Contact Representation of Graphs - Md. Jawaherul Alam; Gasper Fijavz; Michael Kaufmann 001; Stephen G. Kobourov; Sergey Pupyrev (CoRR, 2013)

On Semantic Word Cloud Representation - Lukas Barth; Stephen G. Kobourov; Sergey Pupyrev; Torsten Ueckerdt (CoRR, 2013)

Happy Edges: Threshold-Coloring of Regular Lattices. - Md. Jawaherul Alam; Stephen G. Kobourov; Sergey Pupyrev; Jackson Toeniskoetter (FUN, 2014)

Balanced Circle Packings for Planar Graphs. - Md. Jawaherul Alam; David Eppstein; Michael T. Goodrich; Stephen G. Kobourov; Sergey Pupyrev (GD, 2014)

Are Crossings Important for Drawing Large Graphs? - Stephen G. Kobourov; Sergey Pupyrev; Bahador Saket (GD, 2014)

3D proportional contact representations of graphs. - Md. Jawaherul Alam; Stephen G. Kobourov; Giuseppe Liotta; Sergey Pupyrev; Sankar Veeramoni (IISA, 2014)

Perfect smooth orthogonal drawings. - Michael A. Bekos; Martin Gronemann; Sergey Pupyrev; Chrysanthi N. Raftopoulou (IISA, 2014)

Semantic Word Cloud Representations: Hardness and Approximation Algorithms. - Lukas Barth; Sara Irina Fabrikant; Stephen G. Kobourov; Anna Lubiw; Martin Nöllenburg; Yoshio Okamoto; Sergey Pupyrev; Claudio Squarcella; Torsten Ueckerdt; Alexander Wolff 001 (LATIN, 2014)

Visualizing Graphs as Maps with Contiguous Regions. - Stephen G. Kobourov; Sergey Pupyrev; Paolo Simonetto (EuroVis (Short Papers), 2014)

Experimental Comparison of Semantic Word Clouds. - Lukas Barth; Stephen G. Kobourov; Sergey Pupyrev (SEA, 2014)

Computing Consensus Curves. - Livio De La Cruz; Stephen G. Kobourov; Sergey Pupyrev; Paul S. Shen; Sankar Veeramoni (SEA, 2014)

Weak Unit Disk and Interval Representation of Planar Graphs. - Md. Jawaherul Alam; Stephen G. Kobourov; Sergey Pupyrev; Jackson Toeniskoetter (CoRR, 2014)

On Embeddability of Buses in Point Sets. - Till Bruckdorfer; Michael Kaufmann 001; Stephen G. Kobourov; Sergey Pupyrev (GD, 2015)

Colored Non-crossing Euclidean Steiner Forest. - Sergey Bereg; Krzysztof Fleszar 001; Philipp Kindermann; Sergey Pupyrev; Joachim Spoerhase; Alexander Wolff 001 (ISAAC, 2015)

Contact Graphs of Circular Arcs. - Md. Jawaherul Alam; David Eppstein; Michael Kaufmann 001; Stephen G. Kobourov; Sergey Pupyrev; André Schulz 001; Torsten Ueckerdt (WADS, 2015)

Contact Representations of Graphs in 3D. - Md. Jawaherul Alam; William S. Evans; Stephen G. Kobourov; Sergey Pupyrev; Jackson Toeniskoetter; Torsten Ueckerdt (WADS, 2015)

Weak Unit Disk and Interval Representation of Graphs. - Md. Jawaherul Alam; Stephen G. Kobourov; Sergey Pupyrev; Jackson Toeniskoetter (WG, 2015)

Contact Representations of Sparse Planar Graphs. - Md. Jawaherul Alam; David Eppstein; Michael Kaufmann 001; Stephen G. Kobourov; Sergey Pupyrev; André Schulz 001; Torsten Ueckerdt (CoRR, 2015)

Primal-Dual Representations of Planar Graphs and L-Contact Representations of Optimal 1-Planar Graphs. - Md. Jawaherul Alam; William S. Evans; Stephen G. Kobourov; Sergey Pupyrev; Jackson Toeniskoetter; Torsten Ueckerdt (CoRR, 2015)

MapSets: Visualizing Embedded and Clustered Graphs. - Alon Efrat; Yifan Hu 001; Stephen G. Kobourov; Sergey Pupyrev (J. Graph Algorithms Appl., 2015)

Ordering Metro Lines by Block Crossings. - Martin Fink 001; Sergey Pupyrev; Alexander Wolff 001 (J. Graph Algorithms Appl., 2015)

The Bundled Crossing Number. - Md. Jawaherul Alam; Martin Fink 001; Sergey Pupyrev (GD, 2016)

Compressing Graphs and Indexes with Recursive Graph Bisection. - Laxman Dhulipala; Igor Kabiljo; Brian Karrer; Giuseppe Ottaviano; Sergey Pupyrev; Alon Shalita (KDD, 2016)

Edge routing with ordered bundles. - Sergey Pupyrev; Lev Nachmanson; Sergey Bereg; Alexander E. Holroyd (Comput. Geom., 2016)

Representing Permutations with Few Moves. - Sergey Bereg; Alexander E. Holroyd; Lev Nachmanson; Sergey Pupyrev (SIAM J. Discret. Math., 2016)

Mixed Linear Layouts of Planar Graphs. - Sergey Pupyrev (GD, 2017)

Improved Approximation Algorithms for Box Contact Representations. - Michael A. Bekos; Thomas C. van Dijk; Martin Fink 001; Philipp Kindermann; Stephen G. Kobourov; Sergey Pupyrev; Joachim Spoerhase; Alexander Wolff 001 (Algorithmica, 2017)

Threshold-coloring and unit-cube contact representation of planar graphs. - Md. Jawaherul Alam; Steven Chaplick; Gasper Fijavz; Michael Kaufmann 001; Stephen G. Kobourov; Sergey Pupyrev; Jackson Toeniskoetter (Discret. Appl. Math., 2017)

Social Hash Partitioner: A Scalable Distributed Hypergraph Partitioner. - Igor Kabiljo; Brian Karrer; Mayank Pundir; Sergey Pupyrev; Alon Shalita; Yaroslav Akhremtsev; Alessandro Presta (Proc. VLDB Endow., 2017)

On Dispersable Book Embeddings. - Jawaherul Md. Alam; Michael A. Bekos; Martin Gronemann; Michael Kaufmann 001; Sergey Pupyrev (WG, 2018)

Queue Layouts of Planar 3-Trees. - Michael A. Bekos; Martin Gronemann; Michael Kaufmann 001; Sergey Pupyrev (CoRR, 2018)

Bandana: Using Non-Volatile Memory for Storing Deep Learning Models. - Assaf Eisenman; Maxim Naumov; Darryl Gardner; Misha Smelyanskiy; Sergey Pupyrev; Kim M. Hazelwood; Asaf Cidon; Sachin Katti (SysML, 2019)

Multi-Dimensional Balanced Graph Partitioning via Projected Gradient Descent. - Dmitrii Avdiukhin; Sergey Pupyrev; Grigory Yaroslavtsev (Proc. VLDB Endow., 2019)

The Turing Test for Graph Drawing Algorithms. - Helen C. Purchase; Daniel Archambault; Stephen G. Kobourov; Martin Nöllenburg; Sergey Pupyrev; Hsiang-Yun Wu (GD, 2020)

Queue Layouts of Planar 3-Trees. - Jawaherul Md. Alam; Michael A. Bekos; Martin Gronemann; Michael Kaufmann 001; Sergey Pupyrev (Algorithmica, 2020)

Book Embeddings of Graph Products. - Sergey Pupyrev (CoRR, 2020)

Improved Bounds for Track Numbers of Planar Graphs. - Sergey Pupyrev (J. Graph Algorithms Appl., 2020)

Four Pages Are Indeed Necessary for Planar Graphs. - Michael A. Bekos; Michael Kaufmann 001; Fabian Klute; Sergey Pupyrev; Chrysanthi N. Raftopoulou; Torsten Ueckerdt (J. Comput. Geom., 2020)

Improved Basic Block Reordering. - Andy Newell; Sergey Pupyrev (IEEE Trans. Computers, 2020)

On the Extended TSP Problem. - Julián Mestre; Sergey Pupyrev; Seeun William Umboh (ISAAC, 2021)

Using the Metro-Map Metaphor for Drawing Hypergraphs. - Fabian Frank; Michael Kaufmann 001; Stephen G. Kobourov; Tamara Mchedlidze; Sergey Pupyrev; Torsten Ueckerdt; Alexander Wolff 001 (SOFSEM, 2021)

On dispersable book embeddings. - Muhammad Jawaherul Alam; Michael A. Bekos; Vida Dujmovic; Martin Gronemann; Michael Kaufmann 001; Sergey Pupyrev (Theor. Comput. Sci., 2021)

Queue Layouts of Two-Dimensional Posets. - Sergey Pupyrev (GD, 2022)

Approximating the Minimum Logarithmic Arrangement Problem. - Julián Mestre; Sergey Pupyrev (ISAAC, 2022)

Robust and fair work allocation. - Amine Allouah; Christian Kroer; Xuan Zhang; Vashist Avadhanula; Anil Dania; Caner Gocmen; Sergey Pupyrev; Parikshit Shah; Nicolás Stier Moses (CoRR, 2022)

Minimum Coverage Instrumentation. - Li Chen 028; Ellis Hoag; Kyungwoo Lee; Julián Mestre; Sergey Pupyrev (CoRR, 2022)

Profile inference revisited. - Wenlei He; Julián Mestre; Sergey Pupyrev; Lei Wang; Hongtao Yu (Proc. ACM Program. Lang., 2022)

The mixed page number of graphs. - Jawaherul Md. Alam; Michael A. Bekos; Martin Gronemann; Michael Kaufmann 001; Sergey Pupyrev (Theor. Comput. Sci., 2022)

On Families of Planar DAGs with Constant Stack Number. - Martin Nöllenburg; Sergey Pupyrev (GD (1), 2023)

Fair Allocation Over Time, with Applications to Content Moderation. - Amine Allouah; Christian Kroer; Xuan Zhang; Vashist Avadhanula; Nona Bohanon; Anil Dania; Caner Gocmen; Sergey Pupyrev; Parikshit Shah; Nicolás Stier Moses; Ken Rodríguez Taarup (KDD, 2023)

Optimizing Function Layout for Mobile Applications. - Ellis Hoag; Kyungwoo Lee; Julián Mestre; Sergey Pupyrev (LCTES, 2023)

Linear Layouts of Bipartite Planar Graphs. - Henry Förster; Michael Kaufmann 001; Laura Merker; Sergey Pupyrev; Chrysanthi N. Raftopoulou (WADS, 2023)

Lazy Queue Layouts of Posets. - Jawaherul Md. Alam; Michael A. Bekos; Martin Gronemann; Michael Kaufmann 001; Sergey Pupyrev (Algorithmica, 2023)

Matching algorithms for blood donation. - Duncan C. McElfresh; Christian Kroer; Sergey Pupyrev; Eric Sodomka; Karthik Abinav Sankararaman; Zack Chauvin; Neil Dexter; John P. Dickerson (Nat. Mac. Intell., 2023)

Stale Profile Matching. - Amir Ayupov; Maksim Panchenko; Sergey Pupyrev (CC, 2024)

The Price of Upwardness. - Patrizio Angelini; Therese Biedl; Markus Chimani; Sabine Cornelsen; Giordano Da Lozzo; Seok-Hee Hong 001; Giuseppe Liotta; Maurizio Patrignani; Sergey Pupyrev; Ignaz Rutter; Alexander Wolff 001 (GD, 2024)

Reordering Functions in Mobiles Apps for Reduced Size and Faster Start-Up. - Ellis Hoag; Kyungwoo Lee; Julián Mestre; Sergey Pupyrev; Yongkang Zhu (ACM Trans. Embed. Comput. Syst., 2024)

Forbidden Patterns in Mixed Linear Layouts. - Deborah Haun; Laura Merker; Sergey Pupyrev (STACS, 2025)

Transforming Stacks into Queues: Mixed and Separated Layouts of Graphs. - Julia Katheder; Michael Kaufmann 001; Sergey Pupyrev; Torsten Ueckerdt (STACS, 2025)

The Price of Upwardness. - Patrizio Angelini; Therese Biedl; Markus Chimani; Sabine Cornelsen; Giordano Da Lozzo; Seok-Hee Hong 001; Giuseppe Liotta; Maurizio Patrignani; Sergey Pupyrev; Ignaz Rutter (Discret. Math. Theor. Comput. Sci., 2025)