default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHenk Meijer
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[i21]Mirela Damian, Henk Meijer:
Edge-Unfolding Polycubes with Orthogonally Convex Layers. CoRR abs/2407.01326 (2024)- 2023
- [i20]Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer, Fabrizio Montecchiani, Stephen K. Wismath:
New Bounds on the Local and Global Edge-length Ratio of Planar Graphs. CoRR abs/2311.14634 (2023) - 2021
- [j83]Felice De Luca, Emilio Di Giacomo, Seok-Hee Hong, Stephen G. Kobourov, William J. Lenhart, Giuseppe Liotta, Henk Meijer, Alessandra Tappini
, Stephen K. Wismath:
Packing Trees into 1-planar Graphs. J. Graph Algorithms Appl. 25(2): 605-624 (2021) - 2020
- [j82]Carla Binucci, Emilio Di Giacomo, Seok-Hee Hong, Giuseppe Liotta, Henk Meijer, Vera Sacristán, Stephen K. Wismath:
Colored anchored visibility representations in 2D and 3D space. Comput. Geom. 89: 101592 (2020) - [j81]Emilio Di Giacomo, Peter Eades, Giuseppe Liotta, Henk Meijer, Fabrizio Montecchiani:
Polyline drawings with topological constraints. Theor. Comput. Sci. 809: 250-264 (2020) - [c70]Felice De Luca, Emilio Di Giacomo, Seok-Hee Hong, Stephen G. Kobourov, William J. Lenhart, Giuseppe Liotta, Henk Meijer, Alessandra Tappini, Stephen K. Wismath:
Packing Trees into 1-Planar Graphs. WALCOM 2020: 81-93
2010 – 2019
- 2019
- [j80]Erik D. Demaine, Sándor P. Fekete, Phillip Keldenich, Henk Meijer, Christian Scheffer:
Coordinated Motion Planning: Reconfiguring a Swarm of Labeled Robots with Bounded Stretch. SIAM J. Comput. 48(6): 1727-1762 (2019) - [c69]Therese Biedl, Stefan Felsner, Henk Meijer, Alexander Wolff:
Line and Plane Cover Numbers Revisited. GD 2019: 409-415 - [i19]Therese Biedl, Stefan Felsner, Henk Meijer, Alexander Wolff:
Line and Plane Cover Numbers Revisited. CoRR abs/1908.07647 (2019) - [i18]Felice De Luca, Emilio Di Giacomo, Seok-Hee Hong, Stephen G. Kobourov, William J. Lenhart, Giuseppe Liotta, Henk Meijer, Alessandra Tappini, Stephen K. Wismath:
Packing Trees into 1-planar Graphs. CoRR abs/1911.01761 (2019) - 2018
- [j79]Emilio Di Giacomo, Walter Didimo, William S. Evans, Giuseppe Liotta, Henk Meijer, Fabrizio Montecchiani, Stephen K. Wismath:
Ortho-polygon Visibility Representations of Embedded Graphs. Algorithmica 80(8): 2345-2383 (2018) - [j78]Alessio Arleo, Carla Binucci, Emilio Di Giacomo, William S. Evans, Luca Grilli, Giuseppe Liotta, Henk Meijer, Fabrizio Montecchiani, Sue Whitesides, Stephen K. Wismath:
Visibility representations of boxes in 2.5 dimensions. Comput. Geom. 72: 19-33 (2018) - [j77]Emilio Di Giacomo, Walter Didimo, William S. Evans, Giuseppe Liotta, Henk Meijer, Fabrizio Montecchiani, Stephen K. Wismath:
New results on edge partitions of 1-plane graphs. Theor. Comput. Sci. 713: 78-84 (2018) - [c68]Erik D. Demaine, Sándor P. Fekete, Phillip Keldenich, Christian Scheffer, Henk Meijer:
Coordinated Motion Planning: Reconfiguring a Swarm of Labeled Robots with Bounded Stretch. SoCG 2018: 29:1-29:15 - [c67]Emilio Di Giacomo, Peter Eades, Giuseppe Liotta, Henk Meijer, Fabrizio Montecchiani:
Polyline Drawings with Topological Constraints. ISAAC 2018: 39:1-39:13 - [i17]Erik D. Demaine, Sándor P. Fekete, Phillip Keldenich, Henk Meijer, Christian Scheffer:
Coordinated Motion Planning: Reconfiguring a Swarm of Labeled Robots with Bounded Stretch. CoRR abs/1801.01689 (2018) - [i16]Emilio Di Giacomo, Peter Eades, Giuseppe Liotta, Henk Meijer, Fabrizio Montecchiani:
Polyline Drawings with Topological Constraints. CoRR abs/1809.08111 (2018) - 2017
- [i15]Emilio Di Giacomo, Walter Didimo, William S. Evans, Giuseppe Liotta, Henk Meijer, Fabrizio Montecchiani, Stephen K. Wismath:
New Results on Edge Partitions of 1-plane Graphs. CoRR abs/1706.05161 (2017) - 2016
- [j76]William S. Evans, Giuseppe Liotta, Henk Meijer, Stephen K. Wismath:
Alternating paths and cycles of minimum length. Comput. Geom. 58: 124-135 (2016) - [c66]Alessio Arleo, Carla Binucci, Emilio Di Giacomo, William S. Evans, Luca Grilli, Giuseppe Liotta, Henk Meijer, Fabrizio Montecchiani, Sue Whitesides, Stephen K. Wismath:
Visibility Representations of Boxes in 2.5 Dimensions. GD 2016: 251-265 - [c65]Emilio Di Giacomo, Walter Didimo, William S. Evans, Giuseppe Liotta, Henk Meijer, Fabrizio Montecchiani, Stephen K. Wismath:
Ortho-Polygon Visibility Representations of Embedded Graphs. GD 2016: 280-294 - [i14]Emilio Di Giacomo, Walter Didimo, William S. Evans, Giuseppe Liotta, Henk Meijer, Fabrizio Montecchiani, Stephen K. Wismath:
Ortho-polygon Visibility Representations of Embedded Graphs. CoRR abs/1604.08797 (2016) - [i13]Alessio Arleo, Carla Binucci, Emilio Di Giacomo, William S. Evans, Luca Grilli, Giuseppe Liotta, Henk Meijer, Fabrizio Montecchiani, Sue Whitesides, Stephen K. Wismath:
Visibility Representations of Boxes in 2.5 Dimensions. CoRR abs/1608.08899 (2016) - 2015
- [j75]Emilio Di Giacomo, Giuseppe Liotta, Henk Meijer:
The Approximate Rectangle of Influence Drawability Problem. Algorithmica 72(2): 620-655 (2015) - [j74]Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer, Stephen K. Wismath:
Planar and Quasi-Planar Simultaneous Geometric Embedding. Comput. J. 58(11): 3126-3140 (2015) - [j73]Henk Meijer, Stephen K. Wismath:
Point Set Embedding in 3D. J. Graph Algorithms Appl. 19(1): 243-257 (2015) - [c64]William S. Evans, Giuseppe Liotta, Henk Meijer, Stephen K. Wismath:
Alternating Paths and Cycles of Minimum Length. GD 2015: 383-394 - 2014
- [c63]Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer, Stephen K. Wismath:
Planar and Quasi Planar Simultaneous Geometric Embedding. GD 2014: 52-63 - 2013
- [j72]William S. Evans, Emden R. Gansner, Michael Kaufmann, Giuseppe Liotta, Henk Meijer, Andreas Spillner:
Approximate proximity drawings. Comput. Geom. 46(6): 604-614 (2013) - [j71]Bernardo M. Ábrego, Ruy Fabila Monroy, Silvia Fernández-Merchant, David Flores-Peñaloza, Ferran Hurtado, Henk Meijer, Vera Sacristán, Maria Saumell:
Proximity graphs inside large weighted graphs. Networks 61(1): 29-39 (2013) - 2012
- [j70]Prosenjit Bose, Vida Dujmovic, Ferran Hurtado, John Iacono, Stefan Langerman, Henk Meijer, Vera Sacristán Adinolfi, Maria Saumell, David R. Wood:
PROXIMITY GRAPHS: E, δ, Δ, χ AND ω. Int. J. Comput. Geom. Appl. 22(5): 439-470 (2012) - [j69]Mereke van Garderen, Giuseppe Liotta, Henk Meijer:
Universal point sets for 2-coloured trees. Inf. Process. Lett. 112(8-9): 346-350 (2012) - [j68]Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer:
Drawing a tree as a minimum spanning tree approximation. J. Comput. Syst. Sci. 78(2): 491-503 (2012) - [c62]Stephen K. Wismath, Henk Meijer:
Point-Set Embedding in Three Dimensions. CCCG 2012: 223-228 - [c61]Emilio Di Giacomo, Giuseppe Liotta, Henk Meijer:
The Approximate Rectangle of Influence Drawability Problem. GD 2012: 114-125 - [c60]Patrizio Angelini, Carla Binucci, William S. Evans, Ferran Hurtado, Giuseppe Liotta, Tamara Mchedlidze, Henk Meijer, Yoshio Okamoto:
Universal Point Subsets for Planar Graphs. ISAAC 2012: 423-432 - 2011
- [j67]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. Geom. Appl. 21(1): 87-100 (2011) - [j66]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. 15(1): 79-96 (2011) - [j65]Kevin Buchin, Marc J. van Kreveld, Henk Meijer, Bettina Speckmann, Kevin Verbeek:
On Planar Supports for Hypergraphs. J. Graph Algorithms Appl. 15(4): 533-549 (2011) - [j64]Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer:
Area, Curve Complexity, and Crossing Resolution of Non-Planar Graph Drawings. Theory Comput. Syst. 49(3): 565-575 (2011) - [c59]William S. Evans, Emden R. Gansner, Michael Kaufmann, Giuseppe Liotta, Henk Meijer, Andreas Spillner:
Approximate Proximity Drawings. GD 2011: 166-178 - 2010
- [j63]Luca Grilli, Seok-Hee Hong, Giuseppe Liotta, Henk Meijer, Stephen K. Wismath:
Matched drawability of graph pairs and of graph triples. Comput. Geom. 43(6-7): 611-634 (2010) - [j62]Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer, Stephen K. Wismath:
Constrained Point-Set Embeddability of Planar Graphs. Int. J. Comput. Geom. Appl. 20(5): 577-600 (2010) - [c58]Mereke van Garderen, Giuseppe Liotta, Henk Meijer:
Universal Pointsets for 2-Coloured Trees. GD 2010: 365-370 - [c57]Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer:
Drawing a Tree as a Minimum Spanning Tree Approximation. ISAAC (2) 2010: 61-72 - [c56]Henk Meijer, Yurai Núñez Rodríguez, David Rappaport:
Fault Recovery in Wireless Networks: The Geometric Recolouring Approach. SEA 2010: 474-485
2000 – 2009
- 2009
- [j61]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. 42(5): 429-454 (2009) - [j60]Henk Meijer, David Rappaport:
Editorial CCCG 2006. Comput. Geom. 42(5): 463 (2009) - [j59]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. 42(6-7): 582-605 (2009) - [j58]Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer, Stephen K. Wismath:
Point-set embeddings of trees with given partial drawings. Comput. Geom. 42(6-7): 664-676 (2009) - [j57]Henk Meijer, Yurai Núñez Rodríguez, David Rappaport:
Bounds for point recolouring in geometric graphs. Comput. Geom. 42(6-7): 690-703 (2009) - [j56]Emilio Di Giacomo, Giuseppe Liotta, Henk Meijer, Stephen K. Wismath:
Volume requirements of 3D upward drawings. Discret. Math. 309(7): 1824-1837 (2009) - [j55]Henk Meijer, Yurai Núñez Rodríguez, David Rappaport:
An algorithm for computing simple k-factors. Inf. Process. Lett. 109(12): 620-625 (2009) - [c55]Kamrul Islam, Selim G. Akl, Henk Meijer:
Distributed Generation of a Family of Connected Dominating Sets in Wireless Sensor Networks. DCOSS 2009: 343-355 - [c54]Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer:
Area, Curve Complexity, and Crossing Resolution of Non-planar Graph Drawings. GD 2009: 15-20 - [c53]Sergio Cabello, Marc J. van Kreveld, Giuseppe Liotta, Henk Meijer, Bettina Speckmann, Kevin Verbeek:
Geometric Simultaneous Embeddings of a Graph and a Matching. GD 2009: 183-194 - [c52]Kevin Buchin, Marc J. van Kreveld, Henk Meijer, Bettina Speckmann, Kevin Verbeek:
On Planar Supports for Hypergraphs. GD 2009: 345-356 - [c51]Kamrul Islam, Selim G. Akl, Henk Meijer:
Maximizing the lifetime of wireless sensor networks through domatic partition. LCN 2009: 436-442 - [c50]Luca Grilli, Seok-Hee Hong, Giuseppe Liotta, Henk Meijer, Stephen K. Wismath:
Matched Drawability of Graph Pairs and of Graph Triples. WALCOM 2009: 322-333 - 2008
- [j54]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 50(2): 279-298 (2008) - [j53]Sándor P. Fekete, Marco E. Lübbecke, Henk Meijer:
Minimizing the Stabbing Number of Matchings, Trees, and Triangulations. Discret. Comput. Geom. 40(4): 595-621 (2008) - [j52]Selim G. Akl, Kamrul Islam, Henk Meijer:
Planar tree transformation: Results and counterexample. Inf. Process. Lett. 109(1): 61-67 (2008) - [j51]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 6(1): 51-58 (2008) - [j50]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. 12(1): 29-49 (2008) - [c49]Selim G. Akl, Kamrul Islam, Henk Meijer:
Direct Planar Tree Transformation and Counterexample. CCCG 2008 - [c48]Henk Meijer, Yurai Núñez Rodríguez, David Rappaport:
On the Complexity of Point Recolouring in Geometric Graphs. CCCG 2008 - [c47]Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer, Stephen K. Wismath:
Constrained Point-Set Embeddability of Planar Graphs. GD 2008: 360-371 - [c46]Kamrul Islam, Selim G. Akl, Henk Meijer:
A Constant Factor Localized Algorithm for Computing Connected Dominating Sets in Wireless Sensor Networks. ICPADS 2008: 559-566 - 2007
- [j49]Giuseppe Liotta, Henk Meijer:
Advances in graph drawing: The 11th International Symposium on Graph Drawing. Discret. Appl. Math. 155(9): 1077 (2007) - [j48]Justin Colannino, Mirela Damian, Ferran Hurtado, Stefan Langerman, Henk Meijer, Suneeta Ramaswami, Diane L. Souvaine, Godfried Toussaint:
Efficient Many-To-Many Point Matching in One Dimension. Graphs Comb. 23(Supplement-1): 169-178 (2007) - [j47]Selim G. Akl, Kamrul Islam, Henk Meijer:
On planar path transformation. Inf. Process. Lett. 104(2): 59-64 (2007) - [j46]Marco Martens, Henk Meijer:
On the probabilistic behaviour of a heuristic algorithm for maximal Hamiltonian tours. J. Discrete Algorithms 5(1): 102-114 (2007) - [c45]Kamrul Islam, Henk Meijer, Yurai Núñez Rodríguez, David Rappaport, Henry Xiao:
Hamilton Circuits in Hexagonal Grid Graphs. CCCG 2007: 85-88 - [c44]Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer, Stephen K. Wismath:
Point-Set Embedding of Trees with Edge Constraints. GD 2007: 113-124 - [i12]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 abs/0705.4085 (2007) - 2006
- [j45]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. J. Comput. Biol. 13(4): 979-989 (2006) - [c43]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 - [c42]Kamrul Islam, Selim G. Akl, Henk Meijer:
On Planar Path Transformation. CCCG 2006 - [c41]Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer, Francesco Trotta, Stephen K. Wismath:
k -Colored Point-Set Embeddability of Outerplanar Graphs. GD 2006: 318-329 - [c40]Michael Hirsch, Henk Meijer, David Rappaport:
Biclique Edge Cover Graphs and Confluent Drawings. GD 2006: 405-416 - 2005
- [j44]Sándor P. Fekete, Henk Meijer:
The one-round Voronoi game replayed. Comput. Geom. 30(2): 81-94 (2005) - [j43]Emilio Di Giacomo, Giuseppe Liotta, Henk Meijer:
Computing straight-line 3D grid drawings of graphs in linear volume. Comput. Geom. 32(1): 26-58 (2005) - [j42]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. Geom. Appl. 15(4): 403-420 (2005) - [j41]Henk Meijer, David Rappaport:
Guest Editors' Foreword. Int. J. Comput. Geom. Appl. 15(6): 545-546 (2005) - [j40]Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer:
Computing Radial Drawings on the Minimum Number of Circles. J. Graph Algorithms Appl. 9(3): 365-389 (2005) - [c39]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: 163-166 - [c38]Kathryn Duffy, Chris McAloney, Henk Meijer, David Rappaport:
Closest Segments. CCCG 2005: 232-234 - [c37]Emilio Di Giacomo, Giuseppe Liotta, Henk Meijer, Stephen K. Wismath:
Volume Requirements of 3D Upward Drawings. GD 2005: 101-110 - [c36]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: 169-181 - [i11]Magdalene Grantson, Henk Meijer, David Rappaport:
Bi-chromatic minimum spanning trees. EuroCG 2005: 199-202 - [i10]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 abs/cs/0507013 (2005) - 2004
- [j39]Sándor P. Fekete, Henk Meijer:
Maximum Dispersion and Geometric Maximum Weight Cliques. Algorithmica 38(3): 501-511 (2004) - [c35]Henk Meijer, David Rappaport:
Simultaneous edge flips for convex subdivisions. CCCG 2004: 57-59 - [c34]Erik D. Demaine, Jeff Erickson, Ferran Hurtado, John Iacono, Stefan Langerman, Henk Meijer, Mark H. Overmars, Sue Whitesides:
Separating point sets in polygonal environments. SCG 2004: 10-16 - [c33]Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer:
Computing Radial Drawings on the Minimum Number of Circles. GD 2004: 251-261 - [c32]Sándor P. Fekete, Marco E. Lübbecke, Henk Meijer:
Minimizing the stabbing number of matchings, trees, and triangulations. SODA 2004: 437-446 - [i9]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 cs.DS/0407058 (2004) - [i8]Liam Keliher, Henk Meijer, Stafford E. Tavares:
Completion of Computation of Improved Upper Bound on the Maximum Average Linear Hull Probabilty for Rijndael. IACR Cryptol. ePrint Arch. 2004: 74 (2004) - 2003
- [j38]Giuseppe Liotta, Henk Meijer:
Voronoi drawings of trees. Comput. Geom. 24(3): 147-178 (2003) - [j37]Ferran Hurtado, Giuseppe Liotta, Henk Meijer:
Optimal and suboptimal robust algorithms for proximity graphs. Comput. Geom. 25(1-2): 35-49 (2003) - [j36]Oswin Aichholzer, David Bremner, Erik D. Demaine, Henk Meijer, Vera Sacristán, Michael A. Soss:
Long proteins with unique optimal foldings in the H-P model. Comput. Geom. 25(1-2): 139-159 (2003) - [j35]José Miguel Díaz-Báñez, Ferran Hurtado, Henk Meijer, David Rappaport, Joan Antoni Sellarès:
The Largest Empty Annulus Problem. Int. J. Comput. Geom. Appl. 13(4): 317-325 (2003) - [c31]Emilio Di Giacomo, Henk Meijer:
Track Drawings of Graphs with Constant Queue Number. GD 2003: 214-225 - [c30]Sándor P. Fekete, Henk Meijer:
The One-Round Voronoi Game Replayed. WADS 2003: 150-171 - [i7]Sándor P. Fekete, Henk Meijer:
The one-round Voronoi game replayed. CoRR cs.CG/0305016 (2003) - [i6]Sándor P. Fekete, Marco E. Lübbecke, Henk Meijer:
Minimizing the stabbing number of matchings, trees, and triangulations. CoRR cs.CG/0310034 (2003) - [i5]Sándor P. Fekete, Henk Meijer:
Maximum dispersion and geometric maximum weight cliques. CoRR cs.DS/0310037 (2003) - 2002
- [j34]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. Discret. Comput. Geom. 28(2): 231-253 (2002) - [j33]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 J. Exp. Algorithmics 7: 11 (2002) - [j32]Prosenjit Bose, Ferran Hurtado, Henk Meijer, Suneeta Ramaswami, David Rappaport, Vera Sacristán, Thomas C. Shermer, Godfried T. Toussaint:
Finding Specified Sections of Arrangements: 2D Results. J. Math. Model. Algorithms 1(1): 3-16 (2002) - [c29]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: 27-30 - [c28]Greg Aloupis, Prosenjit Bose, Erik D. Demaine, Stefan Langerman, Henk Meijer, Mark H. Overmars, Godfried T. Toussaint:
Computing signed permutations of polygons. CCCG 2002: 68-71 - [c27]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 (3) 2002: 46-54 - [c26]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: 369-380 - [i4]Oswin Aichholzer, David Bremner, Erik D. Demaine, Henk Meijer, Vera Sacristán, Michael A. Soss:
Long Proteins with Unique Optimal Foldings in the H-P Model. CoRR cs.CG/0201018 (2002) - [i3]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 cs.DS/0212044 (2002) - 2001
- [j31]Thomas Fevens, Henk Meijer, David Rappaport:
Minimum convex partition of a constrained point set. Discret. Appl. Math. 109(1-2): 95-107 (2001) - [j30]Kiyoshi Hosono, Henk Meijer, David Rappaport:
On the visibility graph of convex translates. Discret. Appl. Math. 113(2-3): 195-210 (2001) - [c25]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: 1-16 - [c24]Liam Keliher, Henk Meijer, Stafford E. Tavares:
New Method for Upper Bounding the Maximum Average Linear Hull Probability for SPNs. EUROCRYPT 2001: 420-436 - [c23]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: 112-128 - [c22]Ferran Hurtado, Giuseppe Liotta, Henk Meijer:
Optimal, Suboptimal, and Robust Algorithms for Proximity Graphs. WADS 2001: 2-13 - [i2]Liam Keliher, Henk Meijer, Stafford E. Tavares:
Dual of New Method for Upper Bounding the Maximum Average Linear Hull Probability for SPNs. IACR Cryptol. ePrint Arch. 2001: 33 (2001) - 2000
- [j29]Sándor P. Fekete, Henk Meijer:
On Minimum Stars and Maximum Matchings. Discret. Comput. Geom. 23(3): 389-407 (2000) - [c21]Sándor P. Fekete, Henk Meijer:
Maximum dispersion and geometric maximum weight cliques. APPROX 2000: 132-143 - [i1]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 cs.CG/0008010 (2000)
1990 – 1999
- 1999
- [j28]Paul E. Kearney, Ryan Hayward, Henk Meijer:
Evolutionary Trees and Ordinal Assertions. Algorithmica 25(2-3): 196-221 (1999) - [j27]Sándor P. Fekete, Henk Meijer:
Rectangle and Box Visibility Graphs in 3D. Int. J. Comput. Geom. Appl. 9(1): 1-28 (1999) - [c20]Sándor P. Fekete, Henk Meijer:
On Minimum Stars, Minimum Steiner Stars, and Maximum Matchings. SCG 1999: 217-226 - [c19]Therese Biedl, Anna Bretscher, Henk Meijer:
Rectangle of Influence Drawings of Graphs without Filled 3-Cycles. GD 1999: 359-368 - [c18]Giuseppe Liotta, Henk Meijer:
Voronoi Drawings of Trees. GD 1999: 369-378 - [c17]Liam Keliher, Henk Meijer, Stafford E. Tavares:
Modeling Linear Characteristics of Substitution-Permutation Networks. Selected Areas in Cryptography 1999: 78-91 - [e1]Stafford E. Tavares, Henk Meijer:
Selected Areas in Cryptography '98, SAC'98, Kingston, Ontario, Canada, August 17-18, 1998, Proceedings. Lecture Notes in Computer Science 1556, Springer 1999, ISBN 3-540-65894-7 [contents] - 1998
- [j26]Giuseppe Liotta, Anna Lubiw, Henk Meijer, Sue Whitesides:
The rectangle of influence drawability problem. Comput. Geom. 10(1): 1-22 (1998) - [j25]Esther M. Arkin, Henk Meijer, Joseph S. B. Mitchell, David Rappaport, Steven Skiena:
Decision trees for geometric models. Int. J. Comput. Geom. Appl. 8(3): 343-364 (1998) - [j24]Mark de Berg, Henk Meijer, Mark H. Overmars, Gordon T. Wilfong:
Computing the Angularity Tolerance. Int. J. Comput. Geom. Appl. 8(4): 467-482 (1998) - [j23]Kelly A. Lyons, Henk Meijer, David Rappaport:
Algorithms for Cluster Busting in Anchored Graph Drawing. J. Graph Algorithms Appl. 2(1): 1-24 (1998) - [j22]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. 2(3): 1-16 (1998) - [c16]Prosenjit Bose, Ferran Hurtado, Henk Meijer, Suneeta Ramaswami, David Rappaport, Vera Sacristán, Thomas C. Shermer, Godfried T. Toussaint:
Finding specified sections of arrangements: 2d results. CCCG 1998 - 1997
- [c15]Paul E. Kearney, Ryan Hayward, Henk Meijer:
Inferring Evolutionary Trees from Ordinal Data. SODA 1997: 418-426 - 1996
- [j21]Paraskevi Fragopoulou, Selim G. Akl, Henk Meijer:
Optimal Communication Primitives on the Generalized Hypercube Network. J. Parallel Distributed Comput. 32(2): 173-187 (1996) - [c14]Mark de Berg, Henk Meijer, Mark H. Overmars, Gordon T. Wilfong:
Computing the Angularity Tolerance. CCCG 1996: 331-336 - 1995
- [c13]Paul Colley, Henk Meijer, David Rappaport:
Motivating lazy guards. CCCG 1995: 121-126 - 1994
- [j20]Selim G. Akl, Henk Meijer, Ivan Stojmenovic:
An Optimal Systolic Algorithm for Generating Permutations in Lexicographic Order. J. Parallel Distributed Comput. 20(1): 84-91 (1994) - [j19]Ke Qiu, Selim G. Akl, Henk Meijer:
On Some Properties and Algorithms for the Star and Pancake Interconnection Networks. J. Parallel Distributed Comput. 22(1): 16-25 (1994) - [c12]Paul Colley, Henk Meijer, David Rappaport:
Optimal Nearly-Similar Polygon Stabbers of Convex Polygons. CCCG 1994: 269-274 - [c11]Hossam A. ElGindy, Giuseppe Liotta, Anna Lubiw, Henk Meijer, Sue Whitesides:
Recognizing Rectangle of Influence Drawable Graphs. GD 1994: 352-363 - 1993
- [c10]Kelly A. Lyons, Henk Meijer, David Rappaport:
Properties of the voronoi diagram cluster buster. CASCON 1993: 1148-1163 - [c9]Henk Meijer, Steven Skiena:
Reconstructing Polygons From X-Rays. CCCG 1993: 381-386 - [c8]Esther M. Arkin, Henk Meijer, Joseph S. B. Mitchell, David Rappaport, Steven Skiena:
Decision Trees for Geometric Models. SCG 1993: 369-378 - 1992
- [j18]Henk Meijer, David Rappaport:
Computing the Minimum Weight Triangulation of a Set of Linearly Ordered Points. Inf. Process. Lett. 42(1): 35-38 (1992) - 1991
- [j17]Ke Qiu, Henk Meijer, Selim G. Akl:
Decomposing a Star Graph Into Disjoint Cycles. Inf. Process. Lett. 39(3): 125-129 (1991) - [c7]Ke Qiu, Henk Meijer, Selim G. Akl:
Parallel Routing and Sorting of the Pancake Network. ICCI 1991: 360-371 - 1990
- [j16]Henk Meijer, Selim G. Akl:
Parallel Binary Search with Delayed Read Conflicts. Int. J. High Speed Comput. 2(1): 17-21 (1990) - [j15]Ke Qiu, Henk Meijer:
A Note on Diameter of Acyclic Directed Hypercubes. Inf. Process. Lett. 36(1): 51-52 (1990) - [j14]Selim G. Akl, Henk Meijer:
Parallel Binary Search. IEEE Trans. Parallel Distributed Syst. 1(2): 247-250 (1990)
1980 – 1989
- 1989
- [j13]Janice I. Glasgow, Michael A. Jenkins, Henk Meijer, Carl McCrosky:
Expressing parallel algorithms in Nial. Parallel Comput. 11(3): 331-347 (1989) - [j12]Carlisle M. Adams, Henk Meijer:
Security-related comments regarding McEliece's public-key cryptosystem. IEEE Trans. Inf. Theory 35(2): 454-455 (1989) - 1988
- [j11]Henk Meijer, Selim G. Akl:
Bit serial addition trees and their applications. Computing 40(1): 9-17 (1988) - [j10]Selim G. Akl, Henk Meijer:
On the bit complexity of parallel computations. Integr. 6(2): 201-212 (1988) - [c6]Henk Meijer, R. Dawes:
Fault Tolerant Networks of Specified Diameter. WG 1988: 74-86 - 1987
- [j9]Henk Meijer, Selim G. Akl:
Optimal computation of prefix sums on a binary tree of processors. Int. J. Parallel Program. 16(2): 127-136 (1987) - [c5]Carlisle M. Adams, Henk Meijer:
Security-Related Comments Regarding McEliece's Public-Key Cryptosystem. CRYPTO 1987: 224-228 - 1985
- [j8]Becky Chan, Henk Meijer:
A note on the method of puzzles for key distribution. Int. J. Parallel Program. 14(4): 221-223 (1985) - [j7]Stephen J. MacKinnon, Peter D. Taylor, Henk Meijer, Selim G. Akl:
An Optimal Algorithm for Assigning Cryptographic Keys to Control Access in a Hierarchy. IEEE Trans. Computers 34(9): 797-802 (1985) - [c4]Henk Meijer, Selim G. Akl:
Two New Secret Key Cryptosystems. EUROCRYPT 1985: 96-102 - 1984
- [c3]Selim G. Akl, Henk Meijer:
A Fast Pseudo Random Permutation Generator With Applications to Cryptology. CRYPTO 1984: 269-275 - 1983
- [j6]Henk Meijer, Selim G. Akl:
Remarks on a Digital Signature Scheme. Cryptologia 7(2): 183-186 (1983) - 1982
- [j5]Henk Meijer, Selim G. Akl:
Digital Signature Schemes. Cryptologia 6(4): 329-338 (1982) - [j4]Selim G. Akl, Henk Meijer:
On the Average-Case Complexity of "Bucketing" Algorithms. J. Algorithms 3(1): 9-13 (1982) - 1981
- [j3]Henk Meijer:
A Note on 'A Cryptosystem for Multiple Communication'. Inf. Process. Lett. 12(4): 179-181 (1981) - [j2]Dorothy E. Denning, Henk Meijer, Fred B. Schneider:
More on Master Keys for Group Sharing. Inf. Process. Lett. 13(3): 125-126 (1981) - [c2]Henk Meijer, Selim G. Akl:
Digital Signature Scheme for Computer Communication Networks. CRYPTO 1981: 65-70 - [c1]Henk Meijer, Selim G. Akl:
Digital signature schemes for computer communication networks. SIGCOMM 1981: 37-41 - 1980
- [j1]Henk Meijer, Selim G. Akl:
The Design and Analysis of a New Hybrid Sorting Algorithm. Inf. Process. Lett. 10(4/5): 213-218 (1980)
Coauthor Index
[i20] [j83] [j82] [j81] [c70] [i18] [j79] [j78] [j77] [c67] [i16] [i15] [j76] [c66] [c65] [i14] [i13] [j75] [j74] [c64] [c63] [j72] [j69] [j68] [c61] [c60] [j66] [j64] [c59] [j63] [j62] [c58] [c57] [j58] [j56] [c54] [c53] [c50] [j50] [c47] [j49] [c44] [c41] [j43] [j40] [c37] [c33] [j38] [j37] [c22] [c18] [j26] [c11]
Godfried T. Toussaint
aka: Godfried Toussaint
aka: Godfried Toussaint
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-11 01:05 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
