default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKonrad Majewski
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j2]Konrad Majewski
, Tomás Masarík, Jana Masaríková, Karolina Okrasa, Marcin Pilipczuk, Pawel Rzazewski, Marek Sokolowski:
Max Weight Independent Set in Graphs with No Long Claws: An Analog of the Gyárfás' Path Argument. ACM Trans. Comput. Theory 16(2): 8:1-8:18 (2024)- [c7]Konrad Majewski, Michal Pilipczuk, Anna Zych-Pawlewicz:
Parameterized Dynamic Data Structure for Split Completion. ESA 2024: 87:1-87:17 - [c6]Lukasz Kowalik, Alexandra Lassota, Konrad Majewski, Michal Pilipczuk, Marek Sokolowski:
Detecting Points in Integer Cones of Polytopes is Double-Exponentially Hard. SOSA 2024: 279-285 - [i8]Konrad Majewski, Michal Pilipczuk, Anna Zych-Pawlewicz:
Parameterized dynamic data structure for Split Completion. CoRR abs/2402.08816 (2024) - 2023
- [j1]Marcin Brianski, Gwenaël Joret, Konrad Majewski, Piotr Micek, Michal T. Seweryn, Roohani Sharma:
Treedepth vs Circumference. Comb. 43(4): 659-664 (2023) - [c5]Tuukka Korhonen, Konrad Majewski, Wojciech Nadara, Michal Pilipczuk, Marek Sokolowski:
Dynamic treewidth. FOCS 2023: 1734-1744 - [c4]Meike Hatzel, Konrad Majewski, Michal Pilipczuk, Marek Sokolowski:
Simpler and faster algorithms for detours in planar digraphs. SOSA 2023: 156-165 - [c3]Konrad Majewski, Michal Pilipczuk, Marek Sokolowski:
Maintaining CMSO₂ Properties on Dynamic Structures with Bounded Feedback Vertex Number. STACS 2023: 46:1-46:13 - [i7]Meike Hatzel, Konrad Majewski, Michal Pilipczuk, Marek Sokolowski:
Simpler and faster algorithms for detours in planar digraphs. CoRR abs/2301.02421 (2023) - [i6]Tuukka Korhonen, Konrad Majewski, Wojciech Nadara, Michal Pilipczuk, Marek Sokolowski:
Dynamic treewidth. CoRR abs/2304.01744 (2023) - [i5]Lukasz Kowalik, Alexandra Lassota, Konrad Majewski, Michal Pilipczuk, Marek Sokolowski:
Detecting Points in Integer Cones of Polytopes is Double-Exponentially Hard. CoRR abs/2307.00406 (2023) - 2022
- [c2]Konrad Majewski, Tomás Masarík, Jana Novotná, Karolina Okrasa, Marcin Pilipczuk, Pawel Rzazewski, Marek Sokolowski:
Max Weight Independent Set in Graphs with No Long Claws: An Analog of the Gyárfás' Path Argument. ICALP 2022: 93:1-93:19 - [i4]Konrad Majewski, Tomás Masarík, Jana Novotná, Karolina Okrasa, Marcin Pilipczuk, Pawel Rzazewski, Marek Sokolowski:
Max Weight Independent Set in graphs with no long claws: An analog of the Gyárfás' path argument. CoRR abs/2203.04836 (2022) - [i3]Marcin Brianski, Gwenaël Joret, Konrad Majewski, Piotr Micek, Michal T. Seweryn, Roohani Sharma:
Treedepth vs circumference. CoRR abs/2211.11410 (2022) - 2021
- [i2]Konrad Majewski, Michal Pilipczuk, Marek Sokolowski:
Maintaining CMSO2 properties on dynamic structures with bounded feedback vertex number. CoRR abs/2107.06232 (2021) - 2020
- [c1]Lukasz Kowalik, Konrad Majewski:
The Asymmetric Travelling Salesman Problem In Sparse Digraphs. IPEC 2020: 23:1-23:18 - [i1]Lukasz Kowalik, Konrad Majewski:
The Asymmetric Travelling Salesman Problem in Sparse Digraphs. CoRR abs/2007.12120 (2020)
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-10-09 21:31 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:
