„parameterized Complexity“

Suchergebnisse

665 Treffer

• On the computational complexity of Ham-Sandwich cuts, Helly sets, and related problems
  Knauer, Christian ; Tiwary, Hans Raj ; Werner, Daniel 2011 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Vertex Cover Kernelization Revisited: Upper and Lower Bounds for a Refined Parameter
  Jansen, Bart M. P. ; Bodlaender, Hans L. 2011 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Cross-Composition: A New Technique for Kernelization Lower Bounds
  Bodlaender, Hans L. ; Jansen, Bart M. P. ; Kratsch, Stefan 2011 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Determining the Winner of a Dodgson Election is Hard
  Fellows, Michael ; Jansen, Bart M. P. ; Lokshtanov, Daniel ; Rosamond, Frances A. ; Saurabh, Saket 2010 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Better Algorithms for Satisfiability Problems for Formulas of Bounded Rank-width
  Ganian, Robert ; Hlinený, Petr ; Obdrzálek, Jan 2010 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Polynomial Kernelizations for MIN F^+Pi_1 and MAX NP
  Kratsch, Stefan 2009 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Vertex Partitioning in Graphs: From Structure to Algorithms (Dagstuhl Seminar 22481)
  Chudnovsky, Maria ; Misra, Neeldhara ; Paulusma, Daniel ; Schaudt, Oliver ; Agrawal, Akanksha
• 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
• 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
• Randomization in Parameterized Complexity (Dagstuhl Seminar 17041)
  Cygan, Marek ; Fomin, Fedor V. ; Hermelin, Danny ; Wahlström, Magnus
• Theory and Practice of SAT Solving (Dagstuhl Seminar 15171)
  Biere, Armin ; Ganesh, Vijay ; Grohe, Martin ; Nordström, Jakob ; Williams, Ryan
• Optimality and tight results in parameterized complexity (Dagstuhl Seminar 14451)
  Kratsch, Stefan ; Lokshtanov, Daniel ; Marx, Dániel ; Rossmanith, Peter
• 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
• 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