Stop the war!
Остановите войну!
for scientists:
default search action
BibTeX records: Bart M. P. Jansen
@article{DBLP:journals/toct/JansenW24, author = {Bart M. P. Jansen and Michal Wlodarczyk}, title = {Optimal Polynomial-Time Compression for Boolean Max {CSP}}, journal = {{ACM} Trans. Comput. Theory}, volume = {16}, number = {1}, pages = {4:1--4:20}, year = {2024}, url = {https://doi.org/10.1145/3624704}, doi = {10.1145/3624704}, timestamp = {Tue, 26 Mar 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/toct/JansenW24.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/JaffkeJ23, author = {Lars Jaffke and Bart M. P. Jansen}, title = {Fine-grained parameterized complexity analysis of graph coloring problems}, journal = {Discret. Appl. Math.}, volume = {327}, pages = {33--46}, year = {2023}, url = {https://doi.org/10.1016/j.dam.2022.11.011}, doi = {10.1016/J.DAM.2022.11.011}, timestamp = {Sat, 13 May 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dam/JaffkeJ23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jcss/EinarsonGJMW23, author = {Carl Einarson and Gregory Z. Gutin and Bart M. P. Jansen and Diptapriyo Majumdar and Magnus Wahlstr{\"{o}}m}, title = {\emph{p}-Edge/vertex-connected vertex cover: Parameterized and approximation algorithms}, journal = {J. Comput. Syst. Sci.}, volume = {133}, pages = {23--40}, year = {2023}, url = {https://doi.org/10.1016/j.jcss.2022.11.002}, doi = {10.1016/J.JCSS.2022.11.002}, timestamp = {Sat, 13 May 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jcss/EinarsonGJMW23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jcss/DonkersJK23, author = {Huib Donkers and Bart M. P. Jansen and Jari J. H. de Kroon}, title = {Finding \emph{k}-secluded trees faster}, journal = {J. Comput. Syst. Sci.}, volume = {138}, pages = {103461}, year = {2023}, url = {https://doi.org/10.1016/j.jcss.2023.05.006}, doi = {10.1016/J.JCSS.2023.05.006}, timestamp = {Tue, 12 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jcss/DonkersJK23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/esa/JansenK023, author = {Bart M. P. Jansen and Jari J. H. de Kroon and Michal Wlodarczyk}, editor = {Inge Li G{\o}rtz and Martin Farach{-}Colton and Simon J. Puglisi and Grzegorz Herman}, title = {5-Approximation for {\(\mathscr{H}\)}-Treewidth Essentially as Fast as {\(\mathscr{H}\)}-Deletion Parameterized by Solution Size}, booktitle = {31st Annual European Symposium on Algorithms, {ESA} 2023, September 4-6, 2023, Amsterdam, The Netherlands}, series = {LIPIcs}, volume = {274}, pages = {66:1--66:16}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2023}, url = {https://doi.org/10.4230/LIPIcs.ESA.2023.66}, doi = {10.4230/LIPICS.ESA.2023.66}, timestamp = {Wed, 30 Aug 2023 15:40:45 +0200}, biburl = {https://dblp.org/rec/conf/esa/JansenK023.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/gd/JansenKKLMS23, author = {Bart M. P. Jansen and Liana Khazaliya and Philipp Kindermann and Giuseppe Liotta and Fabrizio Montecchiani and Kirill Simonov}, editor = {Michael A. Bekos and Markus Chimani}, title = {Upward and Orthogonal Planarity are W[1]-Hard Parameterized by Treewidth}, booktitle = {Graph Drawing and Network Visualization - 31st International Symposium, {GD} 2023, Isola delle Femmine, Palermo, Italy, September 20-22, 2023, Revised Selected Papers, Part {II}}, series = {Lecture Notes in Computer Science}, volume = {14466}, pages = {203--217}, publisher = {Springer}, year = {2023}, url = {https://doi.org/10.1007/978-3-031-49275-4\_14}, doi = {10.1007/978-3-031-49275-4\_14}, timestamp = {Sat, 10 Feb 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/gd/JansenKKLMS23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/JansenK023, author = {Bart M. P. Jansen and Jari J. H. de Kroon and Michal Wlodarczyk}, editor = {Satoru Iwata and Naonori Kakimura}, title = {Single-Exponential {FPT} Algorithms for Enumerating Secluded {\(\mathscr{F}\)}-Free Subgraphs and Deleting to Scattered Graph Classes}, booktitle = {34th International Symposium on Algorithms and Computation, {ISAAC} 2023, December 3-6, 2023, Kyoto, Japan}, series = {LIPIcs}, volume = {283}, pages = {42:1--42:18}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2023}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2023.42}, doi = {10.4230/LIPICS.ISAAC.2023.42}, timestamp = {Tue, 28 Nov 2023 13:12:50 +0100}, biburl = {https://dblp.org/rec/conf/isaac/JansenK023.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/iwpec/JansenS23, author = {Bart M. P. Jansen and Bart van der Steenhoven}, editor = {Neeldhara Misra and Magnus Wahlstr{\"{o}}m}, title = {Kernelization for Counting Problems on Graphs: Preserving the Number of Minimum Solutions}, booktitle = {18th International Symposium on Parameterized and Exact Computation, {IPEC} 2023, September 6-8, 2023, Amsterdam, The Netherlands}, series = {LIPIcs}, volume = {285}, pages = {27:1--27:15}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2023}, url = {https://doi.org/10.4230/LIPIcs.IPEC.2023.27}, doi = {10.4230/LIPICS.IPEC.2023.27}, timestamp = {Wed, 13 Dec 2023 14:08:59 +0100}, biburl = {https://dblp.org/rec/conf/iwpec/JansenS23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/iwpec/JansenR23, author = {Bart M. P. Jansen and Shivesh Kumar Roy}, editor = {Neeldhara Misra and Magnus Wahlstr{\"{o}}m}, title = {On the Parameterized Complexity of Multiway Near-Separator}, booktitle = {18th International Symposium on Parameterized and Exact Computation, {IPEC} 2023, September 6-8, 2023, Amsterdam, The Netherlands}, series = {LIPIcs}, volume = {285}, pages = {28:1--28:18}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2023}, url = {https://doi.org/10.4230/LIPIcs.IPEC.2023.28}, doi = {10.4230/LIPICS.IPEC.2023.28}, timestamp = {Wed, 13 Dec 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/iwpec/JansenR23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/iwpec/JansenR23a, author = {Bart M. P. Jansen and Shivesh Kumar Roy}, editor = {Neeldhara Misra and Magnus Wahlstr{\"{o}}m}, title = {Sunflowers Meet Sparsity: {A} Linear-Vertex Kernel for Weighted Clique-Packing on Sparse Graphs}, booktitle = {18th International Symposium on Parameterized and Exact Computation, {IPEC} 2023, September 6-8, 2023, Amsterdam, The Netherlands}, series = {LIPIcs}, volume = {285}, pages = {29:1--29:13}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2023}, url = {https://doi.org/10.4230/LIPIcs.IPEC.2023.29}, doi = {10.4230/LIPICS.IPEC.2023.29}, timestamp = {Wed, 13 Dec 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/iwpec/JansenR23a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2306-17065, author = {Bart M. P. Jansen and Jari J. H. de Kroon and Michal Wlodarczyk}, title = {5-Approximation for {\textdollar}{\textbackslash}mathcal\{H\}{\textdollar}-Treewidth Essentially as Fast as {\textdollar}{\textbackslash}mathcal\{H\}{\textdollar}-Deletion Parameterized by Solution Size}, journal = {CoRR}, volume = {abs/2306.17065}, year = {2023}, url = {https://doi.org/10.48550/arXiv.2306.17065}, doi = {10.48550/ARXIV.2306.17065}, eprinttype = {arXiv}, eprint = {2306.17065}, timestamp = {Mon, 03 Jul 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2306-17065.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2309-01264, author = {Bart M. P. Jansen and Liana Khazaliya and Philipp Kindermann and Giuseppe Liotta and Fabrizio Montecchiani and Kirill Simonov}, title = {Upward and Orthogonal Planarity are W[1]-hard Parameterized by Treewidth}, journal = {CoRR}, volume = {abs/2309.01264}, year = {2023}, url = {https://doi.org/10.48550/arXiv.2309.01264}, doi = {10.48550/ARXIV.2309.01264}, eprinttype = {arXiv}, eprint = {2309.01264}, timestamp = {Mon, 11 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2309-01264.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2309-11366, author = {Bart M. P. Jansen and Jari J. H. de Kroon and Michal Wlodarczyk}, title = {Single-Exponential {FPT} Algorithms for Enumerating Secluded F-Free Subgraphs and Deleting to Scattered Graph Classes}, journal = {CoRR}, volume = {abs/2309.11366}, year = {2023}, url = {https://doi.org/10.48550/arXiv.2309.11366}, doi = {10.48550/ARXIV.2309.11366}, eprinttype = {arXiv}, eprint = {2309.11366}, timestamp = {Mon, 25 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2309-11366.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2310-04303, author = {Bart M. P. Jansen and Bart van der Steenhoven}, title = {Kernelization for Counting Problems on Graphs: Preserving the Number of Minimum Solutions}, journal = {CoRR}, volume = {abs/2310.04303}, year = {2023}, url = {https://doi.org/10.48550/arXiv.2310.04303}, doi = {10.48550/ARXIV.2310.04303}, eprinttype = {arXiv}, eprint = {2310.04303}, timestamp = {Fri, 20 Oct 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2310-04303.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2310-04332, author = {Bart M. P. Jansen and Shivesh Kumar Roy}, title = {On the Parameterized Complexity of Multiway Near-Separator}, journal = {CoRR}, volume = {abs/2310.04332}, year = {2023}, url = {https://doi.org/10.48550/arXiv.2310.04332}, doi = {10.48550/ARXIV.2310.04332}, eprinttype = {arXiv}, eprint = {2310.04332}, timestamp = {Fri, 20 Oct 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2310-04332.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/DonkersJW22, author = {Huib Donkers and Bart M. P. Jansen and Michal Wlodarczyk}, title = {Preprocessing for Outerplanar Vertex Deletion: An Elementary Kernel of Quartic Size}, journal = {Algorithmica}, volume = {84}, number = {11}, pages = {3407--3458}, year = {2022}, url = {https://doi.org/10.1007/s00453-022-00984-2}, doi = {10.1007/S00453-022-00984-2}, timestamp = {Sun, 13 Nov 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/algorithmica/DonkersJW22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jcss/JansenK22, author = {Bart M. P. Jansen and Jari J. H. de Kroon}, title = {Preprocessing vertex-deletion problems: Characterizing graph properties by low-rank adjacencies}, journal = {J. Comput. Syst. Sci.}, volume = {126}, pages = {59--79}, year = {2022}, url = {https://doi.org/10.1016/j.jcss.2021.12.003}, doi = {10.1016/J.JCSS.2021.12.003}, timestamp = {Fri, 13 May 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jcss/JansenK22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamdm/BougeretJS22, author = {Marin Bougeret and Bart M. P. Jansen and Ignasi Sau}, title = {Bridge-Depth Characterizes which Minor-Closed Structural Parameterizations of Vertex Cover Admit a Polynomial Kernel}, journal = {{SIAM} J. Discret. Math.}, volume = {36}, number = {4}, pages = {2737--2773}, year = {2022}, url = {https://doi.org/10.1137/21m1400766}, doi = {10.1137/21M1400766}, timestamp = {Sat, 11 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/siamdm/BougeretJS22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/esa/BumpusJK22, author = {Benjamin Merlin Bumpus and Bart M. P. Jansen and Jari J. H. de Kroon}, editor = {Shiri Chechik and Gonzalo Navarro and Eva Rotenberg and Grzegorz Herman}, title = {Search-Space Reduction via Essential Vertices}, booktitle = {30th Annual European Symposium on Algorithms, {ESA} 2022, September 5-9, 2022, Berlin/Potsdam, Germany}, series = {LIPIcs}, volume = {244}, pages = {30:1--30:15}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2022}, url = {https://doi.org/10.4230/LIPIcs.ESA.2022.30}, doi = {10.4230/LIPICS.ESA.2022.30}, timestamp = {Wed, 28 Feb 2024 00:16:41 +0100}, biburl = {https://dblp.org/rec/conf/esa/BumpusJK22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/Jansen022, author = {Bart M. P. Jansen and Michal Wlodarczyk}, editor = {Stefano Leonardi and Anupam Gupta}, title = {Lossy planarization: a constant-factor approximate kernelization for planar vertex deletion}, booktitle = {{STOC} '22: 54th Annual {ACM} {SIGACT} Symposium on Theory of Computing, Rome, Italy, June 20 - 24, 2022}, pages = {900--913}, publisher = {{ACM}}, year = {2022}, url = {https://doi.org/10.1145/3519935.3520021}, doi = {10.1145/3519935.3520021}, timestamp = {Tue, 27 Dec 2022 09:06:31 +0100}, biburl = {https://dblp.org/rec/conf/stoc/Jansen022.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/DekkerJ22, author = {David Dekker and Bart M. P. Jansen}, editor = {Michael A. Bekos and Michael Kaufmann}, title = {Kernelization for Feedback Vertex Set via Elimination Distance to a Forest}, booktitle = {Graph-Theoretic Concepts in Computer Science - 48th International Workshop, {WG} 2022, T{\"{u}}bingen, Germany, June 22-24, 2022, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {13453}, pages = {158--172}, publisher = {Springer}, year = {2022}, url = {https://doi.org/10.1007/978-3-031-15914-5\_12}, doi = {10.1007/978-3-031-15914-5\_12}, timestamp = {Mon, 24 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/DekkerJ22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/DonkersJK22, author = {Huib Donkers and Bart M. P. Jansen and Jari J. H. de Kroon}, editor = {Michael A. Bekos and Michael Kaufmann}, title = {Finding k-Secluded Trees Faster}, booktitle = {Graph-Theoretic Concepts in Computer Science - 48th International Workshop, {WG} 2022, T{\"{u}}bingen, Germany, June 22-24, 2022, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {13453}, pages = {173--186}, publisher = {Springer}, year = {2022}, url = {https://doi.org/10.1007/978-3-031-15914-5\_13}, doi = {10.1007/978-3-031-15914-5\_13}, timestamp = {Mon, 24 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/DonkersJK22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2202-02174, author = {Bart M. P. Jansen and Michal Wlodarczyk}, title = {Lossy Planarization: {A} Constant-Factor Approximate Kernelization for Planar Vertex Deletion}, journal = {CoRR}, volume = {abs/2202.02174}, year = {2022}, url = {https://arxiv.org/abs/2202.02174}, eprinttype = {arXiv}, eprint = {2202.02174}, timestamp = {Wed, 09 Feb 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2202-02174.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2206-04387, author = {David Dekker and Bart M. P. Jansen}, title = {Kernelization for Feedback Vertex Set via Elimination Distance to a Forest}, journal = {CoRR}, volume = {abs/2206.04387}, year = {2022}, url = {https://doi.org/10.48550/arXiv.2206.04387}, doi = {10.48550/ARXIV.2206.04387}, eprinttype = {arXiv}, eprint = {2206.04387}, timestamp = {Tue, 14 Jun 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2206-04387.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2206-09884, author = {Huib Donkers and Bart M. P. Jansen and Jari J. H. de Kroon}, title = {Finding k-Secluded Trees Faster}, journal = {CoRR}, volume = {abs/2206.09884}, year = {2022}, url = {https://doi.org/10.48550/arXiv.2206.09884}, doi = {10.48550/ARXIV.2206.09884}, eprinttype = {arXiv}, eprint = {2206.09884}, timestamp = {Mon, 27 Jun 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2206-09884.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2207-00386, author = {Benjamin Merlin Bumpus and Bart M. P. Jansen and Jari J. H. de Kroon}, title = {Search-Space Reduction via Essential Vertices}, journal = {CoRR}, volume = {abs/2207.00386}, year = {2022}, url = {https://doi.org/10.48550/arXiv.2207.00386}, doi = {10.48550/ARXIV.2207.00386}, eprinttype = {arXiv}, eprint = {2207.00386}, timestamp = {Wed, 06 Jul 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2207-00386.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/JansenT21, author = {Bart M. P. Jansen and Jan Arne Telle}, title = {Special Issue Dedicated to the 14th International Symposium on Parameterized and Exact Computation}, journal = {Algorithmica}, volume = {83}, number = {8}, pages = {2469--2470}, year = {2021}, url = {https://doi.org/10.1007/s00453-021-00853-4}, doi = {10.1007/S00453-021-00853-4}, timestamp = {Tue, 27 Jul 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/algorithmica/JansenT21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jcss/DonkersJ21, author = {Huib Donkers and Bart M. P. Jansen}, title = {A Turing kernelization dichotomy for structural parameterizations of F-Minor-Free Deletion}, journal = {J. Comput. Syst. Sci.}, volume = {119}, pages = {164--182}, year = {2021}, url = {https://doi.org/10.1016/j.jcss.2021.02.005}, doi = {10.1016/J.JCSS.2021.02.005}, timestamp = {Fri, 14 May 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jcss/DonkersJ21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamdm/JansenPL21, author = {Bart M. P. Jansen and Marcin Pilipczuk and Erik Jan van Leeuwen}, title = {A Deterministic Polynomial Kernel for Odd Cycle Transversal and Vertex Multiway Cut in Planar Graphs}, journal = {{SIAM} J. Discret. Math.}, volume = {35}, number = {4}, pages = {2387--2429}, year = {2021}, url = {https://doi.org/10.1137/20M1353782}, doi = {10.1137/20M1353782}, timestamp = {Sat, 09 Apr 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamdm/JansenPL21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/talg/BergBJW21, author = {Mark de Berg and Kevin Buchin and Bart M. P. Jansen and Gerhard J. Woeginger}, title = {Fine-grained Complexity Analysis of Two Classic {TSP} Variants}, journal = {{ACM} Trans. Algorithms}, volume = {17}, number = {1}, pages = {5:1--5:29}, year = {2021}, url = {https://doi.org/10.1145/3414845}, doi = {10.1145/3414845}, timestamp = {Mon, 03 Jan 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/talg/BergBJW21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/iwpec/DonkersJ021, author = {Huib Donkers and Bart M. P. Jansen and Michal Wlodarczyk}, editor = {Petr A. Golovach and Meirav Zehavi}, title = {Preprocessing for Outerplanar Vertex Deletion: An Elementary Kernel of Quartic Size}, booktitle = {16th International Symposium on Parameterized and Exact Computation, {IPEC} 2021, September 8-10, 2021, Lisbon, Portugal}, series = {LIPIcs}, volume = {214}, pages = {14:1--14:18}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2021}, url = {https://doi.org/10.4230/LIPIcs.IPEC.2021.14}, doi = {10.4230/LIPICS.IPEC.2021.14}, timestamp = {Tue, 23 Nov 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/iwpec/DonkersJ021.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/mfcs/JansenR021, author = {Bart M. P. Jansen and Shivesh Kumar Roy and Michal Wlodarczyk}, editor = {Filippo Bonchi and Simon J. Puglisi}, title = {On the Hardness of Compressing Weights}, booktitle = {46th International Symposium on Mathematical Foundations of Computer Science, {MFCS} 2021, August 23-27, 2021, Tallinn, Estonia}, series = {LIPIcs}, volume = {202}, pages = {64:1--64:21}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2021}, url = {https://doi.org/10.4230/LIPIcs.MFCS.2021.64}, doi = {10.4230/LIPICS.MFCS.2021.64}, timestamp = {Tue, 16 Nov 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/mfcs/JansenR021.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/JansenK021, author = {Bart M. P. Jansen and Jari J. H. de Kroon and Michal Wlodarczyk}, editor = {Samir Khuller and Virginia Vassilevska Williams}, title = {Vertex deletion parameterized by elimination distance and even less}, booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing, Virtual Event, Italy, June 21-25, 2021}, pages = {1757--1769}, publisher = {{ACM}}, year = {2021}, url = {https://doi.org/10.1145/3406325.3451068}, doi = {10.1145/3406325.3451068}, timestamp = {Sat, 08 Jan 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/JansenK021.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/DonkersJ21, author = {Huib Donkers and Bart M. P. Jansen}, editor = {Lukasz Kowalik and Michal Pilipczuk and Pawel Rzazewski}, title = {Preprocessing to Reduce the Search Space: Antler Structures for Feedback Vertex Set}, booktitle = {Graph-Theoretic Concepts in Computer Science - 47th International Workshop, {WG} 2021, Warsaw, Poland, June 23-25, 2021, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {12911}, pages = {1--14}, publisher = {Springer}, year = {2021}, url = {https://doi.org/10.1007/978-3-030-86838-3\_1}, doi = {10.1007/978-3-030-86838-3\_1}, timestamp = {Tue, 05 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/DonkersJ21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/JansenK21, author = {Bart M. P. Jansen and Jari J. H. de Kroon}, editor = {Lukasz Kowalik and Michal Pilipczuk and Pawel Rzazewski}, title = {{FPT} Algorithms to Compute the Elimination Distance to Bipartite Graphs and More}, booktitle = {Graph-Theoretic Concepts in Computer Science - 47th International Workshop, {WG} 2021, Warsaw, Poland, June 23-25, 2021, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {12911}, pages = {80--93}, publisher = {Springer}, year = {2021}, url = {https://doi.org/10.1007/978-3-030-86838-3\_6}, doi = {10.1007/978-3-030-86838-3\_6}, timestamp = {Tue, 05 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/JansenK21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2103-09715, author = {Bart M. P. Jansen and Jari J. H. de Kroon and Michal Wlodarczyk}, title = {Vertex Deletion Parameterized by Elimination Distance and Even Less}, journal = {CoRR}, volume = {abs/2103.09715}, year = {2021}, url = {https://arxiv.org/abs/2103.09715}, eprinttype = {arXiv}, eprint = {2103.09715}, timestamp = {Thu, 01 Apr 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2103-09715.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2106-04191, author = {Bart M. P. Jansen and Jari J. H. de Kroon}, title = {{FPT} Algorithms to Compute the Elimination Distance to Bipartite Graphs and More}, journal = {CoRR}, volume = {abs/2106.04191}, year = {2021}, url = {https://arxiv.org/abs/2106.04191}, eprinttype = {arXiv}, eprint = {2106.04191}, timestamp = {Fri, 11 Jun 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2106-04191.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2106-11675, author = {Huib Donkers and Bart M. P. Jansen}, title = {Preprocessing to Reduce the Search Space: Antler Structures for Feedback Vertex Set}, journal = {CoRR}, volume = {abs/2106.11675}, year = {2021}, url = {https://arxiv.org/abs/2106.11675}, eprinttype = {arXiv}, eprint = {2106.11675}, timestamp = {Wed, 30 Jun 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2106-11675.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2107-02554, author = {Bart M. P. Jansen and Shivesh Kumar Roy and Michal Wlodarczyk}, title = {On the Hardness of Compressing Weights}, journal = {CoRR}, volume = {abs/2107.02554}, year = {2021}, url = {https://arxiv.org/abs/2107.02554}, eprinttype = {arXiv}, eprint = {2107.02554}, timestamp = {Tue, 16 Nov 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2107-02554.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2110-01868, author = {Huib Donkers and Bart M. P. Jansen and Michal Wlodarczyk}, title = {Preprocessing for Outerplanar Vertex Deletion: An Elementary Kernel of Quartic Size}, journal = {CoRR}, volume = {abs/2110.01868}, year = {2021}, url = {https://arxiv.org/abs/2110.01868}, eprinttype = {arXiv}, eprint = {2110.01868}, timestamp = {Fri, 08 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2110-01868.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/ChenJP20, author = {Hubie Chen and Bart M. P. Jansen and Astrid Pieterse}, title = {Best-Case and Worst-Case Sparsifiability of Boolean CSPs}, journal = {Algorithmica}, volume = {82}, number = {8}, pages = {2200--2242}, year = {2020}, url = {https://doi.org/10.1007/s00453-019-00660-y}, doi = {10.1007/S00453-019-00660-Y}, timestamp = {Wed, 26 Aug 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/algorithmica/ChenJP20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/JansenW20, author = {Bart M. P. Jansen and Jules J. H. M. Wulms}, title = {Lower bounds for protrusion replacement by counting equivalence classes}, journal = {Discret. Appl. Math.}, volume = {278}, pages = {12--27}, year = {2020}, url = {https://doi.org/10.1016/j.dam.2019.02.024}, doi = {10.1016/J.DAM.2019.02.024}, timestamp = {Fri, 22 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dam/JansenW20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgaa/GeffenJKM20, author = {Bas A. M. van Geffen and Bart M. P. Jansen and Arnoud A. W. M. de Kroon and Rolf Morel}, title = {Lower Bounds for Dynamic Programming on Planar Graphs of Bounded Cutwidth}, journal = {J. Graph Algorithms Appl.}, volume = {24}, number = {3}, pages = {461--482}, year = {2020}, url = {https://doi.org/10.7155/jgaa.00542}, doi = {10.7155/JGAA.00542}, timestamp = {Tue, 16 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jgaa/GeffenJKM20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/JansenP20, author = {Bart M. P. Jansen and Astrid Pieterse}, title = {Polynomial kernels for hitting forbidden minors under structural parameterizations}, journal = {Theor. Comput. Sci.}, volume = {841}, pages = {124--166}, year = {2020}, url = {https://doi.org/10.1016/j.tcs.2020.07.009}, doi = {10.1016/J.TCS.2020.07.009}, timestamp = {Wed, 30 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcs/JansenP20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/birthday/Jansen20, author = {Bart M. P. Jansen}, editor = {Fedor V. Fomin and Stefan Kratsch and Erik Jan van Leeuwen}, title = {Crossing Paths with Hans Bodlaender: {A} Personal View on Cross-Composition for Sparsification Lower Bounds}, booktitle = {Treewidth, Kernels, and Algorithms - Essays Dedicated to Hans L. Bodlaender on the Occasion of His 60th Birthday}, series = {Lecture Notes in Computer Science}, volume = {12160}, pages = {89--111}, publisher = {Springer}, year = {2020}, url = {https://doi.org/10.1007/978-3-030-42071-0\_8}, doi = {10.1007/978-3-030-42071-0\_8}, timestamp = {Thu, 05 Jan 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/birthday/Jansen20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/esa/Jansen020, author = {Bart M. P. Jansen and Michal Wlodarczyk}, editor = {Fabrizio Grandoni and Grzegorz Herman and Peter Sanders}, title = {Optimal Polynomial-Time Compression for Boolean Max {CSP}}, booktitle = {28th Annual European Symposium on Algorithms, {ESA} 2020, September 7-9, 2020, Pisa, Italy (Virtual Conference)}, series = {LIPIcs}, volume = {173}, pages = {63:1--63:19}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2020}, url = {https://doi.org/10.4230/LIPIcs.ESA.2020.63}, doi = {10.4230/LIPICS.ESA.2020.63}, timestamp = {Thu, 16 Sep 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/esa/Jansen020.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/BougeretJS20, author = {Marin Bougeret and Bart M. P. Jansen and Ignasi Sau}, editor = {Artur Czumaj and Anuj Dawar and Emanuela Merelli}, title = {Bridge-Depth Characterizes Which Structural Parameterizations of Vertex Cover Admit a Polynomial Kernel}, booktitle = {47th International Colloquium on Automata, Languages, and Programming, {ICALP} 2020, July 8-11, 2020, Saarbr{\"{u}}cken, Germany (Virtual Conference)}, series = {LIPIcs}, volume = {168}, pages = {16:1--16:19}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2020}, url = {https://doi.org/10.4230/LIPIcs.ICALP.2020.16}, doi = {10.4230/LIPICS.ICALP.2020.16}, timestamp = {Thu, 16 Sep 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/icalp/BougeretJS20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/ChenJOPR20, author = {Hubie Chen and Bart M. P. Jansen and Karolina Okrasa and Astrid Pieterse and Pawel Rzazewski}, editor = {Yixin Cao and Siu{-}Wing Cheng and Minming Li}, title = {Sparsification Lower Bounds for List H-Coloring}, booktitle = {31st International Symposium on Algorithms and Computation, {ISAAC} 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)}, series = {LIPIcs}, volume = {181}, pages = {58:1--58:17}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2020}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2020.58}, doi = {10.4230/LIPICS.ISAAC.2020.58}, timestamp = {Thu, 16 Sep 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/ChenJOPR20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/swat/JansenK20, author = {Bart M. P. Jansen and Jari J. H. de Kroon}, editor = {Susanne Albers}, title = {Preprocessing Vertex-Deletion Problems: Characterizing Graph Properties by Low-Rank Adjacencies}, booktitle = {17th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT} 2020, June 22-24, 2020, T{\'{o}}rshavn, Faroe Islands}, series = {LIPIcs}, volume = {162}, pages = {27:1--27:15}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2020}, url = {https://doi.org/10.4230/LIPIcs.SWAT.2020.27}, doi = {10.4230/LIPICS.SWAT.2020.27}, timestamp = {Tue, 16 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/swat/JansenK20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2002-03443, author = {Bart M. P. Jansen and Michal Wlodarczyk}, title = {Optimal polynomial-time compression for Boolean Max {CSP}}, journal = {CoRR}, volume = {abs/2002.03443}, year = {2020}, url = {https://arxiv.org/abs/2002.03443}, eprinttype = {arXiv}, eprint = {2002.03443}, timestamp = {Thu, 01 Apr 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2002-03443.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2004-08818, author = {Bart M. P. Jansen and Jari J. H. de Kroon}, title = {Preprocessing Vertex-Deletion Problems: Characterizing Graph Properties by Low-Rank Adjacencies}, journal = {CoRR}, volume = {abs/2004.08818}, year = {2020}, url = {https://arxiv.org/abs/2004.08818}, eprinttype = {arXiv}, eprint = {2004.08818}, timestamp = {Wed, 22 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2004-08818.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2004-12865, author = {Marin Bougeret and Bart M. P. Jansen and Ignasi Sau}, title = {Bridge-Depth Characterizes which Structural Parameterizations of Vertex Cover Admit a Polynomial Kernel}, journal = {CoRR}, volume = {abs/2004.12865}, year = {2020}, url = {https://arxiv.org/abs/2004.12865}, eprinttype = {arXiv}, eprint = {2004.12865}, timestamp = {Wed, 29 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2004-12865.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2009-08158, author = {Carl Einarson and Gregory Z. Gutin and Bart M. P. Jansen and Diptapriyo Majumdar and Magnus Wahlstr{\"{o}}m}, title = {p-Edge/Vertex-Connected Vertex Cover: Parameterized and Approximation Algorithms}, journal = {CoRR}, volume = {abs/2009.08158}, year = {2020}, url = {https://arxiv.org/abs/2009.08158}, eprinttype = {arXiv}, eprint = {2009.08158}, timestamp = {Thu, 14 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2009-08158.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2009-08353, author = {Hubie Chen and Bart M. P. Jansen and Karolina Okrasa and Astrid Pieterse and Pawel Rzazewski}, title = {Sparsification Lower Bounds for List H-Coloring}, journal = {CoRR}, volume = {abs/2009.08353}, year = {2020}, url = {https://arxiv.org/abs/2009.08353}, eprinttype = {arXiv}, eprint = {2009.08353}, timestamp = {Wed, 23 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2009-08353.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/JansenP19, author = {Bart M. P. Jansen and Astrid Pieterse}, title = {Optimal Data Reduction for Graph Coloring Using Low-Degree Polynomials}, journal = {Algorithmica}, volume = {81}, number = {10}, pages = {3865--3889}, year = {2019}, url = {https://doi.org/10.1007/s00453-019-00578-5}, doi = {10.1007/S00453-019-00578-5}, timestamp = {Thu, 31 Oct 2019 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/algorithmica/JansenP19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/JansenPW19, author = {Bart M. P. Jansen and Marcin Pilipczuk and Marcin Wrochna}, title = {Turing Kernelization for Finding Long Paths in Graph Classes Excluding a Topological Minor}, journal = {Algorithmica}, volume = {81}, number = {10}, pages = {3936--3967}, year = {2019}, url = {https://doi.org/10.1007/s00453-019-00614-4}, doi = {10.1007/S00453-019-00614-4}, timestamp = {Thu, 31 Oct 2019 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/algorithmica/JansenPW19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/JansenN19, author = {Bart M. P. Jansen and Jesper Nederlof}, title = {Computing the chromatic number using graph decompositions via matrix rank}, journal = {Theor. Comput. Sci.}, volume = {795}, pages = {520--539}, year = {2019}, url = {https://doi.org/10.1016/j.tcs.2019.08.006}, doi = {10.1016/J.TCS.2019.08.006}, timestamp = {Thu, 31 Oct 2019 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/JansenN19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/toct/JansenP19, author = {Bart M. P. Jansen and Astrid Pieterse}, title = {Optimal Sparsification for Some Binary CSPs Using Low-Degree Polynomials}, journal = {{ACM} Trans. Comput. Theory}, volume = {11}, number = {4}, pages = {28:1--28:26}, year = {2019}, url = {https://doi.org/10.1145/3349618}, doi = {10.1145/3349618}, timestamp = {Sat, 08 Jan 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/toct/JansenP19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/esa/BonnetIJK19, author = {{\'{E}}douard Bonnet and Yoichi Iwata and Bart M. P. Jansen and Lukasz Kowalik}, editor = {Michael A. Bender and Ola Svensson and Grzegorz Herman}, title = {Fine-Grained Complexity of k-OPT in Bounded-Degree Graphs for Solving {TSP}}, booktitle = {27th Annual European Symposium on Algorithms, {ESA} 2019, September 9-11, 2019, Munich/Garching, Germany}, series = {LIPIcs}, volume = {144}, pages = {23:1--23:14}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2019}, url = {https://doi.org/10.4230/LIPIcs.ESA.2019.23}, doi = {10.4230/LIPICS.ESA.2019.23}, timestamp = {Mon, 23 Sep 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/esa/BonnetIJK19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/JansenPL19, author = {Bart M. P. Jansen and Marcin Pilipczuk and Erik Jan van Leeuwen}, editor = {Rolf Niedermeier and Christophe Paul}, title = {A Deterministic Polynomial Kernel for Odd Cycle Transversal and Vertex Multiway Cut in Planar Graphs}, booktitle = {36th International Symposium on Theoretical Aspects of Computer Science, {STACS} 2019, March 13-16, 2019, Berlin, Germany}, series = {LIPIcs}, volume = {126}, pages = {39:1--39:18}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2019}, url = {https://doi.org/10.4230/LIPIcs.STACS.2019.39}, doi = {10.4230/LIPICS.STACS.2019.39}, timestamp = {Tue, 11 Feb 2020 15:52:14 +0100}, biburl = {https://dblp.org/rec/conf/stacs/JansenPL19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Jansen0N19, author = {Bart M. P. Jansen and L{\'{a}}szl{\'{o}} Kozma and Jesper Nederlof}, editor = {Ignasi Sau and Dimitrios M. Thilikos}, title = {Hamiltonicity Below Dirac's Condition}, booktitle = {Graph-Theoretic Concepts in Computer Science - 45th International Workshop, {WG} 2019, Vall de N{\'{u}}ria, Spain, June 19-21, 2019, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {11789}, pages = {27--39}, publisher = {Springer}, year = {2019}, url = {https://doi.org/10.1007/978-3-030-30786-8\_3}, doi = {10.1007/978-3-030-30786-8\_3}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/Jansen0N19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/DonkersJ19, author = {Huib Donkers and Bart M. P. Jansen}, editor = {Ignasi Sau and Dimitrios M. Thilikos}, title = {A Turing Kernelization Dichotomy for Structural Parameterizations of {\(\mathscr{F}\)} -Minor-Free Deletion}, booktitle = {Graph-Theoretic Concepts in Computer Science - 45th International Workshop, {WG} 2019, Vall de N{\'{u}}ria, Spain, June 19-21, 2019, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {11789}, pages = {106--119}, publisher = {Springer}, year = {2019}, url = {https://doi.org/10.1007/978-3-030-30786-8\_9}, doi = {10.1007/978-3-030-30786-8\_9}, timestamp = {Mon, 23 Sep 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/DonkersJ19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@proceedings{DBLP:conf/iwpec/2019, editor = {Bart M. P. Jansen and Jan Arne Telle}, title = {14th International Symposium on Parameterized and Exact Computation, {IPEC} 2019, September 11-13, 2019, Munich, Germany}, series = {LIPIcs}, volume = {148}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2019}, url = {http://www.dagstuhl.de/dagpub/978-3-95977-129-0}, isbn = {978-3-95977-129-0}, timestamp = {Thu, 05 Dec 2019 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/iwpec/2019.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1902-01745, author = {Bart M. P. Jansen and L{\'{a}}szl{\'{o}} Kozma and Jesper Nederlof}, title = {Hamiltonicity below Dirac's condition}, journal = {CoRR}, volume = {abs/1902.01745}, year = {2019}, url = {http://arxiv.org/abs/1902.01745}, eprinttype = {arXiv}, eprint = {1902.01745}, timestamp = {Tue, 21 May 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1902-01745.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1906-05565, author = {Huib Donkers and Bart M. P. Jansen}, title = {A Turing Kernelization Dichotomy for Structural Parameterizations of F-Minor-Free Deletion}, journal = {CoRR}, volume = {abs/1906.05565}, year = {2019}, url = {http://arxiv.org/abs/1906.05565}, eprinttype = {arXiv}, eprint = {1906.05565}, timestamp = {Mon, 24 Jun 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1906-05565.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1908-09325, author = {{\'{E}}douard Bonnet and Yoichi Iwata and Bart M. P. Jansen and Lukasz Kowalik}, title = {Fine-Grained Complexity of k-OPT in Bounded-Degree Graphs for Solving {TSP}}, journal = {CoRR}, volume = {abs/1908.09325}, year = {2019}, url = {http://arxiv.org/abs/1908.09325}, eprinttype = {arXiv}, eprint = {1908.09325}, timestamp = {Thu, 29 Aug 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1908-09325.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/shonan-reports/JansenST19, author = {Bart M. P. Jansen and Christian Schulz and Hisao Tamaki}, title = {Parameterized Graph Algorithms {\&} Data Reduction: Theory Meets Practice {(NII} Shonan Meeting 144)}, journal = {{NII} Shonan Meet. Rep.}, volume = {2019}, year = {2019}, url = {https://shonan.nii.ac.jp/seminars/144/}, timestamp = {Thu, 17 Jun 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/shonan-reports/JansenST19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/BergJM18, author = {Mark de Berg and Bart M. P. Jansen and Debankur Mukherjee}, title = {Independent-set reconfiguration thresholds of hereditary graph classes}, journal = {Discret. Appl. Math.}, volume = {250}, pages = {165--182}, year = {2018}, url = {https://doi.org/10.1016/j.dam.2018.05.029}, doi = {10.1016/J.DAM.2018.05.029}, timestamp = {Mon, 03 Jan 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/BergJM18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamdm/JansenP18, author = {Bart M. P. Jansen and Marcin Pilipczuk}, title = {Approximation and Kernelization for Chordal Vertex Deletion}, journal = {{SIAM} J. Discret. Math.}, volume = {32}, number = {3}, pages = {2258--2301}, year = {2018}, url = {https://doi.org/10.1137/17M112035X}, doi = {10.1137/17M112035X}, timestamp = {Sat, 25 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamdm/JansenP18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/esa/JansenN18, author = {Bart M. P. Jansen and Jesper Nederlof}, editor = {Yossi Azar and Hannah Bast and Grzegorz Herman}, title = {Computing the Chromatic Number Using Graph Decompositions via Matrix Rank}, booktitle = {26th Annual European Symposium on Algorithms, {ESA} 2018, August 20-22, 2018, Helsinki, Finland}, series = {LIPIcs}, volume = {112}, pages = {47:1--47:15}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2018}, url = {https://doi.org/10.4230/LIPIcs.ESA.2018.47}, doi = {10.4230/LIPICS.ESA.2018.47}, timestamp = {Tue, 11 Feb 2020 15:52:14 +0100}, biburl = {https://dblp.org/rec/conf/esa/JansenN18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/esa/JansenP18, author = {Bart M. P. Jansen and Astrid Pieterse}, editor = {Yossi Azar and Hannah Bast and Grzegorz Herman}, title = {Polynomial Kernels for Hitting Forbidden Minors under Structural Parameterizations}, booktitle = {26th Annual European Symposium on Algorithms, {ESA} 2018, August 20-22, 2018, Helsinki, Finland}, series = {LIPIcs}, volume = {112}, pages = {48:1--48:15}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2018}, url = {https://doi.org/10.4230/LIPIcs.ESA.2018.48}, doi = {10.4230/LIPICS.ESA.2018.48}, timestamp = {Mon, 16 Sep 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/esa/JansenP18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/iwpec/GeffenJKM18, author = {Bas A. M. van Geffen and Bart M. P. Jansen and Arnoud A. W. M. de Kroon and Rolf Morel}, editor = {Christophe Paul and Michal Pilipczuk}, title = {Lower Bounds for Dynamic Programming on Planar Graphs of Bounded Cutwidth}, booktitle = {13th International Symposium on Parameterized and Exact Computation, {IPEC} 2018, August 20-24, 2018, Helsinki, Finland}, series = {LIPIcs}, volume = {115}, pages = {3:1--3:14}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2018}, url = {https://doi.org/10.4230/LIPIcs.IPEC.2018.3}, doi = {10.4230/LIPICS.IPEC.2018.3}, timestamp = {Tue, 11 Feb 2020 15:52:14 +0100}, biburl = {https://dblp.org/rec/conf/iwpec/GeffenJKM18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/iwpec/ChenJP18, author = {Hubie Chen and Bart M. P. Jansen and Astrid Pieterse}, editor = {Christophe Paul and Michal Pilipczuk}, title = {Best-Case and Worst-Case Sparsifiability of Boolean CSPs}, booktitle = {13th International Symposium on Parameterized and Exact Computation, {IPEC} 2018, August 20-24, 2018, Helsinki, Finland}, series = {LIPIcs}, volume = {115}, pages = {15:1--15:13}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2018}, url = {https://doi.org/10.4230/LIPIcs.IPEC.2018.15}, doi = {10.4230/LIPICS.IPEC.2018.15}, timestamp = {Fri, 27 Dec 2019 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/iwpec/ChenJP18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1802-02050, author = {Bart M. P. Jansen and Astrid Pieterse}, title = {Optimal Data Reduction for Graph Coloring Using Low-Degree Polynomials}, journal = {CoRR}, volume = {abs/1802.02050}, year = {2018}, url = {http://arxiv.org/abs/1802.02050}, eprinttype = {arXiv}, eprint = {1802.02050}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1802-02050.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1804-08885, author = {Bart M. P. Jansen and Astrid Pieterse}, title = {Polynomial Kernels for Hitting Forbidden Minors under Structural Parameterizations}, journal = {CoRR}, volume = {abs/1804.08885}, year = {2018}, url = {http://arxiv.org/abs/1804.08885}, eprinttype = {arXiv}, eprint = {1804.08885}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1804-08885.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1806-10501, author = {Bart M. P. Jansen and Jesper Nederlof}, title = {Computing the Chromatic Number Using Graph Decompositions via Matrix Rank}, journal = {CoRR}, volume = {abs/1806.10501}, year = {2018}, url = {http://arxiv.org/abs/1806.10501}, eprinttype = {arXiv}, eprint = {1806.10501}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1806-10501.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1806-10513, author = {Bas A. M. van Geffen and Bart M. P. Jansen and Arnoud A. W. M. de Kroon and Rolf Morel}, title = {Lower Bounds for Dynamic Programming on Planar Graphs of Bounded Cutwidth}, journal = {CoRR}, volume = {abs/1806.10513}, year = {2018}, url = {http://arxiv.org/abs/1806.10513}, eprinttype = {arXiv}, eprint = {1806.10513}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1806-10513.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1809-06171, author = {Hubie Chen and Bart M. P. Jansen and Astrid Pieterse}, title = {Best-case and Worst-case Sparsifiability of Boolean CSPs}, journal = {CoRR}, volume = {abs/1809.06171}, year = {2018}, url = {http://arxiv.org/abs/1809.06171}, eprinttype = {arXiv}, eprint = {1809.06171}, timestamp = {Fri, 05 Oct 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1809-06171.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1810-01136, author = {Bart M. P. Jansen and Marcin Pilipczuk and Erik Jan van Leeuwen}, title = {A deterministic polynomial kernel for Odd Cycle Transversal and Vertex Multiway Cut in planar graphs}, journal = {CoRR}, volume = {abs/1810.01136}, year = {2018}, url = {http://arxiv.org/abs/1810.01136}, eprinttype = {arXiv}, eprint = {1810.01136}, timestamp = {Tue, 30 Oct 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-1810-01136.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/JansenP17, author = {Bart M. P. Jansen and Astrid Pieterse}, title = {Sparsification Upper and Lower Bounds for Graph Problems and Not-All-Equal {SAT}}, journal = {Algorithmica}, volume = {79}, number = {1}, pages = {3--28}, year = {2017}, url = {https://doi.org/10.1007/s00453-016-0189-9}, doi = {10.1007/S00453-016-0189-9}, timestamp = {Sun, 02 Jun 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/algorithmica/JansenP17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jcss/Jansen17, author = {Bart M. P. Jansen}, title = {Turing kernelization for finding long paths and cycles in restricted graph classes}, journal = {J. Comput. Syst. Sci.}, volume = {85}, pages = {18--37}, year = {2017}, url = {https://doi.org/10.1016/j.jcss.2016.10.008}, doi = {10.1016/J.JCSS.2016.10.008}, timestamp = {Sat, 20 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jcss/Jansen17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgaa/Jansen17, author = {Bart M. P. Jansen}, title = {On Structural Parameterizations of Hitting Set: Hitting Paths in Graphs Using 2-SAT}, journal = {J. Graph Algorithms Appl.}, volume = {21}, number = {2}, pages = {219--243}, year = {2017}, url = {https://doi.org/10.7155/jgaa.00413}, doi = {10.7155/JGAA.00413}, timestamp = {Tue, 16 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jgaa/Jansen17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/talg/GiannopoulouJLS17, author = {Archontia C. Giannopoulou and Bart M. P. Jansen and Daniel Lokshtanov and Saket Saurabh}, title = {Uniform Kernelization Complexity of Hitting Forbidden Minors}, journal = {{ACM} Trans. Algorithms}, volume = {13}, number = {3}, pages = {35:1--35:35}, year = {2017}, url = {https://doi.org/10.1145/3029051}, doi = {10.1145/3029051}, timestamp = {Sat, 08 Jan 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/talg/GiannopoulouJLS17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/ciac/JaffkeJ17, author = {Lars Jaffke and Bart M. P. Jansen}, editor = {Dimitris Fotakis and Aris Pagourtzis and Vangelis Th. Paschos}, title = {Fine-Grained Parameterized Complexity Analysis of Graph Coloring Problems}, booktitle = {Algorithms and Complexity - 10th International Conference, {CIAC} 2017, Athens, Greece, May 24-26, 2017, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {10236}, pages = {345--356}, year = {2017}, url = {https://doi.org/10.1007/978-3-319-57586-5\_29}, doi = {10.1007/978-3-319-57586-5\_29}, timestamp = {Thu, 24 Mar 2022 11:08:56 +0100}, biburl = {https://dblp.org/rec/conf/ciac/JaffkeJ17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/iwpec/JansenP17, author = {Bart M. P. Jansen and Astrid Pieterse}, editor = {Daniel Lokshtanov and Naomi Nishimura}, title = {Optimal Data Reduction for Graph Coloring Using Low-Degree Polynomials}, booktitle = {12th International Symposium on Parameterized and Exact Computation, {IPEC} 2017, September 6-8, 2017, Vienna, Austria}, series = {LIPIcs}, volume = {89}, pages = {22:1--22:12}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.IPEC.2017.22}, doi = {10.4230/LIPICS.IPEC.2017.22}, timestamp = {Tue, 11 Feb 2020 15:52:14 +0100}, biburl = {https://dblp.org/rec/conf/iwpec/JansenP17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/iwpec/JansenPW17, author = {Bart M. P. Jansen and Marcin Pilipczuk and Marcin Wrochna}, editor = {Daniel Lokshtanov and Naomi Nishimura}, title = {Turing Kernelization for Finding Long Paths in Graphs Excluding a Topological Minor}, booktitle = {12th International Symposium on Parameterized and Exact Computation, {IPEC} 2017, September 6-8, 2017, Vienna, Austria}, series = {LIPIcs}, volume = {89}, pages = {23:1--23:13}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.IPEC.2017.23}, doi = {10.4230/LIPICS.IPEC.2017.23}, timestamp = {Mon, 03 Jan 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/iwpec/JansenPW17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/JansenP17, author = {Bart M. P. Jansen and Marcin Pilipczuk}, editor = {Philip N. Klein}, title = {Approximation and Kernelization for Chordal Vertex Deletion}, booktitle = {Proceedings of the Twenty-Eighth Annual {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2017, Barcelona, Spain, Hotel Porta Fira, January 16-19}, pages = {1399--1418}, publisher = {{SIAM}}, year = {2017}, url = {https://doi.org/10.1137/1.9781611974782.91}, doi = {10.1137/1.9781611974782.91}, timestamp = {Tue, 02 Feb 2021 17:07:33 +0100}, biburl = {https://dblp.org/rec/conf/soda/JansenP17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/JaffkeJ17, author = {Lars Jaffke and Bart M. P. Jansen}, title = {Fine-Grained Parameterized Complexity Analysis of Graph Coloring Problems}, journal = {CoRR}, volume = {abs/1701.06985}, year = {2017}, url = {http://arxiv.org/abs/1701.06985}, eprinttype = {arXiv}, eprint = {1701.06985}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/JaffkeJ17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/JansenPW17, author = {Bart M. P. Jansen and Marcin Pilipczuk and Marcin Wrochna}, title = {Turing Kernelization for Finding Long Paths in Graph Classes Excluding a Topological Minor}, journal = {CoRR}, volume = {abs/1707.01797}, year = {2017}, url = {http://arxiv.org/abs/1707.01797}, eprinttype = {arXiv}, eprint = {1707.01797}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/JansenPW17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/fsttcs/BergJM16, author = {Mark de Berg and Bart M. P. Jansen and Debankur Mukherjee}, editor = {Akash Lal and S. Akshay and Saket Saurabh and Sandeep Sen}, title = {Independent-Set Reconfiguration Thresholds of Hereditary Graph Classes}, booktitle = {36th {IARCS} Annual Conference on Foundations of Software Technology and Theoretical Computer Science, {FSTTCS} 2016, December 13-15, 2016, Chennai, India}, series = {LIPIcs}, volume = {65}, pages = {34:1--34:15}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2016}, url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2016.34}, doi = {10.4230/LIPICS.FSTTCS.2016.34}, timestamp = {Tue, 30 Nov 2021 13:29:05 +0100}, biburl = {https://dblp.org/rec/conf/fsttcs/BergJM16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/BergBJW16, author = {Mark de Berg and Kevin Buchin and Bart M. P. Jansen and Gerhard J. Woeginger}, editor = {Ioannis Chatzigiannakis and Michael Mitzenmacher and Yuval Rabani and Davide Sangiorgi}, title = {Fine-Grained Complexity Analysis of Two Classic {TSP} Variants}, booktitle = {43rd International Colloquium on Automata, Languages, and Programming, {ICALP} 2016, July 11-15, 2016, Rome, Italy}, series = {LIPIcs}, volume = {55}, pages = {5:1--5:14}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2016}, url = {https://doi.org/10.4230/LIPIcs.ICALP.2016.5}, doi = {10.4230/LIPICS.ICALP.2016.5}, timestamp = {Tue, 11 Feb 2020 15:52:14 +0100}, biburl = {https://dblp.org/rec/conf/icalp/BergBJW16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/iwpec/JansenW16, author = {Bart M. P. Jansen and Jules J. H. M. Wulms}, editor = {Jiong Guo and Danny Hermelin}, title = {Lower Bounds for Protrusion Replacement by Counting Equivalence Classes}, booktitle = {11th International Symposium on Parameterized and Exact Computation, {IPEC} 2016, August 24-26, 2016, Aarhus, Denmark}, series = {LIPIcs}, volume = {63}, pages = {17:1--17:12}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2016}, url = {https://doi.org/10.4230/LIPIcs.IPEC.2016.17}, doi = {10.4230/LIPICS.IPEC.2016.17}, timestamp = {Tue, 11 Feb 2020 15:52:14 +0100}, biburl = {https://dblp.org/rec/conf/iwpec/JansenW16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/iwpec/DellHJKKR16, author = {Holger Dell and Thore Husfeldt and Bart M. P. Jansen and Petteri Kaski and Christian Komusiewicz and Frances A. Rosamond}, editor = {Jiong Guo and Danny Hermelin}, title = {The First Parameterized Algorithms and Computational Experiments Challenge}, booktitle = {11th International Symposium on Parameterized and Exact Computation, {IPEC} 2016, August 24-26, 2016, Aarhus, Denmark}, series = {LIPIcs}, volume = {63}, pages = {30:1--30:9}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2016}, url = {https://doi.org/10.4230/LIPIcs.IPEC.2016.30}, doi = {10.4230/LIPICS.IPEC.2016.30}, timestamp = {Fri, 30 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/iwpec/DellHJKKR16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/mfcs/JansenP16, author = {Bart M. P. Jansen and Astrid Pieterse}, editor = {Piotr Faliszewski and Anca Muscholl and Rolf Niedermeier}, title = {Optimal Sparsification for Some Binary CSPs Using Low-Degree Polynomials}, booktitle = {41st International Symposium on Mathematical Foundations of Computer Science, {MFCS} 2016, August 22-26, 2016 - Krak{\'{o}}w, Poland}, series = {LIPIcs}, volume = {58}, pages = {71:1--71:14}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2016}, url = {https://doi.org/10.4230/LIPIcs.MFCS.2016.71}, doi = {10.4230/LIPICS.MFCS.2016.71}, timestamp = {Tue, 11 Feb 2020 15:52:14 +0100}, biburl = {https://dblp.org/rec/conf/mfcs/JansenP16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/Jansen16, author = {Bart M. P. Jansen}, editor = {Nicolas Ollinger and Heribert Vollmer}, title = {Constrained Bipartite Vertex Cover: The Easy Kernel is Essentially Tight}, booktitle = {33rd Symposium on Theoretical Aspects of Computer Science, {STACS} 2016, February 17-20, 2016, Orl{\'{e}}ans, France}, series = {LIPIcs}, volume = {47}, pages = {45:1--45:13}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2016}, url = {https://doi.org/10.4230/LIPIcs.STACS.2016.45}, doi = {10.4230/LIPICS.STACS.2016.45}, timestamp = {Tue, 11 Feb 2020 15:52:14 +0100}, biburl = {https://dblp.org/rec/conf/stacs/Jansen16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/JansenP16, author = {Bart M. P. Jansen and Marcin Pilipczuk}, title = {Approximation and Kernelization for Chordal Vertex Deletion}, journal = {CoRR}, volume = {abs/1605.03001}, year = {2016}, url = {http://arxiv.org/abs/1605.03001}, eprinttype = {arXiv}, eprint = {1605.03001}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/JansenP16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/JansenP16a, author = {Bart M. P. Jansen and Astrid Pieterse}, title = {Optimal Sparsification for Some Binary CSPs Using Low-degree Polynomials}, journal = {CoRR}, volume = {abs/1606.03233}, year = {2016}, url = {http://arxiv.org/abs/1606.03233}, eprinttype = {arXiv}, eprint = {1606.03233}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/JansenP16a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/BergBJW16, author = {Mark de Berg and Kevin Buchin and Bart M. P. Jansen and Gerhard J. Woeginger}, title = {Fine-Grained Complexity Analysis of Two Classic {TSP} Variants}, journal = {CoRR}, volume = {abs/1607.02725}, year = {2016}, url = {http://arxiv.org/abs/1607.02725}, eprinttype = {arXiv}, eprint = {1607.02725}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/BergBJW16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/JansenW16, author = {Bart M. P. Jansen and Jules J. H. M. Wulms}, title = {Lower Bounds for Protrusion Replacement by Counting Equivalence Classes}, journal = {CoRR}, volume = {abs/1609.09304}, year = {2016}, url = {http://arxiv.org/abs/1609.09304}, eprinttype = {arXiv}, eprint = {1609.09304}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/JansenW16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/BergJM16, author = {Mark de Berg and Bart M. P. Jansen and Debankur Mukherjee}, title = {Independent Set Reconfiguration Thresholds of Hereditary Graph Classes}, journal = {CoRR}, volume = {abs/1610.03766}, year = {2016}, url = {http://arxiv.org/abs/1610.03766}, eprinttype = {arXiv}, eprint = {1610.03766}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/BergJM16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/Jansen15, author = {Bart M. P. Jansen}, title = {On Sparsification for Computing Treewidth}, journal = {Algorithmica}, volume = {71}, number = {3}, pages = {605--635}, year = {2015}, url = {https://doi.org/10.1007/s00453-014-9924-2}, doi = {10.1007/S00453-014-9924-2}, timestamp = {Wed, 17 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/algorithmica/Jansen15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/esa/JansenK15, author = {Bart M. P. Jansen and Stefan Kratsch}, editor = {Nikhil Bansal and Irene Finocchi}, title = {A Structural Approach to Kernels for ILPs: Treewidth and Total Unimodularity}, booktitle = {Algorithms - {ESA} 2015 - 23rd Annual European Symposium, Patras, Greece, September 14-16, 2015, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {9294}, pages = {779--791}, publisher = {Springer}, year = {2015}, url = {https://doi.org/10.1007/978-3-662-48350-3\_65}, doi = {10.1007/978-3-662-48350-3\_65}, timestamp = {Tue, 15 Feb 2022 07:54:27 +0100}, biburl = {https://dblp.org/rec/conf/esa/JansenK15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/GiannopoulouJLS15, author = {Archontia C. Giannopoulou and Bart M. P. Jansen and Daniel Lokshtanov and Saket Saurabh}, editor = {Magn{\'{u}}s M. Halld{\'{o}}rsson and Kazuo Iwama and Naoki Kobayashi and Bettina Speckmann}, title = {Uniform Kernelization Complexity of Hitting Forbidden Minors}, booktitle = {Automata, Languages, and Programming - 42nd International Colloquium, {ICALP} 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part {I}}, series = {Lecture Notes in Computer Science}, volume = {9134}, pages = {629--641}, publisher = {Springer}, year = {2015}, url = {https://doi.org/10.1007/978-3-662-47672-7\_51}, doi = {10.1007/978-3-662-47672-7\_51}, timestamp = {Fri, 27 Mar 2020 09:02:59 +0100}, biburl = {https://dblp.org/rec/conf/icalp/GiannopoulouJLS15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/iwpec/JansenP15, author = {Bart M. P. Jansen and Astrid Pieterse}, editor = {Thore Husfeldt and Iyad A. Kanj}, title = {Sparsification Upper and Lower Bounds for Graphs Problems and Not-All-Equal {SAT}}, booktitle = {10th International Symposium on Parameterized and Exact Computation, {IPEC} 2015, September 16-18, 2015, Patras, Greece}, series = {LIPIcs}, volume = {43}, pages = {163--174}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2015}, url = {https://doi.org/10.4230/LIPIcs.IPEC.2015.163}, doi = {10.4230/LIPICS.IPEC.2015.163}, timestamp = {Tue, 11 Feb 2020 15:52:14 +0100}, biburl = {https://dblp.org/rec/conf/iwpec/JansenP15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/JansenM15, author = {Bart M. P. Jansen and D{\'{a}}niel Marx}, editor = {Piotr Indyk}, title = {Characterizing the easy-to-find subgraphs from the viewpoint of polynomial-time algorithms, kernels, and Turing kernels}, booktitle = {Proceedings of the Twenty-Sixth Annual {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2015, San Diego, CA, USA, January 4-6, 2015}, pages = {616--629}, publisher = {{SIAM}}, year = {2015}, url = {https://doi.org/10.1137/1.9781611973730.42}, doi = {10.1137/1.9781611973730.42}, timestamp = {Tue, 02 Feb 2021 17:07:30 +0100}, biburl = {https://dblp.org/rec/conf/soda/JansenM15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Jansen15, author = {Bart M. P. Jansen}, editor = {Ernst W. Mayr}, title = {On Structural Parameterizations of Hitting Set: Hitting Paths in Graphs Using 2-SAT}, 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 = {472--486}, publisher = {Springer}, year = {2015}, url = {https://doi.org/10.1007/978-3-662-53174-7\_33}, doi = {10.1007/978-3-662-53174-7\_33}, timestamp = {Tue, 14 May 2019 10:00:40 +0200}, biburl = {https://dblp.org/rec/conf/wg/Jansen15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/GiannopoulouJLS15, author = {Archontia C. Giannopoulou and Bart M. P. Jansen and Daniel Lokshtanov and Saket Saurabh}, title = {Uniform Kernelization Complexity of Hitting Forbidden Minors}, journal = {CoRR}, volume = {abs/1502.03965}, year = {2015}, url = {http://arxiv.org/abs/1502.03965}, eprinttype = {arXiv}, eprint = {1502.03965}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/GiannopoulouJLS15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/JansenK15a, author = {Bart M. P. Jansen and Stefan Kratsch}, title = {A structural approach to kernels for ILPs: Treewidth and Total Unimodularity}, journal = {CoRR}, volume = {abs/1506.07729}, year = {2015}, url = {http://arxiv.org/abs/1506.07729}, eprinttype = {arXiv}, eprint = {1506.07729}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/JansenK15a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/Jansen15a, author = {Bart M. P. Jansen}, title = {On Structural Parameterizations of Hitting Set: Hitting Paths in Graphs Using 2-SAT}, journal = {CoRR}, volume = {abs/1507.05890}, year = {2015}, url = {http://arxiv.org/abs/1507.05890}, eprinttype = {arXiv}, eprint = {1507.05890}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/Jansen15a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/JansenP15, author = {Bart M. P. Jansen and Astrid Pieterse}, title = {Sparsification Upper and Lower Bounds for Graph Problems and Not-All-Equal {SAT}}, journal = {CoRR}, volume = {abs/1509.07437}, year = {2015}, url = {http://arxiv.org/abs/1509.07437}, eprinttype = {arXiv}, eprint = {1509.07437}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/JansenP15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jcss/FominJP14, author = {Fedor V. Fomin and Bart M. P. Jansen and Michal Pilipczuk}, title = {Preprocessing subgraph and minor problems: When does a small vertex cover help?}, journal = {J. Comput. Syst. Sci.}, volume = {80}, number = {2}, pages = {468--495}, year = {2014}, url = {https://doi.org/10.1016/j.jcss.2013.09.004}, doi = {10.1016/J.JCSS.2013.09.004}, timestamp = {Tue, 16 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jcss/FominJP14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamdm/BodlaenderJK14, author = {Hans L. Bodlaender and Bart M. P. Jansen and Stefan Kratsch}, title = {Kernelization Lower Bounds by Cross-Composition}, journal = {{SIAM} J. Discret. Math.}, volume = {28}, number = {1}, pages = {277--305}, year = {2014}, url = {https://doi.org/10.1137/120880240}, doi = {10.1137/120880240}, timestamp = {Sat, 25 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamdm/BodlaenderJK14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/toct/FellowsJ14, author = {Michael R. Fellows and Bart M. P. Jansen}, title = {{FPT} is characterized by useful obstruction sets: Connecting algorithms, kernels, and quasi-orders}, journal = {{ACM} Trans. Comput. Theory}, volume = {6}, number = {4}, pages = {16:1--16:26}, year = {2014}, url = {https://doi.org/10.1145/2635820}, doi = {10.1145/2635820}, timestamp = {Mon, 08 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/toct/FellowsJ14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/esa/Jansen14, author = {Bart M. P. Jansen}, editor = {Andreas S. Schulz and Dorothea Wagner}, title = {Turing Kernelization for Finding Long Paths and Cycles in Restricted Graph Classes}, booktitle = {Algorithms - {ESA} 2014 - 22th Annual European Symposium, Wroclaw, Poland, September 8-10, 2014. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {8737}, pages = {579--591}, publisher = {Springer}, year = {2014}, url = {https://doi.org/10.1007/978-3-662-44777-2\_48}, doi = {10.1007/978-3-662-44777-2\_48}, timestamp = {Tue, 14 May 2019 10:00:54 +0200}, biburl = {https://dblp.org/rec/conf/esa/Jansen14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/JansenLS14, author = {Bart M. P. Jansen and Daniel Lokshtanov and Saket Saurabh}, editor = {Chandra Chekuri}, title = {A Near-Optimal Planarization Algorithm}, booktitle = {Proceedings of the Twenty-Fifth Annual {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2014, Portland, Oregon, USA, January 5-7, 2014}, pages = {1802--1811}, publisher = {{SIAM}}, year = {2014}, url = {https://doi.org/10.1137/1.9781611973402.130}, doi = {10.1137/1.9781611973402.130}, timestamp = {Tue, 02 Feb 2021 17:07:40 +0100}, biburl = {https://dblp.org/rec/conf/soda/JansenLS14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/Jansen14, author = {Bart M. P. Jansen}, title = {Turing Kernelization for Finding Long Paths and Cycles in Restricted Graph Classes}, journal = {CoRR}, volume = {abs/1402.4718}, year = {2014}, url = {http://arxiv.org/abs/1402.4718}, eprinttype = {arXiv}, eprint = {1402.4718}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/Jansen14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/JansenM14, author = {Bart M. P. Jansen and D{\'{a}}niel Marx}, title = {Characterizing the easy-to-find subgraphs from the viewpoint of polynomial-time algorithms, kernels, and Turing kernels}, journal = {CoRR}, volume = {abs/1410.0855}, year = {2014}, url = {http://arxiv.org/abs/1410.0855}, eprinttype = {arXiv}, eprint = {1410.0855}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/JansenM14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ejc/FellowsJR13, author = {Michael R. Fellows and Bart M. P. Jansen and Frances A. Rosamond}, title = {Towards fully multivariate algorithmics: Parameter ecology and the deconstruction of computational complexity}, journal = {Eur. J. Comb.}, volume = {34}, number = {3}, pages = {541--566}, year = {2013}, url = {https://doi.org/10.1016/j.ejc.2012.04.008}, doi = {10.1016/J.EJC.2012.04.008}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/ejc/FellowsJR13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iandc/JansenK13, author = {Bart M. P. Jansen and Stefan Kratsch}, title = {Data reduction for graph coloring problems}, journal = {Inf. Comput.}, volume = {231}, pages = {70--88}, year = {2013}, url = {https://doi.org/10.1016/j.ic.2013.08.005}, doi = {10.1016/J.IC.2013.08.005}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/iandc/JansenK13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mst/JansenB13, author = {Bart M. P. Jansen and Hans L. Bodlaender}, title = {Vertex Cover Kernelization Revisited - Upper and Lower Bounds for a Refined Parameter}, journal = {Theory Comput. Syst.}, volume = {53}, number = {2}, pages = {263--299}, year = {2013}, url = {https://doi.org/10.1007/s00224-012-9393-4}, doi = {10.1007/S00224-012-9393-4}, timestamp = {Sun, 02 Jun 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mst/JansenB13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamdm/BodlaenderJK13, author = {Hans L. Bodlaender and Bart M. P. Jansen and Stefan Kratsch}, title = {Preprocessing for Treewidth: {A} Combinatorial Analysis through Kernelization}, journal = {{SIAM} J. Discret. Math.}, volume = {27}, number = {4}, pages = {2108--2142}, year = {2013}, url = {https://doi.org/10.1137/120903518}, doi = {10.1137/120903518}, timestamp = {Sat, 25 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamdm/BodlaenderJK13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/BodlaenderJK13, author = {Hans L. Bodlaender and Bart M. P. Jansen and Stefan Kratsch}, title = {Kernel bounds for path and cycle problems}, journal = {Theor. Comput. Sci.}, volume = {511}, pages = {117--136}, year = {2013}, url = {https://doi.org/10.1016/j.tcs.2012.09.006}, doi = {10.1016/J.TCS.2012.09.006}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/BodlaenderJK13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/HeggernesHJKV13, author = {Pinar Heggernes and Pim van 't Hof and Bart M. P. Jansen and Stefan Kratsch and Yngve Villanger}, title = {Parameterized complexity of vertex deletion into perfect graph classes}, journal = {Theor. Comput. Sci.}, volume = {511}, pages = {172--180}, year = {2013}, url = {https://doi.org/10.1016/j.tcs.2012.03.013}, doi = {10.1016/J.TCS.2012.03.013}, timestamp = {Thu, 14 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcs/HeggernesHJKV13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/iwpec/Jansen13, author = {Bart M. P. Jansen}, editor = {Gregory Z. Gutin and Stefan Szeider}, title = {On Sparsification for Computing Treewidth}, booktitle = {Parameterized and Exact Computation - 8th International Symposium, {IPEC} 2013, Sophia Antipolis, France, September 4-6, 2013, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {8246}, pages = {216--229}, publisher = {Springer}, year = {2013}, url = {https://doi.org/10.1007/978-3-319-03898-8\_19}, doi = {10.1007/978-3-319-03898-8\_19}, timestamp = {Tue, 14 May 2019 10:00:45 +0200}, biburl = {https://dblp.org/rec/conf/iwpec/Jansen13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/FellowsJ13, author = {Michael R. Fellows and Bart M. P. Jansen}, editor = {Andreas Brandst{\"{a}}dt and Klaus Jansen and R{\"{u}}diger Reischuk}, title = {{FPT} Is Characterized by Useful Obstruction Sets}, booktitle = {Graph-Theoretic Concepts in Computer Science - 39th International Workshop, {WG} 2013, L{\"{u}}beck, Germany, June 19-21, 2013, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {8165}, pages = {261--273}, publisher = {Springer}, year = {2013}, url = {https://doi.org/10.1007/978-3-642-45043-3\_23}, doi = {10.1007/978-3-642-45043-3\_23}, timestamp = {Tue, 14 May 2019 10:00:40 +0200}, biburl = {https://dblp.org/rec/conf/wg/FellowsJ13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1305-3102, author = {Michael R. Fellows and Bart M. P. Jansen}, title = {{FPT} is Characterized by Useful Obstruction Sets}, journal = {CoRR}, volume = {abs/1305.3102}, year = {2013}, url = {http://arxiv.org/abs/1305.3102}, eprinttype = {arXiv}, eprint = {1305.3102}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1305-3102.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/Jansen13, author = {Bart M. P. Jansen}, title = {On Sparsification for Computing Treewidth}, journal = {CoRR}, volume = {abs/1308.3665}, year = {2013}, url = {http://arxiv.org/abs/1308.3665}, eprinttype = {arXiv}, eprint = {1308.3665}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/Jansen13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgaa/Jansen12, author = {Bart M. P. Jansen}, title = {Kernelization for Maximum Leaf Spanning Tree with Positive Vertex Weights}, journal = {J. Graph Algorithms Appl.}, volume = {16}, number = {4}, pages = {811--846}, year = {2012}, url = {https://doi.org/10.7155/jgaa.00279}, doi = {10.7155/JGAA.00279}, timestamp = {Tue, 16 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jgaa/Jansen12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/iwpec/FominJP12, author = {Fedor V. Fomin and Bart M. P. Jansen and Michal Pilipczuk}, editor = {Dimitrios M. Thilikos and Gerhard J. Woeginger}, title = {Preprocessing Subgraph and Minor Problems: When Does a Small Vertex Cover Help?}, booktitle = {Parameterized and Exact Computation - 7th International Symposium, {IPEC} 2012, Ljubljana, Slovenia, September 12-14, 2012. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7535}, pages = {97--108}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-33293-7\_11}, doi = {10.1007/978-3-642-33293-7\_11}, timestamp = {Sat, 19 Oct 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/iwpec/FominJP12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/swat/BodlaenderJK12, author = {Hans L. Bodlaender and Bart M. P. Jansen and Stefan Kratsch}, editor = {Fedor V. Fomin and Petteri Kaski}, title = {Kernel Bounds for Structural Parameterizations of Pathwidth}, 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 = {352--363}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-31155-0\_31}, doi = {10.1007/978-3-642-31155-0\_31}, timestamp = {Sun, 02 Jun 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/swat/BodlaenderJK12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1206-4912, author = {Fedor V. Fomin and Bart M. P. Jansen and Michal Pilipczuk}, title = {Preprocessing Subgraph and Minor Problems: When Does a Small Vertex Cover Help?}, journal = {CoRR}, volume = {abs/1206.4912}, year = {2012}, url = {http://arxiv.org/abs/1206.4912}, eprinttype = {arXiv}, eprint = {1206.4912}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1206-4912.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1206-5941, author = {Hans L. Bodlaender and Bart M. P. Jansen and Stefan Kratsch}, title = {Kernelization Lower Bounds By Cross-Composition}, journal = {CoRR}, volume = {abs/1206.5941}, year = {2012}, url = {http://arxiv.org/abs/1206.5941}, eprinttype = {arXiv}, eprint = {1206.5941}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1206-5941.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1207-4900, author = {Hans L. Bodlaender and Bart M. P. Jansen and Stefan Kratsch}, title = {Kernel Bounds for Structural Parameterizations of Pathwidth}, journal = {CoRR}, volume = {abs/1207.4900}, year = {2012}, url = {http://arxiv.org/abs/1207.4900}, eprinttype = {arXiv}, eprint = {1207.4900}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1207-4900.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/josis/AronovBBJJKLLSS11, author = {Boris Aronov and Kevin Buchin and Maike Buchin and Bart M. P. Jansen and Tom de Jong and Marc J. van Kreveld and Maarten L{\"{o}}ffler and Jun Luo and Rodrigo I. Silveira and Bettina Speckmann}, title = {Connect the dot: Computing feed-links for network extension}, journal = {J. Spatial Inf. Sci.}, volume = {3}, number = {1}, pages = {3--31}, year = {2011}, url = {https://doi.org/10.5311/JOSIS.2011.3.47}, doi = {10.5311/JOSIS.2011.3.47}, timestamp = {Thu, 21 Jul 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/josis/AronovBBJJKLLSS11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/fct/JansenK11, author = {Bart M. P. Jansen and Stefan Kratsch}, editor = {Olaf Owe and Martin Steffen and Jan Arne Telle}, title = {Data Reduction for Graph Coloring Problems}, booktitle = {Fundamentals of Computation Theory - 18th International Symposium, {FCT} 2011, Oslo, Norway, August 22-25, 2011. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {6914}, pages = {90--101}, publisher = {Springer}, year = {2011}, url = {https://doi.org/10.1007/978-3-642-22953-4\_8}, doi = {10.1007/978-3-642-22953-4\_8}, timestamp = {Tue, 14 May 2019 10:00:53 +0200}, biburl = {https://dblp.org/rec/conf/fct/JansenK11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/fct/HeggernesHJKV11, author = {Pinar Heggernes and Pim van 't Hof and Bart M. P. Jansen and Stefan Kratsch and Yngve Villanger}, editor = {Olaf Owe and Martin Steffen and Jan Arne Telle}, title = {Parameterized Complexity of Vertex Deletion into Perfect Graph Classes}, booktitle = {Fundamentals of Computation Theory - 18th International Symposium, {FCT} 2011, Oslo, Norway, August 22-25, 2011. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {6914}, pages = {240--251}, publisher = {Springer}, year = {2011}, url = {https://doi.org/10.1007/978-3-642-22953-4\_21}, doi = {10.1007/978-3-642-22953-4\_21}, timestamp = {Thu, 14 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/fct/HeggernesHJKV11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/BodlaenderJK11, author = {Hans L. Bodlaender and Bart M. P. Jansen and Stefan Kratsch}, editor = {Luca Aceto and Monika Henzinger and Jir{\'{\i}} Sgall}, title = {Preprocessing for Treewidth: {A} Combinatorial Analysis through Kernelization}, 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 = {437--448}, publisher = {Springer}, year = {2011}, url = {https://doi.org/10.1007/978-3-642-22006-7\_37}, doi = {10.1007/978-3-642-22006-7\_37}, timestamp = {Sun, 02 Jun 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/icalp/BodlaenderJK11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/iwpec/JansenK11, author = {Bart M. P. Jansen and Stefan Kratsch}, editor = {D{\'{a}}niel Marx and Peter Rossmanith}, title = {On Polynomial Kernels for Structural Parameterizations of Odd Cycle Transversal}, 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 = {132--144}, publisher = {Springer}, year = {2011}, url = {https://doi.org/10.1007/978-3-642-28050-4\_11}, doi = {10.1007/978-3-642-28050-4\_11}, timestamp = {Fri, 09 Apr 2021 18:49:30 +0200}, biburl = {https://dblp.org/rec/conf/iwpec/JansenK11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/iwpec/BodlaenderJK11, author = {Hans L. Bodlaender and Bart M. P. Jansen and Stefan Kratsch}, editor = {D{\'{a}}niel Marx and Peter Rossmanith}, title = {Kernel Bounds for Path and Cycle Problems}, 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 = {145--158}, publisher = {Springer}, year = {2011}, url = {https://doi.org/10.1007/978-3-642-28050-4\_12}, doi = {10.1007/978-3-642-28050-4\_12}, timestamp = {Sun, 02 Jun 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/iwpec/BodlaenderJK11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/BodlaenderJK11, author = {Hans L. Bodlaender and Bart M. P. Jansen and Stefan Kratsch}, editor = {Thomas Schwentick and Christoph D{\"{u}}rr}, title = {Cross-Composition: {A} New Technique for Kernelization Lower Bounds}, booktitle = {28th International Symposium on Theoretical Aspects of Computer Science, {STACS} 2011, March 10-12, 2011, Dortmund, Germany}, series = {LIPIcs}, volume = {9}, pages = {165--176}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2011}, url = {https://doi.org/10.4230/LIPIcs.STACS.2011.165}, doi = {10.4230/LIPICS.STACS.2011.165}, timestamp = {Tue, 11 Feb 2020 15:52:14 +0100}, biburl = {https://dblp.org/rec/conf/stacs/BodlaenderJK11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/JansenB11, author = {Bart M. P. Jansen and Hans L. Bodlaender}, editor = {Thomas Schwentick and Christoph D{\"{u}}rr}, title = {Vertex Cover Kernelization Revisited: Upper and Lower Bounds for a Refined Parameter}, booktitle = {28th International Symposium on Theoretical Aspects of Computer Science, {STACS} 2011, March 10-12, 2011, Dortmund, Germany}, series = {LIPIcs}, volume = {9}, pages = {177--188}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2011}, url = {https://doi.org/10.4230/LIPIcs.STACS.2011.177}, doi = {10.4230/LIPICS.STACS.2011.177}, timestamp = {Thu, 23 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stacs/JansenB11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1104-4217, author = {Hans L. Bodlaender and Bart M. P. Jansen and Stefan Kratsch}, title = {Preprocessing for Treewidth: {A} Combinatorial Analysis through Kernelization}, journal = {CoRR}, volume = {abs/1104.4217}, year = {2011}, url = {http://arxiv.org/abs/1104.4217}, eprinttype = {arXiv}, eprint = {1104.4217}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1104-4217.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1104-4229, author = {Bart M. P. Jansen and Stefan Kratsch}, title = {Data Reduction for Graph Coloring Problems}, journal = {CoRR}, volume = {abs/1104.4229}, year = {2011}, url = {http://arxiv.org/abs/1104.4229}, eprinttype = {arXiv}, eprint = {1104.4229}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1104-4229.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1106-4141, author = {Hans L. Bodlaender and Bart M. P. Jansen and Stefan Kratsch}, title = {Kernel Bounds for Path and Cycle Problems}, journal = {CoRR}, volume = {abs/1106.4141}, year = {2011}, url = {http://arxiv.org/abs/1106.4141}, eprinttype = {arXiv}, eprint = {1106.4141}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1106-4141.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1107-3658, author = {Bart M. P. Jansen and Stefan Kratsch}, title = {On Polynomial Kernels for Structural Parameterizations of Odd Cycle Transversal}, journal = {CoRR}, volume = {abs/1107.3658}, year = {2011}, url = {http://arxiv.org/abs/1107.3658}, eprinttype = {arXiv}, eprint = {1107.3658}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1107-3658.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/ciac/Jansen10, author = {Bart M. P. Jansen}, editor = {Tiziana Calamoneri and Josep D{\'{\i}}az}, title = {Kernelization for Maximum Leaf Spanning Tree with Positive Vertex Weights}, 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 = {192--203}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-13073-1\_18}, doi = {10.1007/978-3-642-13073-1\_18}, timestamp = {Tue, 14 May 2019 10:00:53 +0200}, biburl = {https://dblp.org/rec/conf/ciac/Jansen10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/fsttcs/FellowsJLRS10, author = {Michael R. Fellows and Bart M. P. Jansen and Daniel Lokshtanov and Frances A. Rosamond and Saket Saurabh}, editor = {Kamal Lodaya and Meena Mahajan}, title = {Determining the Winner of a Dodgson Election is Hard}, booktitle = {{IARCS} Annual Conference on Foundations of Software Technology and Theoretical Computer Science, {FSTTCS} 2010, December 15-18, 2010, Chennai, India}, series = {LIPIcs}, volume = {8}, pages = {459--468}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2010}, url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2010.459}, doi = {10.4230/LIPICS.FSTTCS.2010.459}, timestamp = {Tue, 11 Feb 2020 15:52:14 +0100}, biburl = {https://dblp.org/rec/conf/fsttcs/FellowsJLRS10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/swat/Jansen10, author = {Bart M. P. Jansen}, editor = {Haim Kaplan}, title = {Polynomial Kernels for Hard Problems on Disk Graphs}, 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 = {310--321}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-13731-0\_30}, doi = {10.1007/978-3-642-13731-0\_30}, timestamp = {Tue, 14 May 2019 10:00:39 +0200}, biburl = {https://dblp.org/rec/conf/swat/Jansen10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1011-4224, author = {Hans L. Bodlaender and Bart M. P. Jansen and Stefan Kratsch}, title = {Cross-Composition: {A} New Technique for Kernelization Lower Bounds}, journal = {CoRR}, volume = {abs/1011.4224}, year = {2010}, url = {http://arxiv.org/abs/1011.4224}, eprinttype = {arXiv}, eprint = {1011.4224}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1011-4224.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1012-4701, author = {Bart M. P. Jansen and Hans L. Bodlaender}, title = {Vertex Cover Kernelization Revisited: Upper and Lower Bounds for a Refined Parameter}, journal = {CoRR}, volume = {abs/1012.4701}, year = {2010}, url = {http://arxiv.org/abs/1012.4701}, eprinttype = {arXiv}, eprint = {1012.4701}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1012-4701.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/gis/AronovBBJJKLLSS08, author = {Boris Aronov and Kevin Buchin and Maike Buchin and Bart M. P. Jansen and Tom de Jong and Marc J. van Kreveld and Maarten L{\"{o}}ffler and Jin Luo and Rodrigo I. Silveira and Bettina Speckmann}, editor = {Walid G. Aref and Mohamed F. Mokbel and Markus Schneider}, title = {Feed-links for network extensions}, booktitle = {16th {ACM} {SIGSPATIAL} International Symposium on Advances in Geographic Information Systems, {ACM-GIS} 2008, November 5-7, 2008, Irvine, California, USA, Proceedings}, pages = {35}, publisher = {{ACM}}, year = {2008}, url = {https://doi.org/10.1145/1463434.1463478}, doi = {10.1145/1463434.1463478}, timestamp = {Fri, 09 Apr 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/gis/AronovBBJJKLLSS08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
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.