SODA A*

137 papers

YearTitle / Authors
2015(2Δ - l)-Edge-Coloring is Much Easier than Maximal Matching in the Distributed Setting.
Michael Elkin, Seth Pettie, Hsin-Hao Su
20152-Edge Connectivity in Directed Graphs.
Loukas Georgiadis, Giuseppe F. Italiano, Luigi Laura, Nikos Parotsidis
2015A Dynamic Programming Framework for Non-Preemptive Scheduling Problems on Multiple Machines [Extended Abstract].
Sungjin Im, Shi Li, Benjamin Moseley, Eric Torng
2015A Fully Polynomial-Time Approximation Scheme for Speed Scaling with Sleep State.
Antonios Antoniadis, Chien-Chung Huang, Sebastian Ott
2015A Linear-Size Logarithmic Stretch Path-Reporting Distance Oracle for General Graphs.
Michael Elkin, Seth Pettie
2015A Simple
Moran Feldman, Ola Svensson, Rico Zenklusen
2015A Stable Marriage Requires Communication.
Yannai A. Gonczarowski, Noam Nisan, Rafail Ostrovsky, Will Rosenbaum
2015A Unified Framework for Clustering Constrained Data without Locality Property.
Hu Ding, Jinhui Xu
2015A dynamic model of barter exchange.
Ross Anderson, Itai Ashlagi, David Gamarnik, Yash Kanoria
2015A new characterization of maximal repetitions by Lyndon trees.
Hideo Bannai, Tomohiro I, Shunsuke Inenaga, Yuto Nakashima, Masayuki Takeda, Kazuya Tsuruta
2015A note on the ring loading problem.
Martin Skutella
2015A polylogarithmic space deterministic streaming algorithm for approximating distance to monotonicity.
Timothy Naumovitz, Michael E. Saks
2015A quasi-PTAS for the Two-Dimensional Geometric Knapsack Problem.
Anna Adamaszek, Andreas Wiese
2015Algorithmic regularity for polynomials and applications.
Arnab Bhattacharyya, Pooya Hatami, Madhur Tulsiani
2015An
Andrew Chi-Chih Yao
2015An Improved Approximation for
Jaroslaw Byrka, Thomas W. Pensyl, Bartosz Rybicki, Aravind Srinivasan, Khoa Trinh
2015An algorithmic framework for obtaining lower bounds for random Ramsey problems
Rajko Nenadov, Nemanja Skoric, Angelika Steger
2015An exact characterization of tractable demand patterns for maximum disjoint path problems.
Dániel Marx, Paul Wollan
2015Approximate Nearest Line Search in High Dimensions.
Sepideh Mahabadi
2015Approximate Range Emptiness in Constant Time and Optimal Space.
Mayank Goswami, Allan Grønlund Jørgensen, Kasper Green Larsen, Rasmus Pagh
2015Approximate resilience, monotonicity, and the complexity of agnostic learning.
Dana Dachman-Soled, Vitaly Feldman, Li-Yang Tan, Andrew Wan, Karl Wimmer
2015Approximately Stable, School Optimal, and Student-Truthful Many-to-One Matchings (via Differential Privacy).
Sampath Kannan, Jamie Morgenstern, Aaron Roth, Zhiwei Steven Wu
2015Approximating Hereditary Discrepancy via Small Width Ellipsoids.
Aleksandar Nikolov, Kunal Talwar
2015Approximating independent sets in sparse graphs.
Nikhil Bansal
2015Approximating the best Nash Equilibrium in
Mark Braverman, Young Kun-Ko, Omri Weinstein
2015Approximation Schemes for Partitioning: Convex Decomposition and Surface Approximation.
Sayan Bandyapadhyay, Santanu Bhowmick, Kasturi R. Varadarajan
2015Bayesian Truthful
Constantinos Daskalakis, S. Matthew Weinberg
2015Beating Exhaustive Search for Quantified Boolean Formulas and Connections to Circuit Complexity.
Rahul Santhanam, Richard Ryan Williams
2015Bi-Factor Approximation Algorithms for Hard Capacitated
Jaroslaw Byrka, Krzysztof Fleszar, Bartosz Rybicki, Joachim Spoerhase
2015Capacity of Interactive Communication over Erasure Channels and Channels with Feedback.
Ran Gelles, Bernhard Haeupler
2015Cell-probe bounds for online edit distance and other pattern matching problems.
Raphaël Clifford, Markus Jalsenius, Benjamin Sach
2015Characterization of cutoff for reversible Markov chains.
Riddhipratim Basu, Jonathan Hermon, Yuval Peres
2015Characterizing the easy-to-find subgraphs from the viewpoint of polynomial-time algorithms, kernels, and Turing kernels.
Bart M. P. Jansen, Dániel Marx
2015Combinatorial Algorithm for Restricted Max-Min Fair Allocation.
Chidambaram Annamalai, Christos Kalaitzis, Ola Svensson
2015Combinatorial Auctions via Posted Prices.
Michal Feldman, Nick Gravin, Brendan Lucier
2015Comparing Apples and Oranges: Query Tradeoff in Submodular Maximization.
Niv Buchbinder, Moran Feldman, Roy Schwartz
2015Compatible Connectivity-Augmentation of Planar Disconnected Graphs.
Greg Aloupis, Luis Barba, Paz Carmi, Vida Dujmovic, Fabrizio Frati, Pat Morin
2015Connectivity in Random Forests and Credit Networks.
Ashish Goel, Sanjeev Khanna, Sharath Raghvendra, Hongyang Zhang
2015Contagious Sets in Expanders.
Amin Coja-Oghlan, Uriel Feige, Michael Krivelevich, Daniel Reichman
2015Decomposing a Graph Into Expanding Subgraphs.
Guy Moshkovitz, Asaf Shapira
2015Degree-3 Treewidth Sparsifiers.
Chandra Chekuri, Julia Chuzhoy
2015Density and regularity theorems for semi-algebraic hypergraphs.
Jacob Fox, János Pach, Andrew Suk
2015Detecting Weakly Simple Polygons.
Hsien-Chih Chang, Jeff Erickson, Chao Xu
2015Deterministic Fully Dynamic Data Structures for Vertex Cover and Matching.
Sayan Bhattacharya, Monika Henzinger, Giuseppe F. Italiano
2015Distributed Computation of Large-scale Graph Problems.
Hartmut Klauck, Danupon Nanongkai, Gopal Pandurangan, Peter Robinson
2015Dynamic Facility Location via Exponential Clocks.
Hyung-Chan An, Ashkan Norouzi-Fard, Ola Svensson
2015Efficient and Robust Persistent Homology for Measures.
Mickaël Buchet, Frédéric Chazal, Steve Y. Oudot, Donald R. Sheehy
2015FPTAS for Counting Monotone CNF.
Jingcheng Liu, Pinyan Lu
2015Fast Algorithms for Online Stochastic Convex Programming.
Shipra Agrawal, Nikhil R. Devanur
2015Fast Generation of Random Spanning Trees and the Effective Resistance Metric.
Aleksander Madry, Damian Straszak, Jakub Tarnawski
2015Fast Lattice Point Enumeration with Minimal Overhead.
Daniele Micciancio, Michael Walter
2015Finding Four-Node Subgraphs in Triangle Time.
Virginia Vassilevska Williams, Joshua R. Wang, Richard Ryan Williams, Huacheng Yu
2015Forbidden structure characterization of circular-arc graphs and a certifying recognition algorithm.
Mathew C. Francis, Pavol Hell, Juraj Stacho
2015Four terminal planar Delta-Wye reducibility via rooted
Lino Demasi, Bojan Mohar
2015Front Matter.
2015Geometric
Sylvester David Eriksson-Bique, John Hershberger, Valentin Polishchuk, Bettina Speckmann, Subhash Suri, Topi Talvitie, Kevin Verbeek, Hakan Yildiz
2015Gossip vs. Markov Chains, and Randomness-Efficient Rumor Spreading.
Zeyu Guo, He Sun
2015Improved Bounds for Orthogonal Point Enclosure Query and Point Location in Orthogonal Subdivisions in ℝ
Saladi Rahul
2015Improved Bounds for the Flat Wall Theorem.
Julia Chuzhoy
2015Improved Region-Growing and Combinatorial Algorithms for
Guru Guruganesh, Laura Sanità, Chaitanya Swamy
2015Internal Pattern Matching Queries in a Text and Applications.
Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2015LP/SDP Hierarchy Lower Bounds for Decoding Random LDPC Codes.
Badih Ghazi, Euiwoong Lee
2015Learning Privately with Labeled and Unlabeled Examples.
Amos Beimel, Kobbi Nissim, Uri Stemmer
2015Learning from satisfying assignments.
Anindya De, Ilias Diakonikolas, Rocco A. Servedio
2015Limitations on Testable Affine-Invariant Codes in the High-Rate Regime.
Venkatesan Guruswami, Madhu Sudan, Ameya Velingker, Carol Wang
2015Linear Programming-based Approximation Algorithms for Multi-Vehicle Minimum Latency Problems (Extended Abstract).
Ian Post, Chaitanya Swamy
2015Lopsidependency in the Moser-Tardos framework: Beyond the Lopsided Lovász Local Lemma.
David G. Harris
2015Minimum Forcing Sets for Miura Folding Patterns.
Brad Ballinger, Mirela Damian, David Eppstein, Robin Y. Flatland, Jessica Ginepro, Thomas C. Hull
2015Minors and Dimension.
Bartosz Walczak
2015More Applications of the Polynomial Method to Algorithm Design.
Amir Abboud, Richard Ryan Williams, Huacheng Yu
2015New Approximation Schemes for Unsplittable Flow on a Path.
Jatin Batra, Naveen Garg, Amit Kumar, Tobias Mömke, Andreas Wiese
2015New Approximations for Broadcast Scheduling via Variants of α-point Rounding.
Sungjin Im, Maxim Sviridenko
2015On (1,
Deeparnab Chakrabarty, Sanjeev Khanna, Shi Li
2015On Survivable Set Connectivity.
Parinya Chalermsook, Fabrizio Grandoni, Bundit Laekhanukit
2015On Termination of Integer Linear Loops.
Joël Ouaknine, João Sousa Pinto, James Worrell
2015On Uniform Capacitated
Shi Li
2015On largest volume simplices and sub-determinants.
Marco Di Summa, Friedrich Eisenbrand, Yuri Faenza, Carsten Moldenhauer
2015On the Complexity of Computing an Equilibrium in Combinatorial Auctions.
Shahar Dobzinski, Hu Fu, Robert D. Kleinberg
2015On the Quickest Flow Problem in Dynamic Networks - A Parametric Min-Cost Flow Approach.
Maokai Lin, Patrick Jaillet
2015On the Richter-Thomassen Conjecture about Pairwise Intersecting Closed Curves.
János Pach, Natan Rubin, Gábor Tardos
2015Online Network Design Algorithms via Hierarchical Decompositions.
Seeun Umboh
2015Online Principal Components Analysis.
Christos Boutsidis, Dan Garber, Zohar Shay Karnin, Edo Liberty
2015Online Stochastic Matching with Unequal Probabilities.
Aranyak Mehta, Bo Waggoner, Morteza Zadimoghaddam
2015Online Submodular Maximization with Preemption.
Niv Buchbinder, Moran Feldman, Roy Schwartz
2015Optimal approximation for submodular and supermodular optimization with bounded curvature.
Maxim Sviridenko, Jan Vondrák, Justin Ward
2015Optimal detection of intersections between convex polyhedra.
Luis Barba, Stefan Langerman
2015Parameterized Streaming: Maximal Matching and Vertex Cover.
Rajesh Hemant Chitnis, Graham Cormode, Mohammad Taghi Hajiaghayi, Morteza Monemizadeh
2015Perfect Bayesian Equilibria in Repeated Sales.
Nikhil R. Devanur, Yuval Peres, Balasubramanian Sivan
2015Phase Transitions in Random Dyadic Tilings and Rectangular Dissections.
Sarah Cannon, Sarah Miracle, Dana Randall
2015Plurality Consensus in the Gossip Model.
Luca Becchetti, Andrea Clementi, Emanuele Natale, Francesco Pasquale, Riccardo Silvestri
2015Pricing Online Decisions: Beyond Auctions.
Ilan Reuven Cohen, Alon Eden, Amos Fiat, Lukasz Jez
2015Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2015, San Diego, CA, USA, January 4-6, 2015
Piotr Indyk
2015Property Testing on Product Distributions: Optimal Testers for Bounded Derivative Properties.
Deeparnab Chakrabarty, Kashyap Dixit, Madhav Jha, C. Seshadhri
2015Rejecting jobs to Minimize Load and Maximum Flow-time.
Anamitra Roy Choudhury, Syamantak Das, Naveen Garg, Amit Kumar
2015Revealing Optimal Thresholds for Generalized Secretary Problem via Continuous LP: Impacts on Online
T.-H. Hubert Chan, Fei Chen, Shaofeng H.-C. Jiang
2015Robust Price of Anarchy Bounds via LP and Fenchel Duality.
Janardhan Kulkarni, Vahab S. Mirrokni
2015Robust Probabilistic Inference.
Yishay Mansour, Aviad Rubinstein, Moshe Tennenholtz
2015Robust hamiltonicity of random directed graphs
Asaf Ferber, Rajko Nenadov, Ueli Peter, Andreas Noever, Nemanja Skoric
2015Robust randomized matchings.
Jannik Matuschke, Martin Skutella, José A. Soto
2015Sequential Random Permutation, List Contraction and Tree Contraction are Highly Parallel.
Julian Shun, Yan Gu, Guy E. Blelloch, Jeremy T. Fineman, Phillip B. Gibbons
2015Set membership with a few bit probes.
Mohit Garg, Jaikumar Radhakrishnan
2015Sharp Bounds on Formation-free Sequences.
Seth Pettie
2015Short Paths on the Voronoi Graph and Closest Vector Problem with Preprocessing.
Daniel Dadush, Nicolas Bonifas
2015Sketching for
Kenneth L. Clarkson, David P. Woodruff
2015Solving
Fedor V. Fomin, Daniel Lokshtanov, Neeldhara Misra, M. S. Ramanujan, Saket Saurabh
2015Spatial mixing and the connective constant: Optimal bounds.
Alistair Sinclair, Piyush Srivastava, Daniel Stefankovic, Yitong Yin
2015Speeding up the Four Russians Algorithm by About One More Logarithmic Factor.
Timothy M. Chan
2015Sperner's Colorings, Hypergraph Labeling Problems and Fair Division.
Maryam Mirzakhani, Jan Vondrák
2015Spider covers for prize-collecting network activation problem.
Takuro Fukunaga
2015Streaming Algorithms for Estimating the Matching Size in Planar Graphs and Beyond.
Hossein Esfandiari, Mohammad Taghi Hajiaghayi, Vahid Liaghat, Morteza Monemizadeh, Krzysztof Onak
2015Streaming Lower Bounds for Approximating MAX-CUT.
Michael Kapralov, Sanjeev Khanna, Madhu Sudan
2015Strong Inapproximability Results on Balanced Rainbow-Colorable Hypergraphs.
Venkatesan Guruswami, Euiwoong Lee
2015Subcubic Equivalences Between Graph Centrality Problems, APSP and Diameter.
Amir Abboud, Fabrizio Grandoni, Virginia Vassilevska Williams
2015Surprise probabilities in Markov chains.
James Norris, Yuval Peres, Alex Zhai
2015Testing Identity of Structured Distributions.
Ilias Diakonikolas, Daniel M. Kane, Vladimir Nikishkin
2015Testing Poisson Binomial Distributions.
Jayadev Acharya, Constantinos Daskalakis
2015The Complexity of Estimating Rényi Entropy.
Jayadev Acharya, Alon Orlitsky, Ananda Theertha Suresh, Himanshu Tyagi
2015The Parameterized Complexity of
Bingkai Lin
2015The Polyhedron-Hitting Problem.
Ventsislav Chonev, Joël Ouaknine, James Worrell
2015The Simplex Algorithm is NP-mighty.
Yann Disser, Martin Skutella
2015The Speed of Evolution.
Nisheeth K. Vishnoi
2015The Value 1 Problem Under Finite-memory Strategies for Concurrent Mean-payoff Games.
Krishnendu Chatterjee, Rasmus Ibsen-Jensen
2015The amortized cost of finding the minimum.
Haim Kaplan, Or Zamir, Uri Zwick
2015The matching polytope does not admit fully-polynomial size relaxation schemes.
Gábor Braun, Sebastian Pokutta
2015The optimal absolute ratio for online bin packing.
János Balogh, József Békési, György Dósa, Jirí Sgall, Rob van Stee
2015The size of the core in assignment markets.
Yash Kanoria, Daniela Sabán, Jay Sethuraman
2015The switch Markov chain for sampling irregular graphs (Extended Abstract).
Catherine S. Greenhill
2015Tight Bounds on Vertex Connectivity Under Vertex Sampling.
Keren Censor-Hillel, Mohsen Ghaffari, George Giakkoupis, Bernhard Haeupler, Fabian Kuhn
2015Tight lower bound for the channel assignment problem.
Arkadiusz Socala
2015Tighter Low-rank Approximation via Sampling the Leveraged Element.
Srinadh Bhojanapalli, Prateek Jain, Sujay Sanghavi
2015Towards a Characterization of Constant-Factor Approximable Min CSPs.
Víctor Dalmau, Andrei A. Krokhin, Rajsekar Manokaran
2015Triangulation Refinement and Approximate Shortest Paths in Weighted Regions.
Siu-Wing Cheng, Jiongxin Jin, Antoine Vigneron
2015Universal Computation with Arbitrary Polyomino Tiles in Non-Cooperative Self-Assembly.
Sándor P. Fekete, Jacob Hendricks, Matthew J. Patitz, Trent A. Rogers, Robert T. Schweller
2015Using Optimization to Break the Epsilon Barrier: A Faster and Simpler Width-Independent Algorithm for Solving Positive Linear Programs in Parallel.
Zeyuan Allen Zhu, Lorenzo Orecchia
2015Wavelet Trees Meet Suffix Trees.
Maxim A. Babenko, Pawel Gawrychowski, Tomasz Kociumaka, Tatiana Starikovskaya
2015Welfare Maximization with Production Costs: A Primal Dual Approach.
Zhiyi Huang, Anthony Kim
2015Zigzag Persistence via Reflections and Transpositions.
Clément Maria, Steve Y. Oudot