The Complexity of Solving Multiobjective Optimization Problems and its Relation to Multivalued Functions. - Krzysztof Fleszar 001; Christian Glaßer; Fabian Lipp; Christian Reitwießner; Maximilian Witek (Electron. Colloquium Comput. Complex., 2011)

Structural Complexity of Multiobjective NP Search Problems. - Krzysztof Fleszar 001; Christian Glaßer; Fabian Lipp; Christian Reitwießner; Maximilian Witek (LATIN, 2012)

Polylogarithmic Approximation for Generalized Minimum Manhattan Networks - Aparna Das; Krzysztof Fleszar 001; Stephen G. Kobourov; Joachim Spoerhase; Sankar Veeramoni; Alexander Wolff 001 (CoRR, 2012)

Road segment selection with strokes and stability. - Thomas C. van Dijk; Krzysztof Fleszar 001; Jan-Henrik Haunert; Joachim Spoerhase (MapInteract, 2013)

Approximating the Generalized Minimum Manhattan Network Problem. - Aparna Das; Krzysztof Fleszar 001; Stephen G. Kobourov; Joachim Spoerhase; Sankar Veeramoni; Alexander Wolff 001 (ISAAC, 2013)

A Constant-Factor Approximation Algorithm for Uniform Hard Capacitated $k$-Median. - Jaroslaw Byrka; Krzysztof Fleszar 001; Bartosz Rybicki; Joachim Spoerhase (CoRR, 2013)

Colored Non-crossing Euclidean Steiner Forest. - Sergey Bereg; Krzysztof Fleszar 001; Philipp Kindermann; Sergey Pupyrev; Joachim Spoerhase; Alexander Wolff 001 (ISAAC, 2015)

Minimum Rectilinear Polygons for Given Angle Sequences. - William S. Evans; Krzysztof Fleszar 001; Philipp Kindermann; Noushin Saeedi; Chan-Su Shin; Alexander Wolff 001 (JCDCGG, 2015)

Bi-Factor Approximation Algorithms for Hard Capacitated k-Median Problems. - Jaroslaw Byrka; Krzysztof Fleszar 001; Bartosz Rybicki; Joachim Spoerhase (SODA, 2015)

New Algorithms for Maximum Disjoint Paths Based on Tree-Likeness. - Krzysztof Fleszar 001; Matthias Mnich; Joachim Spoerhase (ESA, 2016)

Drawing Graphs on Few Lines and Few Planes. - Steven Chaplick; Krzysztof Fleszar 001; Fabian Lipp; Alexander Ravsky; Oleg Verbitsky 001; Alexander Wolff 001 (GD, 2016)

The Complexity of Drawing Graphs on Few Lines and Few Planes. - Steven Chaplick; Krzysztof Fleszar 001; Fabian Lipp; Alexander Ravsky; Oleg Verbitsky 001; Alexander Wolff 001 (WADS, 2017)

Stabbing Rectangles by Line Segments - How Decomposition Reduces the Shallow-Cell Complexity. - Timothy M. Chan; Thomas C. van Dijk; Krzysztof Fleszar 001; Joachim Spoerhase; Alexander Wolff 001 (ISAAC, 2018)

Network-Design Problems in Graphs and on the Plane. - Krzysztof Fleszar 001 (2018)

A PTAS for Euclidean TSP with Hyperplane Neighborhoods. - Antonios Antoniadis 001; Krzysztof Fleszar 001; Ruben Hoeksma; Kevin Schewior (SODA, 2019)

Gap-ETH-Tight Approximation Schemes for Red-Green-Blue Separation and Bicolored Noncrossing Euclidean Travelling Salesman Tours. - François Dross; Krzysztof Fleszar 001; Karol Wegrzycki; Anna Zych-Pawlewicz (SODA, 2023)