arXiv 2005-02-10 EN Improved Tag Set Design and Multiplexing Algorithms for Universal Arrays Mandoiu, Ion I. · Prajescu, Claudia · Trinca, Dragos
arXiv 2005-01-20 EN Improved Approximation Algorithms for Geometric Set Cover Clarkson, Kenneth L. · Varadarajan, Kasturi
arXiv 2004-12-21 EN Partitioning Regular Polygons into Circular Pieces II:Nonconvex Partitions Damian, Mirela · O'Rourke, Joseph
arXiv 2004-10-20 EN A 2-chain can interlock with a k-chain Glass, Julie · Langerman, Stefan · O'Rourke, Joseph · Snoeyink, Jack +1
arXiv 2004-06-23 EN Online Searching with Turn Cost Demaine, Erik D. · Fekete, Sandor P. · Gal, Shmuel
arXiv 2004-05-25 EN The Complexity of Maximum Matroid-Greedoid Intersection and Weighted Greedoid Maximization Mielikäinen, Taneli · Ukkonen, Esko
arXiv 2004-02-18 EN A General Framework for Bounds for Higher-Dimensional Orthogonal Packing Problems Fekete, Sandor P. · Schepers, Joerg
arXiv 2004-02-18 EN The Freeze-Tag Problem: How to Wake Up a Swarm of Robots Arkin, Esther M. · Bender, Michael A. · Fekete, Sandor P. · Mitchell, Joseph S. B. +1
arXiv 2003-10-17 EN Maximum dispersion and geometric maximum weight cliques Fekete, Sandor P. · Meijer, Henk
arXiv 2003-10-16 EN A combinatorial characterization of higher-dimensional orthogonal packing Fekete, Sandor P. · Schepers, Joerg
arXiv 2003-10-15 EN On the continuous Fermat-Weber problem Fekete, Sandor P. · Mitchell, Joseph S. B. · Beurer, Karin
arXiv 2003-09-09 EN Optimal Covering Tours with Turn Costs Arkin, Esther M. · Bender, Michael A. · Demaine, Erik D. · Fekete, Sandor P. +2
arXiv 2003-08-04 EN Higher-Dimensional Packing with Order Constraints Fekete, Sandor P. · Koehler, Ekkehard · Teich, Juergen
