„algorithm complexity“

Suchergebnisse

4.228 Treffer

• Confluent Layered Drawings
  Eppstein, David ; Goodrich, Michael T. ; Meng, Jeremy Yu
• A hybrid SA-MFO algorithm for function optimization and engineering design problems
  Sayed, Gehad Ismail ; Hassanien, Aboul Ella
• Triangle Counting in Dynamic Graph Streams
  Bulteau, Laurent ; Froese, Vincent ; Kutzkov, Konstantin ; Pagh, Rasmus
• Parameterized Complexity of Superstring Problems
  Bliznets, Ivan ; Fomin, Fedor V. ; Golovach, Petr A. ; Karpov, Nikolay ; Kulikov, Alexander S. ; Saurabh, Saket
• Theoretical computer science – 8th IFIP TC 1 WG 2.2 international conference ; proceedings
  Díaz, Josep ; Lanese, Ivan ; Sangiorgi, Davide 2014 Springer
• Graph Colouring is Hard for Algorithms Based on Hilbert's Nullstellensatz and Gröbner Bases
  Lauria, Massimo ; Nordström, Jakob 2017 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Building Clusters with Lower-Bounded Sizes
  Abu-Khzam, Faisal ; Bazgan, Cristina ; Casel, Katrin ; Fernau, Henning 2016 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Designing and Implementing Algorithms for Mixed-Integer Nonlinear Optimization (Dagstuhl Seminar 18081)
  Bonami, Pierre ; Gleixner, Ambros M. ; Linderoth, Jeff ; Misener, Ruth
• Linear-Time Recognition of Double-Threshold Graphs
  Kobayashi, Yusuke ; Okamoto, Yoshio ; Otachi, Yota ; Uno, Yushi
• Connected Subgraph Defense Games
  Akrida, Eleni C. ; Deligkas, Argyrios ; Melissourgos, Themistoklis ; Spirakis, Paul G.
• Towards a Polynomial Kernel for Directed Feedback Vertex Set
  Bergougnoux, Benjamin ; Eiben, Eduard ; Ganian, Robert ; Ordyniak, Sebastian ; Ramanujan, M. S.
• $$(k,n-k)$$ (k,n-k) -Max-Cut: An $$\mathcal{O}^*(2^p)$$ O∗(2p) -Time Algorithm and a Polynomial Kernel
  Saurabh, Saket ; Zehavi, Meirav
• An Algorithmic Framework for Labeling Network Maps
  Niedermann, Benjamin ; Haunert, Jan-Henrik
• Deleting Edges to Restrict the Size of an Epidemic: A New Application for Treewidth
  Enright, Jessica ; Meeks, Kitty
• Medical Big Data: Neurological Diseases Diagnosis Through Medical Data Analysis
  Siuly, Siuly ; Zhang, Yanchun
• The Complexity of Knapsack Problems in Wreath Products
  Figelius, Michael ; Ganardi, Moses ; Lohrey, Markus ; Zetzsche, Georg 2020 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Data Reduction for Maximum Matching on Real-World Graphs: Theory and Experiments
  Korenwein, Viatcheslav ; Nichterlein, André ; Niedermeier, Rolf ; Zschoche, Philipp 2018 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• On the Transformation Capability of Feasible Mechanisms for Programmable Matter
  Michail, Othon ; Skretas, George ; Spirakis, Paul G. 2017 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Parameterized Complexity in Graph Drawing (Dagstuhl Seminar 21293)
  Ganian, Robert ; Montecchiani, Fabrizio ; Nöllenburg, Martin ; Zehavi, Meirav
• Dynamic Traffic Models in Transportation Science (Dagstuhl Seminar 18102)
  Cominetti, Roberto ; Harks, Tobias ; Osorio, Carolina ; Peis, Britta