Jakub Pekárek

Publication Activity (10 Years)

Years Active: 2016-2024
Publications (10 Years): 26

Top Topics

Subgraph Isomorphism

Pattern Matching

Minimum Spanning Trees

Top Venues

Electron. J. Comb.

Publications

Vít Jelínek, Michal Opler, Jakub Pekárek
The Hierarchy of Hereditary Sorting Operators. SODA (2024)
Zdenek Dvorák, Jakub Pekárek
Induced odd cycle packing number, independent sets, and chromatic number. J. Graph Theory 103 (3) (2023)
Vít Jelínek, Michal Opler, Jakub Pekárek
The Hierarchy of Hereditary Sorting Operators. CoRR (2023)
Zdenek Dvorák, Jakub Pekárek, Torsten Ueckerdt, Yelena Yuditsky
Weak Coloring Numbers of Intersection Graphs. SoCG (2022)
Zdenek Dvorák, Jakub Pekárek
Characterization of 4-critical triangle-free toroidal graphs. J. Comb. Theory, Ser. B 154 (2022)
Jakub Pekárek, Jean-Sébastien Sereni, Zelealem B. Yilma
The Minimum Number of Spanning Trees in Regular Multigraphs. Electron. J. Comb. 29 (4) (2022)
Vít Jelínek, Michal Opler, Jakub Pekárek
Long paths make pattern-counting hard, and deep trees make it harder. CoRR (2021)
Zdenek Dvorák, Jakub Pekárek
Coloring near-quadrangulations of the cylinder and the torus. Eur. J. Comb. 93 (2021)
Zdenek Dvorák, Jakub Pekárek, Torsten Ueckerdt, Yelena Yuditsky
Weak Coloring Numbers of Intersection Graphs. CoRR (2021)
Marthe Bonamy, Carla Groenland, Carole Muller, Jonathan Narboni, Jakub Pekárek, Alexandra Wesolek
A note on connected greedy edge colouring. Discret. Appl. Math. 304 (2021)
Vít Jelínek, Michal Opler, Jakub Pekárek
Griddings of permutations and hardness of pattern matching. CoRR (2021)
Vít Jelínek, Michal Opler, Jakub Pekárek
Long Paths Make Pattern-Counting Hard, and Deep Trees Make It Harder. IPEC (2021)
Vít Jelínek, Michal Opler, Jakub Pekárek
Griddings of Permutations and Hardness of Pattern Matching. MFCS (2021)
Zdenek Dvorák, Jakub Pekárek
Induced odd cycle packing number, independent sets, and chromatic number. CoRR (2020)
Vít Jelínek, Michal Opler, Jakub Pekárek
A Complexity Dichotomy for Permutation Pattern Matching on Grid Classes. CoRR (2020)
Zdenek Dvorák, Jakub Pekárek
Irreducible 4-critical triangle-free toroidal graphs. Eur. J. Comb. 88 (2020)
Vít Jelínek, Michal Opler, Jakub Pekárek
A Complexity Dichotomy for Permutation Pattern Matching on Grid Classes. MFCS (2020)
Zdenek Dvorák, Jakub Pekárek
Coloring near-quadrangulations of the cylinder and the torus. CoRR (2019)
Zdenek Dvorák, Jakub Pekárek, Jean-Sébastien Sereni
On Generalized Choice and Coloring Numbers. Electron. J. Comb. 26 (1) (2019)
Matej Konecný, Stanislav Kucera, Jana Novotná, Jakub Pekárek, Martin Smolík, Jakub Tetek, Martin Töpfer
On the Simultaneous Minimum Spanning Trees Problem. CALDAM (2018)
Matej Konecný, Stanislav Kucera, Jana Novotná, Jakub Pekárek, Stepán Simsa, Martin Töpfer
Minimal sum labeling of graphs. J. Discrete Algorithms (2018)
Zdenek Dvorák, Jakub Pekárek
Irreducible 4-critical triangle-free toroidal graphs. Electron. Notes Discret. Math. 61 (2017)
Matej Konecný, Stanislav Kucera, Jana Novotná, Jakub Pekárek, Stepán Simsa, Martin Töpfer
Minimal Sum Labeling of Graphs. IWOCA (2017)
Matej Konecný, Stanislav Kucera, Jana Novotná, Jakub Pekárek, Martin Smolík, Jakub Tetek, Martin Töpfer
On the Simultaneous Minimum Spanning Trees Problem. CoRR (2017)
Matej Konecný, Stanislav Kucera, Jana Novotná, Jakub Pekárek, Stepán Simsa, Martin Töpfer
Minimal Sum Labeling of Graphs. CoRR (2017)
Jakub Pekárek, Václav Dedic, Jan Franc, Eduard Belas, Martin Rejhon, Pavel Moravec, Jan Tous, Josef Voltr
Infrared LED Enhanced Spectroscopic CdZnTe Detector Working under High Fluxes of X-rays. Sensors 16 (10) (2016)