Scholar
Kanstantsin Pashkovich
Google Scholar ID: _cIeQgYAAAAJ
Assistant Professor, University of Waterloo
Follow
Homepage
↗
Google Scholar
↗
Citations & Impact
All-time
Citations
293
H-index
10
i10-index
11
Publications
20
Co-authors
20
list available
Publications
8 items
Efficient Algorithms for Online Subadditive Combinatorial Allocations
2026
Cited
0
Simple and Almost Non-Adaptive \(\frac{1}{2}\)-Approximation for Matroid Prophet Inequalities
2026
Cited
0
A simple Path-based LP Relaxation for Directed Steiner Tree
2026
Cited
0
Online Algorithm for Fractional Matchings with Edge Arrivals in Graphs of Maximum Degree Three
Workshop on Approximation and Online Algorithms · 2026
Cited
0
Sequential Linear Contracts on Matroids
2026
Cited
0
Multidimensional Budget-Feasible Mechanism Design
2025
Cited
0
An O(log log n)-approximate budget feasible mechanism for subadditive valuations
2025
Cited
0
Normalizations of factorizations over convex cones and their effects on extension complexity
2025
Cited
0
Resume
Research Experience
Research Scientist at Google, 2020-Present. Worked on several projects related to improving search algorithms.
Background
Research interests include machine learning, artificial intelligence, and data science.
Miscellany
Enjoys hiking and playing chess in free time.
Co-authors
12 total
Samuel Fiorini
Université libre de Bruxelles
Laura Sanità
Full Professor, Bocconi University of Milan
Yuri Faenza
Associate Professor, IEOR, Columbia University
gerard cornuejols
Professor of Operations Research
Tony Huynh
IBS Discrete Mathematics Group (DIMAG)
Gwenaël Joret
Université libre de Bruxelles
Stefan Weltge
Professor at Technical University of Munich
R Ravi
Carnegie Mellon Unviersity