default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAnil Maheshwari
Person information
- affiliation: Carleton University, Ottawa, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[j124]Ahmad Biniaz, Anil Maheshwari, Michiel Smid:
Euclidean Maximum Matchings in the Plane - Local to Global. Algorithmica 87(1): 132-147 (2025)- 2024
- [j123]Minati De, Anil Maheshwari, Ratnadip Mandal:
Online class cover problem. Comput. Geom. 123: 102120 (2024) - [j122]Amirali Madani, Anil Maheshwari:
Distance-Preserving Graph Compression Techniques. J. Graph Algorithms Appl. 28(1) (2024) - [j121]Prosenjit Bose, Guillermo Esteban
, Anil Maheshwari:
A Steiner-point-based algorithm for approximate shortest paths in weighted equilateral-triangle meshes. Theor. Comput. Sci. 1001: 114583 (2024) - [c131]Aritra Banik, Sayani Das, Anil Maheshwari, Bubai Manna, Subhas C. Nandy, Krishna Priya K. M., Bodhayan Roy, Sasanka Roy, Abhishek Sahu:
Minimum Consistent Subset in Trees and Interval Graphs. FSTTCS 2024: 7:1-7:15 - [c130]Greg Aloupis, Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, David Eppstein, Anil Maheshwari, Saeed Odak, Michiel Smid, Csaba D. Tóth, Pavel Valtr:
Noncrossing Longest Paths and Cycles. GD 2024: 36:1-36:17 - [c129]Sayan Bandyapadhyay, Anil Maheshwari, Sasanka Roy, Michiel Smid, Kasturi R. Varadarajan:
Geometric Covering via Extraction Theorem. ITCS 2024: 7:1-7:20 - [e2]Subrahmanyam Kalyanasundaram, Anil Maheshwari:
Algorithms and Discrete Applied Mathematics - 10th International Conference, CALDAM 2024, Bhilai, India, February 15-17, 2024, Proceedings. Lecture Notes in Computer Science 14508, Springer 2024, ISBN 978-3-031-52212-3 [contents] - [i66]Aritra Banik, Sayani Das, Anil Maheshwari, Bubai Manna, Subhas C. Nandy, Krishna Priya K. M., Bodhayan Roy, Sasanka Roy, Abhishek Sahu:
Minimum Consistent Subset in Trees and Interval Graphs. CoRR abs/2404.15487 (2024) - [i65]Ahmad Biniaz, Jean-Lou De Carufel, Anil Maheshwari, Michiel Smid:
Metric and Geometric Spanners that are Resilient to Degree-Bounded Edge Faults. CoRR abs/2405.18134 (2024) - [i64]Ahmad Biniaz, Anil Maheshwari, Michiel Smid:
Euclidean Maximum Matchings in the Plane - Local to Global. CoRR abs/2405.20424 (2024) - [i63]Prosenjit Bose, Jean-Lou De Carufel, Guillermo Esteban, Anil Maheshwari:
Computing shortest paths amid non-overlapping weighted disks. CoRR abs/2409.08869 (2024) - [i62]Prosenjit Bose, Jean-Lou De Carufel, Anil Maheshwari, Karthik Murali:
On 1-Planar Graphs with Bounded Cop-Number. CoRR abs/2409.16279 (2024) - [i61]Greg Aloupis, Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, David Eppstein, Anil Maheshwari, Saeed Odak, Michiel Smid, Csaba D. Tóth, Pavel Valtr:
Noncrossing Longest Paths and Cycles. CoRR abs/2410.05580 (2024) - [i60]Kevin Buchin, Antonia Kalb, Anil Maheshwari, Saeed Odak, Michiel Smid, Carolin Rehs, Sampson Wong:
Computing Oriented Spanners and their Dilation. CoRR abs/2412.08165 (2024) - [i59]Ahmad Biniaz, Anil Maheshwari, Joseph S. B. Mitchell, Saeed Odak, Valentin Polishchuk, Thomas C. Shermer:
Contiguous Boundary Guarding. CoRR abs/2412.15053 (2024) - [i58]Saman Bazargani, Therese Biedl, Prosenjit Bose, Anil Maheshwari, Babak Miraftab:
The basis number of 1-planar graphs. CoRR abs/2412.18595 (2024) - 2023
- [j120]Ritesh Seth, Anil Maheshwari, Subhas C. Nandy:
Acrophobic guard watchtower problem. Comput. Geom. 109: 101918 (2023) - [j119]Vikash Tripathi, Arti Pandey, Anil Maheshwari:
A linear-time algorithm for semitotal domination in strongly chordal graphs. Discret. Appl. Math. 338: 77-88 (2023) - [j118]Sanjana Dey, Anil Maheshwari, Subhas C. Nandy:
Minimum consistent subset of simple graph classes. Discret. Appl. Math. 338: 255-277 (2023) - [j117]Jean-Lou De Carufel, Darryl Hill, Anil Maheshwari, Sasanka Roy, Luís Fernando Schultz Xavier da Silveira:
Constant delay lattice train schedules. Discret. Appl. Math. 339: 1-10 (2023) - [j116]Satyabrata Jana, Anil Maheshwari, Saeed Mehrabi, Sasanka Roy:
Maximum Bipartite Subgraphs of Geometric Intersection Graphs. Int. J. Comput. Geom. Appl. 33(3&4): 133-157 (2023) - [j115]Hugo A. Akitaya, Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, Anil Maheshwari, Luís Fernando Schultz Xavier da Silveira, Michiel Smid:
The Minimum Moving Spanning Tree Problem. J. Graph Algorithms Appl. 27(1): 1-18 (2023) - [c128]Arun Kumar Das, Sandip Das, Anil Maheshwari, Swami Sarvattomananda:
Rectilinear Voronoi Games with a Simple Rectilinear Obstacle in Plane. CALDAM 2023: 89-100 - [i57]Amirali Madani, Anil Maheshwari:
Distance-Preserving Graph Compression Techniques. CoRR abs/2307.05829 (2023) - [i56]Minati De, Anil Maheshwari, Ratnadip Mandal:
Online Class Cover Problem. CoRR abs/2308.07020 (2023) - [i55]Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, Anil Maheshwari, Babak Miraftab, Saeed Odak, Michiel Smid, Shakhar Smorodinsky, Yelena Yuditsky:
On Separating Path and Tree Systems in Graphs. CoRR abs/2312.14295 (2023) - 2022
- [j114]Ahmad Biniaz, Prosenjit Bose, Anna Lubiw, Anil Maheshwari:
Bounded-Angle Minimum Spanning Trees. Algorithmica 84(1): 150-175 (2022) - [j113]Ahmad Biniaz, Anil Maheshwari, Michiel Smid:
Approximating Bottleneck Spanning Trees on Partitioned Tuples of Points. Comput. Geom. Topol. 1(1): 3:1-3:18 (2022) - [j112]Satyabrata Jana, Anil Maheshwari, Sasanka Roy:
Linear-size planar Manhattan network for convex point sets. Comput. Geom. 100: 101819 (2022) - [j111]Prosenjit Bose, Paz Carmi, J. Mark Keil, Anil Maheshwari, Saeed Mehrabi, Debajyoti Mondal, Michiel Smid:
Computing maximum independent set on outerstring graphs and their relatives. Comput. Geom. 103: 101852 (2022) - [j110]Frank Bauernöppel, Anil Maheshwari, Jörg-Rüdiger Sack:
An Ω(nd) lower bound on the number of cell crossings for weighted shortest paths in d-dimensional polyhedral structures. Comput. Geom. 107: 101897 (2022) - [j109]Anil Maheshwari, Arash Nouri, Jörg-Rüdiger Sack:
Shortest paths among transient obstacles. J. Comb. Optim. 43(5): 1036-1074 (2022) - [c127]Arun Kumar Das, Sandip Das, Anil Maheshwari, Swami Sarvattomananda:
Voronoi Games Using Geodesics. CALDAM 2022: 195-207 - [c126]Prosenjit Bose, Guillermo Esteban, Anil Maheshwari:
Weighted shortest path in equilateral triangular meshes. CCCG 2022: 60-67 - [c125]Nandhana Duraisamy, Hannah Miller Hillberg, Ramesh K. Jallu, Erik Krohn, Anil Maheshwari, Subhas C. Nandy, Alex Pahlow:
Half-Guarding Weakly-Visible Polygons and Terrains. FSTTCS 2022: 18:1-18:17 - 2021
- [j108]Ahmad Biniaz, Sergio Cabello, Paz Carmi, Jean-Lou De Carufel, Anil Maheshwari, Saeed Mehrabi, Michiel Smid:
On the Minimum Consistent Subset Problem. Algorithmica 83(7): 2273-2302 (2021) - [j107]Farah Chanchary, Anil Maheshwari, Michiel Smid:
Window queries for intersecting objects, maximal points and approximations using coresets. Discret. Appl. Math. 305: 295-310 (2021) - [j106]A. Karim Abu-Affash, Paz Carmi, Anil Maheshwari, Pat Morin, Michiel Smid, Shakhar Smorodinsky:
Approximating Maximum Diameter-Bounded Subgraph in Unit Disk Graphs. Discret. Comput. Geom. 66(4): 1401-1414 (2021) - [j105]Ankush Acharyya, Anil Maheshwari, Subhas C. Nandy:
Color-spanning localized query. Theor. Comput. Sci. 861: 85-101 (2021) - [j104]Aritra Banik, Arun Kumar Das, Sandip Das, Anil Maheshwari, Swami Sarvattomananda:
Voronoi game on polygons. Theor. Comput. Sci. 882: 125-142 (2021) - [c124]Sanjana Dey, Anil Maheshwari, Subhas C. Nandy:
Minimum Consistent Subset of Simple Graph Classes. CALDAM 2021: 471-484 - [c123]Jean-Lou De Carufel, Darryl Hill, Anil Maheshwari, Sasanka Roy, Luís Fernando Schultz Xavier da Silveira:
Constant Delay Lattice Train Schedules. CCCG 2021: 107-113 - [c122]Ritesh Seth, Anil Maheshwari, Subhas C. Nandy:
An Acrophobic Guard Watchtower Problem on Terrains. CCCG 2021: 351-361 - [c121]Sanjana Dey, Anil Maheshwari, Subhas C. Nandy:
Minimum Consistent Subset Problem for Trees. FCT 2021: 204-216 - [c120]Sayan Bandyapadhyay, Anil Maheshwari, Michiel Smid:
Exact and Approximation Algorithms for Many-To-Many Point Matching in the Plane. ISAAC 2021: 44:1-44:14 - [c119]Hugo A. Akitaya, Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, Anil Maheshwari, Luís Fernando Schultz Xavier da Silveira, Michiel Smid:
The Minimum Moving Spanning Tree Problem. WADS 2021: 15-28 - [c118]Ahmad Biniaz, Anil Maheshwari, Michiel Smid:
Euclidean Maximum Matchings in the Plane - Local to Global. WADS 2021: 186-199 - [i54]Jean-Lou De Carufel, Darryl Hill, Anil Maheshwari, Sasanka Roy, Luís Fernando Schultz Xavier da Silveira:
Constant Delay Lattice Train Schedules. CoRR abs/2107.04657 (2021) - [i53]Vikash Tripathi, Arti Pandey, Anil Maheshwari:
A linear-time algorithm for semitotal domination in strongly chordal graphs. CoRR abs/2109.02142 (2021) - [i52]Sayan Bandyapadhyay, Anil Maheshwari, Michiel Smid:
Exact and Approximation Algorithms for Many-To-Many Point Matching in the Plane. CoRR abs/2109.07524 (2021) - [i51]Ahmad Biniaz, Anil Maheshwari, Michiel Smid:
Approximating bottleneck spanning trees on partitioned tuples of points. CoRR abs/2111.05780 (2021) - 2020
- [j103]Therese Biedl, Ahmad Biniaz, Anil Maheshwari, Saeed Mehrabi:
Packing boundary-anchored rectangles and squares. Comput. Geom. 88: 101610 (2020) - [j102]Jean-Lou De Carufel, Carsten Grimm, Anil Maheshwari, Stefan Schirra, Michiel H. M. Smid:
Minimizing the continuous diameter when augmenting a geometric tree with a shortcut. Comput. Geom. 89: 101631 (2020) - [j101]Sathish Govindarajan, Anil Maheshwari:
Preface: CALDAM 2016. Discret. Appl. Math. 280: 1 (2020) - [j100]Farah Chanchary, Anil Maheshwari, Michiel H. M. Smid:
Querying relational event graphs using colored range searching data structures. Discret. Appl. Math. 286: 51-61 (2020) - [j99]Ahmad Biniaz, Evangelos Kranakis, Anil Maheshwari, Michiel H. M. Smid:
Plane and planarity thresholds for random geometric graphs. Discret. Math. Algorithms Appl. 12(1): 2050005:1-2050005:21 (2020) - [j98]Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid:
Bottleneck matchings and Hamiltonian cycles in higher-order Gabriel graphs. Inf. Process. Lett. 153 (2020) - [j97]Ahmad Biniaz, Prosenjit Bose, Paz Carmi, Anil Maheshwari, J. Ian Munro, Michiel H. M. Smid:
Faster algorithms for some optimization problems on collinear points. J. Comput. Geom. 11(1): 418-432 (2020) - [j96]Michiel Smid, Anil Maheshwari, Wolfgang Mulzer:
A simple randomized $O(n \log n)$-time closest-pair algorithm in doubling metrics. J. Comput. Geom. 11(1): 507-524 (2020) - [c117]Anil Maheshwari, Saeed Mehrabi, Sasanka Roy, Michiel Smid:
Covering Points with Pairs of Concentric Disks. CCCG 2020: 33-38 - [c116]Aritra Banik, Arun Kumar Das, Sandip Das, Anil Maheshwari, Swami Sarvottamananda:
Optimal Strategies in Single Round Voronoi Game on Convex Polygons with Constraints. COCOA 2020: 515-529 - [c115]Frank Bauernöppel, Anil Maheshwari, Jörg-Rüdiger Sack:
An $\varOmega (n^3)$ Lower Bound on the Number of Cell Crossings for Weighted Shortest Paths in 3-Dimensional Polyhedral Structures. LATIN 2020: 235-246 - [c114]Ahmad Biniaz, Prosenjit Bose, Anna Lubiw, Anil Maheshwari:
Bounded-Angle Minimum Spanning Trees. SWAT 2020: 14:1-14:22 - [c113]Satyabrata Jana, Anil Maheshwari, Saeed Mehrabi, Sasanka Roy:
Maximum Bipartite Subgraph of Geometric Intersection Graphs. WALCOM 2020: 158-169 - [i50]Anil Maheshwari, Wolfgang Mulzer, Michiel H. M. Smid:
A Simple Randomized O(n log n)-Time Closest-Pair Algorithm in Doubling Metrics. CoRR abs/2004.05883 (2020)
2010 – 2019
- 2019
- [j95]Ahmad Biniaz, Prosenjit Bose, Kimberly Crosbie, Jean-Lou De Carufel, David Eppstein, Anil Maheshwari, Michiel H. M. Smid:
Maximum Plane Trees in Multipartite Geometric Graphs. Algorithmica 81(4): 1512-1534 (2019) - [j94]Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid:
Flip distance to some plane configurations. Comput. Geom. 81: 12-21 (2019) - [j93]Sayan Bandyapadhyay, Anil Maheshwari, Saeed Mehrabi, Subhash Suri:
Approximating dominating set on intersection graphs of rectangles and L-frames. Comput. Geom. 82: 32-44 (2019) - [j92]Sanjib Sadhu, Sasanka Roy, Soumen Nandi, Anil Maheshwari, Subhas C. Nandy:
Two-center of the Convex Hull of a Point Set: Dynamic Model, and Restricted Streaming Model. Fundam. Informaticae 164(1): 119-138 (2019) - [j91]Gregory Bint, Anil Maheshwari, Michiel H. M. Smid, Subhas C. Nandy:
Partial Enclosure Range Searching. Int. J. Comput. Geom. Appl. 29(1): 73-93 (2019) - [j90]Paz Carmi, Farah Chanchary, Anil Maheshwari, Michiel H. M. Smid:
The Most Likely Object to be Seen Through a Window. Int. J. Comput. Geom. Appl. 29(4): 269-287 (2019) - [j89]Farah Chanchary, Anil Maheshwari:
Time Windowed Data Structures for Graphs. J. Graph Algorithms Appl. 23(2): 191-226 (2019) - [j88]Amin Gheibi, Anil Maheshwari, Jörg-Rüdiger Sack:
Weighted minimum backward Fréchet distance. Theor. Comput. Sci. 783: 9-21 (2019) - [j87]Paz Carmi, Anil Maheshwari, Saeed Mehrabi, Luís Fernando Schultz Xavier da Silveira:
Approximability of covering cells with line segments. Theor. Comput. Sci. 784: 133-141 (2019) - [j86]Aritra Banik, Sandip Das, Anil Maheshwari, Michiel H. M. Smid:
The discrete Voronoi game in a simple polygon. Theor. Comput. Sci. 793: 28-35 (2019) - [c112]Ankush Acharyya, Anil Maheshwari, Subhas C. Nandy:
Localized Query: Color Spanning Variations. CALDAM 2019: 150-160 - [c111]Ahmad Biniaz, Sergio Cabello, Paz Carmi, Jean-Lou De Carufel, Anil Maheshwari, Saeed Mehrabi, Michiel H. M. Smid:
On the Minimum Consistent Subset Problem. WADS 2019: 155-167 - [c110]Prosenjit Bose, Paz Carmi, J. Mark Keil, Anil Maheshwari, Saeed Mehrabi, Debajyoti Mondal, Michiel H. M. Smid:
Computing Maximum Independent Set on Outerstring Graphs and Their Relatives. WADS 2019: 211-224 - [i49]Prosenjit Bose, Paz Carmi, J. Mark Keil, Anil Maheshwari, Saeed Mehrabi, Debajyoti Mondal, Michiel H. M. Smid:
Computing Maximum Independent Set on Outerstring Graphs and Their Relatives. CoRR abs/1903.07024 (2019) - [i48]Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid:
Flip Distance to some Plane Configurations. CoRR abs/1905.00791 (2019) - [i47]Ankush Acharyya, Anil Maheshwari, Subhas C. Nandy:
Color spanning Localized query. CoRR abs/1905.05066 (2019) - [i46]Therese Biedl, Ahmad Biniaz, Anil Maheshwari, Saeed Mehrabi:
Packing Boundary-Anchored Rectangles and Squares. CoRR abs/1906.11948 (2019) - [i45]Satyabrata Jana, Anil Maheshwari, Saeed Mehrabi, Sasanka Roy:
Maximum Bipartite Subgraph of Geometric Intersection Graphs. CoRR abs/1909.03896 (2019) - [i44]Satyabrata Jana, Anil Maheshwari, Sasanka Roy:
Linear Size Planar Manhattan Network for Convex Point Sets. CoRR abs/1909.06457 (2019) - 2018
- [j85]Anil Maheshwari, Subhas C. Nandy, Drimit Pattanayak, Sasanka Roy, Michiel H. M. Smid:
Geometric Path Problems with Violations. Algorithmica 80(2): 448-471 (2018) - [j84]Ahmad Biniaz, Prosenjit Bose, David Eppstein, Anil Maheshwari, Pat Morin, Michiel H. M. Smid:
Spanning Trees in Multipartite Geometric Graphs. Algorithmica 80(11): 3177-3191 (2018) - [j83]Amin Gheibi, Anil Maheshwari, Jörg-Rüdiger Sack, Christian Scheffer:
Path Refinement in Weighted Regions. Algorithmica 80(12): 3766-3802 (2018) - [j82]Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid:
Strong matching of points with geometric shapes. Comput. Geom. 68: 186-205 (2018) - [j81]Anil Maheshwari, Jörg-Rüdiger Sack, Christian Scheffer:
Approximating the integral Fréchet distance. Comput. Geom. 70-71: 13-30 (2018) - [j80]Ahmad Biniaz, Prosenjit Bose, Anil Maheshwari, Michiel H. M. Smid:
Plane Bichromatic Trees of Low Degree. Discret. Comput. Geom. 59(4): 864-885 (2018) - [c109]Farah Chanchary, Anil Maheshwari, Michiel H. M. Smid:
Window Queries for Problems on Intersecting Objects and Maximal Points. CALDAM 2018: 199-213 - [c108]Anil Maheshwari, Arash Nouri, Jörg-Rüdiger Sack:
Time-Dependent Shortest Path Queries Among Growing Discs. CCCG 2018: 288-295 - [c107]Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid:
Compatible 4-Holes in Point Sets. CCCG 2018: 346-352 - [c106]Anil Maheshwari, Arash Nouri, Jörg-Rüdiger Sack:
Rectilinear Shortest Paths Among Transient Obstacles. COCOA 2018: 19-34 - [c105]Paz Carmi, Anil Maheshwari, Saeed Mehrabi, Luís Fernando Schultz Xavier da Silveira:
Approximability of Covering Cells with Line Segments. COCOA 2018: 436-448 - [c104]A. Karim Abu-Affash, Paz Carmi, Anil Maheshwari, Pat Morin, Michiel H. M. Smid, Shakhar Smorodinsky:
Approximating Maximum Diameter-Bounded Subgraph in Unit Disk Graphs. SoCG 2018: 2:1-2:12 - [c103]Ahmad Biniaz, Prosenjit Bose, Paz Carmi, Anil Maheshwari, J. Ian Munro, Michiel H. M. Smid:
Faster Algorithms for some Optimization Problems on Collinear Points. SoCG 2018: 8:1-8:14 - [c102]Sayan Bandyapadhyay, Anil Maheshwari, Saeed Mehrabi, Subhash Suri:
Approximating Dominating Set on Intersection Graphs of Rectangles and L-frames. MFCS 2018: 37:1-37:15 - [c101]Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid:
Flip Distance to some Plane Configurations. SWAT 2018: 11:1-11:14 - [i43]Ahmad Biniaz, Prosenjit Bose, Paz Carmi, Anil Maheshwari, J. Ian Munro, Michiel H. M. Smid:
Faster Algorithms for some Optimization Problems on Collinear Points. CoRR abs/1802.09505 (2018) - [i42]Sayan Bandyapadhyay, Anil Maheshwari, Saeed Mehrabi, Subhash Suri:
Approximating Dominating Set on Intersection Graphs of L-frames. CoRR abs/1803.06216 (2018) - [i41]Anil Maheshwari, Arash Nouri, Jörg-Rüdiger Sack:
Time-Dependent Shortest Path Queries Among Growing Discs. CoRR abs/1808.01984 (2018) - [i40]Anil Maheshwari, Arash Nouri, Jörg-Rüdiger Sack:
Rectilinear Shortest Paths Among Transient Obstacles. CoRR abs/1809.08898 (2018) - [i39]Paz Carmi, Anil Maheshwari, Saeed Mehrabi, Luís Fernando Schultz Xavier da Silveira:
Approximability of Covering Cells with Line Segments. CoRR abs/1809.09979 (2018) - [i38]Ahmad Biniaz, Evangelos Kranakis, Anil Maheshwari, Michiel H. M. Smid:
Plane and Planarity Thresholds for Random Geometric Graphs. CoRR abs/1809.10737 (2018) - [i37]Ahmad Biniaz, Sergio Cabello, Anil Maheshwari, Paz Carmi, Saeed Mehrabi, Jean-Lou De Carufel, Michiel H. M. Smid:
On the Minimum Consistent Subset Problem. CoRR abs/1810.09232 (2018) - 2017
- [j79]Craig Dillabaugh, Meng He, Anil Maheshwari, Norbert Zeh:
I/O-Efficient Path Traversal in Succinct Planar Graphs. Algorithmica 77(3): 714-755 (2017) - [j78]Ahmad Biniaz, Paul Liu, Anil Maheshwari, Michiel H. M. Smid:
Approximation algorithms for the unit disk cover problem in 2D and 3D. Comput. Geom. 60: 8-18 (2017) - [j77]Ahmad Biniaz, Anil Maheshwari, Subhas C. Nandy, Michiel H. M. Smid:
An optimal algorithm for plane matchings in multipartite geometric graphs. Comput. Geom. 63: 1-9 (2017) - [j76]Binay K. Bhattacharya, Minati De, Anil Maheshwari, Subhas C. Nandy, Sasanka Roy:
Rectilinear path problems in restricted memory setup. Discret. Appl. Math. 228: 80-87 (2017) - [j75]Ahmad Biniaz, Prosenjit Bose, Ingo van Duijn, Anil Maheshwari, Michiel H. M. Smid:
Faster Algorithms for the Minimum Red-Blue-Purple Spanning Graph Problem. J. Graph Algorithms Appl. 21(4): 527-546 (2017) - [j74]Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, Cyril Gavoille, Anil Maheshwari, Michiel H. M. Smid:
Towards plane spanners of degree 3. J. Comput. Geom. 8(1): 11-31 (2017) - [c100]Farah Chanchary, Anil Maheshwari, Michiel H. M. Smid:
Querying Relational Event Graphs Using Colored Range Searching Data Structures. CALDAM 2017: 83-95 - [c99]Therese Biedl, Ahmad Biniaz, Anil Maheshwari, Saeed Mehrabi:
Packing Boundary-Anchored Rectangles. CCCG 2017: 138-143 - [c98]Ahmad Biniaz, Prosenjit Bose, Kimberly Crosbie, Jean-Lou De Carufel, David Eppstein, Anil Maheshwari, Michiel H. M. Smid:
Maximum Plane Trees in Multipartite Geometric Graphs. WADS 2017: 193-204 - [i36]Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid:
Compatible 4-Holes in Point Sets. CoRR abs/1706.08105 (2017) - 2016
- [j73]Aritra Banik, Jean-Lou De Carufel, Anil Maheshwari, Michiel H. M. Smid:
Discrete Voronoi games and ϵ-nets, in two and three dimensions. Comput. Geom. 55: 41-58 (2016) - [j72]Pegah Kamousi, Sylvain Lazard, Anil Maheshwari, Stefanie Wuhrer:
Analysis of farthest point sampling for approximating geodesics in a graph. Comput. Geom. 57: 1-7 (2016) - [j71]Ahmad Biniaz, Prosenjit Bose, Anil Maheshwari, Michiel H. M. Smid:
Plane geodesic spanning trees, Hamiltonian cycles, and perfect matchings in a simple polygon. Comput. Geom. 57: 27-39 (2016) - [j70]Michiel H. M. Smid, Prosenjit Bose, Paz Carmi, Mirela Damian, Jean-Lou De Carufel, Darryl Hill, Anil Maheshwari, Yuyang Liu:
On the stretch factor of convex polyhedra whose vertices are (almost) on a sphere. J. Comput. Geom. 7(1): 444-472 (2016) - [j69]Ahmad Biniaz, Mahdi Amani, Anil Maheshwari, Michiel H. M. Smid, Prosenjit Bose, Jean-Lou De Carufel:
A plane 1.88-spanner for points in convex position. J. Comput. Geom. 7(1): 520-539 (2016) - [c97]Ahmad Biniaz, Prosenjit Bose, Ingo van Duijn, Anil Maheshwari, Michiel H. M. Smid:
A Faster Algorithm for the Minimum Red-Blue-Purple Spanning Graph Problem for Points on a Circle. CCCG 2016: 140-146 - [c96]Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, Cyril Gavoille, Anil Maheshwari, Michiel H. M. Smid:
Towards Plane Spanners of Degree 3. ISAAC 2016: 19:1-19:14 - [c95]Ahmad Biniaz, Prosenjit Bose, Anil Maheshwari, Michiel H. M. Smid:
Plane Bichromatic Trees of Low Degree. IWOCA 2016: 68-80 - [c94]Mahdi Amani, Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, Anil Maheshwari, Michiel H. M. Smid:
A Plane 1.88-Spanner for Points in Convex Position. SWAT 2016: 25:1-25:14 - [c93]Anil Maheshwari, Jörg-Rüdiger Sack, Christian Scheffer:
Approximating the Integral Fréchet Distance. SWAT 2016: 26:1-26:14 - [c92]Jean-Lou De Carufel, Carsten Grimm, Anil Maheshwari, Michiel H. M. Smid:
Minimizing the Continuous Diameter when Augmenting Paths and Cycles with Shortcuts. SWAT 2016: 27:1-27:14 - [c91]Farah Chanchary, Anil Maheshwari:
Counting Subgraphs in Relational Event Graphs. WALCOM 2016: 194-206 - [e1]Sathish Govindarajan, Anil Maheshwari:
Algorithms and Discrete Applied Mathematics - Second International Conference, CALDAM 2016, Thiruvananthapuram, India, February 18-20, 2016, Proceedings. Lecture Notes in Computer Science 9602, Springer 2016, ISBN 978-3-319-29220-5 [contents] - [i35]Aniket Basu Roy, Anil Maheshwari, Sathish Govindarajan, Neeldhara Misra, Subhas C. Nandy, Shreyas Shetty:
The Runaway Rectangle Escape Problem. CoRR abs/1603.04210 (2016) - [i34]Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, Cyril Gavoille, Anil Maheshwari, Michiel H. M. Smid:
Towards Plane Spanners of Degree 3. CoRR abs/1606.08824 (2016) - [i33]Ahmad Biniaz, Prosenjit Bose, David Eppstein, Anil Maheshwari, Pat Morin, Michiel H. M. Smid:
Spanning Trees in Multipartite Geometric Graphs. CoRR abs/1611.01661 (2016) - 2015
- [j68]Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid:
On full Steiner trees in unit disk graphs. Comput. Geom. 48(6): 453-458 (2015) - [j67]Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid:
Higher-order triangular-distance Delaunay graphs: Graph-theoretical properties. Comput. Geom. 48(9): 646-660 (2015) - [j66]A. Karim Abu-Affash, Ahmad Biniaz, Paz Carmi, Anil Maheshwari, Michiel H. M. Smid:
Approximating the bottleneck plane perfect matching of a point set. Comput. Geom. 48(9): 718-731 (2015) - [j65]Ahmad Biniaz, Prosenjit Bose, Anil Maheshwari, Michiel H. M. Smid:
Packing Plane Perfect Matchings into a Point Set. Discret. Math. Theor. Comput. Sci. 17(2): 119-142 (2015) - [j64]Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid:
On the hardness of full Steiner tree problems. J. Discrete Algorithms 34: 118-127 (2015) - [j63]Prosenjit Bose, Jean-Lou De Carufel, Carsten Grimm, Anil Maheshwari, Michiel H. M. Smid:
Optimal Data Structures for Farthest-Point Queries in Cactus Networks. J. Graph Algorithms Appl. 19(1): 11-41 (2015) - [j62]Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid:
Matchings in higher-order Gabriel graphs. Theor. Comput. Sci. 596: 67-78 (2015) - [c90]Ahmad Biniaz, Evangelos Kranakis, Anil Maheshwari, Michiel H. M. Smid:
Plane and Planarity Thresholds for Random Geometric Graphs. ALGOSENSORS 2015: 1-12 - [c89]Binay K. Bhattacharya, Minati De, Anil Maheshwari, Subhas C. Nandy, Sasanka Roy:
Rectilinear Path Problems in Restricted Memory Setup. CALDAM 2015: 69-80 - [c88]Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid:
Higher-Order Triangular-Distance Delaunay Graphs: Graph-Theoretical Properties. CALDAM 2015: 89-100 - [c87]Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid, Paul Liu:
A Faster 4-Approximation Algorithm for the Unit Disk Cover Problem. CCCG 2015 - [c86]Amin Gheibi, Anil Maheshwari, Jörg-Rüdiger Sack:
Weighted Minimum Backward Frechet Distance. CCCG 2015 - [c85]Sonal Kumari, Anil Maheshwari, Poonam Goyal, Navneet Goyal:
Parallel Framework for Efficient k-means Clustering. COMPUTE 2015: 63-71 - [c84]Ahmad Biniaz, Prosenjit Bose, Anil Maheshwari, Michiel H. M. Smid:
Plane Geodesic Spanning Trees, Hamiltonian Cycles, and Perfect Matchings in a Simple Polygon. TTCS 2015: 56-71 - [c83]Amin Gheibi, Anil Maheshwari, Jörg-Rüdiger Sack:
Minimizing Walking Length in Map Matching. TTCS 2015: 105-120 - [c82]Ahmad Biniaz, Anil Maheshwari, Subhas C. Nandy, Michiel H. M. Smid:
An Optimal Algorithm for Plane Matchings in Multipartite Geometric Graphs. WADS 2015: 66-78 - [i32]Ahmad Biniaz, Prosenjit Bose, Anil Maheshwari, Michiel H. M. Smid:
Packing Plane Perfect Matchings into a Point Set. CoRR abs/1501.03686 (2015) - [i31]Aritra Banik, Jean-Lou De Carufel, Anil Maheshwari, Michiel H. M. Smid:
Discrete Voronoi Games and ε-Nets, in Two and Three Dimensions. CoRR abs/1501.04843 (2015) - [i30]Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid:
Strong Matching of Points with Geometric Shapes. CoRR abs/1503.04871 (2015) - [i29]Prosenjit Bose, Paz Carmi, Mirela Damian, Jean-Lou De Carufel, Darryl Hill, Anil Maheshwari, Yuyang Liu, Michiel H. M. Smid:
On the Stretch Factor of Convex Polyhedra whose Vertices are (Almost) on a Sphere. CoRR abs/1507.06856 (2015) - [i28]Jean-Lou De Carufel, Carsten Grimm, Anil Maheshwari, Michiel H. M. Smid:
Minimizing the Continuous Diameter when Augmenting Paths and Cycles with Shortcuts. CoRR abs/1512.02257 (2015) - [i27]Sanjib Sadhu, Sasanka Roy, Soumen Nandi, Anil Maheshwari, Subhas C. Nandy:
Approximation algorithms for the two-center problem of convex polygon. CoRR abs/1512.02356 (2015) - [i26]Ahmad Biniaz, Prosenjit Bose, Anil Maheshwari, Michiel H. M. Smid:
Plane Bichromatic Trees of Low Degree. CoRR abs/1512.02730 (2015) - [i25]Anil Maheshwari, Jörg-Rüdiger Sack, Christian Scheffer:
Approximating the Integral Fréchet Distance. CoRR abs/1512.03359 (2015) - 2014
- [j61]Prosenjit Bose, Paz Carmi, Mirela Damian, Robin Y. Flatland, Matthew J. Katz, Anil Maheshwari:
Switching to Directional Antennas with Constant Increase in Radius and Hop Distance. Algorithmica 69(2): 397-409 (2014) - [j60]Anil Maheshwari, Jörg-Rüdiger Sack, Kaveh Shahbaz, Hamid Zarrabi-Zadeh:
Improved Algorithms for Partial Curve Matching. Algorithmica 69(3): 641-657 (2014) - [j59]Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid:
An optimal algorithm for the Euclidean bottleneck full Steiner tree problem. Comput. Geom. 47(3): 377-380 (2014) - [j58]Mohammad Ghodsi, Anil Maheshwari, Mostafa Nouri Baygi, Jörg-Rüdiger Sack, Hamid Zarrabi-Zadeh:
α-Visibility. Comput. Geom. 47(3): 435-446 (2014) - [j57]Jean-Lou De Carufel, Amin Gheibi, Anil Maheshwari, Jörg-Rüdiger Sack, Christian Scheffer:
Similarity of polygonal curves in the presence of outliers. Comput. Geom. 47(5): 625-641 (2014) - [j56]Jean-Lou De Carufel, Carsten Grimm, Anil Maheshwari, Megan Owen, Michiel H. M. Smid:
A note on the unsolvability of the weighted region shortest path problem. Comput. Geom. 47(7): 724-727 (2014) - [j55]Jasine Babu, Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid:
Fixed-orientation equilateral triangle matching of point sets. Theor. Comput. Sci. 555: 55-70 (2014) - [c81]Sandip Das, Anil Maheshwari, Ayan Nandy, Michiel H. M. Smid:
A Facility Coloring Problem in 1-D. AAIM 2014: 88-99 - [c80]Aritra Banik, Jean-Lou De Carufel, Anil Maheshwari, Michiel H. M. Smid:
Voronoi Games and Epsilon Nets. CCCG 2014 - [c79]Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid:
Approximating Full Steiner Tree in a Unit Disk Graph. CCCG 2014 - [c78]Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid:
Bottleneck Bichromatic Plane Matching of Points. CCCG 2014 - [c77]Amin Gheibi, Anil Maheshwari, Jörg-Rüdiger Sack, Christian Scheffer:
Minimum backward fréchet distance. SIGSPATIAL/GIS 2014: 381-388 - [i24]Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid:
Higher-Order Triangular-Distance Delaunay Graphs: Graph-Theoretical Properties. CoRR abs/1409.5466 (2014) - [i23]Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid:
Matching in Gabriel Graphs. CoRR abs/1410.0540 (2014) - [i22]Prosenjit Bose, Jean-Lou De Carufel, Carsten Grimm, Anil Maheshwari, Michiel H. M. Smid:
Optimal Data Structures for Farthest-Point Queries in Cactus Networks. CoRR abs/1411.1879 (2014) - 2013
- [j54]Minati De, Anil Maheshwari, Subhas C. Nandy, Michiel H. M. Smid:
An in-place min-max priority search tree. Comput. Geom. 46(3): 310-327 (2013) - [j53]John Augustine, Sandip Das, Anil Maheshwari, Subhas C. Nandy, Sasanka Roy, Swami Sarvattomananda:
Localized geometric query problems. Comput. Geom. 46(3): 340-357 (2013) - [j52]Lyudmil Aleksandrov, Hristo N. Djidjev, Anil Maheshwari, Jörg-Rüdiger Sack:
An Approximation Algorithm for Computing Shortest Paths in Weighted 3-d Domains. Discret. Comput. Geom. 50(1): 124-184 (2013) - [j51]Prosenjit Bose, Kai Dannies, Jean-Lou De Carufel, Christoph Doell, Carsten Grimm, Anil Maheshwari, Stefan Schirra, Michiel H. M. Smid:
Network Farthest-Point Diagrams. J. Comput. Geom. 4(1): 182-211 (2013) - [j50]Sandip Banerjee, Bhargab B. Bhattacharya, Sandip Das, Arindam Karmakar, Anil Maheshwari, Sasanka Roy:
On the Construction of Generalized Voronoi Inverse of a Rectangular Tessellation. Trans. Comput. Sci. 20: 22-38 (2013) - [c76]Prosenjit Bose, Jean-Lou De Carufel, Carsten Grimm, Anil Maheshwari, Michiel H. M. Smid:
Optimal Data Structures for Farthest-Point Queries in Cactus Networks. CCCG 2013 - [c75]Amin Gheibi, Anil Maheshwari, Jörg-Rüdiger Sack:
Weighted Region Problem in Arrangement of Lines. CCCG 2013 - [c74]Aritra Banik, Sandip Das, Anil Maheshwari, Michiel H. M. Smid:
The Discrete Voronoi Game in a Simple Polygon. COCOON 2013: 197-207 - [c73]Jasine Babu, Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid:
Fixed-Orientation Equilateral Triangle Matching of Point Sets. WALCOM 2013: 17-28 - [i21]Prosenjit Bose, Kai Dannies, Jean-Lou De Carufel, Christoph Doell, Carsten Grimm, Anil Maheshwari, Stefan Schirra, Michiel H. M. Smid:
Network Farthest-Point Diagrams. CoRR abs/1304.1909 (2013) - [i20]Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid:
An Optimal Algorithm for the Euclidean Bottleneck Full Steiner Tree Problem. CoRR abs/1305.0172 (2013) - [i19]Jean-Lou De Carufel, Carsten Grimm, Anil Maheshwari, Megan Owen, Michiel H. M. Smid:
A Note on the Unsolvability of the Weighted Region Shortest Path Problem. CoRR abs/1305.5209 (2013) - [i18]Pegah Kamousi, Sylvain Lazard, Anil Maheshwari, Stefanie Wuhrer:
Analysis of Farthest Point Sampling for Approximating Geodesics in a Graph. CoRR abs/1311.4665 (2013) - [i17]Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid:
Approximating the Bottleneck Plane Perfect Matching of a Point Set. CoRR abs/1311.5197 (2013) - 2012
- [j49]Craig Dillabaugh, Meng He, Anil Maheshwari:
Succinct and I/O Efficient Data Structures for Traversal in Trees. Algorithmica 63(1-2): 201-223 (2012) - [j48]Prosenjit Bose, Eric Y. Chen, Meng He, Anil Maheshwari, Pat Morin:
Succinct geometric indexes supporting point location queries. ACM Trans. Algorithms 8(2): 10:1-10:26 (2012) - [j47]Subir Kumar Ghosh, Partha P. Goswami, Anil Maheshwari, Subhas C. Nandy, Sudebkumar Prasant Pal, Swami Sarvattomananda:
Algorithms for computing diffuse reflection paths in polygons. Vis. Comput. 28(12): 1229-1237 (2012) - [c72]Gregory Bint, Anil Maheshwari, Michiel H. M. Smid:
xy-Monotone Path Existence Queries in a Rectilinear Environment. CCCG 2012: 35-40 - [c71]Prosenjit Bose, Jean-Lou De Carufel, Carsten Grimm, Anil Maheshwari, Michiel H. M. Smid:
On Farthest-Point Information in Networks. CCCG 2012: 199-204 - [c70]Sandip Banerjee, Bhargab B. Bhattacharya, Sandip Das, Arindam Karmakar, Anil Maheshwari, Sasanka Roy:
On the Construction of a Generalized Voronoi Inverse of a Rectangular Tessellation. ISVD 2012: 132-137 - [c69]Mohammad Ghodsi, Anil Maheshwari, Mostafa Nouri, Jörg-Rüdiger Sack, Hamid Zarrabi-Zadeh:
α-Visibility. SWAT 2012: 1-12 - [i16]Minati De, Anil Maheshwari, Subhas C. Nandy:
Space-efficient Algorithms for Visibility Problems in Simple Polygon. CoRR abs/1204.2634 (2012) - [i15]Jasine Babu, Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid:
Fixed-Orientation Equilateral Triangle Matching of Point Sets. CoRR abs/1211.2734 (2012) - [i14]Anil Maheshwari, Jörg-Rüdiger Sack, Kaveh Shahbaz:
Visiting All Sites with Your Dog. CoRR abs/1211.4559 (2012) - [i13]Jean-Lou De Carufel, Amin Gheibi, Anil Maheshwari, Jörg-Rüdiger Sack, Christian Scheffer:
Similarity of Polygonal Curves in the Presence of Outliers. CoRR abs/1212.1617 (2012) - 2011
- [j46]Anil Maheshwari, Jörg-Rüdiger Sack, Kaveh Shahbaz, Hamid Zarrabi-Zadeh:
Fréchet distance with speed limits. Comput. Geom. 44(2): 110-120 (2011) - [j45]Prosenjit Bose, Anil Maheshwari, Chang Shu, Stefanie Wuhrer:
A survey of geodesic paths on 3D surfaces. Comput. Geom. 44(9): 486-498 (2011) - [j44]Anil Maheshwari, Michiel H. M. Smid, Norbert Zeh:
Low-interference networks in metric spaces of bounded doubling dimension. Inf. Process. Lett. 111(23-24): 1120-1123 (2011) - [j43]Mustaq Ahmed, Anil Maheshwari, Subhas C. Nandy, Sasanka Roy:
On the number of shortest descending paths on the surface of a convex terrain. J. Discrete Algorithms 9(2): 182-189 (2011) - [j42]Glenn Hickey, Mathieu Blanchette, Paz Carmi, Anil Maheshwari, Norbert Zeh:
An Approximation Algorithm for the Noah's Ark Problem with Random Feature Loss. IEEE ACM Trans. Comput. Biol. Bioinform. 8(2): 551-556 (2011) - [c68]Jean-Lou De Carufel, Craig Dillabaugh, Anil Maheshwari:
Point Location in Well-Shaped Meshes Using Jump-and-Walk. CCCG 2011 - [c67]Minati De, Anil Maheshwari, Subhas C. Nandy, Michiel H. M. Smid:
An In-Place Priority Search Tree. CCCG 2011 - [c66]Karim Douïeb, Matthew Eastman, Anil Maheshwari, Michiel H. M. Smid:
Approximation Algorithms for a Triangle Enclosure Problem. CCCG 2011 - [c65]Anil Maheshwari, Jörg-Rüdiger Sack, Kaveh Shahbaz, Hamid Zarrabi-Zadeh:
Staying Close to a Curve. CCCG 2011 - [c64]Anil Maheshwari, Jörg-Rüdiger Sack, Kaveh Shahbaz, Hamid Zarrabi-Zadeh:
Improved Algorithms for Partial Curve Matching. ESA 2011: 518-529 - [c63]Prosenjit Bose, Paz Carmi, Mirela Damian, Robin Y. Flatland, Matthew J. Katz, Anil Maheshwari:
Switching to Directional Antennas with Constant Increase in Radius and Hop Distance. WADS 2011: 134-146 - [i12]Lyudmil Aleksandrov, Hristo N. Djidjev, Anil Maheshwari, Jörg-Rüdiger Sack:
An Approximation Algorithm for Computing Shortest Paths in Weighted 3-d Domains. CoRR abs/1102.3165 (2011) - [i11]John Augustine, Sandip Das, Anil Maheshwari, Subhas C. Nandy, Sasanka Roy, Swami Sarvattomananda:
Localized Geometric Query Problems. CoRR abs/1111.2918 (2011) - 2010
- [j41]Prosenjit Bose, Paz Carmi, Mohammad Farshi, Anil Maheshwari, Michiel H. M. Smid:
Computing the Greedy Spanner in Near-Quadratic Time. Algorithmica 58(3): 711-729 (2010) - [j40]Lyudmil Aleksandrov, Hristo N. Djidjev, Hua Guo, Anil Maheshwari, Doron Nussbaum, Jörg-Rüdiger Sack:
Algorithms for Approximate Shortest Path Queries on Weighted Polyhedral Surfaces. Discret. Comput. Geom. 44(4): 762-801 (2010) - [j39]Prosenjit Bose, Sébastien Collette, Stefan Langerman, Anil Maheshwari, Pat Morin, Michiel H. M. Smid:
Sigma-local graphs. J. Discrete Algorithms 8(1): 15-23 (2010) - [j38]Mustaq Ahmed, Sandip Das, Sachin Lodha, Anna Lubiw, Anil Maheshwari, Sasanka Roy:
Approximation algorithms for shortest descending paths in terrains. J. Discrete Algorithms 8(2): 214-230 (2010) - [c62]Anil Maheshwari, Jörg-Rüdiger Sack, Kaveh Shahbaz, Hamid Zarrabi-Zadeh:
Speed-constrained geodesic fréchet distance inside a simple polygon. CCCG 2010: 179-182 - [c61]Prosenjit Bose, Paz Carmi, Dana Jansens, Anil Maheshwari, Pat Morin, Michiel H. M. Smid:
Improved Methods For Generating Quasi-gray Codes. SWAT 2010: 224-235 - [i10]John Augustine, Sandip Das, Anil Maheshwari, Subhas C. Nandy, Sasanka Roy, Swami Sarvattomananda:
Recognizing the Largest Empty Circle and Axis-Parallel Rectangle in a Desired Location. CoRR abs/1004.0558 (2010) - [i9]Dana Jansens, Prosenjit Bose, Paz Carmi, Anil Maheshwari, Pat Morin, Michiel H. M. Smid:
Improved Methods For Generating Quasi-Gray Codes. CoRR abs/1010.0905 (2010) - [i8]Mohammad R. Nikseresht, Anil Somayaji, Anil Maheshwari:
Customer Appeasement Scheduling. CoRR abs/1012.3452 (2010)
2000 – 2009
- 2009
- [j37]Anil Maheshwari, Norbert Zeh:
I/O-Efficient Algorithms for Graphs of Bounded Treewidth. Algorithmica 54(3): 413-469 (2009) - [j36]Prosenjit Bose, Paz Carmi, Mathieu Couture, Anil Maheshwari, Michiel H. M. Smid, Norbert Zeh:
Geometric spanners with small chromatic number. Comput. Geom. 42(2): 134-146 (2009) - [j35]Tetsuo Asano, Prosenjit Bose, Paz Carmi, Anil Maheshwari, Chang Shu, Michiel H. M. Smid, Stefanie Wuhrer:
A linear-space algorithm for distance preserving graph embedding. Comput. Geom. 42(4): 289-304 (2009) - [j34]Rossen Atanassov, Prosenjit Bose, Mathieu Couture, Anil Maheshwari, Pat Morin, Michel Paquette, Michiel H. M. Smid, Stefanie Wuhrer:
Algorithms for optimal outlier removal. J. Discrete Algorithms 7(2): 239-248 (2009) - [j33]Prosenjit Bose, Paz Carmi, Mathieu Couture, Anil Maheshwari, Pat Morin, Michiel H. M. Smid:
Spanners of Complete k-Partite Geometric Graphs. SIAM J. Comput. 38(5): 1803-1820 (2009) - [c60]Anil Maheshwari, Jörg-Rüdiger Sack, Kaveh Shahbaz:
Computing Fréchet Distance with Speed Limits. CCCG 2009: 107-110 - [c59]Craig Dillabaugh, Meng He, Anil Maheshwari, Norbert Zeh:
I/O and Space-Efficient Path Traversal in Planar Graphs. ISAAC 2009: 1175-1184 - [c58]Prosenjit Bose, Eric Y. Chen, Meng He, Anil Maheshwari, Pat Morin:
Succinct geometric indexes supporting point location queries. SODA 2009: 635-644 - [c57]Prosenjit Bose, Meng He, Anil Maheshwari, Pat Morin:
Succinct Orthogonal Range Search Structures on a Grid with Applications to Text Indexing. WADS 2009: 98-109 - [c56]Subir Kumar Ghosh, Partha P. Goswami, Anil Maheshwari, Subhas C. Nandy, Sudebkumar Prasant Pal, Swami Sarvattomananda:
Algorithms for Computing Diffuse Reflection Paths in Polygons. WALCOM 2009: 47-58 - [c55]Mustaq Ahmed, Anna Lubiw, Anil Maheshwari:
Shortest Gently Descending Paths. WALCOM 2009: 59-70 - [i7]Anil Maheshwari, Stefanie Wuhrer:
Geodesic Paths On 3D Surfaces: Survey and Open Problems. CoRR abs/0904.2550 (2009) - 2008
- [j32]Anil Maheshwari, Michiel H. M. Smid, Norbert Zeh:
I/O-efficient algorithms for computing planar geometric spanners. Comput. Geom. 40(3): 252-271 (2008) - [j31]Prosenjit Bose, Hua Guo, Evangelos Kranakis, Anil Maheshwari, Pat Morin, Jason Morrison, Michiel H. M. Smid, Yihui Tang:
On the false-positive rate of Bloom filters. Inf. Process. Lett. 108(4): 210-213 (2008) - [j30]Anil Maheshwari, Norbert Zeh:
I/O-Efficient Planar Separators. SIAM J. Comput. 38(3): 767-801 (2008) - [c54]Hua Guo, Anil Maheshwari, Jörg-Rüdiger Sack:
Shortest Path Queries in Polygonal Domains. AAIM 2008: 200-211 - [c53]Craig Dillabaugh, Meng He, Anil Maheshwari:
Succinct and I/O Efficient Data Structures for Traversal in Trees. ISAAC 2008: 112-123 - [c52]Prosenjit Bose, Paz Carmi, Mathieu Couture, Anil Maheshwari, Pat Morin, Michiel H. M. Smid:
Spanners of Complete k -Partite Geometric Graphs. LATIN 2008: 170-181 - [c51]Prosenjit Bose, Paz Carmi, Mohammad Farshi, Anil Maheshwari, Michiel H. M. Smid:
Computing the Greedy Spanner in Near-Quadratic Time. SWAT 2008: 390-401 - [c50]Glenn Hickey, Paz Carmi, Anil Maheshwari, Norbert Zeh:
NAPX: A Polynomial Time Approximation Scheme for the Noah's Ark Problem. WABI 2008: 76-86 - [i6]Mustaq Ahmed, Sandip Das, Sachin Lodha, Anna Lubiw, Anil Maheshwari, Sasanka Roy:
Approximation Algorithms for Shortest Descending Paths in Terrains. CoRR abs/0805.1401 (2008) - [i5]Glenn Hickey, Paz Carmi, Anil Maheshwari, Norbert Zeh:
NAPX: A Polynomial Time Approximation Scheme for the Noah's Ark Problem. CoRR abs/0805.1661 (2008) - [i4]Prosenjit Bose, Eric Y. Chen, Meng He, Anil Maheshwari, Pat Morin:
Succinct Geometric Indexes Supporting Point Location Queries. CoRR abs/0805.4147 (2008) - 2007
- [j29]Prosenjit Bose, Anil Maheshwari, Pat Morin, Jason Morrison, Michiel H. M. Smid, Jan Vahrenhold:
Space-efficient geometric divide-and-conquer algorithms. Comput. Geom. 37(3): 209-227 (2007) - [c49]Tetsuo Asano, Prosenjit Bose, Paz Carmi, Anil Maheshwari, Chang Shu, Michiel H. M. Smid, Stefanie Wuhrer:
Linear-Space Algorithms for Distance Preserving Embedding. CCCG 2007: 185-188 - [c48]Sasanka Roy, Sachin Lodha, Sandip Das, Anil Maheshwari:
Approximate Shortest Descent Path on a Terrain. CCCG 2007: 189-192 - [c47]Mohammad R. Nikseresht, David A. Hutchinson, Anil Maheshwari:
Experiments with a Parallel External Memory System. HiPC 2007: 59-70 - [c46]Hua Guo, Anil Maheshwari, Doron Nussbaum, Jörg-Rüdiger Sack:
Shortest Path Queries Between Geometric Objects on Surfaces. ICCSA (1) 2007: 82-95 - [c45]Anil Maheshwari, Doron Nussbaum, Jörg-Rüdiger Sack, Jiehua Yi:
An O ( n 2log n ) Time Algorithm for Computing Shortest Paths Amidst Growing Discs in the Plane. ISAAC 2007: 668-680 - [c44]Prosenjit Bose, Paz Carmi, Mathieu Couture, Anil Maheshwari, Michiel H. M. Smid, Norbert Zeh:
Geometric Spanners with Small Chromatic Number. WAOA 2007: 75-88 - [i3]Prosenjit Bose, Paz Carmi, Mathieu Couture, Anil Maheshwari, Michiel H. M. Smid, Norbert Zeh:
Geometric Spanners With Small Chromatic Number. CoRR abs/0711.0114 (2007) - [i2]Prosenjit Bose, Paz Carmi, Mathieu Couture, Anil Maheshwari, Pat Morin, Michiel H. M. Smid:
Spanners of Complete $k$-Partite Geometric Graphs. CoRR abs/0712.0554 (2007) - 2006
- [j28]Anil Maheshwari, Michiel H. M. Smid:
A Dynamic Dictionary for Priced Information with Application. Algorithmica 44(2): 151-165 (2006) - [j27]Sathish Govindarajan, Tamás Lukovszki, Anil Maheshwari, Norbert Zeh:
I/O-Efficient Well-Separated Pair Decomposition and Applications. Algorithmica 45(4): 585-614 (2006) - [j26]Lyudmil Aleksandrov, Hristo N. Djidjev, Hua Guo, Anil Maheshwari:
Partitioning planar graphs with costs and weights. ACM J. Exp. Algorithmics 11 (2006) - [c43]Frank K. H. A. Dehne, Anil Maheshwari, Ryan Taylor:
A Coarse Grained Parallel Algorithm for Hausdorff Voronoi Diagrams. ICPP 2006: 497-504 - [c42]Lyudmil Aleksandrov, Hristo N. Djidjev, Hua Guo, Anil Maheshwari, Doron Nussbaum, Jörg-Rüdiger Sack:
Approximate Shortest Path Queries on Weighted Polyhedral Surfaces. MFCS 2006: 98-109 - 2005
- [j25]Lyudmil Aleksandrov, Anil Maheshwari, Jörg-Rüdiger Sack:
Determining approximate shortest paths on weighted polyhedral surfaces. J. ACM 52(1): 25-53 (2005) - [i1]Anil Maheshwari, Jiehua Yi:
On computing Fréchet distance of two paths on a convex polyhedron. EuroCG 2005: 41-44 - 2004
- [j24]Prosenjit Bose, Anil Maheshwari, Giri Narasimhan, Michiel H. M. Smid, Norbert Zeh:
Approximating geometric bottleneck shortest paths. Comput. Geom. 29(3): 233-249 (2004) - [j23]Anil Maheshwari, Norbert Zeh:
I/O-Optimal Algorithms for Outerplanar Graphs. J. Graph Algorithms Appl. 8: 47-87 (2004) - 2003
- [j22]Prosenjit Bose, Anil Maheshwari, Pat Morin:
Fast approximations for sums of distances, clustering and the Fermat-Weber problem. Comput. Geom. 24(3): 135-146 (2003) - [j21]Prosenjit Bose, Marc J. van Kreveld, Anil Maheshwari, Pat Morin, Jason Morrison:
Translating a regular grid over a point set. Comput. Geom. 25(1-2): 21-34 (2003) - [j20]David A. Hutchinson, Anil Maheshwari, Norbert Zeh:
An external memory data structure for shortest path queries. Discret. Appl. Math. 126(1): 55-82 (2003) - [c41]Lyudmil Aleksandrov, Anil Maheshwari, Jörg-Rüdiger Sack:
An Improved Approximation Algorithm for Computing Geometric Shortest Paths. FCT 2003: 246-257 - [c40]Anil Maheshwari, Michiel H. M. Smid:
A Dynamic Dictionary for Priced Information with Application. ISAAC 2003: 16-25 - [c39]Prosenjit Bose, Anil Maheshwari, Giri Narasimhan, Michiel H. M. Smid, Norbert Zeh:
Approximating Geometric Bottleneck Shortest Paths. STACS 2003: 38-49 - 2002
- [j19]Frank K. H. A. Dehne, Wolfgang Dittrich, David A. Hutchinson, Anil Maheshwari:
Bulk Synchronous Parallel Algorithms for the External Memory Model. Theory Comput. Syst. 35(6): 567-597 (2002) - [c38]Lyudmil Aleksandrov, Hristo N. Djidjev, Hua Guo, Anil Maheshwari:
Partitioning Planar Graphs with Costs and Weights. ALENEX 2002: 98-110 - [c37]Anil Maheshwari, Jan Vahrenhold, Norbert Zeh:
On reverse nearest neighbor queries. CCCG 2002: 128-132 - [c36]Anil Maheshwari, Norbert Zeh:
A Survey of Techniques for Designing I/O-Efficient Algorithms. Algorithms for Memory Hierarchies 2002: 36-61 - [c35]Anil Maheshwari, Norbert Zeh:
I/O-optimal algorithms for planar graphs using separators. SODA 2002: 372-381 - 2001
- [j18]Mark Lanthier, Anil Maheshwari, Jörg-Rüdiger Sack:
Approximating Shortest Paths on Weighted Polyhedral Surfaces. Algorithmica 30(4): 527-562 (2001) - [j17]Evangelos Kranakis, Danny Krizanc, Anil Maheshwari, Jörg-Rüdiger Sack, Jorge Urrutia:
Ray shooting from convex ranges. Discret. Appl. Math. 108(3): 259-267 (2001) - [j16]Wolfgang Dittrich, David A. Hutchinson, Anil Maheshwari:
Blocking in Parallel Multisearch Problems. Theory Comput. Syst. 34(2): 145-189 (2001) - [c34]Tamás Lukovszki, Anil Maheshwari, Norbert Zeh:
I/O-Efficient Batched Range Counting and Its Applications to Proximity Problems. FSTTCS 2001: 244-255 - [c33]Anil Maheshwari, Norbert Zeh:
I/O-efficient algorithms for graphs of bounded treewidth. SODA 2001: 89-90 - [c32]Prosenjit Bose, Anil Maheshwari, Pat Morin, Jason Morrison:
The Grid Placement Problem. WADS 2001: 180-191 - [c31]Anil Maheshwari, Michiel H. M. Smid, Norbert Zeh:
I/O-Efficient Shortest Path Queries in Geometric Spanners. WADS 2001: 287-299 - 2000
- [c30]Sathish Govindarajan, Tamás Lukovszki, Anil Maheshwari, Norbert Zeh:
I/O-Efficient Well-Separated Pair Decomposition and Its Applications. ESA 2000: 220-231 - [c29]Lyudmil Aleksandrov, Anil Maheshwari, Jörg-Rüdiger Sack:
Approximation algorithms for geometric shortest path problems. STOC 2000: 286-295 - [p1]Anil Maheshwari, Jörg-Rüdiger Sack, Hristo N. Djidjev:
Link Distance Problems. Handbook of Computational Geometry 2000: 519-558
1990 – 1999
- 1999
- [j15]Anil Maheshwari:
Database Security for the Web. Inf. Syst. Manag. 16(2): 85-88 (1999) - [j14]Anil Maheshwari, Jörg-Rüdiger Sack:
Simple Optimal Algorithms for Rectilinear Link Path and Polygon Separation Problems. Parallel Process. Lett. 9(1): 31-42 (1999) - [c28]David A. Hutchinson, Anil Maheshwari, Norbert Zeh:
An External Memory Data Structure for Shortest Path Queries. COCOON 1999: 51-60 - [c27]Mark Lanthier, Anil Maheshwari, Jörg-Rüdiger Sack:
Shortest Anisotropic Paths on Terrains. ICALP 1999: 524-533 - [c26]Frank K. H. A. Dehne, David A. Hutchinson, Anil Maheshwari, Wolfgang Dittrich:
Reducing I/O Complexity by Simulating Coarse Grained Parallel Algorithms. IPPS/SPDP 1999: 14-20 - [c25]Anil Maheshwari, Norbert Zeh:
External Memory Algorithms for Outerplanar Graphs. ISAAC 1999: 307-316 - [c24]Frank K. H. A. Dehne, Wolfgang Dittrich, David A. Hutchinson, Anil Maheshwari:
Parallel Virtual Memory. SODA 1999: 889-890 - 1998
- [c23]Prosenjit Bose, Jurek Czyzowicz, Evangelos Kranakis, Danny Krizanc, Anil Maheshwari:
Polygon Cutting: Revisited. JCDCG 1998: 81-92 - [c22]Prosenjit Bose, Jurek Czyzowicz, Evangelos Kranakis, Anil Maheshwari:
Algorithms for Packing Two Circles in a Convex Polygon. JCDCG 1998: 93-103 - [c21]Wolfgang Dittrich, David A. Hutchinson, Anil Maheshwari:
Blocking in Parallel Multisearch Problems (Extended Abstract). SPAA 1998: 98-107 - [c20]Lyudmil Aleksandrov, Mark Lanthier, Anil Maheshwari, Jörg-Rüdiger Sack:
An epsilon-Approximation for Weighted Shortest Paths on Polyhedral Surfaces. SWAT 1998: 11-22 - 1997
- [j13]Evangelos Kranakis, Danny Krizanc, Anil Maheshwari, Marc Noy, Jörg-Rüdiger Sack, Jorge Urrutia:
Stage-graph Representations. Discret. Appl. Math. 75(1): 71-80 (1997) - [j12]Srinivasa Rao Arikati, Anil Maheshwari, Christos D. Zaroliagis:
Efficient Computation of Implicit Representations of Sparse Graphs. Discret. Appl. Math. 78(1-3): 1-16 (1997) - [j11]Andrzej Lingas, Anil Maheshwari:
A Simple Optimal Parallel Algorithm for Reporting Paths in a Tree. Parallel Process. Lett. 7(1): 3-11 (1997) - [j10]Frank Bauernöppel, Evangelos Kranakis, Danny Krizanc, Anil Maheshwari, Jörg-Rüdiger Sack, Jorge Urrutia:
Planar Stage Graphs: Characterizations and Applications. Theor. Comput. Sci. 175(2): 239-255 (1997) - [c19]Mark Lanthier, Anil Maheshwari, Jörg-Rüdiger Sack:
Approximating Weighted Shortest Paths on Polyhedral Surfaces. SCG 1997: 274-283 - [c18]Mark Lanthier, Anil Maheshwari, Jörg-Rüdiger Sack:
Approximating Weighted Shortest Paths on Polyhedral Surfaces. SCG 1997: 485-486 - [c17]Anil Maheshwari, Pat Morin, Jörg-Rüdiger Sack:
Progressive TINs: Algorithms and Applications. ACM-GIS 1997: 24-29 - [c16]David A. Hutchinson, Anil Maheshwari, Jörg-Rüdiger Sack, Radu Velicescu:
Early Experiences in Implementing the Buffer Tree. WAE 1997: 92-103 - 1996
- [j9]Amitava Datta, Anil Maheshwari, Jörg-Rüdiger Sack:
Optimal Parallel Algorithms for Direct Dominance Problems. Nord. J. Comput. 3(1): 72-88 (1996) - [j8]Srinivasa Rao Arikati, Anil Maheshwari:
Realizing Degree Sequences in Parallel. SIAM J. Discret. Math. 9(2): 317-338 (1996) - [c15]David A. Hutchinson, Mark Lanthier, Anil Maheshwari, Doron Nussbaum, David Roytenberg, Jörg-Rüdiger Sack:
Parallel Neighbourhood Modelling. ACM-GIS 1996: 25-34 - [c14]David A. Hutchinson, L. Küttner, Mark Lanthier, Anil Maheshwari, Doron Nussbaum, David Roytenberg, Jörg-Rüdiger Sack:
Parallel Neighborhood Modeling. SPAA 1996: 204-207 - 1995
- [j7]Andrzej Lingas, Anil Maheshwari, Jörg-Rüdiger Sack:
Optimal Parallel Algorithms for Rectilinear Link-Distance Problems. Algorithmica 14(3): 261-289 (1995) - [j6]Vijay Chandru, Subir Kumar Ghosh, Anil Maheshwari, V. T. Rajan, Sanjeev Saluja:
NC-Algorithms for Minimum Link Path and Related Problems. J. Algorithms 19(2): 173-203 (1995) - [j5]Anders Dessmark, Andrzej Lingas, Anil Maheshwari:
Multilist Layering: Complexity and Applications. Theor. Comput. Sci. 141(1&2): 337-350 (1995) - [c13]Jian Huang, Anil Maheshwari, Doron Nussbaum, Jörg-Rüdiger Sack:
A note on approximations of rectilinear polygons. CCCG 1995: 43-48 - [c12]Frank Bauernöppel, Evangelos Kranakis, Danny Krizanc, Anil Maheshwari, Marc Noy, Jörg-Rüdiger Sack, Jorge Urrutia:
Optimal Shooting: Characterizations and Applications. ICALP 1995: 220-231 - [c11]Anil Maheshwari, Richard J. Boland Jr.:
Reflection and Representation: An Experimental Examination of Computer-Based Representation to Support Reflective Thinking. ICIS 1995: 189-195 - 1994
- [j4]Subir Kumar Ghosh, Anil Maheshwari, Sudebkumar Prasant Pal, C. E. Veni Madhavan:
An algorithm for recognizing palm polygons. Vis. Comput. 10(8): 443-451 (1994) - [c10]Srinivasa Rao Arikati, Anil Maheshwari, Christos D. Zaroliagis:
Saving Bits Made Easy. CCCG 1994: 140-146 - [c9]Srinivasa Rao Arikati, Anil Maheshwari:
An O(n) Algorithm for Realizing Degree Sequences. FSTTCS 1994: 125-136 - [c8]Srinivasa Rao Arikati, Anil Maheshwari:
Realizing Degree Sequences in Parallel. ISAAC 1994: 261-269 - [c7]Anil Maheshwari, Andrzej Lingas:
A Simple Optimal Parallel Algorithm for Reporting Paths in a Tree. STACS 1994: 487-495 - 1993
- [j3]Subir Kumar Ghosh, Anil Maheshwari, Sudebkumar Prasant Pal, Sanjeev Saluja, C. E. Veni Madhavan:
Characterizing and Recognizing Weak Visibility Polygons. Comput. Geom. 3: 213-233 (1993) - [c6]Amitava Datta, Anil Maheshwari, Jörg-Rüdiger Sack:
Optimal CREW-PRAM Algorithms for Direct Dominance Problems. ESA 1993: 109-120 - [c5]Andrzej Lingas, Anil Maheshwari, Jörg-Rüdiger Sack:
Parallel Algorithms for Rectilinear Link Distance Problems. IPPS 1993: 65-72 - [c4]Anders Dessmark, Andrzej Lingas, Anil Maheshwari:
Multi-List Ranking: Complexity and Applications. STACS 1993: 306-316 - 1992
- [j2]Subir Kumar Ghosh, Anil Maheshwari:
An Optimal Parallel Algorithm for Computing Furthest Neighbors in a Tree. Inf. Process. Lett. 44(3): 155-160 (1992) - [c3]Richard J. Boland Jr., Anil Maheshwari, Dov Te'eni, David G. Schwartz, Ramkrishnan V. Tenkasi:
Sharing Perspectives in Distributed Decision Making. CSCW 1992: 306-313 - [c2]Subir Kumar Ghosh, Anil Maheshwari:
Parallel Algorithms for All Minimum Link Paths and Link Center Problems. SWAT 1992: 106-117 - 1991
- [c1]Subir Kumar Ghosh, Anil Maheshwari, Sudebkumar Prasant Pal, Sanjeev Saluja, C. E. Veni Madhavan:
Computing the Shortest Path Tree in a Weak Visibility Polygon. FSTTCS 1991: 369-389 - 1990
- [j1]Subir Kumar Ghosh, Anil Maheshwari:
An Optimal Algorithm for Computing a Minimum Nested Nonconvex Polygon. Inf. Process. Lett. 36(6): 277-280 (1990)
Coauthor Index
[j124] [c130] [i65] [i64] [i61] [i59] [j115] [i55] [j114] [j113] [j108] [c119] [c118] [i51] [j103] [j99] [j98] [j97] [c114] [j95] [j94] [c111] [i48] [i46] [j84] [j82] [j80] [c107] [c103] [c101] [i43] [i38] [i37] [j78] [j77] [j75] [j74] [c99] [c98] [i36] [j71] [j69] [c97] [c96] [c95] [c94] [i34] [i33] [j68] [j67] [j66] [j65] [j64] [j62] [c90] [c88] [c87] [c84] [c82] [i32] [i30] [i26] [j59] [j55] [c79] [c78] [i24] [i23] [c73] [i20] [i17] [i15]
[j121] [c130] [i63] [i62] [i61] [i58] [j115] [i55] [j114] [j111] [c126] [c119] [j97] [c114] [j95] [c110] [i49] [j84] [j80] [c103] [i43] [j75] [j74] [c98] [j71] [j70] [j69] [c97] [c96] [c95] [c94] [i34] [i33] [j65] [j63] [c84] [i32] [i29] [i26] [j61] [i22] [j51] [c76] [i21] [j48] [c71] [j45] [c63] [j41] [j39] [c61] [i9] [j36] [j35] [j34] [j33] [c58] [c57] [j31] [c52] [c51] [i4] [j29] [c49] [c44] [i3] [i2] [j24] [j22] [j21] [c39] [c32] [c23] [c22]
[j110] [j109] [c115] [j88] [j83] [j81] [c108] [c106] [i41] [i40] [c93] [c86] [c83] [i25] [j60] [j58] [j57] [c77] [j52] [c75] [c69] [i14] [i13] [j46] [c65] [c64] [i12] [j40] [c62] [c60] [c54] [c46] [c45] [c42] [j25] [c41] [j18] [j17] [c29] [p1] [j14] [c27] [c20] [j13] [j10] [c19] [c18] [c17] [c16] [j9] [c15] [c14] [j7] [c13] [c12] [c6] [c5]
Swami Sarvattomananda
aka: Swami Sarvottamananda
aka: Swami Sarvottamananda
Michiel H. M. Smid
aka: Michiel Smid
aka: Michiel Smid
[j124] [c130] [c129] [i65] [i64] [i61] [i60] [j115] [i55] [j113] [j111] [j108] [j107] [j106] [c120] [c119] [c118] [i52] [i51] [j102] [j100] [j99] [j98] [j97] [j96] [c117] [i50] [j95] [j94] [j91] [j90] [j86] [c111] [c110] [i49] [i48] [j85] [j84] [j82] [j80] [c109] [c107] [c104] [c103] [c101] [i43] [i38] [i37] [j78] [j77] [j75] [j74] [c100] [c98] [i36] [j73] [j71] [j70] [j69] [c97] [c96] [c95] [c94] [c92] [i34] [i33] [j68] [j67] [j66] [j65] [j64] [j63] [j62] [c90] [c88] [c87] [c84] [c82] [i32] [i31] [i30] [i29] [i28] [i26] [j59] [j56] [j55] [c81] [c80] [c79] [c78] [i24] [i23] [i22] [j54] [j51] [c76] [c74] [c73] [i21] [i20] [i19] [i17] [c72] [c71] [i15] [j44] [c67] [c66] [j41] [j39] [c61] [i9] [j36] [j35] [j34] [j33] [j32] [j31] [c52] [c51] [j29] [c49] [c44] [i3] [i2] [j28] [j24] [c40] [c39] [c31]
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 2025-02-02 23:23 CET 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:
