Responsive image

Kristýna Pekárková

I am a fourth year PhD student at the Faculty of Informatics, Masaryk University, working under the supervision of Daniel Král' at the DIMEA laboratory.

kristyna.pekarkova at mail.muni.cz
Journal publications
  1. M. Briański, M. Koutecký, D. Kráľ, K. Pekárková, F. Schröder: Characterization of Matrices with Bounded Graver Bases and Depth Parameters and Applications to Integer Programming, Mathematical Programming 208, 2024, 497-531.
  2. F. Garbe, J. Hladký, G. Kun, K. Pekárková: Pattern-avoiding permutons and a removal lemma for permutations, accepted to Random Structures & Algorithms.
  3. T. F. N. Chan, J. W. Cooper, M. Koutecký, D. Kráľ, K. Pekárková: Matrices of optimal tree-depth and a row-invariant parameterized algorithm for integer programming, SIAM Journal on Computing 51, 2022, 664-700.

Conference proceedings
  1. D. Kráľ, K. Pekárková, K. Štorgel: Twin-width of graphs on surfaces, 49th International Symposium on Mathematical Foundations of Computer Science (MFCS 2024), Leibniz International Proceedings in Informatics (LIPIcs) vol. 306, article no. 66, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024, 15pp.
  2. M. Briański, M. Koutecký, D. Kráľ, K. Pekárková, F. Schröder: Characterization of Matrices with Bounded Graver Bases and Depth Parameters and Applications to Integer Programming, 49th International Colloquium Automata, Languages and Programming (ICALP'22), Leibniz International Proceedings in Informatics (LIPIcs) vol. 229, article no. 29, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, 20pp.
  3. T. F. N. Chan, J. W. Cooper, M. Koutecký, D. Kráľ, K. Pekárková: Matrices of optimal tree-depth and row-invariant parameterized algorithm for integer programming, 47th International Colloquium Automata, Languages and Programming (ICALP'20), Leibniz International Proceedings in Informatics (LIPIcs) vol. 168, article no. 26, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, 19pp.

Submitted papers
  1. M. Briański, D. Kráľ, K. Pekárková: Branch-depth is minor closure of contraction-deletion-depth, preprint arXiv:2402.16215.
Talks
04/24
Lunch Seminar at TU/e, Eindhoven University of Technology, Netherlands
06/23
Seminar on Nonlinear Algebra, Max Planck Institute for Mathematics in the Sciences, Leipzig
06/23
Algebra and Combinatorics seminar, Leipzig University
04/23
Noon Seminar, Faculty of Mathematics and Physics, Charles University, Prague
04/23
GGOAT Research Seminar, Faculty of Information Technology, Czech Technical University in Prague
04/23
Graphs and Matroids Seminar, online
03/23
PhD fest, Faculty of Informatics, Masaryk University, Brno
11/22
Algorithms seminar, Institute of Informatics, University of Warsaw
07/22
49th International Colloquium on Automata, Languages, and Programming (ICALP 2022), Paris
09/21
Současné trendy teoretické informatiky 2021 (STTI), Praha
12/20
GGOAT Research Seminar, Faculty of Information Technology, Czech Technical University in Prague
06/20
55th Czech-Slovak Conference on Graph Theory 2020 (CSGT), Brno
Invited participation at research workshops
11/23
2nd Workshop on Logic, Graphs, and Algorithms (LoGAlg), Warsaw, Poland
08/23
Focused Workshop on Combinatorics of Integer Programming 2023, Erdős Center, Hungary
07/22
Workshop: Advanced Optimization for Social Choice, Lorentz center, Leiden, Netherlands
03/22
Workshop: Interfaces of the Theory of Combinatorial Limits, Erdős Center, Hungary
09/21
Dagstuhl workshop on Sparsity in Algorithms, Combinatorics and Logic
Teaching
2023
teaching assistant in "Algorithms and Data Structures"
2019-2022
teaching assistant in "Mathematical Foundations of Computer Science"