piwik-script

English Intern
    Lehrstuhl für Informatik I - Algorithmen und Komplexität

    Fleszar, Krzysztof

    MSc Krzysztof Fleszar

    Forschung

    • Netzwerk-Design-Probleme (z.B. Disjoint-Paths-Probleme)
    • Geometrische Optimierungsprobleme (z.B. Stabbing Probleme)
    • Lokationsprobleme (z.B. k-Median)

    Werdegang

    • seit Oktober 2016:

    Post-Doc an der Universidad de Chile und dem Max-Planck-Institut für Informatik in Saarbrücken

    • Oktober 2012 bis Oktober 2016:

    Wissenschaftlicher Mitarbeiter am Lehrstuhl für Informatik I, Universität Würzburg

    • bis September 2012:

    Studium der Informatik an der Universität Würzburg

    Veröffentlichungen

    • 1.
      Chan, T.M., Dijk, T.C.V., Fleszar, K., Spoerhase, J., Wolff, A.: Stabbing Rectangles by Line Segments – How Decomposition Reduces the Shallow-Cell Complexity. Submitted, (2018).
       
    • 2.
      Das, A., Fleszar, K., Kobourov, S., Spoerhase, J., Veeramoni, S., Wolff, A.: Approximating the Generalized Minimum Manhattan Network Problem. Algorithmica. 80, 1170–1190 (2018).
       
    • 3.
      Antoniadis, A., Fleszar, K., Hoeksma, R., Schewior, K.: A PTAS for Euclidean TSP with Hyperplane Neighborhoods. Submitted, (2018).
       
    • 4.
      Fleszar, K., Mnich, M., Spoerhase, J.: New algorithms for maximum disjoint paths based on tree-likeness. Mathematical Programming. (2017).
       
    • 5.
      Das, A., Fleszar, K., Kobourov, S., Spoerhase, J., Veeramoni, S., Wolff, A.: Approximating the Generalized Minimum Manhattan Network Problem. Algorithmica. 1–21 (2017).
       
    • 6.
      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).
       
    • 7.
      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–. Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik (2016).
       
    • 8.
      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).
       
    • 9.
      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).
       
    • 10.
      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).
       
    • 11.
      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).
       
    • 12.
      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).
       
    • 13.
      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).
       
    • 14.
      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).
       
    • 15.
      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).
       
    • 16.
      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).
       
    • 17.
      Fleszar, K.: Generalized Minimum Manhattan Networks, (2012).
       
    • 18.
      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).
       
    • 19.
      Fleszar, K.: Complementation of Multihead Automata, (2010).
       

    Lehrveranstaltungen

    Sommersemester 2016

    Wintersemester 2015/16

    Sommersemester 2015

    Wintersemester 2014/15

    Sommersemester 2014

    Wintersemester 2013/14

    Wintersemester 2012/13