„algorithm complexity“

Suchergebnisse

4.228 Treffer

• On the Parameterized Complexity of Bend-Minimum Orthogonal Planarity
  Di Giacomo, Emilio ; Didimo, Walter ; Liotta, Giuseppe ; Montecchiani, Fabrizio ; Ortali, Giacomo
• Special Issue Dedicated to the 16th International Symposium on Parameterized and Exact Computation
  Golovach, Petr A. ; Zehavi, Meirav
• List 3-Coloring Graphs with No Induced $$P_6+rP_3$$ P 6 + r P 3
  Chudnovsky, Maria ; Huang, Shenwei ; Spirkl, Sophie Theresa ; Zhong, Mingxian
• Lipschitz Continuity and Approximate Equilibria
  Deligkas, Argyrios ; Fearnley, John ; Spirakis, Paul G.
• Stable Matching with Uncertain Linear Preferences
  Aziz, Haris ; Biró, Péter ; Gaspers, Serge ; Haan, Ronald de ; Mattei, Nicholas ; Rastegari, Baharak
• Shortest path problem using Bellman algorithm under neutrosophic environment
  Broumi, Said ; Dey, Arindam ; Talea, Mohamed ; Bakali, Assia ; Smarandache, Florentin ; Nagarajan, Deivanayagampillai ; Lathamaheswari, Malayalan ; Kumar, Ranjan
• Algorithms for Outerplanar Graph Roots and Graph Roots of Pathwidth at Most 2
  Golovach, Petr A. ; Heggernes, Pinar ; Kratsch, Dieter ; Lima, Paloma T. ; Paulusma, Daniël
• Region-Based Approximation of Probability Distributions (for Visibility Between Imprecise Points Among Obstacles)
  Buchin, Kevin ; Kostitsyna, Irina ; Löffler, Maarten ; Silveira, Rodrigo I.
• Structural Parameterizations of Undirected Feedback Vertex Set: FPT Algorithms and Kernelization
  Majumdar, Diptapriyo ; Raman, Venkatesh
• Towards Flexible Demands in Online Leasing Problems
  Li, Shouwei ; Markarian, Christine ; Meyer auf der Heide, Friedhelm
• Geometric Path Problems with Violations
  Maheshwari, Anil ; Nandy, Subhas C. ; Pattanayak, Drimit ; Roy, Sasanka ; Smid, Michiel
• Optimal placement and sizing of capacitor using Limaçon inspired spider monkey optimization algorithm
  Sharma, Ajay ; Sharma, Harish ; Bhargava, Annapurna ; Sharma, Nirmala ; Bansal, Jagdish Chand
• Information-theoretic approximations of the nonnegative rank
  Braun, Gábor ; Jain, Rahul ; Lee, Troy ; Pokutta, Sebastian
• Strong Articulation Points and Strong Bridges in Large Scale Graphs
  Firmani, Donatella ; Georgiadis, Loukas ; Italiano, Giuseppe F. ; Laura, Luigi ; Santaroni, Federico
• Finding Small Satisfying Assignments Faster Than Brute Force: A Fine-Grained Perspective into Boolean Constraint Satisfaction
  Künnemann, Marvin ; Marx, Dániel 2020 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• ETH-Tight Algorithms for Long Path and Cycle on Unit Disk Graphs
  Fomin, Fedor V. ; Lokshtanov, Daniel ; Panolan, Fahad ; Saurabh, Saket ; Zehavi, Meirav 2020 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Measuring what Matters: A Hybrid Approach to Dynamic Programming with Treewidth
  Eiben, Eduard ; Ganian, Robert ; Hamm, Thekla ; Kwon, O-joung 2019 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Distributed MST and Broadcast with Fewer Messages, and Faster Gossiping
  Ghaffari, Mohsen ; Kuhn, Fabian 2018 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Algorithms for Extended Alpha-Equivalence and Complexity
  Schmidt-Schauß, Manfred ; Rau, Conrad ; Sabel, David 2013 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Social Distancing Network Creation
  Friedrich, Tobias ; Gawendowicz, Hans ; Lenzner, Pascal ; Melnichenko, Anna