Denis Pankratov

ScholarGPS® ID: 22238868563435

Affiliation

Concordia University, Montréal, Canada

Affiliation History

Field

Engineering and Computer Science

Discipline

Computer Science

Top Specialties

Food Coloring

Metrics Summary

Publication Count

Predicted Citations

199

Predicted h-index

Ranking

Publications and Citation History

Publications based on Top Specialties

Types of Publication

Publications
Books
Patents
NIH/NSF

Add Delete
Exploration of High-Dimensional Grids by Finite State Machines (journal article) Dobrev, Stefan \| Narayanan, Lata \| Opatrny, Jaroslav \| Pankratov, Denis Algorithmica, volume 86, issue 5, pages 1700-1729 (2024). 10.1007/s00453-024-01207-6 Cite \| Source
Advice complexity of adaptive priority algorithms (journal article) Boyar, Joan \| Larsen, Kim S. \| Pankratov, Denis Theoretical Computer Science, volume 984 (2024). 10.1016/j.tcs.2023.114318 Cite \| Source
Renting Servers in the Cloud: Parameterized Analysis of FirstFit (conference) Masoori, Mahtab \| Narayanan, Lata \| Pankratov, Denis ICDCN '24: International Conference on Distributed Computing and Networking (2024) Chennai India 10.1145/3631461.3631557 Cite \| Source
Online vector bin packing and hypergraph coloring illuminated: simpler proofs and new connections (journal article) Li, Yaqiao \| Pankratov, Denis Procedia Computer Science, volume 223 (2023). 10.1016/j.procs.2023.08.215 Cite \| Source
Random \( \Theta (\log n) \) -CNFs are Hard for Cutting Planes (journal article) Fleming, Noah \| Pankratov, Denis \| Pitassi, Toniann \| Robere, Robert Journal of the ACM, volume 69, issue 3, pages 1-32 (2022). 10.1145/3486680 Cited by (1) \| Cite \| Source
Online Coloring and a New Type of Adversary for Online Graph Problems (journal article) Li, Yaqiao \| Narayan, Vishnu V. \| Pankratov, Denis Algorithmica, volume 84, issue 5, pages 1232-1251 (2022). 10.1007/s00453-021-00920-w Cite \| Source
Renting Servers in the Cloud: The Case of Equal Duration Jobs (journal article) Masoori, Mahtab \| Narayanan, Lata \| Pankratov, Denis SSRN Electronic Journal (2022). 10.2139/ssrn.4172664 Cite \| Source
The Bike Sharing Problem (book chapter) In WALCOM: Algorithms and Computation Czyzowicz, Jurek \| Georgiou, Konstantinos \| Killick, Ryan \| Kranakis, Evangelos \| Krizanc, Danny \| Narayanan, Lata \| Opatrny, Jaroslav \| Pankratov, Denis Springer International Publishing (2021) 10.1007/978-3-030-68211-8_6 Cited by (1) \| Cite \| Source
Online Coloring and a New Type of Adversary for Online Graph Problems (book chapter) In Approximation and Online Algorithms Li, Yaqiao \| Narayan, Vishnu V. \| Pankratov, Denis Springer International Publishing (2021) 10.1007/978-3-030-80879-2_4 Cite \| Source
Graph Exploration by Energy-Sharing Mobile Agents (book chapter) In Structural Information and Communication Complexity Czyzowicz, Jurek \| Dobrev, Stefan \| Killick, Ryan \| Kranakis, Evangelos \| Krizanc, Danny \| Narayanan, Lata \| Opatrny, Jaroslav \| Pankratov, Denis \| Shende, Sunil Springer International Publishing (2021) 10.1007/978-3-030-79527-6_11 Cited by (3) \| Cite \| Source
An Experimental Study of Algorithms for Online Bipartite Matching (journal article) Borodin, Allan \| Karavasilis, Christodoulos \| Pankratov, Denis ACM Journal of Experimental Algorithmics, volume 25 (2020). 10.1145/3379552 Cited by (6) \| Cite \| Source
Advice Complexity of Priority Algorithms (journal article) Borodin, Allan \| Boyar, Joan \| Larsen, Kim S. \| Pankratov, Denis Theory of Computing Systems, volume 64, issue 4, pages 593-625 (2020). 10.1007/s00224-019-09955-7 Cited by (2) \| Cite \| Source
On Conceptually Simple Algorithms for Variants of Online Bipartite Matching (journal article) Borodin, Allan \| Pankratov, Denis \| Salehi-Abari, Amirali Theory of Computing Systems, volume 63, issue 8, pages 1781-1818 (2019). 10.1007/s00224-019-09916-0 Cited by (1) \| Cite \| Source
Advice Complexity of Priority Algorithms (book chapter) In Approximation and Online Algorithms Borodin, Allan \| Boyar, Joan \| Larsen, Kim S. \| Pankratov, Denis Springer International Publishing (2018) 10.1007/978-3-030-04693-4_5 Cited by (1) \| Cite \| Source
A Simple PTAS for the Dual Bin Packing Problem and Advice Complexity of Its Online Version (conference) Borodin, Allan \| Pankratov, Denis \| Salehi-Abari, Amirali Symposium on Discrete Algorithms (2018) New Orleans, Louisiana, USA 10.4230/OASIcs.SOSA.2018.8 Cited by (4) \| Cite \| Source
On Conceptually Simple Algorithms for Variants of Online Bipartite Matching (book chapter) In Approximation and Online Algorithms Borodin, Allan \| Pankratov, Denis \| Salehi-Abari, Amirali Springer International Publishing (2018) 10.1007/978-3-319-89441-6_19 Cited by (1) \| Cite \| Source \| Open Access
Random Θ(log n)-CNFs Are Hard for Cutting Planes (conference) Fleming, Noah \| Pankratov, Denis \| Pitassi, Toniann \| Robere, Robert 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS) (2017) Berkeley, CA 10.1109/FOCS.2017.19 Cited by (6) \| Cite \| Source
Information Lower Bounds via Self-Reducibility (journal article) Braverman, Mark \| Garg, Ankit \| Pankratov, Denis \| Weinstein, Omri Theory of Computing Systems, volume 59, issue 2, pages 377-396 (2016). 10.1007/s00224-015-9655-z Cited by (3) \| Cite \| Source
From information to exact communication (conference) Braverman, Mark \| Garg, Ankit \| Pankratov, Denis \| Weinstein, Omri STOC'13: Symposium on Theory of Computing (2013) Palo Alto California USA 10.1145/2488608.2488628 Cited by (46) \| Cite \| Source
Information Lower Bounds via Self-reducibility (book chapter) In Computer Science – Theory and Applications Braverman, Mark \| Garg, Ankit \| Pankratov, Denis \| Weinstein, Omri Springer Berlin Heidelberg (2013) 10.1007/978-3-642-38536-0_16 Cited by (10) \| Cite \| Source