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

• 2019
• 
  Shantanu Das, Nikos Giachoudis, Flaminia L. Luccio, Euripides Markou:
  Gathering of Robots in a Grid with Mobile Faults. SOFSEM 2019: 164-178
• 
  Uwe Aßmann, Dominik Grzelak, Johannes Mey, Dmytro Pukhkaiev, René Schöne, Christopher Werner, Georg Püschel:
  Cross-Layer Adaptation in Multi-layer Autonomic Systems (Invited Talk). SOFSEM 2019: 1-20
• 
  Indranil Banerjee, Dana Richards, Igor Shinkar:
  Sorting Networks on Restricted Topologies. SOFSEM 2019: 54-66
• 
  Julien Baste, Didem Gözüpek, Mordechai Shalom, Dimitrios M. Thilikos:
  Minimum Reload Cost Graph Factors. SOFSEM 2019: 67-80
• 
  Hans L. Bodlaender, Marieke van der Wegen, Tom C. van der Zanden:
  Stable Divisorial Gonality is in NP. SOFSEM 2019: 81-93
• 
  Francesco Bonchi:
  Distance-Based Community Search (Invited Talk Extended Abstract). SOFSEM 2019: 21-27
• 
  Raffaello Carosi, Simone Fioravanti, Luciano Gualà, Gianpiero Monaco:
  Coalition Resilient Outcomes in Max k-Cut Games. SOFSEM 2019: 94-107
• 
  Milos Chromý, Petr Kucera:
  Phase Transition in Matched Formulas and a Heuristic for Biclique Satisfiability. SOFSEM 2019: 108-121
• 
  Ferdinando Cicalese, Zsuzsanna Lipták, Massimiliano Rossi:
  On Infinite Prefix Normal Words. SOFSEM 2019: 122-135
• 
  Mattia D'Emidio, Gabriele Di Stefano, Alfredo Navarra:
  Priority Scheduling in the Bamboo Garden Trimming Problem. SOFSEM 2019: 136-149
• 
  Shantanu Das, Giuseppe Antonio Di Luna, Leszek Antoni Gasieniec:
  Patrolling on Dynamic Ring Networks. SOFSEM 2019: 150-163
• 
  Nils Donselaar:
  Probabilistic Parameterized Polynomial Time. SOFSEM 2019: 179-191
• 
  Henning Fernau, Lakshmanan Kuppusamy, Indhumathi Raman:
  On Matrix Ins-Del Systems of Small Sum-Norm. SOFSEM 2019: 192-205
• 
  Chong Gao, Taolue Chen, Zhilin Wu:
  Separation Logic with Linearly Compositional Inductive Predicates and Set Data Constraints. SOFSEM 2019: 206-220
• 
  Manoj Gupta, Hitesh Kumar, Neeldhara Misra:
  On the Complexity of Optimal Matching Reconfiguration. SOFSEM 2019: 221-233
• 
  Frank Gurski, Carolin Rehs:
  Forbidden Directed Minors, Directed Path-Width and Directed Tree-Width of Tree-Like Digraphs. SOFSEM 2019: 234-246
• 
  Lane A. Hemaspaandra, David E. Narváez:
  Existence Versus Exploitation: The Opacity of Backdoors and Backbones Under a Weak Assumption. SOFSEM 2019: 247-259
• 
  Christos A. Kapoutsis:
  Minicomplexity - Some Motivation, Some History, and Some Structure (Invited Talk Extended Abstract). SOFSEM 2019: 28-38
• 
  Michael Kaufmann:
  On Point Set Embeddings for k-Planar Graphs with Few Bends per Edge. SOFSEM 2019: 260-271
• 
  Christian Komusiewicz, Frank Sommer:
  Enumerating Connected Induced Subgraphs: Improved Delay and Experimental Comparison. SOFSEM 2019: 272-284
• 
  Martin Kutrib, Matthias Wendlandt:
  Multi-stranded String Assembling Systems. SOFSEM 2019: 285-297
• 
  Martin Labaj, Karol Rástocný, Daniela Chudá:
  Towards Automatic Comparison of Cloud Service Security Certifications. SOFSEM 2019: 298-309
• 
  Vladislav Makarov, Alexander Okhotin:
  On the Expressive Power of GF(2)-Grammars. SOFSEM 2019: 310-323
• 
  Isela Mendoza, Uéverton S. Souza, Marcos Kalinowski, Ruben Interian, Leonardo Gresta Paulino Murta:
  An Efficient Algorithm for Combining Verification and Validation Methods. SOFSEM 2019: 324-340
• 
  Neeldhara Misra, Chinmay Sonar:
  Robustness Radius for Chamberlin-Courant on Restricted Domains. SOFSEM 2019: 341-353
• 
  Roland Molontay, Kitti Varga:
  On the Complexity of Color-Avoiding Site and Bond Percolation. SOFSEM 2019: 354-367
• 
  Benedek Nagy, Friedrich Otto:
  Two-Head Finite-State Acceptors with Translucent Letters. SOFSEM 2019: 406-418
• 
  Nikolajs Nahimovs:
  Lackadaisical Quantum Walks with Multiple Marked Vertices. SOFSEM 2019: 368-378
• 
  Hirotaka Ono, Hisato Yamanaka:
  A 116/13-Approximation Algorithm for L(2, 1)-Labeling of Unit Disk Graphs. SOFSEM 2019: 379-391
• 
  Dorota Osula:
  Minimizing the Cost of Team Exploration. SOFSEM 2019: 392-405

skipping 11 more matches