Biniaz, Ahmad; Maheshwari, Anil; Smid, Michiel Euclidean maximum matchings in the plane – local to global. (English) Zbl 07498677 Lubiw, Anna (ed.) et al., Algorithms and data structures. 17th international symposium, WADS 2021, virtual event, August 9–11, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12808, 186-199 (2021). MSC: 68P05 68Wxx PDFBibTeX XMLCite \textit{A. Biniaz} et al., Lect. Notes Comput. Sci. 12808, 186--199 (2021; Zbl 07498677) Full Text: DOI
Akitaya, Hugo A.; Biniaz, Ahmad; Bose, Prosenjit; De Carufel, Jean-Lou; Maheshwari, Anil; da Silveira, Luís Fernando Schultz Xavier; Smid, Michiel The minimum moving spanning tree problem. (English) Zbl 07498665 Lubiw, Anna (ed.) et al., Algorithms and data structures. 17th international symposium, WADS 2021, virtual event, August 9–11, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12808, 15-28 (2021). MSC: 68P05 68Wxx PDFBibTeX XMLCite \textit{H. A. Akitaya} et al., Lect. Notes Comput. Sci. 12808, 15--28 (2021; Zbl 07498665) Full Text: DOI
Chanchary, Farah; Maheshwari, Anil; Smid, Michiel Window queries for intersecting objects, maximal points and approximations using coresets. (English) Zbl 1528.68090 Discrete Appl. Math. 305, 295-310 (2021). MSC: 68P05 68U05 PDFBibTeX XMLCite \textit{F. Chanchary} et al., Discrete Appl. Math. 305, 295--310 (2021; Zbl 1528.68090) Full Text: DOI
Biniaz, Ahmad; Cabello, Sergio; Carmi, Paz; De Carufel, Jean-Lou; Maheshwari, Anil; Mehrabi, Saeed; Smid, Michiel On the minimum consistent subset problem. (English) Zbl 1507.68318 Algorithmica 83, No. 7, 2273-2302 (2021). MSC: 68U05 68P05 68W40 PDFBibTeX XMLCite \textit{A. Biniaz} et al., Algorithmica 83, No. 7, 2273--2302 (2021; Zbl 1507.68318) Full Text: DOI arXiv
Acharyya, Ankush; Maheshwari, Anil; Nandy, Subhas C. Color-spanning localized query. (English) Zbl 1497.68513 Theor. Comput. Sci. 861, 85-101 (2021). MSC: 68U05 68P05 68P10 68W05 PDFBibTeX XMLCite \textit{A. Acharyya} et al., Theor. Comput. Sci. 861, 85--101 (2021; Zbl 1497.68513) Full Text: DOI arXiv
Chanchary, Farah; Maheshwari, Anil; Smid, Michiel Querying relational event graphs using colored range searching data structures. (English) Zbl 1453.68129 Discrete Appl. Math. 286, 51-61 (2020). MSC: 68R10 68P05 91D30 PDFBibTeX XMLCite \textit{F. Chanchary} et al., Discrete Appl. Math. 286, 51--61 (2020; Zbl 1453.68129) Full Text: DOI
Carmi, Paz; Chanchary, Farah; Maheshwari, Anil; Smid, Michiel The most likely object to be seen through a window. (English) Zbl 1458.68044 Int. J. Comput. Geom. Appl. 29, No. 4, 269-287 (2019). MSC: 68P05 60C05 68U05 PDFBibTeX XMLCite \textit{P. Carmi} et al., Int. J. Comput. Geom. Appl. 29, No. 4, 269--287 (2019; Zbl 1458.68044) Full Text: DOI
Bose, Prosenjit; Carmi, Paz; Keil, Mark J.; Maheshwari, Anil; Mehrabi, Saeed; Mondal, Debajyoti; Smid, Michiel Computing maximum independent set on outerstring graphs and their relatives. (English) Zbl 07152211 Friggstad, Zachary (ed.) et al., Algorithms and data structures. 16th international symposium, WADS 2019, Edmonton, AB, Canada, August 5–7, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11646, 211-224 (2019). MSC: 68P05 68Wxx PDFBibTeX XMLCite \textit{P. Bose} et al., Lect. Notes Comput. Sci. 11646, 211--224 (2019; Zbl 07152211) Full Text: DOI arXiv
Biniaz, Ahmad; Cabello, Sergio; Carmi, Paz; De Carufel, Jean-Lou; Maheshwari, Anil; Mehrabi, Saeed; Smid, Michiel On the minimum consistent subset problem. (English) Zbl 1498.68356 Friggstad, Zachary (ed.) et al., Algorithms and data structures. 16th international symposium, WADS 2019, Edmonton, AB, Canada, August 5–7, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11646, 155-167 (2019). MSC: 68U05 68P05 68W40 PDFBibTeX XMLCite \textit{A. Biniaz} et al., Lect. Notes Comput. Sci. 11646, 155--167 (2019; Zbl 1498.68356) Full Text: DOI arXiv
Acharyya, Ankush; Maheshwari, Anil; Nandy, Subhas C. Localized query: color spanning variations. (English) Zbl 1497.68512 Pal, Sudebkumar Prasant (ed.) et al., Algorithms and discrete applied mathematics. 5th international conference, CALDAM 2019, Kharagpur, India, February 14–16, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11394, 150-160 (2019). MSC: 68U05 68P05 68P10 68W05 PDFBibTeX XMLCite \textit{A. Acharyya} et al., Lect. Notes Comput. Sci. 11394, 150--160 (2019; Zbl 1497.68512) Full Text: DOI
Bint, Gregory; Maheshwari, Anil; Smid, Michiel; Nandy, Subhas C. Partial enclosure range searching. (English) Zbl 1458.68263 Int. J. Comput. Geom. Appl. 29, No. 1, 73-93 (2019). MSC: 68U05 68P05 PDFBibTeX XMLCite \textit{G. Bint} et al., Int. J. Comput. Geom. Appl. 29, No. 1, 73--93 (2019; Zbl 1458.68263) Full Text: DOI
Chanchary, Farah; Maheshwari, Anil Time windowed data structures for graphs. (English) Zbl 1407.05219 J. Graph Algorithms Appl. 23, No. 2, 191-226 (2019). MSC: 05C85 68P05 68R10 91D30 PDFBibTeX XMLCite \textit{F. Chanchary} and \textit{A. Maheshwari}, J. Graph Algorithms Appl. 23, No. 2, 191--226 (2019; Zbl 1407.05219) Full Text: DOI
Maheshwari, Anil; Nouri, Arash; Sack, Jörg-Rüdiger Rectilinear shortest paths among transient obstacles. (English) Zbl 1521.68240 Kim, Donghyun (ed.) et al., Combinatorial optimization and applications. 12th international conference, COCOA 2018, Atlanta, GA, USA, December 15–17, 2018. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11346, 19-34 (2018). MSC: 68U05 68P05 68Q25 PDFBibTeX XMLCite \textit{A. Maheshwari} et al., Lect. Notes Comput. Sci. 11346, 19--34 (2018; Zbl 1521.68240) Full Text: DOI arXiv
Chanchary, Farah; Maheshwari, Anil; Smid, Michiel Window queries for problems on intersecting objects and maximal points. (English) Zbl 1497.68520 Panda, B. S. (ed.) et al., Algorithms and discrete applied mathematics. 4th international conference, CALDAM 2018, Guwahati, India, February 15–17, 2018. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10743, 199-213 (2018). MSC: 68U05 68P05 PDFBibTeX XMLCite \textit{F. Chanchary} et al., Lect. Notes Comput. Sci. 10743, 199--213 (2018; Zbl 1497.68520) Full Text: DOI
Dillabaugh, Craig; He, Meng; Maheshwari, Anil; Zeh, Norbert I/O-efficient path traversal in succinct planar graphs. (English) Zbl 1364.68305 Algorithmica 77, No. 3, 714-755 (2017). MSC: 68R10 05C10 05C85 68P05 PDFBibTeX XMLCite \textit{C. Dillabaugh} et al., Algorithmica 77, No. 3, 714--755 (2017; Zbl 1364.68305) Full Text: DOI
Chanchary, Farah; Maheshwari, Anil; Smid, Michiel Querying relational event graphs using colored range searching data structures. (English) Zbl 1453.68128 Gaur, Daya (ed.) et al., Algorithms and discrete applied mathematics. Third international conference, CALDAM 2017, Sancoale, Goa, India, February 16–18, 2017. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10156, 83-95 (2017). MSC: 68R10 68P05 91D30 PDFBibTeX XMLCite \textit{F. Chanchary} et al., Lect. Notes Comput. Sci. 10156, 83--95 (2017; Zbl 1453.68128) Full Text: DOI
Chanchary, Farah; Maheshwari, Anil Counting subgraphs in relational event graphs. (English) Zbl 1475.68234 Kaykobad, Mohammad (ed.) et al., WALCOM: algorithms and computation. 10th international workshop, WALCOM 2016, Kathmandu, Nepal, March 29–31, 2016. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9627, 194-206 (2016). MSC: 68R10 05C30 05C82 68P05 91D30 PDFBibTeX XMLCite \textit{F. Chanchary} and \textit{A. Maheshwari}, Lect. Notes Comput. Sci. 9627, 194--206 (2016; Zbl 1475.68234) Full Text: DOI
Bose, Prosenjit; De Carufel, Jean-Lou; Grimm, Carsten; Maheshwari, Anil; Smid, Michiel Optimal data structures for farthest-point queries in cactus networks. (English) Zbl 1306.05229 J. Graph Algorithms Appl. 19, No. 1, 11-41 (2015). MSC: 05C82 05C12 68R10 68M10 68P05 PDFBibTeX XMLCite \textit{P. Bose} et al., J. Graph Algorithms Appl. 19, No. 1, 11--41 (2015; Zbl 1306.05229) Full Text: DOI arXiv
Maheshwari, Anil; Sack, Jörg-Rüdiger; Shahbaz, Kaveh; Zarrabi-Zadeh, Hamid Improved algorithms for partial curve matching. (English) Zbl 1291.68409 Algorithmica 69, No. 3, 641-657 (2014). MSC: 68U05 68P05 68W40 PDFBibTeX XMLCite \textit{A. Maheshwari} et al., Algorithmica 69, No. 3, 641--657 (2014; Zbl 1291.68409) Full Text: DOI
De, Minati; Maheshwari, Anil; Nandy, Subhas C.; Smid, Michiel An in-place min-max priority search tree. (English) Zbl 1257.68058 Comput. Geom. 46, No. 3, 310-327 (2013). MSC: 68P05 68P10 PDFBibTeX XMLCite \textit{M. De} et al., Comput. Geom. 46, No. 3, 310--327 (2013; Zbl 1257.68058) Full Text: DOI
Bose, Prosenjit; Chen, Eric Y.; He, Meng; Maheshwari, Anil; Morin, Pat Succinct geometric indexes supporting point location queries. (English) Zbl 1295.68100 ACM Trans. Algorithms 8, No. 2, Article No. 10, 26 p. (2012). MSC: 68P05 68U05 PDFBibTeX XMLCite \textit{P. Bose} et al., ACM Trans. Algorithms 8, No. 2, Article No. 10, 26 p. (2012; Zbl 1295.68100) Full Text: DOI
Dillabaugh, Craig; He, Meng; Maheshwari, Anil Succinct and I/O efficient data structures for traversal in trees. (English) Zbl 1241.68052 Algorithmica 63, No. 1-2, 201-223 (2012). MSC: 68P05 05C05 PDFBibTeX XMLCite \textit{C. Dillabaugh} et al., Algorithmica 63, No. 1--2, 201--223 (2012; Zbl 1241.68052) Full Text: DOI Link
Maheshwari, Anil; Sack, Jörg-Rüdiger; Shahbaz, Kaveh; Zarrabi-Zadeh, Hamid Improved algorithms for partial curve matching. (English) Zbl 1346.68233 Demetrescu, Camil (ed.) et al., Algorithms – ESA 2011. 19th annual European symposium, Saarbrücken, Germany, September 5–9, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-23718-8/pbk). Lecture Notes in Computer Science 6942, 518-529 (2011). MSC: 68U05 68P05 PDFBibTeX XMLCite \textit{A. Maheshwari} et al., Lect. Notes Comput. Sci. 6942, 518--529 (2011; Zbl 1346.68233) Full Text: DOI
Bose, Prosenjit; Chen, Eric Y.; He, Meng; Maheshwari, Anil; Morin, Pat Succinct geometric indexes supporting point location queries. (English) Zbl 1420.68078 Mathieu, Claire (ed.), Proceedings of the 20th annual ACM-SIAM symposium on discrete algorithms, SODA 2009, New York, NY, USA, January 4–6, 2009. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 635-644 (2009). MSC: 68P05 68U05 PDFBibTeX XMLCite \textit{P. Bose} et al., in: Proceedings of the 20th annual ACM-SIAM symposium on discrete algorithms, SODA 2009, New York, NY, USA, January 4--6, 2009. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 635--644 (2009; Zbl 1420.68078) Full Text: Link
Bose, Prosenjit; He, Meng; Maheshwari, Anil; Morin, Pat Succinct orthogonal range search structures on a grid with applications to text indexing. (English) Zbl 1253.68103 Dehne, Frank (ed.) et al., Algorithms and data structures. 11th international symposium, WADS 2009, Banff, Canada, August 21–23, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-03366-7/pbk). Lecture Notes in Computer Science 5664, 98-109 (2009). MSC: 68P05 68P10 68U05 PDFBibTeX XMLCite \textit{P. Bose} et al., Lect. Notes Comput. Sci. 5664, 98--109 (2009; Zbl 1253.68103) Full Text: DOI
Bose, Prosenjit; Guo, Hua; Kranakis, Evangelos; Maheshwari, Anil; Morin, Pat; Morrison, Jason; Smid, Michiel; Tang, Yihui On the false-positive rate of Bloom filters. (English) Zbl 1191.68203 Inf. Process. Lett. 108, No. 4, 210-213 (2008). MSC: 68P05 68W40 PDFBibTeX XMLCite \textit{P. Bose} et al., Inf. Process. Lett. 108, No. 4, 210--213 (2008; Zbl 1191.68203) Full Text: DOI
Dillabaugh, Craig; He, Meng; Maheshwari, Anil Succinct and I/O efficient data structures for traversal in trees. (English) Zbl 1183.68211 Hong, Seok-Hee (ed.) et al., Algorithms and computation. 19th international symposium, ISAAC 2008, Gold Coast, Australia, December 15–17, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-92181-3/pbk). Lecture Notes in Computer Science 5369, 112-123 (2008). MSC: 68P05 68R10 PDFBibTeX XMLCite \textit{C. Dillabaugh} et al., Lect. Notes Comput. Sci. 5369, 112--123 (2008; Zbl 1183.68211) Full Text: DOI
Maheshwari, Anil; Smid, Michiel A dynamic dictionary for priced information with application. (English) Zbl 1205.68131 Ibaraki, Toshihide (ed.) et al., Algorithms and computation. 14th international symposium, ISAAC 2003, Kyoto, Japan, December 15–17, 2003. Proceedings. Berlin: Springer (ISBN 3-540-20695-7/pbk). Lect. Notes Comput. Sci. 2906, 16-25 (2003). MSC: 68P05 PDFBibTeX XMLCite \textit{A. Maheshwari} and \textit{M. Smid}, Lect. Notes Comput. Sci. 2906, 16--25 (2003; Zbl 1205.68131) Full Text: DOI
Bose, Prosenjit; Maheshwari, Anil; Morin, Pat Fast approximations for sums of distances, clustering and the Fermat-Weber problem. (English) Zbl 1016.65040 Comput. Geom. 24, No. 3, 135-146 (2003). MSC: 65K05 90C27 68P05 52B55 68U05 90B80 PDFBibTeX XMLCite \textit{P. Bose} et al., Comput. Geom. 24, No. 3, 135--146 (2003; Zbl 1016.65040) Full Text: DOI
Hutchinson, David; Maheshwari, Anil; Zeh, Norbert An external memory data structure for shortest path queries. (English) Zbl 1011.68022 Discrete Appl. Math. 126, No. 1, 55-82 (2003). MSC: 68P05 05C85 PDFBibTeX XMLCite \textit{D. Hutchinson} et al., Discrete Appl. Math. 126, No. 1, 55--82 (2003; Zbl 1011.68022) Full Text: DOI
Maheshwari, Anil; Smid, Michiel; Zeh, Norbert I/O-efficient shortest path queries in geometric spanners. (English) Zbl 0997.68535 Dehne, Frank (ed.) et al., Algorithms and data structures. 7th international workshop, WADS 2001, Providence, RI, USA, August 8-10, 2001. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 2125, 287-299 (2001). MSC: 68U05 68R10 68P05 PDFBibTeX XMLCite \textit{A. Maheshwari} et al., Lect. Notes Comput. Sci. 2125, 287--299 (2001; Zbl 0997.68535) Full Text: Link
Bose, Prosenjit; Maheshwari, Anil; Morin, Pat; Morrison, Jason The grid placement problem. (English) Zbl 0997.68538 Dehne, Frank (ed.) et al., Algorithms and data structures. 7th international workshop, WADS 2001, Providence, RI, USA, August 8-10, 2001. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 2125, 180-191 (2001). MSC: 68U05 68W05 68P05 PDFBibTeX XMLCite \textit{P. Bose} et al., Lect. Notes Comput. Sci. 2125, 180--191 (2001; Zbl 0997.68538) Full Text: Link
Dessmark, Anders; Lingas, Andrzej; Maheshwari, Anil Multi-list ranking: Complexity and applications. (English) Zbl 0799.68188 Enjalbert, Patrice (ed.) et al., STACS 93. 10th annual symposium on theoretical aspects of computer science, Würzburg, Germany, February 25-27, 1993. Proceedings. Berlin: Springer-Verlag. Lect. Notes Comput. Sci. 665, 306-316 (1993). MSC: 68U05 68Q25 68Q05 68P05 PDFBibTeX XMLCite \textit{A. Dessmark} et al., Lect. Notes Comput. Sci. 665, 306--316 (1993; Zbl 0799.68188)