Content available in repository
Content available in repository
Research output
- 15 results
Search results
-
2024
Fixed-Parameter Tractable Certified Algorithms for Covering and Dominating in Planar Graphs and Beyond
Bumpus, B. M., Jansen, B. M. P. & Venne, J., 2024, Proceedings of the 19th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2024. Bodlaender, H. L. (ed.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Vol. 294. 16 p. 19. (LIPIcs).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review
Open Access -
Kernelization Dichotomies for Hitting Subgraphs Under Structural Parameterizations
Bougeret, M., Jansen, B. M. P. & Sau, I., 2024, Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, ICALP 2024. Bringmann, K., Grohe, M., Puppis, G. & Svensson, O. (eds.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Vol. 297. 20 p. 33. (LIPIcs).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review
Open Access -
Preprocessing to Reduce the Search Space for Odd Cycle Transversal
Jansen, B. M. P., Mizutani, Y., Sullivan, B. D. & Verhaegh, R. F. A., 5 Dec 2024, 19th International Symposium on Parameterized and Exact Computation, IPEC 2024. Bonnet, É. & Rzążewski, P. (eds.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 18 p. (Leibniz International Proceedings in Informatics (LIPIcs); vol. 321).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review
Open AccessFile -
Search-Space Reduction via Essential Vertices Revisited: Vertex Multicut and Cograph Deletion
Jansen, B. M. P. & Verhaegh, R. F. A., 31 May 2024, 19th Scandinavian Symposium on Algorithm Theory, SWAT 2024. Bodlaender, H. L. (ed.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, p. 28:1-28:17 17 p. 28. (Leibniz International Proceedings in Informatics (LIPIcs); vol. 294).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review
Open AccessFile -
Steiner Tree Parameterized by Multiway Cut and Even Less
Jansen, B. M. P. & Swennenhuis, C. M. F., 2024, Proceedings of the 32nd Annual European Symposium on Algorithms, ESA 2024. Chan, T. M., Fischer, J., Iacono, J. & Herman, G. (eds.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Vol. 308. 16 p. 76. (LIPIcs).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review
Open Access -
Upward and Orthogonal Planarity are W[1]-Hard Parameterized by Treewidth
Jansen, B. M. P., Khazaliya, L. (Corresponding author), Kindermann, P., Liotta, G., Montecchiani, F. & Simonov, K., 6 Jan 2024, Graph Drawing and Network Visualization: 31st International Symposium, GD 2023, Isola delle Femmine, Palermo, Italy, September 20–22, 2023, Revised Selected Papers, Part II. Bekos, M. A. & Chimani, M. (eds.). Springer, p. 203-217 15 p. (Lecture Notes in Computer Science (LNCS); vol. 14466).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review
Open AccessFile2 Citations (Scopus) -
2023
5-Approximation for ℋ-Treewidth Essentially as Fast as ℋ-Deletion Parameterized by Solution Size.
Jansen, B. M. P., de Kroon, J. J. H. & Wlodarczyk, M., Sept 2023, 31st Annual European Symposium on Algorithms, ESA 2023. Li Gortz, I., Farach-Colton, M., Puglisi, S. J. & Herman, G. (eds.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 16 p. 66. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 274).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review
Open Access2 Citations (Scopus) -
Kernelization for Counting Problems on Graphs: Preserving the Number of Minimum Solutions
Jansen, B. M. P. & Steenhoven, B. V. D., Dec 2023, 18th International Symposium on Parameterized and Exact Computation, IPEC 2023. Misra, N. & Wahlstrom, M. (eds.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, p. 1-15 15 p. 27. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 285).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review
Open Access1 Citation (Scopus) -
On the Parameterized Complexity of Multiway Near-Separator
Jansen, B. M. P. & Roy, S. K., Dec 2023, 18th International Symposium on Parameterized and Exact Computation, IPEC 2023. Misra, N. & Wahlstrom, M. (eds.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 18 p. 28. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 285).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review
Open Access -
Single-Exponential FPT Algorithms for Enumerating Secluded ℱ-Free Subgraphs and Deleting to Scattered Graph Classes.
Jansen, B. M. P., Kroon, J. J. H. D. & Wlodarczyk, M., Dec 2023, 34th International Symposium on Algorithms and Computation, ISAAC 2023. Iwata, S., Iwata, S. & Kakimura, N. (eds.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, p. 1-18 18 p. 42. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 283).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review
Open Access -
Sunflowers Meet Sparsity: A Linear-Vertex Kernel for Weighted Clique-Packing on Sparse Graphs
Jansen, B. M. P. & Roy, S., 13 Dec 2023, 18th International Symposium on Parameterized and Exact Computation, IPEC 2023. Misra, N. & Wahlstrom, M. (eds.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, p. 29:1-29:13 13 p. 29. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 285).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review
Open AccessFile51 Downloads (Pure) -
2022
A Clustering-Inspired Quality Measure for Exceptional Preferences Mining - Design Choices and Consequences.
Verhaegh, R. F. A., Kiezebrink, J. J. E., Nusteling, F., Rio, A. W. A., Bendicsek, M. B., Duivesteijn, W. & Schouten, R. M., 2022, Discovery Science: 25th International Conference, DS 2022, Montpellier, France, October 10–12, 2022, Proceedings. Pascal, P. & Ienco, D. (eds.). Springer, p. 429-444 16 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 13601 LNAI).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review
6 Downloads (Pure) -
Finding k-Secluded Trees Faster
Donkers, H., Jansen, B. M. P. & de Kroon, J. J. H., 2022, Graph-Theoretic Concepts in Computer Science - 48th International Workshop, WG 2022, Revised Selected Papers. Bekos, M. A. & Kaufmann, M. (eds.). Springer, p. 173-186 14 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 13453 LNCS).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review
Open Access1 Citation (Scopus) -
Kernelization for Feedback Vertex Set via Elimination Distance to a Forest
Dekker, D. & Jansen, B. M. P., 2022, Graph-Theoretic Concepts in Computer Science - 48th International Workshop, WG 2022, Revised Selected Papers. Bekos, M. A. & Kaufmann, M. (eds.). Springer, p. 158-172 15 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 13453 LNCS).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review
Open Access1 Citation (Scopus) -
Search-Space Reduction via Essential Vertices
Bumpus, B. M., Jansen, B. M. P. & de Kroon, J. J. H., 1 Sept 2022, 30th Annual European Symposium on Algorithms, ESA 2022. Chechik, S., Navarro, G., Rotenberg, E. & Herman, G. (eds.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (Leibniz International Proceedings in Informatics, LIPIcs; vol. 244).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review
5 Citations (Scopus)