default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJakub Pekárek
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c7]Vít Jelínek, Michal Opler, Jakub Pekárek:
The Hierarchy of Hereditary Sorting Operators. SODA 2024: 1447-1464- 2023
- [j10]Zdenek Dvorák, Jakub Pekárek
:
Induced odd cycle packing number, independent sets, and chromatic number. J. Graph Theory 103(3): 502-516 (2023) - [i9]Vít Jelínek, Michal Opler, Jakub Pekárek:
The Hierarchy of Hereditary Sorting Operators. CoRR abs/2311.08727 (2023) - 2022
- [j9]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) - [j8]Zdenek Dvorák, Jakub Pekárek:
Characterization of 4-critical triangle-free toroidal graphs. J. Comb. Theory B 154: 336-369 (2022) - [c6]Zdenek Dvorák, Jakub Pekárek, Torsten Ueckerdt, Yelena Yuditsky:
Weak Coloring Numbers of Intersection Graphs. SoCG 2022: 39:1-39:15 - 2021
- [j7]Marthe Bonamy, Carla Groenland, Carole Muller, Jonathan Narboni, Jakub Pekárek, Alexandra Wesolek:
A note on connected greedy edge colouring. Discret. Appl. Math. 304: 129-136 (2021) - [j6]Zdenek Dvorák, Jakub Pekárek:
Coloring near-quadrangulations of the cylinder and the torus. Eur. J. Comb. 93: 103258 (2021) - [c5]Vít Jelínek, Michal Opler, Jakub Pekárek:
Long Paths Make Pattern-Counting Hard, and Deep Trees Make It Harder. IPEC 2021: 22:1-22:17 - [c4]Vít Jelínek, Michal Opler, Jakub Pekárek:
Griddings of Permutations and Hardness of Pattern Matching. MFCS 2021: 65:1-65:22 - [i8]Zdenek Dvorák, Jakub Pekárek, Torsten Ueckerdt, Yelena Yuditsky:
Weak Coloring Numbers of Intersection Graphs. CoRR abs/2103.17094 (2021) - [i7]Vít Jelínek, Michal Opler, Jakub Pekárek:
Griddings of permutations and hardness of pattern matching. CoRR abs/2107.10897 (2021) - [i6]Vít Jelínek, Michal Opler, Jakub Pekárek:
Long paths make pattern-counting hard, and deep trees make it harder. CoRR abs/2111.03479 (2021) - 2020
- [j5]Zdenek Dvorák, Jakub Pekárek:
Irreducible 4-critical triangle-free toroidal graphs. Eur. J. Comb. 88: 103112 (2020) - [c3]Vít Jelínek, Michal Opler, Jakub Pekárek:
A Complexity Dichotomy for Permutation Pattern Matching on Grid Classes. MFCS 2020: 52:1-52:18 - [i5]Zdenek Dvorák, Jakub Pekárek:
Induced odd cycle packing number, independent sets, and chromatic number. CoRR abs/2001.02411 (2020) - [i4]Vít Jelínek, Michal Opler, Jakub Pekárek:
A Complexity Dichotomy for Permutation Pattern Matching on Grid Classes. CoRR abs/2008.04593 (2020)
2010 – 2019
- 2019
- [j4]Zdenek Dvorák, Jakub Pekárek, Jean-Sébastien Sereni:
On Generalized Choice and Coloring Numbers. Electron. J. Comb. 26(1): 1 (2019) - [i3]Zdenek Dvorák, Jakub Pekárek:
Coloring near-quadrangulations of the cylinder and the torus. CoRR abs/1909.12015 (2019) - 2018
- [j3]Matej Konecný, Stanislav Kucera, Jana Novotná, Jakub Pekárek, Stepán Simsa, Martin Töpfer:
Minimal sum labeling of graphs. J. Discrete Algorithms 52-53: 29-37 (2018) - [c2]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: 235-248 - 2017
- [j2]Zdenek Dvorák, Jakub Pekárek:
Irreducible 4-critical triangle-free toroidal graphs. Electron. Notes Discret. Math. 61: 383-389 (2017) - [c1]Matej Konecný, Stanislav Kucera, Jana Novotná, Jakub Pekárek, Stepán Simsa, Martin Töpfer:
Minimal Sum Labeling of Graphs. IWOCA 2017: 252-263 - [i2]Matej Konecný, Stanislav Kucera, Jana Novotná, Jakub Pekárek, Stepán Simsa, Martin Töpfer:
Minimal Sum Labeling of Graphs. CoRR abs/1708.00552 (2017) - [i1]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 abs/1712.00253 (2017) - 2016
- [j1]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): 1591 (2016)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 20:30 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
