Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAbhiruk Lahiri
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j7]Minati De
, Abhiruk Lahiri:
Geometric dominating-set and set-cover via local-search. Comput. Geom. 113: 102007 (2023)- [j6]Elad Aigner-Horev, Dan Hefetz, Abhiruk Lahiri:
Rainbow trees in uniformly edge-colored graphs. Random Struct. Algorithms 62(2): 287-303 (2023) - [c6]Sandip Banerjee, Rajesh Chitnis, Abhiruk Lahiri:
How Does Fairness Affect the Complexity of Gerrymandering? AAMAS 2023: 2869-2871 - 2022
- [j5]L. Sunil Chandran, Abhiruk Lahiri, Nitin Singh:
Improved approximation for maximum edge colouring problem. Discret. Appl. Math. 319: 42-52 (2022) - [j4]Abhiruk Lahiri, Joydeep Mukherjee, C. R. Subramanian:
On approximating MIS over B1-VPG graphs*. Discret. Math. Algorithms Appl. 14(7): 2250035:1-2250035:13 (2022) - [c5]Kshitij Gajjar, Agastya Vibhuti Jha, Manish Kumar, Abhiruk Lahiri:
Reconfiguring Shortest Paths in Graphs. AAAI 2022: 9758-9766 - [c4]Zdenek Dvorák, Daniel Gonçalves, Abhiruk Lahiri, Jane Tan, Torsten Ueckerdt:
On Comparable Box Dimension. SoCG 2022: 38:1-38:14 - [c3]Abhiruk Lahiri, Ilan Newman, Nithin Varma:
Parameterized Convexity Testing. SOSA 2022: 174-181 - [i9]Zdenek Dvorák, Daniel Gonçalves, Abhiruk Lahiri, Jane Tan, Torsten Ueckerdt:
On Comparable Box Dimension. CoRR abs/2203.07686 (2022) - 2021
- [c2]Zdenek Dvorák, Abhiruk Lahiri:
Approximation Schemes for Bounded Distance Problems on Fractionally Treewidth-Fragile Graphs. ESA 2021: 40:1-40:10 - [i8]Zdenek Dvorák, Abhiruk Lahiri:
Approximation schemes for bounded distance problems on fractionally treewidth-fragile graphs. CoRR abs/2105.01780 (2021) - [i7]Abhiruk Lahiri, Ilan Newman, Nithin Varma:
Parameterized Convexity Testing. CoRR abs/2110.13012 (2021) - [i6]Kshitij Gajjar, Agastya Vibhuti Jha, Manish Kumar, Abhiruk Lahiri:
Reconfiguring Shortest Paths in Graphs. CoRR abs/2112.07499 (2021) - 2020
- [j3]Dror Epstein, Martin Charles Golumbic, Abhiruk Lahiri, Gila Morgenstern:
Hardness and approximation for L-EPG and B1-EPG graphs. Discret. Appl. Math. 281: 224-228 (2020)
2010 – 2019
- 2019
- [i5]L. Sunil Chandran, Abhiruk Lahiri, Nitin Singh:
Improved Approximation for Maximum Edge Colouring Problem. CoRR abs/1910.11753 (2019) - [i4]Abhiruk Lahiri, Joydeep Mukherjee, C. R. Subramanian:
Approximating MIS over equilateral B1-VPG graphs. CoRR abs/1912.07957 (2019) - 2017
- [j2]Arpitha P. Bharathi, Minati De, Abhiruk Lahiri:
Circular Separation Dimension of a Subclass of Planar Graphs. Discret. Math. Theor. Comput. Sci. 19(3) (2017) - 2016
- [j1]Mathew C. Francis, Abhiruk Lahiri:
VPG and EPG bend-numbers of Halin graphs. Discret. Appl. Math. 215: 95-105 (2016) - [i3]Minati De, Abhiruk Lahiri:
Geometric Dominating Set and Set Cover via Local Search. CoRR abs/1605.02499 (2016) - [i2]Arpitha P. Bharathi, Minati De, Abhiruk Lahiri:
Circular Separation Dimension of a Subclass of Planar Graphs. CoRR abs/1612.09436 (2016) - 2015
- [c1]Abhiruk Lahiri, Joydeep Mukherjee, C. R. Subramanian:
Maximum Independent Set on B_1 B 1 -VPG Graphs. COCOA 2015: 633-646 - [i1]Mathew C. Francis, Abhiruk Lahiri:
VPG and EPG bend-numbers of Halin Graphs. CoRR abs/1505.06036 (2015)
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).
load content from web.archive.org
Privacy notice: By enabling the option above, your browser will contact the API of web.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 2023-06-05 00:53 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:
