Krzysztof Fleszar

According to our database, Krzysztof Fleszar authored at least 16 papers between 2011 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

The Complexity of Drawing Graphs on Few Lines and Few Planes.

Steven Chaplick, Krzysztof Fleszar, Fabian Lipp, Alexander Ravsky, Oleg Verbitsky, Alexander Wolff

J. Graph Algorithms Appl., 2023

Gap-ETH-Tight Approximation Schemes for Red-Green-Blue Separation and Bicolored Noncrossing Euclidean Travelling Salesman Tours.

François Dross, Krzysztof Fleszar, Karol Wegrzycki, Anna Zych-Pawlewicz

Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

2022

Minimum rectilinear polygons for given angle sequences.

William S. Evans, Krzysztof Fleszar, Philipp Kindermann, Noushin Saeedi, Chan-Su Shin, Alexander Wolff

Comput. Geom., 2022

2020

A PTAS for Euclidean TSP with Hyperplane Neighborhoods.

Antonios Antoniadis, Krzysztof Fleszar, Ruben Hoeksma, Kevin Schewior

ACM Trans. Algorithms, 2020

Drawing graphs on few lines and few planes.

Steven Chaplick, Krzysztof Fleszar, Fabian Lipp, Alexander Ravsky, Oleg Verbitsky, Alexander Wolff

J. Comput. Geom., 2020

2018

Network-Design Problems in Graphs and on the Plane.

Krzysztof Fleszar

PhD thesis, 2018

New algorithms for maximum disjoint paths based on tree-likeness.

Krzysztof Fleszar, Matthias Mnich, Joachim Spoerhase

Math. Program., 2018

Approximating the Generalized Minimum Manhattan Network Problem.

Aparna Das, Krzysztof Fleszar, Stephen G. Kobourov, Joachim Spoerhase, Sankar Veeramoni, Alexander Wolff

Algorithmica, 2018

Stabbing Rectangles by Line Segments - How Decomposition Reduces the Shallow-Cell Complexity.

Timothy M. Chan, Thomas C. van Dijk, Krzysztof Fleszar, Joachim Spoerhase, Alexander Wolff

Proceedings of the 29th International Symposium on Algorithms and Computation, 2018

2015

Bi-Factor Approximation Algorithms for Hard Capacitated <i>k</i>-Median Problems.

Jaroslaw Byrka, Krzysztof Fleszar, Bartosz Rybicki, Joachim Spoerhase

Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

Colored Non-crossing Euclidean Steiner Forest.

Sergey Bereg, Krzysztof Fleszar, Philipp Kindermann, Sergey Pupyrev, Joachim Spoerhase, Alexander Wolff

Proceedings of the Algorithms and Computation - 26th International Symposium, 2015

2013

A Constant-Factor Approximation Algorithm for Uniform Hard Capacitated $k$-Median.

Jaroslaw Byrka, Krzysztof Fleszar, Bartosz Rybicki, Joachim Spoerhase

CoRR, 2013

Road segment selection with strokes and stability.

Thomas C. van Dijk, Krzysztof Fleszar, Jan-Henrik Haunert, Joachim Spoerhase

Proceedings of the MapInteract 2013, 2013

2012

Polylogarithmic Approximation for Generalized Minimum Manhattan Networks

Aparna Das, Krzysztof Fleszar, Stephen G. Kobourov, Joachim Spoerhase, Sankar Veeramoni, Alexander Wolff

CoRR, 2012

Structural Complexity of Multiobjective NP Search Problems.

Krzysztof Fleszar, Christian Glaßer, Fabian Lipp, Christian Reitwießner, Maximilian Witek

Proceedings of the LATIN 2012: Theoretical Informatics, 2012

2011

The Complexity of Solving Multiobjective Optimization Problems and its Relation to Multivalued Functions.

Krzysztof Fleszar, Christian Glaßer, Fabian Lipp, Christian Reitwießner, Maximilian Witek

Electron. Colloquium Comput. Complex., 2011