„completion problems“

Suchergebnisse

1.000+ Treffer

• Some two-agent single-machine scheduling problems to minimize minmax and minsum of completion times
  Cao, Xiaoling ; Wu, Wen-Hsing ; Wu, Wen-Hung ; Wu, Chin-Chia
• Binary Matrix Completion Under Diameter Constraints
  Koana, Tomohiro ; Froese, Vincent ; Niedermeier, Rolf 2021 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Parameterized Algorithms for Matrix Completion with Radius Constraints
  Koana, Tomohiro ; Froese, Vincent ; Niedermeier, Rolf 2020 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• A Parameterized Algorithmics Framework for Degree Sequence Completion Problems in Directed Graphs
  Bredereck, Robert ; Froese, Vincent ; Koseler, Marcel ; Millani, Marcelo Garlet ; Nichterlein, André ; Niedermeier, Rolf 2017 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Uncertainty principles for inverse source and inverse scattering problems
  Schätzle, Lisa ; Griesmaier, Roland ; Rieder, Andreas 2025 KIT-Bibliothek
• Generalized completion problems with forbidden tournaments
  Bitter, Zeno ; Wiehe, Antoine 2024 Technische Universität Hamburg. Universitätsbibliothek
• Generalized Wong sequences and their applications to Edmonds' problems
  Ivanyos, Gábor ; Karpiński, Marek ; Qiao, Youming ; Santha, Miklos 2014 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Reallocation Problems with Minimum Completion Time
  Ishii, Toshimasa ; Kawahara, Jun ; Makino, Kazuhisa ; Ono, Hirotaka
• Decoupled matrix Riccati differential equations approach for robust boundary data completion in time-fractional diffusion problems
  Jday, Fadhel ; Mdimagh, Ridha ; Omri, Haithem
• Fast algorithms for non-convex tensor completion problems
  Kanwal, Asia ; Rahman, Mati ur ; Boulaaras, Salah
• Polynomial Kernel and Incompressibility for Prison-Free Edge Deletion and Completion
  Houari-Durand, Séhane Bel ; Eiben, Eduard ; Wahlström, Magnus 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• From Data Completion to Problems on Hypercubes: A Parameterized Analysis of the Independent Set Problem
  Eiben, Eduard ; Ganian, Robert ; Kanj, Iyad ; Ordyniak, Sebastian ; Szeider, Stefan 2023 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Matrix Completion and Related Problems via Strong Duality
  Balcan, Maria-Florina ; Liang, Yingyu ; Woodruff, David P. ; Zhang, Hongyang 2018 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• FPT Algorithms for Plane Completion Problems
  Chatzidimitriou, Dimitris ; Giannopoulou, Archontia C. ; Maniatis, Spyridon ; Requilé, Clément ; Thilikos, Dimitrios M. ; Zoros, Dimitris 2016 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Variants of Plane Diameter Completion
  Golovach, Petr A. ; Requilé, Clément ; Thilikos, Dimitrios M. 2015 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Exploring Subexponential Parameterized Complexity of Completion Problems
  Drange, Pal Gronas ; Fomin, Fedor V. ; Pilipczuk, Michal ; Villanger, Yngve 2014 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Chordal Editing is Fixed-Parameter Tractable
  Cao, Yixin ; Marx, Dániel 2014 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Generalized Wong sequences and their applications to Edmonds' problems
  Ivanyos, Gábor 2014 Institut für Informatik, Universität Bonn
• Matrix completion problems of block type
  Ikramov, Kh. D. ; Chugunov, V. N.
• Semi-on-line scheduling problems for maximizing the minimum machine completion time
  Yong, He