• 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 55 matches

• 2019
• 
  Mikkel Abrahamsen, Bartosz Walczak:
  Common Tangents of Two Disjoint Polygons in Linear Time and Constant Workspace. ACM Trans. Algorithms 15(1): 12:1-12:21 (2019)
• 
  Anna Adamaszek, Artur Czumaj, Matthias Englert, Harald Räcke:
  An O(log k)-Competitive Algorithm for Generalized Caching. ACM Trans. Algorithms 15(1): 6:1-6:18 (2019)
• 
  David Adjiashvili:
  Beating Approximation Factor Two for Weighted Tree Augmentation with Bounded Costs. ACM Trans. Algorithms 15(2): 19:1-19:26 (2019)
• 
  David Adjiashvili, Andrea Baggio, Rico Zenklusen:
  Firefighting on Trees Beyond Integrality Gaps. ACM Trans. Algorithms 15(2): 20:1-20:33 (2019)
• 
  Akanksha Agrawal, Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, Meirav Zehavi:
  Feedback Vertex Set Inspired Kernel for Chordal Vertex Deletion. ACM Trans. Algorithms 15(1): 11:1-11:28 (2019)
• 
  Hugo A. Akitaya, Radoslav Fulek, Csaba D. Tóth:
  Recognizing Weak Embeddings of Graphs. ACM Trans. Algorithms 15(4): 50:1-50:27 (2019)
• 
  Saeed Akhoondian Amiri, Stefan Schmid, Sebastian Siebertz:
  Distributed Dominating Set Approximations beyond Planar Graphs. ACM Trans. Algorithms 15(3): 39:1-39:18 (2019)
• 
  Nikhil Bansal, Marek Eliás, Lukasz Jez, Grigorios Koumoutsos:
  The (h, k)-Server Problem on Bounded Depth Trees. ACM Trans. Algorithms 15(2): 28:1-28:26 (2019)
• 
  Xiaohui Bei, Jugal Garg, Martin Hoefer:
  Ascending-Price Algorithms for Unknown Markets. ACM Trans. Algorithms 15(3): 37:1-37:33 (2019)
• 
  Petra Berenbrink, Ralf Klasing, Adrian Kosowski, Frederik Mallmann-Trenn, Przemyslaw Uznanski:
  Improved Analysis of Deterministic Load-Balancing Schemes. ACM Trans. Algorithms 15(1): 10:1-10:22 (2019)
• 
  Arnab Bhattacharyya, Palash Dey, David P. Woodruff:
  An Optimal Algorithm for ℓ₁-Heavy Hitters in Insertion Streams and Related Problems. ACM Trans. Algorithms 15(1): 2:1-2:27 (2019)
• 
  Marcin Bienkowski, Jaroslaw Byrka, Marcin Mucha:
  Dynamic Beats Fixed: On Phase-based Algorithms for File Migration. ACM Trans. Algorithms 15(4): 46:1-46:21 (2019)
• 
  Avrim Blum, Sariel Har-Peled, Benjamin Raichel:
  Sparse Approximation via Generating Point Sets. ACM Trans. Algorithms 15(3): 32:1-32:16 (2019)
• 
  Ulrich Brenner, Anna Hermann:
  Faster Carry Bit Computation for Adder Circuits with Prescribed Arrival Times. ACM Trans. Algorithms 15(4): 45:1-45:23 (2019)
• 
  Niv Buchbinder, Moran Feldman, Roy Schwartz:
  Online Submodular Maximization with Preemption. ACM Trans. Algorithms 15(3): 30:1-30:31 (2019)
• 
  Mark Bun, Jelani Nelson, Uri Stemmer:
  Heavy Hitters and the Structure of Local Privacy. ACM Trans. Algorithms 15(4): 51:1-51:40 (2019)
• 
  Sergio Cabello:
  Subquadratic Algorithms for the Diameter and the Sum of Pairwise Distances in Planar Graphs. ACM Trans. Algorithms 15(2): 21:1-21:38 (2019)
• 
  Massimo Cairo, Paul Medvedev, Nidia Obscura Acosta, Romeo Rizzi, Alexandru I. Tomescu:
  An Optimal O(nm) Algorithm for Enumerating All Walks Common to All Closed Edge-covering Walks of a Graph. ACM Trans. Algorithms 15(4): 48:1-48:17 (2019)
• 
  Deeparnab Chakrabarty, Maryam Negahbani:
  Generalized Center Problems with Outliers. ACM Trans. Algorithms 15(3): 41:1-41:14 (2019)
• 
  Yi-Jun Chang, Tsvi Kopelowitz, Seth Pettie, Ruosong Wang, Wei Zhan:
  Exponential Separations in the Energy Complexity of Leader Election. ACM Trans. Algorithms 15(4): 49:1-49:31 (2019)
• 
  Yeow Meng Chee, Johan Chrisnata, Han Mao Kiah, Tuan Thanh Nguyen:
  Deciding the Confusability of Words under Tandem Repeats in Linear Time. ACM Trans. Algorithms 15(3): 42:1-42:22 (2019)
• 
  David Coudert, Guillaume Ducoffe, Alexandru Popa:
  Fully Polynomial FPT Algorithms for Some Classes of Bounded Clique-width Graphs. ACM Trans. Algorithms 15(3): 33:1-33:57 (2019)
• 
  Marek Cygan, Lukasz Kowalik, Arkadiusz Socala:
  Improving TSP Tours Using Dynamic Programming over Tree Decompositions. ACM Trans. Algorithms 15(4): 54:1-54:19 (2019)
• 
  Marek Cygan, Marcin Mucha, Karol Wegrzycki, Michal Wlodarczyk:
  On Problems Equivalent to (min, +)-Convolution. ACM Trans. Algorithms 15(1): 14:1-14:25 (2019)
• 
  Yann Disser, Martin Skutella:
  The Simplex Algorithm Is NP-Mighty. ACM Trans. Algorithms 15(1): 5:1-5:19 (2019)
• 
  Michael Elkin, Ofer Neiman:
  Efficient Algorithms for Constructing Very Sparse Spanners and Emulators. ACM Trans. Algorithms 15(1): 4:1-4:29 (2019)
• 
  Diodato Ferraioli, Carmine Ventre:
  Metastability of the Logit Dynamics for Asymptotically Well-Behaved Potential Games. ACM Trans. Algorithms 15(2): 27:1-27:42 (2019)
• 
  Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh:
  Spanning Circuits in Regular Matroids. ACM Trans. Algorithms 15(4): 52:1-52:38 (2019)
• 
  Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi:
  Clique-width III: Hamiltonian Cycle and the Odd Case of Graph Coloring. ACM Trans. Algorithms 15(1): 9:1-9:27 (2019)
• 
  Fedor V. Fomin, Tien-Nam Le, Daniel Lokshtanov, Saket Saurabh, Stéphan Thomassé, Meirav Zehavi:
  Subquadratic Kernels for Implicit 3-Hitting Set and 3-Set Packing Problems. ACM Trans. Algorithms 15(1): 13:1-13:44 (2019)

skipping 25 more matches