„parameterized algorithm“

Suchergebnisse

565 Treffer

• An Improved Deterministic Parameterized Algorithm for Cactus Vertex Deletion
  Aoike, Yuuki ; Gima, Tatsuya ; Hanaka, Tesshu ; Kiyomi, Masashi ; Kobayashi, Yasuaki ; Kobayashi, Yusuke ; Kurita, Kazuhiro ; Otachi, Yota
• Parameterized Quantum Circuits for Learning Cooperative Quantum Teleportation
  Feng, Yan‐Y. ; Zhou, Jian ; Zhang, Dan‐B. ; Shi, Jin‐J.
• Parameterized Complexity of Graph Burning
  Kobayashi, Yasuaki ; Otachi, Yota
• An Interior Point Parameterized Central Path Following Algorithm for Linearly Constrained Convex Programming
  Hou, Liangshao ; Qian, Xun ; Liao, Li-Zhi ; Sun, Jie
• Finding Optimal Triangulations Parameterized by Edge Clique Cover
  Korhonen, Tuukka
• Graph Modification for Edge-Coloured and Signed Graph Homomorphism Problems: Parameterized and Classical Complexity
  Foucaud, Florent ; Hocquard, Hervé ; Lajou, Dimitri ; Mitsou, Valia ; Pierron, Théo
• On the Parameterized Complexity of Maximum Degree Contraction Problem
  Saurabh, Saket ; Tale, Prafullkumar
• Continuously Parameterized Symmetries and Buchberger's Algorithm
  Hemmecke, Ralf 2019 Universitätsbibliothek Leipzig
• Parameterized Complexity of $$(A,\ell )$$ ( A , ℓ ) -Path Packing
  Belmonte, Rémy ; Hanaka, Tesshu ; Kanzaki, Masaaki ; Kiyomi, Masashi ; Kobayashi, Yasuaki ; Kobayashi, Yusuke ; Lampis, Michael ; Ono, Hirotaka ; Otachi, Yota
• Pyramidal Image Compression Using the Parameterized NEDI Algorithm
  Gashnikov, M. V.
• Parameterized complexity of configuration integer programs
  Knop, Dušan ; Koutecký, Martin ; Levin, Asaf ; Mnich, Matthias ; Onn, Shmuel 2021 Universitätsbibliothek der Technischen Universität Hamburg-Harburg
• On Girth and the Parameterized Complexity of Token Sliding and Token Jumping
  Bartier, Valentin ; Bousquet, Nicolas ; Dallard, Clément ; Lomer, Kyle ; Mouawad, Amer E.
• Special Issue Dedicated to the 14th International Symposium on Parameterized and Exact Computation
  Jansen, Bart M. P. ; Telle, Jan Arne
• Parameterized and exact algorithms for finding a read-once resolution refutation in 2CNF formulas
  Subramani, K. ; Wojciechowski, Piotr
• Parameterized complexity of constraint satisfaction problems
  Marx, Dániel
• Non-Intrusive Reduced-Order Modeling of Parameterized Electromagnetic Scattering Problems using Cubic Spline Interpolation
  Li, Kun ; Huang, Ting-Zhu ; Li, Liang ; Lanteri, Stéphane
• Degree-constrained editing of small-degree graphs
  Nichterlein, André 2015 Univ.-Verl. der TU
• Improved Parameterized Algorithms for Network Query Problems
  Pinter, Ron Y. ; Shachnai, Hadas ; Zehavi, Meirav
• A parameterized Douglas–Rachford algorithm
  Wang, Dongying ; Wang, Xianfu
• Generalized Feedback Vertex Set Problems on Bounded-Treewidth Graphs: Chordality is the Key to Single-Exponential Parameterized Algorithms
  Bonnet, Édouard ; Brettell, Nick ; Kwon, O-joung ; Marx, Dániel