„Complex problems“

Suchergebnisse

2.217 Treffer

• On the Parameterised Complexity of String Morphism Problems
  Fernau, Henning ; Schmid, Markus L. ; Villanger, Yngve 2013 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• (Sub)linear Kernels for Edge Modification Problems Toward Structured Graph Classes
  Bathie, Gabriel ; Bousquet, Nicolas ; Cao, Yixin ; Ke, Yuping ; Pierron, Théo
• Two‐stage stochastic minimum s − t cut problems: Formulations, complexity and decomposition algorithms
  Rebennack, Steffen ; Prokopyev, Oleg ; Singh, Bismark 2020 Friedrich-Alexander-Universität Erlangen-Nürnberg (FAU)
• Relaxed Dijkstra and A* with linear complexity for robot path planning problems in large-scale grid environments
  Ammar, Adel ; Bennaceur, Hachemi ; Châari, Imen ; Koubâa, Anis ; Alajlan, Maram
• Polynomial-Time Approximation Schemes for Circle and Other Packing Problems
  Miyazawa, Flávio Keidi ; Pedrosa, Lehilton L. C. ; Schouery, Rafael C. S. ; Sviridenko, Maxim ; Wakabayashi, Yoshiko
• Shrinking Maxima, Decreasing Costs: New Online Packing and Covering Problems
  Fraigniaud, Pierre ; Halldórsson, Magnús M. ; Patt-Shamir, Boaz ; Rawitz, Dror ; Rosén, Adi
• Efficient Classification of Locally Checkable Problems in Regular Trees
  Balliu, Alkida ; Brandt, Sebastian ; Chang, Yi-Jun ; Olivetti, Dennis ; Studený, Jan ; Suomela, Jukka 2022 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Finding Optimal Solutions With Neighborly Help
  Burjons, Elisabet ; Frei, Fabian ; Hemaspaandra, Edith ; Komm, Dennis ; Wehner, David 2019 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Different complex word problems require different combinations of cognitive skills
  Strohmaier, Anselm R. ; Reinhold, Frank ; Hofer, Sarah ; Berkowitz, Michal ; Vogel-Heuser, Birgit ; Reiss, Kristina 2022 Pädagogische Hochschule Freiburg
• A New Algorithm for the $$^K$$ K DMDGP Subclass of Distance Geometry Problems with Exact Distances
  Gonçalves, Douglas S. ; Lavor, Carlile ; Liberti, Leo ; Souza, Michael
• Complexity classifications for different equivalence and audit problems for boolean circuits
  Boehler, Elmar ; Creignou, Nadia ; Galota, Matthias ; Reith, Steffen ; Schnoor, Henning ; Vollmer, Heribert 2012 Gottfried Wilhelm Leibniz Universität Hannover
• Complexity and algorithms for copy-number evolution problems
  El-Kebir, Mohammed ; Raphael, Benjamin J. ; Shamir, Ron ; Sharan, Roded ; Zaccaria, Simone ; Zehavi, Meirav ; Zeira, Ron
• The Complexity of Reverse Engineering Problems for Conjunctive Queries
  Barceló, Pablo ; Romero, Miguel 2017 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• The Complexity Landscape of Fixed-Parameter Directed Steiner Network Problems
  Feldmann, Andreas Emil ; Marx, Dániel 2016 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Parameterized Complexity of Secluded Connectivity Problems
  Fomin, Fedor V. ; Golovach, Petr A. ; Karpov, Nikolay ; Kulikov, Alexander S. 2015 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Quasi-Polynomial Time Approximation Schemes for Packing and Covering Problems in Planar Graphs
  Pilipczuk, Michał ; Leeuwen, Erik Jan van ; Wiese, Andreas
• Degrees and Gaps: Tight Complexity Results of General Factor Problems Parameterized by Treewidth and Cutwidth
  Marx, Dániel ; Sankar, Govind S. ; Schepper, Philipp 2021 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• The Complexity of Knapsack in Graph Groups
  Lohrey, Markus ; Zetzsche, Georg 2017 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Log-supermodular functions, functional clones and counting CSPs
  Bulatov, Andrei A. ; Dyer, Martin ; Goldberg, Leslie Ann ; Jerrum, Mark 2012 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Inferring Topology of Networks With Hidden Dynamic Variables
  Schmidt, Raoul ; Haehne, Hauke ; Hillmann, Laura ; Casadiego, Jose ; Witthaut, Dirk ; Schäfer, Benjamin ; Timme, Marc 2024 Technische Universität Dresden