default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID29th SODA 2018: New Orleans, LA, USA
- Artur Czumaj:
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018, New Orleans, LA, USA, January 7-10, 2018. SIAM 2018, ISBN 978-1-61197-503-1 - Front Matter.
- Sayan Bhattacharya, Deeparnab Chakrabarty, Monika Henzinger
, Danupon Nanongkai:
Dynamic Algorithms for Graph Coloring. 1-20 - Aaron Bernstein, Shiri Chechik:
Incremental Topological Sort and Cycle Detection in Expected Total Time. 21-34 - Jacob Holm, Eva Rotenberg, Mikkel Thorup:
Dynamic Bridge-Finding in Õ(log2 n) Amortized Time. 35-52 - Surender Baswana, Ayush Goel, Shahbaz Khan:
Incremental DFS algorithms: a theoretical and experimental study. 53-72 - Adam Karczmarz:
Decrementai Transitive Closure and Shortest Paths for Planar Digraphs and Beyond. 73-92 - Andrei Asinowski, Gill Barequet, Yufei Zheng:
Polycubes with Small Perimeter Defect. 93-100 - Sharath Raghvendra, Mariëtte C. Wessels:
A Grid-Based Approximation Algorithm for the Minimum Weight Triangulation Problem. 101-120 - Hsien-Chih Chang, Jeff Erickson, David Letscher, Arnaud de Mesmay, Saul Schleimer, Eric Sedgwick, Dylan Thurston, Stephan Tillmann:
Tightening Curves on Surfaces via Local Moves. 121-135 - Mateus de Oliveira Oliveira:
A Near-Quadratic Lower Bound for the Size of Quantum Circuits of Constant Treewidth. 136-145 - Peter Clifford, Raphaël Clifford:
The Classical Complexity of Boson Sampling. 146-155 - Kunal Agrawal, Joseph Devietti, Jeremy T. Fineman, I-Ting Angelina Lee, Robert Utterback, Changming Xu:
Race Detection and Reachability in Nearly Series-Parallel DAGs. 156-171 - Daniel Gonçalves, Lucas Isenmann, Claire Pennarun:
Planar Graphs as L-intersection or L-contact graphs. 172-184 - Daniel Lokshtanov, Amer E. Mouawad:
The complexity of independent set reconfiguration on bipartite graphs. 185-195 - Chenglin Fan, Benjamin Raichel, Gregory Van Buskirk:
Metric Violation Distance: Hardness and Approximation. 196-209 - Ross Churchley, Bojan Mohar:
A submodular measure and approximate Gomory-Hu theorem for packing odd trails. 210-218 - Nikola Yolov:
Minor-matching hypertree width. 219-233 - Ken-ichi Kawarabayashi, Benjamin Rossman:
A Polynomial Excluded-Minor Approximation of Treedepth. 234-246 - Daniel Lokshtanov, Ivan Mikhailin, Ramamohan Paturi, Pavel Pudlák:
Beating Brute Force for (Quantified) Satisfiability of Circuits of Bounded Treewidth. 247-261 - Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi:
Cliquewidth III: The Odd Case of Graph Coloring Parameterized by Cliquewidth. 262-273 - Hugo A. Akitaya, Radoslav Fulek, Csaba D. Tóth:
Recognizing Weak Embeddings of Graphs. 274-292 - Yutaro Yamaguchi, Takanori Maehara:
Stochastic Packing Integer Programs with Few Queries. 293-310 - Brian Brubach, Karthik Abinav Sankararaman, Aravind Srinivasan, Pan Xu:
Algorithms to Approximate Column-Sparse Packing Problems. 311-330 - Tien-Nam Le, Daniel Lokshtanov, Saket Saurabh, Stéphan Thomassé, Meirav Zehavi:
Subquadratic Kernels for Implicit 3-Hitting Set and 3-Set Packing Problems. 331-342 - Zhiyi Huang, Xue Zhu:
Near Optimal Jointly Private Packing Algorithms via Dual Multiplicative Weight Update. 343-357 - Chandra Chekuri, Kent Quanrud:
Randomized MWU for Positive LPs. 358-377 - Vincent Cohen-Addad, Varun Kanade, Frederik Mallmann-Trenn, Claire Mathieu:
Hierarchical Clustering: Objective Functions and Algorithms. 378-397 - Zachary Friggstad, Kamyar Khodamoradi, Mohsen Rezapour, Mohammad R. Salavatipour:
Approximation Schemes for Clustering with Outliers. 398-414 - Ehsan Emamjomeh-Zadeh, David Kempe:
Adaptive Hierarchical Clustering Using Ordinal Queries. 415-429 - Vincent Cohen-Addad:
A Fast Approximation Scheme for Low-Dimensional k-Means. 430-440 - Vincent Cohen-Addad, Arnaud de Mesmay, Eva Rotenberg, Alan Roytman:
The Bane of Low-Dimensionality Clustering. 441-456 - Mudabir Kabir Asathulla, Sanjeev Khanna, Nathaniel Lahn, Sharath Raghvendra:
A Faster Algorithm for Minimum-Cost Bipartite Perfect Matching in Planar Graphs. 457-476 - Shay Mozes, Kirill Nikolaev, Yahav Nussbaum, Oren Weimann:
Minimum Cut of Directed Planar Graphs in O(n log log n) Time. 477-494 - Pawel Gawrychowski, Haim Kaplan, Shay Mozes, Micha Sharir, Oren Weimann:
Voronoi Diagrams on Planar Graphs, and Computing the Diameter in Deterministic Õ(n5/3) Time. 495-514 - Pawel Gawrychowski, Shay Mozes, Oren Weimann, Christian Wulff-Nilsen:
Better Tradeoffs for Exact Distance Oracles in Planar Graphs. 515-529 - Amir Abboud, Pawel Gawrychowski, Shay Mozes, Oren Weimann:
Near-Optimal Compression for the Planar Graph Metric. 530-549 - J. Ian Munro, Corwin Sinnamon:
Time and Space Efficient Representations of Distributive Lattices. 550-567 - Joe Sawada, Aaron Williams:
A Hamilton Path for the Sigma-Tau Problem. 568-575 - Flavio Chierichetti, Ravi Kumar, Andrew Tomkins:
Discrete Choice, Permutations, and Reconstruction. 576-586 - Vahab S. Mirrokni, Mikkel Thorup, Morteza Zadimoghaddam:
Consistent Hashing with Bounded Loads. 587-604 - David Durfee, Matthew Fahrbach, Yu Gao, Tao Xiao:
Nearly Tight Bounds for Sandpile Transience on the Grid. 605-624 - Venkatesan Guruswami, Ray Li:
Coding against deletions in oblivious and online models. 625-643 - Atri Rudra, Mary Wootters:
Average-radius list-recoverability of random linear codes. 644-662 - Pooya Hatami, Madhur Tulsiani:
Approximate Local Decoding of Cubic Reed-Muller Codes Beyond the List Decoding Radius. 663-679 - Swastik Kopparty, Aditya Potukuchi:
Syndrome decoding of Reed-Muller codes and tensor decomposition over finite fields. 680-691 - Brynmor Chapman:
The Gotsman-Linial Conjecture is False. 692-699 - Soheil Ehsani, MohammadTaghi Hajiaghayi, Thomas Kesselheim, Sahil Singla:
Prophet Secretary for Combinatorial Auctions and Matroids. 700-714 - José A. Soto, Abner Turkieltaub, Victor Verdugo:
Strong Algorithms for the Ordinal Matroid Secretary Problem. 715-734 - Moran Feldman, Ola Svensson, Rico Zenklusen:
A Framework for the Secretary Problem on the Intersection of Matroids. 735-752 - Nikhil R. Devanur, Balasubramanian Sivan, Vasilis Syrgkanis:
Truthful Multi-Parameter Auctions with Online Supply: an Impossible Combination. 753-769 - Aaron Sidford, Mengdi Wang, Xian Wu, Yinyu Ye:
Variance Reduced Value Iteration and Faster Algorithms for Solving Markov Decision Processes. 770-787 - Alfonso Cevallos, Stefan Weltge, Rico Zenklusen:
Lifting Linear Extension Complexity Bounds to the Mixed-Integer Setting. 788-807 - Friedrich Eisenbrand, Robert Weismantel:
Proximity results and faster algorithms for Integer Programming using the Steinitz Lemma. 808-816 - Samuel Fiorini, Martin Groß, Jochen Könemann, Laura Sanità:
Approximating Weighted Tree Augmentation via Chvátal-Gomory Cuts. 817-831 - Daniel Dadush, László A. Végh, Giacomo Zambelli:
Geometric Rescaling Algorithms for Submodular Function Minimization. 832-848 - Martin Nägele, Benny Sudakov, Rico Zenklusen:
Submodular Minimization Under Congruency Constraints. 849-866 - Mathias Bæk Tejs Knudsen, Mikkel Thorup:
The Entropy of Backwards Analysis. 867-880 - Timothy M. Chan:
More Logarithmic-Factor Speedups for 3SUM, (median, +)-Convolution, and Some Geometric 3SUM-Hard Problems. 881-897 - Peyman Afshani, Anne Driemel:
On the complexity of range searching among curves. 898-917 - Sariel Har-Peled, Mitchell Jones:
On Separating Points by Lines. 918-932 - Louigi Addario-Berry, Omer Angel, Guillaume Chapuy, Éric Fusy, Christina Goldschmidt:
Voronoi tessellations in the CRT and continuum random maps of finite excess. 933-946 - Aaron Bernstein, Jacob Holm, Eva Rotenberg:
Online Bipartite Matching with Amortized Replacements. 947-959 - Ilan Reuven Cohen, David Wajc:
Randomized Online Matching in Regular Graphs. 960-979 - Yossi Azar, Ilan Reuven Cohen, Debmalya Panigrahi:
Randomized Algorithms for Online Vector Load Balancing. 980-991 - Nikhil Bansal, Marek Eliás, Grigorios Koumoutsos, Jesper Nederlof:
Competitive Algorithms for Generalized k-Server in Uniform Metrics. 992-1001 - Harry Lang:
Online Facility Location against a t-Bounded Adversary. 1002-1014 - Nima Anari, Shayan Oveis Gharan, Amin Saberi, Nikhil Srivastava:
Approximating the Largest Root and Applications to Interlacing Families. 1015-1028 - Francois Le Gall, Florent Urrutia:
Improved Rectangular Matrix Multiplication using Powers of the Coppersmith-Winograd Tensor. 1029-1046 - Chloe Ching-Yun Hsu, Chris Umans:
A fast generalized DFT for finite groups of Lie type. 1047-1059 - Christopher De Sa, Albert Gu, Rohan Puttagunta, Christopher Ré, Atri Rudra:
A Two-pronged Progress in Structured Dense Matrix Vector Multiplication. 1060-1079 - Radu Curticapean, Nathan Lindzey, Jesper Nederlof:
A Tight Lower Bound for Counting Hamiltonian Cycles via Matrix Rank. 1080-1099 - Donald R. Sheehy:
Fréchet-Stable Signatures Using Persistence Homology. 1100-1108 - Amir Nayyeri, Hanzhong Xu:
On the Decidability of the Fréchet Distance between Surfaces. 1109-1120 - Erin Wolf Chambers, Arnaud de Mesmay, Tim Ophelders:
On the complexity of optimal homotopies. 1121-1134 - Marek Filakovský, Peter Franek, Uli Wagner, Stephan Zhechev:
Computing Simplicial Representatives of Homotopy Group Elements. 1135-1151 - Samir Chowdhury, Facundo Mémoli:
Persistent Path Homology of Directed Networks. 1152-1169 - Mahdi Boroujeni, Soheil Ehsani, Mohammad Ghodsi, Mohammad Taghi Hajiaghayi, Saeed Seddighin:
Approximating Edit Distance in Truly Subquadratic Time: Quantum and MapReduce. 1170-1189 - Karl Bringmann, Pawel Gawrychowski, Shay Mozes, Oren Weimann:
Tree Edit Distance Cannot be Computed in Strongly Subcubic Time (unless APSP can). 1190-1206 - Ryan Williams:
On the Difference Between Closest, Furthest, and Orthogonal Pairs: Nearly-Linear vs Barely-Subquadratic Complexity. 1207-1215 - Karl Bringmann, Marvin Künnemann:
Multivariate Fine-Grained Complexity of Longest Common Subsequence. 1216-1235 - Andrea Lincoln, Virginia Vassilevska Williams, R. Ryan Williams:
Tight Hardness for Shortest Cycles and Paths in Sparse Graphs. 1236-1252 - Nikhil Bansal, Martin Böhm, Marek Eliás, Grigorios Koumoutsos, Seeun William Umboh:
Nested Convex Bodies are Chaseable. 1253-1260 - Clifford Stein, Mingxian Zhong:
Scheduling When You Don't Know the Number of Machines. 1261-1273 - Anupam Gupta, Amit Kumar, Viswanath Nagarajan, Xiangkun Shen:
Stochastic Load Balancing on Unrelated Machines. 1274-1285 - Anindya De:
Boolean function analysis meets stochastic optimization: An approximation scheme for stochastic knapsack. 1286-1305 - Nikhil Srivastava, Luca Trevisan:
An Alon-Boppana Type Bound for Weighted Graphs and Lowerbounds for Spectral Sparsification. 1306-1315 - Arnaud de Mesmay, Yo'av Rieck, Eric Sedgwick, Martin Tancer:
Embeddability in ℝ3 is NP-hard. 1316-1329 - Daniel Dadush, Cristóbal Guzmán, Neil Olver:
Fast, Deterministic and Sparse Dimensionality Reduction. 1330-1344 - Assaf Naor, Gilles Pisier, Gideon Schechtman:
Impossibility of dimension reduction in the nuclear norm. 1345-1352 - Yun Kuen Cheung:
Steiner Point Removal - Distant Terminals Don't (Really) Bother. 1353-1360 - Arnold Filtser:
Steiner Point Removal with Distortion O(log k). 1361-1373 - Jakub Pachocki, Liam Roditty, Aaron Sidford, Roei Tov, Virginia Vassilevska Williams:
Approximating Cycles in Directed Graphs: Fast Algorithms for Girth and Roundtrip Spanners. 1374-1392 - Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, Vivek Madan:
A tight -approximation for Linear 3-Cut. 1393-1406 - Amey Bhangale, Subhash Khot, Swastik Kopparty, Sushant Sachdeva, Devanathan Thiruvenkatachari:
Near-optimal approximation algorithm for simultaneous Max-Cut. 1407-1425 - Karthekeyan Chandrasekaran, Chao Xu, Xilin Yu:
Hypergraph k-Cut in Randomized Polynomial Time. 1426-1438 - Vincent Cohen-Addad, Éric Colin de Verdière, Arnaud de Mesmay:
A Near-Linear Approximation Scheme for Multicuts of Embedded Graphs with a Fixed Number of Terminals. 1439-1458 - Travis Gagie, Gonzalo Navarro, Nicola Prezza:
Optimal-Time Text Indexing in BWT-runs Bounded Space. 1459-1477 - Guillaume Lagarde, Sylvain Perifel:
Lempel-Ziv: a "one-bit catastrophe" but not a tragedy. 1478-1495 - Nicola Prezza:
In-Place Sparse Suffix Sorting. 1496-1508 - Pawel Gawrychowski, Adam Karczmarz, Tomasz Kociumaka, Jakub Lacki, Piotr Sankowski:
Optimal Dynamic Strings. 1509-1528 - Eldar Fischer, Frédéric Magniez, Tatiana Starikovskaya:
Improved bounds for testing Dyck languages. 1529-1544 - Shachar Lovett, Sankeerth Rao, Alexander Vardy:
Probabilistic Existence of Large Sets of Designs. 1545-1556 - Nicholas J. A. Harvey, Piyush Srivastava, Jan Vondrák:
Computing the Independence Polynomial: from the Tree Threshold down to the Roots. 1557-1576 - Aaron Schild, Satish Rao, Nikhil Srivastava:
Localization of Electrical Flows. 1577-1584 - Makrand Sinha:
Lower Bounds for Approximating the Matching Polytope. 1585-1604 - Cameron Musco, Christopher Musco, Aaron Sidford:
Stability of the Lanczos Method for Matrix Function Approximation. 1605-1624 - David Kempe, Leonard J. Schulman, Omer Tamuz:
Quasi-regular sequences and optimal schedules for security games. 1625-1644 - Stephen Alstrup, Agelos Georgakopoulos, Eva Rotenberg, Carsten Thomassen:
A Hamiltonian Cycle in the Square of a 2-connected Graph in Linear Time. 1645-1649 - Ittai Abraham, Shiri Chechik, Michael Elkin, Arnold Filtser, Ofer Neiman:
Ramsey Spanning Trees and their Applications. 1650-1664 - Eun Jung Kim, O-joung Kwon:
Erdős-Pósa property of chordless cycles and its applications. 1665-1684 - Zdenek Dvorák:
Thin graph classes and polynomial-time approximation schemes. 1685-1701 - Anna Ben-Hamou, Roberto I. Oliveira, Yuval Peres:
Estimating graph parameters via random walks with restarts. 1702-1714 - Petra Berenbrink, George Giakkoupis, Peter Kling:
Tight Bounds for Coalescing-Branching Random Walks on Regular Graphs. 1715-1733 - Anna Ben-Hamou, Eyal Lubetzky, Yuval Peres:
Comparing mixing times on sparse random graphs. 1734-1740 - Pu Gao, Nicholas C. Wormald:
Uniform generation of random graphs with power-law degree sequences. 1741-1758 - Charilaos Efthymiou, Thomas P. Hayes, Daniel Stefankovic, Eric Vigoda:
Sampling Random Colorings of Sparse Random Graphs. 1759-1771 - Jacob Focke, Leslie Ann Goldberg, Stanislav Zivný:
The Complexity of Counting Surjective Homomorphisms and Compactions. 1772-1781 - Joshua Brakensiek, Venkatesan Guruswami:
Promise Constraint Satisfaction: Structure Theory and a Symmetric Boolean Dichotomy. 1782-1801 - Jin-Yi Cai, Pinyan Lu, Mingji Xia:
Dichotomy for Real Holantc Problems. 1802-1821 - Shachar Lovett, Avishay Tal, Jiapeng Zhang:
The Robust Sensitivity of Boolean Functions. 1822-1833 - Badih Ghazi, T. S. Jayram:
Resource-Efficient Common Randomness and Secret-Key Schemes. 1834-1853 - Vera Traub, Jens Vygen:
Approaching for the s-t-path TSP. 1854-1864 - Amir Abboud, Greg Bodwin:
Reachability Preservers: New Extremal Bounds and Approximation Algorithms. 1865-1883 - Greg Bodwin, Michael Dinitz, Merav Parter, Virginia Vassilevska Williams:
Optimal Vertex Fault Tolerant Spanners (for fixed stretch). 1884-1900 - Surender Baswana, Keerti Choudhary, Moazzam Hussain, Liam Roditty:
Approximate Single Source Fault Tolerant Shortest Path. 1901-1915 - Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh:
When Recursion is Better than Iteration: A Linear-Time Algorithm for Acyclicity with Few Error Vertices. 1916-1933 - Nobutaka Shimizu:
The Diameter of Dense Random Regular Graphs. 1934-1944 - Grant Schoenebeck, Fang-Yi Yu:
Consensus of Interacting Particle Systems on Erdös-Rényi Graphs. 1945-1964 - Antonio Blanca, Pietro Caputo, Alistair Sinclair, Eric Vigoda:
Spatial Mixing and Non-local Markov chains. 1965-1980 - Reza Gheissari, Eyal Lubetzky, Yuval Peres:
Exponentially slow mixing in the mean-field Swendsen-Wang dynamics. 1981-1988 - Constantinos Daskalakis, Nishanth Dikkala, Gautam Kamath:
Testing Ising Models. 1989-2007 - Siqi Liu, Christos-Alexandros Psomas:
On the Competition Complexity of Dynamic Mechanism Design. 2008-2025 - Raghuvansh R. Saxena, Ariel Schvartzman, S. Matthew Weinberg:
The menu complexity of "one-and-a-half-dimensional" mechanism design. 2026-2035 - Xi Chen, George Matikas, Dimitris Paparas, Mihalis Yannakakis:
On the Complexity of Simple and Optimal Deterministic Mechanisms for an Additive Buyer. 2036-2049 - Shuchi Chawla, Kira Goldner, J. Benjamin Miller, Emmanouil Pountourakis:
Revenue Maximization with an Uncertainty-Averse Buyer. 2050-2068 - Nick Gravin, Pinyan Lu:
Separation in Correlation-Robust Monopolist Problem with Budget. 2069-2080 - Talya Eden, Reut Levi, Dana Ron:
Testing bounded arboricity. 2081-2092 - Omri Ben-Eliezer, Clément L. Canonne:
Improved Bounds for Testing Forbidden Order Patterns. 2093-2112 - Eric Blais, Clément L. Canonne, Talya Eden, Amit Levi, Dana Ron:
Tolerant Junta Testing and the Connection to Submodular Optimization and Function Isomorphism. 2113-2132 - Hadley Black, Deeparnab Chakrabarty, C. Seshadhri:
A o(d) · polylog n Monotonicity Tester for Boolean Functions over the Hypergrid [n]d. 2133-2151 - Manuela Fischer, Andreas Noever:
Tight Analysis of Parallel Randomized Greedy MIS. 2152-2160 - David G. Harris:
Derandomized concentration bounds for polynomials, and hypergraph maximal independent set. 2161-2180 - Abishek Sankararaman, François Baccelli:
Community Detection on Euclidean Random Graphs. 2181-2200 - T.-H. Hubert Chan, Yue Guo, Wei-Kai Lin, Elaine Shi:
Cache-Oblivious and Data-Oblivious Sorting and Applications. 2201-2220 - Dan Alistarh, James Aspnes, Rati Gelashvili:
Space-Optimal Majority in Population Protocols. 2221-2239 - Mohit Singh, Weijun Xie:
Approximate Positive Correlated Distributions and Approximation Algorithms for D-optimal Design. 2240-2255 - Mark Braverman, Jieming Mao, S. Matthew Weinberg:
On Simultaneous Two-player Combinatorial Auctions. 2256-2273 - Nima Anari, Tung Mai, Shayan Oveis Gharan, Vijay V. Vazirani:
Nash Social Welfare for Indivisible Items under Separable, Piecewise-Linear Concave Utilities. 2274-2290 - Soheil Behnezhad, Avrim Blum, Mahsa Derakhshan, Mohammad Taghi Hajiaghayi, Mohammad Mahdian, Christos H. Papadimitriou, Ronald L. Rivest, Saeed Seddighin, Philip B. Stark:
From Battlefields to Elections: Winning Strategies of Blotto and Auditing Games. 2291-2310 - Nikhil R. Devanur, Jugal Garg, Ruta Mehta, Vijay V. Vazirani, Sadra Yazdanbod:
A New Class of Combinatorial Markets with Covering Constraints: Algorithms and Applications. 2311-2325 - Jugal Garg, Martin Hoefer, Kurt Mehlhorn:
Approximating the Nash Social Welfare with Budget-Additive Valuations. 2326-2340 - Krishnendu Chatterjee, Wolfgang Dvorák, Monika Henzinger, Veronika Loitzenbauer:
Lower Bounds for Symbolic Computation on Graphs: Strongly Connected Components, Liveness, Safety, and Diameter. 2341-2356 - Gábor Ivanyos, Youming Qiao:
Algorithms based on *-algebras, and their applications to isomorphism of polynomials with one secret, group isomorphism, and polynomial identity testing. 2357-2376 - Huan Li, Zhongzhi Zhang:
Kirchhoff Index as a Measure of Edge Centrality in Weighted Networks: Nearly Linear Time Algorithms. 2377-2396 - Chaya Keller, Shakhar Smorodinsky:
Conflict-Free Coloring of Intersection Graphs of Geometric Objects. 2397-2411 - Sepehr Assadi, Sanjeev Khanna:
Tight Bounds on the Round Complexity of the Distributed Maximum Coverage Problem. 2412-2431 - Jaroslaw Blasiok:
Optimal streaming and tracking distinct elements with high probability. 2432-2448 - Pan Peng, Christian Sohler:
Estimating Graph Parameters from Random Order Streams. 2449-2466 - Piotr Indyk, Sepideh Mahabadi, Ronitt Rubinfeld, Ali Vakilian, Anak Yodpinyanee:
Set Cover in Sub-linear Time. 2467-2486 - Arun Jambulapati, Aaron Sidford:
Efficient Õ(n/∊) Spectral Sketches for the Laplacian and its Pseudoinverse. 2487-2503 - Xi Chen, Yuanzhi Li, Jieming Mao:
A Nearly Instance Optimal Algorithm for Top-k Ranking under the Multinomial Logit Model. 2504-2522 - Sahil Singla:
The Price of Information in Combinatorial Optimization. 2523-2532 - Hu Fu, Christopher Liaw, Pinyan Lu, Zhihao Gavin Tang:
The Value of Information Concealment. 2533-2544 - Ashwinkumar Badanidiyuru, Kshipra Bhawalkar, Haifeng Xu:
Targeting and Signaling in Ad Auctions. 2545-2563 - Sina Dehghani, Alireza Farhadi, Mohammad Taghi Hajiaghayi, Hadi Yami:
Envy-free Chore Division for An Arbitrary Number of Agents. 2564-2583 - Benjamin Plaut, Tim Roughgarden:
Almost Envy-Freeness with General Valuations. 2584-2603 - Pawel Gawrychowski, Fabian Kuhn, Jakub Lopuszanski, Konstantinos Panagiotou, Pascal Su:
Labeling Schemes for Nearest Common Ancestors through Minor-Universal Trees. 2604-2619 - Tomasz Jurdzinski, Krzysztof Nowicki:
MST in O(1) Rounds of Congested Clique. 2620-2632 - Yi-Jun Chang, Qizheng He, Wenzheng Li, Seth Pettie, Jara Uitto:
The Complexity of Distributed Edge Coloring with Small Palettes. 2633-2652 - Leszek Gasieniec, Grzegorz Stachowiak:
Fast Space Optimal Leader Election in Population Protocols. 2653-2667 - Adrian Kosowski, Przemyslaw Uznanski:
Ergodic Effects in Token Circulation. 2668-2682 - Ilias Diakonikolas, Gautam Kamath, Daniel M. Kane, Jerry Li, Ankur Moitra, Alistair Stewart:
Robustly Learning a Gaussian: Getting Optimal Error, Efficiently. 2683-2702 - Panayotis Mertikopoulos, Christos H. Papadimitriou, Georgios Piliouras:
Cycles in Adversarial Regularized Learning. 2703-2717 - Jeff M. Phillips, Wai Ming Tai:
Improved Coresets for Kernel Density Estimates. 2718-2727 - Anindya De, Elchanan Mossel, Joe Neeman:
Non interactive simulation of correlated distributions is decidable. 2728-2746 - Constantinos Daskalakis, Gautam Kamath, John Wright:
Which Distribution Distances are Sublinearly Testable? 2747-2764 - David Coudert, Guillaume Ducoffe, Alexandru Popa:
Fully polynomial FPT algorithms for some classes of bounded clique-width graphs. 2765-2784 - Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Roohani Sharma, Meirav Zehavi:
Covering Small Independent Sets and Separators with Applications to Parameterized Algorithms. 2785-2800 - Lin Chen, Dániel Marx:
Covering a tree with rooted subtrees - parameterized and approximation algorithms. 2801-2820 - Anupam Gupta, Euiwoong Lee, Jason Li:
An FPT Algorithm Beating 2-Approximation for k-Cut. 2821-2837 - Jørgen Bang-Jensen, Manu Basavaraju, Kristine Vitting Klinkby, Pranabendu Misra, M. S. Ramanujan, Saket Saurabh, Meirav Zehavi:
Parameterized Algorithms for Survivable Network Design with Uniform Demands. 2838-2850
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2026-02-09 22:04 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
