Krzysztof Fleszar

Orcid: 0000-0002-1129-3289

Affiliations:
  • University of Warsaw, Poland
  • Max-Planck-Institut für Informatik, Saarbrücken, Germany (former)


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

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Gap-ETH-Tight Approximation Schemes for Red-Green-Blue Separation and Bicolored Noncrossing Euclidean Travelling Salesman Tours.
Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

2019
A PTAS for Euclidean TSP with Hyperplane Neighborhoods.
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

2018
Network-Design Problems in Graphs and on the Plane.
PhD thesis, 2018

Stabbing Rectangles by Line Segments - How Decomposition Reduces the Shallow-Cell Complexity.
Proceedings of the 29th International Symposium on Algorithms and Computation, 2018

2017
The Complexity of Drawing Graphs on Few Lines and Few Planes.
Proceedings of the Algorithms and Data Structures - 15th International Symposium, 2017

2016
Drawing Graphs on Few Lines and Few Planes.
Proceedings of the Graph Drawing and Network Visualization - 24th International Symposium, 2016

New Algorithms for Maximum Disjoint Paths Based on Tree-Likeness.
Proceedings of the 24th Annual European Symposium on Algorithms, 2016

2015
Bi-Factor Approximation Algorithms for Hard Capacitated <i>k</i>-Median Problems.
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

Minimum Rectilinear Polygons for Given Angle Sequences.
Proceedings of the Discrete and Computational Geometry and Graphs - 18th Japan Conference, 2015

Colored Non-crossing Euclidean Steiner Forest.
Proceedings of the Algorithms and Computation - 26th International Symposium, 2015

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

Approximating the Generalized Minimum Manhattan Network Problem.
Proceedings of the Algorithms and Computation - 24th International Symposium, 2013

Road segment selection with strokes and stability.
Proceedings of the MapInteract 2013, 2013

2012
Polylogarithmic Approximation for Generalized Minimum Manhattan Networks
CoRR, 2012

Structural Complexity of Multiobjective NP Search Problems.
Proceedings of the LATIN 2012: Theoretical Informatics, 2012

2011
The Complexity of Solving Multiobjective Optimization Problems and its Relation to Multivalued Functions.
Electron. Colloquium Comput. Complex., 2011


  Loading...