Projects
Reading
People
Chat
SU\G
(đž)
/K·U
Projects
Reading
People
Chat
Sign Up
Sign In
Light
Dark
System
Aritra Banik
Follow
Share
Generating author description...
All published works
Action
Title
Year
Authors
+
Dominator Coloring and CD Coloring in Almost Cluster Graphs
2025
Aritra Banik
Prahlad Narasimhan Kasthurirangan
Venkatesh Raman
+
PDF
Chat
Multivariate Exploration of Metric Dilation
2025
Aritra Banik
Fedor V. Fomin
Petr A. Golovach
Tanmay Inamdar
Satyabrata Jana
Saket Saurabh
+
PDF
Chat
Cuts in Graphs with Matroid Constraints
2024
Aritra Banik
Fedor V. Fomin
Petr A. Golovach
Tanmay Inamdar
Satyabrata Jana
Saket Saurabh
+
PDF
Chat
Minimum Consistent Subset in Trees and Interval Graphs
2024
Aritra Banik
Sayani Das
Anil Maheshwari
Bubai Manna
Subhas C. Nandy
Krishna Priya K M
Bodhayan Roy
Sasanka Roy
Abhishek Sahu
+
PDF
Chat
Conflict and Fairness in Resource Allocation
2024
Susobhan Bandopadhyay
Aritra Banik
Sushmita Gupta
Pallavi Jain
Abhishek Sahu
Saket Saurabh
Prafullkumar Tale
+
PDF
Chat
Dominator Coloring and CD Coloring in Almost Cluster Graphs
2023
Aritra Banik
Prahlad Narasimhan Kasthurirangan
Venkatesh Raman
+
On Colorful Vertex and Edge Cover Problems
2023
Sayan Bandyapadhyay
Aritra Banik
Sujoy Bhore
+
PDF
Chat
Structural parameterizations of budgeted graph coloring
2022
Susobhan Bandopadhyay
Suman Banerjee
Aritra Banik
Venkatesh Raman
+
PDF
Chat
Structural Parameterizations of Budgeted Graph Coloring
2022
Susobhan Bandopadhyay
Suman Banerjee
Aritra Banik
Venkatesh Raman
+
Parameterized Complexity of Graph Partitioning into Connected Clusters
2022
Ankit Abhinav
Susobhan Bandopadhyay
Aritra Banik
Saket Saurabh
+
PDF
Chat
Structural Parameterizations of Budgeted Graph Coloring
2022
Susobhan Bandopadhyay
Suman Banerjee
Aritra Banik
Venkatesh Raman
+
Dominator Coloring and CD Coloring in Almost Cluster Graphs
2022
Aritra Banik
Prahlad Narasimhan Kasthurirangan
Venkatesh Raman
+
PDF
Chat
Geometric systems of unbiased representatives
2021
Aritra Banik
Bhaswar B. Bhattacharya
Sujoy Bhore
Leonardo MartĂnez-Sandoval
+
PDF
Chat
Geometric planar networks on bichromatic collinear points
2021
Sayan Bandyapadhyay
Aritra Banik
Sujoy Bhore
Martin Nöllenburg
+
Structural Parameterizations of Budgeted Graph Coloring
2021
Susobhan Bandopadhyay
Suman Banerjee
Aritra Banik
Venkatesh Raman
+
Fixed-Parameter Tractability of (n â k) List Coloring
2020
Aritra Banik
Ashwin Jacob
Vijay Paliwal
Venkatesh Raman
+
Fixed-parameter tractable algorithms for Tracking Shortest Paths
2020
Aritra Banik
Pratibha Choudhary
Venkatesh Raman
Saket Saurabh
+
Geometric Systems of Unbiased Representatives
2020
Aritra Banik
Bhaswar B. Bhattacharya
Sujoy Bhore
Leonardo MartĂnez-Sandoval
+
Geometric Systems of Unbiased Representatives
2020
Aritra Banik
Bhaswar B. Bhattacharya
Sujoy Bhore
Leonardo MartĂnez-Sandoval
+
Fixed-parameter tractable algorithms for Tracking Shortest Paths
2020
Aritra Banik
Pratibha Choudhary
Venkatesh Raman
Saket Saurabh
+
PDF
Chat
Geometric Planar Networks on Bichromatic Points
2020
Sayan Bandyapadhyay
Aritra Banik
Sujoy Bhore
Martin Nöllenburg
+
Fixed-parameter tractable algorithms for Tracking Shortest Paths
2020
Aritra Banik
Pratibha Choudhary
Venkatesh Raman
Saket Saurabh
+
Geometric Systems of Unbiased Representatives
2020
Aritra Banik
Bhaswar B. Bhattacharya
Sujoy Bhore
Leonardo MartĂnez-Sandoval
+
Geometric Planar Networks on Bichromatic Points
2019
Sayan Bandyapadhyay
Aritra Banik
Sujoy Bhore
Martin Nöllenburg
+
Fixed-Parameter Tractability of $$(n-k)$$ List Coloring
2019
Aritra Banik
Ashwin Jacob
Vijay Paliwal
Venkatesh Raman
+
PDF
Chat
Polynomial Time Algorithms for Bichromatic Problems
2017
Sayan Bandyapadhyay
Aritra Banik
+
Network Optimization on Partitioned Pairs of Points
2017
Esther M. Arkin
Aritra Banik
Paz Carmi
Gui Citovsky
Su Jia
Matthet J. Katz
Tyler Mayer
Joseph S. B. Mitchell
+
Polynomial Time Algorithms for Bichromatic Problems
2016
Sayan Bandyapadhyay
Aritra Banik
+
The $p$-Center Problem in Tree Networks Revisited
2016
Aritra Banik
Binay Bhattacharya
Sandip Das
Tsunehiko Kameda
Zhao Song
+
Polynomial Time Algorithms for Bichromatic Problems
2016
Sayan Bandyapadhyay
Aritra Banik
+
Discrete Voronoi Games and $\epsilon$-Nets, in Two and Three Dimensions
2015
Aritra Banik
Jean-Lou De Carufel
Anil Maheshwari
Michiel Smid
+
Discrete Voronoi Games and $Δ$-Nets, in Two and Three Dimensions
2015
Aritra Banik
Jean-Lou De Carufel
Anil Maheshwari
Michiel Smid
+
Voronoi Game on Graphs
2014
Sayan Bandyapadhyay
Aritra Banik
Sandip Das
Hirak Sarkar
+
Minimum enclosing circle of a set of fixed points and a mobile point
2014
Aritra Banik
Bhaswar B. Bhattacharya
Sandip Das
+
On Packing Almost Half of a Square with Anchored Rectangles: A Constructive Approach
2014
Sandip Banerjee
Aritra Banik
Bhargab B. Bhattacharya
Arijit Bishnu
Soumyottam Chatterjee
+
Voronoi Game on Graphs
2014
Sayan Bandyapadhyay
Aritra Banik
Sandip Das
Hirak Sarkar
+
An Existential Proof of the Conjecture on Packing Anchored Rectangles
2013
Sandip Banerjee
Aritra Banik
Bhargab B. Bhattacharya
Arijit Bishnu
Soumyottam Chatterjee
+
PDF
Chat
Minimum Enclosing Circle of a Set of Fixed Points and a Mobile Point
2011
Aritra Banik
Bhaswar B. Bhattacharya
Sandip Das
Common Coauthors
Coauthor
Papers Together
Venkatesh Raman
12
Sayan Bandyapadhyay
9
Sujoy Bhore
8
Saket Saurabh
7
Bhaswar B. Bhattacharya
6
Susobhan Bandopadhyay
6
Sandip Das
4
Suman Banerjee
4
Leonardo MartĂnez-Sandoval
4
Prahlad Narasimhan Kasthurirangan
3
Martin Nöllenburg
3
Anil Maheshwari
3
Pratibha Choudhary
2
Satyabrata Jana
2
Soumyottam Chatterjee
2
Vijay Paliwal
2
Hirak Sarkar
2
Jean-Lou De Carufel
2
Petr A. Golovach
2
Ashwin Jacob
2
Tanmay Inamdar
2
Bhargab B. Bhattacharya
2
Fedor V. Fomin
2
Sandip Banerjee
2
Arijit Bishnu
2
Michiel Smid
2
Tsunehiko Kameda
1
Su Jia
1
Ankit Abhinav
1
Paz Carmi
1
Binay Bhattacharya
1
Gui Citovsky
1
Sandip Das
1
Sushmita Gupta
1
Abhishek Sahu
1
Pallavi Jain
1
Bubai Manna
1
Krishna Priya K M
1
Bodhayan Roy
1
Sasanka Roy
1
Matthet J. Katz
1
Pratibha Choudhary
1
Sayani Das
1
Esther M. Arkin
1
Prafullkumar Tale
1
Tyler Mayer
1
Abhishek Sahu
1
Subhas C. Nandy
1
Joseph S. B. Mitchell
1
Zhao Song
1
Commonly Cited References
Action
Title
Year
Authors
# of times referenced
+
PDF
Chat
Parameterized Pre-Coloring Extension and List Coloring Problems
2021
Gregory Gutin
Diptapriyo Majumdar
Sebastian Ordyniak
Magnus Wahlström
6
+
PDF
Chat
Set Partitioning via Inclusion-Exclusion
2009
Andreas Björklund
Thore Husfeldt
Mikko Koivisto
4
+
PDF
Chat
Data reduction for graph coloring problems
2013
Bart M. P. Jansen
Stefan Kratsch
4
+
PDF
Chat
Kernelization Lower Bounds by Cross-Composition
2014
Hans L. Bodlaender
Bart Jansen
Stefan Kratsch
3
+
PDF
Chat
Between Treewidth and Clique-Width
2015
Sigve Hortemo SĂŠther
Jan Arne Telle
3
+
Bichromatic 2-center of pairs of points
2014
Esther M. Arkin
JosĂ© Miguel DĂaz-Båñez
FerrĂĄn Hurtado
Piyush Kumar
Joseph S. B. Mitchell
Belén Palop
Pablo PĂ©rez-Lantero
Maria Saumell
Rodrigo I. Silveira
3
+
The book thickness of a graph
1979
Frank R. Bernhart
Paul C. Kainen
3
+
PDF
Chat
Approximating the bottleneck plane perfect matching of a point set
2015
A. Karim Abu-Affash
Ahmad Biniaz
Paz Carmi
Anil Maheshwari
Michiel Smid
3
+
Equitable Coloring of Trees
1994
BorâLiang Chen
KoâWei Lih
3
+
PDF
Chat
Plane Bichromatic Trees of Low Degree
2017
Ahmad Biniaz
Prosenjit Bose
Anil Maheshwari
Michiel Smid
3
+
PDF
Chat
On the dominator colorings in trees
2012
Mustapha Chellali
Hocine Boumediene Merouane
2
+
Cluster Vertex Deletion: A Parameterization between Vertex Cover and Clique-Width
2012
Martin Doucha
Jan KratochvıÌl
2
+
Probabilistic algorithms for sparse polynomials
1979
Richard Zippel
2
+
Equitable and m-bounded coloring of split graphs
1996
Bor-Liang Chen
MingâTat Ko
KoâWei Lih
2
+
Algorithmic Aspects of Dominator Colorings in Graphs
2011
S. Arumugam
Kameshwar Chandrasekar
Neeldhara Misra
Geevarghese Philip
Saket Saurabh
2
+
On the dominator coloring in proper interval graphs and block graphs
2015
B. S. Panda
Arti Pandey
2
+
PDF
Chat
Identifying Vertex Covers in Graphs
2012
Michael A. Henning
Anders Yeo
2
+
On balanced 4-holes in bichromatic point sets
2014
Sergey Bereg
JosĂ© Miguel DĂaz-Båñez
Ruy FabilaâMonroy
Pablo PĂ©rez-Lantero
A. RamĂrez-Vigueras
Toshinori Sakai
Jorge Urrutia
Inmaculada Ventura
2
+
Total Dominator Colorings and Total Domination in Graphs
2014
Michael A. Henning
2
+
PDF
Chat
Precoloring extension. I. Interval graphs
1992
MiklĂłs BĂrĂł
MihĂĄly Hujter
Zs. Tuza
2
+
PDF
Chat
(Non-)existence of polynomial kernels for the Test Cover problem
2012
Gregory Gutin
Gabriele Muciaccia
Anders Yeo
2
+
PDF
Chat
Parameterizations of Test Cover with Bounded Test Sizes
2014
Robert Crowston
Gregory Gutin
Mark Jones
Gabriele Muciaccia
Anders Yeo
2
+
The Complexity of Enumeration and Reliability Problems
1979
Leslie G. Valiant
2
+
PDF
Chat
Parameterized complexity of vertex colouring
2003
Leizhen Cai
2
+
Towards fully multivariate algorithmics: Parameter ecology and the deconstruction of computational complexity
2012
Michael R. Fellows
Bart M. P. Jansen
Frances Rosamond
2
+
Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
1983
Nimrod Megiddo
2
+
Planar Case of the Maximum Box and Related Problems
2003
Ying Liu
Mikhail Nediak
2
+
Balanced partitions of 3-colored geometric sets in the plane
2014
Sergey Bereg
FerrĂĄn Hurtado
Mikio KanĆ
Matias Korman
Dolores Lara
Carlos Seara
Rodrigo I. Silveira
Jorge Urrutia
Kevin Verbeek
2
+
PDF
Chat
On the Dominator Colorings in Bipartite Graphs
2007
Ralucca Gera
2
+
PDF
Chat
Plane Bichromatic Trees of Low Degree
2016
Ahmad Biniaz
Prosenjit Bose
Anil Maheshwari
Michiel Smid
2
+
PDF
Chat
Open Problems on Graph Coloring for Special Graph Classes
2016
Daniël Paulusma
2
+
PDF
Chat
Parameterized and approximation complexity of Partial VC Dimension
2018
Cristina Bazgan
Florent Foucaud
Florian Sikora
2
+
On some domination colorings of graphs
2017
Guillaume Bagan
Houcine Boumediene-Merouane
Mohammed Haddad
Hamamache Kheddouci
2
+
Improved Kernels for Tracking Path Problems.
2020
Pratibha Choudhary
Venkatesh Raman
2
+
PDF
Chat
Structural Parameterizations for Equitable Coloring
2020
Guilherme C. M. Gomes
Matheus R. Guedes
VinĂcius Fernandes dos Santos
2
+
PDF
Chat
Parameterized and exact algorithms for class domination coloring
2020
R. Krithika
Ashutosh Rai
Saket Saurabh
Prafullkumar Tale
2
+
PDF
Chat
On Problems as Hard as CNF-SAT
2016
Marek Cygan
Holger Dell
Daniel Lokshtanov
DĂĄniel Marx
Jesper Nederlof
Yoshio Okamoto
Ramamohan Paturi
Saket Saurabh
Magnus Wahlström
1
+
Unsolved problems in geometry
1991
H. T. Croft
K. J. Falconer
Richard K. Guy
1
+
PDF
Chat
Spanning Trees in Multipartite Geometric Graphs
2017
Ahmad Biniaz
Prosenjit Bose
David Eppstein
Anil Maheshwari
Pat Morin
Michiel Smid
1
+
PDF
Chat
Structural Parameterizations of Budgeted Graph Coloring
2022
Susobhan Bandopadhyay
Suman Banerjee
Aritra Banik
Venkatesh Raman
1
+
Minimal completely separating systems
1970
Joel Spencer
1
+
Bisecting and <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="mml1" display="inline" overflow="scroll" altimg="si1.gif"><mml:mi>D</mml:mi></mml:math>-secting families for set systems
2017
Niranjan Balachandran
Rogers Mathew
Tapas Kumar Mishra
Sudebkumar Prasant Pal
1
+
PDF
Chat
Structural parameterizations of budgeted graph coloring
2022
Susobhan Bandopadhyay
Suman Banerjee
Aritra Banik
Venkatesh Raman
1
+
Parameterized Study of the Test Cover Problem
2012
Robert Crowston
Gregory Gutin
Mark Jones
Saket Saurabh
Anders Yeo
1
+
Approximation Algorithms for Generalized MST and TSP in Grid Clusters
2015
Binay Bhattacharya
Ante ÄustiÄ
Akbar Rafiey
Arash Rafiey
Vladyslav Sokol
1
+
Approximation Schemes for Maximum Weight Independent Set of Rectangles
2013
Anna Adamaszek
Andreas Wiese
1
+
Fixed-Parameter Tractability of $$(n-k)$$ List Coloring
2019
Aritra Banik
Ashwin Jacob
Vijay Paliwal
Venkatesh Raman
1
+
PDF
Chat
A Doubly Exponentially Crumbled Cake
2011
Tobias Christ
Andrea Francke
Heidi Gebauer
JiĆÄ±Ì MatouĆĄek
Takeaki Uno
1
+
Tracking Paths in Planar Graphs
2019
David Eppstein
Michael T. Goodrich
James A. Liu
Pedro Matias
1
+
Tracking Paths in Planar Graphs
2019
David Eppstein
Michael T. Goodrich
James A. Liu
Pedro Matias
1