„algorithm complexity“

Suchergebnisse

4.228 Treffer

• On Enumerating Minimal Dicuts and Strongly Connected Subgraphs
  Khachiyan, Leonid ; Boros, Endre ; Elbassioni, Khaled ; Gurvich, Vladimir
• On Structural Parameterizations of the Bounded-Degree Vertex Deletion Problem
  Ganian, Robert ; Klute, Fabian ; Ordyniak, Sebastian
• Subexponential-Time Algorithms for Finding Large Induced Sparse Subgraphs
  Novotná, Jana ; Okrasa, Karolina ; Pilipczuk, Michał ; Rzążewski, Paweł ; Leeuwen, Erik Jan van ; Walczak, Bartosz
• Flip Distances Between Graph Orientations
  Aichholzer, Oswin ; Cardinal, Jean ; Huynh, Tony ; Knauer, Kolja ; Mütze, Torsten ; Steiner, Raphael ; Vogtenhuber, Birgit
• Quasi-Polynomial Time Approximation Schemes for Packing and Covering Problems in Planar Graphs
  Pilipczuk, Michał ; Leeuwen, Erik Jan van ; Wiese, Andreas
• Energy-Optimal Routes for Battery Electric Vehicles
  Baum, Moritz ; Dibbelt, Julian ; Pajor, Thomas ; Sauer, Jonas ; Wagner, Dorothea ; Zündorf, Tobias
• Tile-Packing Tomography Is $\mathbb{NP}$ -hard
  Chrobak, Marek ; Dürr, Christoph ; Guíñez, Flavio ; Lozano, Antoni ; Nguyen Kim Thang
• Model-based evolutionary algorithms: a short survey
  Cheng, Ran ; He, Cheng ; Jin, Yaochu ; Yao, Xin
• Improved Approximation Algorithms for Box Contact Representations
  Bekos, Michael A. ; Dijk, Thomas C. van ; Fink, Martin ; Kindermann, Philipp ; Kobourov, Stephen ; Pupyrev, Sergey ; Spoerhase, Joachim ; Wolff, Alexander
• Self-Stabilizing Balls and Bins in Batches – The Power of Leaky Bins
  Berenbrink, Petra ; Friedetzky, Thomas ; Kling, Peter ; Mallmann-Trenn, Frederik ; Nagel, Lars ; Wastell, Chris
• A Polynomial Kernel for Trivially Perfect Editing
  Drange, Pål Grønås ; Pilipczuk, Michał
• Ortho-polygon Visibility Representations of Embedded Graphs
  Di Giacomo, Emilio ; Didimo, Walter ; Evans, William S. ; Liotta, Giuseppe ; Meijer, Henk ; Montecchiani, Fabrizio ; Wismath, Stephen K.
• Edge Bipartization Faster than $$2^k$$ 2 k
  Pilipczuk, Marcin ; Pilipczuk, Michał ; Wrochna, Marcin
• A hybrid clonal selection algorithm for the location routing problem with stochastic demands
  Marinakis, Yannis ; Marinaki, Magdalene ; Migdalas, Athanasios
• Heuristic Search – The Emerging Science of Problem Solving
  Salhi, Saïd 2017 Springer International Publishing
• Heuristic Search – The Emerging Science of Problem Solving
  Salhi, Saïd 2017 Springer International Publishing
• QCSP on Reflexive Tournaments
  Larose, Benoît ; Marković, Petar ; Martin, Barnaby ; Paulusma, Daniel ; Smith, Siani ; Živný, Stanislav 2021 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Algorithmic Properties of Sparse Digraphs
  Kreutzer, Stephan ; Muzi, Irene ; Ossona de Mendez, Patrice ; Rabinovich, Roman ; Siebertz, Sebastian 2019 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• New Frontiers of Parameterized Complexity in Graph Drawing (Dagstuhl Seminar 23162)
  Ganian, Robert ; Montecchiani, Fabrizio ; Nöllenburg, Martin ; Zehavi, Meirav ; Khazaliya, Liana
• Optimization at the Second Level (Dagstuhl Seminar 22441)
  Brotcorne, Luce ; Buchheim, Christoph ; den Hertog, Dick ; Henke, Dorothee