Published in: Dagstuhl Seminar Proceedings, Volume 7462, Assisted Living Systems - Models, Architectures and Engineering Approaches (2008)
Bart Jansen. Position statement: Physical activity monitoring of elderly patients - 3 tricks to advance the field?. In Assisted Living Systems - Models, Architectures and Engineering Approaches. Dagstuhl Seminar Proceedings, Volume 7462, pp. 1-3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008)
@InProceedings{jansen:DagSemProc.07462.18, author = {Jansen, Bart}, title = {{Position statement: Physical activity monitoring of elderly patients - 3 tricks to advance the field?}}, booktitle = {Assisted Living Systems - Models, Architectures and Engineering Approaches}, pages = {1--3}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2008}, volume = {7462}, editor = {Arthur I. Karshmer and J\"{u}rgen Nehmer and Hartmut Raffler and Gerhard Tr\"{o}ster}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.07462.18}, URN = {urn:nbn:de:0030-drops-14648}, doi = {10.4230/DagSemProc.07462.18}, annote = {Keywords: Elderly patients, physical activity, robot imitation} }
Published in: Dagstuhl Seminar Proceedings, Volume 7462, Assisted Living Systems - Models, Architectures and Engineering Approaches (2008)
Bart Jansen. Position statement: Telemonitoring - a too limited view on the wellbeing of the patient. In Assisted Living Systems - Models, Architectures and Engineering Approaches. Dagstuhl Seminar Proceedings, Volume 7462, pp. 1-4, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008)
@InProceedings{jansen:DagSemProc.07462.19, author = {Jansen, Bart}, title = {{Position statement: Telemonitoring - a too limited view on the wellbeing of the patient}}, booktitle = {Assisted Living Systems - Models, Architectures and Engineering Approaches}, pages = {1--4}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2008}, volume = {7462}, editor = {Arthur I. Karshmer and J\"{u}rgen Nehmer and Hartmut Raffler and Gerhard Tr\"{o}ster}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.07462.19}, URN = {urn:nbn:de:0030-drops-14636}, doi = {10.4230/DagSemProc.07462.19}, annote = {Keywords: Telemonitoring, physical activity} }
Published in: LIPIcs, Volume 321, 19th International Symposium on Parameterized and Exact Computation (IPEC 2024)
Bart M. P. Jansen, Yosuke Mizutani, Blair D. Sullivan, and Ruben F. A. Verhaegh. Preprocessing to Reduce the Search Space for Odd Cycle Transversal. In 19th International Symposium on Parameterized and Exact Computation (IPEC 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 321, pp. 15:1-15:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{jansen_et_al:LIPIcs.IPEC.2024.15, author = {Jansen, Bart M. P. and Mizutani, Yosuke and Sullivan, Blair D. and Verhaegh, Ruben F. A.}, title = {{Preprocessing to Reduce the Search Space for Odd Cycle Transversal}}, booktitle = {19th International Symposium on Parameterized and Exact Computation (IPEC 2024)}, pages = {15:1--15:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-353-9}, ISSN = {1868-8969}, year = {2024}, volume = {321}, editor = {Bonnet, \'{E}douard and Rz\k{a}\.{z}ewski, Pawe{\l}}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2024.15}, URN = {urn:nbn:de:0030-drops-222412}, doi = {10.4230/LIPIcs.IPEC.2024.15}, annote = {Keywords: odd cycle transversal, parameterized complexity, graph decomposition, search-space reduction, witness of optimality} }
Published in: LIPIcs, Volume 297, 51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)
Marin Bougeret, Bart M. P. Jansen, and Ignasi Sau. Kernelization Dichotomies for Hitting Subgraphs Under Structural Parameterizations. In 51st International Colloquium on Automata, Languages, and Programming (ICALP 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 297, pp. 33:1-33:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{bougeret_et_al:LIPIcs.ICALP.2024.33, author = {Bougeret, Marin and Jansen, Bart M. P. and Sau, Ignasi}, title = {{Kernelization Dichotomies for Hitting Subgraphs Under Structural Parameterizations}}, booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)}, pages = {33:1--33:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-322-5}, ISSN = {1868-8969}, year = {2024}, volume = {297}, editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.33}, URN = {urn:nbn:de:0030-drops-201766}, doi = {10.4230/LIPIcs.ICALP.2024.33}, annote = {Keywords: hitting subgraphs, hitting induced subgraphs, parameterized complexity, polynomial kernel, complexity dichotomy, elimination distance} }
Published in: LIPIcs, Volume 294, 19th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2024)
Benjamin Merlin Bumpus, Bart M. P. Jansen, and Jaime Venne. Fixed-Parameter Tractable Certified Algorithms for Covering and Dominating in Planar Graphs and Beyond. In 19th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 294, pp. 19:1-19:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{bumpus_et_al:LIPIcs.SWAT.2024.19, author = {Bumpus, Benjamin Merlin and Jansen, Bart M. P. and Venne, Jaime}, title = {{Fixed-Parameter Tractable Certified Algorithms for Covering and Dominating in Planar Graphs and Beyond}}, booktitle = {19th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2024)}, pages = {19:1--19:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-318-8}, ISSN = {1868-8969}, year = {2024}, volume = {294}, editor = {Bodlaender, Hans L.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2024.19}, URN = {urn:nbn:de:0030-drops-200595}, doi = {10.4230/LIPIcs.SWAT.2024.19}, annote = {Keywords: fixed-parameter tractability, certified algorithms} }
Published in: LIPIcs, Volume 294, 19th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2024)
Bart M. P. Jansen and Ruben F. A. Verhaegh. Search-Space Reduction via Essential Vertices Revisited: Vertex Multicut and Cograph Deletion. In 19th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 294, pp. 28:1-28:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{jansen_et_al:LIPIcs.SWAT.2024.28, author = {Jansen, Bart M. P. and Verhaegh, Ruben F. A.}, title = {{Search-Space Reduction via Essential Vertices Revisited: Vertex Multicut and Cograph Deletion}}, booktitle = {19th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2024)}, pages = {28:1--28:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-318-8}, ISSN = {1868-8969}, year = {2024}, volume = {294}, editor = {Bodlaender, Hans L.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2024.28}, URN = {urn:nbn:de:0030-drops-200683}, doi = {10.4230/LIPIcs.SWAT.2024.28}, annote = {Keywords: fixed-parameter tractability, essential vertices, integrality gap} }
Published in: LIPIcs, Volume 285, 18th International Symposium on Parameterized and Exact Computation (IPEC 2023)
Bart M. P. Jansen and Bart van der Steenhoven. Kernelization for Counting Problems on Graphs: Preserving the Number of Minimum Solutions. In 18th International Symposium on Parameterized and Exact Computation (IPEC 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 285, pp. 27:1-27:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{jansen_et_al:LIPIcs.IPEC.2023.27, author = {Jansen, Bart M. P. and van der Steenhoven, Bart}, title = {{Kernelization for Counting Problems on Graphs: Preserving the Number of Minimum Solutions}}, booktitle = {18th International Symposium on Parameterized and Exact Computation (IPEC 2023)}, pages = {27:1--27:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-305-8}, ISSN = {1868-8969}, year = {2023}, volume = {285}, editor = {Misra, Neeldhara and Wahlstr\"{o}m, Magnus}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2023.27}, URN = {urn:nbn:de:0030-drops-194466}, doi = {10.4230/LIPIcs.IPEC.2023.27}, annote = {Keywords: kernelization, counting problems, feedback vertex set, dominating set, protrusion decomposition} }
Published in: LIPIcs, Volume 285, 18th International Symposium on Parameterized and Exact Computation (IPEC 2023)
Bart M. P. Jansen and Shivesh K. Roy. On the Parameterized Complexity of Multiway Near-Separator. In 18th International Symposium on Parameterized and Exact Computation (IPEC 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 285, pp. 28:1-28:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{jansen_et_al:LIPIcs.IPEC.2023.28, author = {Jansen, Bart M. P. and Roy, Shivesh K.}, title = {{On the Parameterized Complexity of Multiway Near-Separator}}, booktitle = {18th International Symposium on Parameterized and Exact Computation (IPEC 2023)}, pages = {28:1--28:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-305-8}, ISSN = {1868-8969}, year = {2023}, volume = {285}, editor = {Misra, Neeldhara and Wahlstr\"{o}m, Magnus}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2023.28}, URN = {urn:nbn:de:0030-drops-194470}, doi = {10.4230/LIPIcs.IPEC.2023.28}, annote = {Keywords: fixed-parameter tractability, multiway cut, near-separator} }
Published in: LIPIcs, Volume 285, 18th International Symposium on Parameterized and Exact Computation (IPEC 2023)
Bart M. P. Jansen and Shivesh K. Roy. Sunflowers Meet Sparsity: A Linear-Vertex Kernel for Weighted Clique-Packing on Sparse Graphs. In 18th International Symposium on Parameterized and Exact Computation (IPEC 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 285, pp. 29:1-29:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{jansen_et_al:LIPIcs.IPEC.2023.29, author = {Jansen, Bart M. P. and Roy, Shivesh K.}, 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)}, pages = {29:1--29:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-305-8}, ISSN = {1868-8969}, year = {2023}, volume = {285}, editor = {Misra, Neeldhara and Wahlstr\"{o}m, Magnus}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2023.29}, URN = {urn:nbn:de:0030-drops-194488}, doi = {10.4230/LIPIcs.IPEC.2023.29}, annote = {Keywords: kernelization, weighted problems, graph packing, sunflower lemma, bounded expansion, nowhere dense} }
Published in: LIPIcs, Volume 283, 34th International Symposium on Algorithms and Computation (ISAAC 2023)
Bart M. P. Jansen, Jari J. H. de Kroon, and Michał Włodarczyk. Single-Exponential FPT Algorithms for Enumerating Secluded ℱ-Free Subgraphs and Deleting to Scattered Graph Classes. In 34th International Symposium on Algorithms and Computation (ISAAC 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 283, pp. 42:1-42:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{jansen_et_al:LIPIcs.ISAAC.2023.42, author = {Jansen, Bart M. P. and de Kroon, Jari J. H. and W{\l}odarczyk, Micha{\l}}, title = {{Single-Exponential FPT Algorithms for Enumerating Secluded ℱ-Free Subgraphs and Deleting to Scattered Graph Classes}}, booktitle = {34th International Symposium on Algorithms and Computation (ISAAC 2023)}, pages = {42:1--42:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-289-1}, ISSN = {1868-8969}, year = {2023}, volume = {283}, editor = {Iwata, Satoru and Kakimura, Naonori}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2023.42}, URN = {urn:nbn:de:0030-drops-193440}, doi = {10.4230/LIPIcs.ISAAC.2023.42}, annote = {Keywords: fixed-parameter tractability, important separators, secluded subgraphs} }
Published in: LIPIcs, Volume 274, 31st Annual European Symposium on Algorithms (ESA 2023)
Bart M. P. Jansen, Jari J. H. de Kroon, and Michał Włodarczyk. 5-Approximation for ℋ-Treewidth Essentially as Fast as ℋ-Deletion Parameterized by Solution Size. In 31st Annual European Symposium on Algorithms (ESA 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 274, pp. 66:1-66:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{jansen_et_al:LIPIcs.ESA.2023.66, author = {Jansen, Bart M. P. and de Kroon, Jari J. H. and W{\l}odarczyk, Micha{\l}}, title = {{5-Approximation for ℋ-Treewidth Essentially as Fast as ℋ-Deletion Parameterized by Solution Size}}, booktitle = {31st Annual European Symposium on Algorithms (ESA 2023)}, pages = {66:1--66:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-295-2}, ISSN = {1868-8969}, year = {2023}, volume = {274}, editor = {G{\o}rtz, Inge Li and Farach-Colton, Martin and Puglisi, Simon J. and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2023.66}, URN = {urn:nbn:de:0030-drops-187195}, doi = {10.4230/LIPIcs.ESA.2023.66}, annote = {Keywords: fixed-parameter tractability, treewidth, graph decompositions} }
Published in: LIPIcs, Volume 244, 30th Annual European Symposium on Algorithms (ESA 2022)
Benjamin Merlin Bumpus, Bart M. P. Jansen, and Jari J. H. de Kroon. Search-Space Reduction via Essential Vertices. In 30th Annual European Symposium on Algorithms (ESA 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 244, pp. 30:1-30:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{bumpus_et_al:LIPIcs.ESA.2022.30, author = {Bumpus, Benjamin Merlin and Jansen, Bart M. P. and de Kroon, Jari J. H.}, title = {{Search-Space Reduction via Essential Vertices}}, booktitle = {30th Annual European Symposium on Algorithms (ESA 2022)}, pages = {30:1--30:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-247-1}, ISSN = {1868-8969}, year = {2022}, volume = {244}, editor = {Chechik, Shiri and Navarro, Gonzalo and Rotenberg, Eva and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2022.30}, URN = {urn:nbn:de:0030-drops-169687}, doi = {10.4230/LIPIcs.ESA.2022.30}, annote = {Keywords: fixed-parameter tractability, essential vertices, covering versus packing} }
Published in: LIPIcs, Volume 214, 16th International Symposium on Parameterized and Exact Computation (IPEC 2021)
Huib Donkers, Bart M. P. Jansen, and Michał Włodarczyk. Preprocessing for Outerplanar Vertex Deletion: An Elementary Kernel of Quartic Size. In 16th International Symposium on Parameterized and Exact Computation (IPEC 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 214, pp. 14:1-14:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{donkers_et_al:LIPIcs.IPEC.2021.14, author = {Donkers, Huib and Jansen, Bart M. P. and W{\l}odarczyk, Micha{\l}}, title = {{Preprocessing for Outerplanar Vertex Deletion: An Elementary Kernel of Quartic Size}}, booktitle = {16th International Symposium on Parameterized and Exact Computation (IPEC 2021)}, pages = {14:1--14:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-216-7}, ISSN = {1868-8969}, year = {2021}, volume = {214}, editor = {Golovach, Petr A. and Zehavi, Meirav}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2021.14}, URN = {urn:nbn:de:0030-drops-153979}, doi = {10.4230/LIPIcs.IPEC.2021.14}, annote = {Keywords: fixed-parameter tractability, kernelization, outerplanar graphs} }
Published in: LIPIcs, Volume 202, 46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021)
Bart M. P. Jansen, Shivesh K. Roy, and Michał Włodarczyk. On the Hardness of Compressing Weights. In 46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 202, pp. 64:1-64:21, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{jansen_et_al:LIPIcs.MFCS.2021.64, author = {Jansen, Bart M. P. and Roy, Shivesh K. and W{\l}odarczyk, Micha{\l}}, title = {{On the Hardness of Compressing Weights}}, booktitle = {46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021)}, pages = {64:1--64:21}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-201-3}, ISSN = {1868-8969}, year = {2021}, volume = {202}, editor = {Bonchi, Filippo and Puglisi, Simon J.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2021.64}, URN = {urn:nbn:de:0030-drops-145049}, doi = {10.4230/LIPIcs.MFCS.2021.64}, annote = {Keywords: kernelization, compression, edge-weighted clique, constraint satisfaction problems} }
Published in: LIPIcs, Volume 181, 31st International Symposium on Algorithms and Computation (ISAAC 2020)
Hubie Chen, Bart M. P. Jansen, Karolina Okrasa, Astrid Pieterse, and Paweł Rzążewski. Sparsification Lower Bounds for List H-Coloring. In 31st International Symposium on Algorithms and Computation (ISAAC 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 181, pp. 58:1-58:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{chen_et_al:LIPIcs.ISAAC.2020.58, author = {Chen, Hubie and Jansen, Bart M. P. and Okrasa, Karolina and Pieterse, Astrid and Rz\k{a}\.{z}ewski, Pawe{\l}}, title = {{Sparsification Lower Bounds for List H-Coloring}}, booktitle = {31st International Symposium on Algorithms and Computation (ISAAC 2020)}, pages = {58:1--58:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-173-3}, ISSN = {1868-8969}, year = {2020}, volume = {181}, editor = {Cao, Yixin and Cheng, Siu-Wing and Li, Minming}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2020.58}, URN = {urn:nbn:de:0030-drops-134027}, doi = {10.4230/LIPIcs.ISAAC.2020.58}, annote = {Keywords: List H-Coloring, Sparsification, Constraint Satisfaction Problem} }
Published in: LIPIcs, Volume 173, 28th Annual European Symposium on Algorithms (ESA 2020)
Bart M. P. Jansen and Michał Włodarczyk. Optimal Polynomial-Time Compression for Boolean Max CSP. In 28th Annual European Symposium on Algorithms (ESA 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 173, pp. 63:1-63:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{jansen_et_al:LIPIcs.ESA.2020.63, author = {Jansen, Bart M. P. and W{\l}odarczyk, Micha{\l}}, title = {{Optimal Polynomial-Time Compression for Boolean Max CSP}}, booktitle = {28th Annual European Symposium on Algorithms (ESA 2020)}, pages = {63:1--63:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-162-7}, ISSN = {1868-8969}, year = {2020}, volume = {173}, editor = {Grandoni, Fabrizio and Herman, Grzegorz and Sanders, Peter}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2020.63}, URN = {urn:nbn:de:0030-drops-129297}, doi = {10.4230/LIPIcs.ESA.2020.63}, annote = {Keywords: constraint satisfaction problem, kernelization, exponential time algorithms} }
Published in: LIPIcs, Volume 168, 47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)
Marin Bougeret, Bart M. P. Jansen, and Ignasi Sau. Bridge-Depth Characterizes Which Structural Parameterizations of Vertex Cover Admit a Polynomial Kernel. In 47th International Colloquium on Automata, Languages, and Programming (ICALP 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 168, pp. 16:1-16:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{bougeret_et_al:LIPIcs.ICALP.2020.16, author = {Bougeret, Marin and Jansen, Bart M. P. and Sau, Ignasi}, 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)}, pages = {16:1--16:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-138-2}, ISSN = {1868-8969}, year = {2020}, volume = {168}, editor = {Czumaj, Artur and Dawar, Anuj and Merelli, Emanuela}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.16}, URN = {urn:nbn:de:0030-drops-124238}, doi = {10.4230/LIPIcs.ICALP.2020.16}, annote = {Keywords: vertex cover, parameterized complexity, polynomial kernel, structural parameterization, bridge-depth} }
Published in: LIPIcs, Volume 162, 17th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2020)
Bart M. P. Jansen and Jari J. H. de Kroon. Preprocessing Vertex-Deletion Problems: Characterizing Graph Properties by Low-Rank Adjacencies. In 17th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 162, pp. 27:1-27:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{jansen_et_al:LIPIcs.SWAT.2020.27, author = {Jansen, Bart M. P. and de Kroon, Jari J. H.}, title = {{Preprocessing Vertex-Deletion Problems: Characterizing Graph Properties by Low-Rank Adjacencies}}, booktitle = {17th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2020)}, pages = {27:1--27:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-150-4}, ISSN = {1868-8969}, year = {2020}, volume = {162}, editor = {Albers, Susanne}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2020.27}, URN = {urn:nbn:de:0030-drops-122748}, doi = {10.4230/LIPIcs.SWAT.2020.27}, annote = {Keywords: kernelization, vertex-deletion, graph modification, structural parameterization} }
Published in: LIPIcs, Volume 148, 14th International Symposium on Parameterized and Exact Computation (IPEC 2019)
14th International Symposium on Parameterized and Exact Computation (IPEC 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 148, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@Proceedings{jansen_et_al:LIPIcs.IPEC.2019, title = {{LIPIcs, Volume 148, IPEC'19, Complete Volume}}, booktitle = {14th International Symposium on Parameterized and Exact Computation (IPEC 2019)}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-129-0}, ISSN = {1868-8969}, year = {2019}, volume = {148}, editor = {Jansen, Bart M. P. and Telle, Jan Arne}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2019}, URN = {urn:nbn:de:0030-drops-116409}, doi = {10.4230/LIPIcs.IPEC.2019}, annote = {Keywords: Theory of computation, Parameterized complexity and exact algorithms} }
Published in: LIPIcs, Volume 148, 14th International Symposium on Parameterized and Exact Computation (IPEC 2019)
14th International Symposium on Parameterized and Exact Computation (IPEC 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 148, pp. 0:i-0:xvi, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{jansen_et_al:LIPIcs.IPEC.2019.0, author = {Jansen, Bart M. P. and Telle, Jan Arne}, title = {{Front Matter, Table of Contents, Preface, Conference Organization}}, booktitle = {14th International Symposium on Parameterized and Exact Computation (IPEC 2019)}, pages = {0:i--0:xvi}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-129-0}, ISSN = {1868-8969}, year = {2019}, volume = {148}, editor = {Jansen, Bart M. P. and Telle, Jan Arne}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2019.0}, URN = {urn:nbn:de:0030-drops-114618}, doi = {10.4230/LIPIcs.IPEC.2019.0}, annote = {Keywords: Front Matter, Table of Contents, Preface, Conference Organization} }
Published in: LIPIcs, Volume 144, 27th Annual European Symposium on Algorithms (ESA 2019)
Édouard Bonnet, Yoichi Iwata, Bart M. P. Jansen, and Łukasz Kowalik. Fine-Grained Complexity of k-OPT in Bounded-Degree Graphs for Solving TSP. In 27th Annual European Symposium on Algorithms (ESA 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 144, pp. 23:1-23:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{bonnet_et_al:LIPIcs.ESA.2019.23, author = {Bonnet, \'{E}douard and Iwata, Yoichi and Jansen, Bart M. P. and Kowalik, {\L}ukasz}, title = {{Fine-Grained Complexity of k-OPT in Bounded-Degree Graphs for Solving TSP}}, booktitle = {27th Annual European Symposium on Algorithms (ESA 2019)}, pages = {23:1--23:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-124-5}, ISSN = {1868-8969}, year = {2019}, volume = {144}, editor = {Bender, Michael A. and Svensson, Ola and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2019.23}, URN = {urn:nbn:de:0030-drops-111444}, doi = {10.4230/LIPIcs.ESA.2019.23}, annote = {Keywords: traveling salesman problem, k-OPT, bounded degree} }
Published in: LIPIcs, Volume 126, 36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019)
Bart M. P. Jansen, Marcin Pilipczuk, and Erik Jan van Leeuwen. A Deterministic Polynomial Kernel for Odd Cycle Transversal and Vertex Multiway Cut in Planar Graphs. In 36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 126, pp. 39:1-39:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{jansen_et_al:LIPIcs.STACS.2019.39, author = {Jansen, Bart M. P. and Pilipczuk, Marcin and van Leeuwen, Erik Jan}, 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)}, pages = {39:1--39:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-100-9}, ISSN = {1868-8969}, year = {2019}, volume = {126}, editor = {Niedermeier, Rolf and Paul, Christophe}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2019.39}, URN = {urn:nbn:de:0030-drops-102783}, doi = {10.4230/LIPIcs.STACS.2019.39}, annote = {Keywords: planar graphs, kernelization, odd cycle transversal, multiway cut} }
Published in: LIPIcs, Volume 115, 13th International Symposium on Parameterized and Exact Computation (IPEC 2018)
Bas A. M. van Geffen, Bart M. P. Jansen, Arnoud A. W. M. de Kroon, and Rolf Morel. Lower Bounds for Dynamic Programming on Planar Graphs of Bounded Cutwidth. In 13th International Symposium on Parameterized and Exact Computation (IPEC 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 115, pp. 3:1-3:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{vangeffen_et_al:LIPIcs.IPEC.2018.3, author = {van Geffen, Bas A. M. and Jansen, Bart M. P. and de Kroon, Arnoud A. W. M. and Morel, Rolf}, title = {{Lower Bounds for Dynamic Programming on Planar Graphs of Bounded Cutwidth}}, booktitle = {13th International Symposium on Parameterized and Exact Computation (IPEC 2018)}, pages = {3:1--3:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-084-2}, ISSN = {1868-8969}, year = {2019}, volume = {115}, editor = {Paul, Christophe and Pilipczuk, Michal}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2018.3}, URN = {urn:nbn:de:0030-drops-102049}, doi = {10.4230/LIPIcs.IPEC.2018.3}, annote = {Keywords: planarization, dominating set, cutwidth, lower bounds, strong exponential time hypothesis} }
Published in: LIPIcs, Volume 115, 13th International Symposium on Parameterized and Exact Computation (IPEC 2018)
Hubie Chen, Bart M. P. Jansen, and Astrid Pieterse. Best-Case and Worst-Case Sparsifiability of Boolean CSPs. In 13th International Symposium on Parameterized and Exact Computation (IPEC 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 115, pp. 15:1-15:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{chen_et_al:LIPIcs.IPEC.2018.15, author = {Chen, Hubie and Jansen, Bart M. P. and Pieterse, Astrid}, title = {{Best-Case and Worst-Case Sparsifiability of Boolean CSPs}}, booktitle = {13th International Symposium on Parameterized and Exact Computation (IPEC 2018)}, pages = {15:1--15:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-084-2}, ISSN = {1868-8969}, year = {2019}, volume = {115}, editor = {Paul, Christophe and Pilipczuk, Michal}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2018.15}, URN = {urn:nbn:de:0030-drops-102169}, doi = {10.4230/LIPIcs.IPEC.2018.15}, annote = {Keywords: constraint satisfaction problems, kernelization, sparsification, lower bounds} }
Published in: LIPIcs, Volume 112, 26th Annual European Symposium on Algorithms (ESA 2018)
Bart M. P. Jansen and Jesper Nederlof. Computing the Chromatic Number Using Graph Decompositions via Matrix Rank. In 26th Annual European Symposium on Algorithms (ESA 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 112, pp. 47:1-47:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{jansen_et_al:LIPIcs.ESA.2018.47, author = {Jansen, Bart M. P. and Nederlof, Jesper}, title = {{Computing the Chromatic Number Using Graph Decompositions via Matrix Rank}}, booktitle = {26th Annual European Symposium on Algorithms (ESA 2018)}, pages = {47:1--47:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-081-1}, ISSN = {1868-8969}, year = {2018}, volume = {112}, editor = {Azar, Yossi and Bast, Hannah and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2018.47}, URN = {urn:nbn:de:0030-drops-95104}, doi = {10.4230/LIPIcs.ESA.2018.47}, annote = {Keywords: Parameterized Complexity, Chromatic Number, Graph Decompositions} }
Published in: LIPIcs, Volume 112, 26th Annual European Symposium on Algorithms (ESA 2018)
Bart M. P. Jansen and Astrid Pieterse. Polynomial Kernels for Hitting Forbidden Minors under Structural Parameterizations. In 26th Annual European Symposium on Algorithms (ESA 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 112, pp. 48:1-48:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{jansen_et_al:LIPIcs.ESA.2018.48, author = {Jansen, Bart M. P. and Pieterse, Astrid}, title = {{Polynomial Kernels for Hitting Forbidden Minors under Structural Parameterizations}}, booktitle = {26th Annual European Symposium on Algorithms (ESA 2018)}, pages = {48:1--48:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-081-1}, ISSN = {1868-8969}, year = {2018}, volume = {112}, editor = {Azar, Yossi and Bast, Hannah and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2018.48}, URN = {urn:nbn:de:0030-drops-95119}, doi = {10.4230/LIPIcs.ESA.2018.48}, annote = {Keywords: Kernelization, F-minor free deletion, Treedepth modulator, Structural parameterization} }
Published in: LIPIcs, Volume 89, 12th International Symposium on Parameterized and Exact Computation (IPEC 2017)
Bart M. P. Jansen and Astrid Pieterse. Optimal Data Reduction for Graph Coloring Using Low-Degree Polynomials. In 12th International Symposium on Parameterized and Exact Computation (IPEC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 89, pp. 22:1-22:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{jansen_et_al:LIPIcs.IPEC.2017.22, author = {Jansen, Bart M. P. and Pieterse, Astrid}, title = {{Optimal Data Reduction for Graph Coloring Using Low-Degree Polynomials}}, booktitle = {12th International Symposium on Parameterized and Exact Computation (IPEC 2017)}, pages = {22:1--22:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-051-4}, ISSN = {1868-8969}, year = {2018}, volume = {89}, editor = {Lokshtanov, Daniel and Nishimura, Naomi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2017.22}, URN = {urn:nbn:de:0030-drops-85500}, doi = {10.4230/LIPIcs.IPEC.2017.22}, annote = {Keywords: graph coloring, kernelization, sparsification} }
Published in: LIPIcs, Volume 89, 12th International Symposium on Parameterized and Exact Computation (IPEC 2017)
Bart M. P. Jansen, Marcin Pilipczuk, and Marcin Wrochna. Turing Kernelization for Finding Long Paths in Graphs Excluding a Topological Minor. In 12th International Symposium on Parameterized and Exact Computation (IPEC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 89, pp. 23:1-23:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{jansen_et_al:LIPIcs.IPEC.2017.23, author = {Jansen, Bart M. P. and Pilipczuk, Marcin and Wrochna, Marcin}, title = {{Turing Kernelization for Finding Long Paths in Graphs Excluding a Topological Minor}}, booktitle = {12th International Symposium on Parameterized and Exact Computation (IPEC 2017)}, pages = {23:1--23:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-051-4}, ISSN = {1868-8969}, year = {2018}, volume = {89}, editor = {Lokshtanov, Daniel and Nishimura, Naomi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2017.23}, URN = {urn:nbn:de:0030-drops-85576}, doi = {10.4230/LIPIcs.IPEC.2017.23}, annote = {Keywords: Turing kernel, long path, k-path, excluded topological minor, modulator} }
Published in: LIPIcs, Volume 63, 11th International Symposium on Parameterized and Exact Computation (IPEC 2016)
Bart M. P. Jansen and Jules J. H. M. Wulms. Lower Bounds for Protrusion Replacement by Counting Equivalence Classes. In 11th International Symposium on Parameterized and Exact Computation (IPEC 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 63, pp. 17:1-17:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{jansen_et_al:LIPIcs.IPEC.2016.17, author = {Jansen, Bart M. P. and Wulms, Jules J. H. M.}, title = {{Lower Bounds for Protrusion Replacement by Counting Equivalence Classes}}, booktitle = {11th International Symposium on Parameterized and Exact Computation (IPEC 2016)}, pages = {17:1--17:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-023-1}, ISSN = {1868-8969}, year = {2017}, volume = {63}, editor = {Guo, Jiong and Hermelin, Danny}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2016.17}, URN = {urn:nbn:de:0030-drops-69275}, doi = {10.4230/LIPIcs.IPEC.2016.17}, annote = {Keywords: protrusions, boundaried graphs, independent set, equivalence classes, finite integer index} }
Published in: LIPIcs, Volume 63, 11th International Symposium on Parameterized and Exact Computation (IPEC 2016)
Holger Dell, Thore Husfeldt, Bart M. P. Jansen, Petteri Kaski, Christian Komusiewicz, and Frances A. Rosamond. The First Parameterized Algorithms and Computational Experiments Challenge. In 11th International Symposium on Parameterized and Exact Computation (IPEC 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 63, pp. 30:1-30:9, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{dell_et_al:LIPIcs.IPEC.2016.30, author = {Dell, Holger and Husfeldt, Thore and Jansen, Bart M. P. and Kaski, Petteri and Komusiewicz, Christian and Rosamond, Frances A.}, title = {{The First Parameterized Algorithms and Computational Experiments Challenge}}, booktitle = {11th International Symposium on Parameterized and Exact Computation (IPEC 2016)}, pages = {30:1--30:9}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-023-1}, ISSN = {1868-8969}, year = {2017}, volume = {63}, editor = {Guo, Jiong and Hermelin, Danny}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2016.30}, URN = {urn:nbn:de:0030-drops-69310}, doi = {10.4230/LIPIcs.IPEC.2016.30}, annote = {Keywords: treewidth, feedback vertex set, contest, implementation challenge, FPT} }
Published in: LIPIcs, Volume 65, 36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2016)
Mark de Berg, Bart M. P. Jansen, and Debankur Mukherjee. Independent-Set Reconfiguration Thresholds of Hereditary Graph Classes. In 36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 65, pp. 34:1-34:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{deberg_et_al:LIPIcs.FSTTCS.2016.34, author = {de Berg, Mark and Jansen, Bart M. P. and Mukherjee, Debankur}, 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)}, pages = {34:1--34:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-027-9}, ISSN = {1868-8969}, year = {2016}, volume = {65}, editor = {Lal, Akash and Akshay, S. and Saurabh, Saket and Sen, Sandeep}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2016.34}, URN = {urn:nbn:de:0030-drops-68694}, doi = {10.4230/LIPIcs.FSTTCS.2016.34}, annote = {Keywords: Reconfiguration, Independent set, Token Addition Removal, Token Sliding} }
Published in: LIPIcs, Volume 55, 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)
Mark de Berg, Kevin Buchin, Bart M. P. Jansen, and Gerhard Woeginger. Fine-Grained Complexity Analysis of Two Classic TSP Variants. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 55, pp. 5:1-5:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{deberg_et_al:LIPIcs.ICALP.2016.5, author = {de Berg, Mark and Buchin, Kevin and Jansen, Bart M. P. and Woeginger, Gerhard}, title = {{Fine-Grained Complexity Analysis of Two Classic TSP Variants}}, booktitle = {43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)}, pages = {5:1--5:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-013-2}, ISSN = {1868-8969}, year = {2016}, volume = {55}, editor = {Chatzigiannakis, Ioannis and Mitzenmacher, Michael and Rabani, Yuval and Sangiorgi, Davide}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.5}, URN = {urn:nbn:de:0030-drops-62770}, doi = {10.4230/LIPIcs.ICALP.2016.5}, annote = {Keywords: Traveling salesman problem, fine-grained complexity, bitonic tours, k-opt} }
Published in: LIPIcs, Volume 58, 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)
Bart M. P. Jansen and Astrid Pieterse. Optimal Sparsification for Some Binary CSPs Using Low-Degree Polynomials. In 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 58, pp. 71:1-71:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{jansen_et_al:LIPIcs.MFCS.2016.71, author = {Jansen, Bart M. P. and Pieterse, Astrid}, title = {{Optimal Sparsification for Some Binary CSPs Using Low-Degree Polynomials}}, booktitle = {41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)}, pages = {71:1--71:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-016-3}, ISSN = {1868-8969}, year = {2016}, volume = {58}, editor = {Faliszewski, Piotr and Muscholl, Anca and Niedermeier, Rolf}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2016.71}, URN = {urn:nbn:de:0030-drops-64821}, doi = {10.4230/LIPIcs.MFCS.2016.71}, annote = {Keywords: constraint satisfaction problem, sparsification, satisfiability, kernelization} }
Published in: LIPIcs, Volume 47, 33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016)
Bart M. P. Jansen. Constrained Bipartite Vertex Cover: The Easy Kernel is Essentially Tight. In 33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 47, pp. 45:1-45:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{jansen:LIPIcs.STACS.2016.45, author = {Jansen, Bart M. P.}, title = {{Constrained Bipartite Vertex Cover: The Easy Kernel is Essentially Tight}}, booktitle = {33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016)}, pages = {45:1--45:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-001-9}, ISSN = {1868-8969}, year = {2016}, volume = {47}, editor = {Ollinger, Nicolas and Vollmer, Heribert}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2016.45}, URN = {urn:nbn:de:0030-drops-57463}, doi = {10.4230/LIPIcs.STACS.2016.45}, annote = {Keywords: kernel lower bounds, constrained bipartite vertex cover} }
Published in: LIPIcs, Volume 43, 10th International Symposium on Parameterized and Exact Computation (IPEC 2015)
Bart M. P. Jansen and Astrid Pieterse. Sparsification Upper and Lower Bounds for Graphs Problems and Not-All-Equal SAT. In 10th International Symposium on Parameterized and Exact Computation (IPEC 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 43, pp. 163-174, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{jansen_et_al:LIPIcs.IPEC.2015.163, author = {Jansen, Bart M. P. and Pieterse, Astrid}, 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)}, pages = {163--174}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-92-7}, ISSN = {1868-8969}, year = {2015}, volume = {43}, editor = {Husfeldt, Thore and Kanj, Iyad}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2015.163}, URN = {urn:nbn:de:0030-drops-55806}, doi = {10.4230/LIPIcs.IPEC.2015.163}, annote = {Keywords: sparsification, graph coloring, Hamiltonian cycle, satisfiability} }
Published in: LIPIcs, Volume 9, 28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011)
Hans L. Bodlaender, Bart M. P. Jansen, and Stefan Kratsch. Cross-Composition: A New Technique for Kernelization Lower Bounds. In 28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011). Leibniz International Proceedings in Informatics (LIPIcs), Volume 9, pp. 165-176, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
@InProceedings{bodlaender_et_al:LIPIcs.STACS.2011.165, author = {Bodlaender, Hans L. and Jansen, Bart M. P. and Kratsch, Stefan}, title = {{Cross-Composition: A New Technique for Kernelization Lower Bounds}}, booktitle = {28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011)}, pages = {165--176}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-25-5}, ISSN = {1868-8969}, year = {2011}, volume = {9}, editor = {Schwentick, Thomas and D\"{u}rr, Christoph}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2011.165}, URN = {urn:nbn:de:0030-drops-30082}, doi = {10.4230/LIPIcs.STACS.2011.165}, annote = {Keywords: kernelization, lower bounds, parameterized complexity} }
Published in: LIPIcs, Volume 9, 28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011)
Bart M. P. Jansen and Hans L. Bodlaender. Vertex Cover Kernelization Revisited: Upper and Lower Bounds for a Refined Parameter. In 28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011). Leibniz International Proceedings in Informatics (LIPIcs), Volume 9, pp. 177-188, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
@InProceedings{jansen_et_al:LIPIcs.STACS.2011.177, author = {Jansen, Bart M. P. and Bodlaender, Hans L.}, 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)}, pages = {177--188}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-25-5}, ISSN = {1868-8969}, year = {2011}, volume = {9}, editor = {Schwentick, Thomas and D\"{u}rr, Christoph}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2011.177}, URN = {urn:nbn:de:0030-drops-30097}, doi = {10.4230/LIPIcs.STACS.2011.177}, annote = {Keywords: kernelization, lower bounds, parameterized complexity} }
Published in: LIPIcs, Volume 8, IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2010)
Michael Fellows, Bart M. P. Jansen, Daniel Lokshtanov, Frances A. Rosamond, and Saket Saurabh. Determining the Winner of a Dodgson Election is Hard. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2010). Leibniz International Proceedings in Informatics (LIPIcs), Volume 8, pp. 459-468, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2010)
@InProceedings{fellows_et_al:LIPIcs.FSTTCS.2010.459, author = {Fellows, Michael and Jansen, Bart M. P. and Lokshtanov, Daniel and Rosamond, Frances A. and Saurabh, Saket}, 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)}, pages = {459--468}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-23-1}, ISSN = {1868-8969}, year = {2010}, volume = {8}, editor = {Lodaya, Kamal and Mahajan, Meena}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2010.459}, URN = {urn:nbn:de:0030-drops-28866}, doi = {10.4230/LIPIcs.FSTTCS.2010.459}, annote = {Keywords: Dodgson Score, Parameterized Complexity, Kernelization Lower Bounds} }
Feedback for Dagstuhl Publishing