„parameterized algorithm“

Suchergebnisse

565 Treffer

• The Parameterized Complexity of Oriented Colouring
  Ganian, Robert 2009 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Temporal Graphs: Structure, Algorithms, Applications (Dagstuhl Seminar 21171)
  Casteigts, Arnaud ; Meeks, Kitty ; Mertzios, George B. ; Niedermeier, Rolf
• Algorithms and Complexity in Phylogenetics (Dagstuhl Seminar 19443)
  Bordewich, Magnus ; Dorn, Britta ; Linz, Simone ; Niedermeier, Rolf
• Graph Colouring: from Structure to Algorithms (Dagstuhl Seminar 19271)
  Chudnovsky, Maria ; Paulusma, Daniel ; Schaudt, Oliver
• Algorithmic Enumeration: Output-sensitive, Input-Sensitive, Parameterized, Approximative (Dagstuhl Seminar 18421)
  Fernau, Henning ; Golovach, Petr. A. ; Sagot, Marie-France
• Synergies between Adaptive Analysis of Algorithms, Parameterized Complexity, Compressed Data Structures and Compressed Indices (Dagstuhl Seminar 18281)
  Barbay, Jérémy ; Fischer, Johannes ; Kratsch, Stefan ; Satti, Srinivasa Rao
• Optimality and tight results in parameterized complexity (Dagstuhl Seminar 14451)
  Kratsch, Stefan ; Lokshtanov, Daniel ; Marx, Dániel ; Rossmanith, Peter
• Data Reduction and Problem Kernels (Dagstuhl Seminar 12241)
  Fellows, Michael R. ; Guo, Jiong ; Marx, Dániel ; Saurabh, Saket
• Exploiting graph structure to cope with hard problems (Dagstuhl Seminar 11182)
  Brandstädt, Andreas ; Golumbic, Martin Charles ; Heggernes, Pinar ; McConnell, Ross
• Packing and Scheduling Algorithms for Information and Communication Services (Dagstuhl Seminar 11091)
  Jansen, Klaus ; Matieu, Claire ; Shachnai, Hadas ; Young, Neal E.
• Parametrisierte Ansätze für schwere Graphprobleme: Algorithmen und Experimente Algorithms and Experiments for Parameterized Approaches to Hard Graph Problems
  Hüffner, Falk
• Tight Bounds for Chordal/Interval Vertex Deletion Parameterized by Treewidth
  Włodarczyk, Michał
• Parameterized algorithms and complexity for the traveling purchaser problem and its variants
  Xiao, Mingyu ; Zhang, Jianan ; Lin, Weibo
• Space-Efficient Parameterized Algorithms on Graphs of Low Shrubdepth
  Bergougnoux, Benjamin ; Chekan, Vera ; Kanté, Mamadou Moustapha ; Mnich, Matthias ; Oum, Sang-il ; Pilipczuk, Michał ; Leeuwen, Erik Jan van 2025 Technische Universität Hamburg. Universitätsbibliothek
• Disentangling the Computational Complexity of Network Untangling
  Froese, Vincent ; Kunz, Pascal ; Zschoche, Philipp 2024 Humboldt-Universität zu Berlin
• Ensemble algorithm for parameterized convection problems with energy stable open boundary conditions
  Jiang, Nan ; Takhirov, Aziz ; Waters, Jiajia
• Exploiting structure in computationally hard voting problems
  Chen, Jiehua 2016 Universitätsverlag der TU Berlin
• Nowhere dense classes of graphs – characterisations and algorithmic meta-theorems
  Siebertz, Sebastian 2016 Universitätsverlag der TU Berlin
• Be sparse! Be dense! Be robust! – elements of parameterized algorithmics
  Sorge, Manuel 2017 Universitätsverlag der TU Berlin
• Algorithmic aspects of manipulation and anonymization in social choice and social networks
  Talmon, Nimrod 2016 Universitätsverlag der TU Berlin