Tiling a figure using a height in a tree
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Random three-dimensional tilings of Aztec octahedra and tetrahedra: an extension of domino tilings
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
An algebraic method to compute a shortest path of local flips between two tilings
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Linear reductions of maximum matching
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Theoretical Computer Science
Ribbon tile invariants from the signed area
Journal of Combinatorial Theory Series A
King independence on triangle boards
Discrete Mathematics - Special issue: The 18th British combinatorial conference
Tilings of quadriculated annuli
Journal of Combinatorial Theory Series B
Theoretical Computer Science - Special issue: Tilings of the plane
Theoretical Computer Science - Special issue: Tilings of the plane
An algorithm to generate exactly once every tiling with lozenges of a domain
Theoretical Computer Science - Special issue: Tilings of the plane
The bounded eight-vertex model
Theoretical Computer Science - Special issue: Tilings of the plane
Tilings of rectangles with T-tetrominoes
Theoretical Computer Science - Combinatorics of the discrete plane and tilings
Tilings with trichromatic colored-edges triangles
Theoretical Computer Science - Combinatorics of the discrete plane and tilings
Domino tilings and related models: space of configurations of domains with holes
Theoretical Computer Science - Combinatorics of the discrete plane and tilings
The lattice structure of the set of domino tilings of a polygon
Theoretical Computer Science - Discrete applied problems, florilegium for E. Goles
Tilings on the butterfly lattice
European Journal of Combinatorics - Special issue on Eurocomb'03 - graphs and combinatorial structures
Computing large matchings fast
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
A characterization of flip-accessibility for rhombus tilings of the whole plane
Information and Computation
Steinitz theorems for orthogonal polyhedra
Proceedings of the twenty-sixth annual symposium on Computational geometry
Optimal partial tiling of Manhattan polyominoes
DGCI'09 Proceedings of the 15th IAPR international conference on Discrete geometry for computer imagery
DGCI'09 Proceedings of the 15th IAPR international conference on Discrete geometry for computer imagery
The most general conservation law for a cellular automaton
CSR'08 Proceedings of the 3rd international conference on Computer science: theory and applications
Computing large matchings fast
ACM Transactions on Algorithms (TALG)
Distributive lattices, polyhedra, and generalized flows
European Journal of Combinatorics
Computing large matchings in planar graphs with fixed minimum degree
Theoretical Computer Science
CSR'06 Proceedings of the First international computer science conference on Theory and Applications
Tiling an interval of the discrete line
CPM'06 Proceedings of the 17th Annual conference on Combinatorial Pattern Matching
Z-Tilings of polyominoes and standard basis
IWCIA'04 Proceedings of the 10th international conference on Combinatorial Image Analysis
How to tile by dominoes the boundary of a polycube
DGCI'06 Proceedings of the 13th international conference on Discrete Geometry for Computer Imagery
Hi-index | 0.00 |