Repository navigation
Expand file tree
/
Copy pathindex.html
More file actions
executable file
·158 lines (130 loc) · 6.56 KB
/
Copy pathindex.html
File metadata and controls
executable file
·158 lines (130 loc) · 6.56 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"
"http://www.w3.org/TR/html4/loose.dtd">
<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
<head>
<meta charset="utf-8">
<meta name="viewport" content="width=device-width, initial-scale=1, shrink-to-fit=no">
<title>Sergey Pupyrev</title>
<meta name="title" content="Sergey Pupyrev">
<meta name="keywords" content="homepage, algorithms, graph drawing, graph theory, compilers">
<link type="image/ico" rel="shortcut icon" href="static/img/favicon.ico" />
<link href="static/css/bootstrap.css" rel="stylesheet">
<link href="static/css/custom.css" rel="stylesheet">
<script src="static/js/analytics.js"></script>
</head>
<body>
<main role="main" class="container">
<table class="table borderless text-left">
<tbody>
<col width="15%">
<col width="85%">
<tr>
<td><img class="img-about" src="static/img/me2.jpg"></td>
<td>
<h2>Sergey Pupyrev</h2>
<div class="noselect">spupyrev @ gmail</div>
<div style="text-align:left;margin-top:10px">
<span class="field">algorithms</span>
<span class="field">graph theory</span>
<span class="field">compilers</span>
</div>
<div class="btn-group-horizontal btn-group-sm">
<a style="margin-top:10px;margin-right:5px" class="btn btn-primary" href="https://scholar.google.com/citations?hl=en&user=2fwi6UIAAAAJ&sortby=pubdate" target="_blank">Google Scholar Profile</a>
<a style="margin-top:10px;margin-left:5px;margin-right:5px" class="btn btn-primary" href="https://dblp.uni-trier.de/pers/hd/p/Pupyrev:Sergey.html" target="_blank">DBLP Profile</a>
<a style="margin-top:10px;margin-left:5px" class="btn btn-primary" href="https://github.com/spupyrev" target="_blank">GitHub Profile</a>
</div>
</td>
</tr>
</tbody>
</table>
<div class="table-responsive-lg">
<table class="table borderless">
<tbody>
<tr>
<td>
<p class="text-justify">
I am a scientist working on applied research problems. I am interested in combinatorial
optimization, algorithmic graph theory, computational geometry,
and their applications to <b>AI and compilers</b>. My current work focuses on developing algorithmic
solutions for improving the <b>efficiency of AI infrastructure</b> and <b>compiler optimizations</b>.
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.
</p>
<p class="text-justify">
I am particularly excited about linear layouts of graphs, which have applications in
<a href="https://arxiv.org/pdf/1508.03674.pdf">graph drawing</a>,
<a href="https://arxiv.org/pdf/1602.08820.pdf">data compression</a>,
<a href="https://arxiv.org/pdf/1809.04676.pdf">compiler optimization</a>,
<a href="https://arxiv.org/pdf/1707.06665.pdf">distributed computation</a>, and
<a href="https://en.wikipedia.org/wiki/Book_embedding#Applications">many other areas</a>.
</p>
</td>
</tr>
</tbody>
</table>
</div>
<h3>News</h3>
<ul>
<li>
<span class="span-date">September 2025</span> - My paper on recognizing 1-planar with SAT
<span style="color:#E9372B">won the best paper award</span> at
<a href="https://graphdrawing.github.io/gd2025/pages/awards/">GD'25</a>.
Check out <a href="https://github.com/spupyrev/oops">the implementation</a> of the algorithm
</li>
<li>
<span class="span-date">Aug 2025</span> - An extended version of a paper,
<i>The Price of Upwardness</i>, at <a href="https://doi.org/10.46298/dmtcs.15222">DMTCS</a>
</li>
<li>
<span class="span-date">Jan 2025</span> - Two paper accepted at <a href="https://stacs2025.de/">STACS'25</a>:
<i>Forbidden Patterns in Mixed Linear Layouts</i> (<a href="https://arxiv.org/abs/2412.12786">pre-print</a>) and
<i>Transforming Stacks into Queues: Mixed and Separated Layouts of Graphs</i> (<a href="https://arxiv.org/pdf/2409.17776">pre-print</a>)
</li>
<!--li>
<span class="span-date">June 2024</span> - My
<a href="https://github.com/spupyrev/pace2024-bob">submission</a> for the
for the <a href="https://pacechallenge.org/2024/">PACE 2024</a> challenge.
It came third🥉on the exact track, second🥈on the heuristic track,
and got the maximum score on the parameterized track.
Here is a <a href="https://github.com/spupyrev/pace2024-bob/blob/main/docs/pace24bob.pdf">short description</a> of the solver
</li-->
<li>
<span class="span-date">May 2024</span> - A new
<a href="https://dl.acm.org/doi/10.1145/3660635">paper</a> on
<i>Reordering Functions in Mobiles Apps for Reduced Size and Faster Start-Up</i> at ACM TECS
</li>
<li>
<span class="span-date">January 2024</span> - A
<a href="https://arxiv.org/abs/2401.17168">paper</a> on
<i>Stale Profile Matching</i> at Compiler Construction (CC'24)
</li>
<li>
<span class="span-date">December 2023</span> - My first sub-3h marathon at
<a href="https://www.strava.com/activities/10324120460">California International Marathon</a>. Next goal is sub-2:50
</li>
<li>
<span class="span-date">October 2021</span> - A new
<a href="https://research.fb.com/publications/profile-inference-revisited/">paper</a>
<i>Profile Inference Revisited</i> accepted at POPL. Here is <a href="https://youtu.be/y_279m-SLZI">a teaser</a> of the talk
</li>
<li>
<span class="span-date">April 2020</span> - <span style="color:#E9372B">A paper resolving a thirty-year-old
problem on book embeddings:
<a href="https://arxiv.org/abs/2004.07630.pdf">Four Pages Are Indeed Necessary for Planar Graphs</a></span>
</li>
</ul>
<h3>Links</h2>
<ul class="bullets">
<li><a href="linearlayouts.html" target="_blank">A collection of existing results on stack and queue numbers</a></li>
<li><a href="layoutproblems.html" target="_blank">Open problems in linear graph layouts</a></li>
<!--li><a href="http://be.cs.arizona.edu" target="_blank">An online SAT-based solver for stack, queue, and track layouts of graphs</a></li-->
<li><a href="openproblems.html" target="_blank">My favorite open research problems</a></li>
<li><a href="races.html" target="_blank">My running races</a></li>
<!--li><a href="http://wordcloud.cs.arizona.edu" target="_blank">Semantic Word Cloud Visualization</a></li-->
<!--li><a href="http://gmap.cs.arizona.edu" target="_blank">Graph-To-Map Visualization Tool</a></li-->
<!--li><a href="https://github.com/spupyrev" target="_blank">My github account</a></li-->
</ul>
</main>
</body>