Sergey Pupyrevspupyrev @ gmail
algorithms
graph drawing
graph theory
compilers

I am a scientist working on applied research problems. I am interested in combinatorial optimization, algorithmic graph theory, computational geometry, and information visualization. My current work focuses on developing algorithmic solutions for improving the efficiency of infrastructure and compiler optimizations. Prior to joining industry, I spent several years working on algorithmic graph theory and computational geometry at the University of Arizona (Tucson, USA), Microsoft Research (Redmond, USA), and the Ural State University (Ekaterinburg, Russia), where I received a PhD in Computer Science. I am particularly excited about linear layouts of graphs, which have applications in graph drawing, data compression, compiler optimization, distributed computation, and many other areas. 
News
 June 2024  My submission for the for the PACE 2024 challenge
 May 2024  A new paper on Reordering Functions in Mobiles Apps for Reduced Size and Faster StartUp at ACM TECS
 January 2024  A paper on Stale Profile Matching at Compiler Construction (CC'24)
 December 2023  My first sub3h marathon at California International Marathon. Next goal is sub2:50
 October 2023  A paper on Matching Algorithms for Blood Donation on optimizing blood donations in Nature MI
 July 2023  A paper On Families of Planar DAGs with Constant Stack Number in Graph Drawing'23
 June 2023  A paper on Optimizing Function Layout for Mobile Applications on improving mobile compilers in LCTES'23
 May 2023  A new paper on Robust and Fair Work Allocation in KDD'23
 April 2023  A new paper on Linear Layouts of Bipartite Planar Graphs accepted at WADS'23
 August 2022  A new paper Queue Layouts of TwoDimensional Posets accepted at GD'22
 October 2021  A new paper Profile Inference Revisited accepted at POPL. Here is a teaser of the talk
 April 2020  A paper resolving a thirtyyearold problem on book embeddings: Four Pages Are Indeed Necessary for Planar Graphs