Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Marek Cygan
@article{DBLP:journals/access/FilipiakZTFC24,
author = {Dominik Filipiak and
Andrzej Zapala and
Piotr Tempczyk and
Anna Fensel and
Marek Cygan},
title = {Polite Teacher: Semi-Supervised Instance Segmentation With Mutual
Learning and Pseudo-Label Thresholding},
journal = {{IEEE} Access},
volume = {12},
pages = {37744--37756},
year = {2024},
url = {https://doi.org/10.1109/ACCESS.2024.3374073},
doi = {10.1109/ACCESS.2024.3374073},
timestamp = {Mon, 01 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/access/FilipiakZTFC24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2402-07871,
author = {Jakub Krajewski and
Jan Ludziejewski and
Kamil Adamczewski and
Maciej Pi{\'{o}}ro and
Michal Krutul and
Szymon Antoniak and
Kamil Ciebiera and
Krystian Kr{\'{o}}l and
Tomasz Odrzyg{\'{o}}zdz and
Piotr Sankowski and
Marek Cygan and
Sebastian Jaszczur},
title = {Scaling Laws for Fine-Grained Mixture of Experts},
journal = {CoRR},
volume = {abs/2402.07871},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2402.07871},
doi = {10.48550/ARXIV.2402.07871},
eprinttype = {arXiv},
eprint = {2402.07871},
timestamp = {Mon, 19 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2402-07871.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2403-00514,
author = {Michal Nauman and
Michal Bortkiewicz and
Mateusz Ostaszewski and
Piotr Milos and
Tomasz Trzcinski and
Marek Cygan},
title = {Overestimation, Overfitting, and Plasticity in Actor-Critic: the Bitter
Lesson of Reinforcement Learning},
journal = {CoRR},
volume = {abs/2403.00514},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2403.00514},
doi = {10.48550/ARXIV.2403.00514},
eprinttype = {arXiv},
eprint = {2403.00514},
timestamp = {Tue, 02 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2403-00514.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2403-01014,
author = {Michal Nauman and
Mateusz Ostaszewski and
Marek Cygan},
title = {A Case for Validation Buffer in Pessimistic Actor-Critic},
journal = {CoRR},
volume = {abs/2403.01014},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2403.01014},
doi = {10.48550/ARXIV.2403.01014},
eprinttype = {arXiv},
eprint = {2403.01014},
timestamp = {Tue, 02 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2403-01014.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icml/NaumanC23,
author = {Michal Nauman and
Marek Cygan},
editor = {Andreas Krause and
Emma Brunskill and
Kyunghyun Cho and
Barbara Engelhardt and
Sivan Sabato and
Jonathan Scarlett},
title = {On Many-Actions Policy Gradient},
booktitle = {International Conference on Machine Learning, {ICML} 2023, 23-29 July
2023, Honolulu, Hawaii, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {202},
pages = {25769--25789},
publisher = {{PMLR}},
year = {2023},
url = {https://proceedings.mlr.press/v202/nauman23a.html},
timestamp = {Mon, 28 Aug 2023 17:23:08 +0200},
biburl = {https://dblp.org/rec/conf/icml/NaumanC23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2303-04452,
author = {Piotr Krzywicki and
Krzysztof Ciebiera and
Rafal Michaluk and
Inga Maziarz and
Marek Cygan},
title = {Grasping Student: semi-supervised learning for robotic manipulation},
journal = {CoRR},
volume = {abs/2303.04452},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2303.04452},
doi = {10.48550/ARXIV.2303.04452},
eprinttype = {arXiv},
eprint = {2303.04452},
timestamp = {Wed, 15 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2303-04452.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2310-15961,
author = {Szymon Antoniak and
Sebastian Jaszczur and
Michal Krutul and
Maciej Pi{\'{o}}ro and
Jakub Krajewski and
Jan Ludziejewski and
Tomasz Odrzyg{\'{o}}zdz and
Marek Cygan},
title = {Mixture of Tokens: Efficient LLMs through Cross-Example Aggregation},
journal = {CoRR},
volume = {abs/2310.15961},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2310.15961},
doi = {10.48550/ARXIV.2310.15961},
eprinttype = {arXiv},
eprint = {2310.15961},
timestamp = {Tue, 31 Oct 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2310-15961.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2310-19527,
author = {Michal Nauman and
Marek Cygan},
title = {Decoupled Actor-Critic},
journal = {CoRR},
volume = {abs/2310.19527},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2310.19527},
doi = {10.48550/ARXIV.2310.19527},
eprinttype = {arXiv},
eprint = {2310.19527},
timestamp = {Fri, 03 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2310-19527.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ChattopadhyayCRW22,
author = {Arkadev Chattopadhyay and
Marek Cygan and
Noga Ron{-}Zewi and
Christian Wulff{-}Nilsen},
title = {Special Section on the Fifty-Second Annual {ACM} Symposium on the
Theory of Computing {(STOC} 2020)},
journal = {{SIAM} J. Comput.},
volume = {51},
number = {3},
pages = {20},
year = {2022},
url = {https://doi.org/10.1137/22n975494},
doi = {10.1137/22N975494},
timestamp = {Fri, 12 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/ChattopadhyayCRW22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/CyganNPPRW22,
author = {Marek Cygan and
Jesper Nederlof and
Marcin Pilipczuk and
Michal Pilipczuk and
Johan M. M. van Rooij and
Jakub Onufry Wojtaszczyk},
title = {Solving Connectivity Problems Parameterized by Treewidth in Single
Exponential Time},
journal = {{ACM} Trans. Algorithms},
volume = {18},
number = {2},
pages = {17:1--17:31},
year = {2022},
url = {https://doi.org/10.1145/3506707},
doi = {10.1145/3506707},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/talg/CyganNPPRW22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2207-13167,
author = {Piotr Tempczyk and
Ksawery Smoczynski and
Philip Smolenski{-}Jensen and
Marek Cygan},
title = {One Simple Trick to Fix Your Bayesian Neural Network},
journal = {CoRR},
volume = {abs/2207.13167},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2207.13167},
doi = {10.48550/ARXIV.2207.13167},
eprinttype = {arXiv},
eprint = {2207.13167},
timestamp = {Tue, 02 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2207-13167.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2210-13011,
author = {Michal Nauman and
Marek Cygan},
title = {On All-Action Policy Gradients},
journal = {CoRR},
volume = {abs/2210.13011},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2210.13011},
doi = {10.48550/ARXIV.2210.13011},
eprinttype = {arXiv},
eprint = {2210.13011},
timestamp = {Fri, 28 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2210-13011.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2211-03850,
author = {Dominik Filipiak and
Andrzej Zapala and
Piotr Tempczyk and
Anna Fensel and
Marek Cygan},
title = {Polite Teacher: Semi-Supervised Instance Segmentation with Mutual
Learning and Pseudo-Label Thresholding},
journal = {CoRR},
volume = {abs/2211.03850},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2211.03850},
doi = {10.48550/ARXIV.2211.03850},
eprinttype = {arXiv},
eprint = {2211.03850},
timestamp = {Wed, 09 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2211-03850.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/CyganKLPPSW21,
author = {Marek Cygan and
Pawel Komosa and
Daniel Lokshtanov and
Marcin Pilipczuk and
Michal Pilipczuk and
Saket Saurabh and
Magnus Wahlstr{\"{o}}m},
title = {Randomized Contractions Meet Lean Decompositions},
journal = {{ACM} Trans. Algorithms},
volume = {17},
number = {1},
pages = {6:1--6:30},
year = {2021},
url = {https://doi.org/10.1145/3426738},
doi = {10.1145/3426738},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/talg/CyganKLPPSW21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/CyganKMNR21,
author = {Marek Cygan and
Alexander S. Kulikov and
Ivan Mihajlin and
Maksim Nikolaev and
Grigory Reznikov},
editor = {Petra Mutzel and
Rasmus Pagh and
Grzegorz Herman},
title = {Minimum Common String Partition: Exact Algorithms},
booktitle = {29th Annual European Symposium on Algorithms, {ESA} 2021, September
6-8, 2021, Lisbon, Portugal (Virtual Conference)},
series = {LIPIcs},
volume = {204},
pages = {35:1--35:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ESA.2021.35},
doi = {10.4230/LIPICS.ESA.2021.35},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/esa/CyganKMNR21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2112-07528,
author = {Dominik Filipiak and
Piotr Tempczyk and
Marek Cygan},
title = {n-CPS: Generalising Cross Pseudo Supervision to n networks for Semi-Supervised
Semantic Segmentation},
journal = {CoRR},
volume = {abs/2112.07528},
year = {2021},
url = {https://arxiv.org/abs/2112.07528},
eprinttype = {arXiv},
eprint = {2112.07528},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2112-07528.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ChalermsookCKLM20,
author = {Parinya Chalermsook and
Marek Cygan and
Guy Kortsarz and
Bundit Laekhanukit and
Pasin Manurangsi and
Danupon Nanongkai and
Luca Trevisan},
title = {From Gap-Exponential Time Hypothesis to Fixed Parameter Tractable
Inapproximability: Clique, Dominating Set, and More},
journal = {{SIAM} J. Comput.},
volume = {49},
number = {4},
pages = {772--810},
year = {2020},
url = {https://doi.org/10.1137/18M1166869},
doi = {10.1137/18M1166869},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/ChalermsookCKLM20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/BliznetsCKPM20,
author = {Ivan Bliznets and
Marek Cygan and
Pawel Komosa and
Michal Pilipczuk and
Luk{\'{a}}s Mach},
title = {Lower Bounds for the Parameterized Complexity of Minimum Fill-in and
Other Completion Problems},
journal = {{ACM} Trans. Algorithms},
volume = {16},
number = {2},
pages = {25:1--25:31},
year = {2020},
url = {https://doi.org/10.1145/3381426},
doi = {10.1145/3381426},
timestamp = {Tue, 26 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/talg/BliznetsCKPM20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/HalldorssonKC20,
author = {Magn{\'{u}}s M. Halld{\'{o}}rsson and
Guy Kortsarz and
Marek Cygan},
editor = {Christos Kaklamanis and
Asaf Levin},
title = {Tight Bounds on Subexponential Time Approximation of Set Cover and
Related Problems},
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 = {159--173},
publisher = {Springer},
year = {2020},
url = {https://doi.org/10.1007/978-3-030-80879-2\_11},
doi = {10.1007/978-3-030-80879-2\_11},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/waoa/HalldorssonKC20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2008-05374,
author = {Marek Cygan and
Magn{\'{u}}s M. Halld{\'{o}}rsson and
Guy Kortsarz},
title = {Tight Bounds on Subexponential Time Approximation of Set Cover and
Related Problems},
journal = {CoRR},
volume = {abs/2008.05374},
year = {2020},
url = {https://arxiv.org/abs/2008.05374},
eprinttype = {arXiv},
eprint = {2008.05374},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2008-05374.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/CyganLPPS19,
author = {Marek Cygan and
Daniel Lokshtanov and
Marcin Pilipczuk and
Michal Pilipczuk and
Saket Saurabh},
title = {Minimum Bisection Is Fixed-Parameter Tractable},
journal = {{SIAM} J. Comput.},
volume = {48},
number = {2},
pages = {417--450},
year = {2019},
url = {https://doi.org/10.1137/140988553},
doi = {10.1137/140988553},
timestamp = {Thu, 23 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/CyganLPPS19.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}
}
@article{DBLP:journals/talg/CyganKS19,
author = {Marek Cygan and
Lukasz Kowalik and
Arkadiusz Socala},
title = {Improving {TSP} Tours Using Dynamic Programming over Tree Decompositions},
journal = {{ACM} Trans. Algorithms},
volume = {15},
number = {4},
pages = {54:1--54:19},
year = {2019},
url = {https://doi.org/10.1145/3341730},
doi = {10.1145/3341730},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/CyganKS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/CyganKN18,
author = {Marek Cygan and
Stefan Kratsch and
Jesper Nederlof},
title = {Fast Hamiltonicity Checking Via Bases of Perfect Matchings},
journal = {J. {ACM}},
volume = {65},
number = {3},
pages = {12:1--12:46},
year = {2018},
url = {https://doi.org/10.1145/3148227},
doi = {10.1145/3148227},
timestamp = {Sat, 08 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/CyganKN18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jair/CyganKSS18,
author = {Marek Cygan and
Lukasz Kowalik and
Arkadiusz Socala and
Krzysztof Sornat},
title = {Approximation and Parameterized Complexity of Minimax Approval Voting},
journal = {J. Artif. Intell. Res.},
volume = {63},
pages = {495--513},
year = {2018},
url = {https://doi.org/10.1613/jair.1.11253},
doi = {10.1613/JAIR.1.11253},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jair/CyganKSS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toct/BliznetsCKP18,
author = {Ivan Bliznets and
Marek Cygan and
Pawel Komosa and
Michal Pilipczuk},
title = {Hardness of Approximation for \emph{H}-free Edge Modification Problems},
journal = {{ACM} Trans. Comput. Theory},
volume = {10},
number = {2},
pages = {9:1--9:32},
year = {2018},
url = {https://doi.org/10.1145/3196834},
doi = {10.1145/3196834},
timestamp = {Mon, 08 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/toct/BliznetsCKP18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/CyganCMS18,
author = {Marek Cygan and
Artur Czumaj and
Marcin Mucha and
Piotr Sankowski},
editor = {Yossi Azar and
Hannah Bast and
Grzegorz Herman},
title = {Online Facility Location with Deletions},
booktitle = {26th Annual European Symposium on Algorithms, {ESA} 2018, August 20-22,
2018, Helsinki, Finland},
series = {LIPIcs},
volume = {112},
pages = {21:1--21:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.ESA.2018.21},
doi = {10.4230/LIPICS.ESA.2018.21},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/esa/CyganCMS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1802-05992,
author = {Maciej Jaskowski and
Jakub Swiatkowski and
Michal Zajac and
Maciej Klimek and
Jarek Potiuk and
Piotr Rybicki and
Piotr Polatowski and
Przemyslaw Walczyk and
Kacper Nowicki and
Marek Cygan},
title = {Improved {GQ-CNN:} Deep Learning Model for Planning Robust Grasps},
journal = {CoRR},
volume = {abs/1802.05992},
year = {2018},
url = {http://arxiv.org/abs/1802.05992},
eprinttype = {arXiv},
eprint = {1802.05992},
timestamp = {Fri, 23 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1802-05992.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1807-03839,
author = {Marek Cygan and
Artur Czumaj and
Marcin Mucha and
Piotr Sankowski},
title = {Online Facility Location with Deletions},
journal = {CoRR},
volume = {abs/1807.03839},
year = {2018},
url = {http://arxiv.org/abs/1807.03839},
eprinttype = {arXiv},
eprint = {1807.03839},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1807-03839.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1810-06864,
author = {Marek Cygan and
Pawel Komosa and
Daniel Lokshtanov and
Michal Pilipczuk and
Marcin Pilipczuk and
Saket Saurabh},
title = {Randomized contractions meet lean decompositions},
journal = {CoRR},
volume = {abs/1810.06864},
year = {2018},
url = {http://arxiv.org/abs/1810.06864},
eprinttype = {arXiv},
eprint = {1810.06864},
timestamp = {Tue, 30 Oct 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1810-06864.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1811-00710,
author = {Marek Cygan and
Guy Kortsarz and
Bundit Laekhanukit},
title = {On subexponential running times for approximating directed Steiner
tree and related problems},
journal = {CoRR},
volume = {abs/1811.00710},
year = {2018},
url = {http://arxiv.org/abs/1811.00710},
eprinttype = {arXiv},
eprint = {1811.00710},
timestamp = {Thu, 22 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1811-00710.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/CyganMPP17,
author = {Marek Cygan and
D{\'{a}}niel Marx and
Marcin Pilipczuk and
Michal Pilipczuk},
title = {Hitting forbidden subgraphs in graphs of bounded treewidth},
journal = {Inf. Comput.},
volume = {256},
pages = {62--82},
year = {2017},
url = {https://doi.org/10.1016/j.ic.2017.04.009},
doi = {10.1016/J.IC.2017.04.009},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/iandc/CyganMPP17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/CyganFGKMPS17,
author = {Marek Cygan and
Fedor V. Fomin and
Alexander Golovnev and
Alexander S. Kulikov and
Ivan Mihajlin and
Jakub Pachocki and
Arkadiusz Socala},
title = {Tight Lower Bounds on Graph Embedding Problems},
journal = {J. {ACM}},
volume = {64},
number = {3},
pages = {18:1--18:22},
year = {2017},
url = {https://doi.org/10.1145/3051094},
doi = {10.1145/3051094},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/CyganFGKMPS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/CyganPPLW17,
author = {Marek Cygan and
Marcin Pilipczuk and
Michal Pilipczuk and
Erik Jan van Leeuwen and
Marcin Wrochna},
title = {Polynomial Kernelization for Removing Induced Claws and Diamonds},
journal = {Theory Comput. Syst.},
volume = {60},
number = {4},
pages = {615--636},
year = {2017},
url = {https://doi.org/10.1007/s00224-016-9689-x},
doi = {10.1007/S00224-016-9689-X},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/CyganPPLW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/CyganGH17,
author = {Marek Cygan and
Fabrizio Grandoni and
Danny Hermelin},
title = {Tight Kernel Bounds for Problems on Graphs with Small Degeneracy},
journal = {{ACM} Trans. Algorithms},
volume = {13},
number = {3},
pages = {43:1--43:22},
year = {2017},
url = {https://doi.org/10.1145/3108239},
doi = {10.1145/3108239},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/CyganGH17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aaai/CyganKSS17,
author = {Marek Cygan and
Lukasz Kowalik and
Arkadiusz Socala and
Krzysztof Sornat},
editor = {Satinder Singh and
Shaul Markovitch},
title = {Approximation and Parameterized Complexity of Minimax Approval Voting},
booktitle = {Proceedings of the Thirty-First {AAAI} Conference on Artificial Intelligence,
February 4-9, 2017, San Francisco, California, {USA}},
pages = {459--465},
publisher = {{AAAI} Press},
year = {2017},
url = {https://doi.org/10.1609/aaai.v31i1.10575},
doi = {10.1609/AAAI.V31I1.10575},
timestamp = {Mon, 04 Sep 2023 14:40:32 +0200},
biburl = {https://dblp.org/rec/conf/aaai/CyganKSS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/CyganKS17,
author = {Marek Cygan and
Lukasz Kowalik and
Arkadiusz Socala},
editor = {Kirk Pruhs and
Christian Sohler},
title = {Improving {TSP} Tours Using Dynamic Programming over Tree Decompositions},
booktitle = {25th Annual European Symposium on Algorithms, {ESA} 2017, September
4-6, 2017, Vienna, Austria},
series = {LIPIcs},
volume = {87},
pages = {30:1--30:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.ESA.2017.30},
doi = {10.4230/LIPICS.ESA.2017.30},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/esa/CyganKS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ChalermsookCKLM17,
author = {Parinya Chalermsook and
Marek Cygan and
Guy Kortsarz and
Bundit Laekhanukit and
Pasin Manurangsi and
Danupon Nanongkai and
Luca Trevisan},
editor = {Chris Umans},
title = {From Gap-ETH to FPT-Inapproximability: Clique, Dominating Set, and
More},
booktitle = {58th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2017, Berkeley, CA, USA, October 15-17, 2017},
pages = {743--754},
publisher = {{IEEE} Computer Society},
year = {2017},
url = {https://doi.org/10.1109/FOCS.2017.74},
doi = {10.1109/FOCS.2017.74},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/ChalermsookCKLM17.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}
}
@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/CyganKS17,
author = {Marek Cygan and
Lukasz Kowalik and
Arkadiusz Socala},
title = {Improving {TSP} tours using dynamic programming over tree decomposition},
journal = {CoRR},
volume = {abs/1703.05559},
year = {2017},
url = {http://arxiv.org/abs/1703.05559},
eprinttype = {arXiv},
eprint = {1703.05559},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/CyganKS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1708-04218,
author = {Parinya Chalermsook and
Marek Cygan and
Guy Kortsarz and
Bundit Laekhanukit and
Pasin Manurangsi and
Danupon Nanongkai and
Luca Trevisan},
title = {From Gap-ETH to FPT-Inapproximability: Clique, Dominating Set, and
More},
journal = {CoRR},
volume = {abs/1708.04218},
year = {2017},
url = {http://arxiv.org/abs/1708.04218},
eprinttype = {arXiv},
eprint = {1708.04218},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1708-04218.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dagstuhl-reports/CyganFHW17,
author = {Marek Cygan and
Fedor V. Fomin and
Danny Hermelin and
Magnus Wahlstr{\"{o}}m},
title = {Randomization in Parameterized Complexity (Dagstuhl Seminar 17041)},
journal = {Dagstuhl Reports},
volume = {7},
number = {1},
pages = {103--128},
year = {2017},
url = {https://doi.org/10.4230/DagRep.7.1.103},
doi = {10.4230/DAGREP.7.1.103},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dagstuhl-reports/CyganFHW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/CyganPP16,
author = {Marek Cygan and
Marcin Pilipczuk and
Michal Pilipczuk},
title = {On Group Feedback Vertex Set Parameterized by the Size of the Cutset},
journal = {Algorithmica},
volume = {74},
number = {2},
pages = {630--642},
year = {2016},
url = {https://doi.org/10.1007/s00453-014-9966-5},
doi = {10.1007/S00453-014-9966-5},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/CyganPP16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/CyganH16,
author = {Marek Cygan and
Pinar Heggernes},
title = {Foreword: Special Issue on {IPEC} 2014},
journal = {Algorithmica},
volume = {75},
number = {2},
pages = {255--256},
year = {2016},
url = {https://doi.org/10.1007/s00453-016-0151-x},
doi = {10.1007/S00453-016-0151-X},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/CyganH16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/CyganH16a,
author = {Marek Cygan and
Pinar Heggernes},
title = {Erratum to: Foreword: Special Issue on {IPEC} 2014},
journal = {Algorithmica},
volume = {75},
number = {2},
pages = {257},
year = {2016},
url = {https://doi.org/10.1007/s00453-016-0161-8},
doi = {10.1007/S00453-016-0161-8},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/CyganH16a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/CyganKRRW16,
author = {Marek Cygan and
Marcin Kubica and
Jakub Radoszewski and
Wojciech Rytter and
Tomasz Walen},
title = {Polynomial-time approximation algorithms for weighted {LCS} problem},
journal = {Discret. Appl. Math.},
volume = {204},
pages = {38--48},
year = {2016},
url = {https://doi.org/10.1016/j.dam.2015.11.011},
doi = {10.1016/J.DAM.2015.11.011},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/CyganKRRW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/CyganJS16,
author = {Marek Cygan and
Lukasz Jez and
Jir{\'{\i}} Sgall},
title = {Online Knapsack Revisited},
journal = {Theory Comput. Syst.},
volume = {58},
number = {1},
pages = {153--190},
year = {2016},
url = {https://doi.org/10.1007/s00224-014-9566-4},
doi = {10.1007/S00224-014-9566-4},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/CyganJS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/BoralCKP16,
author = {Anudhyan Boral and
Marek Cygan and
Tomasz Kociumaka and
Marcin Pilipczuk},
title = {A Fast Branching Algorithm for Cluster Vertex Deletion},
journal = {Theory Comput. Syst.},
volume = {58},
number = {2},
pages = {357--376},
year = {2016},
url = {https://doi.org/10.1007/s00224-015-9631-7},
doi = {10.1007/S00224-015-9631-7},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/BoralCKP16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/CyganPP16,
author = {Marek Cygan and
Marcin Pilipczuk and
Michal Pilipczuk},
title = {Known Algorithms for Edge Clique Cover are Probably Optimal},
journal = {{SIAM} J. Comput.},
volume = {45},
number = {1},
pages = {67--83},
year = {2016},
url = {https://doi.org/10.1137/130947076},
doi = {10.1137/130947076},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/CyganPP16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ChitnisCHPP16,
author = {Rajesh Chitnis and
Marek Cygan and
MohammadTaghi Hajiaghayi and
Marcin Pilipczuk and
Michal Pilipczuk},
title = {Designing {FPT} Algorithms for Cut Problems Using Randomized Contractions},
journal = {{SIAM} J. Comput.},
volume = {45},
number = {4},
pages = {1171--1229},
year = {2016},
url = {https://doi.org/10.1137/15M1032077},
doi = {10.1137/15M1032077},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/ChitnisCHPP16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/CyganDLMNOPSW16,
author = {Marek Cygan and
Holger Dell and
Daniel Lokshtanov and
D{\'{a}}niel Marx and
Jesper Nederlof and
Yoshio Okamoto and
Ramamohan Paturi and
Saket Saurabh and
Magnus Wahlstr{\"{o}}m},
title = {On Problems as Hard as {CNF-SAT}},
journal = {{ACM} Trans. Algorithms},
volume = {12},
number = {3},
pages = {41:1--41:24},
year = {2016},
url = {https://doi.org/10.1145/2925416},
doi = {10.1145/2925416},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/talg/CyganDLMNOPSW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/BliznetsCKP16,
author = {Ivan Bliznets and
Marek Cygan and
Pawel Komosa and
Michal Pilipczuk},
editor = {Klaus Jansen and
Claire Mathieu and
Jos{\'{e}} D. P. Rolim and
Chris Umans},
title = {Hardness of Approximation for H-Free Edge Modification Problems},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2016, September 7-9, 2016, Paris,
France},
series = {LIPIcs},
volume = {60},
pages = {3:1--3:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2016.3},
doi = {10.4230/LIPICS.APPROX-RANDOM.2016.3},
timestamp = {Tue, 21 Sep 2021 09:36:24 +0200},
biburl = {https://dblp.org/rec/conf/approx/BliznetsCKP16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/CyganMSZ16,
author = {Marek Cygan and
Marcin Mucha and
Piotr Sankowski and
Qiang Zhang},
editor = {Robert Krauthgamer},
title = {Online Pricing with Impatient Bidders},
booktitle = {Proceedings of the Twenty-Seventh Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2016, Arlington, VA, USA, January 10-12, 2016},
pages = {190--201},
publisher = {{SIAM}},
year = {2016},
url = {https://doi.org/10.1137/1.9781611974331.ch15},
doi = {10.1137/1.9781611974331.CH15},
timestamp = {Tue, 02 Feb 2021 17:07:56 +0100},
biburl = {https://dblp.org/rec/conf/soda/CyganMSZ16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BliznetsCKMP16,
author = {Ivan Bliznets and
Marek Cygan and
Pawel Komosa and
Luk{\'{a}}s Mach and
Michal Pilipczuk},
editor = {Robert Krauthgamer},
title = {Lower bounds for the parameterized complexity of Minimum Fill-In and
other completion problems},
booktitle = {Proceedings of the Twenty-Seventh Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2016, Arlington, VA, USA, January 10-12, 2016},
pages = {1132--1151},
publisher = {{SIAM}},
year = {2016},
url = {https://doi.org/10.1137/1.9781611974331.ch79},
doi = {10.1137/1.9781611974331.CH79},
timestamp = {Tue, 02 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/BliznetsCKMP16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BrachCLS16,
author = {Pawel Brach and
Marek Cygan and
Jakub Lacki and
Piotr Sankowski},
editor = {Robert Krauthgamer},
title = {Algorithmic Complexity of Power Law Networks},
booktitle = {Proceedings of the Twenty-Seventh Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2016, Arlington, VA, USA, January 10-12, 2016},
pages = {1306--1325},
publisher = {{SIAM}},
year = {2016},
url = {https://doi.org/10.1137/1.9781611974331.ch91},
doi = {10.1137/1.9781611974331.CH91},
timestamp = {Tue, 02 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/BrachCLS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/CyganFGKMPS16,
author = {Marek Cygan and
Fedor V. Fomin and
Alexander Golovnev and
Alexander S. Kulikov and
Ivan Mihajlin and
Jakub Pachocki and
Arkadiusz Socala},
editor = {Robert Krauthgamer},
title = {Tight Bounds for Graph Homomorphism and Subgraph Isomorphism},
booktitle = {Proceedings of the Twenty-Seventh Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2016, Arlington, VA, USA, January 10-12, 2016},
pages = {1643--1649},
publisher = {{SIAM}},
year = {2016},
url = {https://doi.org/10.1137/1.9781611974331.ch112},
doi = {10.1137/1.9781611974331.CH112},
timestamp = {Tue, 02 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/CyganFGKMPS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/CyganLPPS16,
author = {Marek Cygan and
Daniel Lokshtanov and
Marcin Pilipczuk and
Michal Pilipczuk and
Saket Saurabh},
editor = {Rasmus Pagh},
title = {Lower Bounds for Approximation Schemes for Closest String},
booktitle = {15th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2016, June 22-24, 2016, Reykjavik, Iceland},
series = {LIPIcs},
volume = {53},
pages = {12:1--12:10},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2016.12},
doi = {10.4230/LIPICS.SWAT.2016.12},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/CyganLPPS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:reference/algo/Cygan16,
author = {Marek Cygan},
title = {Exact Algorithms for Bandwidth},
booktitle = {Encyclopedia of Algorithms},
pages = {664--667},
year = {2016},
url = {https://doi.org/10.1007/978-1-4939-2864-4\_513},
doi = {10.1007/978-1-4939-2864-4\_513},
timestamp = {Wed, 12 Jul 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/reference/algo/Cygan16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:reference/algo/Cygan16a,
author = {Marek Cygan},
title = {Randomized Contraction},
booktitle = {Encyclopedia of Algorithms},
pages = {1738--1741},
year = {2016},
url = {https://doi.org/10.1007/978-1-4939-2864-4\_764},
doi = {10.1007/978-1-4939-2864-4\_764},
timestamp = {Wed, 12 Jul 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/reference/algo/Cygan16a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/CyganFGKMPS16,
author = {Marek Cygan and
Fedor V. Fomin and
Alexander Golovnev and
Alexander S. Kulikov and
Ivan Mihajlin and
Jakub Pachocki and
Arkadiusz Socala},
title = {Tight Lower Bounds on Graph Embedding Problems},
journal = {CoRR},
volume = {abs/1602.05016},
year = {2016},
url = {http://arxiv.org/abs/1602.05016},
eprinttype = {arXiv},
eprint = {1602.05016},
timestamp = {Tue, 26 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/CyganFGKMPS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BliznetsCKP16,
author = {Ivan Bliznets and
Marek Cygan and
Pawel Komosa and
Michal Pilipczuk},
title = {Hardness of approximation for H-free edge modification problems},
journal = {CoRR},
volume = {abs/1606.02688},
year = {2016},
url = {http://arxiv.org/abs/1606.02688},
eprinttype = {arXiv},
eprint = {1606.02688},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BliznetsCKP16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/CyganKSS16,
author = {Marek Cygan and
Lukasz Kowalik and
Arkadiusz Socala and
Krzysztof Sornat},
title = {Approximation and Parameterized Complexity of Minimax Approval Voting},
journal = {CoRR},
volume = {abs/1607.07906},
year = {2016},
url = {http://arxiv.org/abs/1607.07906},
eprinttype = {arXiv},
eprint = {1607.07906},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/CyganKSS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@book{DBLP:books/sp/CyganFKLMPPS15,
author = {Marek Cygan and
Fedor V. Fomin and
Lukasz Kowalik and
Daniel Lokshtanov and
D{\'{a}}niel Marx and
Marcin Pilipczuk and
Michal Pilipczuk and
Saket Saurabh},
title = {Parameterized Algorithms},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-21275-3},
doi = {10.1007/978-3-319-21275-3},
isbn = {978-3-319-21274-6},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/books/sp/CyganFKLMPPS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/CyganP15,
author = {Marek Cygan and
Marcin Pilipczuk},
title = {Faster exponential-time algorithms in graphs of bounded average degree},
journal = {Inf. Comput.},
volume = {243},
pages = {75--85},
year = {2015},
url = {https://doi.org/10.1016/j.ic.2014.12.007},
doi = {10.1016/J.IC.2014.12.007},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/CyganP15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/BodlaenderCKN15,
author = {Hans L. Bodlaender and
Marek Cygan and
Stefan Kratsch and
Jesper Nederlof},
title = {Deterministic single exponential time algorithms for connectivity
problems parameterized by treewidth},
journal = {Inf. Comput.},
volume = {243},
pages = {86--111},
year = {2015},
url = {https://doi.org/10.1016/j.ic.2014.12.008},
doi = {10.1016/J.IC.2014.12.008},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/BodlaenderCKN15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BliznetsCKM15,
author = {Ivan Bliznets and
Marek Cygan and
Pawel Komosa and
Luk{\'{a}}s Mach},
title = {Kernelization lower bound for Permutation Pattern Matching},
journal = {Inf. Process. Lett.},
volume = {115},
number = {5},
pages = {527--531},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2015.01.001},
doi = {10.1016/J.IPL.2015.01.001},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BliznetsCKM15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/CyganGS15,
author = {Marek Cygan and
Harold N. Gabow and
Piotr Sankowski},
title = {Algorithmic Applications of Baur-Strassen's Theorem: Shortest Cycles,
Diameter, and Matchings},
journal = {J. {ACM}},
volume = {62},
number = {4},
pages = {28:1--28:30},
year = {2015},
url = {https://doi.org/10.1145/2736283},
doi = {10.1145/2736283},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/CyganGS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/CyganPPW15,
author = {Marek Cygan and
Marcin Pilipczuk and
Michal Pilipczuk and
Jakub Onufry Wojtaszczyk},
title = {Sitting Closer to Friends than Enemies, Revisited},
journal = {Theory Comput. Syst.},
volume = {56},
number = {2},
pages = {394--405},
year = {2015},
url = {https://doi.org/10.1007/s00224-014-9558-4},
doi = {10.1007/S00224-014-9558-4},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/CyganPPW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/ChitnisCHM15,
author = {Rajesh Hemant Chitnis and
Marek Cygan and
Mohammad Taghi Hajiaghayi and
D{\'{a}}niel Marx},
title = {Directed Subset Feedback Vertex Set Is Fixed-Parameter Tractable},
journal = {{ACM} Trans. Algorithms},
volume = {11},
number = {4},
pages = {28:1--28:28},
year = {2015},
url = {https://doi.org/10.1145/2700209},
doi = {10.1145/2700209},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/talg/ChitnisCHM15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/CyganK15,
author = {Marek Cygan and
Tomasz Kociumaka},
editor = {Naveen Garg and
Klaus Jansen and
Anup Rao and
Jos{\'{e}} D. P. Rolim},
title = {Approximating Upper Degree-Constrained Partial Orientations},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2015, August 24-26, 2015, Princeton,
NJ, {USA}},
series = {LIPIcs},
volume = {40},
pages = {212--224},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2015},
url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2015.212},
doi = {10.4230/LIPICS.APPROX-RANDOM.2015.212},
timestamp = {Tue, 21 Sep 2021 09:36:24 +0200},
biburl = {https://dblp.org/rec/conf/approx/CyganK15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/CyganPPLW15,
author = {Marek Cygan and
Marcin Pilipczuk and
Michal Pilipczuk and
Erik Jan van Leeuwen and
Marcin Wrochna},
editor = {Ernst W. Mayr},
title = {Polynomial Kernelization for Removing Induced Claws and Diamonds},
booktitle = {Graph-Theoretic Concepts in Computer Science - 41st International
Workshop, {WG} 2015, Garching, Germany, June 17-19, 2015, Revised
Papers},
series = {Lecture Notes in Computer Science},
volume = {9224},
pages = {440--455},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-662-53174-7\_31},
doi = {10.1007/978-3-662-53174-7\_31},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/CyganPPLW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/CyganPPLW15,
author = {Marek Cygan and
Marcin Pilipczuk and
Michal Pilipczuk and
Erik Jan van Leeuwen and
Marcin Wrochna},
title = {Polynomial kernelization for removing induced claws and diamonds},
journal = {CoRR},
volume = {abs/1503.00704},
year = {2015},
url = {http://arxiv.org/abs/1503.00704},
eprinttype = {arXiv},
eprint = {1503.00704},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/CyganPPLW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/CyganPS15,
author = {Marek Cygan and
Jakub Pachocki and
Arkadiusz Socala},
title = {The Hardness of Subgraph Isomorphism},
journal = {CoRR},
volume = {abs/1504.02876},
year = {2015},
url = {http://arxiv.org/abs/1504.02876},
eprinttype = {arXiv},
eprint = {1504.02876},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/CyganPS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BrachCLS15,
author = {Pawel Brach and
Marek Cygan and
Jakub Lacki and
Piotr Sankowski},
title = {Algorithmic Complexity of Power Law Networks},
journal = {CoRR},
volume = {abs/1507.02426},
year = {2015},
url = {http://arxiv.org/abs/1507.02426},
eprinttype = {arXiv},
eprint = {1507.02426},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BrachCLS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BliznetsCKMP15,
author = {Ivan Bliznets and
Marek Cygan and
Pawel Komosa and
Luk{\'{a}}s Mach and
Michal Pilipczuk},
title = {Lower bounds for the parameterized complexity of Minimum Fill-in and
other completion problems},
journal = {CoRR},
volume = {abs/1508.05282},
year = {2015},
url = {http://arxiv.org/abs/1508.05282},
eprinttype = {arXiv},
eprint = {1508.05282},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BliznetsCKMP15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/CyganLPPS15,
author = {Marek Cygan and
Daniel Lokshtanov and
Marcin Pilipczuk and
Michal Pilipczuk and
Saket Saurabh},
title = {Lower bounds for approximation schemes for Closest String},
journal = {CoRR},
volume = {abs/1509.05809},
year = {2015},
url = {http://arxiv.org/abs/1509.05809},
eprinttype = {arXiv},
eprint = {1509.05809},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/CyganLPPS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/CyganMPPS14,
author = {Marek Cygan and
D{\'{a}}niel Marx and
Marcin Pilipczuk and
Michal Pilipczuk and
Ildik{\'{o}} Schlotter},
title = {Parameterized Complexity of Eulerian Deletion Problems},
journal = {Algorithmica},
volume = {68},
number = {1},
pages = {41--61},
year = {2014},
url = {https://doi.org/10.1007/s00453-012-9667-x},
doi = {10.1007/S00453-012-9667-X},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/CyganMPPS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/CyganPPW14,
author = {Marek Cygan and
Marcin Pilipczuk and
Michal Pilipczuk and
Jakub Onufry Wojtaszczyk},
title = {Scheduling Partially Ordered Jobs Faster than 2 n},
journal = {Algorithmica},
volume = {68},
number = {3},
pages = {692--714},
year = {2014},
url = {https://doi.org/10.1007/s00453-012-9694-7},
doi = {10.1007/S00453-012-9694-7},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/CyganPPW14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/CyganLPPS14,
author = {Marek Cygan and
Daniel Lokshtanov and
Marcin Pilipczuk and
Michal Pilipczuk and
Saket Saurabh},
title = {On Cutwidth Parameterized by Vertex Cover},
journal = {Algorithmica},
volume = {68},
number = {4},
pages = {940--953},
year = {2014},
url = {https://doi.org/10.1007/s00453-012-9707-6},
doi = {10.1007/S00453-012-9707-6},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/CyganLPPS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/CyganPPW14a,
author = {Marek Cygan and
Marcin Pilipczuk and
Michal Pilipczuk and
Jakub Onufry Wojtaszczyk},
title = {Solving the 2-Disjoint Connected Subgraphs Problem Faster than 2 n},
journal = {Algorithmica},
volume = {70},
number = {2},
pages = {195--207},
year = {2014},
url = {https://doi.org/10.1007/s00453-013-9796-x},
doi = {10.1007/S00453-013-9796-X},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/CyganPPW14a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/BazganCCFFL14,
author = {Cristina Bazgan and
Morgan Chopin and
Marek Cygan and
Michael R. Fellows and
Fedor V. Fomin and
Erik Jan van Leeuwen},
title = {Parameterized complexity of firefighting},
journal = {J. Comput. Syst. Sci.},
volume = {80},
number = {7},
pages = {1285--1297},
year = {2014},
url = {https://doi.org/10.1016/j.jcss.2014.03.001},
doi = {10.1016/J.JCSS.2014.03.001},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/BazganCCFFL14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/CyganLPPS14,
author = {Marek Cygan and
Daniel Lokshtanov and
Marcin Pilipczuk and
Michal Pilipczuk and
Saket Saurabh},
title = {On the Hardness of Losing Width},
journal = {Theory Comput. Syst.},
volume = {54},
number = {1},
pages = {73--82},
year = {2014},
url = {https://doi.org/10.1007/s00224-013-9480-1},
doi = {10.1007/S00224-013-9480-1},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/CyganLPPS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toct/CyganKPPW14,
author = {Marek Cygan and
Stefan Kratsch and
Marcin Pilipczuk and
Michal Pilipczuk and
Magnus Wahlstr{\"{o}}m},
title = {Clique Cover and Graph Separation: New Incompressibility Results},
journal = {{ACM} Trans. Comput. Theory},
volume = {6},
number = {2},
pages = {6:1--6:19},
year = {2014},
url = {https://doi.org/10.1145/2594439},
doi = {10.1145/2594439},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/toct/CyganKPPW14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/csr/BoralCKP14,
author = {Anudhyan Boral and
Marek Cygan and
Tomasz Kociumaka and
Marcin Pilipczuk},
editor = {Edward A. Hirsch and
Sergei O. Kuznetsov and
Jean{-}{\'{E}}ric Pin and
Nikolay K. Vereshchagin},
title = {A Fast Branching Algorithm for Cluster Vertex Deletion},
booktitle = {Computer Science - Theory and Applications - 9th International Computer
Science Symposium in Russia, {CSR} 2014, Moscow, Russia, June 7-11,
2014. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8476},
pages = {111--124},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-06686-8\_9},
doi = {10.1007/978-3-319-06686-8\_9},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/csr/BoralCKP14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/CyganMPP14,
author = {Marek Cygan and
D{\'{a}}niel Marx and
Marcin Pilipczuk and
Michal Pilipczuk},
editor = {Erzs{\'{e}}bet Csuhaj{-}Varj{\'{u}} and
Martin Dietzfelbinger and
Zolt{\'{a}}n {\'{E}}sik},
title = {Hitting Forbidden Subgraphs in Graphs of Bounded Treewidth},
booktitle = {Mathematical Foundations of Computer Science 2014 - 39th International
Symposium, {MFCS} 2014, Budapest, Hungary, August 25-29, 2014. Proceedings,
Part {II}},
series = {Lecture Notes in Computer Science},
volume = {8635},
pages = {189--200},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-662-44465-8\_17},
doi = {10.1007/978-3-662-44465-8\_17},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/CyganMPP14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/CyganK14,
author = {Marek Cygan and
Tomasz Kociumaka},
editor = {Ernst W. Mayr and
Natacha Portier},
title = {Constant Factor Approximation for Capacitated k-Center with Outliers},
booktitle = {31st International Symposium on Theoretical Aspects of Computer Science
{(STACS} 2014), {STACS} 2014, March 5-8, 2014, Lyon, France},
series = {LIPIcs},
volume = {25},
pages = {251--262},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2014},
url = {https://doi.org/10.4230/LIPIcs.STACS.2014.251},
doi = {10.4230/LIPICS.STACS.2014.251},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/stacs/CyganK14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/CyganLPPS14,
author = {Marek Cygan and
Daniel Lokshtanov and
Marcin Pilipczuk and
Michal Pilipczuk and
Saket Saurabh},
editor = {David B. Shmoys},
title = {Minimum bisection is fixed parameter tractable},
booktitle = {Symposium on Theory of Computing, {STOC} 2014, New York, NY, USA,
May 31 - June 03, 2014},
pages = {323--332},
publisher = {{ACM}},
year = {2014},
url = {https://doi.org/10.1145/2591796.2591852},
doi = {10.1145/2591796.2591852},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/CyganLPPS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/iwpec/2014,
editor = {Marek Cygan and
Pinar Heggernes},
title = {Parameterized and Exact Computation - 9th International Symposium,
{IPEC} 2014, Wroclaw, Poland, September 10-12, 2014. Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {8894},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-13524-3},
doi = {10.1007/978-3-319-13524-3},
isbn = {978-3-319-13523-6},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/iwpec/2014.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/KociumakaC14,
author = {Tomasz Kociumaka and
Marek Cygan},
title = {Constant Factor Approximation for Capacitated k-Center with Outliers},
journal = {CoRR},
volume = {abs/1401.2874},
year = {2014},
url = {http://arxiv.org/abs/1401.2874},
eprinttype = {arXiv},
eprint = {1401.2874},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/KociumakaC14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BliznetsCKM14,
author = {Ivan Bliznets and
Marek Cygan and
Pawel Komosa and
Luk{\'{a}}s Mach},
title = {Kernelization lower bound for Permutation Pattern Matching},
journal = {CoRR},
volume = {abs/1406.1158},
year = {2014},
url = {http://arxiv.org/abs/1406.1158},
eprinttype = {arXiv},
eprint = {1406.1158},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BliznetsCKM14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/CyganK14,
author = {Marek Cygan and
Tomasz Kociumaka},
title = {Approximating Upper Degree-Constrained Partial Orientations},
journal = {CoRR},
volume = {abs/1408.6157},
year = {2014},
url = {http://arxiv.org/abs/1408.6157},
eprinttype = {arXiv},
eprint = {1408.6157},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/CyganK14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/CyganMPP14,
author = {Marek Cygan and
D{\'{a}}niel Marx and
Marcin Pilipczuk and
Michal Pilipczuk},
title = {Hitting forbidden subgraphs in graphs of bounded treewidth},
journal = {CoRR},
volume = {abs/1411.4184},
year = {2014},
url = {http://arxiv.org/abs/1411.4184},
eprinttype = {arXiv},
eprint = {1411.4184},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/CyganMPP14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmtcs/CyganPS13,
author = {Marek Cygan and
Marcin Pilipczuk and
Riste Skrekovski},
title = {A bound on the number of perfect matchings in Klee-graphs},
journal = {Discret. Math. Theor. Comput. Sci.},
volume = {15},
number = {1},
pages = {37--54},
year = {2013},
url = {https://doi.org/10.46298/dmtcs.633},
doi = {10.46298/DMTCS.633},
timestamp = {Tue, 31 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dmtcs/CyganPS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/CyganP13,
author = {Marek Cygan and
Marcin Pilipczuk},
title = {Split Vertex Deletion meets Vertex Cover: New fixed-parameter and
exact exponential-time algorithms},
journal = {Inf. Process. Lett.},
volume = {113},
number = {5-6},
pages = {179--182},
year = {2013},
url = {https://doi.org/10.1016/j.ipl.2013.01.001},
doi = {10.1016/J.IPL.2013.01.001},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/CyganP13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/CyganPPW13,
author = {Marek Cygan and
Marcin Pilipczuk and
Michal Pilipczuk and
Jakub Onufry Wojtaszczyk},
title = {Subset Feedback Vertex Set Is Fixed-Parameter Tractable},
journal = {{SIAM} J. Discret. Math.},
volume = {27},
number = {1},
pages = {290--309},
year = {2013},
url = {https://doi.org/10.1137/110843071},
doi = {10.1137/110843071},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/CyganPPW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/CyganKN13,
author = {Marek Cygan and
Guy Kortsarz and
Zeev Nutov},
title = {Steiner Forest Orientation Problems},
journal = {{SIAM} J. Discret. Math.},
volume = {27},
number = {3},
pages = {1503--1513},
year = {2013},
url = {https://doi.org/10.1137/120883931},
doi = {10.1137/120883931},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/CyganKN13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toct/CyganPPW13,
author = {Marek Cygan and
Marcin Pilipczuk and
Michal Pilipczuk and
Jakub Onufry Wojtaszczyk},
title = {On multiway cut parameterized above lower bounds},
journal = {{ACM} Trans. Comput. Theory},
volume = {5},
number = {1},
pages = {3:1--3:11},
year = {2013},
url = {https://doi.org/10.1145/2462896.2462899},
doi = {10.1145/2462896.2462899},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/toct/CyganPPW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/CyganGH13,
author = {Marek Cygan and
Fabrizio Grandoni and
Danny Hermelin},
editor = {Hans L. Bodlaender and
Giuseppe F. Italiano},
title = {Tight Kernel Bounds for Problems on Graphs with Small Degeneracy -
(Extended Abstract)},
booktitle = {Algorithms - {ESA} 2013 - 21st Annual European Symposium, Sophia Antipolis,
France, September 2-4, 2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8125},
pages = {361--372},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-40450-4\_31},
doi = {10.1007/978-3-642-40450-4\_31},
timestamp = {Mon, 03 Jan 2022 22:19:39 +0100},
biburl = {https://dblp.org/rec/conf/esa/CyganGH13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/CyganMPP13,
author = {Marek Cygan and
D{\'{a}}niel Marx and
Marcin Pilipczuk and
Michal Pilipczuk},
title = {The Planar Directed K-Vertex-Disjoint Paths Problem Is Fixed-Parameter
Tractable},
booktitle = {54th Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS}
2013, 26-29 October, 2013, Berkeley, CA, {USA}},
pages = {197--206},
publisher = {{IEEE} Computer Society},
year = {2013},
url = {https://doi.org/10.1109/FOCS.2013.29},
doi = {10.1109/FOCS.2013.29},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/CyganMPP13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Cygan13,
author = {Marek Cygan},
title = {Improved Approximation for 3-Dimensional Matching via Bounded Pathwidth
Local Search},
booktitle = {54th Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS}
2013, 26-29 October, 2013, Berkeley, CA, {USA}},
pages = {509--518},
publisher = {{IEEE} Computer Society},
year = {2013},
url = {https://doi.org/10.1109/FOCS.2013.61},
doi = {10.1109/FOCS.2013.61},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Cygan13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/BodlaenderCKN13,
author = {Hans L. Bodlaender and
Marek Cygan and
Stefan Kratsch and
Jesper Nederlof},
editor = {Fedor V. Fomin and
Rusins Freivalds and
Marta Z. Kwiatkowska and
David Peleg},
title = {Deterministic Single Exponential Time Algorithms for Connectivity
Problems Parameterized by Treewidth},
booktitle = {Automata, Languages, and Programming - 40th International Colloquium,
{ICALP} 2013, Riga, Latvia, July 8-12, 2013, Proceedings, Part {I}},
series = {Lecture Notes in Computer Science},
volume = {7965},
pages = {196--207},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-39206-1\_17},
doi = {10.1007/978-3-642-39206-1\_17},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/BodlaenderCKN13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/CyganP13,
author = {Marek Cygan and
Marcin Pilipczuk},
editor = {Fedor V. Fomin and
Rusins Freivalds and
Marta Z. Kwiatkowska and
David Peleg},
title = {Faster Exponential-Time Algorithms in Graphs of Bounded Average Degree},
booktitle = {Automata, Languages, and Programming - 40th International Colloquium,
{ICALP} 2013, Riga, Latvia, July 8-12, 2013, Proceedings, Part {I}},
series = {Lecture Notes in Computer Science},
volume = {7965},
pages = {364--375},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-39206-1\_31},
doi = {10.1007/978-3-642-39206-1\_31},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/CyganP13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/CyganEGMS13,
author = {Marek Cygan and
Matthias Englert and
Anupam Gupta and
Marcin Mucha and
Piotr Sankowski},
editor = {Robert D. Kleinberg},
title = {Catch them if you can: how to serve impatient users},
booktitle = {Innovations in Theoretical Computer Science, {ITCS} '13, Berkeley,
CA, USA, January 9-12, 2013},
pages = {485--494},
publisher = {{ACM}},
year = {2013},
url = {https://doi.org/10.1145/2422436.2422489},
doi = {10.1145/2422436.2422489},
timestamp = {Wed, 18 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/innovations/CyganEGMS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/CyganGM13,
author = {Marek Cygan and
Fabrizio Grandoni and
Monaldo Mastrolilli},
editor = {Sanjeev Khanna},
title = {How to Sell Hyperedges: The Hypermatching Assignment Problem},
booktitle = {Proceedings of the Twenty-Fourth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2013, New Orleans, Louisiana, USA, January 6-8,
2013},
pages = {342--351},
publisher = {{SIAM}},
year = {2013},
url = {https://doi.org/10.1137/1.9781611973105.25},
doi = {10.1137/1.9781611973105.25},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/CyganGM13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/CyganPP13,
author = {Marek Cygan and
Marcin Pilipczuk and
Michal Pilipczuk},
editor = {Sanjeev Khanna},
title = {Known algorithms for {EDGE} {CLIQUE} {COVER} are probably optimal},
booktitle = {Proceedings of the Twenty-Fourth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2013, New Orleans, Louisiana, USA, January 6-8,
2013},
pages = {1044--1053},
publisher = {{SIAM}},
year = {2013},
url = {https://doi.org/10.1137/1.9781611973105.75},
doi = {10.1137/1.9781611973105.75},
timestamp = {Tue, 02 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/CyganPP13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/CyganGK13,
author = {Marek Cygan and
Fabrizio Grandoni and
Telikepalli Kavitha},
editor = {Natacha Portier and
Thomas Wilke},
title = {On Pairwise Spanners},
booktitle = {30th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2013, February 27 - March 2, 2013, Kiel, Germany},
series = {LIPIcs},
volume = {20},
pages = {209--220},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2013},
url = {https://doi.org/10.4230/LIPIcs.STACS.2013.209},
doi = {10.4230/LIPICS.STACS.2013.209},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stacs/CyganGK13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/CyganKN13,
author = {Marek Cygan and
Stefan Kratsch and
Jesper Nederlof},
editor = {Dan Boneh and
Tim Roughgarden and
Joan Feigenbaum},
title = {Fast hamiltonicity checking via bases of perfect matchings},
booktitle = {Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA,
USA, June 1-4, 2013},
pages = {301--310},
publisher = {{ACM}},
year = {2013},
url = {https://doi.org/10.1145/2488608.2488646},
doi = {10.1145/2488608.2488646},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/CyganKN13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/CyganJ13,
author = {Marek Cygan and
Lukasz Jez},
editor = {Christos Kaklamanis and
Kirk Pruhs},
title = {Online Knapsack Revisited},
booktitle = {Approximation and Online Algorithms - 11th International Workshop,
{WAOA} 2013, Sophia Antipolis, France, September 5-6, 2013, Revised
Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {8447},
pages = {144--155},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-319-08001-7\_13},
doi = {10.1007/978-3-319-08001-7\_13},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/waoa/CyganJ13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1301-1999,
author = {Marek Cygan and
Fabrizio Grandoni and
Telikepalli Kavitha},
title = {On Pairwise Spanners},
journal = {CoRR},
volume = {abs/1301.1999},
year = {2013},
url = {http://arxiv.org/abs/1301.1999},
eprinttype = {arXiv},
eprint = {1301.1999},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1301-1999.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1302-3763,
author = {Marek Cygan and
Marcin Pilipczuk},
title = {Faster exponential-time algorithms in graphs of bounded average degree},
journal = {CoRR},
volume = {abs/1302.3763},
year = {2013},
url = {http://arxiv.org/abs/1302.3763},
eprinttype = {arXiv},
eprint = {1302.3763},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1302-3763.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1304-1424,
author = {Marek Cygan},
title = {Improved approximation for 3-dimensional matching via bounded pathwidth
local search},
journal = {CoRR},
volume = {abs/1304.1424},
year = {2013},
url = {http://arxiv.org/abs/1304.1424},
eprinttype = {arXiv},
eprint = {1304.1424},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1304-1424.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1304-4207,
author = {Marek Cygan and
D{\'{a}}niel Marx and
Marcin Pilipczuk and
Michal Pilipczuk},
title = {The planar directed k-Vertex-Disjoint Paths problem is fixed-parameter
tractable},
journal = {CoRR},
volume = {abs/1304.4207},
year = {2013},
url = {http://arxiv.org/abs/1304.4207},
eprinttype = {arXiv},
eprint = {1304.4207},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1304-4207.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1305-4914,
author = {Marek Cygan and
Fabrizio Grandoni and
Danny Hermelin},
title = {Tight Kernel Bounds for Problems on Graphs with Small Degeneracy},
journal = {CoRR},
volume = {abs/1305.4914},
year = {2013},
url = {http://arxiv.org/abs/1305.4914},
eprinttype = {arXiv},
eprint = {1305.4914},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1305-4914.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BoralCKP13,
author = {Anudhyan Boral and
Marek Cygan and
Tomasz Kociumaka and
Marcin Pilipczuk},
title = {Fast branching algorithm for Cluster Vertex Deletion},
journal = {CoRR},
volume = {abs/1306.3877},
year = {2013},
url = {http://arxiv.org/abs/1306.3877},
eprinttype = {arXiv},
eprint = {1306.3877},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BoralCKP13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/CyganLPPS13,
author = {Marek Cygan and
Daniel Lokshtanov and
Marcin Pilipczuk and
Michal Pilipczuk and
Saket Saurabh},
title = {Minimum Bisection is fixed parameter tractable},
journal = {CoRR},
volume = {abs/1311.2563},
year = {2013},
url = {http://arxiv.org/abs/1311.2563},
eprinttype = {arXiv},
eprint = {1311.2563},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/CyganLPPS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/CyganPPW12,
author = {Marek Cygan and
Marcin Pilipczuk and
Michal Pilipczuk and
Jakub Onufry Wojtaszczyk},
title = {An Improved {FPT} Algorithm and a Quadratic Kernel for Pathwidth One
Vertex Deletion},
journal = {Algorithmica},
volume = {64},
number = {1},
pages = {170--188},
year = {2012},
url = {https://doi.org/10.1007/s00453-011-9578-2},
doi = {10.1007/S00453-011-9578-2},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/CyganPPW12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/CyganP12,
author = {Marek Cygan and
Marcin Pilipczuk},
title = {Bandwidth and distortion revisited},
journal = {Discret. Appl. Math.},
volume = {160},
number = {4-5},
pages = {494--504},
year = {2012},
url = {https://doi.org/10.1016/j.dam.2011.10.032},
doi = {10.1016/J.DAM.2011.10.032},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/CyganP12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/CyganPPW12,
author = {Marek Cygan and
Marcin Pilipczuk and
Michal Pilipczuk and
Jakub Onufry Wojtaszczyk},
title = {Kernelization hardness of connectivity problems in d-degenerate graphs},
journal = {Discret. Appl. Math.},
volume = {160},
number = {15},
pages = {2131--2141},
year = {2012},
url = {https://doi.org/10.1016/j.dam.2012.05.016},
doi = {10.1016/J.DAM.2012.05.016},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/CyganPPW12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/CyganHKLW12,
author = {Marek Cygan and
Jianfeng Hou and
Lukasz Kowalik and
Borut Luzar and
Jian{-}Liang Wu},
title = {A Planar linear arboricity conjecture},
journal = {J. Graph Theory},
volume = {69},
number = {4},
pages = {403--425},
year = {2012},
url = {https://doi.org/10.1002/jgt.20592},
doi = {10.1002/JGT.20592},
timestamp = {Sun, 22 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/CyganHKLW12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/CyganPPW12,
author = {Marek Cygan and
Marcin Pilipczuk and
Michal Pilipczuk and
Jakub Onufry Wojtaszczyk},
title = {A Polynomial Algorithm for 3-Compatible Coloring and the Stubborn
List Partition Problem (The Stubborn Problem Is Stubborn No More)},
journal = {{SIAM} J. Comput.},
volume = {41},
number = {4},
pages = {815--828},
year = {2012},
url = {https://doi.org/10.1137/110826813},
doi = {10.1137/110826813},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/CyganPPW12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/CyganP12,
author = {Marek Cygan and
Marcin Pilipczuk},
title = {Even Faster Exact Bandwidth},
journal = {{ACM} Trans. Algorithms},
volume = {8},
number = {1},
pages = {8:1--8:14},
year = {2012},
url = {https://doi.org/10.1145/2071379.2071387},
doi = {10.1145/2071379.2071387},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/talg/CyganP12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/CyganDLMNOPSW12,
author = {Marek Cygan and
Holger Dell and
Daniel Lokshtanov and
D{\'{a}}niel Marx and
Jesper Nederlof and
Yoshio Okamoto and
Ramamohan Paturi and
Saket Saurabh and
Magnus Wahlstr{\"{o}}m},
title = {On Problems as Hard as {CNF-SAT}},
booktitle = {Proceedings of the 27th Conference on Computational Complexity, {CCC}
2012, Porto, Portugal, June 26-29, 2012},
pages = {74--84},
publisher = {{IEEE} Computer Society},
year = {2012},
url = {https://doi.org/10.1109/CCC.2012.36},
doi = {10.1109/CCC.2012.36},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/CyganDLMNOPSW12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/CyganGLPS12,
author = {Marek Cygan and
Fabrizio Grandoni and
Stefano Leonardi and
Marcin Pilipczuk and
Piotr Sankowski},
editor = {Leah Epstein and
Paolo Ferragina},
title = {A Path-Decomposition Theorem with Applications to Pricing and Covering
on Trees},
booktitle = {Algorithms - {ESA} 2012 - 20th Annual European Symposium, Ljubljana,
Slovenia, September 10-12, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7501},
pages = {349--360},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-33090-2\_31},
doi = {10.1007/978-3-642-33090-2\_31},
timestamp = {Tue, 27 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/esa/CyganGLPS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/CyganKN12,
author = {Marek Cygan and
Guy Kortsarz and
Zeev Nutov},
editor = {Leah Epstein and
Paolo Ferragina},
title = {Steiner Forest Orientation Problems},
booktitle = {Algorithms - {ESA} 2012 - 20th Annual European Symposium, Ljubljana,
Slovenia, September 10-12, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7501},
pages = {361--372},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-33090-2\_32},
doi = {10.1007/978-3-642-33090-2\_32},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/esa/CyganKN12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/CyganHK12,
author = {Marek Cygan and
MohammadTaghi Hajiaghayi and
Samir Khuller},
title = {{LP} Rounding for k-Centers with Non-uniform Hard Capacities},
booktitle = {53rd Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS}
2012, New Brunswick, NJ, USA, October 20-23, 2012},
pages = {273--282},
publisher = {{IEEE} Computer Society},
year = {2012},
url = {https://doi.org/10.1109/FOCS.2012.63},
doi = {10.1109/FOCS.2012.63},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/CyganHK12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ChitnisCHPP12,
author = {Rajesh Hemant Chitnis and
Marek Cygan and
MohammadTaghi Hajiaghayi and
Marcin Pilipczuk and
Michal Pilipczuk},
title = {Designing {FPT} Algorithms for Cut Problems Using Randomized Contractions},
booktitle = {53rd Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS}
2012, New Brunswick, NJ, USA, October 20-23, 2012},
pages = {460--469},
publisher = {{IEEE} Computer Society},
year = {2012},
url = {https://doi.org/10.1109/FOCS.2012.29},
doi = {10.1109/FOCS.2012.29},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/ChitnisCHPP12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/CyganGS12,
author = {Marek Cygan and
Harold N. Gabow and
Piotr Sankowski},
title = {Algorithmic Applications of Baur-Strassen's Theorem: Shortest Cycles,
Diameter and Matchings},
booktitle = {53rd Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS}
2012, New Brunswick, NJ, USA, October 20-23, 2012},
pages = {531--540},
publisher = {{IEEE} Computer Society},
year = {2012},
url = {https://doi.org/10.1109/FOCS.2012.72},
doi = {10.1109/FOCS.2012.72},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/CyganGS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/ChitnisCHM12,
author = {Rajesh Hemant Chitnis and
Marek Cygan and
Mohammad Taghi Hajiaghayi and
D{\'{a}}niel Marx},
editor = {Artur Czumaj and
Kurt Mehlhorn and
Andrew M. Pitts and
Roger Wattenhofer},
title = {Directed Subset Feedback Vertex Set Is Fixed-Parameter Tractable},
booktitle = {Automata, Languages, and Programming - 39th International Colloquium,
{ICALP} 2012, Warwick, UK, July 9-13, 2012, Proceedings, Part {I}},
series = {Lecture Notes in Computer Science},
volume = {7391},
pages = {230--241},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-31594-7\_20},
doi = {10.1007/978-3-642-31594-7\_20},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/ChitnisCHM12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/CyganKPPW12,
author = {Marek Cygan and
Stefan Kratsch and
Marcin Pilipczuk and
Michal Pilipczuk and
Magnus Wahlstr{\"{o}}m},
editor = {Artur Czumaj and
Kurt Mehlhorn and
Andrew M. Pitts and
Roger Wattenhofer},
title = {Clique Cover and Graph Separation: New Incompressibility Results},
booktitle = {Automata, Languages, and Programming - 39th International Colloquium,
{ICALP} 2012, Warwick, UK, July 9-13, 2012, Proceedings, Part {I}},
series = {Lecture Notes in Computer Science},
volume = {7391},
pages = {254--265},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-31594-7\_22},
doi = {10.1007/978-3-642-31594-7\_22},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/CyganKPPW12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/latin/CyganPPW12,
author = {Marek Cygan and
Marcin Pilipczuk and
Michal Pilipczuk and
Jakub Onufry Wojtaszczyk},
editor = {David Fern{\'{a}}ndez{-}Baca},
title = {Solving the 2-Disjoint Connected Subgraphs Problem Faster Than 2 n},
booktitle = {{LATIN} 2012: Theoretical Informatics - 10th Latin American Symposium,
Arequipa, Peru, April 16-20, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7256},
pages = {195--206},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-29344-3\_17},
doi = {10.1007/978-3-642-29344-3\_17},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/latin/CyganPPW12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/CyganPPW12,
author = {Marek Cygan and
Marcin Pilipczuk and
Michal Pilipczuk and
Jakub Onufry Wojtaszczyk},
editor = {Branislav Rovan and
Vladimiro Sassone and
Peter Widmayer},
title = {Sitting Closer to Friends Than Enemies, Revisited},
booktitle = {Mathematical Foundations of Computer Science 2012 - 37th International
Symposium, {MFCS} 2012, Bratislava, Slovakia, August 27-31, 2012.
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7464},
pages = {296--307},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-32589-2\_28},
doi = {10.1007/978-3-642-32589-2\_28},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/CyganPPW12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Cygan12,
author = {Marek Cygan},
editor = {Fedor V. Fomin and
Petteri Kaski},
title = {Deterministic Parameterized Connected Vertex Cover},
booktitle = {Algorithm Theory - {SWAT} 2012 - 13th Scandinavian Symposium and Workshops,
Helsinki, Finland, July 4-6, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7357},
pages = {95--106},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-31155-0\_9},
doi = {10.1007/978-3-642-31155-0\_9},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/Cygan12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/CyganPP12,
author = {Marek Cygan and
Marcin Pilipczuk and
Michal Pilipczuk},
editor = {Martin Charles Golumbic and
Michal Stern and
Avivit Levy and
Gila Morgenstern},
title = {On Group Feedback Vertex Set Parameterized by the Size of the Cutset},
booktitle = {Graph-Theoretic Concepts in Computer Science - 38th International
Workshop, {WG} 2012, Jerusalem, Israel, June 26-28, 2012, Revised
Selcted Papers},
series = {Lecture Notes in Computer Science},
volume = {7551},
pages = {194--205},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-34611-8\_21},
doi = {10.1007/978-3-642-34611-8\_21},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/CyganPP12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1201-1869,
author = {Marek Cygan and
Marcin Pilipczuk and
Michal Pilipczuk and
Jakub Onufry Wojtaszczyk},
title = {Sitting closer to friends than enemies, revisited},
journal = {CoRR},
volume = {abs/1201.1869},
year = {2012},
url = {http://arxiv.org/abs/1201.1869},
eprinttype = {arXiv},
eprint = {1201.1869},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1201-1869.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1202-6642,
author = {Marek Cygan},
title = {Deterministic parameterized connected vertex cover},
journal = {CoRR},
volume = {abs/1202.6642},
year = {2012},
url = {http://arxiv.org/abs/1202.6642},
eprinttype = {arXiv},
eprint = {1202.6642},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1202-6642.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1203-1754,
author = {Marek Cygan and
Marcin Pilipczuk and
Michal Pilipczuk},
title = {Known algorithms for {EDGE} {CLIQUE} {COVER} are probably optimal},
journal = {CoRR},
volume = {abs/1203.1754},
year = {2012},
url = {http://arxiv.org/abs/1203.1754},
eprinttype = {arXiv},
eprint = {1203.1754},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1203-1754.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1204-1616,
author = {Marek Cygan and
Harold N. Gabow and
Piotr Sankowski},
title = {Algorithmic Applications of Baur-Strassen's Theorem: Shortest Cycles,
Diameter and Matchings},
journal = {CoRR},
volume = {abs/1204.1616},
year = {2012},
url = {http://arxiv.org/abs/1204.1616},
eprinttype = {arXiv},
eprint = {1204.1616},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1204-1616.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1205-1271,
author = {Rajesh Hemant Chitnis and
Marek Cygan and
MohammadTaghi Hajiaghayi and
D{\'{a}}niel Marx},
title = {Directed Subset Feedback Vertex Set is Fixed-Parameter Tractable},
journal = {CoRR},
volume = {abs/1205.1271},
year = {2012},
url = {http://arxiv.org/abs/1205.1271},
eprinttype = {arXiv},
eprint = {1205.1271},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1205-1271.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1207-4079,
author = {Rajesh Hemant Chitnis and
Marek Cygan and
MohammadTaghi Hajiaghayi and
Marcin Pilipczuk and
Michal Pilipczuk},
title = {Designing {FPT} algorithms for cut problems using randomized contractions},
journal = {CoRR},
volume = {abs/1207.4079},
year = {2012},
url = {http://arxiv.org/abs/1207.4079},
eprinttype = {arXiv},
eprint = {1207.4079},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1207-4079.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1208-1248,
author = {Marek Cygan and
Marcin Pilipczuk},
title = {On fixed-parameter algorithms for Split Vertex Deletion},
journal = {CoRR},
volume = {abs/1208.1248},
year = {2012},
url = {http://arxiv.org/abs/1208.1248},
eprinttype = {arXiv},
eprint = {1208.1248},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1208-1248.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1208-3054,
author = {Marek Cygan and
MohammadTaghi Hajiaghayi and
Samir Khuller},
title = {{LP} Rounding for k-Centers with Non-uniform Hard Capacities},
journal = {CoRR},
volume = {abs/1208.3054},
year = {2012},
url = {http://arxiv.org/abs/1208.3054},
eprinttype = {arXiv},
eprint = {1208.3054},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1208-3054.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1211-1505,
author = {Hans L. Bodlaender and
Marek Cygan and
Stefan Kratsch and
Jesper Nederlof},
title = {Solving weighted and counting variants of connectivity problems parameterized
by treewidth deterministically in single exponential time},
journal = {CoRR},
volume = {abs/1211.1505},
year = {2012},
url = {http://arxiv.org/abs/1211.1505},
eprinttype = {arXiv},
eprint = {1211.1505},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1211-1505.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1211-1506,
author = {Marek Cygan and
Stefan Kratsch and
Jesper Nederlof},
title = {Fast Hamiltonicity checking via bases of perfect matchings},
journal = {CoRR},
volume = {abs/1211.1506},
year = {2012},
url = {http://arxiv.org/abs/1211.1506},
eprinttype = {arXiv},
eprint = {1211.1506},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1211-1506.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/CyganK11,
author = {Marek Cygan and
Lukasz Kowalik},
title = {Channel assignment via fast zeta transform},
journal = {Inf. Process. Lett.},
volume = {111},
number = {15},
pages = {727--730},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2011.05.008},
doi = {10.1016/J.IPL.2011.05.008},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/CyganK11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/CyganPW11,
author = {Marek Cygan and
Marcin Pilipczuk and
Jakub Onufry Wojtaszczyk},
title = {Capacitated domination faster than \emph{O}(\emph{n}\({}^{\mbox{2}}\))},
journal = {Inf. Process. Lett.},
volume = {111},
number = {23-24},
pages = {1099--1103},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2011.09.004},
doi = {10.1016/J.IPL.2011.09.004},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/CyganPW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/Binkele-RaibleBCFKKLLPRW11,
author = {Daniel Binkele{-}Raible and
Ljiljana Brankovic and
Marek Cygan and
Henning Fernau and
Joachim Kneis and
Dieter Kratsch and
Alexander Langer and
Mathieu Liedloff and
Marcin Pilipczuk and
Peter Rossmanith and
Jakub Onufry Wojtaszczyk},
title = {Breaking the 2\({}^{\mbox{n}}\)-barrier for Irredundance: Two lines
of attack},
journal = {J. Discrete Algorithms},
volume = {9},
number = {3},
pages = {214--230},
year = {2011},
url = {https://doi.org/10.1016/j.jda.2011.03.002},
doi = {10.1016/J.JDA.2011.03.002},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/Binkele-RaibleBCFKKLLPRW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/CyganPPPW11,
author = {Marek Cygan and
Geevarghese Philip and
Marcin Pilipczuk and
Michal Pilipczuk and
Jakub Onufry Wojtaszczyk},
title = {Dominating set is fixed parameter tractable in claw-free graphs},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {50},
pages = {6982--7000},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.09.010},
doi = {10.1016/J.TCS.2011.09.010},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/CyganPPPW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/CyganKRRW11,
author = {Marek Cygan and
Marcin Kubica and
Jakub Radoszewski and
Wojciech Rytter and
Tomasz Walen},
editor = {Raffaele Giancarlo and
Giovanni Manzini},
title = {Polynomial-Time Approximation Algorithms for Weighted {LCS} Problem},
booktitle = {Combinatorial Pattern Matching - 22nd Annual Symposium, {CPM} 2011,
Palermo, Italy, June 27-29, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6661},
pages = {455--466},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-21458-5\_38},
doi = {10.1007/978-3-642-21458-5\_38},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cpm/CyganKRRW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/CyganPPW11,
author = {Marek Cygan and
Marcin Pilipczuk and
Michal Pilipczuk and
Jakub Onufry Wojtaszczyk},
editor = {Camil Demetrescu and
Magn{\'{u}}s M. Halld{\'{o}}rsson},
title = {Scheduling Partially Ordered Jobs Faster Than 2 n},
booktitle = {Algorithms - {ESA} 2011 - 19th Annual European Symposium, Saarbr{\"{u}}cken,
Germany, September 5-9, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6942},
pages = {299--310},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-23719-5\_26},
doi = {10.1007/978-3-642-23719-5\_26},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/esa/CyganPPW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/CyganNPPRW11,
author = {Marek Cygan and
Jesper Nederlof and
Marcin Pilipczuk and
Michal Pilipczuk and
Johan M. M. van Rooij and
Jakub Onufry Wojtaszczyk},
editor = {Rafail Ostrovsky},
title = {Solving Connectivity Problems Parameterized by Treewidth in Single
Exponential Time},
booktitle = {{IEEE} 52nd Annual Symposium on Foundations of Computer Science, {FOCS}
2011, Palm Springs, CA, USA, October 22-25, 2011},
pages = {150--159},
publisher = {{IEEE} Computer Society},
year = {2011},
url = {https://doi.org/10.1109/FOCS.2011.23},
doi = {10.1109/FOCS.2011.23},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/CyganNPPRW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/CyganGLMPS11,
author = {Marek Cygan and
Fabrizio Grandoni and
Stefano Leonardi and
Marcin Mucha and
Marcin Pilipczuk and
Piotr Sankowski},
editor = {Supratik Chakraborty and
Amit Kumar},
title = {Approximation Algorithms for Union and Intersection Covering Problems},
booktitle = {{IARCS} Annual Conference on Foundations of Software Technology and
Theoretical Computer Science, {FSTTCS} 2011, December 12-14, 2011,
Mumbai, India},
series = {LIPIcs},
volume = {13},
pages = {28--40},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2011},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2011.28},
doi = {10.4230/LIPICS.FSTTCS.2011.28},
timestamp = {Tue, 27 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/fsttcs/CyganGLMPS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/CyganPPW11,
author = {Marek Cygan and
Marcin Pilipczuk and
Michal Pilipczuk and
Jakub Onufry Wojtaszczyk},
editor = {Luca Aceto and
Monika Henzinger and
Jir{\'{\i}} Sgall},
title = {Subset Feedback Vertex Set Is Fixed-Parameter Tractable},
booktitle = {Automata, Languages and Programming - 38th International Colloquium,
{ICALP} 2011, Zurich, Switzerland, July 4-8, 2011, Proceedings, Part
{I}},
series = {Lecture Notes in Computer Science},
volume = {6755},
pages = {449--461},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-22006-7\_38},
doi = {10.1007/978-3-642-22006-7\_38},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/CyganPPW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/CyganPPW11,
author = {Marek Cygan and
Marcin Pilipczuk and
Michal Pilipczuk and
Jakub Onufry Wojtaszczyk},
editor = {D{\'{a}}niel Marx and
Peter Rossmanith},
title = {On Multiway Cut Parameterized above Lower Bounds},
booktitle = {Parameterized and Exact Computation - 6th International Symposium,
{IPEC} 2011, Saarbr{\"{u}}cken, Germany, September 6-8, 2011.
Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {7112},
pages = {1--12},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-28050-4\_1},
doi = {10.1007/978-3-642-28050-4\_1},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/iwpec/CyganPPW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/CyganFL11,
author = {Marek Cygan and
Fedor V. Fomin and
Erik Jan van Leeuwen},
editor = {D{\'{a}}niel Marx and
Peter Rossmanith},
title = {Parameterized Complexity of Firefighting Revisited},
booktitle = {Parameterized and Exact Computation - 6th International Symposium,
{IPEC} 2011, Saarbr{\"{u}}cken, Germany, September 6-8, 2011.
Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {7112},
pages = {13--26},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-28050-4\_2},
doi = {10.1007/978-3-642-28050-4\_2},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/iwpec/CyganFL11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/CyganLPPS11,
author = {Marek Cygan and
Daniel Lokshtanov and
Marcin Pilipczuk and
Michal Pilipczuk and
Saket Saurabh},
editor = {D{\'{a}}niel Marx and
Peter Rossmanith},
title = {On the Hardness of Losing Width},
booktitle = {Parameterized and Exact Computation - 6th International Symposium,
{IPEC} 2011, Saarbr{\"{u}}cken, Germany, September 6-8, 2011.
Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {7112},
pages = {159--168},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-28050-4\_13},
doi = {10.1007/978-3-642-28050-4\_13},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/iwpec/CyganLPPS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/CyganLPPS11a,
author = {Marek Cygan and
Daniel Lokshtanov and
Marcin Pilipczuk and
Michal Pilipczuk and
Saket Saurabh},
editor = {D{\'{a}}niel Marx and
Peter Rossmanith},
title = {On Cutwidth Parameterized by Vertex Cover},
booktitle = {Parameterized and Exact Computation - 6th International Symposium,
{IPEC} 2011, Saarbr{\"{u}}cken, Germany, September 6-8, 2011.
Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {7112},
pages = {246--258},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-28050-4\_20},
doi = {10.1007/978-3-642-28050-4\_20},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/iwpec/CyganLPPS11a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/CyganPPW11,
author = {Marek Cygan and
Marcin Pilipczuk and
Michal Pilipczuk and
Jakub Onufry Wojtaszczyk},
editor = {Dana Randall},
title = {The stubborn problem is stubborn no more (a polynomial algorithm for
3-compatible colouring and the stubborn list partition problem)},
booktitle = {Proceedings of the Twenty-Second Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2011, San Francisco, California, USA, January 23-25,
2011},
pages = {1666--1674},
publisher = {{SIAM}},
year = {2011},
url = {https://doi.org/10.1137/1.9781611973082.128},
doi = {10.1137/1.9781611973082.128},
timestamp = {Tue, 02 Feb 2021 17:07:23 +0100},
biburl = {https://dblp.org/rec/conf/soda/CyganPPW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/CyganMPPS11,
author = {Marek Cygan and
D{\'{a}}niel Marx and
Marcin Pilipczuk and
Michal Pilipczuk and
Ildik{\'{o}} Schlotter},
editor = {Petr Kolman and
Jan Kratochv{\'{\i}}l},
title = {Parameterized Complexity of Eulerian Deletion Problems},
booktitle = {Graph-Theoretic Concepts in Computer Science - 37th International
Workshop, {WG} 2011, Tepl{\'{a}} Monastery, Czech Republic, June
21-24, 2011. Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {6986},
pages = {131--142},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-25870-1\_13},
doi = {10.1007/978-3-642-25870-1\_13},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/CyganMPPS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1102-5105,
author = {Marek Cygan and
Fabrizio Grandoni and
Stefano Leonardi and
Marcin Mucha and
Marcin Pilipczuk and
Piotr Sankowski},
title = {Approximation Algorithms for Union and Intersection Covering Problems},
journal = {CoRR},
volume = {abs/1102.5105},
year = {2011},
url = {http://arxiv.org/abs/1102.5105},
eprinttype = {arXiv},
eprint = {1102.5105},
timestamp = {Tue, 27 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1102-5105.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1103-0534,
author = {Marek Cygan and
Jesper Nederlof and
Marcin Pilipczuk and
Michal Pilipczuk and
Johan M. M. van Rooij and
Jakub Onufry Wojtaszczyk},
title = {Solving connectivity problems parameterized by treewidth in single
exponential time},
journal = {CoRR},
volume = {abs/1103.0534},
year = {2011},
url = {http://arxiv.org/abs/1103.0534},
eprinttype = {arXiv},
eprint = {1103.0534},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1103-0534.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1103-2275,
author = {Marek Cygan and
Lukasz Kowalik},
title = {Channel Assignment via Fast Zeta Transform},
journal = {CoRR},
volume = {abs/1103.2275},
year = {2011},
url = {http://arxiv.org/abs/1103.2275},
eprinttype = {arXiv},
eprint = {1103.2275},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1103-2275.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1107-1585,
author = {Marek Cygan and
Marcin Pilipczuk and
Michal Pilipczuk and
Jakub Onufry Wojtaszczyk},
title = {On Multiway Cut parameterized above lower bounds},
journal = {CoRR},
volume = {abs/1107.1585},
year = {2011},
url = {http://arxiv.org/abs/1107.1585},
eprinttype = {arXiv},
eprint = {1107.1585},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1107-1585.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1108-0810,
author = {Marek Cygan and
Marcin Pilipczuk and
Michal Pilipczuk and
Jakub Onufry Wojtaszczyk},
title = {Scheduling partially ordered jobs faster than 2{\^{}}n},
journal = {CoRR},
volume = {abs/1108.0810},
year = {2011},
url = {http://arxiv.org/abs/1108.0810},
eprinttype = {arXiv},
eprint = {1108.0810},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1108-0810.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1109-4729,
author = {Marek Cygan and
Fedor V. Fomin and
Erik Jan van Leeuwen},
title = {Parameterized Complexity of Firefighting Revisited},
journal = {CoRR},
volume = {abs/1109.4729},
year = {2011},
url = {http://arxiv.org/abs/1109.4729},
eprinttype = {arXiv},
eprint = {1109.4729},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1109-4729.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1111-0570,
author = {Marek Cygan and
Stefan Kratsch and
Marcin Pilipczuk and
Michal Pilipczuk and
Magnus Wahlstr{\"{o}}m},
title = {Clique cover and graph separation: New incompressibility results},
journal = {CoRR},
volume = {abs/1111.0570},
year = {2011},
url = {http://arxiv.org/abs/1111.0570},
eprinttype = {arXiv},
eprint = {1111.0570},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1111-0570.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1112-2273,
author = {Marek Cygan and
Guy Kortsarz and
Zeev Nutov},
title = {Steiner Forest Orientation Problems},
journal = {CoRR},
volume = {abs/1112.2273},
year = {2011},
url = {http://arxiv.org/abs/1112.2273},
eprinttype = {arXiv},
eprint = {1112.2273},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1112-2273.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1112-2275,
author = {Marek Cygan and
Holger Dell and
Daniel Lokshtanov and
D{\'{a}}niel Marx and
Jesper Nederlof and
Yoshio Okamoto and
Ramamohan Paturi and
Saket Saurabh and
Magnus Wahlstr{\"{o}}m},
title = {On Problems as Hard as {CNFSAT}},
journal = {CoRR},
volume = {abs/1112.2275},
year = {2011},
url = {http://arxiv.org/abs/1112.2275},
eprinttype = {arXiv},
eprint = {1112.2275},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1112-2275.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1112-6255,
author = {Marek Cygan and
Marcin Pilipczuk and
Michal Pilipczuk},
title = {On group feedback vertex set parameterized by the size of the cutset},
journal = {CoRR},
volume = {abs/1112.6255},
year = {2011},
url = {http://arxiv.org/abs/1112.6255},
eprinttype = {arXiv},
eprint = {1112.6255},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1112-6255.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/CyganP10,
author = {Marek Cygan and
Marcin Pilipczuk},
title = {Exact and approximate bandwidth},
journal = {Theor. Comput. Sci.},
volume = {411},
number = {40-42},
pages = {3701--3713},
year = {2010},
url = {https://doi.org/10.1016/j.tcs.2010.06.018},
doi = {10.1016/J.TCS.2010.06.018},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/CyganP10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/CyganKL10,
author = {Marek Cygan and
Lukasz Kowalik and
Borut Luzar},
editor = {Tiziana Calamoneri and
Josep D{\'{\i}}az},
title = {A Planar Linear Arboricity Conjecture},
booktitle = {Algorithms and Complexity, 7th International Conference, {CIAC} 2010,
Rome, Italy, May 26-28, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6078},
pages = {204--216},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-13073-1\_19},
doi = {10.1007/978-3-642-13073-1\_19},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/CyganKL10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/CyganPW10,
author = {Marek Cygan and
Marcin Pilipczuk and
Jakub Onufry Wojtaszczyk},
editor = {Tiziana Calamoneri and
Josep D{\'{\i}}az},
title = {Irredundant Set Faster Than \emph{O}(2\({}^{\mbox{\emph{n}}}\))},
booktitle = {Algorithms and Complexity, 7th International Conference, {CIAC} 2010,
Rome, Italy, May 26-28, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6078},
pages = {288--298},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-13073-1\_26},
doi = {10.1007/978-3-642-13073-1\_26},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/CyganPW10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/CrochemoreCIKRRW10,
author = {Maxime Crochemore and
Marek Cygan and
Costas S. Iliopoulos and
Marcin Kubica and
Jakub Radoszewski and
Wojciech Rytter and
Tomasz Walen},
editor = {Amihood Amir and
Laxmi Parida},
title = {Algorithms for Three Versions of the Shortest Common Superstring Problem},
booktitle = {Combinatorial Pattern Matching, 21st Annual Symposium, {CPM} 2010,
New York, NY, USA, June 21-23, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6129},
pages = {299--309},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-13509-5\_27},
doi = {10.1007/978-3-642-13509-5\_27},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cpm/CrochemoreCIKRRW10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/CyganKMPS10,
author = {Marek Cygan and
Lukasz Kowalik and
Marcin Mucha and
Marcin Pilipczuk and
Piotr Sankowski},
editor = {Mark de Berg and
Ulrich Meyer},
title = {Fast Approximation in Subspaces by Doubling Metric Decomposition},
booktitle = {Algorithms - {ESA} 2010, 18th Annual European Symposium, Liverpool,
UK, September 6-8, 2010. Proceedings, Part {I}},
series = {Lecture Notes in Computer Science},
volume = {6346},
pages = {72--83},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-15775-2\_7},
doi = {10.1007/978-3-642-15775-2\_7},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/esa/CyganKMPS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/CyganPPW10,
author = {Marek Cygan and
Marcin Pilipczuk and
Michal Pilipczuk and
Jakub Onufry Wojtaszczyk},
editor = {Venkatesh Raman and
Saket Saurabh},
title = {An Improved {FPT} Algorithm and Quadratic Kernel for Pathwidth One
Vertex Deletion},
booktitle = {Parameterized and Exact Computation - 5th International Symposium,
{IPEC} 2010, Chennai, India, December 13-15, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6478},
pages = {95--106},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-17493-3\_11},
doi = {10.1007/978-3-642-17493-3\_11},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/iwpec/CyganPPW10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/CyganPW10,
author = {Marek Cygan and
Marcin Pilipczuk and
Jakub Onufry Wojtaszczyk},
editor = {Haim Kaplan},
title = {Capacitated Domination Faster Than \emph{O}(2\({}^{\mbox{\emph{n}}}\))},
booktitle = {Algorithm Theory - {SWAT} 2010, 12th Scandinavian Symposium and Workshops
on Algorithm Theory, Bergen, Norway, June 21-23, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6139},
pages = {74--80},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-13731-0\_8},
doi = {10.1007/978-3-642-13731-0\_8},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/CyganPW10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/CyganPPW10,
author = {Marek Cygan and
Marcin Pilipczuk and
Michal Pilipczuk and
Jakub Onufry Wojtaszczyk},
editor = {Dimitrios M. Thilikos},
title = {Kernelization Hardness of Connectivity Problems in \emph{d}-Degenerate
Graphs},
booktitle = {Graph Theoretic Concepts in Computer Science - 36th International
Workshop, {WG} 2010, Zar{\'{o}}s, Crete, Greece, June 28-30,
2010 Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {6410},
pages = {147--158},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-16926-7\_15},
doi = {10.1007/978-3-642-16926-7\_15},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/CyganPPW10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1004-2972,
author = {Marek Cygan and
Marcin Pilipczuk and
Michal Pilipczuk and
Jakub Onufry Wojtaszczyk},
title = {Subset feedback vertex set is fixed parameter tractable},
journal = {CoRR},
volume = {abs/1004.2972},
year = {2010},
url = {http://arxiv.org/abs/1004.2972},
eprinttype = {arXiv},
eprint = {1004.2972},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1004-2972.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1004-5010,
author = {Marek Cygan and
Marcin Pilipczuk and
Michal Pilipczuk and
Jakub Onufry Wojtaszczyk},
title = {The stubborn problem is stubborn no more (a polynomial algorithm for
3-compatible colouring and the stubborn list partition problem)},
journal = {CoRR},
volume = {abs/1004.5010},
year = {2010},
url = {http://arxiv.org/abs/1004.5010},
eprinttype = {arXiv},
eprint = {1004.5010},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1004-5010.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1004-5012,
author = {Marek Cygan and
Marcin Pilipczuk},
title = {Bandwidth and Distortion Revisited},
journal = {CoRR},
volume = {abs/1004.5012},
year = {2010},
url = {http://arxiv.org/abs/1004.5012},
eprinttype = {arXiv},
eprint = {1004.5012},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1004-5012.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1011-6239,
author = {Marek Cygan and
Geevarghese Philip and
Marcin Pilipczuk and
Michal Pilipczuk and
Jakub Onufry Wojtaszczyk},
title = {Dominating Set is Fixed Parameter Tractable in Claw-free Graphs},
journal = {CoRR},
volume = {abs/1011.6239},
year = {2010},
url = {http://arxiv.org/abs/1011.6239},
eprinttype = {arXiv},
eprint = {1011.6239},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1011-6239.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/CyganKW09,
author = {Marek Cygan and
Lukasz Kowalik and
Mateusz Wykurz},
title = {Exponential-time approximation of weighted set cover},
journal = {Inf. Process. Lett.},
volume = {109},
number = {16},
pages = {957--961},
year = {2009},
url = {https://doi.org/10.1016/j.ipl.2009.05.003},
doi = {10.1016/J.IPL.2009.05.003},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/CyganKW09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/CyganP09,
author = {Marek Cygan and
Marcin Pilipczuk},
editor = {Susanne Albers and
Alberto Marchetti{-}Spaccamela and
Yossi Matias and
Sotiris E. Nikoletseas and
Wolfgang Thomas},
title = {Exact and Approximate Bandwidth},
booktitle = {Automata, Languages and Programming, 36th International Colloquium,
{ICALP} 2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part {I}},
series = {Lecture Notes in Computer Science},
volume = {5555},
pages = {304--315},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-02927-1\_26},
doi = {10.1007/978-3-642-02927-1\_26},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/CyganP09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0902-1661,
author = {Marek Cygan and
Marcin Pilipczuk},
title = {Even Faster Exact Bandwidth},
journal = {CoRR},
volume = {abs/0902.1661},
year = {2009},
url = {http://arxiv.org/abs/0902.1661},
eprinttype = {arXiv},
eprint = {0902.1661},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0902-1661.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0909-4021,
author = {Marek Cygan and
Marcin Pilipczuk and
Jakub Onufry Wojtaszczyk},
title = {Beyond O*(2{\^{}}n) in domination-type problems},
journal = {CoRR},
volume = {abs/0909.4021},
year = {2009},
url = {http://arxiv.org/abs/0909.4021},
eprinttype = {arXiv},
eprint = {0909.4021},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0909-4021.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0911-1626,
author = {Marek Cygan and
Lukasz Kowalik and
Marcin Mucha and
Marcin Pilipczuk and
Piotr Sankowski},
title = {Fast Approximation in Subspaces by Doubling Metric Decomposition},
journal = {CoRR},
volume = {abs/0911.1626},
year = {2009},
url = {http://arxiv.org/abs/0911.1626},
eprinttype = {arXiv},
eprint = {0911.1626},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0911-1626.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/CyganP08,
author = {Marek Cygan and
Marcin Pilipczuk},
editor = {Hajo Broersma and
Thomas Erlebach and
Tom Friedetzky and
Dani{\"{e}}l Paulusma},
title = {Faster Exact Bandwidth},
booktitle = {Graph-Theoretic Concepts in Computer Science, 34th International Workshop,
{WG} 2008, Durham, UK, June 30 - July 2, 2008. Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {5344},
pages = {101--109},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-92248-3\_10},
doi = {10.1007/978-3-540-92248-3\_10},
timestamp = {Sun, 25 Oct 2020 23:07:56 +0100},
biburl = {https://dblp.org/rec/conf/wg/CyganP08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0810-4934,
author = {Marek Cygan and
Lukasz Kowalik and
Marcin Pilipczuk and
Mateusz Wykurz},
title = {Exponential-Time Approximation of Hard Problems},
journal = {CoRR},
volume = {abs/0810.4934},
year = {2008},
url = {http://arxiv.org/abs/0810.4934},
eprinttype = {arXiv},
eprint = {0810.4934},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0810-4934.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:47 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:
