Krzysztof Fleszar
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
10
Venues
6
Active years
2012–2023
Best venue rank
A*
Where they publish
Papers
10 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2023 | SODA | Gap-ETH-Tight Approximation Schemes for Red-Green-Blue Separation and Bicolored Noncrossing Euclidean Travelling Salesman Tours. | Franois Dross, Krzysztof Fleszar, Karol Wegrzycki, Anna Zych-Pawlewicz |
| 2019 | SODA | A PTAS for Euclidean TSP with Hyperplane Neighborhoods. | Antonios Antoniadis, Krzysztof Fleszar, Ruben Hoeksma, Kevin Schewior |
| 2018 | ISAAC | 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 |
| 2017 | WADS | The Complexity of Drawing Graphs on Few Lines and Few Planes. | Steven Chaplick, Krzysztof Fleszar, Fabian Lipp, Alexander Ravsky, Oleg Verbitsky, Alexander Wolff |
| 2016 | ESA | New Algorithms for Maximum Disjoint Paths Based on Tree-Likeness. | Krzysztof Fleszar, Matthias Mnich, Joachim Spoerhase |
| 2016 | GD | Drawing Graphs on Few Lines and Few Planes. | Steven Chaplick, Krzysztof Fleszar, Fabian Lipp, Alexander Ravsky, Oleg Verbitsky, Alexander Wolff |
| 2015 | ISAAC | Colored Non-crossing Euclidean Steiner Forest. | Sergey Bereg, Krzysztof Fleszar, Philipp Kindermann, Sergey Pupyrev, Joachim Spoerhase, Alexander Wolff |
| 2015 | SODA | Bi-Factor Approximation Algorithms for Hard Capacitated | Jaroslaw Byrka, Krzysztof Fleszar, Bartosz Rybicki, Joachim Spoerhase |
| 2013 | ISAAC | Approximating the Generalized Minimum Manhattan Network Problem. | Aparna Das, Krzysztof Fleszar, Stephen G. Kobourov, Joachim Spoerhase, Sankar Veeramoni, Alexander Wolff |
| 2012 | LATIN | Structural Complexity of Multiobjective NP Search Problems. | Krzysztof Fleszar, Christian Glaer, Fabian Lipp, Christian Reitwiener, Maximilian Witek |