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

• 2019
• 
  Sandip Das, Harmender Gahlawat, Uma Kant Sahoo, Sagnik Sen:
  Cops and Robber on Some Families of Oriented Graphs. IWOCA 2019: 188-200
• 
  Yeganeh Bahoo, Prosenjit Bose, Stephane Durocher, Thomas C. Shermer:
  Computing the k-Crossing Visibility Region of a Point in a Polygon. IWOCA 2019: 10-21
• 
  Mirza Galib Anwarul Husain Baig, Deepanjan Kesh, Chirag Sodani:
  An Improved Scheme in the Two Query Adaptive Bitprobe Model. IWOCA 2019: 22-34
• 
  Martin Balko, Sujoy Bhore, Leonardo Martínez-Sandoval, Pavel Valtr:
  On Erdős-Szekeres-Type Problems for k-convex Point Sets. IWOCA 2019: 35-47
• 
  Sandip Banerjee, Sujoy Bhore:
  Algorithm and Hardness Results on Liar's Dominating Set and \varveck -tuple Dominating Set. IWOCA 2019: 48-60
• 
  Aritra Banik, Ashwin Jacob, Vijay Kumar Paliwal, Venkatesh Raman:
  Fixed-Parameter Tractability of (n-k) List Coloring. IWOCA 2019: 61-69
• 
  Magsarjav Bataa, Sung Gwan Park, Amihood Amir, Gad M. Landau, Kunsoo Park:
  Finding Periods in Cartesian Tree Matching. IWOCA 2019: 70-84
• 
  Matthias Bentert, Roman Haag, Christian Hofer, Tomohiro Koana, André Nichterlein:
  Parameterized Complexity of Min-Power Asymmetric Connectivity. IWOCA 2019: 85-96
• 
  Arindam Biswas, Venkatesh Raman, Saket Saurabh:
  Solving Group Interval Scheduling Efficiently. IWOCA 2019: 97-107
• 
  Hans-Joachim Böckenhauer, Nina Corvelo Benz, Dennis Komm:
  Call Admission Problems on Trees with Advice - (Extended Abstract). IWOCA 2019: 108-121
• 
  Srecko Brlek, Andrea Frosini, Ilaria Mancini, Elisa Pergola, Simone Rinaldi:
  Burrows-Wheeler Transform of Words Defined by Morphisms. IWOCA 2019: 393-404
• 
  Pierre Cazals, Benoît Darties, Annie Chateau, Rodolphe Giroudeau, Mathias Weller:
  Power Edge Set and Zero Forcing Set Remain Difficult in Cubic Graphs. IWOCA 2019: 122-135
• 
  Janka Chlebíková, Clément Dallard:
  Towards a Complexity Dichotomy for Colourful Components Problems on k-caterpillars and Small-Degree Planar Graphs. IWOCA 2019: 136-147
• 
  Alessio Conte, Mamadou Moustapha Kanté, Andrea Marino, Takeaki Uno:
  Maximal Irredundant Set Enumeration in Bounded-Degeneracy and Bounded-Degree Hypergraphs. IWOCA 2019: 148-159
• 
  Gennaro Cordasco, Luisa Gargano, Adele Anna Rescigno:
  Dual Domination. IWOCA 2019: 160-174
• 
  Zola Donovan, K. Subramani, Vahan Mkrtchyan:
  Disjoint Clustering in Combinatorial Circuits. IWOCA 2019: 201-213
• 
  Mitre Costa Dourado, Lucia Draque Penso, Dieter Rautenbach:
  The Hull Number in the Convexity of Induced Paths of Order 3. IWOCA 2019: 214-228
• 
  Dalibor Froncek, Jiangyi Qiu:
  Supermagic Graphs with Many Odd Degrees. IWOCA 2019: 229-236
• 
  Mehdi Khosravian Ghadikolaei, Nikolaos Melissinos, Jérôme Monnot, Aris Pagourtzis:
  Extension and Its Price for the Connected Vertex Cover Problem. IWOCA 2019: 315-326
• 
  Rahul Raj Gupta, Sushanta Karmakar:
  Incremental Algorithm for Minimum Cut and Edge Connectivity in Hypergraph. IWOCA 2019: 237-250
• 
  Michel Habib, Fabien de Montgolfier, Lalla Mouatadid, Mengchuan Zou:
  A General Algorithmic Scheme for Modular Decompositions of Hypergraphs and Applications. IWOCA 2019: 251-264
• 
  Herman J. Haverkort, David Kübel, Elmar Langetepe:
  Shortest-Path-Preserving Rounding. IWOCA 2019: 265-277
• 
  Michael A. Henning, Arti Pandey, Vikash Tripathi:
  Complexity and Algorithms for Semipaired Domination in Graphs. IWOCA 2019: 278-289
• 
  Jesper Jansson, Konstantinos Mampentzidis, Ramesh Rajaby, Wing-Kin Sung:
  Computing the Rooted Triplet Distance Between Phylogenetic Networks. IWOCA 2019: 290-303
• 
  Anjeneya Swami Kare, I. Vinod Reddy:
  Parameterized Algorithms for Graph Burning Problem. IWOCA 2019: 304-314
• 
  Yasuaki Kobayashi, Yusuke Kobayashi, Shuichi Miyazaki, Suguru Tamaki:
  An Improved Fixed-Parameter Algorithm for Max-Cut Parameterized by Crossing Number. IWOCA 2019: 327-338
• 
  Kazuhiro Kurita, Kunihiro Wasa, Takeaki Uno, Hiroki Arimura:
  An Efficient Algorithm for Enumerating Chordal Bipartite Induced Subgraphs in Sparse Graphs. IWOCA 2019: 339-351
• 
  Juho Lauri, Christodoulos Mitillos:
  Complexity of Fall Coloring for Restricted Graph Classes. IWOCA 2019: 352-364
• 
  Giordano Da Lozzo, Ignaz Rutter:
  Reaching 3-Connectivity via Edge-Edge Additions. IWOCA 2019: 175-187
• 
  Fumito Miyake, Eiji Takimoto, Kohei Hatano:
  Succinct Representation of Linear Extensions via MDDs and Its Application to Scheduling Under Precedence Constraints. IWOCA 2019: 365-377

skipping 7 more matches