( en | de | ru )

 

Disambiguation of "Pankratov, Denis"

Author of the publication

copydeleteadd this publication to your clipboard
Online vector bin packing and hypergraph coloring illuminated: simpler proofs and new connections.

, and . LAGOS, volume 223 of Procedia Computer Science, page 70-77. Elsevier, (2023)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Oleg Pankratov

Wladimir Denisow

Jaap Denissen

Alexander Arnold Denisiuk

Natalja Denisjuk

 

Other publications of authors with the same name

On the Relative Merits of Simple Local Search Methods for the MAX-SAT Problem., and . SAT, volume 6175 of Lecture Notes in Computer Science, page 223-236. Springer, (2010)Advice Complexity of Priority Algorithms., , , and . Theory Comput. Syst., 64 (4): 593-625 (2020)An Experimental Study of Algorithms for Online Bipartite Matching., , and . CoRR, (2018)Information Lower Bounds via Self-reducibility., , , and . CSR, volume 7913 of Lecture Notes in Computer Science, page 183-194. Springer, (2013)On Conceptually Simple Algorithms for Variants of Online Bipartite Matching., , and . WAOA, volume 10787 of Lecture Notes in Computer Science, page 253-268. Springer, (2017)Advice Complexity of Priority Algorithms., , , and . WAOA, volume 11312 of Lecture Notes in Computer Science, page 69-86. Springer, (2018)Variations on the Sensitivity Conjecture, , and . CoRR, (2010)An Experimental Study of Algorithms for Online Bipartite Matching., , and . ACM J. Exp. Algorithmics, (2020)Random CNFs are Hard for Cutting Planes., , , and . Electron. Colloquium Comput. Complex., (2017)Stabbing Planes., , , , , , and . Electron. Colloquium Comput. Complex., (2017)