Pat Morin

CoRR, March, 2025

Tight bound for the Erdős-Pósa property of tree minors.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2025

Grid Minors and Products.

[BibT_eX]

[DOI]

Electron. J. Comb., 2025

Planar Graphs in Blowups of Fans.

[BibT_eX]

[DOI]

Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms, 2025

Cops and Robbers for Graphs on Surfaces with Crossings.

[BibT_eX]

[DOI]

Karthik Murali

Proceedings of the 50th International Symposium on Mathematical Foundations of Computer Science, 2025

2024

The Excluded Tree Minor Theorem Revisited.

[BibT_eX]

[DOI]

Comb. Probab. Comput., January, 2024

Product Structure Extension of the Alon-Seymour-Thomas Theorem.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2024

Min-k-planar Drawings of Graphs.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2024

Erdős-Pósa property of cycles that are far apart.

[BibT_eX]

[DOI]

CoRR, 2024

On k-planar Graphs without Short Cycles.

[BibT_eX]

[DOI]

CoRR, 2024

Vertex Ranking of Degenerate Graphs.

[BibT_eX]

[DOI]

CoRR, 2024

Free Sets in Planar Graphs: History and Applications.

[BibT_eX]

[DOI]

CoRR, 2024

Bounded-Degree Planar Graphs Do Not Have Bounded-Degree Product Structure.

[BibT_eX]

[DOI]

Electron. J. Comb., 2024

Graphs Drawn With Some Vertices per Face: Density and Relationships.

[BibT_eX]

[DOI]

IEEE Access, 2024

The Grid-Minor Theorem Revisited.

[BibT_eX]

[DOI]

Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

Local Certification of Geometric Graph Classes.

[BibT_eX]

[DOI]

Proceedings of the 49th International Symposium on Mathematical Foundations of Computer Science, 2024

On k-Planar Graphs Without Short Cycles.

[BibT_eX]

[DOI]

Proceedings of the 32nd International Symposium on Graph Drawing and Network Visualization, 2024

Patricia's Bad Distributions.

[BibT_eX]

[DOI]

Louigi Addario-Berry

Ralph Neininger

Proceedings of the 35th International Conference on Probabilistic, 2024

2023

Stabbing Pairwise Intersecting Disks by Four Points.

[BibT_eX]

[DOI]

Paz Carmi

Matthew J. Katz

Discret. Comput. Geom., December, 2023

Graph product structure for non-minor-closed classes.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2023

Connected Dominating Sets in Triangulations.

[BibT_eX]

[DOI]

CoRR, 2023

Nonplanar Graph Drawings with k Vertices per Face.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2023

Min-k-planar Drawings of Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing and Network Visualization - 31st International Symposium, 2023

Proof of the Clustered Hadwiger Conjecture.

[BibT_eX]

[DOI]

Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

2022

Separating layered treewidth and row treewidth.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2022

Clustered 3-colouring graphs of bounded degree.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2022

Linear versus centred chromatic numbers.

[BibT_eX]

[DOI]

CoRR, 2022

$2\times n$ Grids have Unbounded Anagram-Free Chromatic Number.

[BibT_eX]

[DOI]

Electron. J. Comb., 2022

Stack-Number is Not Bounded by Queue-Number.

[BibT_eX]

[DOI]

Comb., 2022

An Optimal Algorithm for Product Structure in Planar Graphs.

[BibT_eX]

[DOI]

Saeed Odak

Proceedings of the 18th Scandinavian Symposium and Workshops on Algorithm Theory, 2022

2021

Two Results on Layered Pathwidth and Linear Layouts.

[BibT_eX]

[DOI]

Céline Yelle

J. Graph Algorithms Appl., 2021

2×n Grids have Unbounded Anagram-Free Chromatic Number.

[BibT_eX]

[DOI]

CoRR, 2021

A Fast Algorithm for the Product Structure of Planar Graphs.

[BibT_eX]

[DOI]

Algorithmica, 2021

2020

Minor-Closed Graph Classes with Bounded Layered Pathwidth.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2020

Sparse universal graphs for planarity.

[BibT_eX]

[DOI]

Louis Esperet

Gwenaël Joret

CoRR, 2020

Asymptotically Optimal Vertex Ranking of Planar Graphs.

[BibT_eX]

[DOI]

CoRR, 2020

Drawing Graphs as Spanners.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2020

Adjacency Labelling for Planar Graphs (and Beyond).

[BibT_eX]

[DOI]

Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science, 2020

