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

  • Approximating the Generalized Minimum {Manhattan} Network Problem. Das, Aparna; Fleszar, Krzysztof; Kobourov, Stephen; Spoerhase, Joachim; Veeramoni, Sankar; Wolff, Alexander. In Algorithmica, 80(4), pp. 1170–1190. 2018.
  • Stabbing Rectangles by Line Segments – How Decomposition Reduces the Shallow-Cell Complexity. Chan, Timothy M.; Dijk, Thomas C. Van; Fleszar, Krzysztof; Spoerhase, Joachim; Wolff, Alexander. Submitted. 2018.
  • A {PTAS} for {E}uclidean {TSP} with Hyperplane Neighborhoods. Antoniadis, Antonios; Fleszar, Krzysztof; Hoeksma, Ruben; Schewior, Kevin. Submitted. 2018.
  • New algorithms for maximum disjoint paths based on tree-likeness. Fleszar, Krzysztof; Mnich, Matthias; Spoerhase, Joachim. In Mathematical Programming. 2017.
  • Approximating the Generalized Minimum {M}anhattan Network Problem. Das, Aparna; Fleszar, Krzysztof; Kobourov, Stephen; Spoerhase, Joachim; Veeramoni, Sankar; Wolff, Alexander. In Algorithmica, pp. 1–21. 2017.
  • The Complexity of Drawing Graphs on Few Lines and Few Planes. Chaplick, Steven; Fleszar, Krzysztof; Lipp, Fabian; Ravsky, Alexander; Verbitsky, Oleg; Wolff, Alexander. 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.
  • New Algorithms for Maximum Disjoint Paths Based on Tree-Likeness. Fleszar, Krzysztof; Mnich, Matthias; Spoerhase, Joachim. 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. Evans, William S.; Fleszar, Krzysztof; Kindermann, Philipp; Saeedi, Noushin; Shin, Chan-Su; Wolff, Alexander. 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. Chaplick, Steven; Fleszar, Krzysztof; Lipp, Fabian; Ravsky, Alexander; Verbitsky, Oleg; Wolff, Alexander. 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. Bereg, Sergey; Fleszar, Krzysztof; Kindermann, Philipp; Pupyrev, Sergey; Spoerhase, Joachim; Wolff, Alexander. 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. Byrka, Jarosław; Fleszar, Krzysztof; Rybicki, Bartosz; Spoerhase, Joachim. In Proc. ACM-SIAM Symp. Discrete Algorithms (SODA’15). 2015.
  • Polylogarithmic Approximation for Generalized Minimum {Manhattan} Networks. Das, Aparna; Fleszar, Krzysztof; Kobourov, Stephen G.; Spoerhase, Joachim; Veeramoni, Sankar; Wolff, Alexander. In Proc. 29th Europ. Workshop Comput. Geom. (EuroCG’13), S. Fekete (ed.). Braunschweig, 2013.
  • Approximating the Generalized Minimum {Manhattan} Network Problem. Das, Aparna; Fleszar, Krzysztof; Kobourov, Stephen G.; Spoerhase, Joachim; Veeramoni, Sankar; Wolff, Alexander. 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. van Dijk, T. C.; Fleszar, K.; Haunert, J.-H.; Spoerhase, J. In Proc. 1st ACM SIGSPATIAL Int. Workshop MapInteraction (MapInteract’13), pp. 72–77. ACM, Orlando, Florida, 2013.
  • Generalized Minimum {M}anhattan Networks. Fleszar, Krzysztof. 2012, May.
  • Polylogarithmic Approximation for Generalized Minimum {Manhattan} Networks. Das, Aparna; Fleszar, Krzysztof; Kobourov, Stephen G.; Spoerhase, Joachim; Veeramoni, Sankar; Wolff, Alexander. 2012, April.
  • Structural Complexity of Multiobjective {NP} Search Problems. Fleszar, Krzysztof; Glaßer, Christian; Lipp, Fabian; Reitwießner, Christian; Witek, Maximilian. 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. Fleszar, Krzysztof; Glaßer, Christian; Lipp, Fabian; Reitwießner, Christian; Witek, Maximilian. In Electronic Colloquium Computat. Complexity (ECCC), 18, p. 53. 2011.
  • Complementation of Multihead Automata. Fleszar, Krzysztof. 2010, July.

Lehrveranstaltungen

Sommersemester 2016

Wintersemester 2015/16

Sommersemester 2015

Wintersemester 2014/15

Sommersemester 2014

Wintersemester 2013/14

Wintersemester 2012/13