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

• 2018
• 
  Spyros Angelopoulos, Christoph Dürr, Shendan Jin:
  Online Maximum Matching with Recourse. MFCS 2018: 8:1-8:15
• 
  Andreas Göbel, J. A. Gregor Lagodzinski, Karen Seidel:
  Counting Homomorphisms to Trees Modulo a Prime. MFCS 2018: 49:1-49:13
• 
  Hasan Abasi:
  Error-Tolerant Non-Adaptive Learning of a Hidden Hypergraph. MFCS 2018: 3:1-3:15
• 
  Akanksha Agrawal, Pallavi Jain, Lawqueen Kanesh, Daniel Lokshtanov, Saket Saurabh:
  Conflict Free Feedback Vertex Set: A Parameterized Dichotomy. MFCS 2018: 53:1-53:15
• 
  Hugo A. Akitaya, Matthew D. Jones, David Stalfa, Csaba D. Tóth:
  Maximum Area Axis-Aligned Square Packings. MFCS 2018: 77:1-77:15
• 
  Marco Aldi, Niel de Beaudrap, Sevag Gharibian, Seyran Saeedi:
  On Efficiently Solvable Cases of Quantum k-SAT. MFCS 2018: 38:1-38:16
• 
  Kazuyuki Amano:
  Depth Two Majority Circuits for Majority and List Expanders. MFCS 2018: 81:1-81:13
• 
  Mikhail Andreev, Gleb Posobin, Alexander Shen:
  Plain Stopping Time and Conditional Complexities Revisited. MFCS 2018: 2:1-2:12
• 
  Guy Avni, Shibashis Guha, Orna Kupferman:
  Timed Network Games with Clocks. MFCS 2018: 23:1-23:18
• 
  Sayan Bandyapadhyay, Anil Maheshwari, Saeed Mehrabi, Subhash Suri:
  Approximating Dominating Set on Intersection Graphs of Rectangles and L-frames. MFCS 2018: 37:1-37:15
• 
  Andreas Bärtschi, Daniel Graf, Matús Mihalák:
  Collective Fast Delivery by Energy-Efficient Agents. MFCS 2018: 56:1-56:16
• 
  Rémy Belmonte, Tesshu Hanaka, Ioannis Katsikarelis, Eun Jung Kim, Michael Lampis:
  New Results on Directed Edge Dominating Set. MFCS 2018: 67:1-67:16
• 
  Ran Ben-Basat, Gil Einziger, Roy Friedman:
  Give Me Some Slack: Efficient Network Measurements. MFCS 2018: 34:1-34:16
• 
  Louisa Seelbach Benkner, Markus Lohrey:
  Average Case Analysis of Leaf-Centric Binary Tree Sources. MFCS 2018: 16:1-16:15
• 
  Cedric Berenger, Peter Niebert, Kévin Perrot:
  Balanced Connected Partitioning of Unweighted Grid Graphs. MFCS 2018: 39:1-39:18
• 
  Mikhail V. Berlinkov, Robert Ferens, Marek Szykula:
  Complexity of Preimage Problems for Deterministic Finite Automata. MFCS 2018: 32:1-32:14
• 
  Vittorio Bilò, Michele Flammini, Gianpiero Monaco, Luca Moscardelli:
  Pricing Problems with Buyer Preselection. MFCS 2018: 47:1-47:16
• 
  Manuel Bodirsky, Barnaby Martin, Marcello Mamino, Antoine Mottet:
  The Complexity of Disjunctive Linear Diophantine Constraints. MFCS 2018: 33:1-33:16
• 
  Ralph Christian Bottesch:
  On W[1]-Hardness as Evidence for Intractability. MFCS 2018: 73:1-73:15
• 
  Laurent Bulteau, Markus L. Schmid:
  Consensus Strings with Small Maximum Distance and Small Distance Sum. MFCS 2018: 1:1-1:15
• 
  Guillaume Burel:
  Linking Focusing and Resolution with Selection. MFCS 2018: 9:1-9:14
• 
  Arnaud Carayol, Matthew Hague:
  Optimal Strategies in Pushdown Reachability Games. MFCS 2018: 42:1-42:14
• 
  Costanza Catalano, Raphaël M. Jungers:
  On Randomized Generation of Slowly Synchronizing Automata. MFCS 2018: 48:1-48:16
• 
  Francesco Cellinese, Gianlorenzo D'Angelo, Gianpiero Monaco, Yllka Velaj:
  Generalized Budgeted Submodular Set Function Maximization. MFCS 2018: 31:1-31:14
• 
  Andrea E. F. Clementi, Mohsen Ghaffari, Luciano Gualà, Emanuele Natale, Francesco Pasquale, Giacomo Scornavacca:
  A Tight Analysis of the Parallel Undecided-State Dynamics with Two Colors. MFCS 2018: 28:1-28:15
• 
  Alessio Conte, Roberto Grossi, Andrea Marino, Romeo Rizzi, Luca Versari:
  Listing Subgraphs by Cartesian Decomposition. MFCS 2018: 84:1-84:16
• 
  Paolo D'Arco, Roberto De Prisco, Alfredo De Santis, Angel L. Pérez del Pozo, Ugo Vaccaro:
  Probabilistic Secret Sharing. MFCS 2018: 64:1-64:16
• 
  Konrad K. Dabrowski, Matthew Johnson, Giacomo Paesani, Daniël Paulusma, Viktor Zamaraev:
  On the Price of Independence for Vertex Cover, Feedback Vertex Set and Odd Cycle Transversal. MFCS 2018: 63:1-63:15
• 
  Chen Dan, Kristoffer Arnsfelt Hansen, He Jiang, Liwei Wang, Yuchen Zhou:
  Low Rank Approximation of Binary Matrices: Column Subset Selection and Generalizations. MFCS 2018: 41:1-41:16
• 
  Louis-Marie Dando, Sylvain Lombardy:
  On Hadamard Series and Rotating Q-Automata. MFCS 2018: 6:1-6:14

skipping 56 more matches