( en | de | ru )

 

Disambiguation of "Sankowski, Piotr"

Author of the publication

copydeleteadd this publication to your clipboard
Contracting a Planar Graph Efficiently.

, , , , , and . ESA, volume 87 of LIPIcs, page 50:1-50:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)

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

Processor efficient parallel matching.. SPAA, page 165-170. ACM, (2005)Network Sparsification for Steiner Problems on Planar and Bounded-Genus Graphs., , , and . CoRR, (2013)Approximate nearest neighbors search without false negatives for l2., and . CoRR, (2017)Optimal Decremental Connectivity in Planar Graphs., and . STACS, volume 30 of LIPIcs, page 608-621. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2015)The Ring Design Game with Fair Cost Allocation - Extended Abstract., , , and . WINE, volume 7695 of Lecture Notes in Computer Science, page 546-552. Springer, (2012)Improving Ads-Profitability Using Traffic-Fingerprints., , , , and . AusDM, volume 1741 of Communications in Computer and Information Science, page 205-216. Springer, (2022)Online Bipartite Matching in Offline Time., , , and . FOCS, page 384-393. IEEE Computer Society, (2014)Algorithmic Applications of Baur-Strassen's Theorem: Shortest Cycles, Diameter and Matchings., , and . FOCS, page 531-540. IEEE Computer Society, (2012)A Path-Decomposition Theorem with Applications to Pricing and Covering on Trees., , , , and . ESA, volume 7501 of Lecture Notes in Computer Science, page 349-360. Springer, (2012)Network formation games with local coalitions., and . PODC, page 299-305. ACM, (2007)