2024
The Excluded Tree Minor Theorem Revisited.
Comb. Probab. Comput., January, 2024
Product Structure Extension of the Alon-Seymour-Thomas Theorem.
SIAM J. Discret. Math., 2024
Min-<i>k</i>-planar Drawings of Graphs.
J. Graph Algorithms Appl., 2024
On <i>k</i>-planar Graphs without Short Cycles.
CoRR, 2024
Planar graphs in blowups of fans.
CoRR, 2024
Vertex Ranking of Degenerate Graphs.
CoRR, 2024
Free Sets in Planar Graphs: History and Applications.
CoRR, 2024
Tight bound for the Erdős-Pósa property of tree minors.
CoRR, 2024
Grid Minors and Products.
CoRR, 2024
Bounded-Degree Planar Graphs Do Not Have Bounded-Degree Product Structure.
Electron. J. Comb., 2024
Graphs Drawn With Some Vertices per Face: Density and Relationships.
IEEE Access, 2024
The Grid-Minor Theorem Revisited.
Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024
Local Certification of Geometric Graph Classes.
Proceedings of the 49th International Symposium on Mathematical Foundations of Computer Science, 2024
On k-Planar Graphs Without Short Cycles.
Proceedings of the 32nd International Symposium on Graph Drawing and Network Visualization, 2024
Patricia's Bad Distributions.
Proceedings of the 35th International Conference on Probabilistic, 2024
2023
Stabbing Pairwise Intersecting Disks by Four Points.
Discret. Comput. Geom., December, 2023
Graph product structure for non-minor-closed classes.
J. Comb. Theory B, 2023
Dual Circumference and Collinear Sets.
Discret. Comput. Geom., 2023
Connected Dominating Sets in Triangulations.
CoRR, 2023
Geodesic obstacle representation of graphs.
Comput. Geom., 2023
Nonplanar Graph Drawings with k Vertices per Face.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2023
Min-k-planar Drawings of Graphs.
Proceedings of the Graph Drawing and Network Visualization - 31st International Symposium, 2023
Proof of the Clustered Hadwiger Conjecture.
Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023
2022
Separating layered treewidth and row treewidth.
Discret. Math. Theor. Comput. Sci., 2022
Drawing Graphs as Spanners.
Discret. Comput. Geom., 2022
Clustered 3-colouring graphs of bounded degree.
Comb. Probab. Comput., 2022
Linear versus centred chromatic numbers.
CoRR, 2022
$2\times n$ Grids have Unbounded Anagram-Free Chromatic Number.
Electron. J. Comb., 2022
Stack-Number is Not Bounded by Queue-Number.
Comb., 2022
An Optimal Algorithm for Product Structure in Planar Graphs.
Proceedings of the 18th Scandinavian Symposium and Workshops on Algorithm Theory, 2022
2021
Two Results on Layered Pathwidth and Linear Layouts.
J. Graph Algorithms Appl., 2021
Adjacency Labelling for Planar Graphs (and Beyond).
J. ACM, 2021
Every Collinear Set in a Planar Graph is Free.
Discret. Comput. Geom., 2021
Approximating Maximum Diameter-Bounded Subgraph in Unit Disk Graphs.
Discret. Comput. Geom., 2021
2×n Grids have Unbounded Anagram-Free Chromatic Number.
CoRR, 2021
A Fast Algorithm for the Product Structure of Planar Graphs.
Algorithmica, 2021
2020
Minor-Closed Graph Classes with Bounded Layered Pathwidth.
SIAM J. Discret. Math., 2020
Planar Graphs Have Bounded Queue-Number.
J. ACM, 2020
Sparse universal graphs for planarity.
CoRR, 2020
Asymptotically Optimal Vertex Ranking of Planar Graphs.
CoRR, 2020
2019
Notes on growing a tree in a graph.
Random Struct. Algorithms, 2019
The structure of k-planar graphs.
CoRR, 2019
Queue Layouts of Graphs with Bounded Degree and Bounded Genus.
CoRR, 2019
More Turán-Type Theorems for Triangles in Convex Point Sets.
Electron. J. Comb., 2019
2018
Corrigendum: Orthogonal Tree Decompositions of Graphs.
SIAM J. Discret. Math., 2018
Orthogonal Tree Decompositions of Graphs.
SIAM J. Discret. Math., 2018
Near-Optimal O(k)-Robust Geometric Spanners.
CoRR, 2018
A note on interference in random networks.
Comput. Geom., 2018
Spanning Trees in Multipartite Geometric Graphs.
Algorithmica, 2018
Anagram-Free Chromatic Number Is Not Pathwidth-Bounded.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2018
2017
Array Layouts for Comparison-Based Searching.
ACM J. Exp. Algorithmics, 2017
Layered separators in minor-closed graph classes with applications.
J. Comb. Theory B, 2017
New Bounds for Facial Nonrepetitive Colouring.
Graphs Comb., 2017
EPG-representations with Small Grid-Size.
Proceedings of the Graph Drawing and Network Visualization - 25th International Symposium, 2017
2016
Towards tight bounds on theta-graphs: More is not always better.
Theor. Comput. Sci., 2016
Int. J. Comput. Geom. Appl., 2016
Biased Predecessor Search.
Algorithmica, 2016
2015
Average Stretch Factor: How Low Does It Go?
Discret. Comput. Geom., 2015
Compatible Connectivity Augmentation of Planar Disconnected Graphs.
Discret. Comput. Geom., 2015
Reprint of: Approximating majority depth.
Comput. Geom., 2015
The θ<sub>5</sub>-graph is a spanner.
Comput. Geom., 2015
Visibility-monotonic polygon deflation.
Contributions Discret. Math., 2015
2014
Towards Tight Bounds on Theta-Graphs.
CoRR, 2014
Guest Editor's Introduction.
Comput. Geom., 2014
Crossings in Grid Drawings.
Electron. J. Comb., 2014
Searching by Panning and Zooming.
Proceedings of the 26th Canadian Conference on Computational Geometry, 2014
On the Average Number of Edges in Theta Graphs.
Proceedings of the 2014 Proceedings of the Eleventh Workshop on Analytic Algorithmics and Combinatorics, 2014
2013
Robust Geometric Spanners.
SIAM J. Comput., 2013
Coverage with k-transmitters in the presence of obstacles.
,
,
,
,
,
,
,
,
,
,
,
,
,
J. Comb. Optim., 2013
The Fresh-Finger Property
CoRR, 2013
Layered Separators in Minor-Closed Families with Applications.
CoRR, 2013
Absolute approximation of Tukey depth: Theory and experiments.
Comput. Geom., 2013
Approximating majority depth.
Comput. Geom., 2013
Oja centers and centers of gravity.
Comput. Geom., 2013
Fast local searches and updates in bounded universes.
Comput. Geom., 2013
The θ 5-Graph is a Spanner.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2013
Layered Separators for Queue Layouts, 3D Graph Drawing and Nonrepetitive Coloring.
Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science, 2013
A History of Distribution-Sensitive Data Structures.
Proceedings of the Space-Efficient Data Structures, 2013
2012
Entropy, triangulation, and point location in planar subdivisions.
ACM Trans. Algorithms, 2012
Succinct geometric indexes supporting point location queries.
ACM Trans. Algorithms, 2012
A distribution-sensitive dictionary with low space overhead.
J. Discrete Algorithms, 2012
Skip lift: A probabilistic alternative to red-black trees.
J. Discrete Algorithms, 2012
Int. J. Comput. Geom. Appl., 2012
The theta-5-graph is a spanner
CoRR, 2012
A Note on Interference in Random Point Sets
CoRR, 2012
Memoryless routing in convex subdivisions: Random walks are optimal.
Comput. Geom., 2012
Optimal Bounds on Theta-Graphs: More is not Always Better.
Proceedings of the 24th Canadian Conference on Computational Geometry, 2012
2011
Randomized rendezvous with limited memory.
ACM Trans. Algorithms, 2011
Notes on Large Angle Crossing Graphs.
Chic. J. Theor. Comput. Sci., 2011
Algorithms for Marketing-Mix Optimization.
Algorithmica, 2011
Preprocessing Imprecise Points for Delaunay Triangulation: Simplified and Extended.
Algorithmica, 2011
Algorithms for Bivariate Majority Depth.
Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, 2011
2010
J. Discrete Algorithms, 2010
A Tight Bound on the Maximum Interference of Random Sensors in the Highway Model
CoRR, 2010
Point Location in Disconnected Planar Subdivisions
CoRR, 2010
Improved Methods For Generating Quasi-gray Codes.
Proceedings of the Algorithm Theory, 2010
Planar visibility: testing and counting.
Proceedings of the 26th ACM Symposium on Computational Geometry, 2010
Coverage with <i>k</i>-Transmitters in the Presence of Obstacles.
,
,
,
,
,
,
,
,
,
,
,
,
,
Proceedings of the Combinatorial Optimization and Applications, 2010
Common Unfoldings of Polyominoes and Polycubes.
Proceedings of the Computational Geometry, Graphs and Applications, 2010
Oja medians and centers of gravity.
Proceedings of the 22nd Annual Canadian Conference on Computational Geometry, 2010
2009
Spanners of Complete k-Partite Geometric Graphs.
SIAM J. Comput., 2009
Algorithms for optimal outlier removal.
J. Discrete Algorithms, 2009
Centerpoint Theorems for Wedges.
Discret. Math. Theor. Comput. Sci., 2009
Connectivity-preserving transformations of binary images.
Comput. Vis. Image Underst., 2009
On the Expected Maximum Degree of Gabriel and Yao Graphs
CoRR, 2009
Rotationally monotone polygons.
Comput. Geom., 2009
Delaunay Triangulation of Imprecise Points Simplified and Extended.
Proceedings of the Algorithms and Data Structures, 11th International Symposium, 2009
Succinct Orthogonal Range Search Structures on a Grid with Applications to Text Indexing.
Proceedings of the Algorithms and Data Structures, 11th International Symposium, 2009
2008
Output-sensitive algorithms for Tukey depth and related problems.
Stat. Comput., 2008
A Characterization of the degree sequences of 2-trees.
J. Graph Theory, 2008
Realizing partitions respecting full and partial order information.
J. Discrete Algorithms, 2008
On the false-positive rate of Bloom filters.
Inf. Process. Lett., 2008
A Polynomial Bound for Untangling Geometric Planar Graphs.
Electron. Notes Discret. Math., 2008
Computing the Detour and Spanning Ratio of Paths, Trees, and Cycles in 2D and 3D.
Discret. Comput. Geom., 2008
An optimal randomized algorithm for d-variate zonoid depth.
Comput. Geom., 2008
Algorithms for bivariate zonoid depth.
Comput. Geom., 2008
Edge-unfolding nested polyhedral bands.
Comput. Geom., 2008
Distinct Distances in Graph Drawings.
Electron. J. Comb., 2008
Distribution-sensitive point location in convex subdivisions.
Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008
Randomized Rendez-Vous with Limited Memory.
Proceedings of the LATIN 2008: Theoretical Informatics, 2008
2007
Simultaneous diagonal flips in plane triangulations.
J. Graph Theory, 2007
Geodesic Ham-Sandwich Cuts.
Discret. Comput. Geom., 2007
Space-efficient geometric divide-and-conquer algorithms.
Comput. Geom., 2007
Reconfiguring Triangulations with Edge Flips and Point Moves.
Algorithmica, 2007
2006
Removing Outliers to Minimize Area and Perimeter.
Proceedings of the 18th Annual Canadian Conference on Computational Geometry, 2006
2005
Layout of Graphs with Bounded Tree-Width.
SIAM J. Comput., 2005
Range Mode and Range Median Queries on Lists and Trees.
Nord. J. Comput., 2005
Covering Things with Things.
Discret. Comput. Geom., 2005
Output-Sensitive Algorithms for Computing Nearest-Neighbour Decision Boundaries.
Discret. Comput. Geom., 2005
Approximate Range Mode and Range Median Queries.
Proceedings of the STACS 2005, 2005
2004
Proceedings of the Handbook of Data Structures and Applications., 2004
Space-efficient planar convex hull algorithms.
Theor. Comput. Sci., 2004
Competitive online routing in geometric graphs.
Theor. Comput. Sci., 2004
On Worst-Case Robin Hood Hashing.
SIAM J. Comput., 2004
Online Routing in Triangulations.
SIAM J. Comput., 2004
Three-Dimensional 1-Bend Graph Drawings.
J. Graph Algorithms Appl., 2004
The Maximum Number of Edges in a Three-Dimensional Grid-Drawing.
J. Graph Algorithms Appl., 2004
Packing two disks into a polygonal environment.
J. Discrete Algorithms, 2004
The geometry of carpentry and joinery.
Discret. Appl. Math., 2004
Testing the Quality of Manufactured Disks and Balls.
Algorithmica, 2004
Unfolding polyhedral bands.
Proceedings of the 16th Canadian Conference on Computational Geometry, 2004
Improving Distance Based Geographic Location Techniques in Sensor Networks.
Proceedings of the Ad-Hoc, Mobile, and Wireless Networks: Third International Conference, 2004
2003
Asymmetric Communication Protocols via Hotlink Assignments.
Theory Comput. Syst., 2003
Cuckoo hashing: Further analysis.
Inf. Process. Lett., 2003
Computing the Center of Area of a Convex Polygon.
Int. J. Comput. Geom. Appl., 2003
Fast approximations for sums of distances, clustering and the Fermat-Weber problem.
Comput. Geom., 2003
Translating a regular grid over a point set.
Comput. Geom., 2003
Bounds for Frequency Estimation of Packet Streams.
Proceedings of the SIROCCO 10: Proceedings of the 10th Internaltional Colloquium on Structural Information Complexity, 2003
2002
An Improved Algorithm for Subdivision Traversal without Extra Storage.
Int. J. Comput. Geom. Appl., 2002
Online Routing in Convex Subdivisions.
Int. J. Comput. Geom. Appl., 2002
Computing the Maximum Detour and Spanning Ratio of Planar Paths, Trees, and Cycles.
Proceedings of the STACS 2002, 19th Annual Symposium on Theoretical Aspects of Computer Science, Antibes, 2002
In-Place Planar Convex Hull Algorithms.
Proceedings of the LATIN 2002: Theoretical Informatics, 2002
Succinct Data Structures for Approximating Convex Functions with Applications.
Proceedings of the Discrete and Computational Geometry, Japanese Conference, 2002
Path-Width and Three-Dimensional Straight-Line Grid Drawings of Graphs.
Proceedings of the Graph Drawing, 10th International Symposium, 2002
2001
Routing with Guaranteed Delivery in Ad Hoc Wireless Networks.
Wirel. Networks, 2001
Convexifying polygons with simple projections.
Inf. Process. Lett., 2001
The Grid Placement Problem.
Proceedings of the Algorithms and Data Structures, 7th International Workshop, 2001
2000
Proceedings of the 12th Canadian Conference on Computational Geometry, 2000
1999
Testing the Quality of Manufactured Balls.
Proceedings of the Algorithms and Data Structures, 6th International Workshop, 1999
1998
Coarse grained parallel computing on heterogeneous systems.
Proceedings of the 1998 ACM symposium on Applied Computing, 1998
Testing the Quality of Manufactured Disks and Cylinders.
Proceedings of the Algorithms and Computation, 9th International Symposium, 1998
1997
Progressive TINs: Algorithms and Applications.
Proceedings of the GIS '97. Proceedings of the 5th International Workshop on Advances in Geographic Information Systems, 1997
