default search action
Michal Wlodarczyk 0001
Person information
- affiliation: University of Warsaw, Poland
- affiliation: Ben Gurion University of the Negev, Israel
- affiliation: Eindhoven University of Technology, The Netherlands
Other persons with the same name
- Michal Wlodarczyk 0002 — Lodz University of Technology, Poland
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
- [j9]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. J. Comput. Syst. Sci. 148: 103597 (2025) - 2024
- [j8]Ashwin Jacob
, Michal Wlodarczyk, Meirav Zehavi:
Long directed detours: Reduction to 2-Disjoint Paths. Inf. Process. Lett. 186: 106491 (2024) - [j7]Bart M. P. Jansen
Optimal Polynomial-Time Compression for Boolean Max CSP. ACM Trans. Comput. Theory 16(1): 4:1-4:20 (2024) - [i27]Michal Wlodarczyk:
Does Subset Sum Admit Short Proofs? CoRR abs/2409.03526 (2024) - [i26]Michal Wlodarczyk:
Constant Approximating Disjoint Paths on Acyclic Digraphs is W[1]-hard. CoRR abs/2409.03596 (2024) - [i25]Michal Wlodarczyk:
Losing Treewidth In The Presence Of Weights. CoRR abs/2410.06343 (2024) - 2023
- [c22]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 - [c21]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 - [c20]Michal Wlodarczyk, Meirav Zehavi:
Planar Disjoint Paths, Treewidth, and Kernels. FOCS 2023: 649-662 - [c19]Michal Wlodarczyk:
Tight Bounds for Chordal/Interval Vertex Deletion Parameterized by Treewidth. ICALP 2023: 106:1-106:20 - [c18]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 - [c17]Juhi Chaudhary
Kernels for the Disjoint Paths Problem on Subclasses of Chordal Graphs. IPEC 2023: 10:1-10:22 - [c16]Ioannis Koutis, Michal Wlodarczyk, Meirav Zehavi:
Sidestepping Barriers for Dominating Set in Parameterized Complexity. IPEC 2023: 31:1-31:17 - [i24]Ashwin Jacob, Michal Wlodarczyk, Meirav Zehavi:
Long Directed Detours: Reduction to 2-Disjoint Paths. CoRR abs/2301.06105 (2023) - [i23]Michal Wlodarczyk:
Tight Bounds for Chordal/Interval Vertex Deletion Parameterized by Treewidth. CoRR abs/2305.03440 (2023) - [i22]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) - [i21]Michal Wlodarczyk, Meirav Zehavi:
Planar Disjoint Paths, Treewidth, and Kernels. CoRR abs/2307.06792 (2023) - [i20]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) - [i19]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) - [i18]Ioannis Koutis, Michal Wlodarczyk, Meirav Zehavi:
Sidestepping Barriers for Dominating Set in Parameterized Complexity. CoRR abs/2309.15645 (2023) - [i17]Juhi Chaudhary
Kernels for the Disjoint Paths Problem on Subclasses of Chordal Graphs. CoRR abs/2309.16892 (2023) - 2022
- [j6]Huib Donkers, Bart M. P. Jansen
Preprocessing for Outerplanar Vertex Deletion: An Elementary Kernel of Quartic Size. Algorithmica 84(11): 3407-3458 (2022) - [c15]Bart M. P. Jansen, Michal Wlodarczyk:
Lossy planarization: a constant-factor approximate kernelization for planar vertex deletion. STOC 2022: 900-913 - [i16]Bart M. P. Jansen, Michal Wlodarczyk:
Lossy Planarization: A Constant-Factor Approximate Kernelization for Planar Vertex Deletion. CoRR abs/2202.02174 (2022) - 2021
- [c14]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 - [c13]Bart M. P. Jansen, Shivesh Kumar Roy, Michal Wlodarczyk:
On the Hardness of Compressing Weights. MFCS 2021: 64:1-64:21 - [c12]Bart M. P. Jansen
Vertex deletion parameterized by elimination distance and even less. STOC 2021: 1757-1769 - [i15]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) - [i14]Bart M. P. Jansen, Shivesh Kumar Roy, Michal Wlodarczyk:
On the Hardness of Compressing Weights. CoRR abs/2107.02554 (2021) - [i13]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
- [c11]Bart M. P. Jansen
Optimal Polynomial-Time Compression for Boolean Max CSP. ESA 2020: 63:1-63:19 - [c10]Michal Wlodarczyk
Parameterized Inapproximability for Steiner Orientation by Gap Amplification. ICALP 2020: 104:1-104:19 - [c9]Jaroslaw Byrka, Szymon Dudycz, Pasin Manurangsi, Jan Marcinkowski, Michal Wlodarczyk:
To Close Is Easier Than To Open: Dual Parameterization To k-Median. WAOA 2020: 113-126 - [i12]Bart M. P. Jansen, Michal Wlodarczyk:
Optimal polynomial-time compression for Boolean Max CSP. CoRR abs/2002.03443 (2020) - [i11]Jaroslaw Byrka, Szymon Dudycz, Pasin Manurangsi, Jan Marcinkowski, Michal Wlodarczyk:
To Close Is Easier Than To Open: Dual Parameterization To k-Median. CoRR abs/2011.08083 (2020)
2010 – 2019
- 2019
- [j5]Michal Wlodarczyk
Clifford Algebras Meet Tree Decompositions. Algorithmica 81(2): 497-518 (2019) - [j4]Marek Adamczyk, Michal Wlodarczyk:
Multi-dimensional mechanism design via random order contention resolution schemes. SIGecom Exch. 17(2): 46-53 (2019) - [j3]Marek Cygan, Marcin Mucha, Karol Wegrzycki
On Problems Equivalent to (min, +)-Convolution. ACM Trans. Algorithms 15(1): 14:1-14:25 (2019) - [c8]Marek Adamczyk, Jaroslaw Byrka
Constant-Factor FPT Approximation for Capacitated k-Median. ESA 2019: 1:1-1:14 - [c7]Marcin Mucha, Karol Wegrzycki
A Subquadratic Approximation Scheme for Partition. SODA 2019: 70-88 - [c6]Anupam Gupta, Euiwoong Lee
Losing Treewidth by Separating Subsets. SODA 2019: 1731-1749 - [i10]Michal Wlodarczyk:
Inapproximability within W[1]: the case of Steiner Orientation. CoRR abs/1907.06529 (2019) - 2018
- [c5]Marek Adamczyk, Michal Wlodarczyk:
Random Order Contention Resolution Schemes. FOCS 2018: 790-801 - [i9]Anupam Gupta, Euiwoong Lee, Jason Li, Pasin Manurangsi, Michal Wlodarczyk:
Losing Treewidth by Separating Subsets. CoRR abs/1804.01366 (2018) - [i8]Marcin Mucha, Karol Wegrzycki, Michal Wlodarczyk:
Subquadratic Approximation Scheme for Partition. CoRR abs/1804.02269 (2018) - [i7]Marek Adamczyk, Michal Wlodarczyk:
Random Order Contention Resolution Schemes. CoRR abs/1804.02584 (2018) - [i6]Jakub Lacki, Vahab S. Mirrokni, Michal Wlodarczyk:
Connected Components at Scale via Local Contractions. CoRR abs/1807.10727 (2018) - [i5]Marek Adamczyk, Jaroslaw Byrka, Jan Marcinkowski, Syed Mohammad Meesum, Michal Wlodarczyk:
Constant factor FPT approximation for capacitated k-median. CoRR abs/1809.05791 (2018) - 2017
- [c4]Marek Cygan
On Problems Equivalent to (min, +)-Convolution. ICALP 2017: 22:1-22:15 - [c3]Marek Adamczyk, Fabrizio Grandoni
When the Optimum is also Blind: a New Perspective on Universal Optimization. ICALP 2017: 35:1-35:15 - [c2]Jurek Czyzowicz, Konstantinos Georgiou, Maxime Godon, Evangelos Kranakis
Evacuation from a Disc in the Presence of a Faulty Robot. SIROCCO 2017: 158-173 - [i4]Marek Cygan, Marcin Mucha, Karol Wegrzycki, Michal Wlodarczyk:
On problems equivalent to (min, +)-convolution. CoRR abs/1702.07669 (2017) - [i3]Marek Adamczyk, Fabrizio Grandoni, Stefano Leonardi, Michal Wlodarczyk:
When the Optimum is also Blind: a New Perspective on Universal Optimization. CoRR abs/1707.01702 (2017) - 2016
- [c1]Michal Wlodarczyk:
Clifford Algebras Meet Tree Decompositions. IPEC 2016: 29:1-29:18 - [i2]Michal Wlodarczyk:
Clifford algebras meet tree decompositions. CoRR abs/1609.07134 (2016) - 2015
- [j2]Karol Nienaltowski, Michal Wlodarczyk, Tomasz Lipniacki
Clustering reveals limits of parameter identifiability in multi-parameter models of biochemical dynamics. BMC Syst. Biol. 9: 65 (2015) - [j1]Fabrizio Grandoni
An LP-rounding 2√2-approximation for restricted maximum acyclic subgraph. Inf. Process. Lett. 115(2): 182-185 (2015) - 2014
- [i1]Fabrizio Grandoni, Tomasz Kociumaka, Michal Wlodarczyk:
An LP-Rounding $2\sqrt{2}$ Approximation for Restricted Maximum Acyclic Subgraph. CoRR abs/1405.0456 (2014)
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-11-22 20:39 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: