„branch-width“

Suchergebnisse

1.000+ Treffer

• Leaf-cutting ants as road engineers: the width of trails at branching points in Atta cephalotes
  Farji-Brener, A. G. ; Morueta-Holme, N. ; Chinchilla, F. ; Willink, B. ; Ocampo, N. ; Bruner, G.
• Width, Depth, and Space: Tradeoffs between Branching and Dynamic Programming
  Chen, Li-Hsuan ; Reidl, Felix ; Rossmanith, Peter ; Sanchez Villaamil, Fernando 2018 Universitätsbibliothek der RWTH Aachen
• Measurement of the Exclusive and Inclusive Branching Fractions of B0s→D(*)s+Ds(*) Decays at CDF and its Implications on the Decay Width Difference in the B0s-B̄0s Meson System
  Horn, Dominik ; Feindt, M. 2011 KIT-Bibliothek
• On Algorithmic Applications of ℱ-Branchwidth
  Bergougnoux, Benjamin ; Hamm, Thekla ; Jaffke, Lars ; Lima, Paloma T. 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Classes of Directed Graphs
  Bang-Jensen, Jørgen ; Gutin, Gregory Z. 2018 Springer International Publishing
• On the Optimality of Pseudo-polynomial Algorithms for Integer Programming
  Fomin, Fedor V. ; Panolan, Fahad ; Ramanujan, M. S. ; Saurabh, Saket 2018 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• On the Power of Border Width-2 ABPs over Fields of Characteristic 2
  Dutta, Pranjal ; Ikenmeyer, Christian ; Komarath, Balagopal ; Mittal, Harshil ; Nanoti, Saraswati Girish ; Thakkar, Dhara 2024 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• An FPT Algorithm for Spanning Trees with Few Branch Vertices Parameterized by Modular-Width
  Gargano, Luisa ; Rescigno, Adele A. 2023 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• New PRGs for Unbounded-Width/Adaptive-Order Read-Once Branching Programs
  Chen, Lijie ; Lyu, Xin ; Tal, Avishay ; Wu, Hongxun 2023 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• A Unifying Framework for Characterizing and Computing Width Measures
  Eiben, Eduard ; Ganian, Robert ; Hamm, Thekla ; Jaffke, Lars ; Kwon, O-joung 2022 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Pseudorandom Generators for Unbounded-Width Permutation Branching Programs
  Hoza, William M. ; Pyne, Edward ; Vadhan, Salil 2021 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Matrices of Optimal Tree-Depth and Row-Invariant Parameterized Algorithm for Integer Programming
  Chan, Timothy F. N. ; Cooper, Jacob W. ; Koutecký, Martin ; Král', Daniel ; Pekárková, Kristýna 2020 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Finding Branch-Decompositions of Matroids, Hypergraphs, and More
  Jeong, Jisu ; Kim, Eun Jung ; Oum, Sang-il 2018 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• On Algebraic Branching Programs of Small Width
  Bringmann, Karl ; Ikenmeyer, Christian ; Zuiddam, Jeroen 2017 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Pseudorandomness and Fourier Growth Bounds for Width-3 Branching Programs
  Steinke, Thomas ; Vadhan, Salil ; Wan, Andrew 2014 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Clique-width: When Hard Does Not Mean Impossible
  Ganian, Robert ; Hlineny, Petr ; Obdrzalek, Jan 2011 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• An analog of the Migdal-Kohn singularity and the radiation width of the high-frequency branch of the polariton spectrum for a bounded crystal of the J-aggregate type
  Dubovsky, O. A.
• Measurement of two-photon decay width of χ c2(1P) in γγ → χ c2(1P) → J/ψγ at Belle
  Seino, Y. ; Hayasaka, K. ; Uehara, S. ; Adachi, I. ; Aihara, H. ; Said, S. Al ; Asner, D. M. ; Atmacan, H. ; Aushev, T. ; Ayad, R. ; Babu, V. ; Bahinipati, S. ; Behera, P. ; Belous, K. ; Bennett, J. ; Bessner, M. ; Bhardwaj, V. ; Bhuyan, B. ; Bilka, T. ; Bodrov, D. ; Bonvicini, G. ; Borah, J. ; Bozek, A. ; Bračko, M. ; Branchini, P. ; Browder, T. E. ; Budano, A. ; Campajola, M. ; Červenkov, D. ; Chang, M.-C ; Chang, P. ; Chekelian, V. ; Chen, A. ; Cheon, B. G. ; Chilikin, K. ; Cho, H. E. ; Cho, K. ; Cho,
• Determination of the muonic branching ratio of the W boson and its total width via cross-section measurements at the Tevatron and LHC
  Camarda, Stefano ; Cuth, Jakub ; Schott, Matthias
• Branching ratios forD→VV decays in presence of smearing effects due toρ-meson width
  Uppal, Taruni ; Verma, R. C.