MSc Krzysztof Fleszar
Department of Mathematical Engineering
Universidad de Chile
Beauchef 851
Santiago, Chile
Tel.: +56 229780539
Email:
Homepage Universidad de Chile
Research
 Network Design Problems (e.g. Disjoint Paths Problems)
 Geometric Optimization Problems (e.g. Stabbing Problems)
 Location Problems (e.g. kMedian)
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
Publications

Evans, W.S., Fleszar, K., Kindermann, P., Saeedi, N., Shin, C.S., Wolff, A.: Minimum Rectilinear Polygons for Given Angle Sequences. Proceedings of the 18th Japan Conference on Discrete and Computational Geometry and Graphs (JCDCGG’15) (2016).[ BibTeX ]

Fleszar, K., Mnich, M., Spoerhase, J.: New Algorithms for Maximum Disjoint Paths Based on TreeLikeness. 24th European Symposium of Algorithms (ESA'16) (2016).

Bereg, S., Fleszar, K., Kindermann, P., Pupyrev, S., Spoerhase, J., Wolff, A.: Colored NonCrossing Euclidean Steiner Forest. In: Elbassioni, K. and Makino, K. (eds.) Proceecings of the 26th International Symposium on Algorithms and Computation (ISAAC'15). pp. 429441. SpringerVerlag (2015).

Byrka, J., Fleszar, K., Rybicki, B., Spoerhase, J.: BiFactor Approximation Algorithms for Hard Capacitated kMedian Problems. Proc. ACMSIAM Symposium on Discrete Algorithms (SODA'15) (2015).[ BibTeX ]

Das, A., Fleszar, K., Kobourov, S.G., Spoerhase, J., Veeramoni, S., Wolff, A.: Approximating the Generalized Minimum Manhattan Network Problem. In: Cai, L., Cheng, S.W., and Lam, T.W. (eds.) Proc. 24th International Symposium on Algorithms and Computation (ISAAC'13). pp. 722732. Springer (2013).

Das, A., Fleszar, K., Kobourov, S.G., Spoerhase, J., Veeramoni, S., Wolff, A.: Polylogarithmic Approximation for Generalized Minimum Manhattan Networks. In: Fekete, S. (ed.) Proc. 29th Europ. Workshop Comput. Geom. (EuroCG'13). , Braunschweig (2013).[ BibTeX ]

van Dijk, T.C., Fleszar, K., Haunert, J.H., Spoerhase, J.: Road Segment Selection with Strokes and Stability. Proc. 1st ACM SIGSPATIAL International Workshop on MapInteraction (MapInteract'13). p. 7277. ACM, Orlando, Florida (2013).

Fleszar, K., Glaßer, C., Lipp, F., Reitwießner, C., Witek, M.: Structural Complexity of Multiobjective NP Search Problems. In: FernándezBaca, D. (ed.) Proc. 10th Latin American Theoretical INformatics Symposium (LATIN'12). pp. 338349. Springer (2012).

Fleszar, K.: Generalized Minimum Manhattan Networks, (2012).[ BibTeX ]

Das, A., Fleszar, K., Kobourov, S.G., Spoerhase, J., Veeramoni, S., Wolff, A.: Polylogarithmic Approximation for Generalized Minimum Manhattan Networks, http://arxiv.org/abs/1203.6481, (2012).

Fleszar, K., Glaßer, C., Lipp, F., Reitwießner, C., Witek, M.: Structural Complexity of Multiobjective NP Search Problems. In: FernándezBaca, D. (ed.) LATIN 2012: Theoretical Informatics. pp. 338349. Springer Berlin Heidelberg (2012).

Fleszar, K., Glaßer, C., Lipp, F., Reitwießner, C., Witek, M.: The Complexity of Solving Multiobjective Optimization Problems and its Relation to Multivalued Functions. Electronic Colloquium on Computational Complexity (ECCC). 18, 53 (2011).

Fleszar, K.: Complementation of Multihead Automata, (2010).
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