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

• 2022
• 
  Ankit Abhinav, Susobhan Bandopadhyay, Aritra Banik, Saket Saurabh:
  Parameterized Algorithms for Finding Highly Connected Solution. CSR 2022: 1-16
• 
  Pavel Alaev:
  Quotient Structures and Groups Computable in Polynomial Time. CSR 2022: 35-45
• 
  Bardiya Aryanfard, Fahad Panolan:
  Parameterized Complexity of List Coloring and Max Coloring. CSR 2022: 46-63
• 
  Jasine Babu, Neeldhara Misra, Saraswati Nanoti:
  Eternal Vertex Cover on Bipartite Graphs. CSR 2022: 64-76
• 
  Lorenzo Balzotti, Paolo Giulio Franciosa:
  Non-crossing Shortest Paths in Undirected Unweighted Planar Graphs in Linear Time. CSR 2022: 77-95
• 
  Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, Nidhi Purohit, Kirill Simonov:
  Lossy Kernelization of Same-Size Clustering. CSR 2022: 96-114
• 
  Niranka Banerjee, Manoj Gupta, Venkatesh Raman, Saket Saurabh:
  Output Sensitive Fault Tolerant Maximum Matching. CSR 2022: 115-132
• 
  Laurent Doyen, Marie van den Bogaard:
  Bounds for Synchronizing Markov Decision Processes. CSR 2022: 133-151
• 
  Petr A. Golovach, Fahad Panolan, Ashutosh Rai, Saket Saurabh:
  Parameterized Complexity of Set-Restricted Disjoint Paths on Chordal Graphs. CSR 2022: 152-169
• 
  Alexander Grishutin, Daniil Musatov:
  Discrete Versions of the KKM Lemma and Their PPAD-Completeness. CSR 2022: 170-189
• 
  Kamil Khadiev, Maxim Yagafarov:
  The Fast Algorithm for Online k-server Problem on Trees. CSR 2022: 190-208
• 
  Peter Kostolányi:
  Finite Ambiguity and Finite Sequentiality in Weighted Automata over Fields. CSR 2022: 209-223
• 
  Alexander Kozachinskiy:
  New Bounds for the Flock-of-Birds Problem. CSR 2022: 224-237
• 
  Yifen Li, Xiaohui Bei, Youming Qiao, Dacheng Tao, Zhiya Chen:
  Heterogeneous Multi-commodity Network Flows over Time. CSR 2022: 238-255
• 
  Mizuhito Ogawa, Alexander Okhotin:
  On the Determinization of Event-Clock Input-Driven Pushdown Automata. CSR 2022: 256-268
• 
  Pierre Ohlmann:
  The GKK Algorithm is the Fastest over Simple Mean-Payoff Games. CSR 2022: 269-288
• 
  Abidha V. P, Pradeesha Ashok, Avi Tomar, Dolly Yadav:
  Coloring a Dominating Set Without Conflicts: q-Subset Square Coloring. CSR 2022: 17-34
• 
  Fahad Panolan, Hannane Yaghoubizade:
  Partial Vertex Cover on Graphs of Bounded Degeneracy. CSR 2022: 289-301
• 
  Elena A. Petrova, Arseny M. Shur:
  Abelian Repetition Threshold Revisited. CSR 2022: 302-319
• 
  Thomas Place, Marc Zeitoun:
  Characterizing Level One in Group-Based Concatenation Hierarchies. CSR 2022: 320-337
• 
  Nikolai K. Vereshchagin:
  How Much Randomness is Needed to Convert MA Protocols to AM Protocols? CSR 2022: 338-349
• 
  Alexander S. Kulikov, Sofya Raskhodnikova:
  Computer Science - Theory and Applications - 17th International Computer Science Symposium in Russia, CSR 2022, Virtual Event, June 29 - July 1, 2022, Proceedings. Lecture Notes in Computer Science 13296, Springer 2022, ISBN 978-3-031-09573-3 [contents]
• 2021
• 
  Markus Holzer, Christian Rauch:
  On the Computational Complexity of Reaction Systems, Revisited. CSR 2021: 170-185
• 
  Manon Blanc, Kristoffer Arnsfelt Hansen:
  Computational Complexity of Multi-player Evolutionarily Stable Strategies. CSR 2021: 1-17
• 
  Jan Bok, Nikola Jedlicková, Barnaby Martin, Daniël Paulusma, Siani Smith:
  Injective Colouring for H-Free Graphs. CSR 2021: 18-30
• 
  Prasad Chaugule, Nutan Limaye, Shourya Pandey:
  Variants of the Determinant Polynomial and the VP-Completeness. CSR 2021: 31-55
• 
  Samir Datta, Anuj Tawari, Yadu Vasudev:
  Dynamic Complexity of Expansion. CSR 2021: 56-77
• 
  Pranjal Dutta:
  Real τ-Conjecture for Sum-of-Squares: A Unified Approach to Lower Bound and Derandomization. CSR 2021: 78-101
• 
  Austen Z. Fan, Jin-Yi Cai:
  Dichotomy Result on 3-Regular Bipartite Non-negative Functions. CSR 2021: 102-115
• 
  Anna Gál, Ridwan Syed:
  Upper Bounds on Communication in Terms of Approximate Rank. CSR 2021: 116-130

skipping 558 more matches