Henk Meijer

CoRR, 2024

2023

New Bounds on the Local and Global Edge-length Ratio of Planar Graphs.

[BibT_eX]

[DOI]

CoRR, 2023

2021

Packing Trees into 1-planar Graphs.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2021

2020

Polyline drawings with topological constraints.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

Colored anchored visibility representations in 2D and 3D space.

[BibT_eX]

[DOI]

Comput. Geom., 2020

2019

Coordinated Motion Planning: Reconfiguring a Swarm of Labeled Robots with Bounded Stretch.

[BibT_eX]

[DOI]

SIAM J. Comput., 2019

Line and Plane Cover Numbers Revisited.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing and Network Visualization - 27th International Symposium, 2019

2018

New results on edge partitions of 1-plane graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2018

Visibility representations of boxes in 2.5 dimensions.

[BibT_eX]

[DOI]

Sue Whitesides

Comput. Geom., 2018

Ortho-polygon Visibility Representations of Embedded Graphs.

[BibT_eX]

[DOI]

Algorithmica, 2018

2016

Alternating paths and cycles of minimum length.

[BibT_eX]

[DOI]

Comput. Geom., 2016

2015

Point Set Embedding in 3D.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2015

Planar and Quasi-Planar Simultaneous Geometric Embedding.

[BibT_eX]

[DOI]

Comput. J., 2015

The Approximate Rectangle of Influence Drawability Problem.

[BibT_eX]

[DOI]

Emilio Di Giacomo

Silvia Fernández-Merchant

Algorithmica, 2015

2013

Proximity graphs inside large weighted graphs.

[BibT_eX]

[DOI]

Bernardo M. Ábrego

Ruy Fabila Monroy

David Flores-Peñaloza

Networks, 2013

Approximate proximity drawings.

[BibT_eX]

[DOI]

Comput. Geom., 2013

2012

Drawing a tree as a minimum spanning tree approximation.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2012

Universal point sets for 2-coloured trees.

[BibT_eX]

[DOI]

Mereke van Garderen

Inf. Process. Lett., 2012

PROXIMITY GRAPHS: E, δ, Δ, χ AND ω.

[BibT_eX]

[DOI]

Vera Sacristán Adinolfi

Maria Saumell

David R. Wood

Int. J. Comput. Geom. Appl., 2012

Universal Point Subsets for Planar Graphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation - 23rd International Symposium, 2012

Point-Set Embedding in Three Dimensions.

[BibT_eX]

[DOI]

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

2011

Area, Curve Complexity, and Crossing Resolution of Non-Planar Graph Drawings.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2011

Geometric Simultaneous Embeddings of a Graph and a Matching.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2011

On Planar Supports for Hypergraphs.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2011

Computing Signed Permutations of Polygons.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2011

2010

Constrained Point-Set Embeddability of Planar Graphs.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2010

Matched drawability of graph pairs and of graph triples.

[BibT_eX]

[DOI]

Comput. Geom., 2010

Fault Recovery in Wireless Networks: The Geometric Recolouring Approach.

[BibT_eX]

[DOI]

Proceedings of the Experimental Algorithms, 9th International Symposium, 2010

Universal Pointsets for 2-Coloured Trees.

[BibT_eX]

[DOI]

Mereke van Garderen

Proceedings of the Graph Drawing - 18th International Symposium, 2010

2009

An algorithm for computing simple k-factors.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2009

Volume requirements of 3D upward drawings.

[BibT_eX]

[DOI]

Discret. Math., 2009

Bounds for point recolouring in geometric graphs.

[BibT_eX]

[DOI]

Comput. Geom., 2009

Editorial CCCG 2006.

[BibT_eX]

[DOI]

Comput. Geom., 2009

Point-set embeddings of trees with given partial drawings.

[BibT_eX]

[DOI]

Comput. Geom., 2009

The distance geometry of music.

[BibT_eX]

[DOI]

Erik D. Demaine

Francisco Gomez-Martin

Perouz Taslakian

Terry Winograd

David R. Wood

