( en | de | ru )

 

Disambiguation of "Kaplan, Haim"

Author of the publication

copydeleteadd this publication to your clipboard
Decomposing Arrangements of Hyperplanes: VC-Dimension, Combinatorial Dimension, and Point Location.

, , , and . Discret. Comput. Geom., 64 (1): 109-173 (2020)

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.

Haim Taubenhaus

Gerhard Haim

Haim Abramowitsch

Gerhard Haim

Gerhard Haim

 

Other publications of authors with the same name

Path Minima in Incremental Unrooted Trees., and . ESA, volume 5193 of Lecture Notes in Computer Science, page 565-576. Springer, (2008)Optimal Cover of Points by Disks in a Simple Polygon., , , and . ESA (1), volume 6346 of Lecture Notes in Computer Science, page 475-486. Springer, (2010)Balanced-Replication Algorithms for Distribution Trees., and . ESA, volume 2461 of Lecture Notes in Computer Science, page 297-309. Springer, (2002)Maximum Flows by Incremental Breadth-First Search., , , , and . ESA, volume 6942 of Lecture Notes in Computer Science, page 457-468. Springer, (2011)Apprenticeship Learning via Frank-Wolfe., , , and . CoRR, (2019)Approximation Algorithms for Asymmetric TSP by Decomposing Directed Regular Multigraphs., , , and . FOCS, page 56-65. IEEE Computer Society, (2003)Minimum Cost Flows in Graphs with Unit Capacities., , , and . STACS, volume 30 of LIPIcs, page 406-419. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2015)Bottleneck Paths and Trees and Deterministic Graphical Games., , , , and . STACS, volume 47 of LIPIcs, page 27:1-27:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Randomized incremental constructions of three-dimensional convex hulls and planar voronoi diagrams, and approximate range counting., and . SODA, page 484-493. ACM Press, (2006)Simple Confluently Persistent Catenable Lists., , and . SIAM J. Comput., 30 (3): 965-977 (2000)