| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Eun Jung Kim 0002, Stefan Kratsch, Marcin Pilipczuk, Magnus Wahlström |
Solving hard cut problems via flow-augmentation.  |
SODA  |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | David Steurer, Stefan Tiegel |
SoS Degree Reduction with Applications to Clustering and Robust Moment Estimation. |
SODA |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel Lokshtanov, Pranabendu Misra, M. S. Ramanujan 0001, Saket Saurabh 0001, Meirav Zehavi |
FPT-approximation for FPT Problems. |
SODA |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Chaim Even-Zohar, Calvin Leng |
Counting Small Permutation Patterns. |
SODA |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Timothy M. Chan |
(Near-)Linear-Time Randomized Algorithms for Row Minima in Monge Partial Matrices and Related Problems. |
SODA |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Grzegorz Gluch, Michael Kapralov, Silvio Lattanzi, Aida Mousavifar, Christian Sohler |
Spectral Clustering Oracles in Sublinear Time. |
SODA |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Stefan Walzer |
Peeling Close to the Orientability Threshold - Spatial Coupling in Hashing-Based Data Structures. |
SODA |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Nicola Prezza |
On Locating Paths in Compressed Tries. |
SODA |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Arturo I. Merino, Ondrej Micka, Torsten Mütze |
On a combinatorial generation problem of Knuth. |
SODA |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Marcel de Sena Dall'Agnol, Tom Gur, Oded Lachish |
A Structural Theorem for Local Algorithms with Applications to Coding, Testing, and Privacy. |
SODA |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Hendrik Fichtenberger, Silvio Lattanzi, Ashkan Norouzi-Fard, Ola Svensson |
Consistent k-Clustering for General Metrics. |
SODA |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Sébastien Bubeck, Yuval Rabani, Mark Sellke |
Online Multiserver Convex Chasing and Optimization. |
SODA |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Thomas Bläsius, Tobias Friedrich 0001, Andreas Göbel 0001, Jordi Levy, Ralf Rothenberger |
The Impact of Heterogeneity and Geometry on the Proof Complexity of Random Satisfiability. |
SODA |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Santiago R. Balseiro, Vahab S. Mirrokni, Renato Paes Leme, Song Zuo |
Non-Excludable Dynamic Mechanism Design. |
SODA |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Édouard Bonnet, Colin Geniet, Eun Jung Kim 0002, Stéphan Thomassé, Rémi Watrigant |
Twin-width II: small classes. |
SODA |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Sidhanth Mohanty, Ryan O'Donnell |
X-Ramanujan graphs. |
SODA |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh 0001, Meirav Zehavi |
Approximation Schemes via Width/Weight Trade-offs on Minor-free Graphs. |
SODA |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Sarah Cannon, Will Perkins 0001 |
Counting independent sets in unbalanced bipartite graphs. |
SODA |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Claire Mathieu, Simon Mauras |
How to aggregate Top-lists: Approximation algorithms via scores and average ranks. |
SODA |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Maximilian Probst Gutenberg, Christian Wulff-Nilsen |
Deterministic Algorithms for Decremental Approximate Shortest Paths: Faster and Simpler. |
SODA |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | John Augustine, Kristian Hinnenthal, Fabian Kuhn, Christian Scheideler, Philipp Schneider |
Shortest Paths in a Hybrid Network Model. |
SODA |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Elkin, Ofer Neiman |
Lossless Prioritized Embeddings. |
SODA |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Sungjin Im, Maryam Shadloo |
Weighted Completion Time Minimization for Unrelated Machines via Iterative Fair Contention Resolution. |
SODA |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Sami Davies, Thomas Rothvoss, Yihao Zhang |
A Tale of Santa Claus, Hypergraphs and Matroids. |
SODA |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Marcin Wrochna, Stanislav Zivný |
Improved hardness for H-colourings of G-colourable graphs. |
SODA |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Maria Chudnovsky, Marcin Pilipczuk, Michal Pilipczuk, Stéphan Thomassé |
Quasi-polynomial time approximation schemes for the Maximum Weight Independent Set Problem in H-free graphs. |
SODA |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Lech Duraj, Krzysztof Kleiner, Adam Polak 0001, Virginia Vassilevska Williams |
Equivalences between triangle and range query problems. |
SODA |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Heng Guo 0001, Jingcheng Liu 0001, Pinyan Lu |
Zeros of ferromagnetic 2-spin systems. |
SODA |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Yonina C. Eldar, Jerry Li 0001, Cameron Musco, Christopher Musco |
Sample Efficient Toeplitz Covariance Estimation. |
SODA |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Antonios Antoniadis 0001, Naveen Garg 0001, Gunjan Kumar, Nikhil Kumar 0001 |
Parallel Machine Scheduling to Minimize Energy Consumption. |
SODA |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Arnold Filtser |
A face cover perspective to ℓ1 embeddings of planar graphs. |
SODA |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | T.-H. Hubert Chan, Zhibin Liang, Antigoni Polychroniadou, Elaine Shi |
Small Memory Robust Simulation of Client-Server Interactive Protocols over Oblivious Noisy Channels. |
SODA |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Xue Chen 0001, Anindya De |
Reconstruction under outliers for Fourier-sparse functions. |
SODA |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Anupam Gupta 0001, Roie Levin |
The Online Submodular Cover Problem. |
SODA |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Pasin Manurangsi |
Tight Running Time Lower Bounds for Strong Inapproximability of Maximum k-Coverage, Unique Set Cover and Related Problems (via t-Wise Agreement Testing Theorem). |
SODA |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Brian Axelrod, Yang P. Liu, Aaron Sidford |
Near-optimal Approximate Discrete and Continuous Submodular Function Minimization. |
SODA |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Hiêp Hàn, Jie Han 0002, Patrick Morris 0001 |
Factors and loose Hamilton cycles in sparse pseudo-random hypergraphs. |
SODA |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Elizabeth Hartung, Hung Phuc Hoang, Torsten Mütze, Aaron Williams |
Combinatorial generation via permutation languages. |
SODA |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Rasmus Kyng, Di Wang 0005, Peng Zhang 0052 |
Packing LPs are Hard to Solve Accurately, Assuming Linear Equations are Hard. |
SODA |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Dütting, Tim Roughgarden, Inbal Talgam-Cohen |
The Complexity of Contracts. |
SODA |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Amir Abboud, Robert Krauthgamer, Ohad Trabelsi |
New Algorithms and Lower Bounds for All-Pairs Max-Flow in Undirected Graphs. |
SODA |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Anand Kumar Narayanan, Matthew Weidner |
On Decoding Cohen-Haeupler-Schulman Tree Codes. |
SODA |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Sándor Kisfaludi-Bak |
Hyperbolic intersection graphs and (quasi)-polynomial time. |
SODA |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Jason D. Hartline, Aleck C. Johnsen, Denis Nekipelov, Zihe Wang 0001 |
Inference from Auction Prices. |
SODA |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Moni Naor, Merav Parter, Eylon Yogev |
The Power of Distributed Verifiers in Interactive Proofs. |
SODA |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Virginia Vassilevska Williams, Yinzhan Xu |
Truly Subcubic Min-Plus Product for Less Structured Matrices, with Applications. |
SODA |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | William Kuszmaul |
Achieving Optimal Backlog in the Vanilla Multi-Processor Cup Game. |
SODA |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Guillaume Ducoffe, Michel Habib, Laurent Viennot |
Diameter computation on H-minor free graphs and graphs of bounded (distance) VC-dimension. |
SODA |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Pan Peng 0001 |
Robust Clustering Oracle and Local Reconstructor of Cluster Structure of Graphs. |
SODA |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Sébastien Bubeck, Bo'az Klartag, Yin Tat Lee, Yuanzhi Li, Mark Sellke |
Chasing Nested Convex Bodies Nearly Optimally. |
SODA |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Fabian Kuhn |
Faster Deterministic Distributed Coloring Through Recursive List Coloring. |
SODA |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Prasad Raghavendra, Morris Yau |
List Decodable Learning via Sum of Squares. |
SODA |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Dawei Huang, Seth Pettie, Yixiang Zhang, Zhijun Zhang 0007 |
The Communication Complexity of Set Intersection and Multiple Equality Testing. |
SODA |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Sayan Bhattacharya, Danupon Nanongkai, Thatchaphol Saranurak |
Coarse-Grained Complexity for Dynamic Algorithms. |
SODA |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Hsien-Chih Chang, Arnaud de Mesmay |
Tightening Curves on Surfaces Monotonically with Applications. |
SODA |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | |
Front Matter. |
SODA |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Noah Golowich, Madhu Sudan 0001 |
Round Complexity of Common Randomness Generation: The Amortized Setting. |
SODA |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Yi Li 0002, Ruosong Wang, David P. Woodruff |
Tight Bounds for the Subspace Sketch Problem with Applications. |
SODA |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Ramesh Krishnan S. Pallavoor, Sofya Raskhodnikova, Erik Waingarten |
Approximating the Distance to Monotonicity of Boolean Functions. |
SODA |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Janardhan Kulkarni, Shi Li 0001, Jakub Tarnawski, Minwei Ye |
Hierarchy-Based Algorithms for Minimizing Makespan under Precedence and Communication Constraints. |
SODA |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Per Austrin, Amey Bhangale, Aditya Potukuchi |
Improved Inapproximability of Rainbow Coloring. |
SODA |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Piotr Krysta, Mathieu Mari, Nan Zhi |
Ultimate greedy approximation of independent sets in subcubic graphs. |
SODA |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Keerti Choudhary, Omer Gold |
Extremal Distances in Directed Graphs: Tight Spanners and Near-Optimal Approximation Algorithms. |
SODA |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Timothy M. Chan, Yakov Nekrich |
Better Data Structures for Colored Orthogonal Range Reporting. |
SODA |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Marek Filakovský, Uli Wagner 0001, Stephan Zhechev |
Embeddability of Simplicial Complexes is Undecidable. |
SODA |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Kapralov, Aida Mousavifar, Cameron Musco, Christopher Musco, Navid Nouri, Aaron Sidford, Jakab Tardos |
Fast and Space Efficient Spectral Sparsification in Dynamic Streams. |
SODA |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel Hader, Aaron Koch, Matthew J. Patitz, Michael Sharp |
The Impacts of Dimensionality, Diffusion, and Directedness on Intrinsic Universality in the abstract Tile Assembly Model. |
SODA |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Julien Baste, Ignasi Sau, Dimitrios M. Thilikos |
A complexity dichotomy for hitting connected minors on bounded treewidth graphs: the chair and the banner draw the boundary. |
SODA |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Anders Martinsson, Jara Uitto |
Navigating an Infinite Space with Unreliable Movements. |
SODA |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Talya Eden, Dana Ron, C. Seshadhri 0001 |
Faster sublinear approximation of the number of k-cliques in low-arboricity graphs. |
SODA |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Rahul Arya, Sunil Arya, Guilherme Dias da Fonseca, David M. Mount |
Optimal Bound on the Combinatorial Complexity of Approximating Polytopes. |
SODA |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Dhruv Rohatgi |
Near-Optimal Bounds for Online Caching with Machine Learned Advice. |
SODA |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Victor Reis, Thomas Rothvoss |
Linear Size Sparsifier and the Geometry of the Operator Norm Ball. |
SODA |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Kasper Green Larsen, Tal Malkin, Omri Weinstein, Kevin Yeo |
Lower Bounds for Oblivious Near-Neighbor Search. |
SODA |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Arnold Filtser, Lee-Ad Gottlieb, Robert Krauthgamer |
Labelings vs. Embeddings: On Distributed Representations of Distances. |
SODA |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Christopher Jung 0001, Sampath Kannan, Neil Lutz |
Quantifying the Burden of Exploration and the Unfairness of Free Riding. |
SODA |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Abhimanyu Das, Sreenivas Gollapudi, Ravi Kumar 0001, Rina Panigrahy |
On the Learnability of Random Deep Networks. |
SODA |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Alireza Farhadi 0001, Mohammad Taghi Hajiaghayi, Tung Mai, Anup Rao 0002, Ryan A. Rossi |
Approximate Maximum Matching in Random Streams. |
SODA |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Maximilian Probst Gutenberg, Christian Wulff-Nilsen |
Fully-Dynamic All-Pairs Shortest Paths: Improved Worst-Case Time and Space Bounds. |
SODA |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Silvio Lattanzi, Thomas Lavastida, Benjamin Moseley, Sergei Vassilvitskii |
Online Scheduling via Learned Weights. |
SODA |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Christoph Grunau, Slobodan Mitrovic, Ronitt Rubinfeld, Ali Vakilian |
Improved Local Computation Algorithm for Set Cover via Sparsification. |
SODA |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Uri Stemmer |
Locally Private k-Means Clustering. |
SODA |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Erica Blum, Aggelos Kiayias, Cristopher Moore, Saad Quader, Alexander Russell |
The Combinatorics of the Longest-Chain Rule: Linear Consistency for Proof-of-Stake Blockchains. |
SODA |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Soheil Behnezhad, Jakub Lacki, Vahab S. Mirrokni |
Fully Dynamic Matching: Beating 2-Approximation in Δϵ Update Time. |
SODA |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Haifeng Xu |
On the Tractability of Public Persuasion with No Externalities. |
SODA |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Vincent Jugé |
Adaptive Shivers Sort: An Alternative Sorting Algorithm. |
SODA |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Shiri Chechik, Tianyi Zhang 0008 |
Dynamic Low-Stretch Spanning Trees in Subpolynomial Time. |
SODA |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Pu Gao, Mikhail Isaev, Brendan D. McKay |
Sandwiching random regular graphs between binomial random graphs. |
SODA |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Ori Sberlo, Amir Shpilka |
On the Performance of Reed-Muller Codes with respect to Random Errors and Erasures. |
SODA |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Vedat Levi Alev, Fernando Granha Jeronimo, Dylan Quintana, Shashank Srivastava, Madhur Tulsiani |
List Decoding of Direct Sum Codes. |
SODA |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Xiaohui Bei, Xiaoming Sun 0001, Hao Wu, Jialin Zhang 0001, Zhijie Zhang, Wei Zi |
Cake Cutting on Graphs: A Discrete and Bounded Proportional Protocol. |
SODA |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Tamal K. Dey, Tao Hou, Sayan Mandal |
Computing Minimal Persistent Cycles: Polynomial and Hard Cases. |
SODA |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Laxman Dhulipala, David Durfee, Janardhan Kulkarni, Richard Peng, Saurabh Sawlani, Xiaorui Sun |
Parallel Batch-Dynamic Graphs: Algorithms and Lower Bounds. |
SODA |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Ahmad Biniaz |
Euclidean Bottleneck Bounded-Degree Spanning Tree Ratios. |
SODA |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Adrian Dumitrescu, Csaba D. Tóth |
On the Cover of the Rolling Stone. |
SODA |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Marc Roth, Philip Wellnitz |
Counting and Finding Homomorphisms is Universal for Parameterized Complexity Theory. |
SODA |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | C. J. Argue, Anupam Gupta 0001, Guru Guruganesh, Ziye Tang |
Chasing Convex Bodies with Linear Competitive Ratio. |
SODA |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Jason Li 0006, Jesper Nederlof |
Detecting Feedback Vertex Sets of Size k in O*(2.7k) Time. |
SODA |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Rachel Cummings, David Durfee |
Individual Sensitivity Preprocessing for Data Privacy. |
SODA |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Ken-ichi Kawarabayashi, Bingkai Lin |
A nearly 5/3-approximation FPT Algorithm for Min-k-Cut. |
SODA |
2020 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")
data released under the ODC-BY 1.0 license