Deutsch Intern
    Chair of Computer Science I - Algorithms, Complexity, and Knowledge-Based Systems

    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

    • Das, A., Fleszar, K., Kobourov, S., Spoerhase, J., Veeramoni, S., Wolff, A.: Approximating the Generalized Minimum Manhattan Network Problem. Algorithmica. (2017).
       
    • Chaplick, S., Fleszar, K., Lipp, F., Ravsky, A., Verbitsky, O., Wolff, A.: The Complexity of Drawing Graphs on Few Lines and Few Planes. In: Ellen, F., Kolokolova, A., and Sack, J.-R. (eds.) Proc. Algorithms Data Struct. Symp. (WADS'17). Springer International Publishing (2017).
       
    • Chaplick, S., Fleszar, K., Lipp, F., Ravsky, A., Verbitsky, O., Wolff, A.: Drawing Graphs on Few Lines and Few Planes. In: Hu, Y. and Nöllenburg, M. (eds.) Proc. 24th Int. Symp. Graph Drawing & Network Vis. (GD'16). p. 166--180. Springer International Publishing (2016).
       
    • Fleszar, K., Mnich, M., Spoerhase, J.: New Algorithms for Maximum Disjoint Paths Based on Tree-Likeness. In: Sankowski, P. and Zaroliagis, C. (eds.) 24th Europ. Symp. Algorithms (ESA'16). p. 42:1--42:17. Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik (2016).
       
    • Evans, W.S., Fleszar, K., Kindermann, P., Saeedi, N., Shin, C.-S., Wolff, A.: Minimum Rectilinear Polygons for Given Angle Sequences. In: Akiyama, J., Ito, H., and Sakai, T. (eds.) Proc. Japan. Conf. Discrete Comput. Geom. Graphs (JCDCGG'15). p. 105--119. Springer International Publishing (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.) Proc. 26th Int. Symp. Algorithms Comput. (ISAAC'15). pp. 429-441. Springer Berlin Heidelberg (2015).
       
    • Byrka, J., Fleszar, K., Rybicki, B., Spoerhase, J.: Bi-Factor Approximation Algorithms for Hard Capacitated k-Median Problems. Proc. ACM-SIAM Symp. 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 Int. Symp. Algorithms Comput. (ISAAC'13). pp. 722-732. Springer Berlin Heidelberg (2013).
       
    • van Dijk, T.C., Fleszar, K., Haunert, J.-H., Spoerhase, J.: Road Segment Selection with Strokes and Stability. Proc. 1st ACM SIGSPATIAL Int. Workshop MapInteraction (MapInteract'13). p. 72--77. ACM, Orlando, Florida (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).
       
    • 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 Symp. Theoretical Informatics (LATIN'12). pp. 338-349. Springer Berlin Heidelberg (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.: Generalized Minimum Manhattan Networks, (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 Computat. 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

    Contact

    Universität Würzburg
    Sanderring 2
    97070 Würzburg

    Phone: +49 931 31-0
    Fax: +49 931 31-82600

    Find Contact

    Sanderring Röntgenring Hubland Nord Hubland Süd Campus Medizin