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

• 2019
• 
  Sandip Das, Harmender Gahlawat:
  Bumblebee Visitation Problem. CALDAM 2019: 254-262
• 
  Sandip Das, Soumen Nandi, Sagnik Sen, Ritesh Seth:
  The Relative Signed Clique Number of Planar Graphs is 8. CALDAM 2019: 245-253
• 
  Ankush Acharyya, Anil Maheshwari, Subhas C. Nandy:
  Localized Query: Color Spanning Variations. CALDAM 2019: 150-160
• 
  N. R. Aravind, Subrahmanyam Kalyanasundaram, Anjeneya Swami Kare:
  H-Free Coloring on Graphs with Bounded Tree-Width. CALDAM 2019: 231-244
• 
  Jasine Babu, L. Sunil Chandran, Mathew C. Francis, Veena Prabhakaran, Deepak Rajendraprasad, J. Nandini Warrier:
  On Graphs with Minimal Eternal Vertex Cover Number. CALDAM 2019: 263-273
• 
  Devsi Bantva:
  A Lower Bound for the Radio Number of Graphs. CALDAM 2019: 161-173
• 
  Gill Barequet, Gil Ben-Shachar:
  Minimal-Perimeter Polyominoes: Chains, Roots, and Algorithms. CALDAM 2019: 109-123
• 
  Sukanya Bhattacharjee, R. Inkulu:
  Fault-Tolerant Additive Weighted Geometric Spanners. CALDAM 2019: 29-41
• 
  Sujoy Bhore, Sourav Chakraborty, Satyabrata Jana, Joseph S. B. Mitchell, Supantha Pandit, Sasanka Roy:
  The Balanced Connected Subgraph Problem. CALDAM 2019: 201-215
• 
  Dibyayan Chakraborty, Sandip Das, Mathew C. Francis, Sagnik Sen:
  On Rectangle Intersection Graphs with Stab Number at Most Two. CALDAM 2019: 124-137
• 
  Tameem Choudhury, R. Inkulu:
  Maintaining the Visibility Graph of a Dynamic Simple Polygon. CALDAM 2019: 42-52
• 
  Ajit A. Diwan, Bodhayan Roy, Subir Kumar Ghosh:
  Drawing Bipartite Graphs in Two Layers with Specified Crossings. CALDAM 2019: 97-108
• 
  Henning Fernau, Lakshmanan Kuppusamy, Rufus O. Oladele, Indhumathi Raman:
  Improved Descriptional Complexity Results on Generalized Forbidding Grammars. CALDAM 2019: 174-188
• 
  Kolja Junginger, Ioannis Mantas, Evanthia Papadopoulou:
  On Selecting Leaves with Disjoint Neighborhoods in Embedded Trees. CALDAM 2019: 189-200
• 
  Deepanjan Kesh, Vidya Sagar Sharma:
  On the Bitprobe Complexity of Two Probe Adaptive Schemes Storing Two Elements. CALDAM 2019: 53-64
• 
  Kalpana Mahalingam, Helda Princy Rajendran:
  On m-Bonacci-Sum Graphs. CALDAM 2019: 65-76
• 
  David M. Mount:
  New Directions in Approximate Nearest-Neighbor Searching. CALDAM 2019: 1-15
• 
  B. S. Panda, Juhi Chaudhary:
  Dominating Induced Matching in Some Subclasses of Bipartite Graphs. CALDAM 2019: 138-149
• 
  Supantha Pandit:
  Covering and Packing of Triangles Intersecting a Straight Line. CALDAM 2019: 216-230
• 
  S. Francis Raj, M. Gokulnath:
  b-Coloring of the Mycielskian of Regular Graphs. CALDAM 2019: 91-96
• 
  Sameera Muhamed Salam, Daphna Chacko, J. Nandini Warrier, K. Murali Krishnan, K. S. Sudeep:
  On Chordal and Perfect Plane Triangulations. CALDAM 2019: 274-285
• 
  M. A. Shalu, S. Vijayakumar, T. P. Sandhya:
  The Induced Star Partition of Graphs. CALDAM 2019: 16-28
• 
  Ranveer Singh, Naomi Shaked-Monderer, Avi Berman:
  Linear Time Algorithm to Check the Singularity of Block Graphs. CALDAM 2019: 77-90
• 
  Sudebkumar Prasant Pal, Ambat Vijayakumar:
  Algorithms and Discrete Applied Mathematics - 5th International Conference, CALDAM 2019, Kharagpur, India, February 14-16, 2019, Proceedings. Lecture Notes in Computer Science 11394, Springer 2019, ISBN 978-3-030-11508-1 [contents]