Amanote Research
Register
Sign In
Discover open access scientific publications
Search, annotate, share and cite publications
Publications by Kent Quanrud
Fast LP-based Approximations for Geometric Packing and Covering Problems
Randomized MWU for Positive LPs
A Fast Approximation for Maximum Weight Matroid Intersection
Computing Circle Packing Representations of Planar Graphs
Related publications
Some Packing and Covering Theorems
Colloquium Mathematicum
Mathematics
Packing, Tiling, and Covering With Tetrahedra
Proceedings of the National Academy of Sciences of the United States of America
Multidisciplinary
Fast Algorithms for Collision and Proximity Problems Involving Moving Geometric Objects
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Fast Approximations for Boundary Element Based Brittle Fracture Simulation
ACM Transactions on Graphics
Computer Graphics
Computer-Aided Design
An LP-based Heuristic Algorithm for the Node Capacitated In-Tree Packing Problem
Computers and Operations Research
Management Science
Simulation
Computer Science
Operations Research
Modeling
Optimal Trellis-Based Buffered Compression and Fast Approximations
IEEE Transactions on Image Processing
Computer Graphics
Computer-Aided Design
Software
Covering Problems for Dichotomized Matching
Aequationes Mathematicae
Combinatorics
Mathematics
Applied Mathematics
Discrete Mathematics
High Order Summation-By-Parts Based Approximations for Discontinuous and Nonlinear Problems
Packing and Covering by Translates of Certain Nonconvex Bodies
Proceedings of the American Mathematical Society
Mathematics
Applied Mathematics
