Zobrazeno 1 - 10
of 780
pro vyhledávání: '"A. Bergougnoux"'
Problems from metric graph theory like Metric Dimension, Geodetic Set, and Strong Metric Dimension have recently had a strong impact in parameterized complexity by being the first known problems in NP to admit double-exponential lower bounds in the t
Externí odkaz:
http://arxiv.org/abs/2309.17419
Autor:
Bergougnoux, Benjamin, Gajarský, Jakub, Guśpiel, Grzegorz, Hliněný, Petr, Pokrývka, Filip, Sokołowski, Marek
Twin-width is a structural width parameter introduced by Bonnet, Kim, Thomass\'e and Watrigant [FOCS 2020]. Very briefly, its essence is a gradual reduction (a contraction sequence) of the given graph down to a single vertex while maintaining limited
Externí odkaz:
http://arxiv.org/abs/2307.01732
Autor:
Bergougnoux, Benjamin, Chekan, Vera, Ganian, Robert, Kanté, Mamadou Moustapha, Mnich, Matthias, Oum, Sang-il, Pilipczuk, Michał, van Leeuwen, Erik Jan
Dynamic programming on various graph decompositions is one of the most fundamental techniques used in parameterized complexity. Unfortunately, even if we consider concepts as simple as path or tree decompositions, such dynamic programming uses space
Externí odkaz:
http://arxiv.org/abs/2307.01285
For a given graph $G$, a depth-first search (DFS) tree $T$ of $G$ is an $r$-rooted spanning tree such that every edge of $G$ is either an edge of $T$ or is between a \textit{descendant} and an \textit{ancestor} in $T$. A graph $G$ together with a DFS
Externí odkaz:
http://arxiv.org/abs/2307.00362
Breast cancer survivors’ opinion on personalizing endocrine therapy and developing informative tools
Autor:
Elie Rassy, Chiara Benvenuti, Sarra Akla, Antonio Di Meglio, Elise Martin, Julie Havas, André Rieutord, David Combarel, Léonor Fasse, Florian Scotté, Laure Guéroult Accolas, Guillemette Jacob, Anne Bergougnoux, Suzette Delaloge, Ines Vaz-Luis, Barbara Pistilli
Publikováno v:
npj Breast Cancer, Vol 10, Iss 1, Pp 1-6 (2024)
Abstract Understanding breast cancer survivors’ perspectives is critical to personalizing endocrine therapy (ET) in the adjuvant setting. A nationwide survey among breast cancer survivors was proposed in France, in collaboration with patient advoca
Externí odkaz:
https://doaj.org/article/d1fa8614642446248123b29cc4747664
We study the tractability of the maximum independent set problem from the viewpoint of graph width parameters, with the goal of defining a width parameter that is as general as possible and allows to solve independent set in polynomial-time on graphs
Externí odkaz:
http://arxiv.org/abs/2302.10643
We show that there is no $2^{o(k^2)} n^{O(1)}$ time algorithm for Independent Set on $n$-vertex graphs with rank-width $k$, unless the Exponential Time Hypothesis (ETH) fails. Our lower bound matches the $2^{O(k^2)} n^{O(1)}$ time algorithm given by
Externí odkaz:
http://arxiv.org/abs/2210.02117
Autor:
Dieu Thu Nguyen, Filip Zavadil Kokáš, Mathieu Gonin, Jérémy Lavarenne, Myriam Colin, Pascal Gantet, Véronique Bergougnoux
Publikováno v:
BMC Plant Biology, Vol 24, Iss 1, Pp 1-14 (2024)
Abstract Background Roots play an important role during plant growth and development, ensuring water and nutrient uptake. Understanding the mechanisms regulating their initiation and development opens doors towards root system architecture engineerin
Externí odkaz:
https://doaj.org/article/25d16e82733a41fe9b33f90df67986d2
We introduce a logic called distance neighborhood logic with acyclicity and connectivity constraints ($\mathsf{A\&C~DN}$ for short) which extends existential $\mathsf{MSO_1}$ with predicates for querying neighborhoods of vertex sets and for verifying
Externí odkaz:
http://arxiv.org/abs/2202.13335
Publikováno v:
EBioMedicine, Vol 102, Iss , Pp 105059- (2024)
Externí odkaz:
https://doaj.org/article/fa1ada148c994fc19b80a138905e42af