![]() |
Sergey Pupyrevspupyrev @ gmail
algorithms
graph theory
compilers
|
|
I am a scientist working on applied research problems. I am interested in combinatorial optimization, algorithmic graph theory, computational geometry, and their applications to AI and compilers. My current work focuses on developing algorithmic solutions for improving the efficiency of AI 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
- November 2026 - A new paper, Tensor Seeks Layout: Formalizing Layout Selection for ML Compilers, accepted at CGO'27 (pre-print)
- November 2026 - A new paper, How to Draw a Planar Graph: An Experimental Evaluation, at GD'26
- November 2026 - Two new papers on queue layouts of planar graphs: Tripod Reordering: A 33-Queue Layout of Planar Graphs (pre-print) and A Gap in the 42-Queue Layout Algorithm for Planar Graphs (pre-print)
- September 2026 - Smallest Cubic Non-1-Planar Graphs (pre-print)
- September 2025 - My paper on recognizing 1-planar with SAT won the best paper award at GD'25. Check out the implementation of the algorithm
- May 2024 - A new paper on Reordering Functions in Mobiles Apps for Reduced Size and Faster Start-Up at ACM TECS
- January 2024 - A paper on Stale Profile Matching at Compiler Construction (CC'24)
- December 2023 - My first sub-3h marathon at California International Marathon. Next goal is sub-2:50
- October 2021 - A new paper Profile Inference Revisited accepted at POPL. Here is a teaser of the talk
- April 2020 - A paper resolving a thirty-year-old problem on book embeddings: Four Pages Are Indeed Necessary for Planar Graphs
