„Vertex Cover“

Suchergebnisse

1.000+ Treffer

• An efficient local search for partial vertex cover problem
  Zhou, Yupeng ; Wang, Yiyuan ; Gao, Jian ; Luo, Na ; Wang, Jianan
• Multistage Vertex Cover
  Fluschnik, Till ; Niedermeier, Rolf ; Rohm, Valentin ; Zschoche, Philipp
• Tight approximation bounds for vertex cover on dense k-partite hypergraphs
  Karpiński, Marek ; Schmied, Richard ; Viehmann, Claus 2011 Inst. für Informatik
• Front Cover: Wireframe DNA Origami Capable of Vertex‐protruding Transformation (ChemBioChem 10/2025)
  Ochi, Yosuke ; Kato, Wataru ; Tsutsui, Yoichi ; Gomibuchi, Yuki ; Tominaga, Daichi ; Sakai, Keisuke ; Araki, Takeshi ; Yoshitake, Suzunosuke ; Yasunaga, Takuo ; Morimoto, Yusuke V. ; Maeda, Kazuhiro ; Taira, Junichi ; Sato, Yusuke
• Cover Picture: A Platinum Highly Concave Cube with one Leg on each Vertex as an Advanced Nanocatalyst for Electrocatalytic Applications (ChemCatChem 7/2015)
  Lai, Jianping ; Niu, Wenxin ; Qi, Wenjing ; Zhao, Jianming ; Li, Suping ; Gao, Wenyue ; Luque, Rafael ; Xu, Guobao
• A local search algorithm with tabu strategy and perturbation mechanism for generalized vertex cover problem
  Li, Ruizhi ; Hu, Shuli ; Wang, Yiyuan ; Yin, Minghao
• Multistage vertex cover
  Fluschnik, Till ; Niedermeier, Rolf ; Rohm, Valentin ; Zschoche, Philipp 2022 Technische Universität Berlin
• Problems in NP Can Admit Double-Exponential Lower Bounds When Parameterized by Treewidth or Vertex Cover
  Foucaud, Florent ; Galby, Esther ; Khazaliya, Liana ; Li, Shaohua ; Mc Inerney, Fionn ; Sharma, Roohani ; Tale, Prafullkumar 2024 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• There and Back Again: On Applying Data Reduction Rules by Undoing Others
  Figiel, Aleksander ; Froese, Vincent ; Nichterlein, André ; Niedermeier, Rolf 2022 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Multistage Vertex Cover
  Fluschnik, Till ; Niedermeier, Rolf ; Rohm, Valentin ; Zschoche, Philipp 2019 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Distributed Set Cover Approximation: Primal-Dual with Optimal Locality
  Even, Guy ; Ghaffari, Mohsen ; Medina, Moti 2018 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Targeted Branching for the Maximum Independent Set Problem Using Graph Neural Networks
  Langedal, Kenneth ; Hespe, Demian ; Sanders, Peter 2024 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Parameterized Complexity of Binary CSP: Vertex Cover, Treedepth, and Related Parameters
  Bodlaender, Hans L. ; Groenland, Carla ; Pilipczuk, Michał 2023 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Targeted Branching for the Maximum Independent Set Problem
  Hespe, Demian ; Lamm, Sebastian ; Schorr, Christian 2021 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Metric Dimension and Geodetic Set Parameterized by Vertex Cover
  Foucaud, Florent ; Galby, Esther ; Khazaliya, Liana ; Li, Shaohua ; Mc Inerney, Fionn ; Sharma, Roohani ; Tale, Prafullkumar 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• A novel rough set-based approach for minimum vertex cover of hypergraphs
  Zhou, Qian ; Xie, Xiaojun ; Dai, Hua ; Meng, Weizhi
• A hybrid algorithm based on modified chemical reaction optimization and best-first search algorithm for solving minimum vertex cover problem
  Khattab, Hebatullah ; Mahafzah, Basel A. ; Sharieh, Ahmad
• Vertex covering problems of fuzzy graphs and their application in CCTV installation
  Bhattacharya, Anushree ; Pal, Madhumangal
• The Complexity of Pre-assignment Problem for Unique Minimum Vertex Cover on Bipartite Graphs
  Horiyama, Takashi ; Seto, Kazuhisa ; Suzuki, Ryu
• Enumeration Kernels for Vertex Cover and Feedback Vertex Set
  Bougeret, Marin ; C. M. Gomes, Guilherme ; Santos, Vinicius ˜dosœ ; Sau, Ignasi 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik