Publications
Search

Publications :: Search

Show venue

On this page you see the details of the selected venue.

    Conference
    Name: Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016, Arlington, VA, USA, January 10-12, 2016 2016
    URL: https://doi.org/10.1137/1.9781611974331
    DBLP: db/conf/soda/soda2016.html
    Bookmark:

    Below you find the publications assigned to this venue.

    Show item 1 to 10 of 147  
    Select a publication
    Show Title Venue Rating Date
    Conference paper
    Yossi Azar, Amir Epstein, Lukasz Jez, Adi Vardi.
    Make-to-Order Integrated Scheduling and Distribution.
    Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016, Arlington, VA, USA, January 10-12, 2016 2016 (0) 2016
    Conference paper
    Michael A. Bender, Jeremy T. Fineman, Seth Gilbert, Maxwell Young.
    How to Scale Exponential Backoff: Constant Throughput, Polylog Access Attempts, and Robustness.
    Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016, Arlington, VA, USA, January 10-12, 2016 2016 (0) 2016
    Conference paper
    Sina Dehghani, Soheil Ehsani, Mohammad Taghi Hajiaghayi, Vahid Liaghat.
    Online Degree-Bounded Steiner Network Design.
    Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016, Arlington, VA, USA, January 10-12, 2016 2016 (0) 2016
    Conference paper
    David Eppstein.
    Treetopes and their Graphs.
    Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016, Arlington, VA, USA, January 10-12, 2016 2016 (0) 2016
    Conference paper
    Klaus Jansen, Marten Maack, Malin Rau.
    Approximation schemes for machine scheduling with resource (in-)dependent processing times.
    Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016, Arlington, VA, USA, January 10-12, 2016 2016 (0) 2016
    Conference paper
    Sunil Arya, David M. Mount.
    A Fast and Simple Algorithm for Computing Approximate Euclidean Minimum Spanning Trees.
    Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016, Arlington, VA, USA, January 10-12, 2016 2016 (0) 2016
    Conference paper
    Xue Chen.
    Integrality Gaps and Approximation Algorithms for Dispersers and Bipartite Expanders.
    Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016, Arlington, VA, USA, January 10-12, 2016 2016 (0) 2016
    Conference paper
    Surender Baswana, Shreejit Ray Chaudhury, Keerti Choudhary, Shahbaz Khan 0004.
    Dynamic DFS in Undirected Graphs: breaking the O(
    Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016, Arlington, VA, USA, January 10-12, 2016 2016 (0) 2016
    Conference paper
    Amir Abboud, Virginia Vassilevska Williams, Joshua R. Wang.
    Approximation and Fixed Parameter Subquadratic Algorithms for Radius and Diameter in Sparse Graphs.
    Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016, Arlington, VA, USA, January 10-12, 2016 2016 (0) 2016
    Conference paper
    Avrim Blum, Sariel Har-Peled, Benjamin Raichel.
    Sparse Approximation via Generating Point Sets.
    Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016, Arlington, VA, USA, January 10-12, 2016 2016 (0) 2016
    Show item 1 to 10 of 147  

    Your query returned 147 matches in the database.