„parameterized Complexity“

Suchergebnisse

665 Treffer

• Parameterized and exact computation – 7th international symposium ; proceedings
  Thilikos, Dimitrios M. ; Woeginger, Gerhard J. 2012 Springer
• How the world computes – Turing centenary conference and 8th Conference on Computability in Europe, CiE 2012, Cambridge, UK, June 18 - 23, 2012 ; proceedings
  Cooper, Stuart B. ; Dawar, Anuj ; Löwe, Benedikt 2012 Springer
• Integration of AI and OR techniques in constraint programming for combinatorial optimization problems – 9th international conference ; proceedings
  Beldiceanu, Nicolas ; Jussien, Narendra ; Pinson, Eric 2012 Springer
• Graph-theoretic concepts in computer science – 37th international workshop ; revised papers
  Kolman, Petr ; Kratochvíl, Jan 2011 Springer
• A Parameterized Study of Maximum Generalized Pattern Matching Problems
  Ordyniak, Sebastian ; Popa, Alexandru
• Solving Linear Equations Parameterized by Hamming Weight
  Arvind, V. ; Köbler, Johannes ; Kuhnert, Sebastian ; Torán, Jacobo
• Graph Isomorphism Parameterized by Elimination Distance to Bounded Degree
  Bulian, Jannis ; Dawar, Anuj
• The Parameterized Complexity of Geometric Graph Isomorphism
  Arvind, V. ; Rattan, Gaurav
• Parameterized Complexity
  Downey, R. G. ; Fellows, Michael R. 1999 Springer New York
• On the Parameterized Complexity of Reconfiguration Problems
  Mouawad, Amer E. ; Nishimura, Naomi ; Raman, Venkatesh ; Simjour, Narges ; Suzuki, Akira
• Algorithmic graph minor theory – approximation, parameterized complexity, and practical aspects
  Tazari, Siamak
• Theory and practice of algorithms in (computer) systems – first international ICST conference ; proceedings
  Marchetti-Spaccamela, Alberto ; Segal, Michael 2011 Springer
• Combinatorial algorithms – 21st international workshop ; revised selected papers
  Iliopoulos, Costas S. ; Smyth, William F. 2011 Springer
• 10th International Symposium on Parameterized and Exact Computation (IPEC 2015)
  Husfeldt, Thore ; Kanj, Iyad 2015 Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH
• Algorithms - ESA 2014 – 22th Annual European Symposium, Wroclaw, Poland, September 8-10, 2014. Proceedings
  2014 Springer Berlin Heidelberg
• Algorithms – 22nd Annual European symposium ; proceedings
  Schulz, Andreas S. ; Wagner, Dorothea 2014 Springer
• Parameterized Complexity Analysis of Computer Algorithms
  Pal, Mita ; Chakraborty, Soubhik ; Mahanti, N.C. 2017 LAP LAMBERT Academic Publishing
• Algorithms Parameterized by Vertex Cover and Modular Width, Through Potential Maximal Cliques
  Fomin, Fedor V. ; Liedloff, Mathieu ; Montealegre, Pedro ; Todinca, Ioan
• 11th International Symposium on Parameterized and Exact Computation (IPEC 2016)
  Guo, Jiong ; Hermelin, Danny 2017 Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH
• Constrained parameterized optimal control of switched systems based on continuous Hopfield neural networks
  Kahloul, Ahmed Anis ; Sakly, Anis