المؤلفون: Jansen, Bart M.P., de Kroon, Jari J.H., Wlodarczyk, Michal

المصدر: Jansen , B M P , de Kroon , J J H & Wlodarczyk , M 2025 , ' Single-exponential FPT algorithms for enumerating secluded F-free subgraphs and deleting to scattered graph classes ' , Journal of Computer and System Sciences , vol. 148 , 103597 . https://doi.org/10.1016/J.JCSS.2024.103597

مصطلحات موضوعية: Fixed-parameter tractability, Important separators, Secluded subgraphs

وصف الملف: application/pdf

الاتاحة: https://research.tue.nl/en/publications/c9b0eb5d-100f-41ad-9adf-a9798b18139c
https://doi.org/10.1016/J.JCSS.2024.103597
https://pure.tue.nl/ws/files/347238847/1-s2.0-S0022000024000928-main.pdf
http://www.scopus.com/inward/record.url?scp=85207551311&partnerID=8YFLogxK

المؤلفون: Bougeret, Marin, Jansen, Bart, M.P., Sau, Ignasi

المساهمون: Algorithmes, Graphes et Combinatoire (LIRMM, Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier (LIRMM), Centre National de la Recherche Scientifique (CNRS)-Université de Montpellier (UM)-Centre National de la Recherche Scientifique (CNRS)-Université de Montpellier (UM), Eindhoven University of Technology Eindhoven (TU/e), Dutch Research Council (NWO) through Gravitationgrant NETWORKS-024.002.003, ANR-20-CE48-0008,ELIT,Un Parcours par les Limites de l'Efficacité(2020)

المصدر: Leibniz International Proceedings in Informatics (LIPIcs) ; ICALP 2024 - 51st International Colloquium on Automata, Languages, and Programming ; https://hal-lirmm.ccsd.cnrs.fr/lirmm-04700560 ; ICALP 2024 - 51st International Colloquium on Automata, Languages, and Programming, Jul 2024, Tallinn, Estonia. pp.33:1-33:20, ⟨10.4230/LIPIcs.ICALP.2024.33⟩

مصطلحات موضوعية: hitting subgraphs, Hitting induced subgraphs, Parameterized complexity, Polynomial kernel, Complexity dichotomy, Elimination distance, [INFO]Computer Science [cs], [MATH]Mathematics [math]

جغرافية الموضوع: Tallinn, Estonia

Time: Tallinn, Estonia

الاتاحة: https://hal-lirmm.ccsd.cnrs.fr/lirmm-04700560
https://hal-lirmm.ccsd.cnrs.fr/lirmm-04700560v1/document
https://hal-lirmm.ccsd.cnrs.fr/lirmm-04700560v1/file/LIPIcs.ICALP.2024.33.pdf
https://doi.org/10.4230/LIPIcs.ICALP.2024.33

المؤلفون: Jansen, Bart M.P., Swennenhuis, Céline M.F.

المساهمون: Bart M.P. Jansen and Céline M.F. Swennenhuis

مصطلحات موضوعية: fixed-parameter tractability, Steiner Tree, structural parameterization, H-treewidth

وصف الملف: application/pdf

Relation: Is Part Of LIPIcs, Volume 308, 32nd Annual European Symposium on Algorithms (ESA 2024); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2024.76

الاتاحة: https://doi.org/10.4230/LIPIcs.ESA.2024.76
https://nbn-resolving.org/urn:nbn:de:0030-drops-211471
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2024.76

المؤلفون: Jansen, Bart M.P., Mizutani, Yosuke, Sullivan, Blair D., Verhaegh, Ruben F.A.

المساهمون: Bonnet, Édouard, Rzążewski, Paweł

المصدر: Jansen , B M P , Mizutani , Y , Sullivan , B D & Verhaegh , R F A 2024 , Preprocessing to Reduce the Search Space for Odd Cycle Transversal . in É Bonnet & P Rzążewski (eds) , 19th International Symposium on Parameterized and Exact Computation, IPEC 2024 . Leibniz International Proceedings in Informatics (LIPIcs) , vol. 321 , Schloss Dagstuhl - Leibniz-Zentrum für Informatik , 19th International Symposium on Parameterized and Exact Computation, IPEC 2024 , Egham , United Kingdom , 4/09/24 . https://doi.org/10.4230/LIPIcs.IPEC.2024.15

مصطلحات موضوعية: graph decomposition, odd cycle transversal, parameterized complexity, search-space reduction, witness of optimality

وصف الملف: application/pdf

الاتاحة: https://research.tue.nl/en/publications/db182ab3-d6f9-4a6c-b154-37561cb6e0d7
https://doi.org/10.4230/LIPIcs.IPEC.2024.15
https://pure.tue.nl/ws/files/347034816/LIPIcs.IPEC.2024.15.pdf
http://www.scopus.com/inward/record.url?scp=85213390332&partnerID=8YFLogxK

المؤلفون: Jansen, Bart M.P., Verhaegh, Ruben F.A.

المساهمون: Bodlaender, Hans L.

المصدر: Jansen , B M P & Verhaegh , R F A 2024 , Search-Space Reduction via Essential Vertices Revisited : Vertex Multicut and Cograph Deletion . in H L Bodlaender (ed.) , 19th Scandinavian Symposium on Algorithm Theory, SWAT 2024 . , 28 , Leibniz International Proceedings in Informatics (LIPIcs) , vol. 294 , Schloss Dagstuhl - Leibniz-Zentrum für Informatik , pp. 28:1-28:17 , 19th Scandinavian Symposium on Algorithm Theory, SWAT 2024 , Helsinki , Finland , 12/06/24 . https://doi.org/10.4230/LIPIcs.SWAT.2024.28

مصطلحات موضوعية: essential vertices, fixed-parameter tractability, integrality gap

وصف الملف: application/pdf

الاتاحة: https://research.tue.nl/en/publications/e9f10060-1fcb-4364-9ca7-4f350ded5b33
https://doi.org/10.4230/LIPIcs.SWAT.2024.28
https://pure.tue.nl/ws/files/347093027/LIPIcs.SWAT.2024.28_1_.pdf
http://www.scopus.com/inward/record.url?scp=85195399152&partnerID=8YFLogxK

المؤلفون: Dekker, David, Jansen, Bart M.P.

المصدر: Dekker , D & Jansen , B M P 2024 , ' Kernelization for feedback vertex set via elimination distance to a forest ' , Discrete Applied Mathematics , vol. 346 , pp. 192-214 . https://doi.org/10.1016/J.DAM.2023.12.016

مصطلحات موضوعية: Elimination distance, Feedback vertex set, Kernelization

وصف الملف: application/pdf

الاتاحة: https://research.tue.nl/en/publications/b547da42-d430-423f-b097-c1ccc4999279
https://doi.org/10.1016/J.DAM.2023.12.016
https://pure.tue.nl/ws/files/347237911/1-s2.0-S0166218X23004900-main.pdf
http://www.scopus.com/inward/record.url?scp=85180604670&partnerID=8YFLogxK

المؤلفون: Jansen, Bart M.P., Khazaliya, Liana, Kindermann, Philipp, Liotta, Giuseppe, Montecchiani, Fabrizio, Simonov, Kirill

المساهمون: Bekos, Michael A., Chimani, Markus

المصدر: Jansen , B M P , Khazaliya , L , Kindermann , P , Liotta , G , Montecchiani , F & Simonov , K 2024 , Upward and Orthogonal Planarity are W[1]-Hard Parameterized by Treewidth . in M A Bekos & M Chimani (eds) , Graph Drawing and Network Visualization : 31st International Symposium, GD 2023, Isola delle Femmine, Palermo, Italy, September 20–22, 2023, Revised Selected Papers, Part II . Lecture Notes in Computer Science (LNCS) , vol. 14466 , Springer , pp. 203-217 , 31st International Symposium on Graph Drawing and Network Visualization, GD 2023 , Palermo ....

مصطلحات موضوعية: Parameterized Complexity, Rectilinear Planarity, Treewidth, Upward Planarity

وصف الملف: application/pdf

الاتاحة: https://research.tue.nl/en/publications/aa0b1d6f-62b6-428c-8b92-48683e9c1c11
https://doi.org/10.1007/978-3-031-49275-4_14
https://pure.tue.nl/ws/files/345522414/978-3-031-49275-4_14.pdf
http://www.scopus.com/inward/record.url?scp=85182594823&partnerID=8YFLogxK

المؤلفون: Donkers, Huib, Jansen, Bart M.P.

المصدر: Donkers , H & Jansen , B M P 2024 , ' Preprocessing to reduce the search space : Antler structures for feedback vertex set ' , Journal of Computer and System Sciences , vol. 144 , 103532 . https://doi.org/10.1016/J.JCSS.2024.103532

مصطلحات موضوعية: Feedback vertex set, Graph decomposition, Kernelization, Preprocessing

وصف الملف: application/pdf

الاتاحة: https://research.tue.nl/en/publications/8b525f23-6506-40d8-b646-eab32fc82691
https://doi.org/10.1016/J.JCSS.2024.103532
https://pure.tue.nl/ws/files/347237709/1-s2.0-S0022000024000278-main.pdf
http://www.scopus.com/inward/record.url?scp=85189855206&partnerID=8YFLogxK

المؤلفون: Bumpus, Benjamin Merlin, Jansen, Bart M.P., de Kroon, Jari J.H.

المصدر: Bumpus , B M , Jansen , B M P & de Kroon , J J H 2024 , ' Search-Space Reduction via Essential Vertices ' , SIAM Journal on Discrete Mathematics , vol. 38 , no. 3 , pp. 2392-2415 . https://doi.org/10.1137/23M1589347

مصطلحات موضوعية: covering versus packing, essential vertices, fixed-parameter tractability

وصف الملف: application/pdf

الاتاحة: https://research.tue.nl/en/publications/56170a91-b485-4bd7-8534-78fafe8b19a7
https://doi.org/10.1137/23M1589347
https://pure.tue.nl/ws/files/347238142/23m1589347.pdf
http://www.scopus.com/inward/record.url?scp=85203451037&partnerID=8YFLogxK

المؤلفون: Jansen, Bart M.P., Wlodarczyk, Michal

المصدر: Jansen , B M P & Wlodarczyk , M 2024 , ' Optimal Polynomial-Time Compression for Boolean Max CSP ' , ACM Transactions on Computation Theory , vol. 16 , no. 1 , 4 . https://doi.org/10.1145/3624704

مصطلحات موضوعية: Constraint satisfaction problem, exponential-time algorithms, kernelization

وصف الملف: application/pdf

الاتاحة: https://research.tue.nl/en/publications/18b9f8a4-8a4c-43f7-863d-dfa61e727be1
https://doi.org/10.1145/3624704
https://pure.tue.nl/ws/files/347237483/3624704.pdf
http://www.scopus.com/inward/record.url?scp=85187788865&partnerID=8YFLogxK

المؤلفون: Bumpus, Benjamin Merlin, Jansen, Bart M.P., Venne, Jaime

المساهمون: Bodlaender, Hans L.

المصدر: Bumpus , B M , Jansen , B M P & Venne , J 2024 , Fixed-Parameter Tractable Certified Algorithms for Covering and Dominating in Planar Graphs and Beyond . in H L Bodlaender (ed.) , 19th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2024 . , 19 , Leibniz International Proceedings in Informatics, LIPIcs , vol. 294 , Schloss Dagstuhl - Leibniz-Zentrum für Informatik , pp. 19:1-19:16 , 19th Scandinavian Symposium on Algorithm Theory, SWAT 2024 , Helsinki , Finland , 12/06/24 . https://doi.org/10.4230/LIPICS.SWAT.2024.19

مصطلحات موضوعية: certified algorithms, fixed-parameter tractability

وصف الملف: application/pdf

الاتاحة: https://research.tue.nl/en/publications/33376f2e-73b6-4806-a0fd-fdc39dbf36b9
https://doi.org/10.4230/LIPICS.SWAT.2024.19
https://pure.tue.nl/ws/files/347440372/LIPIcs.SWAT.2024.19_1_.pdf
http://www.scopus.com/inward/record.url?scp=85195370779&partnerID=8YFLogxK

المؤلفون: Jaffke, Lars, Jansen, Bart M.P.

المصدر: Jaffke , L & Jansen , B M P 2023 , ' Fine-grained parameterized complexity analysis of graph coloring problems ' , Discrete Applied Mathematics , vol. 327 , pp. 33-46 . https://doi.org/10.1016/j.dam.2022.11.011

مصطلحات موضوعية: Fine-grained complexity, Fixed-parameter tractability, Graph coloring, Strong Exponential Time Hypothesis, Structural parameterizations

وصف الملف: application/pdf

الاتاحة: https://research.tue.nl/en/publications/03425c51-8037-4674-87a2-ef28aec9cd5d
https://doi.org/10.1016/j.dam.2022.11.011
https://pure.tue.nl/ws/files/315044656/1-s2.0-S0166218X22004346-main.pdf
http://www.scopus.com/inward/record.url?scp=85143688076&partnerID=8YFLogxK

المؤلفون: Donkers, Huib, Jansen, Bart M.P., de Kroon, Jari J.H.

المصدر: Donkers , H , Jansen , B M P & de Kroon , J J H 2023 , ' Finding k-secluded trees faster ' , Journal of Computer and System Sciences , vol. 138 , 103461 . https://doi.org/10.1016/j.jcss.2023.05.006

مصطلحات موضوعية: Enumeration algorithm, FPT, Secluded tree

وصف الملف: application/pdf

الاتاحة: https://research.tue.nl/en/publications/9741bdf1-0adc-4a1a-9e5d-0990b93c1d42
https://doi.org/10.1016/j.jcss.2023.05.006
https://pure.tue.nl/ws/files/315045369/1-s2.0-S0022000023000594-main.pdf
http://www.scopus.com/inward/record.url?scp=85163753431&partnerID=8YFLogxK

المؤلفون: Chen, Hubie, Jansen, Bart M.P., Okrasa, Karolina, Pieterse, Astrid, Rzążewski, Paweł

المصدر: Chen , H , Jansen , B M P , Okrasa , K , Pieterse , A & Rzążewski , P 2023 , ' Sparsification Lower Bounds for List H-Coloring ' , ACM Transactions on Computation Theory , vol. 15 , no. 3-4 , 8 . https://doi.org/10.1145/3612938

مصطلحات موضوعية: List H-coloring, constraint satisfaction problem, sparsification

وصف الملف: application/pdf

الاتاحة: https://research.tue.nl/en/publications/6cd0cd13-e63b-4cca-9d3b-800c69a29ca0
https://doi.org/10.1145/3612938
https://pure.tue.nl/ws/files/315044951/3612938.pdf
http://www.scopus.com/inward/record.url?scp=85181516534&partnerID=8YFLogxK

المؤلفون: Jansen, Bart M.P., Roy, Shivesh

المساهمون: Misra, Neeldhara, Wahlstrom, Magnus

المصدر: Jansen , B M P & Roy , S 2023 , Sunflowers Meet Sparsity: A Linear-Vertex Kernel for Weighted Clique-Packing on Sparse Graphs . in N Misra & M Wahlstrom (eds) , 18th International Symposium on Parameterized and Exact Computation, IPEC 2023 . , 29 , Leibniz International Proceedings in Informatics, LIPIcs , vol. 285 , Schloss Dagstuhl - Leibniz-Zentrum für Informatik , pp. 29:1-29:13 . https://doi.org/10.4230/LIPIcs.IPEC.2023.29

مصطلحات موضوعية: bounded expansion, graph packing, kernelization, nowhere dense, sunflower lemma, weighted problems

وصف الملف: application/pdf

Relation: urn:ISBN:9783959773058

الاتاحة: https://research.tue.nl/en/publications/4456ef56-91d1-4152-a00a-968336ea12d6
https://doi.org/10.4230/LIPIcs.IPEC.2023.29
https://pure.tue.nl/ws/files/316683647/LIPIcs.IPEC.2023.29.pdf
http://www.scopus.com/inward/record.url?scp=85180553267&partnerID=8YFLogxK

المؤلفون: Einarson, Carl, Gutin, Gregory, Jansen, Bart M.P., Majumdar, Diptapriyo, Wahlström, Magnus

المصدر: Journal of Computer and System Sciences ; volume 133, page 23-40 ; ISSN 0022-0000

الاتاحة: http://dx.doi.org/10.1016/j.jcss.2022.11.002
https://api.elsevier.com/content/article/PII:S0022000022000824?httpAccept=text/xml
https://api.elsevier.com/content/article/PII:S0022000022000824?httpAccept=text/plain

المؤلفون: Chapman, Tara, van Sint Jan, Serge, Louryan, Stéphane, Balzeau, Antoine, Been, Ella, García-Martínez, Daniel, Hambucken, Anne, Mathys, Aurore, Cammaert, Laurence, Brecko, Jonathan, Eric, Dewamme, Rougier, Hélène, Crevecoeur, Isabelle, Polet, Caroline, Berillon, Gilles, Barash, Alon, Sholukha, Victor, Moiseev, Fedor, Desmedt, Claude, Soussoko, Samba, Fischer, Valentine, Beyer, Benoit, Jerbi, Taha, Jansen, Bart, M.P., Semal, Patrick

المساهمون: Histoire naturelle de l'Homme préhistorique (HNHP), Muséum national d'Histoire naturelle (MNHN)-Université de Perpignan Via Domitia (UPVD)-Centre National de la Recherche Scientifique (CNRS), Groupement des Anthropologistes de Langue Française, ANR-20-CE27-0009,PaleoBRAIN,Ressusciter le cerveau d'Homo erectus et des Néandertaliens(2020)

المصدر: 35ème Colloque du Groupement des Anthropologistes de Langue Française
https://hal.science/hal-04731705
35ème Colloque du Groupement des Anthropologistes de Langue Française, Groupement des Anthropologistes de Langue Française, Oct 2024, Bruxelles, Belgique

مصطلحات موضوعية: [SHS.ANTHRO-BIO]Humanities and Social Sciences/Biological anthropology

جغرافية الموضوع: Bruxelles, Belgium

الاتاحة: https://hal.science/hal-04731705

المؤلفون: Bougeret, Marin, Jansen, Bart M.P., Sau, Ignasi

المصدر: Bougeret , M , Jansen , B M P & Sau , I 2022 , ' Bridge-Depth Characterizes which Minor-Closed Structural Parameterizations of Vertex Cover Admit a Polynomial Kernel ' , SIAM Journal on Discrete Mathematics , vol. 36 , no. 4 , pp. 2737-2773 . https://doi.org/10.1137/21M1400766

مصطلحات موضوعية: bridge-depth, parameterized complexity, polynomial kernel, structural parameterization, vertex cover

وصف الملف: application/pdf

الاتاحة: https://research.tue.nl/en/publications/6d2d0f62-b95c-4728-a1ea-dff33de02dfb
https://doi.org/10.1137/21M1400766
https://pure.tue.nl/ws/files/286031777/21m1400766_1.pdf
http://www.scopus.com/inward/record.url?scp=85148022019&partnerID=8YFLogxK

المؤلفون: Donkers, Huib, Jansen, Bart M.P., Włodarczyk, Michał

المصدر: Donkers , H , Jansen , B M P & Włodarczyk , M 2022 , ' Preprocessing for Outerplanar Vertex Deletion : An Elementary Kernel of Quartic Size ' , Algorithmica , vol. 84 , no. 11 , pp. 3407-3458 . https://doi.org/10.1007/s00453-022-00984-2

مصطلحات موضوعية: Fixed-parameter tractability, Kernelization, Outerplanar graphs

وصف الملف: application/pdf

الاتاحة: https://research.tue.nl/en/publications/037a5637-ffbf-478d-8d21-5ac08bbf35a2
https://doi.org/10.1007/s00453-022-00984-2
https://pure.tue.nl/ws/files/246772604/s00453_022_00984_2.pdf
http://www.scopus.com/inward/record.url?scp=85131945657&partnerID=8YFLogxK

المؤلفون: Jansen, Bart M.P., de Kroon, Jari J.H.

المصدر: Jansen , B M P & de Kroon , J J H 2022 , ' Preprocessing vertex-deletion problems : Characterizing graph properties by low-rank adjacencies ' , Journal of Computer and System Sciences , vol. 126 , pp. 59-79 . https://doi.org/10.1016/j.jcss.2021.12.003

مصطلحات موضوعية: Graph modification, Kernelization, Structural parameterization, Vertex-deletion

وصف الملف: application/pdf

الاتاحة: https://research.tue.nl/en/publications/8f7c5602-3770-4bcc-ba53-6f83f74afe9b
https://doi.org/10.1016/j.jcss.2021.12.003
https://pure.tue.nl/ws/files/246772752/1_s2.0_S0022000021001239_main.pdf
http://www.scopus.com/inward/record.url?scp=85122451075&partnerID=8YFLogxK