Fleszar, Krzysztof
Publications
-
Approximating the Generalized Minimum {Manhattan} Network Problem. . In Algorithmica, 80(4), pp. 1170–1190. 2018.
-
Stabbing Rectangles by Line Segments – How Decomposition Reduces the Shallow-Cell Complexity. . Submitted. 2018.
- [ BibTeX ]
-
A {PTAS} for {E}uclidean {TSP} with Hyperplane Neighborhoods. . Submitted. 2018.
-
New algorithms for maximum disjoint paths based on tree-likeness. . In Mathematical Programming. 2017.
-
Approximating the Generalized Minimum {M}anhattan Network Problem. . In Algorithmica, pp. 1–21. 2017.
- [ BibTeX ]
-
The Complexity of Drawing Graphs on Few Lines and Few Planes. . In Proc. Algorithms Data Struct. Symp. (WADS’17), of Lecture Notes in Computer Science, F. Ellen, A. Kolokolova, J.-R. Sack (eds.). Springer International Publishing, 2017.
- [ BibTeX ]
-
New Algorithms for Maximum Disjoint Paths Based on Tree-Likeness. . In 24th Europ. Symp. Algorithms (ESA’16), Vol. 57 of Leibniz International Proceedings in Informatics (LIPIcs), P. Sankowski, C. Zaroliagis (eds.), pp. 42:1–42:17. Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 2016.
-
Minimum Rectilinear Polygons for Given Angle Sequences. . In Proc. Japan. Conf. Discrete Comput. Geom. Graphs (JCDCGG’15), Vol. 9943 of Lecture Notes in Computer Science, J. Akiyama, H. Ito, T. Sakai (eds.), pp. 105–119. Springer International Publishing, 2016.
-
Drawing Graphs on Few Lines and Few Planes. . In Proc. 24th Int. Symp. Graph Drawing & Network Vis. (GD’16), Vol. 9801 of Lecture Notes in Computer Science, Y. Hu, M. N{ö}llenburg (eds.), pp. 166–180. Springer International Publishing, 2016.
-
Colored Non-Crossing {E}uclidean {S}teiner Forest. . In Proc. 26th Int. Symp. Algorithms Comput. (ISAAC’15), Vol. 9472 of Lecture Notes in Computer Science, K. Elbassioni, K. Makino (eds.), pp. 429–441. Springer Berlin Heidelberg, 2015.
-
Bi-Factor Approximation Algorithms for Hard Capacitated k-Median Problems. . In Proc. ACM-SIAM Symp. Discrete Algorithms (SODA’15). 2015.
-
Polylogarithmic Approximation for Generalized Minimum {Manhattan} Networks. . In Proc. 29th Europ. Workshop Comput. Geom. (EuroCG’13), S. Fekete (ed.). Braunschweig, 2013.
- [ BibTeX ]
-
Approximating the Generalized Minimum {Manhattan} Network Problem. . In Proc. 24th Int. Symp. Algorithms Comput. (ISAAC’13), Vol. 8283 of Lecture Notes in Computer Science, L. Cai, S.-W. Cheng, T. W. Lam (eds.), pp. 722–732. Springer Berlin Heidelberg, 2013.
-
Road Segment Selection with Strokes and Stability. . In Proc. 1st ACM SIGSPATIAL Int. Workshop MapInteraction (MapInteract’13), pp. 72–77. ACM, Orlando, Florida, 2013.
-
Generalized Minimum {M}anhattan Networks. . 2012, May.
- [ BibTeX ]
-
Polylogarithmic Approximation for Generalized Minimum {Manhattan} Networks. . 2012, April.
-
Structural Complexity of Multiobjective {NP} Search Problems. . In Proc. 10th Latin American Symp. Theoretical Informatics (LATIN’12), Vol. 7256 of Lecture Notes in Computer Science, D. Fernández-Baca (ed.), pp. 338–349. Springer Berlin Heidelberg, 2012.
-
The Complexity of Solving Multiobjective Optimization Problems and its Relation to Multivalued Functions. . In Electronic Colloquium Computat. Complexity (ECCC), 18, p. 53. 2011.
-
Complementation of Multihead Automata. . 2010, July.
MSc Krzysztof Fleszar
Address
Research
- Network Design Problems (e.g. Disjoint Paths Problems)
- Geometric Optimization Problems (e.g. Stabbing Problems)
- Location Problems (e.g. k-Median)
Short CV
- since October 2016:
Postdoc at Universidad de Chile and at Max Planck Institut for Informatics in Saarbrücken
- October 2012 to October 2016:
Research assistant at Lehrstuhl für Informatik I, Universität Würzburg
- till September 2012:
Studies of computer science at Universität Würzburg
Teaching
Summer tem 2016
- exercises Exact Algorithms
Winter tem 2015/16
exercises Algorithms and Data Structures
Summer tem 2015
Winter tem 2014/15
- exercises Algorithms and Data Structures
Summer tem 2014
- exercises Exact Algorithms
Winter tem 2013/14
- exercises Algorithms and Data Structures
Winter term 2012/13
- exercises Computational Geometry