2019

Notes on growing a tree in a graph.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2019

The structure of k-planar graphs.

[BibT_eX]

[DOI]

CoRR, 2019

Encoding 3SUM.

[BibT_eX]

[DOI]

CoRR, 2019

Queue Layouts of Graphs with Bounded Degree and Bounded Genus.

[BibT_eX]

[DOI]

Luís Fernando Schultz Xavier da Silveira

CoRR, 2019

More Turán-Type Theorems for Triangles in Convex Point Sets.

[BibT_eX]

[DOI]

Electron. J. Comb., 2019

Every Collinear Set in a Planar Graph Is Free.

[BibT_eX]

[DOI]

Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

Planar Graphs have Bounded Queue-Number.

[BibT_eX]

[DOI]

Proceedings of the 60th IEEE Annual Symposium on Foundations of Computer Science, 2019

Dual Circumference and Collinear Sets.

[BibT_eX]

[DOI]

Proceedings of the 35th International Symposium on Computational Geometry, 2019

2018

Corrigendum: Orthogonal Tree Decompositions of Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2018

Orthogonal Tree Decompositions of Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2018

Near-Optimal O(k)-Robust Geometric Spanners.

[BibT_eX]

[DOI]

CoRR, 2018

Spanning Trees in Multipartite Geometric Graphs.

[BibT_eX]

[DOI]

Algorithmica, 2018

Anagram-Free Chromatic Number Is Not Pathwidth-Bounded.

[BibT_eX]

[DOI]

Paz Carmi

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2018

Geodesic Obstacle Representation of Graphs.

[BibT_eX]

[DOI]

Fabrizio Montecchiani

Luís Fernando Schultz Xavier da Silveira

Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

Approximating Maximum Diameter-Bounded Subgraph in Unit Disk Graphs.

[BibT_eX]

[DOI]

Proceedings of the 34th International Symposium on Computational Geometry, 2018

2017

Array Layouts for Comparison-Based Searching.

[BibT_eX]

[DOI]

Paul-Virak Khuong

ACM J. Exp. Algorithmics, 2017

Layered separators in minor-closed graph classes with applications.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2017

Encoding Arguments.

[BibT_eX]

[DOI]

Wolfgang Mulzer

Tommy Reddad

ACM Comput. Surv., 2017

EPG-representations with Small Grid-Size.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing and Network Visualization - 25th International Symposium, 2017

2016

Towards tight bounds on theta-graphs: More is not always better.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2016

New Bounds for Facial Nonrepetitive Colouring.

[BibT_eX]

Proceedings of the 28th Canadian Conference on Computational Geometry, 2016

2015

Average Stretch Factor: How Low Does It Go?

[BibT_eX]

[DOI]

Michiel H. M. Smid

Discret. Comput. Geom., 2015

Reprint of: Approximating majority depth.

[BibT_eX]

[DOI]

Comput. Geom., 2015

The θ5-graph is a spanner.

[BibT_eX]

[DOI]

Comput. Geom., 2015

On Obstacle Numbers.

[BibT_eX]

[DOI]

Electron. J. Comb., 2015

Compatible Connectivity-Augmentation of Planar Disconnected Graphs.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

2014

Towards Tight Bounds on Theta-Graphs.

[BibT_eX]

[DOI]

CoRR, 2014

Top-Down Skiplists.

[BibT_eX]

[DOI]

Luis Barba

CoRR, 2014

Guest Editor's Introduction.

[BibT_eX]

[DOI]

Comput. Geom., 2014

Crossings in Grid Drawings.

[BibT_eX]

[DOI]

Adam Sheffer

Electron. J. Comb., 2014

Biased Predecessor Search.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31, 2014

The Price of Order.

[BibT_eX]

[DOI]

André van Renssen

Proceedings of the Algorithms and Computation - 25th International Symposium, 2014

Searching by Panning and Zooming.

[BibT_eX]

[DOI]

Proceedings of the 26th Canadian Conference on Computational Geometry, 2014

On the Average Number of Edges in Theta Graphs.

[BibT_eX]

[DOI]

Sander Verdonschot

Proceedings of the 2014 Proceedings of the Eleventh Workshop on Analytic Algorithmics and Combinatorics, 2014

2013

Coverage with k-transmitters in the presence of obstacles.

[BibT_eX]

[DOI]

Vera Sacristán Adinolfi

Diane L. Souvaine

Ryuhei Uehara

J. Comb. Optim., 2013

The Fresh-Finger Property