Comput. Geom., 2009

Not being (super)thin or solid is hard: A study of grid Hamiltonicity.

[BibT_eX]

[DOI]

Joseph S. B. Mitchell

Valentin Polishchuk

Henry Xiao

Comput. Geom., 2009

Maximizing the lifetime of wireless sensor networks through domatic partition.

[BibT_eX]

[DOI]

Proceedings of the 34th Annual IEEE Conference on Local Computer Networks, 2009

Distributed Generation of a Family of Connected Dominating Sets in Wireless Sensor Networks.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing in Sensor Systems, 2009

2008

k-colored Point-set Embeddability of Outerplanar Graphs.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2008

Realizing partitions respecting full and partial order information.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2008

Planar tree transformation: Results and counterexample.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2008

Minimizing the Stabbing Number of Matchings, Trees, and Triangulations.

[BibT_eX]

[DOI]

Marco E. Lübbecke

Discret. Comput. Geom., 2008

Communication-Aware Processor Allocation for Supercomputers: Finding Point Sets of Small Average Distance.

[BibT_eX]

[DOI]

Algorithmica, 2008

A Constant Factor Localized Algorithm for Computing Connected Dominating Sets in Wireless Sensor Networks.

[BibT_eX]

[DOI]

Proceedings of the 14th International Conference on Parallel and Distributed Systems, 2008

On the Complexity of Point Recolouring in Geometric Graphs.

[BibT_eX]

Proceedings of the 20th Annual Canadian Conference on Computational Geometry, 2008

Direct Planar Tree Transformation and Counterexample.

[BibT_eX]

Proceedings of the 20th Annual Canadian Conference on Computational Geometry, 2008

2007

On the probabilistic behaviour of a heuristic algorithm for maximal Hamiltonian tours.

[BibT_eX]

[DOI]

Marco Martens

J. Discrete Algorithms, 2007

On planar path transformation.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2007

Efficient Many-To-Many Point Matching in One Dimension.

[BibT_eX]

[DOI]

Graphs Comb., 2007

Advances in graph drawing: The 11th International Symposium on Graph Drawing.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2007

Point-Set Embedding of Trees with Edge Constraints.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 15th International Symposium, 2007

Hamilton Circuits in Hexagonal Grid Graphs.

[BibT_eX]

[DOI]

Henry Xiao

Proceedings of the 19th Annual Canadian Conference on Computational Geometry, 2007

2006

An O(n log n)-Time Algorithm for the Restriction Scaffold Assignment Problem.

[BibT_eX]

[DOI]

J. Comput. Biol., 2006

Biclique Edge Cover Graphs and Confluent Drawings.

[BibT_eX]

[DOI]

Michael Hirsch

Proceedings of the Graph Drawing, 14th International Symposium, 2006

k -Colored Point-Set Embeddability of Outerplanar Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 14th International Symposium, 2006

Curves in the Sand: Algorithmic Drawing.

[BibT_eX]

[DOI]

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

2005

Computing Radial Drawings on the Minimum Number of Circles.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2005

Guest Editors' Foreword.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2005

Separating Point Sets in Polygonal Environments.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2005

An O(n log n)-Time Algorithm for the Restricted Scaffold Assignment

[BibT_eX]

[DOI]

CoRR, 2005

Computing straight-line 3D grid drawings of graphs in linear volume.

[BibT_eX]

[DOI]

Emilio Di Giacomo

Comput. Geom., 2005

The one-round Voronoi game replayed.

[BibT_eX]

[DOI]

Comput. Geom., 2005

Communication-Aware Processor Allocation for Supercomputers.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures, 9th International Workshop, 2005

Bi-chromatic minimum spanning trees.

[BibT_eX]

[DOI]

Magdalene Grantson

Proceedings of the (Informal) Proceedings of the 21st European Workshop on Computational Geometry, 2005

Closest Segments.

[BibT_eX]

[DOI]

Proceedings of the 17th Canadian Conference on Computational Geometry, 2005

The Distance Geometry of Deep Rhythms and Scales.

