default search action
Michal Opler
Person information
- affiliation: Czech Technical University, Prague, Czech Republic
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j4]Vít Jelínek, Michal Opler, Pavel Valtr:
Generalized Coloring of Permutations. Algorithmica 86(7): 2174-2210 (2024) - [c14]Foivos Fioravantes, Dusan Knop, Jan Matyás Kristan, Nikolaos Melissinos, Michal Opler:
Exact Algorithms and Lowerbounds for Multiagent Path Finding: Power of Treelike Topology. AAAI 2024: 17380-17388 - [c13]Michal Opler:
An Optimal Algorithm for Sorting Pattern-Avoiding Sequences. FOCS 2024: 689-699 - [c12]Vít Jelínek, Michal Opler, Jakub Pekárek:
The Hierarchy of Hereditary Sorting Operators. SODA 2024: 1447-1464 - [c11]Benjamin Aram Berendsohn
, László Kozma
Optimization with Pattern-Avoiding Input. STOC 2024: 671-682 - [i11]Michal Opler:
An Optimal Algorithm for Sorting Pattern-Avoiding Sequences. CoRR abs/2409.07868 (2024) - 2023
- [c10]Jaroslav Hancl, Adam Kabela, Michal Opler, Jakub Sosnovec, Robert Sámal, Pavel Valtr:
Improved Bounds for the Binary Paint Shop Problem. COCOON (2) 2023: 210-221 - [c9]Pavel Dvorák, Lukás Folwarczný, Michal Opler, Pavel Pudlák, Robert Sámal, Tung Anh Vu:
Bounds on Functionality and Symmetric Difference - Two Intriguing Graph Parameters. WG 2023: 305-318 - [i10]Pavel Dvorák, Lukás Folwarczný, Michal Opler, Pavel Pudlák, Robert Sámal, Tung Anh Vu:
Bounds on Functionality and Symmetric Difference - Two Intriguing Graph Parameters. CoRR abs/2302.11862 (2023) - [i9]Benjamin Aram Berendsohn, László Kozma, Michal Opler:
Optimization with pattern-avoiding input. CoRR abs/2310.04236 (2023) - [i8]Vít Jelínek, Michal Opler, Jakub Pekárek
The Hierarchy of Hereditary Sorting Operators. CoRR abs/2311.08727 (2023) - [i7]Foivos Fioravantes, Dusan Knop, Jan Matyás Kristan, Nikolaos Melissinos, Michal Opler:
Exact Algorithms and Lowerbounds for Multiagent Pathfinding: Power of Treelike Topology. CoRR abs/2312.09646 (2023) - 2021
- [j3]Michael Albert, Vít Jelínek
Two examples of Wilf-collapse. Discret. Math. Theor. Comput. Sci. 22(2) (2021) - [c8]Václav Blazej
On the Intersections of Non-homotopic Loops. CALDAM 2021: 196-205 - [c7]Václav Blazej
Non-homotopic Loops with a Bounded Number of Pairwise Intersections. GD 2021: 210-222 - [c6]Vít Jelínek
Long Paths Make Pattern-Counting Hard, and Deep Trees Make It Harder. IPEC 2021: 22:1-22:17 - [c5]Vít Jelínek
Griddings of Permutations and Hardness of Pattern Matching. MFCS 2021: 65:1-65:22 - [c4]Václav Blazej
Bears with Hats and Independence Polynomials. WG 2021: 283-295 - [i6]Václav Blazej, Pavel Dvorák, Michal Opler:
Bears with Hats and Independence Polynomials. CoRR abs/2103.07401 (2021) - [i5]Vít Jelínek, Michal Opler, Jakub Pekárek:
Griddings of permutations and hardness of pattern matching. CoRR abs/2107.10897 (2021) - [i4]Václav Blazej, Michal Opler, Matas Sileikis, Pavel Valtr:
Non-homotopic Loops with a Bounded Number of Pairwise Intersections. CoRR abs/2108.13953 (2021) - [i3]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
- [c3]Vít Jelínek
A Complexity Dichotomy for Permutation Pattern Matching on Grid Classes. MFCS 2020: 52:1-52:18 - [i2]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
- 2018
- [c2]Vít Jelínek
Generalized Coloring of Permutations. ESA 2018: 50:1-50:14 - 2017
- [j2]Vít Jelínek, Michal Opler:
Splittability and 1-amalgamability of permutation classes. Discret. Math. Theor. Comput. Sci. 19(2) (2017) - 2016
- [j1]Michal Opler
Major index distribution over permutation classes. Adv. Appl. Math. 80: 131-150 (2016) - [c1]Matej Konecný, Stanislav Kucera, Michal Opler, Jakub Sosnovec, Stepán Simsa, Martin Töpfer:
Squarability of rectangle arrangements. CCCG 2016: 101-106 - [i1]Matej Konecný, Stanislav Kucera, Michal Opler, Jakub Sosnovec, Stepán Simsa, Martin Töpfer:
Squarability of rectangle arrangements. CoRR abs/1611.07073 (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-12-10 21:40 CET 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: