home	education	contact	library	calendar	search
	about us	research	people	archive	services	jobs

publications by H. Meijer

• Metis is a dutch, academic research information database
• see also: Metis for Departement Informatica
• please send notifications, questions, remarks etc to metis@cs.uu.nl
• see also : research -> Metis overviews

H. Meijer

• contact information
• my technical reports
• former member of group guests and others

some publications

Cabello Justo, S., Kreveld, M.J. van, Liotta, G., Meijer, H., Speckmann, B. & Verbeek, K. (2011). Geometric simultaneous embeddings of a graph and a matching. Journal of Graph Algorithms and Applications, 15, 79-96.

Buchin, K.A., Kreveld, M.J. van, Meijer, H., Speckmann, B. & Verbeek, K. (2011). On planar supports for hypergraphs. Journal of Graph Algorithms and Applications, 15, 533-549.

S. Cabello, S., Kreveld, M.J. van, Liotta, G., Meijer, H., Speckmann, B. & Verbeek, K. (2010). Geometric simultaneous embeddings of a graph and a matching. In Graph Drawing, 17th International Symposium, GD 2009 (pp. 183-194). Springer.

Buchin, K.A., Kreveld, M.J. van, Meijer, H., Speckmann, B. & Verbeek, K. (2010). On planar supports for hypergraphs. In Graph Drawing, 17th International Symposium, GD 2009 (pp. 345-356). Springer.

Anderson, R., Baxter, L., tripathy, S., Ishaque, N., Boot, N., Cabral, A., Kemen, E., Thines, M., Ah-Fong, A., Badejoko, W., Bittner-Eddy, P., Boore, J.L., Chibucos, M.C., Coates, M., Dehal, P., Delehaunty, K., Dong, S., Downton, P., Dumas, B., Fabro, G., Fronick, C., Fuerstenberg, S.I., Fulton, L., Gaulin, E., Govers, F., Hughes, L., Humphray, S., Jiang, R.H.I., Judelson, H., Kamoen, S., Kyung, K., Meijer, H., Minx, P., Morris, P., Nelson, J., Phuntumart, V., Qutob, D., Rehmany, A., Rougon-Cardoso, A., Ryden, P., Torto-Alalibo, T., Studholme, D., Wang, Y., Win, J., Wood, J., Clifton, S.W., Rogers, J., Ackerveken, A.F.J.M. van den, Jones, J.D.G., McDowell, J.M., Beynon, J. & Tyler, B.M. (2010). Signatures of adaptation to obligate biotrophy in the Hyaloperonospora arabidopsidis genome. Science, 1549-1551.

Buchin, K.A., Kreveld, M.J. van, Meijer, H., Speckmann, B. & Verbeek, K. (2009). On Planar Supports for Hypergraphs. onbekend: UU BETA ICS Departement Informatica.

Demaine, E., Erickson, J., Krizanc, D., Meijer, H., Morin, P., Overmars, M.H. & Whitesides, S. (2008). Realizing partitions respecting full and partial order information. Journal of Discrete Algorithms, 6, 51-58.

Demaine, E., Erickson, J., Krizanc, D., Meijer, H., Morin, P., Overmars, M.H. & Whitesides, S. (2006). Realizing partitions respecting full and partial order information. In J. Ryan, P. Manyem, K. Sugeng & M. Miller (Eds.), Proceedings of the 16th Australasian Workshop on Combinatorial Algorithms (pp. 105-113).

Demaine, E., Erickson, J., Krizanc, D., Meijer, H., Morin, P., Overmars, M.H. & Whitesides, S. (2005). Realizing partitions respecting full and partial order information. In J. Ryan, P. Manyem, K. Sugeng & M. Miller (Eds.), Proceedings of the 16th Australasian Workshop on Combinatorial Algorithms (pp. 105-113).

Demaine, E., Erickson, J., Krizanc, D., Meijer, H., Morin, P., Overmars, M.H. & Whitesides, S. (2005). Realizing partitions respecting full and partial order information. UU-CS 2005-037. onbekend: UU WINFI Informatica en Informatiekunde.

Demaine, E.D., Erickson, J., Hurtado, F., Iacono, J., Langerman, S., Meijer, H., Overmars, M.H. & Whitesides, S. (2005). Separating point sets in polygonal environments. International journal of computational geometry & applications, 403-419.

Demaine, E.D., Erickson, J., Hurtado, F., Iacono, J., Langerman, S., Meijer, H., Overmars, M.H. & Whitesides, S. (2004). Separating point sets in polygonal environments. In Proceedings ACM Symp. on Computation Geometry (pp. 10-16).

Aloupis, G., Bose, P., Demaine, E.D., Langerman, S., Meijer, H., Overmars, M.H. & Toussaint, G.T. (2002). Computing Signed Permutations of Polygons. UU-CS 2002-033. Utrecht, The Netherlands: Utrecht University: Information and Computing Sciences.

Aloupis, G., Bose, P., Demaine, E., Langerman, S., Meijer, H., Overmars, M.H. & Toussaint, G. (2002). Computing signed permutations of polygons. In Proceedings of the 14th Canadian Conference on Computational Geometry (pp. 68-71).

Aloupis, G., Demaine, E., Dujmovic, V., Erickson, J., Langerman, S., Meijer, H., Streinu, I., O'Rourke, J., Overmars, M.H., Soss, M. & Toussaint, G. (2002). Flat-state connectivity of linkages under dihedral motions. In Proceedings of the 13th Annual International Sympoium on Algorithms and Computation (pp. 369-380).

Aichholzer, O., Cortes, C., Demaine, E., Dujmovic, V., Erickson, J., Meijer, H., Overmars, M.H., Palop, B., Ramaswami, S. & Toussaint, G. (2002). Flipturning polygons. Discrete and Computational Geometry, 28, 231-254.

Berg, M.T. de, Meijer, H. & Overmars, M.H. (1996). Computing the angularity tolerance. UU-CS 1996-25. Utrecht, the Netherlands: Utrecht University: Information and Computing Sciences.