default search action
Mateusz Rychlicki
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c8]Sebastian Ordyniak, Giacomo Paesani, Mateusz Rychlicki, Stefan Szeider
:
A General Theoretical Framework for Learning Smallest Interpretable Models. AAAI 2024: 10662-10669 - [c7]Robert Ganian, Haiko Müller, Sebastian Ordyniak, Giacomo Paesani, Mateusz Rychlicki:
A Tight Subexponential-Time Algorithm for Two-Page Book Embedding. ICALP 2024: 68:1-68:18 - [c6]Leif Eriksson, Victor Lagerkvist, Sebastian Ordyniak, George Osipov, Fahad Panolan, Mateusz Rychlicki:
Solving Quantified Boolean Formulas with Few Existential Variables. IJCAI 2024: 1889-1897 - [c5]Sebastian Ordyniak, Giacomo Paesani, Mateusz Rychlicki, Stefan Szeider:
Explaining Decisions in ML Models: A Parameterized Complexity Analysis. KR 2024 - [c4]Dibyayan Chakraborty, Haiko Müller, Sebastian Ordyniak, Fahad Panolan, Mateusz Rychlicki:
Covering and Partitioning of Split, Chain and Cographs with Isometric Paths. MFCS 2024: 39:1-39:14 - [i4]Robert Ganian, Haiko Müller, Sebastian Ordyniak, Giacomo Paesani, Mateusz Rychlicki:
A Tight Subexponential-time Algorithm for Two-Page Book Embedding. CoRR abs/2404.14087 (2024) - [i3]Leif Eriksson, Victor Lagerkvist, George Osipov, Sebastian Ordyniak, Fahad Panolan, Mateusz Rychlicki:
Solving Quantified Boolean Formulas with Few Existential Variables. CoRR abs/2405.06485 (2024) - [i2]Sebastian Ordyniak, Giacomo Paesani, Mateusz Rychlicki, Stefan Szeider:
Explaining Decisions in ML Models: a Parameterized Complexity Analysis. CoRR abs/2407.15780 (2024) - 2023
- [c3]Rupak Majumdar, Kaushik Mallik, Mateusz Rychlicki
A Flexible Toolchain for Symbolic Rabin Games under Fair and Stochastic Uncertainties. CAV (3) 2023: 3-15 - [c2]Rupak Majumdar
Poster Abstract: A Toolchain for Accelerated Symbolic Control. HSCC 2023: 28:1-28:2 - [c1]Jedrzej Olkowski, Michal Pilipczuk, Mateusz Rychlicki, Karol Wegrzycki
Dynamic Data Structures for Parameterized String Problems. STACS 2023: 50:1-50:22 - 2022
- [i1]Jedrzej Olkowski, Michal Pilipczuk, Mateusz Rychlicki
Dynamic data structures for parameterized string problems. CoRR abs/2205.00441 (2022)
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-19 22:11 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: