Krzysztof Fleszar

ORCID

Publication Activity (10 Years)

Years Active: 2011-2023
Publications (10 Years): 23

Top Venues

Julius Maximilians University Würzburg, Germany (PHD)

Education History

Julius Maximilians University Würzburg, Germany

PHD

Publications

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. SODA (2023)
Steven Chaplick, Krzysztof Fleszar, Fabian Lipp, Alexander Ravsky, Oleg Verbitsky, Alexander Wolff
The Complexity of Drawing Graphs on Few Lines and Few Planes. J. Graph Algorithms Appl. 27 (6) (2023)
William S. Evans, Krzysztof Fleszar, Philipp Kindermann, Noushin Saeedi, Chan-Su Shin, Alexander Wolff
Minimum rectilinear polygons for given angle sequences. Comput. Geom. 100 (2022)
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. CoRR (2022)
Antonios Antoniadis, Krzysztof Fleszar, Ruben Hoeksma, Kevin Schewior
A PTAS for Euclidean TSP with Hyperplane Neighborhoods. ACM Trans. Algorithms 16 (3) (2020)
Steven Chaplick, Krzysztof Fleszar, Fabian Lipp, Alexander Ravsky, Oleg Verbitsky, Alexander Wolff
Drawing graphs on few lines and few planes. J. Comput. Geom. 11 (1) (2020)
Antonios Antoniadis, Krzysztof Fleszar, Ruben Hoeksma, Kevin Schewior
A PTAS for Euclidean TSP with Hyperplane Neighborhoods. SODA (2019)
Antonios Antoniadis, Krzysztof Fleszar, Ruben Hoeksma, Kevin Schewior
A PTAS for Euclidean TSP with Hyperplane Neighborhoods. CoRR (2018)
Timothy M. Chan, Thomas C. van Dijk, Krzysztof Fleszar, Joachim Spoerhase, Alexander Wolff
Stabbing Rectangles by Line Segments - How Decomposition Reduces the Shallow-Cell Complexity. ISAAC (2018)
Krzysztof Fleszar, Matthias Mnich, Joachim Spoerhase
New algorithms for maximum disjoint paths based on tree-likeness. Math. Program. 171 (1-2) (2018)
Timothy M. Chan, Thomas C. van Dijk, Krzysztof Fleszar, Joachim Spoerhase, Alexander Wolff
Stabbing Rectangles by Line Segments - How Decomposition Reduces the Shallow-Cell Complexity. CoRR (2018)
Aparna Das, Krzysztof Fleszar, Stephen G. Kobourov, Joachim Spoerhase, Sankar Veeramoni, Alexander Wolff
Approximating the Generalized Minimum Manhattan Network Problem. Algorithmica 80 (4) (2018)
Steven Chaplick, Krzysztof Fleszar, Fabian Lipp, Alexander Ravsky, Oleg Verbitsky, Alexander Wolff
The Complexity of Drawing Graphs on Few Lines and Few Planes. WADS (2017)
Krzysztof Fleszar, Matthias Mnich, Joachim Spoerhase
New Algorithms for Maximum Disjoint Paths Based on Tree-Likeness. ESA (2016)
Steven Chaplick, Krzysztof Fleszar, Fabian Lipp, Alexander Ravsky, Oleg Verbitsky, Alexander Wolff
Drawing Graphs on Few Lines and Few Planes. Graph Drawing (2016)
William S. Evans, Krzysztof Fleszar, Philipp Kindermann, Noushin Saeedi, Chan-Su Shin, Alexander Wolff
Minimum Rectilinear Polygons for Given Angle Sequences. CoRR (2016)
Steven Chaplick, Krzysztof Fleszar, Fabian Lipp, Alexander Ravsky, Oleg Verbitsky, Alexander Wolff
Drawing Graphs on Few Lines and Few Planes. CoRR (2016)
Krzysztof Fleszar, Matthias Mnich, Joachim Spoerhase
New Algorithms for Maximum Disjoint Paths Based on Tree-Likeness. CoRR (2016)
Steven Chaplick, Krzysztof Fleszar, Fabian Lipp, Alexander Ravsky, Oleg Verbitsky, Alexander Wolff
The Complexity of Drawing Graphs on Few Lines and Few Planes. CoRR (2016)
Sergey Bereg, Krzysztof Fleszar, Philipp Kindermann, Sergey Pupyrev, Joachim Spoerhase, Alexander Wolff
Colored Non-Crossing Euclidean Steiner Forest. CoRR (2015)
Sergey Bereg, Krzysztof Fleszar, Philipp Kindermann, Sergey Pupyrev, Joachim Spoerhase, Alexander Wolff
Colored Non-crossing Euclidean Steiner Forest. ISAAC (2015)
Jaroslaw Byrka, Krzysztof Fleszar, Bartosz Rybicki, Joachim Spoerhase
-Median Problems. SODA (2015)
William S. Evans, Krzysztof Fleszar, Philipp Kindermann, Noushin Saeedi, Chan-Su Shin, Alexander Wolff
Minimum Rectilinear Polygons for Given Angle Sequences. JCDCGG (2015)
Jaroslaw Byrka, Krzysztof Fleszar, Bartosz Rybicki, Joachim Spoerhase
A Constant-Factor Approximation Algorithm for Uniform Hard Capacitated $k$-Median. CoRR (2013)
Aparna Das, Krzysztof Fleszar, Stephen G. Kobourov, Joachim Spoerhase, Sankar Veeramoni, Alexander Wolff
Approximating the Generalized Minimum Manhattan Network Problem. ISAAC (2013)
Thomas C. van Dijk, Krzysztof Fleszar, Jan-Henrik Haunert, Joachim Spoerhase
Road segment selection with strokes and stability. MapInteract (2013)
Aparna Das, Krzysztof Fleszar, Stephen G. Kobourov, Joachim Spoerhase, Sankar Veeramoni, Alexander Wolff
Polylogarithmic Approximation for Generalized Minimum Manhattan Networks CoRR (2012)
Krzysztof Fleszar, Christian Glaßer, Fabian Lipp, Christian Reitwießner, Maximilian Witek
Structural Complexity of Multiobjective NP Search Problems. LATIN (2012)
Krzysztof Fleszar, Christian Glaßer, Fabian Lipp, Christian Reitwießner, Maximilian Witek
The Complexity of Solving Multiobjective Optimization Problems and its Relation to Multivalued Functions. Electron. Colloquium Comput. Complex. 18 (2011)

Krzysztof Fleszar.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Krzysztof Fleszar