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

• 2024
• 
  Aritra Banik, Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Satyabrata Jana, Saket Saurabh:
  Cuts in Graphs with Matroid Constraints. ESA 2024: 17:1-17:15
• 
  Aritra Banik, Sayani Das, Anil Maheshwari, Bubai Manna, Subhas C. Nandy, Krishna Priya K. M., Bodhayan Roy, Sasanka Roy, Abhishek Sahu:
  Minimum Consistent Subset in Trees and Interval Graphs. FSTTCS 2024: 7:1-7:15
• 
  Susobhan Bandopadhyay, Aritra Banik, Diptapriyo Majumdar, Abhishek Sahu:
  Tractability of Packing Vertex-Disjoint A-Paths Under Length Constraints. MFCS 2024: 16:1-16:18
• 
  Susobhan Bandopadhyay, Aritra Banik, Sushmita Gupta, Pallavi Jain, Abhishek Sahu, Saket Saurabh, Prafullkumar Tale:
  Conflict and Fairness in Resource Allocation. CoRR abs/2403.04265 (2024)
• 
  Aritra Banik, Sayani Das, Anil Maheshwari, Bubai Manna, Subhas C. Nandy, Krishna Priya K. M., Bodhayan Roy, Sasanka Roy, Abhishek Sahu:
  Minimum Consistent Subset in Trees and Interval Graphs. CoRR abs/2404.15487 (2024)
• 
  Aritra Banik, Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Satyabrata Jana, Saket Saurabh:
  Cuts in Graphs with Matroid Constraints. CoRR abs/2406.19134 (2024)
• 2023
• 
  Sayan Bandyapadhyay, Aritra Banik, Sujoy Bhore:
  On Colorful Vertex and Edge Cover Problems. Algorithmica 85(12): 3816-3827 (2023)
• 
  Aritra Banik, Rajiv Raman, Saurabh Ray:
  On the geometric priority set cover problem. Comput. Geom. 112: 101984 (2023)
• 
  Ankit Abhinav, Susobhan Bandopadhyay, Aritra Banik, Saket Saurabh:
  Parameterized algorithms for finding highly connected solution. Theor. Comput. Sci. 942: 47-56 (2023)
• 
  Susobhan Bandopadhyay, Suman Banerjee, Aritra Banik, Venkatesh Raman:
  Structural parameterizations of budgeted graph coloring. Theor. Comput. Sci. 940(Part): 209-221 (2023)
• 
  Aritra Banik, Prahlad Narasimhan Kasthurirangan, Venkatesh Raman:
  Dominator Coloring and CD Coloring in Almost Cluster Graphs. WADS 2023: 106-119
• 
  Sayan Bandyapadhyay, Aritra Banik, Sujoy Bhore:
  On Colorful Vertex and Edge Cover Problems. CoRR abs/2308.15842 (2023)
• 2022
• 
  Aritra Banik, Bhaswar B. Bhattacharya, Sujoy Bhore, Leonardo Martínez-Sandoval:
  Geometric systems of unbiased representatives. Inf. Process. Lett. 176: 106232 (2022)
• 
  Ankit Abhinav, Susobhan Bandopadhyay, Aritra Banik, Saket Saurabh:
  Parameterized Algorithms for Finding Highly Connected Solution. CSR 2022: 1-16
• 
  Ankit Abhinav, Susobhan Bandopadhyay, Aritra Banik, Yasuaki Kobayashi, Shunsuke Nagano, Yota Otachi, Saket Saurabh:
  Parameterized Complexity of Non-Separating and Non-Disconnecting Paths and Sets. MFCS 2022: 6:1-6:15
• 
  Susobhan Bandopadhyay, Suman Banerjee, Aritra Banik, Venkatesh Raman:
  Structural Parameterizations of Budgeted Graph Coloring. WALCOM 2022: 340-351
• 
  Ankit Abhinav, Susobhan Bandopadhyay, Aritra Banik, Saket Saurabh:
  Parameterized Complexity of Graph Partitioning into Connected Clusters. CoRR abs/2202.12042 (2022)
• 
  Aritra Banik, Prahlad Narasimhan Kasthurirangan, Venkatesh Raman:
  Dominator Coloring Parameterized by Cluster Vertex Deletion Number. CoRR abs/2210.17321 (2022)
• 2021
• 
  Sayan Bandyapadhyay, Aritra Banik, Sujoy Bhore, Martin Nöllenburg:
  Geometric planar networks on bichromatic collinear points. Theor. Comput. Sci. 895: 124-136 (2021)
• 
  Aritra Banik, Arun Kumar Das, Sandip Das, Anil Maheshwari, Swami Sarvattomananda:
  Voronoi game on polygons. Theor. Comput. Sci. 882: 125-142 (2021)
• 
  Aritra Banik, Rajiv Raman, Saurabh Ray:
  On Geometric Priority Set Cover Problems. ISAAC 2021: 12:1-12:14
• 
  Sayan Bandyapadhyay, Aritra Banik, Sujoy Bhore:
  On Fair Covering and Hitting Problems. WG 2021: 39-51
• 
  Susobhan Bandopadhyay, Suman Banerjee, Aritra Banik, Venkatesh Raman:
  Structural Parameterizations of Budgeted Graph Coloring. CoRR abs/2110.14498 (2021)
• 2020
• 
  Aritra Banik, Pratibha Choudhary, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh:
  A Polynomial Sized Kernel for Tracking Paths Problem. Algorithmica 82(1): 41-63 (2020)
• 
  Aritra Banik, Fahad Panolan, Venkatesh Raman, Vibha Sahlot, Saket Saurabh:
  Parameterized Complexity of Geometric Covering Problems Having Conflicts. Algorithmica 82(1): 1-19 (2020)
• 
  Harel Yedidsion, Stav Ashur, Aritra Banik, Paz Carmi, Matthew J. Katz, Michael Segal:
  Sensor Network Topology Design and Analysis for Efficient Data Gathering by a Mobile Mule. Algorithmica 82(10): 2784-2808 (2020)
• 
  Aritra Banik, Vibha Sahlot, Saket Saurabh:
  Approximation algorithms for geometric conflict free covering problems. Comput. Geom. 89: 101591 (2020)
• 
  Aritra Banik, Matthew J. Katz, Eli Packer, Marina Simakov:
  Tracking Paths. Discret. Appl. Math. 282: 22-34 (2020)
• 
  Aritra Banik, Ashwin Jacob, Vijay Kumar Paliwal, Venkatesh Raman:
  Fixed-Parameter Tractability of (n - k) List Coloring. Theory Comput. Syst. 64(7): 1307-1316 (2020)
• 
  Pranav Arora, Aritra Banik, Vijay Kumar Paliwal, Venkatesh Raman:
  List-coloring - Parameterizing from triviality. Theor. Comput. Sci. 821: 102-110 (2020)

skipping 45 more matches