„Algorithms & Data Structures“

Suchergebnisse

3.154 Treffer

• Lempel–Ziv Factorization Powered by Space Efficient Suffix Trees
  Fischer, Johannes ; I, Tomohiro ; Köppl, Dominik ; Sadakane, Kunihiko
• Minimizing Latency of Capacitated k-Tours
  Martin, Christopher S. ; Salavatipour, Mohammad R.
• Independent Set of Convex Polygons: From $$n^{\epsilon }$$ n ϵ to $$1+\epsilon $$ 1 + ϵ via Shrinking
  Wiese, Andreas
• Linear Kernels for Outbranching Problems in Sparse Digraphs
  Bonamy, Marthe ; Kowalik, ŁUkasz ; Pilipczuk, Michał ; Socała, Arkadiusz
• Simultaneous Feedback Edge Set: A Parameterized Perspective
  Agrawal, Akanksha ; Panolan, Fahad ; Saurabh, Saket ; Zehavi, Meirav
• Algorithms, data structures, and numerics for likelihood-based phylogenetic inference of huge trees
  Izquierdo-Carrasco, Fernando ; Smith, Stephen A. ; Stamatakis, Alexandros
• Data structures and compression algorithms for high-throughput sequencing technologies
  Daily, Kenny ; Rigor, Paul ; Christley, Scott ; Xie, Xiaohui ; Baldi, Pierre
• A General Model for Authenticated Data Structures
  Martel, Charles ; Nuckolls, Glen ; Devanbu, Premkumar ; Gertz, Michael ; Kwong, April ; Stubblebine, Stuart G.
• Parameterized Aspects of Strong Subgraph Closure
  Golovach, Petr A. ; Heggernes, Pinar ; Konstantinidis, Athanasios L. ; Lima, Paloma T. ; Papadopoulos, Charis
• Approximating Vector Scheduling: Almost Matching Upper and Lower Bounds
  Bansal, Nikhil ; Oosterwijk, Tim ; Vredeveld, Tjark ; Zwaan, Ruben van der
• Cuckoo-Inspired Algorithms for Selecting Features in the Prediction of Diabetes Using Machine Learning Models
  Shafi, Salliah ; Ahmad, Sultan ; Ansari, Gufran Ahmad ; Abdeljaber, Hikmat A. M. ; Alanazi, Sultan ; Nazeer, Jabeen
• Algorithms and Kernels for Feedback Set Problems in Generalizations of Tournaments
  Bang-Jensen, Jørgen ; Maddaloni, Alessandro ; Saurabh, Saket
• Nearly Linear Time Minimum Spanning Tree Maintenance for Transient Node Failures
  Nardelli, Enrico ; Proietti, Guido ; Widmayer, Peter
• Optimization with Demand Oracles
  Badanidiyuru, Ashwinkumar ; Dobzinski, Shahar ; Oren, Sigal
• Subexponential-Time Algorithms for Maximum Independent Set in $$P_t$$ Pt -Free and Broom-Free Graphs
  Bacsó, Gábor ; Lokshtanov, Daniel ; Marx, Dániel ; Pilipczuk, Marcin ; Tuza, Zsolt ; van Leeuwen, Erik Jan
• Extending Convex Partial Drawings of Graphs
  Mchedlidze, Tamara ; Nöllenburg, Martin ; Rutter, Ignaz
• Parameterized Complexity of Directed Spanner Problems
  Fomin, Fedor V. ; Golovach, Petr A. ; Lochet, William ; Misra, Pranabendu ; Saurabh, Saket ; Sharma, Roohani
• The Price of Optimum: Complexity and Approximation for a Matching Game
  Escoffier, Bruno ; Gourvès, Laurent ; Monnot, Jérôme
• Multi-sided Boundary Labeling
  Kindermann, Philipp ; Niedermann, Benjamin ; Rutter, Ignaz ; Schaefer, Marcus ; Schulz, André ; Wolff, Alexander
• Binary Pattern Tile Set Synthesis Is NP-Hard
  Kari, Lila ; Kopecki, Steffen ; Meunier, Pierre-Étienne ; Patitz, Matthew J. ; Seki, Shinnosuke