• case-insensitive prefix search: default
  e.g., sig matches "SIGIR" as well as "signal"
• exact word search: append dollar sign ($) to word
  e.g., graph$ matches "graph", but not "graphics"
• boolean and: separate words by space
  e.g., codd model
• boolean or: connect words by pipe symbol (|)
  e.g., graph|network

Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.

found 902 matches

• 2024
• 
  Antonios Antoniadis, Matthias Englert, Nicolaos Matsakis, Pavel Veselý:
  Breaking the Barrier of 2 for the Competitiveness of Longest Queue Drop. ACM Trans. Algorithms 20(4): 38:1-38:29 (2024)
• 
  Sayan Bandyapadhyay, William Lochet, Daniel Lokshtanov, Saket Saurabh, Jie Xue:
  True Contraction Decomposition and Almost ETH-Tight Bipartization for Unit-Disk Graphs. ACM Trans. Algorithms 20(3): 20 (2024)
• 
  Lorenzo Beretta, Jakub Tetek:
  Better Sum Estimation via Weighted Sampling. ACM Trans. Algorithms 20(3): 27 (2024)
• 
  Ivona Bezáková, Andreas Galanis, Leslie Ann Goldberg, Daniel Stefankovic:
  Fast Sampling via Spectral Independence Beyond Bounded-degree Graphs. ACM Trans. Algorithms 20(1): 7:1-7:26 (2024)
• 
  Antonio Blanca, Sarah Cannon, Will Perkins:
  Fast and Perfect Sampling of Subgraphs and Polymer Systems. ACM Trans. Algorithms 20(1): 5:1-5:30 (2024)
• 
  Thomas Bläsius, Philipp Fischbeck:
  On the External Validity of Average-case Analyses of Graph Algorithms. ACM Trans. Algorithms 20(1): 10:1-10:42 (2024)
• 
  Niclas Boehmer, Tomohiro Koana:
  The Complexity of Finding Fair Many-to-One Matchings. ACM Trans. Algorithms 20(2): 17 (2024)
• 
  Manuel Cáceres, Massimo Cairo, Andreas Grigorjew, Shahbaz Khan, Brendan Mumey, Romeo Rizzi, Alexandru I. Tomescu, Lucia Williams:
  Width Helps and Hinders Splitting Flows. ACM Trans. Algorithms 20(2): 13 (2024)
• 
  Massimo Cairo, Romeo Rizzi, Alexandru I. Tomescu, Elia C. Zirondelli:
  Genome Assembly, from Practice to Theory: Safe, Complete and Linear-Time. ACM Trans. Algorithms 20(1): 4:1-4:26 (2024)
• 
  Parinya Chalermsook, Matthias Kaul, Matthias Mnich, Joachim Spoerhase, Sumedha Uniyal, Daniel Vaz:
  Approximating Sparsest Cut in Low-treewidth Graphs via Combinatorial Diameter. ACM Trans. Algorithms 20(1): 6:1-6:20 (2024)
• 
  Timothy M. Chan, Da Wei Zheng:
  Hopcroft's Problem, Log* Shaving, Two-dimensional Fractional Cascading, and Decision Trees. ACM Trans. Algorithms 20(3): 24 (2024)
• 
  Jacobus Conradi, Anne Driemel:
  On Computing the k-Shortcut Fréchet Distance. ACM Trans. Algorithms 20(4): 29:1-29:37 (2024)
• 
  Artur Czumaj, Shaofeng H.-C. Jiang, Robert Krauthgamer, Pavel Veselý:
  Streaming Algorithms for Geometric Steiner Forest. ACM Trans. Algorithms 20(4): 28:1-28:38 (2024)
• 
  Daniel Dadush, Martin Milanic, Tami Tamir:
  Introduction: ACM-SIAM Symposium on Discrete Algorithms (SODA) 2022 Special Issue. ACM Trans. Algorithms 20(3): 21 (2024)
• 
  Arnold Filtser:
  Scattering and Sparse Partitions, and Their Applications. ACM Trans. Algorithms 20(4): 30:1-30:42 (2024)
• 
  Jacob Focke, Dániel Marx, Pawel Rzazewski:
  Counting List Homomorphisms from Graphs of Bounded Treewidth: Tight Complexity Bounds. ACM Trans. Algorithms 20(2): 11 (2024)
• 
  Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Daniel Lokshtanov, Giannos Stamoulis:
  Shortest Cycles with Monotone Submodular Costs. ACM Trans. Algorithms 20(1): 2:1-2:16 (2024)
• 
  Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Kirill Simonov, Giannos Stamoulis:
  Fixed-Parameter Tractability of Maximum Colored Path and Beyond. ACM Trans. Algorithms 20(4): 36:1-36:48 (2024)
• 
  Dvir Fried, Shay Golan, Tomasz Kociumaka, Tsvi Kopelowitz, Ely Porat, Tatiana Starikovskaya:
  An Improved Algorithm for The k-Dyck Edit Distance Problem. ACM Trans. Algorithms 20(3): 26 (2024)
• 
  Robert Ganian, Thekla Hamm, Viktoriia Korchemna, Karolina Okrasa, Kirill Simonov:
  The Fine-Grained Complexity of Graph Homomorphism Parameterized by Clique-Width. ACM Trans. Algorithms 20(3): 19 (2024)
• 
  Lars Gottesbüren, Tobias Heuer, Nikolai Maas, Peter Sanders, Sebastian Schlag:
  Scalable High-Quality Hypergraph Partitioning. ACM Trans. Algorithms 20(1): 9:1-9:54 (2024)
• 
  Joachim Gudmundsson, Martin P. Seybold, Sampson Wong:
  Map Matching Queries on Realistic Input Graphs Under the Fréchet Distance. ACM Trans. Algorithms 20(2): 14 (2024)
• 
  Ce Jin, Jakob Nogler:
  Quantum Speed-Ups for String Synchronizing Sets, Longest Common Substring, and k-mismatch Matching. ACM Trans. Algorithms 20(4): 32:1-32:36 (2024)
• 
  Vincent Jugé:
  Adaptive Shivers Sort: An Alternative Sorting Algorithm. ACM Trans. Algorithms 20(4): 31:1-31:55 (2024)
• 
  Telikepalli Kavitha:
  Popular Matchings with One-Sided Bias. ACM Trans. Algorithms 20(1): 8:1-8:22 (2024)
• 
  Eun Jung Kim, Stefan Kratsch, Marcin Pilipczuk, Magnus Wahlström:
  Flow-augmentation II: Undirected Graphs. ACM Trans. Algorithms 20(2): 12 (2024)
• 
  Kim-Manuel Klein, Janina Reuter:
  Collapsing the Tower - On the Complexity of Multistage Stochastic IPs. ACM Trans. Algorithms 20(3): 22 (2024)
• 
  Hung Le, Cuong Than:
  Greedy Spanners in Euclidean Spaces Admit Sublinear Separators. ACM Trans. Algorithms 20(3): 23 (2024)
• 
  Shaohua Li, Marcin Pilipczuk, Manuel Sorge:
  Cluster Editing Parameterized above Modification-disjoint P₃-packings. ACM Trans. Algorithms 20(1): 3:1-3:43 (2024)
• 
  Dimitrios Los, Thomas Sauerwald:
  An Improved Drift Theorem for Balanced Allocations. ACM Trans. Algorithms 20(4): 35:1-35:39 (2024)

skipping 872 more matches