default search action
Anurag Murty Naredla
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c8]Abbas Mehrabian, Ankit Anand, Hyunjik Kim, Nicolas Sonnerat, Matej Balog, Gheorghe Comanici, Tudor Berariu, Andrew Lee, Anian Ruoss, Anna Bulanova, Daniel Toyama, Sam Blackwell, Bernardino Romera-Paredes, Petar Velickovic, Laurent Orseau, Joonkyung Lee, Anurag Murty Naredla, Doina Precup, Adam Zsolt Wagner:
Finding Increasingly Large Extremal Graphs with AlphaZero and Tabu Search. IJCAI 2024: 6985-6993 - 2023
- [c7]Anna Lubiw, Anurag Murty Naredla:
The Geodesic Edge Center of a Simple Polygon. SoCG 2023: 49:1-49:15 - [i7]Anna Lubiw, Anurag Murty Naredla:
The geodesic edge center of a simple polygon. CoRR abs/2303.09702 (2023) - [i6]Abbas Mehrabian, Ankit Anand, Hyunjik Kim, Nicolas Sonnerat, Matej Balog, Gheorghe Comanici, Tudor Berariu, Andrew Lee, Anian Ruoss, Anna Bulanova, Daniel Toyama, Sam Blackwell, Bernardino Romera-Paredes, Petar Velickovic, Laurent Orseau, Joonkyung Lee, Anurag Murty Naredla, Doina Precup, Adam Zsolt Wagner:
Finding Increasingly Large Extremal Graphs with AlphaZero and Tabu Search. CoRR abs/2311.03583 (2023) - 2022
- [j1]Ahmad Biniaz, Kshitij Jain, Anna Lubiw, Zuzana Masárová, Tillmann Miltzow, Debajyoti Mondal, Anurag Murty Naredla, Josef Tkadlec, Alexi Turcotte:
Token Swapping on Trees. Discret. Math. Theor. Comput. Sci. 24(2) (2022) - [c6]Rathish Das, Meng He
, Eitan Kondratovsky, J. Ian Munro, Anurag Murty Naredla, Kaiyu Wu:
Shortest Beer Path Queries in Interval Graphs. ISAAC 2022: 59:1-59:17 - [i5]Rathish Das, Meng He
Shortest Beer Path Queries in Interval Graphs. CoRR abs/2209.14401 (2022) - 2021
- [c5]Therese Biedl, Anna Lubiw, Anurag Murty Naredla, Peter Dominik Ralbovsky, Graeme Stroud:
Distant Representatives for Rectangles in the Plane. ESA 2021: 17:1-17:18 - [c4]Anna Lubiw, Anurag Murty Naredla:
The Visibility Center of a Simple Polygon. ESA 2021: 65:1-65:14 - [c3]Therese Biedl, Anna Lubiw, Anurag Murty Naredla, Peter Dominik Ralbovsky, Graeme Stroud:
Dispersion for Intervals: A Geometric Approach. SOSA 2021: 37-44 - [i4]Anna Lubiw, Anurag Murty Naredla:
The Visibility Center of a Simple Polygon. CoRR abs/2108.07366 (2021) - [i3]Therese Biedl, Anna Lubiw, Anurag Murty Naredla, Peter Dominik Ralbovsky, Graeme Stroud:
Distant Representatives for Rectangles in the Plane. CoRR abs/2108.07751 (2021) - 2020
- [i2]Therese Biedl, Pavle Bulatovic, Veronika Irvine, Anna Lubiw, Owen D. Merkel, Anurag Murty Naredla:
Reconstructing a Polyhedron between Polygons in Parallel Slices. CoRR abs/2004.05946 (2020)
2010 – 2019
- 2019
- [c2]Therese Biedl, Pavle Bulatovic, Veronika Irvine, Anna Lubiw, Owen D. Merkel, Anurag Murty Naredla:
Reconstructing a Polyhedron between Polygons in Parallel Slices. CCCG 2019: 139-145 - [i1]Ahmad Biniaz, Kshitij Jain, Anna Lubiw, Zuzana Masárová, Tillmann Miltzow, Debajyoti Mondal, Anurag Murty Naredla, Josef Tkadlec, Alexi Turcotte:
Token Swapping on Trees. CoRR abs/1903.06981 (2019) - 2018
- [c1]Therese Biedl, Ahmad Biniaz, Veronika Irvine, Philipp Kindermann, Anurag Murty Naredla, Alexi Turcotte:
Integral Unit Bar-Visibility Graphs. CCCG 2018: 230-246
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-21 20:30 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: