„Tree Decomposition“

Suchergebnisse

286 Treffer

• Unintuitive Facts About Distances on Planar Graphs (Invited Talk)
  Chang, Hsien-Chih 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Homomorphism Indistinguishability and Game Comonads for Restricted Conjunction and Requantification
  Schindling, Georg 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Graphs with No Long Claws: An Improved Bound for the Analog of the Gyárfás' Path Argument
  Bourneuf, Romain ; Masaříková, Jana ; Nadara, Wojciech ; Pilipczuk, Marcin 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Using Games and Universal Trees to Characterise the Nondeterministic Index of Tree Languages
  Idir, Olivier ; Lehtinen, Karoliina 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Treewidth Parameterized by Feedback Vertex Number
  Molter, Hendrik ; Zehavi, Meirav ; Zivan, Amit 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Litter decomposition is influenced by precipitation regime but not by single-tree selection harvesting in Nothofagus pumilio forests of western Patagonia
  Soto, Daniel P.
• Tree diversity affects temperature sensitivity of soil organic matter decomposition in rhizosphere
  Gao, Fei ; Gao, Dandan ; Ning, Chen ; Liu, Shuguang ; Kuzyakov, Yakov ; Smith, Andy ; Yan, Wende
• Induced Subgraphs and Tree Decompositions VIII: Excluding a Forest in (Theta, Prism)-Free Graphs
  Abrishami, Tara ; Alecu, Bogdan ; Chudnovsky, Maria ; Hajebi, Sepehr ; Spirkl, Sophie Theresa
• Decomposition methods for the two-stage stochastic Steiner tree problem
  Leitner, Markus ; Ljubić, Ivana ; Luipersbeck, Martin ; Sinnl, Markus
• Intersection Queries for Flat Semi-Algebraic Objects in Three Dimensions and Related Problems
  Agarwal, Pankaj K. ; Aronov, Boris ; Ezra, Esther ; Katz, Matthew J. ; Šārîr, Mîkā 2022 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• DynASP2.5: Dynamic Programming on Tree Decompositions in Action
  Fichte, Johannes Klaus ; Hecher, Markus ; Morak, Michael ; Woltran, Stefan 2018 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• A Nearly Quadratic Bound for the Decision Tree Complexity of k-SUM
  Ezra, Esther ; Šārîr, Mîkā 2017 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Balanced Judicious Bipartition is Fixed-Parameter Tractable
  Lokshtanov, Daniel ; Saurabh, Saket ; Sharma, Roohani ; Zehavi, Meirav 2018 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• A heuristic for generating scenario trees for multistage decision problems
  Høyland, Kjetil ; Kaut, Michal ; Wallace, Stein W. 2001 Humboldt-Universität zu Berlin
• Root quality and decomposition environment, but not tree species richness, drive root decomposition in tropical forests
  Guerrero Ramírez, Nathaly Rokssana ; Craven, Dylan ; Messier, Christian C. ; Potvin, Catherine ; Turner, Benjamin L. ; Handa, I. Tanya
• Structural Parameterizations with Modulator Oblivion
  Jacob, Ashwin ; Panolan, Fahad ; Raman, Venkatesh ; Sahlot, Vibha 2020 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Parameterized Complexity of Multi-Node Hubs
  Saurabh, Saket ; Zehavi, Meirav 2019 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Tree species diversity modulates the effects of fungal pathogens on litter decomposition: evidences from an incubation experiment
  Guo, Lulu ; Chang, Pengfei ; Deng, Meifeng ; Yang, Sen ; Yang, Lu ; Peng, Ziyang ; Beugnon, Rémy ; Saadani, Mariem ; Wang, Zhenhua ; Jia, Zhou ; Wang, Bin ; Liu, Chao ; Cesarz, Simone ; Eisenhauer, Nico ; Bruelheide, Helge ; Liu, Lingli
• Decomposition dynamics of coarse woody debris of three important central European tree species
  Herrmann, Steffen ; Kahl, Tiemo ; Bauhus, Jürgen 2025 Universität
• Tree Decompositions Meet Induced Matchings: Beyond Max Weight Independent Set
  Lima, Paloma T. ; Milanič, Martin ; Muršič, Peter ; Okrasa, Karolina ; Rzążewski, Paweł ; Štorgel, Kenny 2024 Schloss Dagstuhl – Leibniz-Zentrum für Informatik