Author of the publication

DimStiller: Workflows for dimensional analysis and reduction.

, , , , , and . IEEE VAST, page 3-10. IEEE Computer Society, (2010)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Vertically Constrained Motzkin-Like Paths Inspired by Bobbin Lace., , and . Electron. J. Comb., 26 (2): 2 (2019)Maximum Matchings and Minimum Blocking Sets in Θ6-Graphs., , , , , and . CoRR, (2019)DimStiller: Workflows for dimensional analysis and reduction., , , , , and . IEEE VAST, page 3-10. IEEE Computer Society, (2010)Lace tessellations: a mathematical model for bobbin lace and an exhaustive combinatorial search for patterns.. University of Victoria, Canada, (2016)Partitioning Orthogonal Histograms into Rectangular Boxes., , , , , and . LATIN, volume 10807 of Lecture Notes in Computer Science, page 146-160. Springer, (2018)Quasiperiodic bobbin lace patterns., , and . CoRR, (2019)Drawing Bobbin Lace Graphs, or, Fundamental Cycles for a Subclass of Periodic Graphs., and . GD, volume 10692 of Lecture Notes in Computer Science, page 140-152. Springer, (2017)Reconstructing a Polyhedron between Polygons in Parallel Slices., , , , , and . CoRR, (2020)Maximum Matchings and Minimum Blocking Sets in \varTheta _6 -Graphs., , , , , and . WG, volume 11789 of Lecture Notes in Computer Science, page 258-270. Springer, (2019)Maximum Matchings and Minimum Blocking Sets in $\Theta_6$-Graphs, , , , , and . Proceedings of the 35th European Workshop on Computational Geometry (EuroCG'19), Utrecht, (2019)Abstract.