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

• 2024
• 
  Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Saket Saurabh, Meirav Zehavi:
  (Re)packing Equal Disks into Rectangle. Discret. Comput. Geom. 72(4): 1596-1629 (2024)
• 
  Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Tomohiro Koana:
  FPT approximation and subexponential algorithms for covering few or many edges. Inf. Process. Lett. 185: 106471 (2024)
• 
  Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Saket Saurabh, Meirav Zehavi:
  Hybrid k-Clustering: Blending k-Median and k-Center. APPROX/RANDOM 2024: 4:1-4:19
• 
  Shiri Alouf-Heffetz, Tanmay Inamdar, Pallavi Jain, Nimrod Talmon, Yash More Hiren:
  Controlling Delegations in Liquid Democracy. AAMAS 2024: 2624-2632
• 
  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
• 
  Sushmita Gupta, Tanmay Inamdar, Pallavi Jain, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh:
  When Far Is Better: The Chamberlin-Courant Approach to Obnoxious Committee Selection. FSTTCS 2024: 24:1-24:21
• 
  Tanmay Inamdar, Pallavi Jain, Daniel Lokshtanov, Abhishek Sahu, Saket Saurabh, Anannya Upasana:
  Satisfiability to Coverage in Presence of Fairness, Matroid, and Global Constraints. ICALP 2024: 88:1-88:18
• 
  Tanmay Inamdar, Madhumita Kundu, Pekka Parviainen, M. S. Ramanujan, Saket Saurabh:
  Exponential-Time Approximation Schemes via Compression. ITCS 2024: 64:1-64:22
• 
  Tanmay Inamdar, Pallavi Jain, Daniel Lokshtanov, Abhishek Sahu, Saket Saurabh, Anannya Upasana:
  Satisfiability to Coverage in Presence of Fairness, Matroid, and Global Constraints. CoRR abs/2403.07328 (2024)
• 
  Shiri Alouf-Heffetz, Tanmay Inamdar, Pallavi Jain, Yash More, Nimrod Talmon:
  Controlling Delegations in Liquid Democracy. CoRR abs/2403.07558 (2024)
• 
  Sushmita Gupta, Tanmay Inamdar, Pallavi Jain, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh:
  When far is better: The Chamberlin-Courant approach to obnoxious committee selection. CoRR abs/2405.15372 (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)
• 
  Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Saket Saurabh, Meirav Zehavi:
  Hybrid k-Clustering: Blending k-Median and k-Center. CoRR abs/2407.08295 (2024)
• 
  Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Saket Saurabh, Meirav Zehavi:
  Parameterized Geometric Graph Modification with Disk Scaling. CoRR abs/2411.13171 (2024)
• 2023
• 
  Akanksha Agrawal, Tanmay Inamdar, Saket Saurabh, Jie Xue:
  Clustering what Matters: Optimal Approximation for Clustering with Outliers. J. Artif. Intell. Res. 78: 143-166 (2023)
• 
  Akanksha Agrawal, Tanmay Inamdar, Saket Saurabh, Jie Xue:
  Clustering What Matters: Optimal Approximation for Clustering with Outliers. AAAI 2023: 6666-6674
• 
  Sayan Bandyapadhyay, Fedor V. Fomin, Tanmay Inamdar:
  Coresets for Clustering in Geometric Intersection Graphs. SoCG 2023: 10:1-10:16
• 
  Tanmay Inamdar, Daniel Lokshtanov, Saket Saurabh, Vaishali Surianarayanan:
  Parameterized Complexity of Fair Bisection: (FPT-Approximation meets Unbreakability). ESA 2023: 63:1-63:17
• 
  Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Saket Saurabh, Meirav Zehavi:
  Kernelization for Spreading Points. ESA 2023: 48:1-48:16
• 
  Tanmay Inamdar, Lawqueen Kanesh, Madhumita Kundu, M. S. Ramanujan, Saket Saurabh:
  FPT Approximations for Packing and Covering Problems Parameterized by Elimination Distance and Even Less. FSTTCS 2023: 28:1-28:16
• 
  Walter Didimo, Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Stephen G. Kobourov, Marie Diana Sieper:
  Parameterized and Approximation Algorithms for the Maximum Bimodal Subgraph Problem. GD (2) 2023: 189-202
• 
  Tanmay Inamdar, Lawqueen Kanesh, Madhumita Kundu, Nidhi Purohit, Saket Saurabh:
  Fixed-Parameter Algorithms for Fair Hitting Set Problems. MFCS 2023: 55:1-55:14
• 
  Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Tomohiro Koana:
  FPT Approximation and Subexponential Algorithms for Covering Few or Many Edges. MFCS 2023: 46:1-46:8
• 
  Sayan Bandyapadhyay, Fedor V. Fomin, Tanmay Inamdar, Fahad Panolan, Kirill Simonov:
  Socially Fair Matching: Exact and Approximation Algorithms. WADS 2023: 79-92
• 
  Sayan Bandyapadhyay, Fedor V. Fomin, Tanmay Inamdar, Kirill Simonov:
  Proportionally Fair Matching with Multiple Groups. WG 2023: 1-15
• 
  Sayan Bandyapadhyay, Fedor V. Fomin, Tanmay Inamdar, Kirill Simonov:
  Proportionally Fair Matching with Multiple Groups. CoRR abs/2301.03862 (2023)
• 
  Sayan Bandyapadhyay, Fedor V. Fomin, Tanmay Inamdar:
  Coresets for Clustering in Geometric Intersection Graphs. CoRR abs/2303.01400 (2023)
• 
  Rajni Dabas, Neelima Gupta, Tanmay Inamdar:
  FPT Approximations for Capacitated/Fair Clustering with Outliers. CoRR abs/2305.01471 (2023)
• 
  Tanmay Inamdar, Lawqueen Kanesh, Madhumita Kundu, Nidhi Purohit, Saket Saurabh:
  Fixed-Parameter Algorithms for Fair Hitting Set Problems. CoRR abs/2307.08854 (2023)
• 
  Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Saket Saurabh, Meirav Zehavi:
  Kernelization for Spreading Points. CoRR abs/2308.07099 (2023)

skipping 35 more matches