[BibT_eX]

[DOI]

Erik D. Demaine

Francisco Gomez-Martin

Perouz Taslakian

Terry Winograd

David R. Wood

Proceedings of the 17th Canadian Conference on Computational Geometry, 2005

2004

Completion of Computation of Improved Upper Bound on the Maximum Average Linear Hull Probabilty for Rijndael.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2004

Maximum Dispersion and Geometric Maximum Weight Cliques.

[BibT_eX]

[DOI]

Algorithmica, 2004

Simultaneous edge flips for convex subdivisions.

[BibT_eX]

[DOI]

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

2003

The Largest Empty Annulus Problem.

[BibT_eX]

[DOI]

José Miguel Díaz-Báñez

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

Voronoi drawings of trees.

[BibT_eX]

[DOI]

Comput. Geom., 2003

Optimal and suboptimal robust algorithms for proximity graphs.

[BibT_eX]

[DOI]

Ferran Hurtado

Comput. Geom., 2003

Long proteins with unique optimal foldings in the H-P model.

[BibT_eX]

[DOI]

Comput. Geom., 2003

Track Drawings of Graphs with Constant Queue Number.

[BibT_eX]

[DOI]

Emilio Di Giacomo

Proceedings of the Graph Drawing, 11th International Symposium, 2003

2002

Finding Specified Sections of Arrangements: 2D Results.

[BibT_eX]

[DOI]

J. Math. Model. Algorithms, 2002

Solving a "Hard" Problem to Approximate an "Easy" One: Heuristics for Maximum Matchings and Maximum Traveling Salesman Problems.

[BibT_eX]

[DOI]

ACM J. Exp. Algorithmics, 2002

Flipturning Polygons.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2002

Flat-State Connectivity of Linkages under Dihedral Motions.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 13th International Symposium, 2002

On flat-state connectivity of chains with fixed acute angles.

[BibT_eX]

[DOI]

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

2001

Dual of New Method for Upper Bounding the Maximum Average Linear Hull Probability for SPNs.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2001

On the visibility graph of convex translates.

[BibT_eX]

[DOI]

Kiyoshi Hosono

Discret. Appl. Math., 2001

Minimum convex partition of a constrained point set.

[BibT_eX]

[DOI]

Thomas Fevens

Discret. Appl. Math., 2001

Optimal, Suboptimal, and Robust Algorithms for Proximity Graphs.

[BibT_eX]

[DOI]

Ferran Hurtado

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

Improving the Upper Bound on the Maximum Average Linear Hull Probability for Rijndael.

[BibT_eX]

[DOI]

Proceedings of the Selected Areas in Cryptography, 8th Annual International Workshop, 2001

New Method for Upper Bounding the Maximum Average Linear Hull Probability for SPNs.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2001

2000

On Minimum Stars and Maximum Matchings.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2000

1999

Rectangle and Box Visibility Graphs in 3D.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 1999

Evolutionary Trees and Ordinal Assertions.

[BibT_eX]

[DOI]

Paul E. Kearney

Ryan Hayward

Algorithmica, 1999

Modeling Linear Characteristics of Substitution-Permutation Networks.

[BibT_eX]

[DOI]

Proceedings of the Selected Areas in Cryptography, 6th Annual International Workshop, 1999

Rectangle of Influence Drawings of Graphs without Filled 3-Cycles.

[BibT_eX]

[DOI]

Therese Biedl

Anna Bretscher

Proceedings of the Graph Drawing, 7th International Symposium, 1999

On Minimum Stars, Minimum Steiner Stars, and Maximum Matchings.

[BibT_eX]

[DOI]

Proceedings of the Fifteenth Annual Symposium on Computational Geometry, 1999

1998

Algorithms for Cluster Busting in Anchored Graph Drawing.

[BibT_eX]

[DOI]

Kelly A. Lyons

J. Graph Algorithms Appl., 1998

A Visibility Representation for Graphs in Three Dimensions.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 1998

Computing the Angularity Tolerance.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 1998

Decision trees for geometric models.

