MSc Krzysztof Fleszar

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

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).
     
  • Fleszar, K., Mnich, M., Spoerhase, J.: New Algorithms for Maximum Disjoint Paths Based on Tree-Likeness. 24th European Symposium of Algorithms (ESA'16) (2016).
     
  • Bereg, S., Fleszar, K., Kindermann, P., Pupyrev, S., Spoerhase, J., Wolff, A.: Colored Non-Crossing Euclidean Steiner Forest. In: Elbassioni, K. and Makino, K. (eds.) Proceecings of the 26th International Symposium on Algorithms and Computation (ISAAC'15). pp. 429-441. Springer-Verlag (2015).
     
  • Byrka, J., Fleszar, K., Rybicki, B., Spoerhase, J.: Bi-Factor Approximation Algorithms for Hard Capacitated k-Median Problems. Proc. ACM-SIAM Symposium on Discrete Algorithms (SODA'15) (2015).
     
  • 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. 722-732. 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).
     
  • 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. 72--77. 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ández-Baca, D. (ed.) Proc. 10th Latin American Theoretical INformatics Symposium (LATIN'12). pp. 338-349. Springer (2012).
     
  • Fleszar, K.: Generalized Minimum Manhattan Networks, (2012).
     
  • 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ández-Baca, D. (ed.) LATIN 2012: Theoretical Informatics. pp. 338-349. 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

Winter tem 2015/16

Summer tem 2015

Winter tem 2014/15

Summer tem 2014

Winter tem 2013/14

Winter term 2012/13