Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms
Latest Publications

TOTAL DOCUMENTS

182

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Society For Industrial And Applied Mathematics

9781611975994

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Efficiently list-edge coloring multigraphs asymptotically optimally

Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms ◽

10.1137/1.9781611975994.142 ◽

2020 ◽

pp. 2319-2336 ◽

Cited By ~ 1

Author(s):

Fotis Iliopoulos ◽

Alistair Sinclair

Keyword(s):

Edge Coloring ◽

List Edge Coloring

Download Full-text

Dynamic Low-Stretch Spanning Trees in Subpolynomial Time

Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms ◽

10.1137/1.9781611975994.28 ◽

2020 ◽

pp. 463-475

Author(s):

Shiri Chechik ◽

Tianyi Zhang

Keyword(s):

Spanning Trees

Download Full-text

Tightening Curves on Surfaces Monotonically with Applications

Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms ◽

10.1137/1.9781611975994.46 ◽

2020 ◽

pp. 747-766

Author(s):

Hsien-Chih Chang ◽

Arnaud de Mesmay

Keyword(s):

Curves On Surfaces

Download Full-text

A Tight Analysis of Greedy Yields Subexponential Time Approximation for Uniform Decision Tree

Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms ◽

10.1137/1.9781611975994.7 ◽

2020 ◽

pp. 102-121

Author(s):

Ray Li ◽

Percy Liang ◽

Stephen Mussmann

Keyword(s):

Decision Tree ◽

Time Approximation ◽

Subexponential Time

Download Full-text

Approximate Maximum Matching in Random Streams

Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms ◽

10.1137/1.9781611975994.108 ◽

2020 ◽

pp. 1773-1785

Author(s):

Alireza Farhadi ◽

Mohammad Taghi Hajiaghayi ◽

Tung Mah ◽

Anup Rao ◽

Ryan A. Rossi

Keyword(s):

Maximum Matching

Download Full-text

Computing Circle Packing Representations of Planar Graphs

Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms ◽

10.1137/1.9781611975994.174 ◽

2020 ◽

pp. 2860-2875

Author(s):

Sally Dong ◽

Yin Tat Lee ◽

Kent Quanrud

Keyword(s):

Planar Graphs ◽

Circle Packing

Download Full-text

Near-optimal Approximate Discrete and Continuous Submodular Function Minimization

Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms ◽

10.1137/1.9781611975994.51 ◽

2020 ◽

pp. 837-853

Author(s):

Brian Axelrod ◽

Yang P. Liu ◽

Aaron Sidford

Keyword(s):

Submodular Function ◽

Function Minimization ◽

Submodular Function Minimization

Download Full-text

Space Efficient Approximation to Maximum Matching Size from Uniform Edge Samples

Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms ◽

10.1137/1.9781611975994.107 ◽

2020 ◽

pp. 1753-1772

Author(s):

Michael Kapralov ◽

Slobodan Mitrović ◽

Ashkan Norouzi-Fard ◽

Jakab Tardos

Keyword(s):

Maximum Matching ◽

Efficient Approximation

Download Full-text

Weighted Completion Time Minimization for Unrelated Machines via Iterative Fair Contention Resolution

Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms ◽

10.1137/1.9781611975994.170 ◽

2020 ◽

pp. 2790-2809

Author(s):

Sungjin Im ◽

Maryam Shadloo

Keyword(s):

Completion Time ◽

Contention Resolution ◽

Unrelated Machines ◽

Time Minimization ◽

Weighted Completion Time

Download Full-text

Competitive Analysis with a Sample and the Secretary Problem

Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms ◽

10.1137/1.9781611975994.128 ◽

2020 ◽

pp. 2082-2095 ◽

Cited By ~ 1

Author(s):

Haim Kaplan ◽

David Naori ◽

Danny Raz

Keyword(s):

Competitive Analysis ◽

Secretary Problem

Download Full-text

Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete AlgorithmsLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Society For Industrial And Applied Mathematics

Efficiently list-edge coloring multigraphs asymptotically optimally

Dynamic Low-Stretch Spanning Trees in Subpolynomial Time

Tightening Curves on Surfaces Monotonically with Applications

A Tight Analysis of Greedy Yields Subexponential Time Approximation for Uniform Decision Tree

Approximate Maximum Matching in Random Streams

Computing Circle Packing Representations of Planar Graphs

Near-optimal Approximate Discrete and Continuous Submodular Function Minimization

Space Efficient Approximation to Maximum Matching Size from Uniform Edge Samples

Weighted Completion Time Minimization for Unrelated Machines via Iterative Fair Contention Resolution

Competitive Analysis with a Sample and the Secretary Problem

Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms
Latest Publications