Upward Point Set Embeddability for Convex Point Sets Is in P

Lecture Notes in Computer Science- Germany

doi 10.1007/978-3-642-25878-7_38

Full Text

Abstract

Available in

Categories

Computer Science

Theoretical Computer Science

Date

January 1, 2012

Authors

Michael Kaufmann

Tamara Mchedlidze

Antonios Symvonis

Publisher

Springer Berlin Heidelberg

Related search

Further Inequalities for Convex Sets With Lattice Point Constraints in the Plane

Bulletin of the Australian Mathematical Society

English

On a Topological Characterization of Compact Convex Point Sets

Proceedings of the National Academy of Sciences of the United States of America

Multidisciplinary

English

Affine Invariant Point-Set Matching Using Convex Hull Bisection

English

Convex Sets With the Lipschitz Fixed Point Property Are Compact

Proceedings of the American Mathematical Society

Applied Mathematics

English

Covering Paths for Planar Point Sets

Lecture Notes in Computer Science

Computer Science

Theoretical Computer Science

English

Concerning Sets of Segments Which Cover a Point Set in the Vitali Sense

Proceedings of the National Academy of Sciences of the United States of America

Multidisciplinary

English

Least $P$th Power Polynomials on a Finite Point Set

Transactions of the American Mathematical Society

Applied Mathematics

English

Farthest-Point Optimized Point Sets With Maximized Minimum Distance

English

Every Lusin Set Is Undetermined in the Point-Open Game

Fundamenta Mathematicae

English