default search action
Krzysztof Fleszar 0001
Person information
- affiliation: University of Warsaw, Poland
- affiliation (former): Max-Planck-Institut für Informatik, Saarbrücken, Germany
Other persons with the same name
- Krzysztof Fleszar 0002
— American University of Beirut, Lebanon
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j6]Steven Chaplick
The Complexity of Drawing Graphs on Few Lines and Few Planes. J. Graph Algorithms Appl. 27(6): 459-488 (2023) - [c12]François Dross, Krzysztof Fleszar
Gap-ETH-Tight Approximation Schemes for Red-Green-Blue Separation and Bicolored Noncrossing Euclidean Travelling Salesman Tours. SODA 2023: 1433-1463 - 2022
- [j5]William S. Evans
Minimum rectilinear polygons for given angle sequences. Comput. Geom. 100: 101820 (2022) - [i11]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 abs/2209.08904 (2022) - 2020
- [j4]Steven Chaplick
Drawing graphs on few lines and few planes. J. Comput. Geom. 11(1): 433-475 (2020) - [j3]Antonios Antoniadis, Krzysztof Fleszar
A PTAS for Euclidean TSP with Hyperplane Neighborhoods. ACM Trans. Algorithms 16(3): 38:1-38:16 (2020)
2010 – 2019
- 2019
- [c11]Antonios Antoniadis, Krzysztof Fleszar
A PTAS for Euclidean TSP with Hyperplane Neighborhoods. SODA 2019: 1089-1105 - 2018
- [b1]Krzysztof Fleszar:
Network-Design Problems in Graphs and on the Plane. Julius Maximilians University Würzburg, Germany, 2018, ISBN 978-3-95826-076-4, pp. 1-204 - [j2]Aparna Das, Krzysztof Fleszar
Approximating the Generalized Minimum Manhattan Network Problem. Algorithmica 80(4): 1170-1190 (2018) - [j1]Krzysztof Fleszar
New algorithms for maximum disjoint paths based on tree-likeness. Math. Program. 171(1-2): 433-461 (2018) - [c10]Timothy M. Chan, Thomas C. van Dijk, Krzysztof Fleszar
Stabbing Rectangles by Line Segments - How Decomposition Reduces the Shallow-Cell Complexity. ISAAC 2018: 61:1-61:13 - [i10]Antonios Antoniadis, Krzysztof Fleszar, Ruben Hoeksma
A PTAS for Euclidean TSP with Hyperplane Neighborhoods. CoRR abs/1804.03953 (2018) - [i9]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 abs/1806.02851 (2018) - 2017
- [c9]Steven Chaplick
The Complexity of Drawing Graphs on Few Lines and Few Planes. WADS 2017: 265-276 - 2016
- [c8]Krzysztof Fleszar, Matthias Mnich
New Algorithms for Maximum Disjoint Paths Based on Tree-Likeness. ESA 2016: 42:1-42:17 - [c7]Steven Chaplick
Drawing Graphs on Few Lines and Few Planes. GD 2016: 166-180 - [i8]Krzysztof Fleszar, Matthias Mnich, Joachim Spoerhase:
New Algorithms for Maximum Disjoint Paths Based on Tree-Likeness. CoRR abs/1603.01740 (2016) - [i7]William S. Evans, Krzysztof Fleszar, Philipp Kindermann, Noushin Saeedi, Chan-Su Shin, Alexander Wolff:
Minimum Rectilinear Polygons for Given Angle Sequences. CoRR abs/1606.06940 (2016) - [i6]Steven Chaplick, Krzysztof Fleszar, Fabian Lipp, Alexander Ravsky, Oleg Verbitsky, Alexander Wolff:
Drawing Graphs on Few Lines and Few Planes. CoRR abs/1607.01196 (2016) - [i5]Steven Chaplick, Krzysztof Fleszar, Fabian Lipp, Alexander Ravsky, Oleg Verbitsky, Alexander Wolff:
The Complexity of Drawing Graphs on Few Lines and Few Planes. CoRR abs/1607.06444 (2016) - 2015
- [c6]Sergey Bereg, Krzysztof Fleszar, Philipp Kindermann
Colored Non-crossing Euclidean Steiner Forest. ISAAC 2015: 429-441 - [c5]William S. Evans, Krzysztof Fleszar, Philipp Kindermann
Minimum Rectilinear Polygons for Given Angle Sequences. JCDCGG 2015: 105-119 - [c4]Jaroslaw Byrka, Krzysztof Fleszar, Bartosz Rybicki, Joachim Spoerhase:
Bi-Factor Approximation Algorithms for Hard Capacitated k-Median Problems. SODA 2015: 722-736 - [i4]Sergey Bereg, Krzysztof Fleszar, Philipp Kindermann, Sergey Pupyrev, Joachim Spoerhase, Alexander Wolff:
Colored Non-Crossing Euclidean Steiner Forest. CoRR abs/1509.05681 (2015) - 2013
- [c3]Thomas C. van Dijk, Krzysztof Fleszar, Jan-Henrik Haunert
Road segment selection with strokes and stability. MapInteract 2013: 72-77 - [c2]Aparna Das, Krzysztof Fleszar, Stephen G. Kobourov
Approximating the Generalized Minimum Manhattan Network Problem. ISAAC 2013: 722-732 - [i3]Jaroslaw Byrka, Krzysztof Fleszar, Bartosz Rybicki, Joachim Spoerhase:
A Constant-Factor Approximation Algorithm for Uniform Hard Capacitated $k$-Median. CoRR abs/1312.6550 (2013) - 2012
- [c1]Krzysztof Fleszar, Christian Glaßer, Fabian Lipp
Structural Complexity of Multiobjective NP Search Problems. LATIN 2012: 338-349 - [i2]Aparna Das, Krzysztof Fleszar, Stephen G. Kobourov, Joachim Spoerhase, Sankar Veeramoni, Alexander Wolff:
Polylogarithmic Approximation for Generalized Minimum Manhattan Networks. CoRR abs/1203.6481 (2012) - 2011
- [i1]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. TR11 (2011)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-08 21:43 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: