|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 52 occurrences of 44 keywords
|
|
|
|
|
Results
Found 132 publication records. Showing 132 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Mereke van Garderen, Giuseppe Liotta, Henk Meijer |
Universal point sets for 2-coloured trees.  |
Inf. Process. Lett.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer |
Drawing a tree as a minimum spanning tree approximation.  |
J. Comput. Syst. Sci.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer |
Area, Curve Complexity, and Crossing Resolution of Non-Planar Graph Drawings.  |
Theory Comput. Syst.  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Kevin Buchin, Marc J. van Kreveld, Henk Meijer, Bettina Speckmann, Kevin Verbeek |
On Planar Supports for Hypergraphs.  |
J. Graph Algorithms Appl.  |
2011 |
DBLP BibTeX RDF |
|
| 1 | Sergio Cabello, Marc J. van Kreveld, Giuseppe Liotta, Henk Meijer, Bettina Speckmann, Kevin Verbeek |
Geometric Simultaneous Embeddings of a Graph and a Matching.  |
J. Graph Algorithms Appl.  |
2011 |
DBLP BibTeX RDF |
|
| 1 | Greg Aloupis, Prosenjit Bose, Erik D. Demaine, Stefan Langerman, Henk Meijer, Mark H. Overmars, Godfried T. Toussaint |
Computing Signed Permutations of Polygons.  |
Int. J. Comput. Geometry Appl.  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | William Evans, Emden R. Gansner, Michael Kaufmann, Giuseppe Liotta, Henk Meijer, Andreas Spillner |
Approximate Proximity Drawings.  |
Graph Drawing  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Luca Grilli, Seok-Hee Hong, Giuseppe Liotta, Henk Meijer, Stephen K. Wismath |
Matched drawability of graph pairs and of graph triples.  |
Comput. Geom.  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer, Stephen K. Wismath |
Constrained Point-Set Embeddability of Planar Graphs.  |
Int. J. Comput. Geometry Appl.  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Henk Meijer, Yurai Núñez Rodríguez, David Rappaport |
Fault Recovery in Wireless Networks: The Geometric Recolouring Approach.  |
SEA  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer |
Drawing a Tree as a Minimum Spanning Tree Approximation.  |
ISAAC  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Mereke van Garderen, Giuseppe Liotta, Henk Meijer |
Universal Pointsets for 2-Coloured Trees.  |
Graph Drawing  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Henk Meijer, Yurai Núñez Rodríguez, David Rappaport |
An algorithm for computing simple k-factors.  |
Inf. Process. Lett.  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Emilio Di Giacomo, Giuseppe Liotta, Henk Meijer, Stephen K. Wismath |
Volume requirements of 3D upward drawings.  |
Discrete Mathematics  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer, Stephen K. Wismath |
Point-set embeddings of trees with given partial drawings.  |
Comput. Geom.  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Erik D. Demaine, Francisco Gomez-Martin, Henk Meijer, David Rappaport, Perouz Taslakian, Godfried T. Toussaint, Terry Winograd, David R. Wood |
The distance geometry of music.  |
Comput. Geom.  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Henk Meijer, Yurai Núñez Rodríguez, David Rappaport |
Bounds for point recolouring in geometric graphs.  |
Comput. Geom.  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Esther M. Arkin, Sándor P. Fekete, Kamrul Islam, Henk Meijer, Joseph S. B. Mitchell, Yurai Núñez Rodríguez, Valentin Polishchuk, David Rappaport, Henry Xiao |
Not being (super)thin or solid is hard: A study of grid Hamiltonicity.  |
Comput. Geom.  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Henk Meijer, David Rappaport |
Editorial CCCG 2006.  |
Comput. Geom.  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Kamrul Islam, Selim G. Akl, Henk Meijer |
Distributed Generation of a Family of Connected Dominating Sets in Wireless Sensor Networks.  |
DCOSS  |
2009 |
DBLP DOI BibTeX RDF |
Minimum Vertex-cut, Wireless Sensor Network, Distributed Algorithm, Maximal Clique |
| 1 | Luca Grilli, Seok-Hee Hong, Giuseppe Liotta, Henk Meijer, Stephen K. Wismath |
Matched Drawability of Graph Pairs and of Graph Triples.  |
WALCOM  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Kamrul Islam, Selim G. Akl, Henk Meijer |
Maximizing the lifetime of wireless sensor networks through domatic partition.  |
LCN  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer |
Area, Curve Complexity, and Crossing Resolution of Non-planar Graph Drawings.  |
Graph Drawing  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Sergio Cabello, Marc J. van Kreveld, Giuseppe Liotta, Henk Meijer, Bettina Speckmann, Kevin Verbeek |
Geometric Simultaneous Embeddings of a Graph and a Matching.  |
Graph Drawing  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Kevin Buchin, Marc J. van Kreveld, Henk Meijer, Bettina Speckmann, Kevin Verbeek |
On Planar Supports for Hypergraphs.  |
Graph Drawing  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Selim G. Akl, Kamrul Islam, Henk Meijer |
Planar tree transformation: Results and counterexample.  |
Inf. Process. Lett.  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael A. Bender, David P. Bunde, Erik D. Demaine, Sándor P. Fekete, Vitus J. Leung, Henk Meijer, Cynthia A. Phillips |
Communication-Aware Processor Allocation for Supercomputers: Finding Point Sets of Small Average Distance.  |
Algorithmica  |
2008 |
DBLP DOI BibTeX RDF |
Manhattan distance, Clustering, Approximation, Supercomputers, Communication cost, Processor allocation, Polynomial-time approximation scheme (PTAS) |
| 1 | Sándor P. Fekete, Marco E. Lübbecke, Henk Meijer |
Minimizing the Stabbing Number of Matchings, Trees, and Triangulations.  |
Discrete & Computational Geometry  |
2008 |
DBLP DOI BibTeX RDF |
Stabbing number, Complexity, Matching, Triangulation, Spanning tree, Linear programming relaxation, Iterated rounding |
| 1 | Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer, Francesco Trotta, Stephen K. Wismath |
k-colored Point-set Embeddability of Outerplanar Graphs.  |
J. Graph Algorithms Appl.  |
2008 |
DBLP BibTeX RDF |
|
| 1 | Erik D. Demaine, Jeff Erickson, Danny Krizanc, Henk Meijer, Pat Morin, Mark H. Overmars, Sue Whitesides |
Realizing partitions respecting full and partial order information.  |
J. Discrete Algorithms  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Henk Meijer, Yurai Núñez Rodríguez, David Rappaport |
On the Complexity of Point Recolouring in Geometric Graphs.  |
CCCG  |
2008 |
DBLP BibTeX RDF |
|
| 1 | Selim G. Akl, Kamrul Islam, Henk Meijer |
Direct Planar Tree Transformation and Counterexample.  |
CCCG  |
2008 |
DBLP BibTeX RDF |
|
| 1 | Kamrul Islam, Selim G. Akl, Henk Meijer |
A Constant Factor Localized Algorithm for Computing Connected Dominating Sets in Wireless Sensor Networks.  |
ICPADS  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer, Stephen K. Wismath |
Constrained Point-Set Embeddability of Planar Graphs.  |
Graph Drawing  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Selim G. Akl, Kamrul Islam, Henk Meijer |
On planar path transformation.  |
Inf. Process. Lett.  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Erik D. Demaine, Francisco Gomez-Martin, Henk Meijer, David Rappaport, Perouz Taslakian, Godfried T. Toussaint, Terry Winograd, David R. Wood |
The Distance Geometry of Music  |
CoRR  |
2007 |
DBLP BibTeX RDF |
|
| 1 | Giuseppe Liotta, Henk Meijer |
Advances in graph drawing: The 11th International Symposium on Graph Drawing.  |
Discrete Applied Mathematics  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Marco Martens, Henk Meijer |
On the probabilistic behaviour of a heuristic algorithm for maximal Hamiltonian tours.  |
J. Discrete Algorithms  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Kamrul Islam, Henk Meijer, Yurai Núñez Rodríguez, David Rappaport, Henry Xiao |
Hamilton Circuits in Hexagonal Grid Graphs.  |
CCCG  |
2007 |
DBLP BibTeX RDF |
|
| 1 | Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer, Stephen K. Wismath |
Point-Set Embedding of Trees with Edge Constraints.  |
Graph Drawing  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Justin Colannino, Mirela Damian, Ferran Hurtado, John Iacono, Henk Meijer, Suneeta Ramaswami, Godfried T. Toussaint |
An O(n log n)-Time Algorithm for the Restriction Scaffold Assignment Problem.  |
Journal of Computational Biology  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Mirela Damian, Erik D. Demaine, Martin L. Demaine, Vida Dujmovic, Dania El-Khechen, Robin Y. Flatland, John Iacono, Stefan Langerman, Henk Meijer, Suneeta Ramaswami, Diane L. Souvaine, Perouz Taslakian, Godfried T. Toussaint |
Curves in the Sand: Algorithmic Drawing.  |
CCCG  |
2006 |
DBLP BibTeX RDF |
|
| 1 | Kamrul Islam, Selim G. Akl, Henk Meijer |
On Planar Path Transformation.  |
CCCG  |
2006 |
DBLP BibTeX RDF |
|
| 1 | Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer, Francesco Trotta, Stephen K. Wismath |
k -Colored Point-Set Embeddability of Outerplanar Graphs.  |
Graph Drawing  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Hirsch, Henk Meijer, David Rappaport |
Biclique Edge Cover Graphs and Confluent Drawings.  |
Graph Drawing  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Justin Colannino, Mirela Damian, Ferran Hurtado, John Iacono, Henk Meijer, Suneeta Ramaswami, Godfried T. Toussaint |
An O(n log n)-Time Algorithm for the Restricted Scaffold Assignment  |
CoRR  |
2005 |
DBLP BibTeX RDF |
|
| 1 | Emilio Di Giacomo, Giuseppe Liotta, Henk Meijer |
Computing straight-line 3D grid drawings of graphs in linear volume.  |
Comput. Geom.  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Sándor P. Fekete, Henk Meijer |
The one-round Voronoi game replayed.  |
Comput. Geom.  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer |
Computing Radial Drawings on the Minimum Number of Circles.  |
J. Graph Algorithms Appl.  |
2005 |
DBLP BibTeX RDF |
|
| 1 | Erik D. Demaine, Jeff Erickson, Ferran Hurtado, John Iacono, Stefan Langerman, Henk Meijer, Mark H. Overmars, Sue Whitesides |
Separating Point Sets in Polygonal Environments.  |
Int. J. Comput. Geometry Appl.  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Henk Meijer, David Rappaport |
Guest Editors' Foreword.  |
Int. J. Comput. Geometry Appl.  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Kathryn Duffy, Chris McAloney, Henk Meijer, David Rappaport |
Closest Segments.  |
CCCG  |
2005 |
DBLP BibTeX RDF |
|
| 1 | Erik D. Demaine, Francisco Gomez-Martin, Henk Meijer, David Rappaport, Perouz Taslakian, Godfried T. Toussaint, Terry Winograd, David R. Wood |
The Distance Geometry of Deep Rhythms and Scales.  |
CCCG  |
2005 |
DBLP BibTeX RDF |
|
| 1 | Magdalene Grantson, Henk Meijer, David Rappaport |
Bi-chromatic minimum spanning trees.  |
EuroCG  |
2005 |
DBLP BibTeX RDF |
|
| 1 | Michael A. Bender, David P. Bunde, Erik D. Demaine, Sándor P. Fekete, Vitus J. Leung, Henk Meijer, Cynthia A. Phillips |
Communication-Aware Processor Allocation for Supercomputers.  |
WADS  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Emilio Di Giacomo, Giuseppe Liotta, Henk Meijer, Stephen K. Wismath |
Volume Requirements of 3D Upward Drawings.  |
Graph Drawing  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Liam Keliher, Henk Meijer, Stafford E. Tavares |
Completion of Computation of Improved Upper Bound on the Maximum Average Linear Hull Probabilty for Rijndael.  |
IACR Cryptology ePrint Archive  |
2004 |
DBLP BibTeX RDF |
|
| 1 | Michael A. Bender, David P. Bunde, Erik D. Demaine, Sándor P. Fekete, Vitus J. Leung, Henk Meijer, Cynthia A. Phillips |
Communication-Aware Processor Allocation for Supercomputers  |
CoRR  |
2004 |
DBLP BibTeX RDF |
|
| 1 | Sándor P. Fekete, Marco E. Lübbecke, Henk Meijer |
Minimizing the stabbing number of matchings, trees, and triangulations.  |
SODA  |
2004 |
DBLP DOI BibTeX RDF |
stabbing number, complexity, matching, triangulation, spanning tree, crossing number, linear programming relaxation, iterated rounding |
| 1 | Erik D. Demaine, Jeff Erickson, Ferran Hurtado, John Iacono, Stefan Langerman, Henk Meijer, Mark H. Overmars, Sue Whitesides |
Separating point sets in polygonal environments.  |
Symposium on Computational Geometry  |
2004 |
DBLP DOI BibTeX RDF |
polygons, separability, geodesics, chords |
| 1 | Henk Meijer, David Rappaport |
Simultaneous edge flips for convex subdivisions.  |
CCCG  |
2004 |
DBLP BibTeX RDF |
|
| 1 | Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer |
Computing Radial Drawings on the Minimum Number of Circles.  |
Graph Drawing  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Sándor P. Fekete, Henk Meijer |
Maximum Dispersion and Geometric Maximum Weight Cliques.  |
Algorithmica  |
2003 |
DBLP DOI BibTeX RDF |
Remote clique, Heaviest subgraph, Approximation, Facility location, PTAS, Geometric optimization, Dispersion, Maximum weight cliques |
| 1 | Sándor P. Fekete, Henk Meijer |
The one-round Voronoi game replayed  |
CoRR  |
2003 |
DBLP BibTeX RDF |
|
| 1 | Sándor P. Fekete, Marco E. Lübbecke, Henk Meijer |
Minimizing the stabbing number of matchings, trees, and triangulations  |
CoRR  |
2003 |
DBLP BibTeX RDF |
|
| 1 | Sándor P. Fekete, Henk Meijer |
Maximum dispersion and geometric maximum weight cliques  |
CoRR  |
2003 |
DBLP BibTeX RDF |
|
| 1 | Oswin Aichholzer, David Bremner, Erik D. Demaine, Henk Meijer, Vera Sacristan, Michael A. Soss |
Long proteins with unique optimal foldings in the H-P model.  |
Comput. Geom.  |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Ferran Hurtado, Giuseppe Liotta, Henk Meijer |
Optimal and suboptimal robust algorithms for proximity graphs.  |
Comput. Geom.  |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Giuseppe Liotta, Henk Meijer |
Voronoi drawings of trees.  |
Comput. Geom.  |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | José Miguel Díaz-Báñez, Ferran Hurtado, Henk Meijer, David Rappaport, Joan Antoni Sellarès |
The Largest Empty Annulus Problem.  |
Int. J. Comput. Geometry Appl.  |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Sándor P. Fekete, Henk Meijer |
The One-Round Voronoi Game Replayed.  |
WADS  |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Emilio Di Giacomo, Henk Meijer |
Track Drawings of Graphs with Constant Queue Number.  |
Graph Drawing  |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Prosenjit Bose, Ferran Hurtado, Henk Meijer, Suneeta Ramaswami, David Rappaport, Vera Sacristan, Thomas C. Shermer, Godfried T. Toussaint |
Finding Specified Sections of Arrangements: 2D Results.  |
J. Math. Model. Algorithms  |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Oswin Aichholzer, David Bremner, Erik D. Demaine, Henk Meijer, Vera Sacristan, Michael A. Soss |
Long Proteins with Unique Optimal Foldings in the H-P Model  |
CoRR  |
2002 |
DBLP BibTeX RDF |
|
| 1 | Sándor P. Fekete, Henk Meijer, André Rohe, Walter Tietze |
Solving a "Hard" Problem to Approximate an "Easy" One: Heuristics for Maximum Matchings and Maximum Traveling Salesman Problems  |
CoRR  |
2002 |
DBLP BibTeX RDF |
|
| 1 | Sándor P. Fekete, Henk Meijer, André Rohe, Walter Tietze |
Solving a "Hard" Problem to Approximate an "Easy" One: Heuristics for Maximum Matchings and Maximum Traveling Salesman Problems.  |
ACM Journal of Experimental Algorithmics  |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | José Miguel Díaz-Báñez, Ferran Hurtado, Henk Meijer, David Rappaport, Joan Antoni Sellarès |
The Largest Empty Annulus Problem.  |
International Conference on Computational Science  |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Greg Aloupis, Erik D. Demaine, Henk Meijer, Joseph O'Rourke, Ileana Streinu, Godfried T. Toussaint |
On flat-state connectivity of chains with fixed acute angles.  |
CCCG  |
2002 |
DBLP BibTeX RDF |
|
| 1 | Greg Aloupis, Prosenjit Bose, Erik D. Demaine, Stefan Langerman, Henk Meijer, Mark H. Overmars, Godfried T. Toussaint |
Computing signed permutations of polygons.  |
CCCG  |
2002 |
DBLP BibTeX RDF |
|
| 1 | Greg Aloupis, Erik D. Demaine, Vida Dujmovic, Jeff Erickson, Stefan Langerman, Henk Meijer, Joseph O'Rourke, Mark H. Overmars, Michael A. Soss, Ileana Streinu, Godfried T. Toussaint |
Flat-State Connectivity of Linkages under Dihedral Motions.  |
ISAAC  |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Liam Keliher, Henk Meijer, Stafford E. Tavares |
Dual of New Method for Upper Bounding the Maximum Average Linear Hull Probability for SPNs.  |
IACR Cryptology ePrint Archive  |
2001 |
DBLP BibTeX RDF |
|
| 1 | Thomas Fevens, Henk Meijer, David Rappaport |
Minimum convex partition of a constrained point set.  |
Discrete Applied Mathematics  |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Kiyoshi Hosono, Henk Meijer, David Rappaport |
On the visibility graph of convex translates.  |
Discrete Applied Mathematics  |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Sándor P. Fekete, Henk Meijer, André Rohe, Walter Tietze |
Solving a "Hard" Problem to Approximate an "Easy" One: Heuristics for Maximum Matchings and Maximum Traveling Salesman Problems.  |
ALENEX  |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Ferran Hurtado, Giuseppe Liotta, Henk Meijer |
Optimal, Suboptimal, and Robust Algorithms for Proximity Graphs.  |
WADS  |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Liam Keliher, Henk Meijer, Stafford E. Tavares |
Improving the Upper Bound on the Maximum Average Linear Hull Probability for Rijndael.  |
Selected Areas in Cryptography  |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Liam Keliher, Henk Meijer, Stafford E. Tavares |
New Method for Upper Bounding the Maximum Average Linear Hull Probability for SPNs.  |
EUROCRYPT  |
2001 |
DBLP DOI BibTeX RDF |
substitution-permutation networks, maximum average linear hull probability, provable security, linear cryptanalysis |
| 1 | Sándor P. Fekete, Henk Meijer |
On Minimum Stars and Maximum Matchings.  |
Discrete & Computational Geometry  |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Oswin Aichholzer, Carmen Cortés, Erik D. Demaine, Vida Dujmovic, Jeff Erickson, Henk Meijer, Mark H. Overmars, Belén Palop, Suneeta Ramaswami, Godfried T. Toussaint |
Flipturning polygons  |
CoRR  |
2000 |
DBLP BibTeX RDF |
|
| 1 | Sándor P. Fekete, Henk Meijer |
Maximum dispersion and geometric maximum weight cliques.  |
APPROX  |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul E. Kearney, Ryan Hayward, Henk Meijer |
Evolutionary Trees and Ordinal Assertions.  |
Algorithmica  |
1999 |
DBLP DOI BibTeX RDF |
Species, Evolution, Tree, Phylogeny, Ordinal, Distance matrix |
| 1 | Sándor P. Fekete, Henk Meijer |
Rectangle and Box Visibility Graphs in 3D.  |
Int. J. Comput. Geometry Appl.  |
1999 |
DBLP BibTeX RDF |
|
| 1 | Sándor P. Fekete, Henk Meijer |
On Minimum Stars, Minimum Steiner Stars, and Maximum Matchings.  |
Symposium on Computational Geometry  |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Liam Keliher, Henk Meijer, Stafford E. Tavares |
Modeling Linear Characteristics of Substitution-Permutation Networks.  |
Selected Areas in Cryptography  |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Stafford E. Tavares, Henk Meijer (eds.) |
Selected Areas in Cryptography '98, SAC'98, Kingston, Ontario, Canada, August 17-18, 1998, Proceedings  |
Selected Areas in Cryptography  |
1999 |
DBLP BibTeX RDF |
|
| 1 | Giuseppe Liotta, Henk Meijer |
Voronoi Drawings of Trees.  |
Graph Drawing  |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Therese C. Biedl, Anna Bretscher, Henk Meijer |
Rectangle of Influence Drawings of Graphs without Filled 3-Cycles.  |
Graph Drawing  |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Giuseppe Liotta, Anna Lubiw, Henk Meijer, Sue Whitesides |
The rectangle of influence drawability problem.  |
Comput. Geom.  |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Prosenjit Bose, Hazel Everett, Sándor P. Fekete, Michael E. Houle, Anna Lubiw, Henk Meijer, Kathleen Romanik, Günter Rote, Thomas C. Shermer, Sue Whitesides, Christian Zelle |
A Visibility Representation for Graphs in Three Dimensions.  |
J. Graph Algorithms Appl.  |
1998 |
DBLP BibTeX RDF |
|
| 1 | Kelly A. Lyons, Henk Meijer, David Rappaport |
Algorithms for Cluster Busting in Anchored Graph Drawing.  |
J. Graph Algorithms Appl.  |
1998 |
DBLP BibTeX RDF |
|
Displaying result #1 - #100 of 132 (100 per page; Change: ) Pages: [ 1][ 2][ >>] |
|