Publikacje

Krzysztof Fleszar

2023

• François Dross, Krzysztof Fleszar , Karol Wegrzycki, Anna Zych-Pawlewicz , Gap-ETH-Tight Approximation Schemes for Red-Green-Blue Separation and Bicolored Noncrossing Euclidean Travelling Salesman Tours, 2023 Annual ACM-SIAM Symposium on Discrete Algorithms, Florencja, Italy, 22 stycznia 2023 - 25 stycznia 2023. Zobacz w PBN
• Steven Chaplick, Krzysztof Fleszar , Fabian Lipp, Alexander Ravsky, Oleg Verbitsky, Alexander Wolff, The Complexity of Drawing Graphs on Few Lines and Few Planes, Journal of Graph Algorithms and Applications, 27 (6) 2023, s. 459-488. Zobacz w PBN

2022

• William S. Evans, Krzysztof Fleszar , Philipp Kindermann, Noushin Saeedi, Chan-Su Shin, Alexander Wolff, Minimum rectilinear polygons for given angle sequences, Computational Geometry: Theory and Applications, 100 2022, s. 101820. Zobacz w PBN

2020

• Antonios Antoniadis, Krzysztof Fleszar , Ruben Hoeksma, Kevin Schewior, A PTAS for Euclidean TSP with Hyperplane Neighborhoods, ACM Transactions on Algorithms, 16 (3) 2020, s. 1-16. Zobacz w PBN
• Steven Chaplick, Krzysztof Fleszar , Fabian Lipp, Alexander Ravsky, Oleg Verbitsky, Alexander Wolff, Drawing graphs on few lines and few planes, Journal of Computational Geometry, 11 (1) 2020, s. 433-475. Zobacz w PBN

2019

• Antonios Antoniadis, Krzysztof Fleszar , Ruben Hoeksma, Kevin Schewior, A PTAS for Euclidean TSP with Hyperplane Neighborhoods, 30th ACM-SIAM Symposium on Discrete Algorithms, San Diego, the United States of America, 6 stycznia 2019 - 9 stycznia 2019. Zobacz w PBN

2018

• Aparna Das, Krzysztof Fleszar , Stephen Kobourov, Joachim Spoerhase, Sankar Veeramoni, Alexander Wolff, Approximating the Generalized Minimum Manhattan Network Problem, Algorithmica, 80 (4) 2018, s. 1170-1190. Zobacz w PBN
• Krzysztof Fleszar , Matthias Mnich, Joachim Spoerhase, New algorithms for maximum disjoint paths based on tree-likeness, MATHEMATICAL PROGRAMMING, 171 (1-2) 2018, s. 433-461. Zobacz w PBN