[BibT_eX]

[DOI]

John Iacono

CoRR, 2013

Layered Separators in Minor-Closed Families with Applications.

[BibT_eX]

[DOI]

CoRR, 2013

Absolute approximation of Tukey depth: Theory and experiments.

[BibT_eX]

[DOI]

Uli Wagner

Comput. Geom., 2013

Oja centers and centers of gravity.

[BibT_eX]

[DOI]

Comput. Geom., 2013

The θ 5-Graph is a Spanner.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2013

Layered Separators for Queue Layouts, 3D Graph Drawing and Nonrepetitive Coloring.

[BibT_eX]

[DOI]

Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science, 2013

Robust geometric spanners.

[BibT_eX]

[DOI]

Proceedings of the Symposium on Computational Geometry 2013, 2013

A History of Distribution-Sensitive Data Structures.

[BibT_eX]

[DOI]

Proceedings of the Space-Efficient Data Structures, 2013

2012

Entropy, triangulation, and point location in planar subdivisions.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2012

The theta-5-graph is a spanner

[BibT_eX]

[DOI]

CoRR, 2012

A Note on Interference in Random Point Sets

[BibT_eX]

[DOI]

CoRR, 2012

Memoryless routing in convex subdivisions: Random walks are optimal.

[BibT_eX]

[DOI]

Comput. Geom., 2012

A Note on Interference in Random Networks.

[BibT_eX]

[DOI]

Proceedings of the 24th Canadian Conference on Computational Geometry, 2012

Approximating Majority Depth.

[BibT_eX]

[DOI]

Proceedings of the 24th Canadian Conference on Computational Geometry, 2012

Visibility Monotonic Polygon Deflation.

[BibT_eX]

[DOI]

Proceedings of the 24th Canadian Conference on Computational Geometry, 2012

Optimal Bounds on Theta-Graphs: More is not Always Better.

[BibT_eX]

[DOI]

Proceedings of the 24th Canadian Conference on Computational Geometry, 2012

2011

Randomized rendezvous with limited memory.

[BibT_eX]

[DOI]

Evangelos Kranakis

Danny Krizanc

ACM Trans. Algorithms, 2011

Algorithms for Marketing-Mix Optimization.

[BibT_eX]

[DOI]

Michiel H. M. Smid

Algorithmica, 2011

Preprocessing Imprecise Points for Delaunay Triangulation: Simplified and Extended.

[BibT_eX]

[DOI]

Algorithmica, 2011

Algorithms for Bivariate Majority Depth.

[BibT_eX]

[DOI]

Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, 2011

2010

Sigma-local graphs.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2010

A Tight Bound on the Maximum Interference of Random Sensors in the Highway Model

[BibT_eX]

[DOI]

CoRR, 2010

Odds-On Trees

[BibT_eX]

[DOI]

CoRR, 2010

Point Location in Disconnected Planar Subdivisions

[BibT_eX]

[DOI]

CoRR, 2010

Improved Methods For Generating Quasi-gray Codes.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Theory, 2010

Skip Lift: A Probabilistic Alternative to Red-Black Trees.

[BibT_eX]

[DOI]

Karim Douïeb

Proceedings of the Combinatorial Algorithms - 21st International Workshop, 2010

Planar visibility: testing and counting.

[BibT_eX]

[DOI]

Proceedings of the 26th ACM Symposium on Computational Geometry, 2010

Coverage with k-Transmitters in the Presence of Obstacles.

[BibT_eX]

[DOI]

Vera Sacristán Adinolfi

Diane L. Souvaine

Ryuhei Uehara

Proceedings of the Combinatorial Optimization and Applications, 2010

Common Unfoldings of Polyominoes and Polycubes.

[BibT_eX]

[DOI]

Proceedings of the Computational Geometry, Graphs and Applications, 2010

Oja medians and centers of gravity.

[BibT_eX]

[DOI]

Proceedings of the 22nd Annual Canadian Conference on Computational Geometry, 2010

Ghost chimneys.

[BibT_eX]

[DOI]

Proceedings of the 22nd Annual Canadian Conference on Computational Geometry, 2010

Fast local searches and updates in bounded universes.

[BibT_eX]

[DOI]

Proceedings of the 22nd Annual Canadian Conference on Computational Geometry, 2010

Notes on Large Angle Crossing Graphs.

[BibT_eX]

[DOI]

Proceedings of the Theory of Computing 2010, 2010

2009

Algorithms for optimal outlier removal.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2009

