default search action
Esther M. Arkin
Person information
- affiliation: Stony Brook University, Department of Applied Mathematics and Statistics, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2023
- [c61]Esther M. Arkin, Rezaul Alam Chowdhury, Mayank Goswami, Jason Huang, Joseph S. B. Mitchell, Valentin Polishchuk, Rakesh Ravindran:
Fair subgraph selection for contagion containment (Brief Announcement). LAGOS 2023: 370-372 - 2021
- [j58]Hugo A. Akitaya
, Esther M. Arkin, Mirela Damian, Erik D. Demaine, Vida Dujmovic, Robin Y. Flatland, Matias Korman, Belén Palop, Irene Parada
Universal Reconfiguration of Facet-Connected Modular Robots by Pivots: The O(1) Musketeers. Algorithmica 83(5): 1316-1351 (2021) - 2020
- [c60]Esther M. Arkin, Rathish Das, Jie Gao, Mayank Goswami, Joseph S. B. Mitchell, Valentin Polishchuk, Csaba D. Tóth:
Cutting Polygons into Small Pieces with Chords: Laser-Based Localization. ESA 2020: 7:1-7:23 - [c59]Yanjun Pan
Data inference from encrypted databases: a multi-dimensional order-preserving matching approach. MobiHoc 2020: 151-160 - [c58]Esther M. Arkin, Faryad Darabi Sahneh, Alon Efrat
Computing β-Stretch Paths in Drawings of Graphs. SWAT 2020: 7:1-7:20 - [i16]Yanjun Pan, Alon Efrat, Ming Li, Boyang Wang, Hanyu Quan, Joseph S. B. Mitchell, Jie Gao, Esther M. Arkin:
Data Inference from Encrypted Databases: A Multi-dimensional Order-Preserving Matching Approach. CoRR abs/2001.08773 (2020) - [i15]Esther M. Arkin, Rathish Das, Jie Gao, Mayank Goswami, Joseph S. B. Mitchell, Valentin Polishchuk, Csaba D. Tóth:
Cutting Polygons into Small Pieces with Chords: Laser-Based Localization. CoRR abs/2006.15089 (2020)
2010 – 2019
- 2019
- [j57]Esther M. Arkin, Paz Carmi, Matthew J. Katz, Joseph S. B. Mitchell, Michael Segal
Locating battery charging stations to facilitate almost shortest paths. Discret. Appl. Math. 254: 10-16 (2019) - [c57]Hugo A. Akitaya
Universal Reconfiguration of Facet-Connected Modular Robots by Pivots: The O(1) Musketeers. ESA 2019: 3:1-3:14 - [c56]Rathish Das, Shih-Yu Tsai, Sharmila Duppala, Jayson Lynch, Esther M. Arkin, Rezaul Chowdhury, Joseph S. B. Mitchell, Steven Skiena:
Data Races and the Discrete Resource-time Tradeoff Problem with Resource Reuse over Paths. SPAA 2019: 359-368 - [i14]Rathish Das, Shih-Yu Tsai, Sharmila Duppala, Jayson Lynch, Esther M. Arkin, Rezaul Chowdhury, Joseph S. B. Mitchell, Steven Skiena:
Data Races and the Discrete Resource-time Tradeoff Problem with Resource Reuse over Paths. CoRR abs/1904.09283 (2019) - [i13]Hugo A. Akitaya, Esther M. Arkin, Mirela Damian, Erik D. Demaine, Vida Dujmovic, Robin Y. Flatland, Matias Korman, Belén Palop, Irene Parada, André van Renssen, Vera Sacristán:
Universal Reconfiguration of Facet-Connected Modular Robots by Pivots: The O(1) Musketeers. CoRR abs/1908.07880 (2019) - 2018
- [j56]Esther M. Arkin, Aritra Banik
Selecting and covering colored points. Discret. Appl. Math. 250: 75-86 (2018) - 2017
- [j55]Yair Allouche, Esther M. Arkin, Yuval Cassuto, Alon Efrat
Secure communication through jammers jointly optimized in geography and time. Pervasive Mob. Comput. 41: 83-105 (2017) - [c55]Kin Sum Liu, Tyler Mayer, Hao-Tsung Yang
Joint sensing duty cycle scheduling for heterogeneous coverage guarantee. INFOCOM 2017: 1-9 - [c54]Esther M. Arkin, Aritra Banik, Paz Carmi, Gui Citovsky, Su Jia, Matthew J. Katz, Tyler Mayer, Joseph S. B. Mitchell:
Network Optimization on Partitioned Pairs of Points. ISAAC 2017: 6:1-6:12 - [c53]Jiemin Zeng, Gaurish Telang, Matthew P. Johnson, Rik Sarkar, Jie Gao, Esther M. Arkin, Joseph S. B. Mitchell:
Mobile r-gather: Distributed and Geographic Clustering for Location Anonymity. MobiHoc 2017: 7:1-7:10 - [i12]Esther M. Arkin, Aritra Banik, Paz Carmi, Gui Citovsky, Su Jia, Matthew J. Katz, Tyler Mayer, Joseph S. B. Mitchell:
Network Optimization on Partitioned Pairs of Points. CoRR abs/1710.00876 (2017) - 2016
- [j54]Valentin Polishchuk, Esther M. Arkin, Alon Efrat, Christian Knauer, Joseph S. B. Mitchell, Günter Rote, Lena Schlipf, Topi Talvitie:
Shortest path to a segment and quickest visibility queries. J. Comput. Geom. 7(2): 77-100 (2016) - [c52]Esther M. Arkin, Jie Gao, Adam Hesterberg, Joseph S. B. Mitchell, Jiemin Zeng:
The Shortest Separating Cycle Problem. WAOA 2016: 1-13 - 2015
- [j53]Esther M. Arkin, José Miguel Díaz-Báñez
Bichromatic 2-center of pairs of points. Comput. Geom. 48(2): 94-107 (2015) - [j52]Esther M. Arkin, Antonio Fernández Anta
Probabilistic bounds on the length of a longest edge in Delaunay graphs of random points in d-dimensions. Comput. Geom. 48(2): 134-146 (2015) - [c51]Esther M. Arkin, Aritra Banik, Paz Carmi, Gui Citovsky, Matthew J. Katz, Joseph S. B. Mitchell, Marina Simakov:
Conflict-free Covering. CCCG 2015 - [c50]Esther M. Arkin, Alon Efrat
Shortest Path to a Segment and Quickest Visibility Queries. SoCG 2015: 658-673 - [c49]Esther M. Arkin, Yuval Cassuto, Alon Efrat
Optimal placement of protective jammers for securing wireless transmissions in a geographic domain. IPSN 2015: 37-46 - [c48]Esther M. Arkin, Aritra Banik, Paz Carmi, Gui Citovsky, Matthew J. Katz, Joseph S. B. Mitchell, Marina Simakov:
Choice Is Hard. ISAAC 2015: 318-328 - [c47]Yair Allouche, Yuval Cassuto, Alon Efrat
Secure Communication through Jammers Jointly Optimized in Geography and Time. MobiHoc 2015: 227-236 - [c46]Zhong Sichen, Lu Zhao, Yan Liang
Optimizing Read Reversals for Sequence Compression - (Extended Abstract). WABI 2015: 189-202 - 2014
- [j51]Esther M. Arkin, Alon Efrat
Data transmission and base-station placement for optimizing the lifetime of wireless sensor networks. Ad Hoc Networks 12: 201-218 (2014) - [j50]Esther M. Arkin, Claudia Dieckmann, Christian Knauer, Joseph S. B. Mitchell, Valentin Polishchuk, Lena Schlipf, Shang Yang:
Convex transversals. Comput. Geom. 47(2): 224-239 (2014) - [j49]Helmut Alt, Esther M. Arkin, Alon Efrat
Scandinavian Thins on Top of Cake: New and Improved Algorithms for Stacking and Packing. Theory Comput. Syst. 54(4): 689-714 (2014) - [c45]Esther M. Arkin, Paz Carmi, Matthew J. Katz, Joseph S. B. Mitchell, Michael Segal
Locating Battery Charging Stations to Facilitate Almost Shortest Paths. ATMOS 2014: 25-33 - 2012
- [j48]Esther M. Arkin, Nili Guttmann-Beck, Refael Hassin:
The (K, k)-capacitated spanning tree problem. Discret. Optim. 9(4): 258-266 (2012) - [j47]Esther M. Arkin, Delia Garijo
Separability of Point Sets by k-Level Linear Classification Trees. Int. J. Comput. Geom. Appl. 22(2): 143-166 (2012) - [c44]Esther M. Arkin, Alon Efrat
Scandinavian Thins on Top of Cake: On the Smallest One-Size-Fits-All Box. FUN 2012: 16-27 - [c43]Esther M. Arkin, José Miguel Díaz-Báñez
Bichromatic 2-Center of Pairs of Points. LATIN 2012: 25-36 - 2011
- [j46]Esther M. Arkin, Michael A. Bender, Joseph S. B. Mitchell, Valentin Polishchuk:
The snowblower problem. Comput. Geom. 44(8): 370-384 (2011) - [c42]Esther M. Arkin, Antonio Fernández Anta, Joseph S. B. Mitchell, Miguel A. Mosteiro:
Probabilistic Bounds on the Length of a Longest Edge in Delaunay Graphs of Random Points in d-Dimensions. CCCG 2011 - [c41]Esther M. Arkin, Claudia Dieckmann, Christian Knauer, Joseph S. B. Mitchell, Valentin Polishchuk, Lena Schlipf, Shang Yang:
Convex Transversals. WADS 2011: 49-60 - [i11]Esther M. Arkin, Antonio Fernández Anta, Joseph S. B. Mitchell, Miguel A. Mosteiro:
Probabilistic Bounds on the Length of a Longest Edge in Delaunay Graphs of Random Points in d-Dimensions. CoRR abs/1106.4927 (2011) - 2010
- [j45]Esther M. Arkin, Joseph S. B. Mitchell, Valentin Polishchuk:
Maximum thick paths in static and dynamic environments. Comput. Geom. 43(3): 279-294 (2010) - [c40]Esther M. Arkin, Nili Guttmann-Beck, Refael Hassin:
The (K, k)-Capacitated Spanning Tree Problem. AAIM 2010: 25-34 - [c39]Esther M. Arkin, Valentin Polishchuk, Alon Efrat
Data transmission and base-station placement for optimizing network lifetime. DIALM-PODC 2010: 23-32
2000 – 2009
- 2009
- [j44]Esther M. Arkin, Sándor P. Fekete, Kamrul Islam, Henk Meijer, Joseph S. B. Mitchell, Yurai Núñez Rodríguez, Valentin Polishchuk, David Rappaport, Henry Xiao:
Not being (super)thin or solid is hard: A study of grid Hamiltonicity. Comput. Geom. 42(6-7): 582-605 (2009) - [j43]Bernardo M. Ábrego, Esther M. Arkin, Silvia Fernández-Merchant
Matching Points with Squares. Discret. Comput. Geom. 41(1): 77-95 (2009) - [j42]Esther M. Arkin, Sang Won Bae
Geometric stable roommates. Inf. Process. Lett. 109(4): 219-224 (2009) - 2008
- [j41]Esther M. Arkin, Refael Hassin:
The k-path tree matroid and its applications to survivable network design. Discret. Optim. 5(2): 314-322 (2008) - [j40]Esther M. Arkin, Joseph S. B. Mitchell, Jack Snoeyink
Capturing crossings: Convex hulls of segment and plane intersections. Inf. Process. Lett. 107(5): 194-197 (2008) - [c38]Esther M. Arkin, George Hart, Joondong Kim, Irina Kostitsyna, Joseph S. B. Mitchell, Girishkumar Sabhnani, Steven Skiena:
The Embroidery Problem. CCCG 2008 - [c37]Esther M. Arkin, Joseph S. B. Mitchell, Valentin Polishchuk:
Maximum thick paths in static and dynamic environments. SCG 2008: 20-27 - 2007
- [j39]Esther M. Arkin, Joseph S. B. Mitchell, Valentin Polishchuk:
Two New Classes of Hamiltonian Graphs: (Extended Abstract). Electron. Notes Discret. Math. 29: 565-569 (2007) - [c36]Esther M. Arkin, Joseph S. B. Mitchell, Jack Snoeyink:
Capturing Crossings: Convex Hulls of Segment and Plane Intersections. CCCG 2007: 9-11 - 2006
- [j38]Esther M. Arkin, Michael A. Bender, Sándor P. Fekete, Joseph S. B. Mitchell, Martin Skutella:
The Freeze-Tag Problem: How to Wake Up a Swarm ofRobots. Algorithmica 46(2): 193-221 (2006) - [j37]Esther M. Arkin, Ferran Hurtado, Joseph S. B. Mitchell, Carlos Seara
Some Lower Bounds on Geometric Separability Problems. Int. J. Comput. Geom. Appl. 16(1): 1-26 (2006) - [j36]Esther M. Arkin, Refael Hassin, Asaf Levin
Approximations for minimum and min-max vehicle routing problems. J. Algorithms 59(1): 1-18 (2006) - [c35]Valentin Polishchuk, Esther M. Arkin, Joseph S. B. Mitchell:
Hamiltonian Cycles in Triangular Grids. CCCG 2006 - [c34]Helmut Alt, Esther M. Arkin, Hervé Brönnimann, Jeff Erickson, Sándor P. Fekete, Christian Knauer, Jonathan Lenchner, Joseph S. B. Mitchell, Kim Whittlesey:
Minimum-cost coverage of point sets by disks. SCG 2006: 449-458 - [c33]Esther M. Arkin, Gill Barequet, Joseph S. B. Mitchell:
Algorithms for two-box covering. SCG 2006: 459-467 - [c32]Esther M. Arkin, Michael A. Bender, Joseph S. B. Mitchell, Valentin Polishchuk:
The Snowblower Problem. WAFR 2006: 219-234 - [i10]Esther M. Arkin, Michael A. Bender, Joseph S. B. Mitchell, Valentin Polishchuk:
The Snowblower Problem. CoRR abs/cs/0603026 (2006) - [i9]Esther M. Arkin, Hervé Brönnimann, Jeff Erickson, Sándor P. Fekete, Christian Knauer, Jonathan Lenchner, Joseph S. B. Mitchell, Kim Whittlesey:
Minimum-Cost Coverage of Point Sets by Disks. CoRR abs/cs/0604008 (2006) - 2005
- [j35]Esther M. Arkin, Michael A. Bender, Erik D. Demaine, Sándor P. Fekete, Joseph S. B. Mitchell, Saurabh Sethia
Optimal Covering Tours with Turn Costs. SIAM J. Comput. 35(3): 531-566 (2005) - 2004
- [j34]Esther M. Arkin, Refael Hassin, Shlomi Rubinstein, Maxim Sviridenko:
Approximations for Maximum Transportation with Permutable Supply Vector and Other Capacitated Star Packing Problems. Algorithmica 39(2): 175-187 (2004) - [j33]Esther M. Arkin, Michael A. Bender, Erik D. Demaine, Martin L. Demaine, Joseph S. B. Mitchell, Saurabh Sethia
When can you fold a map? Comput. Geom. 29(1): 23-46 (2004) - [j32]Marcelo O. Sztainberg, Esther M. Arkin, Michael A. Bender, Joseph S. B. Mitchell:
Theoretical and experimental analysis of heuristics for the "freeze-tag" robot awakening problem. IEEE Trans. Robotics 20(4): 691-701 (2004) - [c31]Bernardo M. Ábrego, Esther M. Arkin, Silvia Fernández-Merchant
Matching Points with Circles and Squares. JCDCG 2004: 1-15 - [i8]Esther M. Arkin, Michael A. Bender, Sándor P. Fekete, Joseph S. B. Mitchell, Martin Skutella:
The Freeze-Tag Problem: How to Wake Up a Swarm of Robots. CoRR cs.DS/0402045 (2004) - 2003
- [j31]Esther M. Arkin, Sándor P. Fekete, Joseph S. B. Mitchell:
An algorithmic study of manufacturing paperclips and other folded structures. Comput. Geom. 25(1-2): 117-138 (2003) - [j30]Esther M. Arkin, Michael A. Bender, Joseph S. B. Mitchell, Steven Skiena
The Lazy Bureaucrat scheduling problem. Inf. Comput. 184(1): 129-146 (2003) - [j29]Esther M. Arkin, Joseph S. B. Mitchell, Christine D. Piatko
Minimum-link watchman tours. Inf. Process. Lett. 86(4): 203-207 (2003) - [c30]Tien-Ruey Hsiang, Esther M. Arkin, Michael A. Bender, Sándor P. Fekete, Joseph S. B. Mitchell:
Online dispersion algorithms for swarms of robots. SCG 2003: 382-383 - [c29]Esther M. Arkin, Michael A. Bender, Dongdong Ge:
Improved approximation algorithms for the freeze-tag problem. SPAA 2003: 295-303 - [i7]Esther M. Arkin, Michael A. Bender, Erik D. Demaine, Sándor P. Fekete, Joseph S. B. Mitchell, Saurabh Sethia:
Optimal Covering Tours with Turn Costs. CoRR cs.DS/0309014 (2003) - 2002
- [j28]Esther M. Arkin, Refael Hassin:
A note on orientations of mixed graphs. Discret. Appl. Math. 116(3): 271-278 (2002) - [j27]Esther M. Arkin, Refael Hassin, Shimon Shahar:
Increasing digraph arc-connectivity by arc addition, reversal and complement. Discret. Appl. Math. 122(1-3): 13-22 (2002) - [c28]Vitus J. Leung, Esther M. Arkin, Michael A. Bender, David P. Bunde, Jeanette Johnston, Alok Lal, Joseph S. B. Mitchell, Cynthia A. Phillips, Steven S. Seiden:
Processor Allocation on Cplant: Achieving General Processor Locality Using One-Dimensional Allocation Strategies. CLUSTER 2002: 296-304 - [c27]Esther M. Arkin, Michael A. Bender, Sándor P. Fekete, Joseph S. B. Mitchell, Martin Skutella:
The freeze-tag problem: how to wake up a swarm of robots. SODA 2002: 568-577 - [c26]Marcelo O. Sztainberg, Esther M. Arkin, Michael A. Bender, Joseph S. B. Mitchell:
Analysis of Heuristics for the Freeze-Tag Problem. SWAT 2002: 270-279 - [c25]Esther M. Arkin, Refael Hassin, Shlomi Rubinstein, Maxim Sviridenko:
Approximations for Maximum Transportation Problem with Permutable Supply Vector and Other Capacitated Star Packing Problems. SWAT 2002: 280-287 - [c24]Tien-Ruey Hsiang, Esther M. Arkin, Michael A. Bender, Sándor P. Fekete, Joseph S. B. Mitchell:
Algorithms for Rapidly Dispersing Robot Swarms in Unknown Environments. WAFR 2002: 77-94 - [i6]Esther M. Arkin, Sándor P. Fekete, Joseph S. B. Mitchell:
An Algorithmic Study of Manufacturing Paperclips and Other Folded Structures. CoRR cs.CG/0209034 (2002) - [i5]Esther M. Arkin, Sándor P. Fekete, Ferran Hurtado, Joseph S. B. Mitchell, Marc Noy, Vera Sacristán, Saurabh Sethia:
On the Reflexivity of Point Sets. CoRR cs.CG/0210003 (2002) - [i4]Esther M. Arkin, Michael A. Bender, Joseph S. B. Mitchell, Steven Skiena:
The Lazy Bureaucrat Scheduling Problem. CoRR cs.DS/0210024 (2002) - [i3]Tien-Ruey Hsiang, Esther M. Arkin, Michael A. Bender, Sándor P. Fekete, Joseph S. B. Mitchell:
Algorithms for Rapidly Dispersing Robot Swarms in Unknown Environments. CoRR cs.RO/0212022 (2002) - 2001
- [j26]Esther M. Arkin, Refael Hassin, Maxim Sviridenko:
Approximating the maximum quadratic assignment problem. Inf. Process. Lett. 77(1): 13-16 (2001) - [c23]Esther M. Arkin, Michael A. Bender, Erik D. Demaine, Sándor P. Fekete, Joseph S. B. Mitchell, Saurabh Sethia:
Optimal covering tours with turn costs. SODA 2001: 138-147 - [c22]Esther M. Arkin, Sándor P. Fekete, Ferran Hurtado, Joseph S. B. Mitchell, Marc Noy, Vera Sacristán
On the Reflexivity of Point Sets. WADS 2001: 192-204 - [c21]Esther M. Arkin, Michael A. Bender, Erik D. Demaine, Martin L. Demaine, Joseph S. B. Mitchell, Saurabh Sethia
When Can You Fold a Map? WADS 2001: 401-413 - 2000
- [j25]Esther M. Arkin, Martin Held, Christopher L. Smith:
Optimization Problems Related to Zigzag Pocket Machining. Algorithmica 26(2): 197-236 (2000) - [j24]Martin Held, Esther M. Arkin:
Letter to the editor: an algorithm for reducing tool retractions in zigzag pocket machining. Comput. Aided Des. 32(10): 617-619 (2000) - [j23]Esther M. Arkin, Sándor P. Fekete, Joseph S. B. Mitchell:
Approximation algorithms for lawn mowing and milling. Comput. Geom. 17(1-2): 25-50 (2000) - [j22]Esther M. Arkin, Refael Hassin:
Minimum-diameter covering problems. Networks 36(3): 147-155 (2000) - [c20]Esther M. Arkin, Refael Hassin:
Approximating the maximum quadratic assignment problem. SODA 2000: 889-890 - [i2]Esther M. Arkin, Ferran Hurtado, Joseph S. B. Mitchell, Carlos Seara, Steven Skiena:
Some Separability Problems in the Plane. EuroCG 2000: 51-54 - [i1]Esther M. Arkin, Michael A. Bender, Erik D. Demaine, Martin L. Demaine, Joseph S. B. Mitchell, Saurabh Sethia, Steven Skiena:
When Can You Fold a Map? CoRR cs.CG/0011026 (2000)
1990 – 1999
- 1999
- [j21]Esther M. Arkin, Yi-Jen Chiang, Joseph S. B. Mitchell, Steven Skiena
On the Maximum Scatter Traveling Salesperson Problem. SIAM J. Comput. 29(2): 515-544 (1999) - [c19]Esther M. Arkin, Michael A. Bender, Joseph S. B. Mitchell, Steven Skiena:
The Lazy Bureaucrat Scheduling Problem. WADS 1999: 122-133 - 1998
- [j20]Esther M. Arkin, Yi-Jen Chiang, Martin Held, Joseph S. B. Mitchell, Vera Sacristán, Steven Skiena, Tae-Heng Yang:
On Minimum-Area Hulls. Algorithmica 21(1): 119-136 (1998) - [j19]Esther M. Arkin, Martin Held, Joseph S. B. Mitchell, Steven Skiena
Recognizing polygonal parts from width measurements. Comput. Geom. 9(4): 237-246 (1998) - [j18]Esther M. Arkin, Refael Hassin:
Graph partitions with minimum degree constraints. Discret. Math. 190(1-3): 55-65 (1998) - [j17]Esther M. Arkin, Henk Meijer, Joseph S. B. Mitchell, David Rappaport, Steven Skiena:
Decision trees for geometric models. Int. J. Comput. Geom. Appl. 8(3): 343-364 (1998) - [j16]Esther M. Arkin, Refael Hassin:
On Local Search for Weighted k-Set Packing. Math. Oper. Res. 23(3): 640-648 (1998) - [c18]Esther M. Arkin, Joseph S. B. Mitchell, Giri Narasimhan
Resource-Constrained Geometric Network Optimization. SCG 1998: 307-316 - 1997
- [j15]Esther M. Arkin, Patrice Belleville, Joseph S. B. Mitchell, David M. Mount, Kathleen Romanik, Steven Salzberg
Testing Simple Polygons. Comput. Geom. 8: 97-114 (1997) - [j14]Esther M. Arkin, Joseph S. B. Mitchell, Steven Skiena:
Guest Editors' Foreword. Int. J. Comput. Geom. Appl. 7(1/2): 1-4 (1997) - [j13]Esther M. Arkin, Refael Hassin, Limor Klein:
Restricted delivery problems on a network. Networks 29(4): 205-216 (1997) - [c17]George N. Sazaklis, Esther M. Arkin, Joseph S. B. Mitchell, Steven Skiena:
Geometric Decision Trees for Optical Character Recognition (Extended Abstract). SCG 1997: 394-396 - [c16]Esther M. Arkin, Refael Hassin:
On Local Search for Weighted k-Set Packing. ESA 1997: 13-22 - [c15]Esther M. Arkin, Yi-Jen Chiang, Joseph S. B. Mitchell, Steven Skiena, Tae-Cheon Yang:
On the Maximum Scatter TSP (Extended Abstract). SODA 1997: 211-220 - 1996
- [j12]Esther M. Arkin, Martin Held, Joseph S. B. Mitchell, Steven Skiena
Hamiltonian triangulations for fast rendering. Vis. Comput. 12(9): 429-444 (1996) - [c14]Esther M. Arkin, Yi-Jen Chiang, Martin Held, Joseph S. B. Mitchell, Vera Sacristán, Steven Skiena
On Minimum-Area Hulls (Extended Abstract). ESA 1996: 334-348 - [c13]Esther M. Arkin, Martin Held, Christopher L. Smith:
Optimization Problems Related to Zigzag Pocket Machining (Extended Abstract). SODA 1996: 419-428 - 1995
- [j11]Esther M. Arkin, Dan Halperin, Klara Kedem, Joseph S. B. Mitchell, Nir Naor:
Arrangements of Segments that Share Endpoints Single Face Results. Discret. Comput. Geom. 13: 257-270 (1995) - [j10]Esther M. Arkin, Joseph S. B. Mitchell, Subhash Suri:
Logarithmic-time link path queries in a simple polygon. Int. J. Comput. Geom. Appl. 5(4): 369-395 (1995) - 1994
- [j9]Esther M. Arkin, Refael Hassin:
Approximation Algorithms for the Geometric Covering Salesman Problem. Discret. Appl. Math. 55(3): 197-218 (1994) - [c12]Esther M. Arkin, Martin Held, Joseph S. B. Mitchell, Steven Skiena:
Hamilton Triangulations for Fast Rendering. ESA 1994: 36-47 - 1993
- [j8]Esther M. Arkin, Samir Khuller, Joseph S. B. Mitchell:
Geometric Knapsack Problems. Algorithmica 10(5): 399-427 (1993) - [j7]Esther M. Arkin, Magnús M. Halldórsson
Approximating the Tree and Tour Covers of a Graph. Inf. Process. Lett. 47(6): 275-282 (1993) - [c11]Esther M. Arkin, Patrice Belleville, Joseph S. B. Mitchell, David M. Mount, Kathleen Romanik, Steven Salzberg, Diane L. Souvaine:
Testing Simple Polygons. CCCG 1993: 387-392 - [c10]Esther M. Arkin, Sándor P. Fekete, Joseph S. B. Mitchell:
The Lawnmower Problem. CCCG 1993: 461-466 - [c9]Esther M. Arkin, Henk Meijer, Joseph S. B. Mitchell, David Rappaport, Steven Skiena:
Decision Trees for Geometric Models. SCG 1993: 369-378 - [c8]Esther M. Arkin, Michael T. Goodrich, Joseph S. B. Mitchell, David M. Mount, Christine D. Piatko
Point Probe Decision Trees for Geometric Concept Classes. WADS 1993: 95-106 - 1992
- [j6]Esther M. Arkin, Klara Kedem, Joseph S. B. Mitchell, Josef Sprinzak, Michael Werman:
Matching Points into Pairwise-Disjoint Noise Regions: Combinatorial Bounds and Algorithms. INFORMS J. Comput. 4(4): 375-386 (1992) - [c7]Joseph S. B. Mitchell, Christine D. Piatko
Computing a Shortest k-Link Path in a Polygon. FOCS 1992: 573-582 - [c6]Esther M. Arkin, Joseph S. B. Mitchell, Subhash Suri:
Optimal Link Path Queries in a Simple Polygon. SODA 1992: 269-279 - 1991
- [j5]Esther M. Arkin, Robin O. Roundy:
Weighted-Tardiness Scheduling on Parallel Machines with Proportional Weights. Oper. Res. 39(1): 64-81 (1991) - [j4]Esther M. Arkin, Christos H. Papadimitriou, Mihalis Yannakakis:
Modularity of Cycles and Paths in Graphs. J. ACM 38(2): 255-274 (1991) - [j3]Esther M. Arkin, L. Paul Chew, Daniel P. Huttenlocher, Klara Kedem, Joseph S. B. Mitchell:
An Efficiently Computable Metric for Comparing Polygonal Shapes. IEEE Trans. Pattern Anal. Mach. Intell. 13(3): 209-216 (1991) - [c5]Esther M. Arkin, Dan Halperin, Klara Kedem, Joseph S. B. Mitchell, Nir Naor:
Arrangements of Segments that Share Endpoints: Single Face Results. SCG 1991: 324-333 - [c4]Esther M. Arkin, Klara Kedem, Joseph S. B. Mitchell, Josef Sprinzak, Michael Werman:
Matching Points into Noise Regions: Combinatorial Bounds and Algorithms. SODA 1991: 42-51 - [c3]Esther M. Arkin, Samir Khuller, Joseph S. B. Mitchell:
Geometric Knapsack Problems. WADS 1991: 165-176 - 1990
- [c2]Esther M. Arkin, L. Paul Chew, Daniel P. Huttenlocher, Klara Kedem, Joseph S. B. Mitchell:
An Efficiently Computable Metric for Comparing Polygonal Shapes. SODA 1990: 129-137
1980 – 1989
- 1989
- [c1]Esther M. Arkin, Robert Connelly, Joseph S. B. Mitchell:
On Monotone Paths Among Obstacles with Applications to Planning Assemblies. SCG 1989: 334-343 - 1987
- [j2]Esther M. Arkin, Ellen B. Silverberg:
Scheduling jobs with fixed start and end times. Discret. Appl. Math. 18(1): 1-8 (1987) - 1986
- [j1]Esther M. Arkin, Christos H. Papadimitriou:
On the Complexity of Circulations. J. Algorithms 7(1): 134-145 (1986)
Coauthor Index
[c61] [c60] [c59] [c58] [i16] [i15] [j57] [c56] [i14] [j56] [j55] [c54] [c53] [i12] [j54] [c52] [j53] [j52] [c51] [c50] [c49] [c48] [c47] [c46] [j51] [j50] [j49] [c45] [j47] [c44] [c43] [j46] [c42] [c41] [i11] [j45] [c39] [j44] [j43] [j42] [j40] [c38] [c37] [j39] [c36] [j38] [j37] [c35] [c34] [c33] [c32] [i10] [i9] [j35] [j33] [j32] [c31] [i8] [j31] [j30] [j29] [c30] [i7] [c28] [c27] [c26] [c24] [i6] [i5] [i4] [i3] [c23] [c22] [c21] [j23] [i2] [i1] [j21] [c19] [j20] [j19] [j17] [c18] [j15] [j14] [c17] [c15] [j12] [c14] [j11] [j10] [c12] [j8] [c11] [c10] [c9] [c8] [j6] [c7] [c6] [j3] [c5] [c4] [c3] [c2] [c1]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-21 20:31 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: