arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website. Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them. Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Is this you? As a journalist, you can create a free Muck Rack account to customize your profile, list your contact preferences, and upload a portfolio of your best work.
Claim your profile
Articles by Bart M. P
Computer Science > Discrete Mathematics
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website. Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them. Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Computer Science > Computational Geometry
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website. Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them. Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
[2507.07942] The Richness of CSP Non-redundancy
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website. Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them. Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
[2404.16695] Kernelization Dichotomies for Hitting Subgraphs under Structural Parameterizations
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website. Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them. Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
[2310.04332] On the Parameterized Complexity of Multiway Near-Separator
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website. Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them. Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
[2309.11366] Single-Exponential FPT Algorithms for Enumerating Secluded $\mathcal{F}$-Free Subgraphs and Deleting to Scattered Graph Classes
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website. Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them. Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
[2306.17065] 5-Approximation for $\mathcal{H}$-Treewidth Essentially as Fast as $\mathcal{H}$-Deletion Parameterized by Solution Size
arXiv:2306.17065 (cs) Download a PDF of the paper titled 5-Approximation for $\mathcal{H}$-Treewidth Essentially as Fast as $\mathcal{H}$-Deletion Parameterized by Solution Size, by Bart M. P.
Preprocessing to Reduce the Search Space: Antler Structures for Feedback Vertex Set
[Submitted on 22 Jun 2021 ( v1 ), last revised 11 Apr 2024 (this version, v2)] Title:Preprocessing to Reduce the Search Space: Antler Structures for Feedback Vertex Set View a PDF of the paper titled Preprocessing to Reduce the Search Space: Antler Structures for Feedback Vertex Set, by Huib Donkers and Bart M.P. Jansen View PDF HTML (experimental) Abstract:The goal of this paper is to open up a new research direction aimed at understanding the power of preprocessing in speeding up algorithms...
[2004.12865] Bridge-Depth Characterizes which Structural Parameterizations of Vertex Cover Admit a Polynomial Kernel
[Submitted on 27 Apr 2020 ( v1 ), last revised 24 Jul 2023 (this version, v2)] Title:Bridge-Depth Characterizes which Structural Parameterizations of Vertex Cover Admit a Polynomial Kernel Download a PDF of the paper titled Bridge-Depth Characterizes which Structural Parameterizations of Vertex Cover Admit a Polynomial Kernel, by Marin Bougeret and 2 other authors Download PDF Abstract: We study the kernelization complexity of structural parameterizations of the Vertex Cover problem.
Show More
loading
Actions
Is this you?
As a journalist, you can create a free Muck Rack account to customize your profile, list your contact preferences, and upload a portfolio of your best work.Get in touch with Bart M.
Contact Bart M., search articles and posts on X, monitor coverage, and track replies from one place.
Learn more about Muck Rack