( en | de | ru )

 

Disambiguation of "Sankowski, Piotr"

Author of the publication

copydeleteadd this publication to your clipboard
Min st-Cut Oracle for Planar Graphs with Near-Linear Preprocessing Time.

, , and . ACM Trans. Algorithms, 11 (3): 16:1-16:29 (2015)

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.

Roman Sankowski

Natalia Sankowski

Roman Sankowski

Sven Piotrowiak

Katja Piotrowski

 

Other publications of authors with the same name

Optimal Dynamic Strings., , , , and . CoRR, (2015)Fast Approximation in Subspaces by Doubling Metric Decomposition, , , , and . CoRR, (2009)Online matching with delays and stochastic arrival times., , , and . CoRR, (2022)Contrastive News and Social Media Linking using BERT for Articles and Tweets across Dual Platforms., , , , , , , , , and 2 other author(s). CoRR, (2023)Implementation of the Iterative Relaxation Algorithm for the Minimum Bounded-Degree Spanning Tree Problem., , , and . SEA, volume 8504 of Lecture Notes in Computer Science, page 74-86. Springer, (2014)Dynamic Normal Forms and Dynamic Characteristic Polynomial., and . ICALP (1), volume 5125 of Lecture Notes in Computer Science, page 434-446. Springer, (2008)A Tight Bound for Shortest Augmenting Paths on Trees., , , and . LATIN, volume 10807 of Lecture Notes in Computer Science, page 201-216. Springer, (2018)Spreading rumours without the network., , , and . COSN, page 107-118. ACM, (2014)(1 + ε)-Approximate Incremental Matching in Constant Deterministic Amortized Time., , , , and . SODA, page 1886-1898. SIAM, (2019)Revenue Maximization Envy-Free Pricing for Homogeneous Resources., , and . IJCAI, page 90-96. AAAI Press, (2015)