[BibT_eX]

[DOI]

Esther M. Arkin

Joseph S. B. Mitchell

Steven Skiena

Int. J. Comput. Geom. Appl., 1998

The rectangle of influence drawability problem.

[BibT_eX]

[DOI]

Comput. Geom., 1998

1997

Inferring Evolutionary Trees from Ordinal Data.

[BibT_eX]

[DOI]

Paul E. Kearney

Ryan Hayward

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

1996

Optimal Communication Primitives on the Generalized Hypercube Network.

[BibT_eX]

[DOI]

Paraskevi Fragopoulou

J. Parallel Distributed Comput., 1996

1995

Motivating lazy guards.

[BibT_eX]

[DOI]

Paul Colley

Proceedings of the 7th Canadian Conference on Computational Geometry, 1995

1994

On Some Properties and Algorithms for the Star and Pancake Interconnection Networks.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 1994

An Optimal Systolic Algorithm for Generating Permutations in Lexicographic Order.

[BibT_eX]

[DOI]

Ivan Stojmenovic

J. Parallel Distributed Comput., 1994

Recognizing Rectangle of Influence Drawable Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, DIMACS International Workshop, 1994

Optimal Nearly-Similar Polygon Stabbers of Convex Polygons.

[BibT_eX]

Paul Colley

Proceedings of the 6th Canadian Conference on Computational Geometry, 1994

1993

Reconstructing Polygons From X-Rays.

[BibT_eX]

Steven Skiena

Proceedings of the 5th Canadian Conference on Computational Geometry, 1993

Properties of the voronoi diagram cluster buster.

[BibT_eX]

[DOI]

Kelly A. Lyons

Proceedings of the 1993 Conference of the Centre for Advanced Studies on Collaborative Research, 1993

1992

Computing the Minimum Weight Triangulation of a Set of Linearly Ordered Points.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1992

1991

Decomposing a Star Graph Into Disjoint Cycles.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1991

Parallel Routing and Sorting of the Pancake Network.

[BibT_eX]

[DOI]

Proceedings of the Advances in Computing and Information, 1991

1990

Parallel Binary Search.

[BibT_eX]

[DOI]

IEEE Trans. Parallel Distributed Syst., 1990

A Note on Diameter of Acyclic Directed Hypercubes.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1990

Parallel Binary Search with Delayed Read Conflicts.

[BibT_eX]

[DOI]

Int. J. High Speed Comput., 1990

1989

Security-related comments regarding McEliece's public-key cryptosystem.

[BibT_eX]

[DOI]

Carlisle M. Adams

IEEE Trans. Inf. Theory, 1989

Expressing parallel algorithms in Nial.

[BibT_eX]

[DOI]

Parallel Comput., 1989

1988

On the bit complexity of parallel computations.

[BibT_eX]

[DOI]

Integr., 1988

Bit serial addition trees and their applications.

[BibT_eX]

[DOI]

Computing, 1988

Fault Tolerant Networks of Specified Diameter.

[BibT_eX]

[DOI]

R. Dawes

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

1987

Optimal computation of prefix sums on a binary tree of processors.

[BibT_eX]

[DOI]

Int. J. Parallel Program., 1987

1985

An Optimal Algorithm for Assigning Cryptographic Keys to Control Access in a Hierarchy.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 1985

A note on the method of puzzles for key distribution.

[BibT_eX]

[DOI]

Becky Chan

Int. J. Parallel Program., 1985

Two New Secret Key Cryptosystems.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 1985

1984

A Fast Pseudo Random Permutation Generator With Applications to Cryptology.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 1984

1983

Remarks on a Digital Signature Scheme.

[BibT_eX]

[DOI]

Cryptologia, 1983

1982

On the Average-Case Complexity of "Bucketing" Algorithms.

[BibT_eX]

[DOI]

J. Algorithms, 1982

Digital Signature Schemes.

[BibT_eX]

[DOI]

Cryptologia, 1982

1981

A Note on 'A Cryptosystem for Multiple Communication'.

[BibT_eX]

[DOI]