Centerpoint Theorems for Wedges.

[BibT_eX]

[DOI]

Jeff Erickson

Ferran Hurtado

Discret. Math. Theor. Comput. Sci., 2009

Connectivity-preserving transformations of binary images.

[BibT_eX]

[DOI]

Comput. Vis. Image Underst., 2009

On the Expected Maximum Degree of Gabriel and Yao Graphs

[BibT_eX]

[DOI]

CoRR, 2009

Clamshell Casting.

[BibT_eX]

[DOI]

Algorithmica, 2009

Delaunay Triangulation of Imprecise Points Simplified and Extended.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures, 11th International Symposium, 2009

Succinct Orthogonal Range Search Structures on a Grid with Applications to Text Indexing.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures, 11th International Symposium, 2009

A Distribution-Sensitive Dictionary with Low Space Overhead.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures, 11th International Symposium, 2009

Biased range trees.

[BibT_eX]

[DOI]

Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

Succinct geometric indexes supporting point location queries.

[BibT_eX]

[DOI]

Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

2008

Output-sensitive algorithms for Tukey depth and related problems.

[BibT_eX]

[DOI]

Stat. Comput., 2008

Realizing partitions respecting full and partial order information.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2008

On the false-positive rate of Bloom filters.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2008

A Polynomial Bound for Untangling Geometric Planar Graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2008

Computing the Detour and Spanning Ratio of Paths, Trees, and Cycles in 2D and 3D.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2008

An optimal randomized algorithm for d-variate zonoid depth.

[BibT_eX]

[DOI]

Comput. Geom., 2008

Edge-unfolding nested polyhedral bands.

[BibT_eX]

[DOI]

Comput. Geom., 2008

Distinct Distances in Graph Drawings.

[BibT_eX]

[DOI]

Electron. J. Comb., 2008

Distribution-sensitive point location in convex subdivisions.

[BibT_eX]

[DOI]

Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

Randomized Rendez-Vous with Limited Memory.

[BibT_eX]

[DOI]

Evangelos Kranakis

Danny Krizanc

Proceedings of the LATIN 2008: Theoretical Informatics, 2008

Spanners of Complete k -Partite Geometric Graphs.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2008: Theoretical Informatics, 2008

2007

Space-efficient geometric divide-and-conquer algorithms.

[BibT_eX]

[DOI]

Comput. Geom., 2007

A Characterization of the Degree Sequences of 2-trees.

[BibT_eX]

[DOI]

Proceedings of the Fourth Workshop on Analytic Algorithmics and Combinatorics, 2007

2006

Simultaneous diagonal flips in plane triangulations.

[BibT_eX]

[DOI]

Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

Rotationally Monotone Polygons.

[BibT_eX]

[DOI]

Proceedings of the 18th Annual Canadian Conference on Computational Geometry, 2006

Removing Outliers to Minimize Area and Perimeter.

[BibT_eX]

[DOI]

Rossen Atanassov

Stefanie Wuhrer

Proceedings of the 18th Annual Canadian Conference on Computational Geometry, 2006

2005

Layout of Graphs with Bounded Tree-Width.

[BibT_eX]

[DOI]

SIAM J. Comput., 2005

Guest Editors' Foreword.

[BibT_eX]

[DOI]

Algorithmica, 2005

Approximate Range Mode and Range Median Queries.

[BibT_eX]

[DOI]

Proceedings of the STACS 2005, 2005

2004

Hash Tables.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Data Structures and Applications., 2004

Space-efficient planar convex hull algorithms.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2004

On Worst-Case Robin Hood Hashing.

[BibT_eX]

[DOI]

Alfredo Viola

SIAM J. Comput., 2004

The Maximum Number of Edges in a Three-Dimensional Grid-Drawing.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2004

The geometry of carpentry and joinery.

[BibT_eX]

[DOI]

Jason Morrison

Discret. Appl. Math., 2004

On simplifying dot maps.

[BibT_eX]

[DOI]

Comput. Geom., 2004

Testing the Quality of Manufactured Disks and Balls.

[BibT_eX]

[DOI]

Algorithmica, 2004

Reconfiguring Triangulations with Edge Flips and Point Moves.

[BibT_eX]

[DOI]

Greg Aloupis

Proceedings of the Graph Drawing, 12th International Symposium, 2004

Geodesic ham-sandwich cuts.

[BibT_eX]

[DOI]

Proceedings of the 20th ACM Symposium on Computational Geometry, 2004

