:facetid:toc:\"db/conf/soda/soda2019.bht\"OK:facetid:toc:db/conf/soda/soda2019.bhtHeng Guo 0001Chao LiaoPinyan LuChihao Zhang 0001Zeros of Holant problems: locations and algorithms.SODA2262-22782019Conference and Workshop Papersopenconf/soda/0001LLZ1910.1137/1.9781611975482.137https://doi.org/10.1137/1.9781611975482.137https://dblp.org/rec/conf/soda/0001LLZ19URL#2275436Fabrizio Grandoni 0001Stefano Leonardi 0001Piotr SankowskiChris SchwiegelshohnShay Solomon(1 + ε)-Approximate Incremental Matching in Constant Deterministic Amortized Time.SODA1886-18982019Conference and Workshop Papersopenconf/soda/0001LSSS1910.1137/1.9781611975482.114https://doi.org/10.1137/1.9781611975482.114https://dblp.org/rec/conf/soda/0001LSSS19URL#2275437Shuchi Chawla 0001J. Benjamin MillerYifeng TengPricing for Online Resource Allocation: Intervals and Paths.SODA1962-19812019Conference and Workshop Papersopenconf/soda/0001MT1910.1137/1.9781611975482.119https://doi.org/10.1137/1.9781611975482.119https://dblp.org/rec/conf/soda/0001MT19URL#2275438Mrinal Kumar 0001Ramprasad SaptharishiAnamay TengseNear-optimal Bootstrapping of Hitting Sets for Algebraic Circuits.SODA639-6462019Conference and Workshop Papersopenconf/soda/0001ST1910.1137/1.9781611975482.40https://doi.org/10.1137/1.9781611975482.40https://dblp.org/rec/conf/soda/0001ST19URL#2275439Yu Cheng 0002Ilias DiakonikolasRong Ge 0001High-Dimensional Robust Mean Estimation in Nearly-Linear Time.SODA2755-27712019Conference and Workshop Papersopenconf/soda/0002D01910.1137/1.9781611975482.171https://doi.org/10.1137/1.9781611975482.171https://dblp.org/rec/conf/soda/0002D019URL#2275440Jie Han 0002Yoshiharu KohayakawaMarcelo Tadeu SalesHenrique StagniExtremal and probabilistic results for order types.SODA426-4352019Conference and Workshop Papersopenconf/soda/0002KSS1910.1137/1.9781611975482.27https://doi.org/10.1137/1.9781611975482.27https://dblp.org/rec/conf/soda/0002KSS19URL#2275441Zhiyi Huang 0002Binghui PengZhihao Gavin TangRunzhou TaoXiaowei Wu 0001Yuhao Zhang 0001Tight Competitive Ratios of Classic Matching Algorithms in the Fully Online Model.SODA2875-28862019Conference and Workshop Papersopenconf/soda/0002PTTWZ1910.1137/1.9781611975482.178https://doi.org/10.1137/1.9781611975482.178https://dblp.org/rec/conf/soda/0002PTTWZ19URL#2275442Anders AamandMikkel ThorupNon-empty Bins with Simple Tabulation Hashing.SODA2498-25122019Conference and Workshop Papersopenconf/soda/AamandT1910.1137/1.9781611975482.153https://doi.org/10.1137/1.9781611975482.153https://dblp.org/rec/conf/soda/AamandT19URL#2275443Amir AbboudKarl BringmannDanny HermelinDvir ShabtaySETH-Based Lower Bounds for Subset Sum and Bicriteria Path.SODA41-572019Conference and Workshop Papersopenconf/soda/AbboudBHS1910.1137/1.9781611975482.3https://doi.org/10.1137/1.9781611975482.3https://dblp.org/rec/conf/soda/AbboudBHS19URL#2275444Ahmed AbdelkaderSunil AryaGuilherme Dias da FonsecaDavid M. MountApproximate Nearest Neighbor Searching with Non-Euclidean and Weighted Distances.SODA355-3722019Conference and Workshop Papersopenconf/soda/AbdelkaderAFM1910.1137/1.9781611975482.23https://doi.org/10.1137/1.9781611975482.23https://dblp.org/rec/conf/soda/AbdelkaderAFM19URL#2275445Deeksha AdilRasmus KyngRichard PengSushant SachdevaIterative Refinement for ℓp-norm Regression.SODA1405-14242019Conference and Workshop Papersopenconf/soda/AdilKPS1910.1137/1.9781611975482.86https://doi.org/10.1137/1.9781611975482.86https://dblp.org/rec/conf/soda/AdilKPS19URL#2275446Karim A. AdiprasitoImre BárányNabil H. MustafaTheorems of Carathéodory, Helly, and Tverberg without dimension.SODA2350-23602019Conference and Workshop Papersopenconf/soda/AdiprasitoBM1910.1137/1.9781611975482.143https://doi.org/10.1137/1.9781611975482.143https://dblp.org/rec/conf/soda/AdiprasitoBM19URL#2275447Arpit AgarwalSepehr AssadiSanjeev KhannaStochastic Submodular Cover with Limited Adaptivity.SODA323-3422019Conference and Workshop Papersopenconf/soda/AgarwalAK1910.1137/1.9781611975482.21https://doi.org/10.1137/1.9781611975482.21https://dblp.org/rec/conf/soda/AgarwalAK19URL#2275448Akanksha Agrawal 0001Pranabendu MisraSaket Saurabh 0001Meirav ZehaviInterval Vertex Deletion Admits a Polynomial Kernel.SODA1711-17302019Conference and Workshop Papersopenconf/soda/AgrawalM0Z1910.1137/1.9781611975482.103https://doi.org/10.1137/1.9781611975482.103https://dblp.org/rec/conf/soda/AgrawalM0Z19URL#2275449AmirMahdi AhmadinejadArun JambulapatiAmin SaberiAaron SidfordPerron-Frobenius Theory in Nearly Linear Time: Positive Eigenvectors, M-matrices, Graph Kernels, and Other Applications.SODA1387-14042019Conference and Workshop Papersopenconf/soda/AhmadinejadJSS1910.1137/1.9781611975482.85https://doi.org/10.1137/1.9781611975482.85https://dblp.org/rec/conf/soda/AhmadinejadJSS19URL#2275450Georgios AmanatidisPieter KleerRapid Mixing of the Switch Markov Chain for Strongly Stable Degree Sequences and 2-Class Joint Degree Matrices.SODA966-9852019Conference and Workshop Papersopenconf/soda/AmanatidisK1910.1137/1.9781611975482.60https://doi.org/10.1137/1.9781611975482.60https://dblp.org/rec/conf/soda/AmanatidisK19URL#2275452Andris AmbainisKaspars BalodisJanis IraidsMartins KokainisKrisjanis PrusisJevgenijs VihrovsQuantum Speedups for Exponential-Time Dynamic Programming Algorithms.SODA1783-17932019Conference and Workshop Papersopenconf/soda/AmbainisBIKPV1910.1137/1.9781611975482.107https://doi.org/10.1137/1.9781611975482.107https://dblp.org/rec/conf/soda/AmbainisBIKPV19URL#2275453Antonios Antoniadis 0001Krzysztof Fleszar 0001Ruben HoeksmaKevin SchewiorA PTAS for Euclidean TSP with Hyperplane Neighborhoods.SODA1089-11052019Conference and Workshop Papersopenconf/soda/Antoniadis0HS1910.1137/1.9781611975482.67https://doi.org/10.1137/1.9781611975482.67https://dblp.org/rec/conf/soda/Antoniadis0HS19URL#2275454C. J. ArgueSébastien BubeckMichael B. CohenAnupam Gupta 0001Yin Tat LeeA Nearly-Linear Bound for Chasing Nested Convex Bodies.SODA117-1222019Conference and Workshop Papersopenconf/soda/ArgueBCGL1910.1137/1.9781611975482.8https://doi.org/10.1137/1.9781611975482.8https://dblp.org/rec/conf/soda/ArgueBCGL19URL#2275455Boris AronovEsther EzraJoshua ZahlConstructive Polynomial Partitioning for Algebraic Curves in R3 with Applications.SODA2636-26482019Conference and Workshop Papersopenconf/soda/AronovEZ1910.1137/1.9781611975482.163https://doi.org/10.1137/1.9781611975482.163https://dblp.org/rec/conf/soda/AronovEZ19URL#2275456Eshwar Ram ArunachaleswaranSiddharth BarmanNidhi RathiFully Polynomial-Time Approximation Schemes for Fair Rent Division.SODA1994-20132019Conference and Workshop Papersopenconf/soda/Arunachaleswaran1910.1137/1.9781611975482.121https://doi.org/10.1137/1.9781611975482.121https://dblp.org/rec/conf/soda/Arunachaleswaran19URL#2275457Itai AshlagiAmin SaberiAli ShameliAssignment Mechanisms under Distributional Constraints.SODA229-2402019Conference and Workshop Papersopenconf/soda/AshlagiSS1910.1137/1.9781611975482.15https://doi.org/10.1137/1.9781611975482.15https://dblp.org/rec/conf/soda/AshlagiSS19URL#2275458Sepehr AssadiMohammadHossein BateniAaron BernsteinVahab S. MirrokniCliff Stein 0001Coresets Meet EDCS: Algorithms for Matching and Vertex Cover on Massive Graphs.SODA1616-16352019Conference and Workshop Papersopenconf/soda/AssadiBBMS1910.1137/1.9781611975482.98https://doi.org/10.1137/1.9781611975482.98https://dblp.org/rec/conf/soda/AssadiBBMS19URL#2275460Sepehr AssadiYu Chen 0039Sanjeev KhannaSublinear Algorithms for (Δ + 1) Vertex Coloring.SODA767-7862019Conference and Workshop Papersopenconf/soda/AssadiCK1910.1137/1.9781611975482.48https://doi.org/10.1137/1.9781611975482.48https://dblp.org/rec/conf/soda/AssadiCK19URL#2275461Sepehr AssadiKrzysztof OnakBaruch SchieberShay SolomonFully Dynamic Maximal Independent Set with Sublinear in n Update Time.SODA1919-19362019Conference and Workshop Papersopenconf/soda/AssadiOSS1910.1137/1.9781611975482.116https://doi.org/10.1137/1.9781611975482.116https://dblp.org/rec/conf/soda/AssadiOSS19URL#2275462Kyriakos AxiotisArturs BackursCe Jin 0001Christos TzamosHongxun WuFast Modular Subset Sum using Linear Sketching.SODA58-692019Conference and Workshop Papersopenconf/soda/AxiotisBJTW1910.1137/1.9781611975482.4https://doi.org/10.1137/1.9781611975482.4https://dblp.org/rec/conf/soda/AxiotisBJTW19URL#2275463Jose Balanza-MartinezAustin LuchsingerDavid CaballeroRene ReyesAngel A. CantuRobert T. SchwellerLuis Angel GarciaTim WylieFull Tilt: Universal Constructors for General Shapes with Uniform External Forces.SODA2689-27082019Conference and Workshop Papersopenconf/soda/Balanza-Martinez1910.1137/1.9781611975482.167https://doi.org/10.1137/1.9781611975482.167https://dblp.org/rec/conf/soda/Balanza-Martinez19URL#2275464Maria-Florina BalcanYi Li 0002David P. WoodruffHongyang Zhang 0001Testing Matrix Rank, Optimally.SODA727-7462019Conference and Workshop Papersopenconf/soda/BalcanLW01910.1137/1.9781611975482.46https://doi.org/10.1137/1.9781611975482.46https://dblp.org/rec/conf/soda/BalcanLW019URL#2275465Eric BalkanskiAviad RubinsteinYaron SingerAn Exponential Speedup in Parallel Running Time for Submodular Maximization without Loss in Approximation.SODA283-3022019Conference and Workshop Papersopenconf/soda/BalkanskiRS1910.1137/1.9781611975482.19https://doi.org/10.1137/1.9781611975482.19https://dblp.org/rec/conf/soda/BalkanskiRS19URL#2275466Santiago R. BalseiroVahab S. MirrokniRenato Paes LemeSong ZuoDynamic Double Auctions: Towards First Best.SODA157-1722019Conference and Workshop Papersopenconf/soda/BalseiroMLZ1910.1137/1.9781611975482.11https://doi.org/10.1137/1.9781611975482.11https://dblp.org/rec/conf/soda/BalseiroMLZ19URL#2275467Frank BanVijay BhattiproluKarl BringmannPavel KolevEuiwoong LeeDavid P. WoodruffA PTAS for ℓp-Low Rank Approximation.SODA747-7662019Conference and Workshop Papersopenconf/soda/BanBBKLW1910.1137/1.9781611975482.47https://doi.org/10.1137/1.9781611975482.47https://dblp.org/rec/conf/soda/BanBBKLW19URL#2275468Nikhil Bansal 0001Raghu MekaOn the discrepancy of random low degree set systems.SODA2557-25642019Conference and Workshop Papersopenconf/soda/BansalM1910.1137/1.9781611975482.157https://doi.org/10.1137/1.9781611975482.157https://dblp.org/rec/conf/soda/BansalM19URL#2275469Wouter Cames van BatenburgTony HuynhGwenaël JoretJean-Florent RaymondA tight Erdős-Pósa function for planar minors.SODA1485-15002019Conference and Workshop Papersopenconf/soda/BatenburgHJR1910.1137/1.9781611975482.90https://doi.org/10.1137/1.9781611975482.90https://dblp.org/rec/conf/soda/BatenburgHJR19URL#2275471MohammadHossein BateniAlireza Farhadi 0001MohammadTaghi HajiaghayiPolynomial-time Approximation Scheme for Minimum k-cut in Planar and Minor-free Graphs.SODA1055-10682019Conference and Workshop Papersopenconf/soda/BateniFH1910.1137/1.9781611975482.65https://doi.org/10.1137/1.9781611975482.65https://dblp.org/rec/conf/soda/BateniFH19URL#2275472Ulrich BauerAbhishek RathodHardness of Approximation for Morse Matching.SODA2663-26742019Conference and Workshop Papersopenconf/soda/BauerR1910.1137/1.9781611975482.165https://doi.org/10.1137/1.9781611975482.165https://dblp.org/rec/conf/soda/BauerR19URL#2275473Soheil BehnezhadAlireza Farhadi 0001MohammadTaghi HajiaghayiNima ReyhaniStochastic Matching with Few Queries: New Algorithms and Tools.SODA2855-28742019Conference and Workshop Papersopenconf/soda/BehnezhadFHR1910.1137/1.9781611975482.177https://doi.org/10.1137/1.9781611975482.177https://dblp.org/rec/conf/soda/BehnezhadFHR19URL#2275474Xiaohui BeiNick GravinPinyan LuZhihao Gavin TangCorrelation-Robust Analysis of Single Item Auction.SODA193-2082019Conference and Workshop Papersopenconf/soda/BeiGLT1910.1137/1.9781611975482.13https://doi.org/10.1137/1.9781611975482.13https://dblp.org/rec/conf/soda/BeiGLT19URL#2275475Michael A. BenderJake ChristensenAlex ConwayMartin Farach-ColtonRob JohnsonMeng-Tsung TsaiOptimal Ball Recycling.SODA2527-25462019Conference and Workshop Papersopenconf/soda/BenderCCFJT1910.1137/1.9781611975482.155https://doi.org/10.1137/1.9781611975482.155https://dblp.org/rec/conf/soda/BenderCCFJT19URL#2275476André BergerLászló Kozma 0002Matthias MnichRoland VinczeA time- and space-optimal algorithm for the many-visits TSP.SODA1770-17822019Conference and Workshop Papersopenconf/soda/Berger0MV1910.1137/1.9781611975482.106https://doi.org/10.1137/1.9781611975482.106https://dblp.org/rec/conf/soda/Berger0MV19URL#2275477Aaron BernsteinSebastian ForsterMonika HenzingerA Deamortization Approach for Dynamic Spanner and Dynamic Maximal Matching.SODA1899-19182019Conference and Workshop Papersopenconf/soda/BernsteinFH1910.1137/1.9781611975482.115https://doi.org/10.1137/1.9781611975482.115https://dblp.org/rec/conf/soda/BernsteinFH19URL#2275478Vishwas BhargavaMarkus BläserGorav JindalAnurag Pandey 0001A Deterministic PTAS for the Algebraic Rank of Bounded Degree Polynomials.SODA647-6612019Conference and Workshop Papersopenconf/soda/BhargavaBJP1910.1137/1.9781611975482.41https://doi.org/10.1137/1.9781611975482.41https://dblp.org/rec/conf/soda/BhargavaBJP19URL#2275479Sayan BhattacharyaJanardhan KulkarniDeterministically Maintaining a (2 + ∊)-Approximate Minimum Vertex Cover in O(1/∊2) Amortized Update Time.SODA1872-18852019Conference and Workshop Papersopenconf/soda/BhattacharyaK1910.1137/1.9781611975482.113https://doi.org/10.1137/1.9781611975482.113https://dblp.org/rec/conf/soda/BhattacharyaK19URL#2275480Vijay BhattiproluMrinalkanti GhoshVenkatesan GuruswamiEuiwoong LeeMadhur TulsianiApproximability of p → q Matrix Norms: Generalized Krivine Rounding and Hypercontractive Hardness.SODA1358-13682019Conference and Workshop Papersopenconf/soda/BhattiproluGGLT1910.1137/1.9781611975482.83https://doi.org/10.1137/1.9781611975482.83https://dblp.org/rec/conf/soda/BhattiproluGGLT19URL#2275481Ali BibakCharles Carlson 0002Karthekeyan ChandrasekaranImproving the smoothed complexity of FLIP for max cut problems.SODA897-9162019Conference and Workshop Papersopenconf/soda/BibakCC1910.1137/1.9781611975482.55https://doi.org/10.1137/1.9781611975482.55https://dblp.org/rec/conf/soda/BibakCC19URL#2275482Gianfranco BilardiLorenzo De StefaniThe I/O complexity of Toom-Cook integer multiplication.SODA2034-20522019Conference and Workshop Papersopenconf/soda/BilardiS1910.1137/1.9781611975482.123https://doi.org/10.1137/1.9781611975482.123https://dblp.org/rec/conf/soda/BilardiS19URL#2275483Jaroslaw BlasiokMark BunAleksandar NikolovThomas Steinke 0002Towards Instance-Optimal Private Query Release.SODA2480-24972019Conference and Workshop Papersopenconf/soda/BlasiokBNS1910.1137/1.9781611975482.152https://doi.org/10.1137/1.9781611975482.152https://dblp.org/rec/conf/soda/BlasiokBNS19URL#2275484Greg BodwinOn the Structure of Unique Shortest Paths in Graphs.SODA2071-20892019Conference and Workshop Papersopenconf/soda/Bodwin1910.1137/1.9781611975482.125https://doi.org/10.1137/1.9781611975482.125https://dblp.org/rec/conf/soda/Bodwin19URL#2275485Andrej BogdanovManuel SabinPrashant Nalini VasudevanXOR Codes and Sparse Learning Parity with Noise.SODA986-10042019Conference and Workshop Papersopenconf/soda/BogdanovSV1910.1137/1.9781611975482.61https://doi.org/10.1137/1.9781611975482.61https://dblp.org/rec/conf/soda/BogdanovSV19URL#2275486Glencora BorradaileHung LeChristian Wulff-NilsenGreedy spanners are optimal in doubling metrics.SODA2371-23792019Conference and Workshop Papersopenconf/soda/BorradaileLW1910.1137/1.9781611975482.145https://doi.org/10.1137/1.9781611975482.145https://dblp.org/rec/conf/soda/BorradaileLW19URL#2275487Prosenjit BoseJean-Lou De CarufelDarryl HillMichiel H. M. SmidOn the Spanning and Routing Ratio of Theta-Four.SODA2361-23702019Conference and Workshop Papersopenconf/soda/BoseCHS1910.1137/1.9781611975482.144https://doi.org/10.1137/1.9781611975482.144https://dblp.org/rec/conf/soda/BoseCHS19URL#2275488Joshua BrakensiekVenkatesan GuruswamiAn Algorithmic Blend of LPs and Ring Equations for Promise CSPs.SODA436-4552019Conference and Workshop Papersopenconf/soda/BrakensiekG1910.1137/1.9781611975482.28https://doi.org/10.1137/1.9781611975482.28https://dblp.org/rec/conf/soda/BrakensiekG19URL#2275489Karl BringmannMarvin KünnemannAndré NusserFréchet Distance Under Translation: Conditional Hardness and an Algorithm via Offline Dynamic Grid Reachability.SODA2902-29212019Conference and Workshop Papersopenconf/soda/BringmannKN1910.1137/1.9781611975482.180https://doi.org/10.1137/1.9781611975482.180https://dblp.org/rec/conf/soda/BringmannKN19URL#2275490Karl BringmannPhilip WellnitzMarvin KünnemannFew Matches or Almost Periodicity: Faster Pattern Matching with Mismatches in Compressed Texts.SODA1126-11452019Conference and Workshop Papersopenconf/soda/BringmannWK1910.1137/1.9781611975482.69https://doi.org/10.1137/1.9781611975482.69https://dblp.org/rec/conf/soda/BringmannWK19URL#2275491Sébastien BubeckMichael B. CohenJames R. LeeYin Tat LeeMetrical task systems on trees via mirror descent and unfair gluing.SODA89-972019Conference and Workshop Papersopenconf/soda/BubeckCLL1910.1137/1.9781611975482.6https://doi.org/10.1137/1.9781611975482.6https://dblp.org/rec/conf/soda/BubeckCLL19URL#2275492Niv BuchbinderMoran FeldmanMohit Garg 0003Deterministic (½ + ε)-Approximation for Submodular Maximization over a Matroid.SODA241-2542019Conference and Workshop Papersopenconf/soda/BuchbinderF01910.1137/1.9781611975482.16https://doi.org/10.1137/1.9781611975482.16https://dblp.org/rec/conf/soda/BuchbinderF019URL#2275493Niv BuchbinderAnupam Gupta 0001Marco Molinaro 0001Joseph (Seffi) Naork-Servers with a Smile: Online Algorithms via Projections.SODA98-1162019Conference and Workshop Papersopenconf/soda/BuchbinderGMN1910.1137/1.9781611975482.7https://doi.org/10.1137/1.9781611975482.7https://dblp.org/rec/conf/soda/BuchbinderGMN19URL#2275494Kevin BuchinAnne DriemelJoachim GudmundssonMichael HortonIrina KostitsynaMaarten LöfflerMartijn StruijsApproximating (k, ℓ)-center clustering for curves.SODA2922-29382019Conference and Workshop Papersopenconf/soda/BuchinDGHKLS1910.1137/1.9781611975482.181https://doi.org/10.1137/1.9781611975482.181https://dblp.org/rec/conf/soda/BuchinDGHKLS19URL#2275495Kevin BuchinTim OpheldersBettina SpeckmannSETH Says: Weak Fréchet Distance is Faster, but only if it is Continuous and in One Dimension.SODA2887-29012019Conference and Workshop Papersopenconf/soda/BuchinOS1910.1137/1.9781611975482.179https://doi.org/10.1137/1.9781611975482.179https://dblp.org/rec/conf/soda/BuchinOS19URL#2275496Mark BunRobin KothariJustin ThalerQuantum algorithms and approximating polynomials for composed functions with shared inputs.SODA662-6782019Conference and Workshop Papersopenconf/soda/BunKT1910.1137/1.9781611975482.42https://doi.org/10.1137/1.9781611975482.42https://dblp.org/rec/conf/soda/BunKT19URL#2275497Sam BussAlexander KnopStrategies for Stable Merge Sorting.SODA1272-12902019Conference and Workshop Papersopenconf/soda/BussK1910.1137/1.9781611975482.78https://doi.org/10.1137/1.9781611975482.78https://dblp.org/rec/conf/soda/BussK19URL#2275498Daniel BustoWilliam S. EvansDavid G. KirkpatrickMinimizing Interference Potential Among Moving Entities.SODA2400-24182019Conference and Workshop Papersopenconf/soda/BustoEK1910.1137/1.9781611975482.147https://doi.org/10.1137/1.9781611975482.147https://dblp.org/rec/conf/soda/BustoEK19URL#2275499Jin-Yi CaiArtem GovorovPerfect Matchings, Rank of Connection Tensors and Graph Homomorphisms.SODA476-4952019Conference and Workshop Papersopenconf/soda/CaiG1910.1137/1.9781611975482.30https://doi.org/10.1137/1.9781611975482.30https://dblp.org/rec/conf/soda/CaiG19URL#2275500Jin-Yi CaiTianyu Liu 0002Pinyan LuApproximability of the Six-vertex Model.SODA2248-22612019Conference and Workshop Papersopenconf/soda/CaiLL1910.1137/1.9781611975482.136https://doi.org/10.1137/1.9781611975482.136https://dblp.org/rec/conf/soda/CaiLL19URL#2275501Nairen CaoJeremy T. FinemanKatina RussellEugene YangI/O-Efficient Algorithms for Topological Sort and Related Problems.SODA2053-20702019Conference and Workshop Papersopenconf/soda/CaoFRY1910.1137/1.9781611975482.124https://doi.org/10.1137/1.9781611975482.124https://dblp.org/rec/conf/soda/CaoFRY19URL#2275502Charles Carlson 0002Alexandra KollaNikhil SrivastavaLuca TrevisanOptimal Lower Bounds for Sketching Graph Cuts.SODA2565-25692019Conference and Workshop Papersopenconf/soda/CarlsonKST1910.1137/1.9781611975482.158https://doi.org/10.1137/1.9781611975482.158https://dblp.org/rec/conf/soda/CarlsonKST19URL#2275503T.-H. Hubert ChanKai-Min ChungBruce M. MaggsElaine ShiFoundations of Differentially Oblivious Algorithms.SODA2448-24672019Conference and Workshop Papersopenconf/soda/ChanCMS1910.1137/1.9781611975482.150https://doi.org/10.1137/1.9781611975482.150https://dblp.org/rec/conf/soda/ChanCMS19URL#2275504Yi-Jun ChangSeth PettieHengjie ZhangDistributed Triangle Detection via Expander Decomposition.SODA821-8402019Conference and Workshop Papersopenconf/soda/ChangPZ1910.1137/1.9781611975482.51https://doi.org/10.1137/1.9781611975482.51https://dblp.org/rec/conf/soda/ChangPZ19URL#2275506Panagiotis CharalampopoulosShay MozesBenjamin TebekaExact Distance Oracles for Planar Graphs with Failing Vertices.SODA2110-21232019Conference and Workshop Papersopenconf/soda/Charalampopoulos1910.1137/1.9781611975482.127https://doi.org/10.1137/1.9781611975482.127https://dblp.org/rec/conf/soda/Charalampopoulos19URL#2275507Moses CharikarVaggos ChatziafratisRad NiazadehHierarchical Clustering better than Average-Linkage.SODA2291-23042019Conference and Workshop Papersopenconf/soda/CharikarCN1910.1137/1.9781611975482.139https://doi.org/10.1137/1.9781611975482.139https://dblp.org/rec/conf/soda/CharikarCN19URL#2275508Shiri ChechikSarel CohenNear Optimal Algorithms For The Single Source Replacement Paths Problem.SODA2090-21092019Conference and Workshop Papersopenconf/soda/ChechikC1910.1137/1.9781611975482.126https://doi.org/10.1137/1.9781611975482.126https://dblp.org/rec/conf/soda/ChechikC19URL#2275509Shiri ChechikDoron MukhtarOptimal Distributed Coloring Algorithms for Planar Graphs in the LOCAL model.SODA787-8042019Conference and Workshop Papersopenconf/soda/ChechikM1910.1137/1.9781611975482.49https://doi.org/10.1137/1.9781611975482.49https://dblp.org/rec/conf/soda/ChechikM19URL#2275510Yeow Meng CheeDuc Tu DaoHan Mao KiahSan LingHengjia WeiBinary Robust Positioning Patterns with Low Redundancy and Efficient Locating Algorithms.SODA2171-21842019Conference and Workshop Papersopenconf/soda/CheeDKLW1910.1137/1.9781611975482.131https://doi.org/10.1137/1.9781611975482.131https://dblp.org/rec/conf/soda/CheeDKLW19URL#2275511Chandra ChekuriKent QuanrudSubmodular Function Maximization in Parallel via the Multilinear Relaxation.SODA303-3222019Conference and Workshop Papersopenconf/soda/ChekuriQ1910.1137/1.9781611975482.20https://doi.org/10.1137/1.9781611975482.20https://dblp.org/rec/conf/soda/ChekuriQ19URL#2275513Chandra ChekuriKent QuanrudOn Approximating (Sparse) Covering Integer Programs.SODA1596-16152019Conference and Workshop Papersopenconf/soda/ChekuriQ19a10.1137/1.9781611975482.97https://doi.org/10.1137/1.9781611975482.97https://dblp.org/rec/conf/soda/ChekuriQ19aURL#2275514Xue Chen 0001Derandomized Balanced Allocation.SODA2513-25262019Conference and Workshop Papersopenconf/soda/Chen1910.1137/1.9781611975482.154https://doi.org/10.1137/1.9781611975482.154https://dblp.org/rec/conf/soda/Chen19URL#2275515Sitan ChenMichelle DelcourtAnkur MoitraGuillem PerarnauLuke PostleImproved Bounds for Randomly Sampling Colorings via Linear Programming.SODA2216-22342019Conference and Workshop Papersopenconf/soda/ChenDMPP1910.1137/1.9781611975482.134https://doi.org/10.1137/1.9781611975482.134https://dblp.org/rec/conf/soda/ChenDMPP19URL#2275516Lijie Chen 0001Shafi GoldwasserKaifeng LyuGuy N. RothblumAviad RubinsteinFine-grained Complexity Meets IP = PSPACE.SODA1-202019Conference and Workshop Papersopenconf/soda/ChenGLRR1910.1137/1.9781611975482.1https://doi.org/10.1137/1.9781611975482.1https://dblp.org/rec/conf/soda/ChenGLRR19URL#2275517Lijie Chen 0001Ryan Williams 0001An Equivalence Class for Orthogonal Vectors.SODA21-402019Conference and Workshop Papersopenconf/soda/ChenW1910.1137/1.9781611975482.2https://doi.org/10.1137/1.9781611975482.2https://dblp.org/rec/conf/soda/ChenW19URL#2275518Kuan ChengBernhard HaeuplerXin Li 0006Amirbehshad ShahrasbiKe Wu 0001Synchronization Strings: Highly Efficient Deterministic Constructions over Small Alphabets.SODA2185-22042019Conference and Workshop Papersopenconf/soda/ChengHLSW1910.1137/1.9781611975482.132https://doi.org/10.1137/1.9781611975482.132https://dblp.org/rec/conf/soda/ChengHLSW19URL#2275519Aruni ChoudharyMichael KerberSharath RaghvendraImproved Topological Approximations by Digitization.SODA2675-26882019Conference and Workshop Papersopenconf/soda/ChoudharyKR1910.1137/1.9781611975482.166https://doi.org/10.1137/1.9781611975482.166https://dblp.org/rec/conf/soda/ChoudharyKR19URL#2275520Julia ChuzhoyZihan TanTowards Tight(er) Bounds for the Excluded Grid Theorem.SODA1445-14642019Conference and Workshop Papersopenconf/soda/ChuzhoyT1910.1137/1.9781611975482.88https://doi.org/10.1137/1.9781611975482.88https://dblp.org/rec/conf/soda/ChuzhoyT19URL#2275521Raphaël CliffordTomasz KociumakaEly PoratThe streaming k-mismatch problem.SODA1106-11252019Conference and Workshop Papersopenconf/soda/CliffordKP1910.1137/1.9781611975482.68https://doi.org/10.1137/1.9781611975482.68https://dblp.org/rec/conf/soda/CliffordKP19URL#2275522Vincent Cohen-AddadLaurent FeuilloleyTatiana StarikovskayaLower bounds for text indexing with mismatches and differences.SODA1146-11642019Conference and Workshop Papersopenconf/soda/Cohen-AddadFS1910.1137/1.9781611975482.70https://doi.org/10.1137/1.9781611975482.70https://dblp.org/rec/conf/soda/Cohen-AddadFS19URL#2275523Colin CooperAlan M. FriezeWesley PegdenOn the rank of a random binary matrix.SODA946-9552019Conference and Workshop Papersopenconf/soda/CooperFP1910.1137/1.9781611975482.58https://doi.org/10.1137/1.9781611975482.58https://dblp.org/rec/conf/soda/CooperFP19URL#2275524José R. CorreaRaimundo SaonaBruno ZiliottoProphet Secretary Through Blind Strategies.SODA1946-19612019Conference and Workshop Papersopenconf/soda/CorreaSZ1910.1137/1.9781611975482.118https://doi.org/10.1137/1.9781611975482.118https://dblp.org/rec/conf/soda/CorreaSZ19URL#2275525Wojciech CzerwinskiLaure DaviaudNathanaël FijalkowMarcin JurdzinskiRanko Lazic 0001Pawel ParysUniversal trees grow inside separating automata: Quasi-polynomial lower bounds for parity games.SODA2333-23492019Conference and Workshop Papersopenconf/soda/CzerwinskiDFJLP1910.1137/1.9781611975482.142https://doi.org/10.1137/1.9781611975482.142https://dblp.org/rec/conf/soda/CzerwinskiDFJLP19URL#2275526Yuan DengDebmalya PanigrahiMulti-unit Supply-monotone Auctions with Bayesian Valuations.SODA173-1922019Conference and Workshop Papersopenconf/soda/DengP1910.1137/1.9781611975482.12https://doi.org/10.1137/1.9781611975482.12https://dblp.org/rec/conf/soda/DengP19URL#2275527Yash DeshpandeAndrea MontanariRyan O'DonnellTselil SchrammSubhabrata SenThe threshold for SDP-refutation of random regular NAE-3SAT.SODA2305-23212019Conference and Workshop Papersopenconf/soda/DeshpandeMOSS1910.1137/1.9781611975482.140https://doi.org/10.1137/1.9781611975482.140https://dblp.org/rec/conf/soda/DeshpandeMOSS19URL#2275529Tamal K. DeyComputing Height Persistence and Homology Generators in R3 Efficiently.SODA2649-26622019Conference and Workshop Papersopenconf/soda/Dey1910.1137/1.9781611975482.164https://doi.org/10.1137/1.9781611975482.164https://dblp.org/rec/conf/soda/Dey19URL#2275530Ilias DiakonikolasWeihao KongAlistair StewartEfficient Algorithms and Lower Bounds for Robust Linear Regression.SODA2745-27542019Conference and Workshop Papersopenconf/soda/DiakonikolasKS1910.1137/1.9781611975482.170https://doi.org/10.1137/1.9781611975482.170https://dblp.org/rec/conf/soda/DiakonikolasKS19URL#2275531Irit DinurYuval FilmusPrahladh HarshaAnalyzing Boolean functions on the biased hypercube via higher-dimensional agreement tests: [Extended abstract].SODA2124-21332019Conference and Workshop Papersopenconf/soda/DinurFH1910.1137/1.9781611975482.128https://doi.org/10.1137/1.9781611975482.128https://dblp.org/rec/conf/soda/DinurFH19URL#2275532Irit DinurPrahladh HarshaTali KaufmanInbal Livni NavonAmnon Ta-ShmaList Decoding with Double Samplers.SODA2134-21532019Conference and Workshop Papersopenconf/soda/DinurHKNT1910.1137/1.9781611975482.129https://doi.org/10.1137/1.9781611975482.129https://dblp.org/rec/conf/soda/DinurHKNT19URL#2275533Ran DuanHaoqing HeTianyi Zhang 0008Dynamic Edge Coloring with Improved Approximation.SODA1937-19452019Conference and Workshop Papersopenconf/soda/DuanHZ1910.1137/1.9781611975482.117https://doi.org/10.1137/1.9781611975482.117https://dblp.org/rec/conf/soda/DuanHZ19URL#2275534Vida DujmovicFabrizio FratiDaniel Gonçalves 0001Pat MorinGünter RoteEvery Collinear Set in a Planar Graph Is Free.SODA1521-15382019Conference and Workshop Papersopenconf/soda/DujmovicFGMR1910.1137/1.9781611975482.92https://doi.org/10.1137/1.9781611975482.92https://dblp.org/rec/conf/soda/DujmovicFGMR19URL#2275536Adrian DumitrescuRitankar MandalNew Lower Bounds for the Number of Pseudoline Arrangements.SODA410-4252019Conference and Workshop Papersopenconf/soda/DumitrescuM1910.1137/1.9781611975482.26https://doi.org/10.1137/1.9781611975482.26https://dblp.org/rec/conf/soda/DumitrescuM19URL#2275537Alina EneHuy L. NguyenSubmodular Maximization with Nearly-optimal Approximation and Adaptivity in Nearly-linear Time.SODA274-2822019Conference and Workshop Papersopenconf/soda/EneN1910.1137/1.9781611975482.18https://doi.org/10.1137/1.9781611975482.18https://dblp.org/rec/conf/soda/EneN19URL#2275538David EppsteinBruce A. ReedFinding Maximal Sets of Laminar 3-Separators in Planar Graphs in Linear Time.SODA589-6052019Conference and Workshop Papersopenconf/soda/EppsteinR1910.1137/1.9781611975482.37https://doi.org/10.1137/1.9781611975482.37https://dblp.org/rec/conf/soda/EppsteinR19URL#2275539Úlfar ErlingssonVitaly FeldmanIlya MironovAnanth RaghunathanKunal TalwarAbhradeep ThakurtaAmplification by Shuffling: From Local to Central Differential Privacy via Anonymity.SODA2468-24792019Conference and Workshop Papersopenconf/soda/ErlingssonFMRTT1910.1137/1.9781611975482.151https://doi.org/10.1137/1.9781611975482.151https://dblp.org/rec/conf/soda/ErlingssonFMRTT19URL#2275540Yuri FaenzaTelikepalli KavithaVladlena PowersXingyu ZhangPopular Matchings and Limits to Tractability.SODA2790-28092019Conference and Workshop Papersopenconf/soda/FaenzaKPZ1910.1137/1.9781611975482.173https://doi.org/10.1137/1.9781611975482.173https://dblp.org/rec/conf/soda/FaenzaKPZ19URL#2275541Matthew FahrbachVahab S. MirrokniMorteza ZadimoghaddamSubmodular Maximization with Nearly Optimal Approximation, Adaptivity and Query Complexity.SODA255-2732019Conference and Workshop Papersopenconf/soda/FahrbachMZ1910.1137/1.9781611975482.17https://doi.org/10.1137/1.9781611975482.17https://dblp.org/rec/conf/soda/FahrbachMZ19URL#2275542Uriel FeigeJanardhan KulkarniShi Li 0001A Polynomial Time Constant Approximation For Minimizing Total Weighted Flow-time.SODA1585-15952019Conference and Workshop Papersopenconf/soda/FeigeKL1910.1137/1.9781611975482.96https://doi.org/10.1137/1.9781611975482.96https://dblp.org/rec/conf/soda/FeigeKL19URL#2275543Hendrik FichtenbergerPan Peng 0001Christian SohlerEvery Testable (Infinite) Property of Bounded-Degree Graphs Contains an Infinite Hyperfinite Subproperty.SODA714-7262019Conference and Workshop Papersopenconf/soda/FichtenbergerPS1910.1137/1.9781611975482.45https://doi.org/10.1137/1.9781611975482.45https://dblp.org/rec/conf/soda/FichtenbergerPS19URL#2275545Jacob FockeLeslie Ann GoldbergStanislav ZivnýThe Complexity of Approximately Counting Retractions.SODA2205-22152019Conference and Workshop Papersopenconf/soda/FockeGZ1910.1137/1.9781611975482.133https://doi.org/10.1137/1.9781611975482.133https://dblp.org/rec/conf/soda/FockeGZ19URL#2275547Eli Fox-EpsteinPhilip N. KleinAaron SchildEmbedding Planar Graphs into Low-Treewidth Graphs with Applications to Efficient Approximation Schemes for Metric Problems.SODA1069-10882019Conference and Workshop Papersopenconf/soda/Fox-EpsteinKS1910.1137/1.9781611975482.66https://doi.org/10.1137/1.9781611975482.66https://dblp.org/rec/conf/soda/Fox-EpsteinKS19URL#2275548Kyle FoxDebmalya PanigrahiFred ZhangMinimum Cut and Minimum k-Cut in Hypergraphs via Branching Contractions.SODA881-8962019Conference and Workshop Papersopenconf/soda/FoxPZ1910.1137/1.9781611975482.54https://doi.org/10.1137/1.9781611975482.54https://dblp.org/rec/conf/soda/FoxPZ19URL#2275549Zachary FriggstadKamyar KhodamoradiMohammad R. SalavatipourExact Algorithms and Lower Bounds for Stable Instances of Euclidean k-MEANS.SODA2958-29722019Conference and Workshop Papersopenconf/soda/FriggstadKS1910.1137/1.9781611975482.183https://doi.org/10.1137/1.9781611975482.183https://dblp.org/rec/conf/soda/FriggstadKS19URL#2275550Buddhima GamlathSagar KaleOla SvenssonBeating Greedy for Stochastic Bipartite Matching.SODA2841-28542019Conference and Workshop Papersopenconf/soda/GamlathKS1910.1137/1.9781611975482.176https://doi.org/10.1137/1.9781611975482.176https://dblp.org/rec/conf/soda/GamlathKS19URL#2275551Shashwat GargJanardhan KulkarniShi Li 0001Lift and Project Algorithms for Precedence Constrained Scheduling to Minimize Completion Time.SODA1570-15842019Conference and Workshop Papersopenconf/soda/GargKL1910.1137/1.9781611975482.95https://doi.org/10.1137/1.9781611975482.95https://dblp.org/rec/conf/soda/GargKL19URL#2275552Mohsen Ghaffari 0001Distributed Maximal Independent Set using Small Messages.SODA805-8202019Conference and Workshop Papersopenconf/soda/Ghaffari1910.1137/1.9781611975482.50https://doi.org/10.1137/1.9781611975482.50https://dblp.org/rec/conf/soda/Ghaffari19URL#2275554Mohsen Ghaffari 0001Jara UittoSparsifying Distributed Algorithms with Ramifications in Massively Parallel Computation and Centralized Local Computation.SODA1636-16532019Conference and Workshop Papersopenconf/soda/GhaffariU1910.1137/1.9781611975482.99https://doi.org/10.1137/1.9781611975482.99https://dblp.org/rec/conf/soda/GhaffariU19URL#2275555András GilyénSrinivasan ArunachalamNathan WiebeOptimizing quantum optimization algorithms via faster quantum gradient computation.SODA1425-14442019Conference and Workshop Papersopenconf/soda/GilyenAW1910.1137/1.9781611975482.87https://doi.org/10.1137/1.9781611975482.87https://dblp.org/rec/conf/soda/GilyenAW19URL#2275557Sivakanth GopiVenkatesan GuruswamiSergey YekhaninMaximally Recoverable LRCs: A field size lower bound and constructions for few heavy parities.SODA2154-21702019Conference and Workshop Papersopenconf/soda/GopiGY1910.1137/1.9781611975482.130https://doi.org/10.1137/1.9781611975482.130https://dblp.org/rec/conf/soda/GopiGY19URL#2275558Ofer GrossmanYang P. LiuReproducibility and Pseudo-Determinism in Log-Space.SODA606-6202019Conference and Workshop Papersopenconf/soda/GrossmanL1910.1137/1.9781611975482.38https://doi.org/10.1137/1.9781611975482.38https://dblp.org/rec/conf/soda/GrossmanL19URL#2275559Anna GroßwendtHeiko RöglinMelanie Schmidt 0001Analysis of Ward's Method.SODA2939-29572019Conference and Workshop Papersopenconf/soda/GrosswendtRS1910.1137/1.9781611975482.182https://doi.org/10.1137/1.9781611975482.182https://dblp.org/rec/conf/soda/GrosswendtRS19URL#2275560Andrzej GrzesikTereza KlimosováMarcin PilipczukMichal PilipczukPolynomial-time algorithm for Maximum Weight Independent Set on P6-free graphs.SODA1257-12712019Conference and Workshop Papersopenconf/soda/GrzesikKPP1910.1137/1.9781611975482.77https://doi.org/10.1137/1.9781611975482.77https://dblp.org/rec/conf/soda/GrzesikKPP19URL#2275561Anupam Gupta 0001Ravishankar KrishnaswamyAmit Kumar 0001Debmalya PanigrahiElastic Caching.SODA143-1562019Conference and Workshop Papersopenconf/soda/GuptaK0P1910.1137/1.9781611975482.10https://doi.org/10.1137/1.9781611975482.10https://dblp.org/rec/conf/soda/GuptaK0P19URL#2275562Anupam Gupta 0001Euiwoong LeeJason Li 0006Pasin ManurangsiMichal Wlodarczyk 0001Losing Treewidth by Separating Subsets.SODA1731-17492019Conference and Workshop Papersopenconf/soda/GuptaLLM01910.1137/1.9781611975482.104https://doi.org/10.1137/1.9781611975482.104https://dblp.org/rec/conf/soda/GuptaLLM019URL#2275563Sushmita GuptaPranabendu MisraSaket Saurabh 0001Meirav ZehaviPopular Matching in Roommates Setting is NP-hard.SODA2810-28222019Conference and Workshop Papersopenconf/soda/GuptaM0Z1910.1137/1.9781611975482.174https://doi.org/10.1137/1.9781611975482.174https://dblp.org/rec/conf/soda/GuptaM0Z19URL#2275564Rohit GurjarNisheeth K. VishnoiOn the Number of Circuits in Regular Matroids (with Connections to Lattices and Codes).SODA861-8802019Conference and Workshop Papersopenconf/soda/GurjarV1910.1137/1.9781611975482.53https://doi.org/10.1137/1.9781611975482.53https://dblp.org/rec/conf/soda/GurjarV19URL#2275565Gregory Z. GutinMagnus WahlströmMeirav ZehaviOn r-Simple k-Path and Related Problems Parameterized by k/r.SODA1750-17692019Conference and Workshop Papersopenconf/soda/GutinWZ1910.1137/1.9781611975482.105https://doi.org/10.1137/1.9781611975482.105https://dblp.org/rec/conf/soda/GutinWZ19URL#2275566MohammadTaghi HajiaghayiSaeed SeddighinXiaorui SunMassively Parallel Approximation Algorithms for Edit Distance and Longest Common Subsequence.SODA1654-16722019Conference and Workshop Papersopenconf/soda/HajiaghayiSS1910.1137/1.9781611975482.100https://doi.org/10.1137/1.9781611975482.100https://dblp.org/rec/conf/soda/HajiaghayiSS19URL#2275567MohammadTaghi HajiaghayiMasoud SeddighinSaeed SeddighinXiaorui SunApproximating LCS in Linear Time: Beating the √n Barrier.SODA1181-12002019Conference and Workshop Papersopenconf/soda/HajiaghayiSSS1910.1137/1.9781611975482.72https://doi.org/10.1137/1.9781611975482.72https://dblp.org/rec/conf/soda/HajiaghayiSSS19URL#2275568Nathaniel HarmsTesting Halfspaces over Rotation-Invariant Distributions.SODA694-7132019Conference and Workshop Papersopenconf/soda/Harms1910.1137/1.9781611975482.44https://doi.org/10.1137/1.9781611975482.44https://dblp.org/rec/conf/soda/Harms19URL#2275569David G. Harris 0001Oblivious resampling oracles and parallel algorithms for the Lopsided Lovász Local Lemma.SODA841-8602019Conference and Workshop Papersopenconf/soda/Harris1910.1137/1.9781611975482.52https://doi.org/10.1137/1.9781611975482.52https://dblp.org/rec/conf/soda/Harris19URL#2275570Meike HatzelKen-ichi KawarabayashiStephan KreutzerPolynomial Planar Directed Grid Theorem.SODA1465-14842019Conference and Workshop Papersopenconf/soda/HatzelKK1910.1137/1.9781611975482.89https://doi.org/10.1137/1.9781611975482.89https://dblp.org/rec/conf/soda/HatzelKK19URL#2275571Rebecca HobergThomas RothvossA Fourier-Analytic Approach for the Discrepancy of Random Set Systems.SODA2547-25562019Conference and Workshop Papersopenconf/soda/HobergR1910.1137/1.9781611975482.156https://doi.org/10.1137/1.9781611975482.156https://dblp.org/rec/conf/soda/HobergR19URL#2275572Riko JacobKasper Green LarsenJesper Buus NielsenLower Bounds for Oblivious Data Structures.SODA2439-24472019Conference and Workshop Papersopenconf/soda/JacobLN1910.1137/1.9781611975482.149https://doi.org/10.1137/1.9781611975482.149https://dblp.org/rec/conf/soda/JacobLN19URL#2275573Matthew JenssenPeter KeevashWill Perkins 0001Algorithms for #BIS-hard problems on expander graphs.SODA2235-22472019Conference and Workshop Papersopenconf/soda/JenssenKP1910.1137/1.9781611975482.135https://doi.org/10.1137/1.9781611975482.135https://dblp.org/rec/conf/soda/JenssenKP19URL#2275574Shunhua JiangKasper Green LarsenA Faster External Memory Priority Queue with DecreaseKeys.SODA1331-13432019Conference and Workshop Papersopenconf/soda/JiangL1910.1137/1.9781611975482.81https://doi.org/10.1137/1.9781611975482.81https://dblp.org/rec/conf/soda/JiangL19URL#2275575Zilin JiangNikita PolyanskiiHow to guess an n-digit number.SODA1215-12202019Conference and Workshop Papersopenconf/soda/JiangP1910.1137/1.9781611975482.74https://doi.org/10.1137/1.9781611975482.74https://dblp.org/rec/conf/soda/JiangP19URL#2275576Yaonan JinPinyan LuZhihao Gavin TangTao XiaoTight Revenue Gaps among Simple Mechanisms.SODA209-2282019Conference and Workshop Papersopenconf/soda/JinLTX1910.1137/1.9781611975482.14https://doi.org/10.1137/1.9781611975482.14https://dblp.org/rec/conf/soda/JinLTX19URL#2275577Akshay KamathEric Price 0001Adaptive Sparse Recovery with Limited Adaptivity.SODA2729-27442019Conference and Workshop Papersopenconf/soda/KamathP1910.1137/1.9781611975482.169https://doi.org/10.1137/1.9781611975482.169https://dblp.org/rec/conf/soda/KamathP19URL#2275579Gautam Kamath 0001Christos TzamosAnaconda: A Non-Adaptive Conditional Sampling Algorithm for Distribution Testing.SODA679-6932019Conference and Workshop Papersopenconf/soda/KamathT1910.1137/1.9781611975482.43https://doi.org/10.1137/1.9781611975482.43https://dblp.org/rec/conf/soda/KamathT19URL#2275580Varun KanadeFrederik Mallmann-TrennThomas SauerwaldOn coalescence time in graphs: When is coalescing as fast as meeting?: Extended Abstract.SODA956-9652019Conference and Workshop Papersopenconf/soda/KanadeMS1910.1137/1.9781611975482.59https://doi.org/10.1137/1.9781611975482.59https://dblp.org/rec/conf/soda/KanadeMS19URL#2275581Haim KaplanOr ZamirUri ZwickA sort of an adversary.SODA1291-13102019Conference and Workshop Papersopenconf/soda/KaplanZZ1910.1137/1.9781611975482.79https://doi.org/10.1137/1.9781611975482.79https://dblp.org/rec/conf/soda/KaplanZZ19URL#2275583Michael KapralovAmeya VelingkerAmir ZandiehDimension-independent Sparse Fourier Transform.SODA2709-27282019Conference and Workshop Papersopenconf/soda/KapralovVZ1910.1137/1.9781611975482.168https://doi.org/10.1137/1.9781611975482.168https://dblp.org/rec/conf/soda/KapralovVZ19URL#2275584Matti KarppaPetteri KaskiProbabilistic Tensors and Opportunistic Boolean Matrix Multiplication.SODA496-5152019Conference and Workshop Papersopenconf/soda/KarppaK1910.1137/1.9781611975482.31https://doi.org/10.1137/1.9781611975482.31https://dblp.org/rec/conf/soda/KarppaK19URL#2275586Dominik KempaOptimal Construction of Compressed Indexes for Highly Repetitive Texts.SODA1344-13572019Conference and Workshop Papersopenconf/soda/Kempa1910.1137/1.9781611975482.82https://doi.org/10.1137/1.9781611975482.82https://dblp.org/rec/conf/soda/Kempa19URL#2275587Subhash KhotAssaf NaorThe Andoni-Krauthgamer-Razenshteyn characterization of sketchable norms fails for sketchable metrics.SODA1814-18242019Conference and Workshop Papersopenconf/soda/KhotN1910.1137/1.9781611975482.109https://doi.org/10.1137/1.9781611975482.109https://dblp.org/rec/conf/soda/KhotN19URL#2275588Sándor Kisfaludi-BakJesper NederlofErik Jan van LeeuwenNearly ETH-tight algorithms for Planar Steiner Tree with Terminals on Few Faces.SODA1015-10342019Conference and Workshop Papersopenconf/soda/Kisfaludi-BakNL1910.1137/1.9781611975482.63https://doi.org/10.1137/1.9781611975482.63https://dblp.org/rec/conf/soda/Kisfaludi-BakNL19URL#2275589Max KlimmPhilipp WarodeComputing all Wardrop Equilibria parametrized by the Flow Demand.SODA917-9342019Conference and Workshop Papersopenconf/soda/KlimmW1910.1137/1.9781611975482.56https://doi.org/10.1137/1.9781611975482.56https://dblp.org/rec/conf/soda/KlimmW19URL#2275590Robert KrauthgamerJames R. LeeHavana RikaFlow-Cut Gaps and Face Covers in Planar Graphs.SODA525-5342019Conference and Workshop Papersopenconf/soda/KrauthgamerLR1910.1137/1.9781611975482.33https://doi.org/10.1137/1.9781611975482.33https://dblp.org/rec/conf/soda/KrauthgamerLR19URL#2275592William KuszmaulEfficiently Approximating Edit Distance Between Pseudorandom Strings.SODA1165-11802019Conference and Workshop Papersopenconf/soda/Kuszmaul1910.1137/1.9781611975482.71https://doi.org/10.1137/1.9781611975482.71https://dblp.org/rec/conf/soda/Kuszmaul19URL#2275593Nathaniel LahnSharath RaghvendraA Faster Algorithm for Minimum-Cost Bipartite Matching in Minor-Free Graphs.SODA569-5882019Conference and Workshop Papersopenconf/soda/LahnR1910.1137/1.9781611975482.36https://doi.org/10.1137/1.9781611975482.36https://dblp.org/rec/conf/soda/LahnR19URL#2275594Chi-Kit LamC. Gregory PlaxtonA (1 + 1/e)-Approximation Algorithm for Maximum Stable Matching with One-Sided Ties and Incomplete Lists.SODA2823-28402019Conference and Workshop Papersopenconf/soda/LamP1910.1137/1.9781611975482.175https://doi.org/10.1137/1.9781611975482.175https://dblp.org/rec/conf/soda/LamP19URL#2275595Caleb C. LevyRobert E. TarjanA New Path from Splay to Dynamic Optimality.SODA1311-13302019Conference and Workshop Papersopenconf/soda/LevyT1910.1137/1.9781611975482.80https://doi.org/10.1137/1.9781611975482.80https://dblp.org/rec/conf/soda/LevyT19URL#2275596Shi Li 0001On Facility Location with General Lower Bounds.SODA2279-22902019Conference and Workshop Papersopenconf/soda/Li1910.1137/1.9781611975482.138https://doi.org/10.1137/1.9781611975482.138https://dblp.org/rec/conf/soda/Li19URL#2275597Wei-Kai LinElaine ShiTiancheng XieCan We Overcome the n log n Barrier for Oblivious Sorting?SODA2419-24382019Conference and Workshop Papersopenconf/soda/LinSX1910.1137/1.9781611975482.148https://doi.org/10.1137/1.9781611975482.148https://dblp.org/rec/conf/soda/LinSX19URL#2275598Yang P. LiuSushant SachdevaZejun YuShort Cycles via Low-Diameter Decompositions.SODA2602-26152019Conference and Workshop Papersopenconf/soda/LiuSY1910.1137/1.9781611975482.161https://doi.org/10.1137/1.9781611975482.161https://dblp.org/rec/conf/soda/LiuSY19URL#2275599Monaldo MastrolilliThe Complexity of the Ideal Membership Problem for Constrained Problems Over the Boolean Domain.SODA456-4752019Conference and Workshop Papersopenconf/soda/Mastrolilli1910.1137/1.9781611975482.29https://doi.org/10.1137/1.9781611975482.29https://dblp.org/rec/conf/soda/Mastrolilli19URL#2275603Marco Molinaro 0001Stochastic ℓp Load Balancing and Moment Problems via the L-Function Method.SODA343-3542019Conference and Workshop Papersopenconf/soda/Molinaro1910.1137/1.9781611975482.22https://doi.org/10.1137/1.9781611975482.22https://dblp.org/rec/conf/soda/Molinaro19URL#2275604Elchanan MosselJiaming XuSeeded Graph Matching via Large Neighborhood Statistics.SODA1005-10142019Conference and Workshop Papersopenconf/soda/MosselX1910.1137/1.9781611975482.62https://doi.org/10.1137/1.9781611975482.62https://dblp.org/rec/conf/soda/MosselX19URL#2275605Marcin MuchaKarol WegrzyckiMichal Wlodarczyk 0001A Subquadratic Approximation Scheme for Partition.SODA70-882019Conference and Workshop Papersopenconf/soda/MuchaW01910.1137/1.9781611975482.5https://doi.org/10.1137/1.9781611975482.5https://dblp.org/rec/conf/soda/MuchaW019URL#2275606Martin NägeleRico ZenklusenA New Dynamic Programming Approach for Spanning Trees with Chain Constraints and Beyond.SODA1550-15692019Conference and Workshop Papersopenconf/soda/NageleZ1910.1137/1.9781611975482.94https://doi.org/10.1137/1.9781611975482.94https://dblp.org/rec/conf/soda/NageleZ19URL#2275607Amir NayyeriBenjamin RaichelViewing the Rings of a Tree: Minimum Distortion Embeddings into Trees.SODA2380-23992019Conference and Workshop Papersopenconf/soda/NayyeriR1910.1137/1.9781611975482.146https://doi.org/10.1137/1.9781611975482.146https://dblp.org/rec/conf/soda/NayyeriR19URL#2275608Jelani NelsonHuacheng YuOptimal Lower Bounds for Distributed and Streaming Spanning Forest Computation.SODA1844-18602019Conference and Workshop Papersopenconf/soda/NelsonY1910.1137/1.9781611975482.111https://doi.org/10.1137/1.9781611975482.111https://dblp.org/rec/conf/soda/NelsonY19URL#2275609Huy L. NguyenFast greedy for linear matroids.SODA516-5242019Conference and Workshop Papersopenconf/soda/Nguyen1910.1137/1.9781611975482.32https://doi.org/10.1137/1.9781611975482.32https://dblp.org/rec/conf/soda/Nguyen19URL#2275610Aleksandar NikolovMohit SinghUthaipon Tao TantipongpipatProportional Volume Sampling and Approximation Algorithms for A-Optimal Design.SODA1369-13862019Conference and Workshop Papersopenconf/soda/NikolovST1910.1137/1.9781611975482.84https://doi.org/10.1137/1.9781611975482.84https://dblp.org/rec/conf/soda/NikolovST19URL#2275611Eunjin Oh 0001Optimal Algorithm for Geodesic Nearest-point Voronoi Diagrams in Simple Polygons.SODA391-4092019Conference and Workshop Papersopenconf/soda/Oh1910.1137/1.9781611975482.25https://doi.org/10.1137/1.9781611975482.25https://dblp.org/rec/conf/soda/Oh19URL#2275612Fahad PanolanSaket Saurabh 0001Meirav ZehaviContraction Decomposition in Unit Disk Graphs and Algorithmic Applications in Parameterized Complexity.SODA1035-10542019Conference and Workshop Papersopenconf/soda/Panolan0Z1910.1137/1.9781611975482.64https://doi.org/10.1137/1.9781611975482.64https://dblp.org/rec/conf/soda/Panolan0Z19URL#2275613Merav ParterEylon YogevLow Congestion Cycle Covers and Their Applications.SODA1673-16922019Conference and Workshop Papersopenconf/soda/ParterY1910.1137/1.9781611975482.101https://doi.org/10.1137/1.9781611975482.101https://dblp.org/rec/conf/soda/ParterY19URL#2275614Merav ParterEylon YogevDistributed Algorithms Made Secure: A Graph Theoretic Approach.SODA1693-17102019Conference and Workshop Papersopenconf/soda/ParterY19a10.1137/1.9781611975482.102https://doi.org/10.1137/1.9781611975482.102https://dblp.org/rec/conf/soda/ParterY19aURL#2275615Michal PilipczukSebastian SiebertzPolynomial bounds for centered colorings on proper minor-closed graph classes.SODA1501-15202019Conference and Workshop Papersopenconf/soda/PilipczukS1910.1137/1.9781611975482.91https://doi.org/10.1137/1.9781611975482.91https://dblp.org/rec/conf/soda/PilipczukS19URL#2275616Benjamin PlautTim RoughgardenCommunication Complexity of Discrete Fair Division.SODA2014-20332019Conference and Workshop Papersopenconf/soda/PlautR1910.1137/1.9781611975482.122https://doi.org/10.1137/1.9781611975482.122https://dblp.org/rec/conf/soda/PlautR19URL#2275617Prasad RaghavendraNick RyderNikhil SrivastavaBenjamin WeitzExponential Lower Bounds on Spectrahedral Representations of Hyperbolicity Cones.SODA2322-23322019Conference and Workshop Papersopenconf/soda/RaghavendraRSW1910.1137/1.9781611975482.141https://doi.org/10.1137/1.9781611975482.141https://dblp.org/rec/conf/soda/RaghavendraRSW19URL#2275619Rebecca ReiffenhäuserAn Optimal Truthful Mechanism for the Online Weighted Bipartite Matching Problem.SODA1982-19932019Conference and Workshop Papersopenconf/soda/Reiffenhauser1910.1137/1.9781611975482.120https://doi.org/10.1137/1.9781611975482.120https://dblp.org/rec/conf/soda/Reiffenhauser19URL#2275620Günter RoteThe Maximum Number of Minimal Dominating Sets in a Tree.SODA1201-12142019Conference and Workshop Papersopenconf/soda/Rote19a10.1137/1.9781611975482.73https://doi.org/10.1137/1.9781611975482.73https://dblp.org/rec/conf/soda/Rote19aURL#2275622Ario SalmasiAnastasios SidiropoulosVijay SridharOn Constant Multi-Commodity Flow-Cut Gaps for Families of Directed Minor-Free Graphs.SODA535-5532019Conference and Workshop Papersopenconf/soda/SalmasiSS1910.1137/1.9781611975482.34https://doi.org/10.1137/1.9781611975482.34https://dblp.org/rec/conf/soda/SalmasiSS19URL#2275623Thatchaphol SaranurakDi WangExpander Decomposition and Pruning: Faster, Stronger, and Simpler.SODA2616-26352019Conference and Workshop Papersopenconf/soda/SaranurakW1910.1137/1.9781611975482.162https://doi.org/10.1137/1.9781611975482.162https://dblp.org/rec/conf/soda/SaranurakW19URL#2275624Leon SeringLaura Vargas KochNash Flows Over Time with Spillback.SODA935-9452019Conference and Workshop Papersopenconf/soda/SeringK1910.1137/1.9781611975482.57https://doi.org/10.1137/1.9781611975482.57https://dblp.org/rec/conf/soda/SeringK19URL#2275625Rocco A. ServedioLi-Yang TanPseudorandomness for read-k DNF formulas.SODA621-6382019Conference and Workshop Papersopenconf/soda/ServedioT1910.1137/1.9781611975482.39https://doi.org/10.1137/1.9781611975482.39https://dblp.org/rec/conf/soda/ServedioT19URL#2275626Tasuku SomaYuichi YoshidaSpectral Sparsification of Hypergraphs.SODA2570-25812019Conference and Workshop Papersopenconf/soda/SomaY1910.1137/1.9781611975482.159https://doi.org/10.1137/1.9781611975482.159https://dblp.org/rec/conf/soda/SomaY19URL#2275627Zhao Song 0002David P. WoodruffPeilin ZhongRelative Error Tensor Low Rank Approximation.SODA2772-27892019Conference and Workshop Papersopenconf/soda/SongWZ1910.1137/1.9781611975482.172https://doi.org/10.1137/1.9781611975482.172https://dblp.org/rec/conf/soda/SongWZ19URL#2275628Sophie SpirklMaria ChudnovskyMingxian ZhongFour-coloring P6-free graphs.SODA1239-12562019Conference and Workshop Papersopenconf/soda/SpirklCZ1910.1137/1.9781611975482.76https://doi.org/10.1137/1.9781611975482.76https://dblp.org/rec/conf/soda/SpirklCZ19URL#2275629Madhu Sudan 0001Badih GhaziNoah GolowichMitali BafnaCommunication-Rounds Tradeoffs for Common Randomness and Secret Key Generation.SODA1861-18712019Conference and Workshop Papersopenconf/soda/SudanGGB1910.1137/1.9781611975482.112https://doi.org/10.1137/1.9781611975482.112https://dblp.org/rec/conf/soda/SudanGGB19URL#2275630Pavel Veselý 0001Marek ChrobakLukasz JezJirí SgallA ϕ-Competitive Algorithm for Scheduling Packets with Deadlines.SODA123-1422019Conference and Workshop Papersopenconf/soda/VeselyCJS1910.1137/1.9781611975482.9https://doi.org/10.1137/1.9781611975482.9https://dblp.org/rec/conf/soda/VeselyCJS19URL#2275631Yipu WangMaximum Integer Flows in Directed Planar Graphs with Vertex Capacities and Multiple Sources and Sinks.SODA554-5682019Conference and Workshop Papersopenconf/soda/Wang1910.1137/1.9781611975482.35https://doi.org/10.1137/1.9781611975482.35https://dblp.org/rec/conf/soda/Wang19URL#2275632Ruosong WangDavid P. WoodruffTight Bounds for ℓp Oblivious Subspace Embeddings.SODA1825-18432019Conference and Workshop Papersopenconf/soda/WangW1910.1137/1.9781611975482.110https://doi.org/10.1137/1.9781611975482.110https://dblp.org/rec/conf/soda/WangW19URL#2275633Alexander Wei 0001Optimal Las Vegas Approximate Near Neighbors in ℓp.SODA1794-18132019Conference and Workshop Papersopenconf/soda/Wei1910.1137/1.9781611975482.108https://doi.org/10.1137/1.9781611975482.108https://dblp.org/rec/conf/soda/Wei19URL#2275634Front Matter.SODAi-ix2019Conference and Workshop Papersopenconf/soda/X19a10.1137/1.9781611975482.FMhttps://doi.org/10.1137/1.9781611975482.fmhttps://dblp.org/rec/conf/soda/X19aURL#2275636Jie Xue 0003Colored range closest-pair problem under general distance functions.SODA373-3902019Conference and Workshop Papersopenconf/soda/Xue1910.1137/1.9781611975482.24https://doi.org/10.1137/1.9781611975482.24https://dblp.org/rec/conf/soda/Xue19URL#2275637Yuichi YoshidaCheeger Inequalities for Submodular Transformations.SODA2582-26012019Conference and Workshop Papersopenconf/soda/Yoshida1910.1137/1.9781611975482.160https://doi.org/10.1137/1.9781611975482.160https://dblp.org/rec/conf/soda/Yoshida19URL#2275638Raphael YusterVector clique decompositions.SODA1221-12382019Conference and Workshop Papersopenconf/soda/Yuster1910.1137/1.9781611975482.75https://doi.org/10.1137/1.9781611975482.75https://dblp.org/rec/conf/soda/Yuster19URL#2275639Rico ZenklusenA 1.5-Approximation for Path TSP.SODA1539-15492019Conference and Workshop Papersopenconf/soda/Zenklusen1910.1137/1.9781611975482.93https://doi.org/10.1137/1.9781611975482.93https://dblp.org/rec/conf/soda/Zenklusen19URL#2275640Timothy M. ChanProceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2019, San Diego, California, USA, January 6-9, 2019SODASIAM2019Editorshipopenconf/soda/201910.1137/1.9781611975482https://doi.org/10.1137/1.9781611975482https://dblp.org/rec/conf/soda/2019URL#2297155