A note on finding a maximum empty rectangle

Fast algorithms for computing the largest empty rectangle

SCG '87 Proceedings of the third annual symposium on Computational geometry

Optimal parallel algorithms for direct dominance problems

Nordic Journal of Computing

Mining for Empty Rectangles in Large Data Sets

ICDT '01 Proceedings of the 8th International Conference on Database Theory

Mining for empty spaces in large data sets

Theoretical Computer Science - Database theory

Fast algorithms for finding disjoint subsequences with extremal densities

Pattern Recognition

Dual-bounded generating problems: Efficient and inefficient points for discrete probability distributions and sparse boxes for multidimensional data

Theoretical Computer Science

Generating all minimal integral solutions to AND-OR systems of monotone inequalities: Conjunctions are simpler than disjunctions

Discrete Applied Mathematics

An intersection inequality for discrete distributions and related generation problems

ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming

Submatrix maximum queries in Monge matrices and Monge partial matrices, and their applications

Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms

Fast algorithms for finding disjoint subsequences with extremal densities

ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation

Generating all minimal integral solutions to monotone ∧,∨-systems of linear, transversal and polymatroid inequalities

MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science

An in-place min-max priority search tree

Computational Geometry: Theory and Applications