default search action
Rajesh Hemant Chitnis
Person information
- affiliation: Weizmann Institute of Science, Israel
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [i22]Rajesh Chitnis, Samuel Thomas, Anthony Wirth:
Lower Bounds for Approximate (& Exact) k-Disjoint-Shortest-Paths. CoRR abs/2408.03933 (2024) - 2023
- [j13]Rajesh Chitnis
:
A Tight Lower Bound for Edge-Disjoint Paths on Planar DAGs. SIAM J. Discret. Math. 37(2): 556-572 (2023) - [c28]Sandip Banerjee, Rajesh Chitnis, Abhiruk Lahiri:
How Does Fairness Affect the Complexity of Gerrymandering? AAMAS 2023: 2869-2871 - [c27]Xiuge Chen
Sublinear-Space Streaming Algorithms for Estimating Graph Parameters on Sparse Graphs. WADS 2023: 247-261 - [i21]Xiuge Chen, Rajesh Chitnis, Patrick Eades, Anthony Wirth:
Sublinear-Space Streaming Algorithms for Estimating Graph Parameters on Sparse Graphs. CoRR abs/2305.16815 (2023) - 2022
- [c26]Rajesh Chitnis:
Refined Lower Bounds for Nearest Neighbor Condensation. ALT 2022: 262-281 - [c25]Rajesh Chitnis
Tight Lower Bounds for Approximate & Exact k-Center in ℝd. SoCG 2022: 28:1-28:15 - [i20]Rajesh Chitnis, Nitin Saurabh:
Tight Lower Bounds for Approximate & Exact k-Center in Rd. CoRR abs/2203.08328 (2022) - 2021
- [j12]Rajesh Chitnis
Parameterized Approximation Algorithms for Bidirected Steiner Network Problems. ACM Trans. Algorithms 17(2): 12:1-12:68 (2021) - [c24]Rajesh Chitnis:
A Tight Lower Bound for Edge-Disjoint Paths on Planar DAGs. CIAC 2021: 187-201 - [i19]Rajesh Chitnis:
A Tight Lower Bound for Edge-Disjoint Paths on Planar DAGs. CoRR abs/2101.10742 (2021) - 2020
- [j11]Rajesh Hemant Chitnis
Tight Bounds for Planar Strongly Connected Steiner Subgraph with Fixed Number of Terminals (and Extensions). SIAM J. Comput. 49(2): 318-364 (2020)
2010 – 2019
- 2019
- [j10]Rajesh Chitnis
A Tight Lower Bound for Planar Steiner Orientation. Algorithmica 81(8): 3200-3216 (2019) - [c23]Rajesh Chitnis
Towards a Theory of Parameterized Streaming Algorithms. IPEC 2019: 7:1-7:15 - [c22]Rajesh Chitnis
FPT Inapproximability of Directed Cut and Connectivity Problems. IPEC 2019: 8:1-8:20 - [i18]Rajesh Chitnis, Andreas Emil Feldmann:
FPT Inapproximability of Directed Cut and Connectivity Problems. CoRR abs/1910.01934 (2019) - [i17]Rajesh Chitnis, Graham Cormode:
Towards a Theory of Parameterized Streaming Algorithms. CoRR abs/1911.09650 (2019) - [i16]Rajesh Chitnis, Andreas Emil Feldmann, MohammadTaghi Hajiaghayi, Dániel Marx:
Tight Bounds for Planar Strongly Connected Steiner Subgraph with Fixed Number of Terminals (and Extensions). CoRR abs/1911.13161 (2019) - 2018
- [c21]Rajesh Chitnis
A Tight Lower Bound for Steiner Orientation. CSR 2018: 65-77 - [c20]Rajesh Chitnis
Can We Create Large k-Cores by Adding Few Edges? CSR 2018: 78-89 - [c19]Rajesh Chitnis
Parameterized Approximation Algorithms for Bidirected Steiner Network Problems. ESA 2018: 20:1-20:16 - [c18]Sandip Banerjee
Algorithms and Hardness Results for Nearest Neighbor Problems in Bicolored Point Sets. LATIN 2018: 80-93 - 2017
- [j9]Rajesh Chitnis
A Tight Algorithm for Strongly Connected Steiner Subgraph on Two Terminals with Demands. Algorithmica 77(4): 1216-1239 (2017) - [j8]Rajesh Chitnis
List H-Coloring a Graph by Removing Few Vertices. Algorithmica 78(1): 110-146 (2017) - [j7]Rajesh Chitnis
Faster exact algorithms for some terminal set problems. J. Comput. Syst. Sci. 88: 195-207 (2017) - [i15]Rajesh Chitnis, Andreas Emil Feldmann, Pasin Manurangsi:
Parameterized Approximation Algorithms for Directed Steiner Network Problems. CoRR abs/1707.06499 (2017) - 2016
- [j6]Rajesh Chitnis
Parameterized complexity of the anchored k-core problem for directed graphs. Inf. Comput. 247: 11-22 (2016) - [j5]Rajesh Chitnis
Designing FPT Algorithms for Cut Problems Using Randomized Contractions. SIAM J. Comput. 45(4): 1171-1229 (2016) - [c17]Rajesh Chitnis
Kernelization via Sampling with Applications to Finding Matchings and Related Problems in Dynamic Graph Streams. SODA 2016: 1326-1344 - [c16]Rajesh Chitnis
Tight Bounds for Gomory-Hu-like Cut Counting. WG 2016: 133-144 - [r1]Rajesh Chitnis, Mohammad Taghi Hajiaghayi:
Shadowless Solutions for Fixed-Parameter Tractability of Directed Graphs. Encyclopedia of Algorithms 2016: 1963-1966 - 2015
- [j4]Rajesh Hemant Chitnis:
Review of: Fundamentals of Parameterized Complexity by Rodney G. Downey and Michael R. Fellows. SIGACT News 46(1): 23-26 (2015) - [j3]Rajesh Hemant Chitnis
Directed Subset Feedback Vertex Set Is Fixed-Parameter Tractable. ACM Trans. Algorithms 11(4): 28:1-28:28 (2015) - [c15]Rajesh Hemant Chitnis
Parameterized Streaming: Maximal Matching and Vertex Cover. SODA 2015: 1234-1251 - [c14]Rajesh Hemant Chitnis
Brief Announcement: New Streaming Algorithms for Parameterized Maximal Matching & Beyond. SPAA 2015: 56-58 - [i14]Rajesh Hemant Chitnis, Graham Cormode, Hossein Esfandiari, MohammadTaghi Hajiaghayi, Andrew McGregor, Morteza Monemizadeh, Sofya Vorotnikova:
Kernelization via Sampling with Applications to Dynamic Graph Streams. CoRR abs/1505.01731 (2015) - [i13]Rajesh Hemant Chitnis, Hossein Esfandiari, MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz, Saeed Seddighin:
A Tight Algorithm for Strongly Connected Steiner Subgraph On Two Terminals With Demands. CoRR abs/1506.03760 (2015) - [i12]Rajesh Chitnis, Lior Kamma, Robert Krauthgamer:
Tight Bounds for Gomory-Hu-like Cut Counting. CoRR abs/1511.08647 (2015) - 2014
- [c13]Rajesh Hemant Chitnis
A Tight Algorithm for Strongly Connected Steiner Subgraph on Two Terminals with Demands (Extended Abstract). IPEC 2014: 159-171 - [c12]Rajesh Hemant Chitnis, MohammadTaghi Hajiaghayi, Dániel Marx:
Tight Bounds for Planar Strongly Connected Steiner Subgraph with Fixed Number of Terminals (and Extensions). SODA 2014: 1782-1801 - [i11]Rajesh Hemant Chitnis, Graham Cormode, Mohammad Taghi Hajiaghayi, Morteza Monemizadeh:
Parameterized Streaming Algorithms for Vertex Cover. CoRR abs/1405.0093 (2014) - 2013
- [j2]L. Sunil Chandran, Rajesh Hemant Chitnis
On the SIG-Dimension of Trees Under the L ∞-Metric. Graphs Comb. 29(4): 773-794 (2013) - [j1]Rajesh Hemant Chitnis
Fixed-Parameter Tractability of Directed Multiway Cut Parameterized by the Size of the Cutset. SIAM J. Comput. 42(4): 1674-1696 (2013) - [c11]Rajesh Hemant Chitnis, Fedor V. Fomin, Petr A. Golovach:
Preventing Unraveling in Social Networks Gets Harder. AAAI 2013: 1085-1091 - [c10]Rajesh Hemant Chitnis
List H-Coloring a Graph by Removing Few Vertices. ESA 2013: 313-324 - [c9]Rajesh Hemant Chitnis
Parameterized Complexity of the Anchored k-Core Problem for Directed Graphs. FSTTCS 2013: 79-90 - [c8]Rajesh Hemant Chitnis
Fixed-Parameter and Approximation Algorithms: A New Look. IPEC 2013: 110-122 - [c7]Rajesh Hemant Chitnis
Faster Exact Algorithms for Some Terminal Set Problems. IPEC 2013: 150-162 - [c6]Rajesh Hemant Chitnis, MohammadTaghi Hajiaghayi, Jonathan Katz, Koyel Mukherjee:
Brief announcement: a game-theoretic model motivated by the darpa network challenge. SPAA 2013: 115-118 - [i10]Rajesh Hemant Chitnis, Fedor V. Fomin, Petr A. Golovach:
Parameterized Complexity of the Anchored k-Core Problem for Directed Graphs. CoRR abs/1304.5870 (2013) - [i9]Rajesh Hemant Chitnis, Fedor V. Fomin, Petr A. Golovach:
Preventing Unraveling in Social Networks Gets Harder. CoRR abs/1304.6420 (2013) - [i8]Rajesh Hemant Chitnis, László Egri, Dániel Marx:
List H-Coloring a Graph by Removing Few Vertices. CoRR abs/1308.1068 (2013) - [i7]Rajesh Hemant Chitnis, MohammadTaghi Hajiaghayi, Guy Kortsarz:
Fixed-Parameter and Approximation Algorithms: A New Look. CoRR abs/1308.3520 (2013) - 2012
- [c5]Rajesh Hemant Chitnis
Designing FPT Algorithms for Cut Problems Using Randomized Contractions. FOCS 2012: 460-469 - [c4]Rajesh Hemant Chitnis
Directed Subset Feedback Vertex Set Is Fixed-Parameter Tractable. ICALP (1) 2012: 230-241 - [c3]Rajesh Hemant Chitnis, MohammadTaghi Hajiaghayi, Dániel Marx:
Fixed-parameter tractability of directed multiway cut parameterized by the size of the cutset. SODA 2012: 1713-1725 - [i6]Rajesh Hemant Chitnis, MohammadTaghi Hajiaghayi, Jonathan Katz, Koyel Mukherjee:
A Game-Theoretic Model Motivated by the DARPA Network Challenge. CoRR abs/1204.6552 (2012) - [i5]Rajesh Hemant Chitnis, Marek Cygan, MohammadTaghi Hajiaghayi, Dániel Marx:
Directed Subset Feedback Vertex Set is Fixed-Parameter Tractable. CoRR abs/1205.1271 (2012) - [i4]Rajesh Hemant Chitnis, Marek Cygan, MohammadTaghi Hajiaghayi, Marcin Pilipczuk, Michal Pilipczuk:
Designing FPT algorithms for cut problems using randomized contractions. CoRR abs/1207.4079 (2012) - 2011
- [c2]Rajesh Hemant Chitnis, MohammadTaghi Hajiaghayi, Vahid Liaghat:
Parameterized Complexity of Problems in Coalitional Resource Games. AAAI 2011: 620-625 - [i3]Rajesh Hemant Chitnis, MohammadTaghi Hajiaghayi, Vahid Liaghat:
Parameterized Complexity of Problems in Coalitional Resource Games. CoRR abs/1105.0707 (2011) - [i2]Rajesh Hemant Chitnis, MohammadTaghi Hajiaghayi, Dániel Marx:
Fixed-Parameter Tractability of Directed Multiway Cut Parameterized by the Size of the Cutset. CoRR abs/1110.0259 (2011) - 2010
- [c1]Abhijin Adiga, Rajesh Hemant Chitnis
Parameterized Algorithms for Boxicity. ISAAC (1) 2010: 366-377
2000 – 2009
- 2009
- [i1]L. Sunil Chandran, Rajesh Chitnis, Ramanjit Kumar:
On the SIG dimension of trees under $L_{\infty}$ metric. CoRR abs/0910.5380 (2009)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:13 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: