Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Michal Wlodarczyk 0001
@article{DBLP:journals/toct/JansenW24,
author = {Bart M. P. Jansen and
Michal Wlodarczyk},
title = {Optimal Polynomial-Time Compression for Boolean Max {CSP}},
journal = {{ACM} Trans. Comput. Theory},
volume = {16},
number = {1},
pages = {4:1--4:20},
year = {2024},
url = {https://doi.org/10.1145/3624704},
doi = {10.1145/3624704},
timestamp = {Mon, 01 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/toct/JansenW24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/Jacob0Z23,
author = {Ashwin Jacob and
Michal Wlodarczyk and
Meirav Zehavi},
editor = {Inge Li G{\o}rtz and
Martin Farach{-}Colton and
Simon J. Puglisi and
Grzegorz Herman},
title = {Finding Long Directed Cycles Is Hard Even When {DFVS} Is Small or
Girth Is Large},
booktitle = {31st Annual European Symposium on Algorithms, {ESA} 2023, September
4-6, 2023, Amsterdam, The Netherlands},
series = {LIPIcs},
volume = {274},
pages = {65:1--65:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.ESA.2023.65},
doi = {10.4230/LIPICS.ESA.2023.65},
timestamp = {Wed, 30 Aug 2023 15:40:45 +0200},
biburl = {https://dblp.org/rec/conf/esa/Jacob0Z23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/JansenK023,
author = {Bart M. P. Jansen and
Jari J. H. de Kroon and
Michal Wlodarczyk},
editor = {Inge Li G{\o}rtz and
Martin Farach{-}Colton and
Simon J. Puglisi and
Grzegorz Herman},
title = {5-Approximation for {\(\mathscr{H}\)}-Treewidth Essentially as Fast
as {\(\mathscr{H}\)}-Deletion Parameterized by Solution Size},
booktitle = {31st Annual European Symposium on Algorithms, {ESA} 2023, September
4-6, 2023, Amsterdam, The Netherlands},
series = {LIPIcs},
volume = {274},
pages = {66:1--66:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.ESA.2023.66},
doi = {10.4230/LIPICS.ESA.2023.66},
timestamp = {Wed, 30 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/esa/JansenK023.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/0001Z23,
author = {Michal Wlodarczyk and
Meirav Zehavi},
title = {Planar Disjoint Paths, Treewidth, and Kernels},
booktitle = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2023, Santa Cruz, CA, USA, November 6-9, 2023},
pages = {649--662},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/FOCS57990.2023.00044},
doi = {10.1109/FOCS57990.2023.00044},
timestamp = {Tue, 02 Jan 2024 14:56:14 +0100},
biburl = {https://dblp.org/rec/conf/focs/0001Z23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/000123b,
author = {Michal Wlodarczyk},
editor = {Kousha Etessami and
Uriel Feige and
Gabriele Puppis},
title = {Tight Bounds for Chordal/Interval Vertex Deletion Parameterized by
Treewidth},
booktitle = {50th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2023, July 10-14, 2023, Paderborn, Germany},
series = {LIPIcs},
volume = {261},
pages = {106:1--106:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2023.106},
doi = {10.4230/LIPICS.ICALP.2023.106},
timestamp = {Wed, 05 Jul 2023 16:19:52 +0200},
biburl = {https://dblp.org/rec/conf/icalp/000123b.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/JansenK023,
author = {Bart M. P. Jansen and
Jari J. H. de Kroon and
Michal Wlodarczyk},
editor = {Satoru Iwata and
Naonori Kakimura},
title = {Single-Exponential {FPT} Algorithms for Enumerating Secluded {\(\mathscr{F}\)}-Free
Subgraphs and Deleting to Scattered Graph Classes},
booktitle = {34th International Symposium on Algorithms and Computation, {ISAAC}
2023, December 3-6, 2023, Kyoto, Japan},
series = {LIPIcs},
volume = {283},
pages = {42:1--42:18},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2023.42},
doi = {10.4230/LIPICS.ISAAC.2023.42},
timestamp = {Tue, 28 Nov 2023 13:12:50 +0100},
biburl = {https://dblp.org/rec/conf/isaac/JansenK023.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/ChaudharyG0Z23,
author = {Juhi Chaudhary and
Harmender Gahlawat and
Michal Wlodarczyk and
Meirav Zehavi},
editor = {Neeldhara Misra and
Magnus Wahlstr{\"{o}}m},
title = {Kernels for the Disjoint Paths Problem on Subclasses of Chordal Graphs},
booktitle = {18th International Symposium on Parameterized and Exact Computation,
{IPEC} 2023, September 6-8, 2023, Amsterdam, The Netherlands},
series = {LIPIcs},
volume = {285},
pages = {10:1--10:22},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.IPEC.2023.10},
doi = {10.4230/LIPICS.IPEC.2023.10},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/iwpec/ChaudharyG0Z23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/Koutis0Z23,
author = {Ioannis Koutis and
Michal Wlodarczyk and
Meirav Zehavi},
editor = {Neeldhara Misra and
Magnus Wahlstr{\"{o}}m},
title = {Sidestepping Barriers for Dominating Set in Parameterized Complexity},
booktitle = {18th International Symposium on Parameterized and Exact Computation,
{IPEC} 2023, September 6-8, 2023, Amsterdam, The Netherlands},
series = {LIPIcs},
volume = {285},
pages = {31:1--31:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.IPEC.2023.31},
doi = {10.4230/LIPICS.IPEC.2023.31},
timestamp = {Wed, 13 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/iwpec/Koutis0Z23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2301-06105,
author = {Ashwin Jacob and
Michal Wlodarczyk and
Meirav Zehavi},
title = {Long Directed Detours: Reduction to 2-Disjoint Paths},
journal = {CoRR},
volume = {abs/2301.06105},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2301.06105},
doi = {10.48550/ARXIV.2301.06105},
eprinttype = {arXiv},
eprint = {2301.06105},
timestamp = {Thu, 19 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2301-06105.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2305-03440,
author = {Michal Wlodarczyk},
title = {Tight Bounds for Chordal/Interval Vertex Deletion Parameterized by
Treewidth},
journal = {CoRR},
volume = {abs/2305.03440},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2305.03440},
doi = {10.48550/ARXIV.2305.03440},
eprinttype = {arXiv},
eprint = {2305.03440},
timestamp = {Wed, 10 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2305-03440.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2306-17065,
author = {Bart M. P. Jansen and
Jari J. H. de Kroon and
Michal Wlodarczyk},
title = {5-Approximation for {\textdollar}{\textbackslash}mathcal\{H\}{\textdollar}-Treewidth
Essentially as Fast as {\textdollar}{\textbackslash}mathcal\{H\}{\textdollar}-Deletion
Parameterized by Solution Size},
journal = {CoRR},
volume = {abs/2306.17065},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2306.17065},
doi = {10.48550/ARXIV.2306.17065},
eprinttype = {arXiv},
eprint = {2306.17065},
timestamp = {Mon, 03 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2306-17065.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2307-06792,
author = {Michal Wlodarczyk and
Meirav Zehavi},
title = {Planar Disjoint Paths, Treewidth, and Kernels},
journal = {CoRR},
volume = {abs/2307.06792},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2307.06792},
doi = {10.48550/ARXIV.2307.06792},
eprinttype = {arXiv},
eprint = {2307.06792},
timestamp = {Mon, 24 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2307-06792.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2308-06145,
author = {Ashwin Jacob and
Michal Wlodarczyk and
Meirav Zehavi},
title = {Finding Long Directed Cycles Is Hard Even When {DFVS} Is Small Or
Girth Is Large},
journal = {CoRR},
volume = {abs/2308.06145},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2308.06145},
doi = {10.48550/ARXIV.2308.06145},
eprinttype = {arXiv},
eprint = {2308.06145},
timestamp = {Wed, 23 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2308-06145.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2309-11366,
author = {Bart M. P. Jansen and
Jari J. H. de Kroon and
Michal Wlodarczyk},
title = {Single-Exponential {FPT} Algorithms for Enumerating Secluded F-Free
Subgraphs and Deleting to Scattered Graph Classes},
journal = {CoRR},
volume = {abs/2309.11366},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2309.11366},
doi = {10.48550/ARXIV.2309.11366},
eprinttype = {arXiv},
eprint = {2309.11366},
timestamp = {Mon, 25 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2309-11366.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2309-15645,
author = {Ioannis Koutis and
Michal Wlodarczyk and
Meirav Zehavi},
title = {Sidestepping Barriers for Dominating Set in Parameterized Complexity},
journal = {CoRR},
volume = {abs/2309.15645},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2309.15645},
doi = {10.48550/ARXIV.2309.15645},
eprinttype = {arXiv},
eprint = {2309.15645},
timestamp = {Tue, 17 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2309-15645.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2309-16892,
author = {Juhi Chaudhary and
Harmender Gahlawat and
Michal Wlodarczyk and
Meirav Zehavi},
title = {Kernels for the Disjoint Paths Problem on Subclasses of Chordal Graphs},
journal = {CoRR},
volume = {abs/2309.16892},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2309.16892},
doi = {10.48550/ARXIV.2309.16892},
eprinttype = {arXiv},
eprint = {2309.16892},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2309-16892.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/DonkersJW22,
author = {Huib Donkers and
Bart M. P. Jansen and
Michal Wlodarczyk},
title = {Preprocessing for Outerplanar Vertex Deletion: An Elementary Kernel
of Quartic Size},
journal = {Algorithmica},
volume = {84},
number = {11},
pages = {3407--3458},
year = {2022},
url = {https://doi.org/10.1007/s00453-022-00984-2},
doi = {10.1007/S00453-022-00984-2},
timestamp = {Sun, 13 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/DonkersJW22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Jansen022,
author = {Bart M. P. Jansen and
Michal Wlodarczyk},
editor = {Stefano Leonardi and
Anupam Gupta},
title = {Lossy planarization: a constant-factor approximate kernelization for
planar vertex deletion},
booktitle = {{STOC} '22: 54th Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Rome, Italy, June 20 - 24, 2022},
pages = {900--913},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3519935.3520021},
doi = {10.1145/3519935.3520021},
timestamp = {Tue, 27 Dec 2022 09:06:31 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Jansen022.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2202-02174,
author = {Bart M. P. Jansen and
Michal Wlodarczyk},
title = {Lossy Planarization: {A} Constant-Factor Approximate Kernelization
for Planar Vertex Deletion},
journal = {CoRR},
volume = {abs/2202.02174},
year = {2022},
url = {https://arxiv.org/abs/2202.02174},
eprinttype = {arXiv},
eprint = {2202.02174},
timestamp = {Wed, 09 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2202-02174.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/DonkersJ021,
author = {Huib Donkers and
Bart M. P. Jansen and
Michal Wlodarczyk},
editor = {Petr A. Golovach and
Meirav Zehavi},
title = {Preprocessing for Outerplanar Vertex Deletion: An Elementary Kernel
of Quartic Size},
booktitle = {16th International Symposium on Parameterized and Exact Computation,
{IPEC} 2021, September 8-10, 2021, Lisbon, Portugal},
series = {LIPIcs},
volume = {214},
pages = {14:1--14:18},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.IPEC.2021.14},
doi = {10.4230/LIPICS.IPEC.2021.14},
timestamp = {Tue, 23 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/iwpec/DonkersJ021.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/JansenR021,
author = {Bart M. P. Jansen and
Shivesh Kumar Roy and
Michal Wlodarczyk},
editor = {Filippo Bonchi and
Simon J. Puglisi},
title = {On the Hardness of Compressing Weights},
booktitle = {46th International Symposium on Mathematical Foundations of Computer
Science, {MFCS} 2021, August 23-27, 2021, Tallinn, Estonia},
series = {LIPIcs},
volume = {202},
pages = {64:1--64:21},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.MFCS.2021.64},
doi = {10.4230/LIPICS.MFCS.2021.64},
timestamp = {Tue, 16 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/mfcs/JansenR021.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/JansenK021,
author = {Bart M. P. Jansen and
Jari J. H. de Kroon and
Michal Wlodarczyk},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {Vertex deletion parameterized by elimination distance and even less},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {1757--1769},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3451068},
doi = {10.1145/3406325.3451068},
timestamp = {Sat, 08 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/JansenK021.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2103-09715,
author = {Bart M. P. Jansen and
Jari J. H. de Kroon and
Michal Wlodarczyk},
title = {Vertex Deletion Parameterized by Elimination Distance and Even Less},
journal = {CoRR},
volume = {abs/2103.09715},
year = {2021},
url = {https://arxiv.org/abs/2103.09715},
eprinttype = {arXiv},
eprint = {2103.09715},
timestamp = {Thu, 01 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2103-09715.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2107-02554,
author = {Bart M. P. Jansen and
Shivesh Kumar Roy and
Michal Wlodarczyk},
title = {On the Hardness of Compressing Weights},
journal = {CoRR},
volume = {abs/2107.02554},
year = {2021},
url = {https://arxiv.org/abs/2107.02554},
eprinttype = {arXiv},
eprint = {2107.02554},
timestamp = {Tue, 16 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2107-02554.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2110-01868,
author = {Huib Donkers and
Bart M. P. Jansen and
Michal Wlodarczyk},
title = {Preprocessing for Outerplanar Vertex Deletion: An Elementary Kernel
of Quartic Size},
journal = {CoRR},
volume = {abs/2110.01868},
year = {2021},
url = {https://arxiv.org/abs/2110.01868},
eprinttype = {arXiv},
eprint = {2110.01868},
timestamp = {Fri, 08 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2110-01868.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/Jansen020,
author = {Bart M. P. Jansen and
Michal Wlodarczyk},
editor = {Fabrizio Grandoni and
Grzegorz Herman and
Peter Sanders},
title = {Optimal Polynomial-Time Compression for Boolean Max {CSP}},
booktitle = {28th Annual European Symposium on Algorithms, {ESA} 2020, September
7-9, 2020, Pisa, Italy (Virtual Conference)},
series = {LIPIcs},
volume = {173},
pages = {63:1--63:19},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.ESA.2020.63},
doi = {10.4230/LIPICS.ESA.2020.63},
timestamp = {Thu, 16 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/esa/Jansen020.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/000120,
author = {Michal Wlodarczyk},
editor = {Artur Czumaj and
Anuj Dawar and
Emanuela Merelli},
title = {Parameterized Inapproximability for Steiner Orientation by Gap Amplification},
booktitle = {47th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2020, July 8-11, 2020, Saarbr{\"{u}}cken, Germany (Virtual
Conference)},
series = {LIPIcs},
volume = {168},
pages = {104:1--104:19},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2020.104},
doi = {10.4230/LIPICS.ICALP.2020.104},
timestamp = {Thu, 16 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/000120.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/ByrkaDMMW20,
author = {Jaroslaw Byrka and
Szymon Dudycz and
Pasin Manurangsi and
Jan Marcinkowski and
Michal Wlodarczyk},
editor = {Christos Kaklamanis and
Asaf Levin},
title = {To Close Is Easier Than To Open: Dual Parameterization To k-Median},
booktitle = {Approximation and Online Algorithms - 18th International Workshop,
{WAOA} 2020, Virtual Event, September 9-10, 2020, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {12806},
pages = {113--126},
publisher = {Springer},
year = {2020},
url = {https://doi.org/10.1007/978-3-030-80879-2\_8},
doi = {10.1007/978-3-030-80879-2\_8},
timestamp = {Tue, 20 Jul 2021 15:29:23 +0200},
biburl = {https://dblp.org/rec/conf/waoa/ByrkaDMMW20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2002-03443,
author = {Bart M. P. Jansen and
Michal Wlodarczyk},
title = {Optimal polynomial-time compression for Boolean Max {CSP}},
journal = {CoRR},
volume = {abs/2002.03443},
year = {2020},
url = {https://arxiv.org/abs/2002.03443},
eprinttype = {arXiv},
eprint = {2002.03443},
timestamp = {Thu, 01 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2002-03443.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2011-08083,
author = {Jaroslaw Byrka and
Szymon Dudycz and
Pasin Manurangsi and
Jan Marcinkowski and
Michal Wlodarczyk},
title = {To Close Is Easier Than To Open: Dual Parameterization To k-Median},
journal = {CoRR},
volume = {abs/2011.08083},
year = {2020},
url = {https://arxiv.org/abs/2011.08083},
eprinttype = {arXiv},
eprint = {2011.08083},
timestamp = {Wed, 18 Nov 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2011-08083.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Wlodarczyk19,
author = {Michal Wlodarczyk},
title = {Clifford Algebras Meet Tree Decompositions},
journal = {Algorithmica},
volume = {81},
number = {2},
pages = {497--518},
year = {2019},
url = {https://doi.org/10.1007/s00453-018-0489-3},
doi = {10.1007/S00453-018-0489-3},
timestamp = {Sat, 30 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Wlodarczyk19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/sigecom/AdamczykW19,
author = {Marek Adamczyk and
Michal Wlodarczyk},
title = {Multi-dimensional mechanism design via random order contention resolution
schemes},
journal = {SIGecom Exch.},
volume = {17},
number = {2},
pages = {46--53},
year = {2019},
url = {https://doi.org/10.1145/3381329.3381334},
doi = {10.1145/3381329.3381334},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/sigecom/AdamczykW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/CyganMWW19,
author = {Marek Cygan and
Marcin Mucha and
Karol Wegrzycki and
Michal Wlodarczyk},
title = {On Problems Equivalent to (min, +)-Convolution},
journal = {{ACM} Trans. Algorithms},
volume = {15},
number = {1},
pages = {14:1--14:25},
year = {2019},
url = {https://doi.org/10.1145/3293465},
doi = {10.1145/3293465},
timestamp = {Tue, 16 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/talg/CyganMWW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/AdamczykBMM019,
author = {Marek Adamczyk and
Jaroslaw Byrka and
Jan Marcinkowski and
Syed Mohammad Meesum and
Michal Wlodarczyk},
editor = {Michael A. Bender and
Ola Svensson and
Grzegorz Herman},
title = {Constant-Factor {FPT} Approximation for Capacitated k-Median},
booktitle = {27th Annual European Symposium on Algorithms, {ESA} 2019, September
9-11, 2019, Munich/Garching, Germany},
series = {LIPIcs},
volume = {144},
pages = {1:1--1:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.ESA.2019.1},
doi = {10.4230/LIPICS.ESA.2019.1},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/esa/AdamczykBMM019.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/MuchaW019,
author = {Marcin Mucha and
Karol Wegrzycki and
Michal Wlodarczyk},
editor = {Timothy M. Chan},
title = {A Subquadratic Approximation Scheme for Partition},
booktitle = {Proceedings of the Thirtieth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2019, San Diego, California, USA, January 6-9,
2019},
pages = {70--88},
publisher = {{SIAM}},
year = {2019},
url = {https://doi.org/10.1137/1.9781611975482.5},
doi = {10.1137/1.9781611975482.5},
timestamp = {Tue, 16 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/MuchaW019.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/GuptaLLM019,
author = {Anupam Gupta and
Euiwoong Lee and
Jason Li and
Pasin Manurangsi and
Michal Wlodarczyk},
editor = {Timothy M. Chan},
title = {Losing Treewidth by Separating Subsets},
booktitle = {Proceedings of the Thirtieth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2019, San Diego, California, USA, January 6-9,
2019},
pages = {1731--1749},
publisher = {{SIAM}},
year = {2019},
url = {https://doi.org/10.1137/1.9781611975482.104},
doi = {10.1137/1.9781611975482.104},
timestamp = {Wed, 18 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/GuptaLLM019.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1907-06529,
author = {Michal Wlodarczyk},
title = {Inapproximability within {W[1]:} the case of Steiner Orientation},
journal = {CoRR},
volume = {abs/1907.06529},
year = {2019},
url = {http://arxiv.org/abs/1907.06529},
eprinttype = {arXiv},
eprint = {1907.06529},
timestamp = {Fri, 19 Jul 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1907-06529.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Adamczyk018,
author = {Marek Adamczyk and
Michal Wlodarczyk},
editor = {Mikkel Thorup},
title = {Random Order Contention Resolution Schemes},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {790--801},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00080},
doi = {10.1109/FOCS.2018.00080},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Adamczyk018.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1804-01366,
author = {Anupam Gupta and
Euiwoong Lee and
Jason Li and
Pasin Manurangsi and
Michal Wlodarczyk},
title = {Losing Treewidth by Separating Subsets},
journal = {CoRR},
volume = {abs/1804.01366},
year = {2018},
url = {http://arxiv.org/abs/1804.01366},
eprinttype = {arXiv},
eprint = {1804.01366},
timestamp = {Wed, 18 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1804-01366.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1804-02269,
author = {Marcin Mucha and
Karol Wegrzycki and
Michal Wlodarczyk},
title = {Subquadratic Approximation Scheme for Partition},
journal = {CoRR},
volume = {abs/1804.02269},
year = {2018},
url = {http://arxiv.org/abs/1804.02269},
eprinttype = {arXiv},
eprint = {1804.02269},
timestamp = {Wed, 24 Oct 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1804-02269.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1804-02584,
author = {Marek Adamczyk and
Michal Wlodarczyk},
title = {Random Order Contention Resolution Schemes},
journal = {CoRR},
volume = {abs/1804.02584},
year = {2018},
url = {http://arxiv.org/abs/1804.02584},
eprinttype = {arXiv},
eprint = {1804.02584},
timestamp = {Wed, 24 Oct 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1804-02584.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1807-10727,
author = {Jakub Lacki and
Vahab S. Mirrokni and
Michal Wlodarczyk},
title = {Connected Components at Scale via Local Contractions},
journal = {CoRR},
volume = {abs/1807.10727},
year = {2018},
url = {http://arxiv.org/abs/1807.10727},
eprinttype = {arXiv},
eprint = {1807.10727},
timestamp = {Wed, 24 Oct 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1807-10727.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1809-05791,
author = {Marek Adamczyk and
Jaroslaw Byrka and
Jan Marcinkowski and
Syed Mohammad Meesum and
Michal Wlodarczyk},
title = {Constant factor {FPT} approximation for capacitated k-median},
journal = {CoRR},
volume = {abs/1809.05791},
year = {2018},
url = {http://arxiv.org/abs/1809.05791},
eprinttype = {arXiv},
eprint = {1809.05791},
timestamp = {Thu, 02 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1809-05791.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/CyganMWW17,
author = {Marek Cygan and
Marcin Mucha and
Karol Wegrzycki and
Michal Wlodarczyk},
editor = {Ioannis Chatzigiannakis and
Piotr Indyk and
Fabian Kuhn and
Anca Muscholl},
title = {On Problems Equivalent to (min, +)-Convolution},
booktitle = {44th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2017, July 10-14, 2017, Warsaw, Poland},
series = {LIPIcs},
volume = {80},
pages = {22:1--22:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2017.22},
doi = {10.4230/LIPICS.ICALP.2017.22},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/icalp/CyganMWW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/AdamczykGLW17,
author = {Marek Adamczyk and
Fabrizio Grandoni and
Stefano Leonardi and
Michal Wlodarczyk},
editor = {Ioannis Chatzigiannakis and
Piotr Indyk and
Fabian Kuhn and
Anca Muscholl},
title = {When the Optimum is also Blind: a New Perspective on Universal Optimization},
booktitle = {44th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2017, July 10-14, 2017, Warsaw, Poland},
series = {LIPIcs},
volume = {80},
pages = {35:1--35:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2017.35},
doi = {10.4230/LIPICS.ICALP.2017.35},
timestamp = {Tue, 27 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/icalp/AdamczykGLW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sirocco/CzyzowiczGGKKRW17,
author = {Jurek Czyzowicz and
Konstantinos Georgiou and
Maxime Godon and
Evangelos Kranakis and
Danny Krizanc and
Wojciech Rytter and
Michal Wlodarczyk},
editor = {Shantanu Das and
S{\'{e}}bastien Tixeuil},
title = {Evacuation from a Disc in the Presence of a Faulty Robot},
booktitle = {Structural Information and Communication Complexity - 24th International
Colloquium, {SIROCCO} 2017, Porquerolles, France, June 19-22, 2017,
Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {10641},
pages = {158--173},
publisher = {Springer},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-72050-0\_10},
doi = {10.1007/978-3-319-72050-0\_10},
timestamp = {Tue, 14 May 2019 10:00:55 +0200},
biburl = {https://dblp.org/rec/conf/sirocco/CzyzowiczGGKKRW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/CyganMWW17,
author = {Marek Cygan and
Marcin Mucha and
Karol Wegrzycki and
Michal Wlodarczyk},
title = {On problems equivalent to (min, +)-convolution},
journal = {CoRR},
volume = {abs/1702.07669},
year = {2017},
url = {http://arxiv.org/abs/1702.07669},
eprinttype = {arXiv},
eprint = {1702.07669},
timestamp = {Wed, 24 Oct 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/CyganMWW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AdamczykGLW17,
author = {Marek Adamczyk and
Fabrizio Grandoni and
Stefano Leonardi and
Michal Wlodarczyk},
title = {When the Optimum is also Blind: a New Perspective on Universal Optimization},
journal = {CoRR},
volume = {abs/1707.01702},
year = {2017},
url = {http://arxiv.org/abs/1707.01702},
eprinttype = {arXiv},
eprint = {1707.01702},
timestamp = {Tue, 27 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/AdamczykGLW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/Wlodarczyk16,
author = {Michal Wlodarczyk},
editor = {Jiong Guo and
Danny Hermelin},
title = {Clifford Algebras Meet Tree Decompositions},
booktitle = {11th International Symposium on Parameterized and Exact Computation,
{IPEC} 2016, August 24-26, 2016, Aarhus, Denmark},
series = {LIPIcs},
volume = {63},
pages = {29:1--29:18},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.IPEC.2016.29},
doi = {10.4230/LIPICS.IPEC.2016.29},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/iwpec/Wlodarczyk16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/Wlodarczyk16,
author = {Michal Wlodarczyk},
title = {Clifford algebras meet tree decompositions},
journal = {CoRR},
volume = {abs/1609.07134},
year = {2016},
url = {http://arxiv.org/abs/1609.07134},
eprinttype = {arXiv},
eprint = {1609.07134},
timestamp = {Wed, 24 Oct 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/Wlodarczyk16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bmcsb/NienaltowskiWLK15,
author = {Karol Nienaltowski and
Michal Wlodarczyk and
Tomasz Lipniacki and
Michal Komorowski},
title = {Clustering reveals limits of parameter identifiability in multi-parameter
models of biochemical dynamics},
journal = {{BMC} Syst. Biol.},
volume = {9},
pages = {65},
year = {2015},
url = {https://doi.org/10.1186/s12918-015-0205-8},
doi = {10.1186/S12918-015-0205-8},
timestamp = {Tue, 05 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bmcsb/NienaltowskiWLK15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GrandoniKW15,
author = {Fabrizio Grandoni and
Tomasz Kociumaka and
Michal Wlodarczyk},
title = {An LP-rounding 2{\(\surd\)}2-approximation for restricted maximum
acyclic subgraph},
journal = {Inf. Process. Lett.},
volume = {115},
number = {2},
pages = {182--185},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2014.09.008},
doi = {10.1016/J.IPL.2014.09.008},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/GrandoniKW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/GrandoniKW14,
author = {Fabrizio Grandoni and
Tomasz Kociumaka and
Michal Wlodarczyk},
title = {An LP-Rounding {\textdollar}2{\textbackslash}sqrt\{2\}{\textdollar}
Approximation for Restricted Maximum Acyclic Subgraph},
journal = {CoRR},
volume = {abs/1405.0456},
year = {2014},
url = {http://arxiv.org/abs/1405.0456},
eprinttype = {arXiv},
eprint = {1405.0456},
timestamp = {Wed, 24 Oct 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/GrandoniKW14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
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.
last updated on 2024-04-25 05:46 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:
