„algorithm complexity“

Suchergebnisse

4.228 Treffer

• Worst Case Complexity Bounds for Linesearch-Type Derivative-Free Algorithms
  Brilli, Andrea ; Kimiaei, Morteza ; Liuzzi, Giampaolo ; Lucidi, Stefano
• Universal Slope Sets for Upward Planar Drawings
  Bekos, Michael A. ; Di Giacomo, Emilio ; Didimo, Walter ; Liotta, Giuseppe ; Montecchiani, Fabrizio
• Multi-objective rain optimization algorithm with WELM model for customer churn prediction in telecommunication sector
  Pustokhina, Irina V. ; Pustokhin, Denis A. ; Nguyen, Phong Thanh ; Elhoseny, Mohamed ; Shankar, K.
• Subgraph Isomorphism on Graph Classes that Exclude a Substructure
  Bodlaender, Hans L. ; Hanaka, Tesshu ; Kobayashi, Yasuaki ; Kobayashi, Yusuke ; Okamoto, Yoshio ; Otachi, Yota ; Zanden, Tom C. van der
• A Fixed-Parameter Perspective on #BIS
  Curticapean, Radu ; Dell, Holger ; Fomin, Fedor ; Goldberg, Leslie Ann ; Lapinskas, John
• Fast Minor Testing in Planar Graphs
  Adler, Isolde ; Dorn, Frederic ; Fomin, Fedor V. ; Sau, Ignasi ; Thilikos, Dimitrios M.
• Data Structures for Halfplane Proximity Queries and Incremental Voronoi Diagrams
  Aronov, Boris ; Bose, Prosenjit ; Demaine, Erik D. ; Gudmundsson, Joachim ; Iacono, John ; Langerman, Stefan ; Smid, Michiel
• Solving Problems on Graphs of High Rank-Width
  Eiben, Eduard ; Ganian, Robert ; Szeider, Stefan
• Output-Polynomial Enumeration on Graphs of Bounded (Local) Linear MIM-Width
  Golovach, Petr A. ; Heggernes, Pinar ; Kanté, Mamadou Moustapha ; Kratsch, Dieter ; Sæther, Sigve H. ; Villanger, Yngve
• Computing Approximate Nash Equilibria in Polymatrix Games
  Deligkas, Argyrios ; Fearnley, John ; Savani, Rahul ; Spirakis, Paul G.
• Computer algebra in scientific computing – 14th international workshop ; proceedings
  Gerdt, Vladimir P. ; Koepf, Wolfram ; Mayr, Ernst W. ; Vorožcov, Evgenij V. 2012 Springer
• On Adaptive Algorithms for Maximum Matching
  Hegerfeld, Falko ; Kratsch, Stefan 2019 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Faster Algorithms for All-Pairs Bounded Min-Cuts
  Abboud, Amir ; Georgiadis, Loukas ; Italiano, Giuseppe F. ; Krauthgamer, Robert ; Parotsidis, Nikos ; Trabelsi, Ohad ; Uznański, Przemysław ; Wolleb-Graf, Daniel 2019 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• On the Complexity Landscape of Connected f-Factor Problems
  Ganian, Robert ; Narayanaswamy, N. S. ; Ordyniak, Sebastian ; Rahul, C. S. ; Ramanujan, M. S. 2016 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• On the Complexity of Grammar-Based Compression over Fixed Alphabets
  Casel, Katrin ; Fernau, Henning ; Gaspers, Serge ; Gras, Benjamin ; Schmid, Markus L. 2016 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Subexponential Algorithms for Partial Cover Problems
  Fomin, Fedor V. ; Lokshtanov, Daniel ; Raman, Venkatesh ; Saurabh, Saket 2009 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Sub-exponential Time Parameterized Algorithms for Graph Layout Problems on Digraphs with Bounded Independence Number
  Misra, Pranabendu ; Saurabh, Saket ; Sharma, Roohani ; Zehavi, Meirav
• Packing Arc-Disjoint Cycles in Tournaments
  Bessy, Stéphane ; Bougeret, Marin ; Krithika, R. ; Sahu, Abhishek ; Saurabh, Saket ; Thiebaut, Jocelyn ; Zehavi, Meirav
• Subgraph Complementation
  Fomin, Fedor V. ; Golovach, Petr A. ; Strømme, Torstein J. F. ; Thilikos, Dimitrios M.
• Special Issue of APWeb-WAIM 2019
  Zhang, Dongxiang ; Wang, Wei ; Cui, Bin ; Shen, Heng Tao