Fleszar, Krzysztof
MSc Krzysztof Fleszar
Adresse
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
-
Stabbing Rectangles by Line Segments – How Decomposition Reduces the Shallow-Cell Complexity (2018). Submitted
- [ BibTeX ]
-
Approximating the Generalized Minimum {Manhattan} Network Problem in Algorithmica (2018). 80(4) 1170–1190.
-
A {PTAS} for {E}uclidean {TSP} with Hyperplane Neighborhoods (2018). Submitted
-
New algorithms for maximum disjoint paths based on tree-likeness in Mathematical Programming (2017).
-
Approximating the Generalized Minimum {M}anhattan Network Problem in Algorithmica (2017). 1–21.
- [ BibTeX ]
-
The Complexity of Drawing Graphs on Few Lines and Few Planes in Proc. Algorithms Data Struct. Symp. (WADS’17), Lecture Notes in Computer Science, F. Ellen, A. Kolokolova, J.-R. Sack (eds.) (2017).
- [ BibTeX ]
-
New Algorithms for Maximum Disjoint Paths Based on Tree-Likeness in 24th Europ. Symp. Algorithms (ESA’16), Leibniz International Proceedings in Informatics (LIPIcs), P. Sankowski, C. Zaroliagis (eds.) (2016). (Vol. 57) 42:1–42:17.
-
Minimum Rectilinear Polygons for Given Angle Sequences in Proc. Japan. Conf. Discrete Comput. Geom. Graphs (JCDCGG’15), Lecture Notes in Computer Science, J. Akiyama, H. Ito, T. Sakai (eds.) (2016). (Vol. 9943) 105–119.
-
Drawing Graphs on Few Lines and Few Planes in Proc. 24th Int. Symp. Graph Drawing & Network Vis. (GD’16), Lecture Notes in Computer Science, Y. Hu, M. N{"o}llenburg (eds.) (2016). (Vol. 9801) 166–180.
-
Colored Non-Crossing {E}uclidean {S}teiner Forest in Proc. 26th Int. Symp. Algorithms Comput. (ISAAC’15), Lecture Notes in Computer Science, K. Elbassioni, K. Makino (eds.) (2015). (Vol. 9472) 429–441.
-
Bi-Factor Approximation Algorithms for Hard Capacitated k-Median Problems in Proc. ACM-SIAM Symp. Discrete Algorithms (SODA’15) (2015).
-
Approximating the Generalized Minimum {Manhattan} Network Problem. in Proc. 24th Int. Symp. Algorithms Comput. (ISAAC’13), Lecture Notes in Computer Science, L. Cai, S.-W. Cheng, T. W. Lam (eds.) (2013). (Vol. 8283) 722–732.
-
Road Segment Selection with Strokes and Stability in Proc. 1st ACM SIGSPATIAL Int. Workshop MapInteraction (MapInteract’13) (2013). 72–77.
-
Polylogarithmic Approximation for Generalized Minimum {Manhattan} Networks in Proc. 29th Europ. Workshop Comput. Geom. (EuroCG’13), S. Fekete (ed.) (2013).
- [ BibTeX ]
-
Structural Complexity of Multiobjective {NP} Search Problems in Proc. 10th Latin American Symp. Theoretical Informatics (LATIN’12), Lecture Notes in Computer Science, D. Fernández-Baca (ed.) (2012). (Vol. 7256) 338–349.
-
Polylogarithmic Approximation for Generalized Minimum {Manhattan} Networks (2012, April).
-
Generalized Minimum {M}anhattan Networks (2012, May).
- [ BibTeX ]
-
The Complexity of Solving Multiobjective Optimization Problems and its Relation to Multivalued Functions in Electronic Colloquium Computat. Complexity (ECCC) (2011). 18 53.
-
Complementation of Multihead Automata (2010, July).
Lehrveranstaltungen
Sommersemester 2016
- Übungen zu Exakte Algorithmen
- Seminar zu Entwurf und Analyse von Datenstrukturen
Wintersemester 2015/16
- Übungen zu Algorithmen und Datenstrukturen
Sommersemester 2015
- Seminar zu Entwurf und Analyse von Datenstrukturen
Wintersemester 2014/15
- Übungen zu Algorithmen und Datenstrukturen
Sommersemester 2014
- Übungen zu Exakte Algorithmen
Wintersemester 2013/14
- Übungen zu Algorithmen und Datenstrukturen
Wintersemester 2012/13
- Übungen zu Algorithmische Geometrie