Three-dimensional 1-bend graph drawings.

[BibT_eX]

[DOI]

Proceedings of the 16th Canadian Conference on Computational Geometry, 2004

Algorithms for bivariate zonoid depth.

[BibT_eX]

[DOI]

Harish Gopala

Proceedings of the 16th Canadian Conference on Computational Geometry, 2004

Unfolding polyhedral bands.

[BibT_eX]

[DOI]

Proceedings of the 16th Canadian Conference on Computational Geometry, 2004

Improving Distance Based Geographic Location Techniques in Sensor Networks.

[BibT_eX]

[DOI]

Proceedings of the Ad-Hoc, Mobile, and Wireless Networks: Third International Conference, 2004

2003

Cuckoo hashing: Further analysis.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2003

Computing the Center of Area of a Convex Polygon.

[BibT_eX]

[DOI]

Peter Braß

Laura Heinrich-Litan

Int. J. Comput. Geom. Appl., 2003

Fast approximations for sums of distances, clustering and the Fermat-Weber problem.

[BibT_eX]

[DOI]

Anil Maheshwari

Comput. Geom., 2003

Translating a regular grid over a point set.

[BibT_eX]

[DOI]

Comput. Geom., 2003

Output-Sensitive Algorithms for Computing Nearest-Neighbour Decision Boundaries.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures, 8th International Workshop, 2003

Bounds for Frequency Estimation of Packet Streams.

[BibT_eX]

Proceedings of the SIROCCO 10: Proceedings of the 10th Internaltional Colloquium on Structural Information Complexity, 2003

Range Mode and Range Median Queries on Lists and Trees.

[BibT_eX]

[DOI]

Danny Krizanc

Michiel H. M. Smid

Proceedings of the Algorithms and Computation, 14th International Symposium, 2003

2002

Computing the Maximum Detour and Spanning Ratio of Planar Paths, Trees, and Cycles.

[BibT_eX]

[DOI]

Stefan Langerman

Michael A. Soss

Proceedings of the STACS 2002, 19th Annual Symposium on Theoretical Aspects of Computer Science, Antibes, 2002

Asymmetric Communication Protocols via Hotlink Assignments.

[BibT_eX]

Proceedings of the SIROCCO 9, 2002

In-Place Planar Convex Hull Algorithms.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2002: Theoretical Informatics, 2002

Succinct Data Structures for Approximating Convex Functions with Applications.

[BibT_eX]

[DOI]

Proceedings of the Discrete and Computational Geometry, Japanese Conference, 2002

Path-Width and Three-Dimensional Straight-Line Grid Drawings of Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 10th International Symposium, 2002

Covering Things with Things.

[BibT_eX]

[DOI]

Stefan Langerman

Proceedings of the Algorithms, 2002

Ordered theta graphs.

[BibT_eX]

[DOI]

Proceedings of the 14th Canadian Conference on Computational Geometry, 2002

2001

Convexifying polygons with simple projections.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2001

The Grid Placement Problem.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures, 7th International Workshop, 2001

Competitive Online Routing in Geometric Graphs.

[BibT_eX]

Proceedings of the SIROCCO 8, 2001

Packing Two Disks into a Polygonal Environment.

[BibT_eX]

[DOI]

Antoine Vigneron

Proceedings of the Computing and Combinatorics, 7th Annual International Conference, 2001

2000

Online Routing in Convex Subdivisions.

[BibT_eX]

[DOI]

Alejandro López-Ortiz

Proceedings of the Algorithms and Computation, 11th International Conference, 2000

An Improved Algorithm for Subdivision Traversal without Extra Storage.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 11th International Conference, 2000

Flipping your Lid.

[BibT_eX]

[DOI]

Proceedings of the 12th Canadian Conference on Computational Geometry, 2000

1999

Testing the Quality of Manufactured Balls.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures, 6th International Workshop, 1999

Online Routing in Triangulations.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 10th International Symposium, 1999

Routing with guaranteed delivery in ad hoc wireless networks.

[BibT_eX]

[DOI]

Proceedings of the 3rd International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DIAL-M 1999), 1999

1998

Coarse grained parallel computing on heterogeneous systems.

[BibT_eX]

[DOI]

Proceedings of the 1998 ACM symposium on Applied Computing, 1998

Testing the Quality of Manufactured Disks and Cylinders.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 9th International Symposium, 1998

1997

Progressive TINs: Algorithms and Applications.

[BibT_eX]

[DOI]

Anil Maheshwari