Krzysztof Fleszar

30 papers A* 3A 2B 5Journal 17Unranked 2

Year	Rank	Type	Title / Venue / Authors
2023	A*	`conf`	Gap-ETH-Tight Approximation Schemes for Red-Green-Blue Separation and Bicolored Noncrossing Euclidean Travelling Salesman Tours. SODA François Dross, Krzysztof Fleszar, Karol Wegrzycki, Anna Zych-Pawlewicz
2023	J	`jnl`	The Complexity of Drawing Graphs on Few Lines and Few Planes. J. Graph Algorithms Appl. Steven Chaplick, Krzysztof Fleszar, Fabian Lipp, Alexander Ravsky, Oleg Verbitsky, Alexander Wolff
2022	J	`jnl`	Gap-ETH-Tight Approximation Schemes for Red-Green-Blue Separation and Bicolored Noncrossing Euclidean Travelling Salesman Tours. CoRR François Dross, Krzysztof Fleszar, Karol Wegrzycki, Anna Zych-Pawlewicz
2022	J	`jnl`	Minimum rectilinear polygons for given angle sequences. Comput. Geom. William S. Evans, Krzysztof Fleszar, Philipp Kindermann, Noushin Saeedi, Chan-Su Shin, Alexander Wolff
2020	J	`jnl`	A PTAS for Euclidean TSP with Hyperplane Neighborhoods. ACM Trans. Algorithms Antonios Antoniadis, Krzysztof Fleszar, Ruben Hoeksma, Kevin Schewior
2020	J	`jnl`	Drawing graphs on few lines and few planes. J. Comput. Geom. Steven Chaplick, Krzysztof Fleszar, Fabian Lipp, Alexander Ravsky, Oleg Verbitsky, Alexander Wolff
2019	A*	`conf`	A PTAS for Euclidean TSP with Hyperplane Neighborhoods. SODA Antonios Antoniadis, Krzysztof Fleszar, Ruben Hoeksma, Kevin Schewior
2018	J	`jnl`	A PTAS for Euclidean TSP with Hyperplane Neighborhoods. CoRR Antonios Antoniadis, Krzysztof Fleszar, Ruben Hoeksma, Kevin Schewior
2018	J	`jnl`	Approximating the Generalized Minimum Manhattan Network Problem. Algorithmica Aparna Das, Krzysztof Fleszar, Stephen G. Kobourov, Joachim Spoerhase, Sankar Veeramoni, Alexander Wolff
2018	—	`—`	Network-Design Problems in Graphs and on the Plane. Krzysztof Fleszar
2018	J	`jnl`	New algorithms for maximum disjoint paths based on tree-likeness. Math. Program. Krzysztof Fleszar, Matthias Mnich, Joachim Spoerhase
2018	B	`conf`	Stabbing Rectangles by Line Segments - How Decomposition Reduces the Shallow-Cell Complexity. ISAAC Timothy M. Chan, Thomas C. van Dijk, Krzysztof Fleszar, Joachim Spoerhase, Alexander Wolff
2018	J	`jnl`	Stabbing Rectangles by Line Segments - How Decomposition Reduces the Shallow-Cell Complexity. CoRR Timothy M. Chan, Thomas C. van Dijk, Krzysztof Fleszar, Joachim Spoerhase, Alexander Wolff
2017	B	`conf`	The Complexity of Drawing Graphs on Few Lines and Few Planes. WADS Steven Chaplick, Krzysztof Fleszar, Fabian Lipp, Alexander Ravsky, Oleg Verbitsky, Alexander Wolff
2016	A	`conf`	Drawing Graphs on Few Lines and Few Planes. GD Steven Chaplick, Krzysztof Fleszar, Fabian Lipp, Alexander Ravsky, Oleg Verbitsky, Alexander Wolff
2016	J	`jnl`	Drawing Graphs on Few Lines and Few Planes. CoRR Steven Chaplick, Krzysztof Fleszar, Fabian Lipp, Alexander Ravsky, Oleg Verbitsky, Alexander Wolff
2016	J	`jnl`	Minimum Rectilinear Polygons for Given Angle Sequences. CoRR William S. Evans, Krzysztof Fleszar, Philipp Kindermann, Noushin Saeedi, Chan-Su Shin, Alexander Wolff
2016	A	`conf`	New Algorithms for Maximum Disjoint Paths Based on Tree-Likeness. ESA Krzysztof Fleszar, Matthias Mnich, Joachim Spoerhase
2016	J	`jnl`	New Algorithms for Maximum Disjoint Paths Based on Tree-Likeness. CoRR Krzysztof Fleszar, Matthias Mnich, Joachim Spoerhase
2016	J	`jnl`	The Complexity of Drawing Graphs on Few Lines and Few Planes. CoRR Steven Chaplick, Krzysztof Fleszar, Fabian Lipp, Alexander Ravsky, Oleg Verbitsky, Alexander Wolff
2015	A*	`conf`	Bi-Factor Approximation Algorithms for Hard Capacitated SODA Jaroslaw Byrka, Krzysztof Fleszar, Bartosz Rybicki, Joachim Spoerhase
2015	J	`jnl`	Colored Non-Crossing Euclidean Steiner Forest. CoRR Sergey Bereg, Krzysztof Fleszar, Philipp Kindermann, Sergey Pupyrev, Joachim Spoerhase, Alexander Wolff
2015	B	`conf`	Colored Non-crossing Euclidean Steiner Forest. ISAAC Sergey Bereg, Krzysztof Fleszar, Philipp Kindermann, Sergey Pupyrev, Joachim Spoerhase, Alexander Wolff
2015	—	`conf`	Minimum Rectilinear Polygons for Given Angle Sequences. JCDCGG William S. Evans, Krzysztof Fleszar, Philipp Kindermann, Noushin Saeedi, Chan-Su Shin, Alexander Wolff
2013	J	`jnl`	A Constant-Factor Approximation Algorithm for Uniform Hard Capacitated $k$-Median. CoRR Jaroslaw Byrka, Krzysztof Fleszar, Bartosz Rybicki, Joachim Spoerhase
2013	B	`conf`	Approximating the Generalized Minimum Manhattan Network Problem. ISAAC Aparna Das, Krzysztof Fleszar, Stephen G. Kobourov, Joachim Spoerhase, Sankar Veeramoni, Alexander Wolff
2013	—	`conf`	Road segment selection with strokes and stability. MapInteract Thomas C. van Dijk, Krzysztof Fleszar, Jan-Henrik Haunert, Joachim Spoerhase
2012	J	`jnl`	Polylogarithmic Approximation for Generalized Minimum Manhattan Networks CoRR Aparna Das, Krzysztof Fleszar, Stephen G. Kobourov, Joachim Spoerhase, Sankar Veeramoni, Alexander Wolff
2012	B	`conf`	Structural Complexity of Multiobjective NP Search Problems. LATIN Krzysztof Fleszar, Christian Glaßer, Fabian Lipp, Christian Reitwießner, Maximilian Witek
2011	J	`jnl`	The Complexity of Solving Multiobjective Optimization Problems and its Relation to Multivalued Functions. Electron. Colloquium Comput. Complex. Krzysztof Fleszar, Christian Glaßer, Fabian Lipp, Christian Reitwießner, Maximilian Witek