| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Craig Dillabaugh, Meng He, Anil Maheshwari |
Succinct and I/O Efficient Data Structures for Traversal in Trees.  |
Algorithmica  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Prosenjit Bose, Eric Y. Chen, Meng He, Anil Maheshwari, Pat Morin |
Succinct geometric indexes supporting point location queries. |
ACM Transactions on Algorithms |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Minati De, Anil Maheshwari, Subhas C. Nandy |
Space-efficient Algorithms for Visibility Problems in Simple Polygon |
CoRR |
2012 |
DBLP BibTeX RDF |
|
| 1 | John Augustine, Sandip Das, Anil Maheshwari, Subhas C. Nandy, Sasanka Roy, Swami Sarvattomananda |
Localized Geometric Query Problems |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Lyudmil Aleksandrov, Hristo Djidjev, Anil Maheshwari, Jörg-Rüdiger Sack |
An Approximation Algorithm for Computing Shortest Paths in Weighted 3-d Domains |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | 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. Biology Bioinform. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Prosenjit Bose, Anil Maheshwari, Chang Shu, Stefanie Wuhrer |
A survey of geodesic paths on 3D surfaces. |
Comput. Geom. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Anil Maheshwari, Jörg-Rüdiger Sack, Kaveh Shahbaz, Hamid Zarrabi-Zadeh |
Fréchet distance with speed limits. |
Comput. Geom. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Anil Maheshwari, Jörg-Rüdiger Sack, Kaveh Shahbaz, Hamid Zarrabi-Zadeh |
Improved Algorithms for Partial Curve Matching. |
ESA |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Minati De, Anil Maheshwari, Subhas C. Nandy, Michiel H. M. Smid |
An In-Place Priority Search Tree. |
CCCG |
2011 |
DBLP BibTeX RDF |
|
| 1 | Jean-Lou De Carufel, Craig Dillabaugh, Anil Maheshwari |
Point Location in Well-Shaped Meshes Using Jump-and-Walk. |
CCCG |
2011 |
DBLP BibTeX RDF |
|
| 1 | Anil Maheshwari, Jörg-Rüdiger Sack, Kaveh Shahbaz, Hamid Zarrabi-Zadeh |
Staying Close to a Curve. |
CCCG |
2011 |
DBLP BibTeX RDF |
|
| 1 | Karim Douïeb, Matthew Eastman, Anil Maheshwari, Michiel H. M. Smid |
Approximation Algorithms for a Triangle Enclosure Problem. |
CCCG |
2011 |
DBLP BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Prosenjit Bose, Paz Carmi, Mohammad Farshi, Anil Maheshwari, Michiel H. M. Smid |
Computing the Greedy Spanner in Near-Quadratic Time. |
Algorithmica |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Lyudmil Aleksandrov, Hristo Djidjev, Hua Guo, Anil Maheshwari, Doron Nussbaum, Jörg-Rüdiger Sack |
Algorithms for Approximate Shortest Path Queries on Weighted Polyhedral Surfaces. |
Discrete & Computational Geometry |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
2010 |
DBLP BibTeX RDF |
|
| 1 | Mohammad R. Nikseresht, Anil Somayaji, Anil Maheshwari |
Customer Appeasement Scheduling |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Dana Jansens, Prosenjit Bose, Paz Carmi, Anil Maheshwari, Pat Morin, Michiel H. M. Smid |
Improved Methods For Generating Quasi-Gray Codes |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Mustaq Ahmed, Sandip Das, Sachin Lodha, Anna Lubiw, Anil Maheshwari, Sasanka Roy |
Approximation algorithms for shortest descending paths in terrains. |
J. Discrete Algorithms |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Prosenjit Bose, Sébastien Collette, Stefan Langerman, Anil Maheshwari, Pat Morin, Michiel H. M. Smid |
Sigma-local graphs. |
J. Discrete Algorithms |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Anil Maheshwari, Jörg-Rüdiger Sack, Kaveh Shahbaz, Hamid Zarrabi-Zadeh |
Speed-constrained geodesic fréchet distance inside a simple polygon. |
CCCG |
2010 |
DBLP BibTeX RDF |
|
| 1 | Prosenjit Bose, Paz Carmi, Dana Jansens, Anil Maheshwari, Pat Morin, Michiel H. M. Smid |
Improved Methods For Generating Quasi-gray Codes. |
SWAT |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Anil Maheshwari, Norbert Zeh |
I/O-Efficient Algorithms for Graphs of Bounded Treewidth. |
Algorithmica |
2009 |
DBLP DOI BibTeX RDF |
Algorithms, Graph algorithms, External memory algorithms, Bounded treewidth |
| 1 | Anil Maheshwari, Stefanie Wuhrer |
Geodesic Paths On 3D Surfaces: Survey and Open Problems |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | 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. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Prosenjit Bose, Paz Carmi, Mathieu Couture, Anil Maheshwari, Michiel H. M. Smid, Norbert Zeh |
Geometric spanners with small chromatic number. |
Comput. Geom. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Prosenjit Bose, Paz Carmi, Mathieu Couture, Anil Maheshwari, Pat Morin, Michiel H. M. Smid |
Spanners of Complete k-Partite Geometric Graphs. |
SIAM J. Comput. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Prosenjit Bose, Eric Y. Chen, Meng He, Anil Maheshwari, Pat Morin |
Succinct geometric indexes supporting point location queries. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Anil Maheshwari, Jörg-Rüdiger Sack, Kaveh Shahbaz |
Computing Fréchet Distance with Speed Limits. |
CCCG |
2009 |
DBLP BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Mustaq Ahmed, Anna Lubiw, Anil Maheshwari |
Shortest Gently Descending Paths. |
WALCOM |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Prosenjit Bose, Meng He, Anil Maheshwari, Pat Morin |
Succinct Orthogonal Range Search Structures on a Grid with Applications to Text Indexing. |
WADS |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Craig Dillabaugh, Meng He, Anil Maheshwari, Norbert Zeh |
I/O and Space-Efficient Path Traversal in Planar Graphs. |
ISAAC |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Prosenjit Bose, Eric Y. Chen, Meng He, Anil Maheshwari, Pat Morin |
Succinct Geometric Indexes Supporting Point Location Queries |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Glenn Hickey, Paz Carmi, Anil Maheshwari, Norbert Zeh |
NAPX: A Polynomial Time Approximation Scheme for the Noah's Ark Problem |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Mustaq Ahmed, Sandip Das, Sachin Lodha, Anna Lubiw, Anil Maheshwari, Sasanka Roy |
Approximation Algorithms for Shortest Descending Paths in Terrains |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Anil Maheshwari, Michiel H. M. Smid, Norbert Zeh |
I/O-efficient algorithms for computing planar geometric spanners. |
Comput. Geom. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Anil Maheshwari, Norbert Zeh |
I/O-Efficient Planar Separators. |
SIAM J. Comput. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Hua Guo, Anil Maheshwari, Jörg-Rüdiger Sack |
Shortest Path Queries in Polygonal Domains. |
AAIM |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Prosenjit Bose, Paz Carmi, Mathieu Couture, Anil Maheshwari, Pat Morin, Michiel H. M. Smid |
Spanners of Complete k -Partite Geometric Graphs. |
LATIN |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Prosenjit Bose, Paz Carmi, Mohammad Farshi, Anil Maheshwari, Michiel H. M. Smid |
Computing the Greedy Spanner in Near-Quadratic Time. |
SWAT |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Glenn Hickey, Paz Carmi, Anil Maheshwari, Norbert Zeh |
NAPX: A Polynomial Time Approximation Scheme for the Noah's Ark Problem. |
WABI |
2008 |
DBLP DOI BibTeX RDF |
Noah’s Ark Problem, phylogenetic diversity, approximation algorithm |
| 1 | Craig Dillabaugh, Meng He, Anil Maheshwari |
Succinct and I/O Efficient Data Structures for Traversal in Trees. |
ISAAC |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Prosenjit Bose, Paz Carmi, Mathieu Couture, Anil Maheshwari, Michiel H. M. Smid, Norbert Zeh |
Geometric Spanners With Small Chromatic Number |
CoRR |
2007 |
DBLP BibTeX RDF |
|
| 1 | Prosenjit Bose, Paz Carmi, Mathieu Couture, Anil Maheshwari, Pat Morin, Michiel H. M. Smid |
Spanners of Complete $k$-Partite Geometric Graphs |
CoRR |
2007 |
DBLP BibTeX RDF |
|
| 1 | Prosenjit Bose, Anil Maheshwari, Pat Morin, Jason Morrison, Michiel H. M. Smid, Jan Vahrenhold |
Space-efficient geometric divide-and-conquer algorithms. |
Comput. Geom. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Mohammad R. Nikseresht, David A. Hutchinson, Anil Maheshwari |
Experiments with a Parallel External Memory System. |
HiPC |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Sasanka Roy, Sachin Lodha, Sandip Das, Anil Maheshwari |
Approximate Shortest Descent Path on a Terrain. |
CCCG |
2007 |
DBLP BibTeX RDF |
|
| 1 | 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 |
DBLP BibTeX RDF |
|
| 1 | Prosenjit Bose, Paz Carmi, Mathieu Couture, Anil Maheshwari, Michiel H. M. Smid, Norbert Zeh |
Geometric Spanners with Small Chromatic Number. |
WAOA |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Hua Guo, Anil Maheshwari, Doron Nussbaum, Jörg-Rüdiger Sack |
Shortest Path Queries Between Geometric Objects on Surfaces. |
ICCSA |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Anil Maheshwari, Michiel H. M. Smid |
A Dynamic Dictionary for Priced Information with Application. |
Algorithmica |
2006 |
DBLP DOI BibTeX RDF |
Priced information, Trapezoidal map, Computational geometry, Dictionary, Competitive ratio |
| 1 | Sathish Govindarajan, Tamás Lukovszki, Anil Maheshwari, Norbert Zeh |
I/O-Efficient Well-Separated Pair Decomposition and Applications. |
Algorithmica |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Lyudmil Aleksandrov, Hristo Djidjev, Hua Guo, Anil Maheshwari |
Partitioning planar graphs with costs and weights. |
ACM Journal of Experimental Algorithmics |
2006 |
DBLP DOI BibTeX RDF |
graph partitioning algorithms, implementation, Graph algorithms, graph separators |
| 1 | Lyudmil Aleksandrov, Hristo Djidjev, Hua Guo, Anil Maheshwari, Doron Nussbaum, Jörg-Rüdiger Sack |
Approximate Shortest Path Queries on Weighted Polyhedral Surfaces. |
MFCS |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Frank K. H. A. Dehne, Anil Maheshwari, Ryan Taylor |
A Coarse Grained Parallel Algorithm for Hausdorff Voronoi Diagrams. |
ICPP |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Lyudmil Aleksandrov, Anil Maheshwari, Jörg-Rüdiger Sack |
Determining approximate shortest paths on weighted polyhedral surfaces. |
J. ACM |
2005 |
DBLP DOI BibTeX RDF |
weighted paths, approximation algorithms, computational geometry, shortest path problems, Design and analysis of algorithms, polyhedral surfaces |
| 1 | Anil Maheshwari, Jiehua Yi |
On computing Fréchet distance of two paths on a convex polyhedron. |
EuroCG |
2005 |
DBLP BibTeX RDF |
|
| 1 | Prosenjit Bose, Anil Maheshwari, Giri Narasimhan, Michiel H. M. Smid, Norbert Zeh |
Approximating geometric bottleneck shortest paths. |
Comput. Geom. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Anil Maheshwari, Norbert Zeh |
I/O-Optimal Algorithms for Outerplanar Graphs. |
J. Graph Algorithms Appl. |
2004 |
DBLP BibTeX RDF |
|
| 1 | Prosenjit Bose, Marc J. van Kreveld, Anil Maheshwari, Pat Morin, Jason Morrison |
Translating a regular grid over a point set. |
Comput. Geom. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Prosenjit Bose, Anil Maheshwari, Pat Morin |
Fast approximations for sums of distances, clustering and the Fermat-Weber problem. |
Comput. Geom. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | David A. Hutchinson, Anil Maheshwari, Norbert Zeh |
An external memory data structure for shortest path queries. |
Discrete Applied Mathematics |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Prosenjit Bose, Anil Maheshwari, Giri Narasimhan, Michiel H. M. Smid, Norbert Zeh |
Approximating Geometric Bottleneck Shortest Paths. |
STACS |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Lyudmil Aleksandrov, Anil Maheshwari, Jörg-Rüdiger Sack |
An Improved Approximation Algorithm for Computing Geometric Shortest Paths. |
FCT |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Anil Maheshwari, Michiel H. M. Smid |
A Dynamic Dictionary for Priced Information with Application. |
ISAAC |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Frank K. H. A. Dehne, Wolfgang Dittrich, David A. Hutchinson, Anil Maheshwari |
Bulk Synchronous Parallel Algorithms for the External Memory Model. |
Theory Comput. Syst. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Anil Maheshwari, Norbert Zeh |
I/O-optimal algorithms for planar graphs using separators. |
SODA |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Lyudmil Aleksandrov, Hristo Djidjev, Hua Guo, Anil Maheshwari |
Partitioning Planar Graphs with Costs and Weights. |
ALENEX |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Anil Maheshwari, Jan Vahrenhold, Norbert Zeh |
On reverse nearest neighbor queries. |
CCCG |
2002 |
DBLP BibTeX RDF |
|
| 1 | Anil Maheshwari, Norbert Zeh |
A Survey of Techniques for Designing I/O-Efficient Algorithms. |
Algorithms for Memory Hierarchies |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Mark Lanthier, Anil Maheshwari, Jörg-Rüdiger Sack |
Approximating Shortest Paths on Weighted Polyhedral Surfaces. |
Algorithmica |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Wolfgang Dittrich, David A. Hutchinson, Anil Maheshwari |
Blocking in Parallel Multisearch Problems. |
Theory Comput. Syst. |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Evangelos Kranakis, Danny Krizanc, Anil Maheshwari, Jörg-Rüdiger Sack, Jorge Urrutia |
Ray shooting from convex ranges. |
Discrete Applied Mathematics |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Anil Maheshwari, Norbert Zeh |
I/O-efficient algorithms for graphs of bounded treewidth. |
SODA |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Prosenjit Bose, Anil Maheshwari, Pat Morin, Jason Morrison |
The Grid Placement Problem. |
WADS |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Anil Maheshwari, Michiel H. M. Smid, Norbert Zeh |
I/O-Efficient Shortest Path Queries in Geometric Spanners. |
WADS |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Tamás Lukovszki, Anil Maheshwari, Norbert Zeh |
I/O-Efficient Batched Range Counting and Its Applications to Proximity Problems. |
FSTTCS |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Sathish Govindarajan, Tamás Lukovszki, Anil Maheshwari, Norbert Zeh |
I/O-Efficient Well-Separated Pair Decomposition and Its Applications. |
ESA |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Lyudmil Aleksandrov, Anil Maheshwari, Jörg-Rüdiger Sack |
Approximation algorithms for geometric shortest path problems. |
STOC |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Anil Maheshwari, Jörg-Rüdiger Sack |
Simple Optimal Algorithms for Rectilinear Link Path and Polygon Separation Problems. |
Parallel Processing Letters |
1999 |
DBLP BibTeX RDF |
|
| 1 | Anil Maheshwari |
Database Security for the Web. |
IS Management |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Frank K. H. A. Dehne, Wolfgang Dittrich, David A. Hutchinson, Anil Maheshwari |
Parallel Virtual Memory. |
SODA |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Mark Lanthier, Anil Maheshwari, Jörg-Rüdiger Sack |
Shortest Anisotropic Paths on Terrains. |
ICALP |
1999 |
DBLP DOI BibTeX RDF |
aniositropic paths, computational geometry, approximation, shortest path |
| 1 | Frank K. H. A. Dehne, David A. Hutchinson, Anil Maheshwari, Wolfgang Dittrich |
Reducing I/O Complexity by Simulating Coarse Grained Parallel Algorithms. (PDF / PS) |
IPPS/SPDP |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | David A. Hutchinson, Anil Maheshwari, Norbert Zeh |
An External Memory Data Structure for Shortest Path Queries. |
COCOON |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Anil Maheshwari, Norbert Zeh |
External Memory Algorithms for Outerplanar Graphs. |
ISAAC |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Lyudmil Aleksandrov, Mark Lanthier, Anil Maheshwari, Jörg-Rüdiger Sack |
An epsilon-Approximation for Weighted Shortest Paths on Polyhedral Surfaces. |
SWAT |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Wolfgang Dittrich, David A. Hutchinson, Anil Maheshwari |
Blocking in Parallel Multisearch Problems (Extended Abstract). |
SPAA |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Prosenjit Bose, Jurek Czyzowicz, Evangelos Kranakis, Anil Maheshwari |
Algorithms for Packing Two Circles in a Convex Polygon. |
JCDCG |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Prosenjit Bose, Jurek Czyzowicz, Evangelos Kranakis, Danny Krizanc, Anil Maheshwari |
Polygon Cutting: Revisited. |
JCDCG |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrzej Lingas, Anil Maheshwari |
A Simple Optimal Parallel Algorithm for Reporting Paths in a Tree. |
Parallel Processing Letters |
1997 |
DBLP BibTeX RDF |
|
| 1 | Srinivasa Rao Arikati, Anil Maheshwari, Christos D. Zaroliagis |
Efficient Computation of Implicit Representations of Sparse Graphs. |
Discrete Applied Mathematics |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Evangelos Kranakis, Danny Krizanc, Anil Maheshwari, Marc Noy, Jörg-Rüdiger Sack, Jorge Urrutia |
Stage-graph Representations. |
Discrete Applied Mathematics |
1997 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")