The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Henk Meijer" ( http://dblp.L3S.de/Authors/Henk_Meijer )

  Author page on DBLP  Author page in RDF  Community of Henk Meijer in ASPL-2

Publication years (Num. hits)
1980-1990 (16) 1991-1998 (19) 1999-2001 (17) 2002-2003 (18) 2004-2005 (17) 2006-2008 (20) 2009-2010 (18) 2011-2012 (7)
Publication types (Num. hits)
article(73) inproceedings(58) proceedings(1)
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
1Mereke van Garderen, Giuseppe Liotta, Henk Meijer Universal point sets for 2-coloured trees. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer Drawing a tree as a minimum spanning tree approximation. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer Area, Curve Complexity, and Crossing Resolution of Non-Planar Graph Drawings. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Kevin Buchin, Marc J. van Kreveld, Henk Meijer, Bettina Speckmann, Kevin Verbeek On Planar Supports for Hypergraphs. Search on Bibsonomy J. Graph Algorithms Appl. The full citation details ... 2011 DBLP  BibTeX  RDF
1Sergio Cabello, Marc J. van Kreveld, Giuseppe Liotta, Henk Meijer, Bettina Speckmann, Kevin Verbeek Geometric Simultaneous Embeddings of a Graph and a Matching. Search on Bibsonomy J. Graph Algorithms Appl. The full citation details ... 2011 DBLP  BibTeX  RDF
1Greg Aloupis, Prosenjit Bose, Erik D. Demaine, Stefan Langerman, Henk Meijer, Mark H. Overmars, Godfried T. Toussaint Computing Signed Permutations of Polygons. Search on Bibsonomy Int. J. Comput. Geometry Appl. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1William Evans, Emden R. Gansner, Michael Kaufmann, Giuseppe Liotta, Henk Meijer, Andreas Spillner Approximate Proximity Drawings. Search on Bibsonomy Graph Drawing The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Luca Grilli, Seok-Hee Hong, Giuseppe Liotta, Henk Meijer, Stephen K. Wismath Matched drawability of graph pairs and of graph triples. Search on Bibsonomy Comput. Geom. The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer, Stephen K. Wismath Constrained Point-Set Embeddability of Planar Graphs. Search on Bibsonomy Int. J. Comput. Geometry Appl. The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Henk Meijer, Yurai Núñez Rodríguez, David Rappaport Fault Recovery in Wireless Networks: The Geometric Recolouring Approach. Search on Bibsonomy SEA The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer Drawing a Tree as a Minimum Spanning Tree Approximation. Search on Bibsonomy ISAAC The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Mereke van Garderen, Giuseppe Liotta, Henk Meijer Universal Pointsets for 2-Coloured Trees. Search on Bibsonomy Graph Drawing The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Henk Meijer, Yurai Núñez Rodríguez, David Rappaport An algorithm for computing simple k-factors. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Emilio Di Giacomo, Giuseppe Liotta, Henk Meijer, Stephen K. Wismath Volume requirements of 3D upward drawings. Search on Bibsonomy Discrete Mathematics The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer, Stephen K. Wismath Point-set embeddings of trees with given partial drawings. Search on Bibsonomy Comput. Geom. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Erik D. Demaine, Francisco Gomez-Martin, Henk Meijer, David Rappaport, Perouz Taslakian, Godfried T. Toussaint, Terry Winograd, David R. Wood The distance geometry of music. Search on Bibsonomy Comput. Geom. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Henk Meijer, Yurai Núñez Rodríguez, David Rappaport Bounds for point recolouring in geometric graphs. Search on Bibsonomy Comput. Geom. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Esther 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. Search on Bibsonomy Comput. Geom. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Henk Meijer, David Rappaport Editorial CCCG 2006. Search on Bibsonomy Comput. Geom. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Kamrul Islam, Selim G. Akl, Henk Meijer Distributed Generation of a Family of Connected Dominating Sets in Wireless Sensor Networks. Search on Bibsonomy DCOSS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Minimum Vertex-cut, Wireless Sensor Network, Distributed Algorithm, Maximal Clique
1Luca Grilli, Seok-Hee Hong, Giuseppe Liotta, Henk Meijer, Stephen K. Wismath Matched Drawability of Graph Pairs and of Graph Triples. Search on Bibsonomy WALCOM The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Kamrul Islam, Selim G. Akl, Henk Meijer Maximizing the lifetime of wireless sensor networks through domatic partition. Search on Bibsonomy LCN The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer Area, Curve Complexity, and Crossing Resolution of Non-planar Graph Drawings. Search on Bibsonomy Graph Drawing The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Sergio Cabello, Marc J. van Kreveld, Giuseppe Liotta, Henk Meijer, Bettina Speckmann, Kevin Verbeek Geometric Simultaneous Embeddings of a Graph and a Matching. Search on Bibsonomy Graph Drawing The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Kevin Buchin, Marc J. van Kreveld, Henk Meijer, Bettina Speckmann, Kevin Verbeek On Planar Supports for Hypergraphs. Search on Bibsonomy Graph Drawing The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Selim G. Akl, Kamrul Islam, Henk Meijer Planar tree transformation: Results and counterexample. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Michael 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. Search on Bibsonomy Algorithmica The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Manhattan distance, Clustering, Approximation, Supercomputers, Communication cost, Processor allocation, Polynomial-time approximation scheme (PTAS)
1Sándor P. Fekete, Marco E. Lübbecke, Henk Meijer Minimizing the Stabbing Number of Matchings, Trees, and Triangulations. Search on Bibsonomy Discrete & Computational Geometry The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Stabbing number, Complexity, Matching, Triangulation, Spanning tree, Linear programming relaxation, Iterated rounding
1Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer, Francesco Trotta, Stephen K. Wismath k-colored Point-set Embeddability of Outerplanar Graphs. Search on Bibsonomy J. Graph Algorithms Appl. The full citation details ... 2008 DBLP  BibTeX  RDF
1Erik D. Demaine, Jeff Erickson, Danny Krizanc, Henk Meijer, Pat Morin, Mark H. Overmars, Sue Whitesides Realizing partitions respecting full and partial order information. Search on Bibsonomy J. Discrete Algorithms The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Henk Meijer, Yurai Núñez Rodríguez, David Rappaport On the Complexity of Point Recolouring in Geometric Graphs. Search on Bibsonomy CCCG The full citation details ... 2008 DBLP  BibTeX  RDF
1Selim G. Akl, Kamrul Islam, Henk Meijer Direct Planar Tree Transformation and Counterexample. Search on Bibsonomy CCCG The full citation details ... 2008 DBLP  BibTeX  RDF
1Kamrul Islam, Selim G. Akl, Henk Meijer A Constant Factor Localized Algorithm for Computing Connected Dominating Sets in Wireless Sensor Networks. Search on Bibsonomy ICPADS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer, Stephen K. Wismath Constrained Point-Set Embeddability of Planar Graphs. Search on Bibsonomy Graph Drawing The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Selim G. Akl, Kamrul Islam, Henk Meijer On planar path transformation. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Erik D. Demaine, Francisco Gomez-Martin, Henk Meijer, David Rappaport, Perouz Taslakian, Godfried T. Toussaint, Terry Winograd, David R. Wood The Distance Geometry of Music Search on Bibsonomy CoRR The full citation details ... 2007 DBLP  BibTeX  RDF
1Giuseppe Liotta, Henk Meijer Advances in graph drawing: The 11th International Symposium on Graph Drawing. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Marco Martens, Henk Meijer On the probabilistic behaviour of a heuristic algorithm for maximal Hamiltonian tours. Search on Bibsonomy J. Discrete Algorithms The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Kamrul Islam, Henk Meijer, Yurai Núñez Rodríguez, David Rappaport, Henry Xiao Hamilton Circuits in Hexagonal Grid Graphs. Search on Bibsonomy CCCG The full citation details ... 2007 DBLP  BibTeX  RDF
1Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer, Stephen K. Wismath Point-Set Embedding of Trees with Edge Constraints. Search on Bibsonomy Graph Drawing The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Justin 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. Search on Bibsonomy Journal of Computational Biology The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Mirela 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. Search on Bibsonomy CCCG The full citation details ... 2006 DBLP  BibTeX  RDF
1Kamrul Islam, Selim G. Akl, Henk Meijer On Planar Path Transformation. Search on Bibsonomy CCCG The full citation details ... 2006 DBLP  BibTeX  RDF
1Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer, Francesco Trotta, Stephen K. Wismath k -Colored Point-Set Embeddability of Outerplanar Graphs. Search on Bibsonomy Graph Drawing The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Michael Hirsch, Henk Meijer, David Rappaport Biclique Edge Cover Graphs and Confluent Drawings. Search on Bibsonomy Graph Drawing The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Justin 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 Search on Bibsonomy CoRR The full citation details ... 2005 DBLP  BibTeX  RDF
1Emilio Di Giacomo, Giuseppe Liotta, Henk Meijer Computing straight-line 3D grid drawings of graphs in linear volume. Search on Bibsonomy Comput. Geom. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Sándor P. Fekete, Henk Meijer The one-round Voronoi game replayed. Search on Bibsonomy Comput. Geom. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer Computing Radial Drawings on the Minimum Number of Circles. Search on Bibsonomy J. Graph Algorithms Appl. The full citation details ... 2005 DBLP  BibTeX  RDF
1Erik D. Demaine, Jeff Erickson, Ferran Hurtado, John Iacono, Stefan Langerman, Henk Meijer, Mark H. Overmars, Sue Whitesides Separating Point Sets in Polygonal Environments. Search on Bibsonomy Int. J. Comput. Geometry Appl. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Henk Meijer, David Rappaport Guest Editors' Foreword. Search on Bibsonomy Int. J. Comput. Geometry Appl. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Kathryn Duffy, Chris McAloney, Henk Meijer, David Rappaport Closest Segments. Search on Bibsonomy CCCG The full citation details ... 2005 DBLP  BibTeX  RDF
1Erik 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. Search on Bibsonomy CCCG The full citation details ... 2005 DBLP  BibTeX  RDF
1Magdalene Grantson, Henk Meijer, David Rappaport Bi-chromatic minimum spanning trees. Search on Bibsonomy EuroCG The full citation details ... 2005 DBLP  BibTeX  RDF
1Michael 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. Search on Bibsonomy WADS The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Emilio Di Giacomo, Giuseppe Liotta, Henk Meijer, Stephen K. Wismath Volume Requirements of 3D Upward Drawings. Search on Bibsonomy Graph Drawing The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Liam Keliher, Henk Meijer, Stafford E. Tavares Completion of Computation of Improved Upper Bound on the Maximum Average Linear Hull Probabilty for Rijndael. Search on Bibsonomy IACR Cryptology ePrint Archive The full citation details ... 2004 DBLP  BibTeX  RDF
1Michael 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 Search on Bibsonomy CoRR The full citation details ... 2004 DBLP  BibTeX  RDF
1Sándor P. Fekete, Marco E. Lübbecke, Henk Meijer Minimizing the stabbing number of matchings, trees, and triangulations. Search on Bibsonomy SODA The full citation details ... 2004 DBLP  DOI  BibTeX  RDF stabbing number, complexity, matching, triangulation, spanning tree, crossing number, linear programming relaxation, iterated rounding
1Erik D. Demaine, Jeff Erickson, Ferran Hurtado, John Iacono, Stefan Langerman, Henk Meijer, Mark H. Overmars, Sue Whitesides Separating point sets in polygonal environments. Search on Bibsonomy Symposium on Computational Geometry The full citation details ... 2004 DBLP  DOI  BibTeX  RDF polygons, separability, geodesics, chords
1Henk Meijer, David Rappaport Simultaneous edge flips for convex subdivisions. Search on Bibsonomy CCCG The full citation details ... 2004 DBLP  BibTeX  RDF
1Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer Computing Radial Drawings on the Minimum Number of Circles. Search on Bibsonomy Graph Drawing The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Sándor P. Fekete, Henk Meijer Maximum Dispersion and Geometric Maximum Weight Cliques. Search on Bibsonomy Algorithmica The full citation details ... 2003 DBLP  DOI  BibTeX  RDF Remote clique, Heaviest subgraph, Approximation, Facility location, PTAS, Geometric optimization, Dispersion, Maximum weight cliques
1Sándor P. Fekete, Henk Meijer The one-round Voronoi game replayed Search on Bibsonomy CoRR The full citation details ... 2003 DBLP  BibTeX  RDF
1Sándor P. Fekete, Marco E. Lübbecke, Henk Meijer Minimizing the stabbing number of matchings, trees, and triangulations Search on Bibsonomy CoRR The full citation details ... 2003 DBLP  BibTeX  RDF
1Sándor P. Fekete, Henk Meijer Maximum dispersion and geometric maximum weight cliques Search on Bibsonomy CoRR The full citation details ... 2003 DBLP  BibTeX  RDF
1Oswin Aichholzer, David Bremner, Erik D. Demaine, Henk Meijer, Vera Sacristan, Michael A. Soss Long proteins with unique optimal foldings in the H-P model. Search on Bibsonomy Comput. Geom. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Ferran Hurtado, Giuseppe Liotta, Henk Meijer Optimal and suboptimal robust algorithms for proximity graphs. Search on Bibsonomy Comput. Geom. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Giuseppe Liotta, Henk Meijer Voronoi drawings of trees. Search on Bibsonomy Comput. Geom. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1José Miguel Díaz-Báñez, Ferran Hurtado, Henk Meijer, David Rappaport, Joan Antoni Sellarès The Largest Empty Annulus Problem. Search on Bibsonomy Int. J. Comput. Geometry Appl. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Sándor P. Fekete, Henk Meijer The One-Round Voronoi Game Replayed. Search on Bibsonomy WADS The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Emilio Di Giacomo, Henk Meijer Track Drawings of Graphs with Constant Queue Number. Search on Bibsonomy Graph Drawing The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Prosenjit Bose, Ferran Hurtado, Henk Meijer, Suneeta Ramaswami, David Rappaport, Vera Sacristan, Thomas C. Shermer, Godfried T. Toussaint Finding Specified Sections of Arrangements: 2D Results. Search on Bibsonomy J. Math. Model. Algorithms The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Oswin Aichholzer, David Bremner, Erik D. Demaine, Henk Meijer, Vera Sacristan, Michael A. Soss Long Proteins with Unique Optimal Foldings in the H-P Model Search on Bibsonomy CoRR The full citation details ... 2002 DBLP  BibTeX  RDF
1Sá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 Search on Bibsonomy CoRR The full citation details ... 2002 DBLP  BibTeX  RDF
1Sá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. Search on Bibsonomy ACM Journal of Experimental Algorithmics The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1José Miguel Díaz-Báñez, Ferran Hurtado, Henk Meijer, David Rappaport, Joan Antoni Sellarès The Largest Empty Annulus Problem. Search on Bibsonomy International Conference on Computational Science The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Greg Aloupis, Erik D. Demaine, Henk Meijer, Joseph O'Rourke, Ileana Streinu, Godfried T. Toussaint On flat-state connectivity of chains with fixed acute angles. Search on Bibsonomy CCCG The full citation details ... 2002 DBLP  BibTeX  RDF
1Greg Aloupis, Prosenjit Bose, Erik D. Demaine, Stefan Langerman, Henk Meijer, Mark H. Overmars, Godfried T. Toussaint Computing signed permutations of polygons. Search on Bibsonomy CCCG The full citation details ... 2002 DBLP  BibTeX  RDF
1Greg 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. Search on Bibsonomy ISAAC The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Liam Keliher, Henk Meijer, Stafford E. Tavares Dual of New Method for Upper Bounding the Maximum Average Linear Hull Probability for SPNs. Search on Bibsonomy IACR Cryptology ePrint Archive The full citation details ... 2001 DBLP  BibTeX  RDF
1Thomas Fevens, Henk Meijer, David Rappaport Minimum convex partition of a constrained point set. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Kiyoshi Hosono, Henk Meijer, David Rappaport On the visibility graph of convex translates. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Sá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. Search on Bibsonomy ALENEX The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Ferran Hurtado, Giuseppe Liotta, Henk Meijer Optimal, Suboptimal, and Robust Algorithms for Proximity Graphs. Search on Bibsonomy WADS The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Liam Keliher, Henk Meijer, Stafford E. Tavares Improving the Upper Bound on the Maximum Average Linear Hull Probability for Rijndael. Search on Bibsonomy Selected Areas in Cryptography The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Liam Keliher, Henk Meijer, Stafford E. Tavares New Method for Upper Bounding the Maximum Average Linear Hull Probability for SPNs. Search on Bibsonomy EUROCRYPT The full citation details ... 2001 DBLP  DOI  BibTeX  RDF substitution-permutation networks, maximum average linear hull probability, provable security, linear cryptanalysis
1Sándor P. Fekete, Henk Meijer On Minimum Stars and Maximum Matchings. Search on Bibsonomy Discrete & Computational Geometry The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
1Oswin 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 Search on Bibsonomy CoRR The full citation details ... 2000 DBLP  BibTeX  RDF
1Sándor P. Fekete, Henk Meijer Maximum dispersion and geometric maximum weight cliques. Search on Bibsonomy APPROX The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
1Paul E. Kearney, Ryan Hayward, Henk Meijer Evolutionary Trees and Ordinal Assertions. Search on Bibsonomy Algorithmica The full citation details ... 1999 DBLP  DOI  BibTeX  RDF Species, Evolution, Tree, Phylogeny, Ordinal, Distance matrix
1Sándor P. Fekete, Henk Meijer Rectangle and Box Visibility Graphs in 3D. Search on Bibsonomy Int. J. Comput. Geometry Appl. The full citation details ... 1999 DBLP  BibTeX  RDF
1Sándor P. Fekete, Henk Meijer On Minimum Stars, Minimum Steiner Stars, and Maximum Matchings. Search on Bibsonomy Symposium on Computational Geometry The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
1Liam Keliher, Henk Meijer, Stafford E. Tavares Modeling Linear Characteristics of Substitution-Permutation Networks. Search on Bibsonomy Selected Areas in Cryptography The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
1Stafford E. Tavares, Henk Meijer (eds.) Selected Areas in Cryptography '98, SAC'98, Kingston, Ontario, Canada, August 17-18, 1998, Proceedings Search on Bibsonomy Selected Areas in Cryptography The full citation details ... 1999 DBLP  BibTeX  RDF
1Giuseppe Liotta, Henk Meijer Voronoi Drawings of Trees. Search on Bibsonomy Graph Drawing The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
1Therese C. Biedl, Anna Bretscher, Henk Meijer Rectangle of Influence Drawings of Graphs without Filled 3-Cycles. Search on Bibsonomy Graph Drawing The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
1Giuseppe Liotta, Anna Lubiw, Henk Meijer, Sue Whitesides The rectangle of influence drawability problem. Search on Bibsonomy Comput. Geom. The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
1Prosenjit 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. Search on Bibsonomy J. Graph Algorithms Appl. The full citation details ... 1998 DBLP  BibTeX  RDF
1Kelly A. Lyons, Henk Meijer, David Rappaport Algorithms for Cluster Busting in Anchored Graph Drawing. Search on Bibsonomy J. Graph Algorithms Appl. The full citation details ... 1998 DBLP  BibTeX  RDF
Displaying result #1 - #100 of 132 (100 per page; Change: )
Pages: [1][2][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.