Author of the publication

copy delete add this publication to your clipboard
community post
history of this post
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

Shortest Path to a Segment and Quickest Visibility Queries.

E. Arkin, A. Efrat, C. Knauer, J. Mitchell, V. Polishchuk, G. Rote, L. Schlipf, and T. Talvitie. Symposium on Computational Geometry, volume 34 of LIPIcs, page 658-673. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, (2015)

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.

Valentin Leipe University of Stuttgart

Valentin Kamm University of Stuttgart

Valentin Wagner University of Stuttgart

Valentin Bayer University of Stuttgart

Valentin Honold University of Stuttgart

Other publications of authors with the same name

Improved approximations for two-stage min-cut and shortest path problems under uncertainty.D. Golovin, V. Goyal, V. Polishchuk, R. Ravi, and M. Sysikaski. Math. Program., 149 (1-2): 167-194 (2015)Geometric stable roommates.E. Arkin, S. Bae, A. Efrat, K. Okamoto, J. Mitchell, and V. Polishchuk. Inf. Process. Lett., 109 (4): 219-224 (2009)Optimal Geometric Flows via Dual Programs.S. Eriksson-Bique, V. Polishchuk, and M. Sysikaski. Symposium on Computational Geometry, page 100. ACM, (2014)Convex Transversals.E. Arkin, C. Dieckmann, C. Knauer, J. Mitchell, V. Polishchuk, L. Schlipf, and S. Yang. WADS, volume 6844 of Lecture Notes in Computer Science, page 49-60. Springer, (2011)Computing the L1 Geodesic Diameter and Center of a Polygonal Domain.S. Bae, M. Korman, J. Mitchell, Y. Okamoto, V. Polishchuk, and H. Wang. CoRR, (2015)A simple local 3-approximation algorithm for vertex coverV. Polishchuk, and J. Suomela. CoRR, (2008)Minimum-Link Paths RevisitedJ. Mitchell, V. Polishchuk, and M. Sysikaski. CoRR, (2013)Scandinavian Thins on Top of Cake: On the Smallest One-Size-Fits-All Box.E. Arkin, A. Efrat, G. Hart, I. Kostitsyna, A. Kröller, J. Mitchell, and V. Polishchuk. FUN, volume 7288 of Lecture Notes in Computer Science, page 16-27. Springer, (2012)Not being (super)thin or solid is hard: A study of grid Hamiltonicity.E. Arkin, S. Fekete, K. Islam, H. Meijer, J. Mitchell, Y. Rodríguez, V. Polishchuk, D. Rappaport, and H. Xiao. Comput. Geom., 42 (6-7): 582-605 (2009)Two New Classes of Hamiltonian Graphs: (Extended Abstract).E. Arkin, J. Mitchell, and V. Polishchuk. Electron. Notes Discret. Math., (2007)