„modular-width“

Suchergebnisse

20 Treffer

• Bridging Treewidth and Clique-Width via Cograph-Modular-Treewidth
  Blažej, Václav ; Jana, Satyabrata ; Ramanujan, M. S. ; Strulo, Peter 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Efficient parameterized algorithms on structured graphs
  Nelles, Florian ; Kratsch, Stefan ; Friedrich, Tobias ; Kreutzer, Stephan 2023 Humboldt-Universität zu Berlin
• Formwork-free, continuous production of variable frame elements for modular shell structures
  Ivaniuk, Egor ; Mechtcherine, Viktor 2022 Technische Universität Dresden
• Parameterized Shortest Path Reconfiguration
  Bousquet, Nicolas ; Gajjar, Kshitij ; Lahiri, Abhiruk ; Mouawad, Amer E. 2024 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Equitable Connected Partition and Structural Parameters Revisited: N-Fold Beats Lenstra
  Blažej, Václav ; Knop, Dušan ; Pokorný, Jan ; Schierreich, Šimon 2024 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Parameterized Complexity of Domination Problems Using Restricted Modular Partitions
  Lafond, Manuel ; Luo, Weidong 2023 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
• Twin-Width V: Linear Minors, Modular Counting, and Matrix Multiplication
  Bonnet, Édouard ; Giocanti, Ugo ; Ossona de Mendez, Patrice ; Thomassé, Stéphan 2023 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Parameterized Complexity of Maximum Happy Set and Densest k-Subgraph
  Mizutani, Yosuke ; Sullivan, Blair D. 2022 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Efficient Parameterized Algorithms for Computing All-Pairs Shortest Paths
  Kratsch, Stefan ; Nelles, Florian 2020 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Parameterized Complexity of Fair Vertex Evaluation Problems
  Knop, Dušan ; Masařík, Tomáš ; Toufar, Tomáš 2019 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Efficient and Adaptive Parameterized Algorithms on Modular Decompositions
  Kratsch, Stefan ; Nelles, Florian 2018 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Jdrasil: A Modular Library for Computing Tree Decompositions
  Bannach, Max ; Berndt, Sebastian ; Ehlers, Thorsten 2017 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• On the width of sets of irreducibles in finite modular lattices
  Wille, Rudolf
• A hybrid pulse-width modulation technique for a modular multilevel converter with embedded energy sources
  Das, Rana ; Ahmed, Irfan ; Bera, Tushar Kanti ; Mahato, Sankar Narayan
• Experimental Investigation of Modular Multilevel Converter Using Space Vector Pulse Width Modulation
  Balamurugan, S. ; Palanisamy, R. ; Karthikeyan, B.
• Independent Set Reconfiguration Parameterized by Modular-Width
  Belmonte, Rémy ; Hanaka, Tesshu ; Lampis, Michael ; Ono, Hirotaka ; Otachi, Yota
• Carrier dynamic overlapping switching frequency optimal pulse width modulation method for modular multilevel converters
  ZHOU, Fayun ; XU, Qianming ; LUO, An ; HE, Zhixing ; LI, Yan ; XIE, Ning ; WANG, Yichao
• An Improved Alternative Pulse Width Modulation Method for Modular Multilevel Converters
  2014 Prior Art Publishing GmbH
• Algorithms Parameterized by Vertex Cover and Modular Width, Through Potential Maximal Cliques
  Fomin, Fedor V. ; Liedloff, Mathieu ; Montealegre, Pedro ; Todinca, Ioan