( en | de | ru )

 

Disambiguation of "Leniowski, Dariusz"

Author of the publication

copydeleteadd this publication to your clipboard
A Tight Bound for Shortest Augmenting Paths on Trees.

, , , and . LATIN, volume 10807 of Lecture Notes in Computer Science, page 201-216. Springer, (2018)

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.

Dariusz Wawro

Dariusz Zakrzewicz

Dariusz Wolany

Dariusz Oko

Dariusz Adamczyk

 

Other publications of authors with the same name

Shortest Augmenting Paths for Online Matchings on Trees., , , and . Theory Comput. Syst., 62 (2): 337-348 (2018)Acorn: A grid computing system for constraint based modeling and visualization of the genome scale metabolic reaction networks via a web interface., , , , , , , , , and . BMC Bioinform., (2011)Fully Dynamic k-Center Clustering in Doubling Metrics., , , and . CoRR, (2019)Shortest Augmenting Paths for Online Matchings on Trees., , , and . WAOA, volume 9499 of Lecture Notes in Computer Science, page 59-71. Springer, (2015)A tight bound for shortest augmenting paths on trees., , , and . Theor. Comput. Sci., (2022)Fully Dynamic k-Center Clustering in Low Dimensional Metrics., , , , and . ALENEX, page 143-153. SIAM, (2021)Dynamic Clustering to Minimize the Sum of Radii., , and . Algorithmica, 82 (11): 3183-3194 (2020)Dynamic Clustering to Minimize the Sum of Radii., , and . ESA, volume 87 of LIPIcs, page 48:1-48:10. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)A Tight Bound for Shortest Augmenting Paths on Trees., , , and . LATIN, volume 10807 of Lecture Notes in Computer Science, page 201-216. Springer, (2018)A Tree Structure For Dynamic Facility Location., , and . ESA, volume 112 of LIPIcs, page 39:1-39:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)