default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
Exact matches
- Michal Wlodarczyk 0001
University of Warsaw, Poland - Michal Wlodarczyk 0002
Lodz University of Technology, Poland
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 68 matches
- 2024
- Bart M. P. Jansen, Michal Wlodarczyk:
Optimal Polynomial-Time Compression for Boolean Max CSP. ACM Trans. Comput. Theory 16(1): 4:1-4:20 (2024) - 2023
- Ashwin Jacob, Michal Wlodarczyk, Meirav Zehavi:
Finding Long Directed Cycles Is Hard Even When DFVS Is Small or Girth Is Large. ESA 2023: 65:1-65:17 - Bart M. P. Jansen, Jari J. H. de Kroon, Michal Wlodarczyk:
5-Approximation for ℋ-Treewidth Essentially as Fast as ℋ-Deletion Parameterized by Solution Size. ESA 2023: 66:1-66:16 - Michal Wlodarczyk, Meirav Zehavi:
Planar Disjoint Paths, Treewidth, and Kernels. FOCS 2023: 649-662 - Michal Wlodarczyk:
Tight Bounds for Chordal/Interval Vertex Deletion Parameterized by Treewidth. ICALP 2023: 106:1-106:20 - Bart M. P. Jansen, Jari J. H. de Kroon, Michal Wlodarczyk:
Single-Exponential FPT Algorithms for Enumerating Secluded ℱ-Free Subgraphs and Deleting to Scattered Graph Classes. ISAAC 2023: 42:1-42:18 - Juhi Chaudhary, Harmender Gahlawat, Michal Wlodarczyk, Meirav Zehavi:
Kernels for the Disjoint Paths Problem on Subclasses of Chordal Graphs. IPEC 2023: 10:1-10:22 - Ioannis Koutis, Michal Wlodarczyk, Meirav Zehavi:
Sidestepping Barriers for Dominating Set in Parameterized Complexity. IPEC 2023: 31:1-31:17 - Ashwin Jacob, Michal Wlodarczyk, Meirav Zehavi:
Long Directed Detours: Reduction to 2-Disjoint Paths. CoRR abs/2301.06105 (2023) - Michal Wlodarczyk:
Tight Bounds for Chordal/Interval Vertex Deletion Parameterized by Treewidth. CoRR abs/2305.03440 (2023) - Bart M. P. Jansen, Jari J. H. de Kroon, Michal Wlodarczyk:
5-Approximation for $\mathcal{H}$-Treewidth Essentially as Fast as $\mathcal{H}$-Deletion Parameterized by Solution Size. CoRR abs/2306.17065 (2023) - Michal Wlodarczyk, Meirav Zehavi:
Planar Disjoint Paths, Treewidth, and Kernels. CoRR abs/2307.06792 (2023) - Ashwin Jacob, Michal Wlodarczyk, Meirav Zehavi:
Finding Long Directed Cycles Is Hard Even When DFVS Is Small Or Girth Is Large. CoRR abs/2308.06145 (2023) - Bart M. P. Jansen, Jari J. H. de Kroon, Michal Wlodarczyk:
Single-Exponential FPT Algorithms for Enumerating Secluded F-Free Subgraphs and Deleting to Scattered Graph Classes. CoRR abs/2309.11366 (2023) - Ioannis Koutis, Michal Wlodarczyk, Meirav Zehavi:
Sidestepping Barriers for Dominating Set in Parameterized Complexity. CoRR abs/2309.15645 (2023) - Juhi Chaudhary, Harmender Gahlawat, Michal Wlodarczyk, Meirav Zehavi:
Kernels for the Disjoint Paths Problem on Subclasses of Chordal Graphs. CoRR abs/2309.16892 (2023) - 2022
- Huib Donkers, Bart M. P. Jansen, Michal Wlodarczyk:
Preprocessing for Outerplanar Vertex Deletion: An Elementary Kernel of Quartic Size. Algorithmica 84(11): 3407-3458 (2022) - Bart M. P. Jansen, Michal Wlodarczyk:
Lossy planarization: a constant-factor approximate kernelization for planar vertex deletion. STOC 2022: 900-913 - Bart M. P. Jansen, Michal Wlodarczyk:
Lossy Planarization: A Constant-Factor Approximate Kernelization for Planar Vertex Deletion. CoRR abs/2202.02174 (2022) - 2021
- Szymon Plotka, Tomasz Wlodarczyk, Adam Klasa, Michal Lipa, Arkadiusz Sitek, Tomasz Trzcinski:
FetalNet: Multi-task Deep Learning Framework for Fetal Ultrasound Biometric Measurements. ICONIP (6) 2021: 257-265 - Huib Donkers, Bart M. P. Jansen, Michal Wlodarczyk:
Preprocessing for Outerplanar Vertex Deletion: An Elementary Kernel of Quartic Size. IPEC 2021: 14:1-14:18 - Bart M. P. Jansen, Shivesh Kumar Roy, Michal Wlodarczyk:
On the Hardness of Compressing Weights. MFCS 2021: 64:1-64:21 - Bart M. P. Jansen, Jari J. H. de Kroon, Michal Wlodarczyk:
Vertex deletion parameterized by elimination distance and even less. STOC 2021: 1757-1769 - Bart M. P. Jansen, Jari J. H. de Kroon, Michal Wlodarczyk:
Vertex Deletion Parameterized by Elimination Distance and Even Less. CoRR abs/2103.09715 (2021) - Bart M. P. Jansen, Shivesh Kumar Roy, Michal Wlodarczyk:
On the Hardness of Compressing Weights. CoRR abs/2107.02554 (2021) - Szymon Plotka, Tomasz Wlodarczyk, Adam Klasa, Michal Lipa, Arkadiusz Sitek, Tomasz Trzcinski:
FetalNet: Multi-task deep learning framework for fetal ultrasound biometric measurements. CoRR abs/2107.06943 (2021) - Huib Donkers, Bart M. P. Jansen, Michal Wlodarczyk:
Preprocessing for Outerplanar Vertex Deletion: An Elementary Kernel of Quartic Size. CoRR abs/2110.01868 (2021) - 2020
- Bart M. P. Jansen, Michal Wlodarczyk:
Optimal Polynomial-Time Compression for Boolean Max CSP. ESA 2020: 63:1-63:19 - Michal Wlodarczyk:
Parameterized Inapproximability for Steiner Orientation by Gap Amplification. ICALP 2020: 104:1-104:19 - Tomasz Wlodarczyk, Szymon Plotka, Przemyslaw Rokita, Nicole Sochacki-Wójcicka, Jakub Wójcicki, Michal Lipa, Tomasz Trzcinski:
Spontaneous Preterm Birth Prediction Using Convolutional Neural Networks. ASMUS/PIPPI@MICCAI 2020: 274-283
skipping 38 more matches
loading more results
failed to load more results, please try again later
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.
retrieved on 2024-09-21 02:36 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint