| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Archontia C. Giannopoulou, Dimitrios M. Thilikos, Sebastian Wiederrecht |
Excluding Single-Crossing Matching Minors in Bipartite Graphs.  |
SODA  |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Daniel Lokshtanov, Giannos Stamoulis |
Shortest Cycles With Monotone Submodular Costs. |
SODA |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Timothy M. Chan |
Finding Triangles and Other Small Subgraphs in Geometric Intersection Graphs. |
SODA |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Oliver Janzer, Benny Sudakov, István Tomon |
Small subgraphs with large average degree. |
SODA |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Xinrui Jia 0001, Ola Svensson, Weiqiang Yuan 0002 |
The Exact Bipartite Matching Polytope Has Exponential Extension Complexity. |
SODA |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Eun Jung Kim 0002, Stefan Kratsch, Marcin Pilipczuk, Magnus Wahlström |
Flow-augmentation III: Complexity dichotomy for Boolean CSPs parameterized by the number of unsatisfied constraints. |
SODA |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Soheil Behnezhad, Mohammad Roghani, Aviad Rubinstein, Amin Saberi |
Beating Greedy Matching in Sublinear Time. |
SODA |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Nikhil Bansal 0001, Viswanath Nagarajan (eds.) |
Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, SODA 2023, Florence, Italy, January 22-25, 2023 |
SODA |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Yakov Nekrich, Saladi Rahul |
4D Range Reporting in the Pointer Machine Model in Almost-Optimal Time. |
SODA |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Avi Cohen, Michal Feldman, Divyarthi Mohan, Inbal Talgam-Cohen |
Interdependent Public Projects. |
SODA |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Jean Cardinal, Hung Phuc Hoang, Arturo I. Merino, Torsten Mütze |
Zigzagging through acyclic orientations of chordal graphs and hypergraphs. |
SODA |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Cole Franks, Tasuku Soma, Michel X. Goemans |
Shrunk subspaces via operator Sinkhorn iteration. |
SODA |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Kyungjin Cho, Eunjin Oh 0001, Seunghyeok Oh |
Parameterized Algorithm for the Disjoint Path Problem on Planar Graphs: Exponential in k2 and Linear in n. |
SODA |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Salwa Faour, Mohsen Ghaffari 0001, Christoph Grunau, Fabian Kuhn, Václav Rozhon |
Local Distributed Rounding: Generalized to MIS, Matching, Set Cover, and Beyond. |
SODA |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Tommaso d'Orsi, Rajai Nasser, Gleb Novikov, David Steurer |
Higher degree sum-of-squares relaxations robust against oblivious outliers. |
SODA |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Anindya De, Shivam Nadimpalli, Rocco A. Servedio |
Testing Convex Truncation. |
SODA |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrew Alseth, Matthew J. Patitz |
The Need for Seed (in the abstract Tile Assembly Model). |
SODA |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Stéphane Bessy, Marin Bougeret, Dimitrios M. Thilikos, Sebastian Wiederrecht |
Kernelization for Graph Packing Problems via Rainbow Matching. |
SODA |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Josh Alman, Yunfeng Guan, Ashwin Padaki |
Smaller Low-Depth Circuits for Kronecker Powers. |
SODA |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Nairen Cao, Jeremy T. Fineman |
Parallel Exact Shortest Paths in Almost Linear Work and Square Root Depth. |
SODA |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Alan M. Frieze, Wesley Pegden |
Subexponential mixing for partition chains on grid-like graphs. |
SODA |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Lucas Pesenti, Adrian Vladu |
Discrepancy Minimization via Regularization. |
SODA |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Monika Henzinger, Jalaj Upadhyay, Sarvagya Upadhyay |
Almost Tight Error Bounds on Differentially Private Continual Counting. |
SODA |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Loukas Georgiadis, Evangelos Kipouridis, Charis Papadopoulos, Nikos Parotsidis |
Faster Computation of 3-Edge-Connected Components in Digraphs. |
SODA |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Mingyang Deng, Xiao Mao, Ziqian Zhong |
On Problems Related to Unbounded SubsetSum: A Unified Combinatorial Approach. |
SODA |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Kapralov, Hannah Lawrence, Mikhail Makarov, Cameron Musco, Kshiteej Sheth |
Toeplitz Low-Rank Approximation with Sublinear Query Complexity. |
SODA |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Leslie Ann Goldberg, John Lapinskas |
Instability of backoff protocols with arbitrary arrival rates. |
SODA |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Sungjin Im, Shi Li 0001 |
Improved Approximations for Unrelated Machine Scheduling. |
SODA |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Robin Kothari, Ryan O'Donnell |
Mean estimation when you have the source code; or, quantum Monte Carlo methods. |
SODA |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Joran van Apeldoorn, Arjan Cornelissen, András Gilyén, Giacomo Nannicini |
Quantum tomography using state-preparation unitaries. |
SODA |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Raphael A. Meyer, Cameron Musco, Christopher Musco, David P. Woodruff, Samson Zhou |
Near-Linear Sample Complexity for Lp Polynomial Regression. |
SODA |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Siu-Wing Cheng, Haoqiang Huang |
Curve Simplification and Clustering under Fréchet Distance. |
SODA |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Yiding Hua, Rasmus Kyng, Maximilian Probst Gutenberg, Zihang Wu |
Maintaining Expander Decompositions via Sparse Cuts. |
SODA |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Binghui Peng, Fred Zhang |
Online Prediction in Sub-linear Space. |
SODA |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Jonas Ellert, Pawel Gawrychowski, Garance Gourdel |
Optimal Square Detection Over General Alphabets. |
SODA |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Michal Koucký 0001, Michael E. Saks |
Simple, deterministic, fast (but weak) approximations to edit distance and Dyck edit distance. |
SODA |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Manuela Fischer, Magnús M. Halldórsson, Yannic Maus |
Fast Distributed Brooks' Theorem. |
SODA |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | François Dross, Krzysztof Fleszar 0001, Karol Wegrzycki, Anna Zych-Pawlewicz |
Gap-ETH-Tight Approximation Schemes for Red-Green-Blue Separation and Bicolored Noncrossing Euclidean Travelling Salesman Tours. |
SODA |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Ivanov, Raghu Meka, Emanuele Viola |
Efficient resilient functions. |
SODA |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | R. Ravi 0001, Weizhong Zhang, Michael Zlatin |
Approximation Algorithms for Steiner Tree Augmentation Problems. |
SODA |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Jun-Ting Hsieh, Pravesh K. Kothari, Sidhanth Mohanty |
A simple and sharper proof of the hypergraph Moore bound. |
SODA |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Kapralov, Akash Kumar 0009, Silvio Lattanzi, Aida Mousavifar |
Learning Hierarchical Cluster Structure of Graphs in Sublinear Time. |
SODA |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Hung Le |
Approximate Distance Oracles for Planar Graphs with Subpolynomial Error Dependency. |
SODA |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Dmitriy Zhuk, Barnaby Martin, Michal Wrona |
The complete classification for quantified equality constraints. |
SODA |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Xiaohui Bei, Nick Gravin, Pinyan Lu, Zhihao Gavin Tang |
Bidder Subset Selection Problem in Auction Design. |
SODA |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Dominik Kempa, Tomasz Kociumaka |
Breaking the n)-Barrier in the Construction of Compressed Suffix Arrays and Suffix Trees. |
SODA |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Shang-En Huang, Seth Pettie, Leqi Zhu |
Byzantine Agreement with Optimal Resilience via Statistical Fraud Detection. |
SODA |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Yeongwoo Hwang, Joe Neeman, Ojas Parekh, Kevin Thompson 0007, John Wright |
Unique Games hardness of Quantum Max-Cut, and a conjectured vector-valued Borell's inequality. |
SODA |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Anupam Gupta 0001, Benjamin Moseley, Rudy Zhou |
Minimizing Completion Times for Stochastic Jobs via Batched Free Times. |
SODA |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Julia Chuzhoy |
A Distanced Matching Game, Decremental APSP in Expanders, and Faster Deterministic Algorithms for Graph Cut Problems. |
SODA |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Shiri Chechik, Tianyi Zhang 0008 |
Faster Deterministic Worst-Case Fully Dynamic All-Pairs Shortest Paths via Decremental Hop-Restricted Shortest Paths. |
SODA |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Anastos |
Fast algorithms for solving the Hamilton Cycle problem with high probability. |
SODA |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Aleksandar Nikolov |
Private Query Release via the Johnson-Lindenstrauss Transform. |
SODA |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Renato Paes Leme, Balasubramanian Sivan, Yifeng Teng, Pratik Worah |
Pricing Query Complexity of Revenue Maximization. |
SODA |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Nikhil Gupta 0008, Chandan Saha 0001, Bhargav Thankey |
Equivalence Test for Read-Once Arithmetic Formulas. |
SODA |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Jacob Holm, Jakub Tetek |
Massively Parallel Computation on Embedded Planar Graphs. |
SODA |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael A. Bender, Alex Conway, Martin Farach-Colton, William Kuszmaul, Guido Tagliavini |
Tiny Pointers. |
SODA |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Argyrios Deligkas, Michail Fasoulakis, Evangelos Markakis |
A Polynomial-Time Algorithm for 1/2-Well-Supported Nash Equilibria in Bimatrix Games. |
SODA |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Corwin Sinnamon, Robert E. Tarjan |
A Tight Analysis of Slim Heaps and Smooth Heaps. |
SODA |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Pallavi Jain 0001, Lawqueen Kanesh, Fahad Panolan, Souvik Saha 0002, Abhishek Sahu, Saket Saurabh 0001, Anannya Upasana |
Parameterized Approximation Scheme for Biclique-free Max k-Weight SAT and Max Coverage. |
SODA |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | MohammadHossein Bateni, Hossein Esfandiari, Hendrik Fichtenberger, Monika Henzinger, Rajesh Jayaram, Vahab Mirrokni, Andreas Wiese |
Optimal Fully Dynamic k-Center Clustering for Adaptive and Oblivious Adversaries. |
SODA |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Lorenzo Ciardo, Stanislav Zivný |
Hierarchies of Minion Tests for PCSPs through Tensors. |
SODA |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Jason Li 0006, Danupon Nanongkai, Debmalya Panigrahi, Thatchaphol Saranurak |
Near-Linear Time Approximations for Cut Problems via Fair Cuts. |
SODA |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Davies |
Improved Distributed Algorithms for the Lovász Local Lemma and Edge Coloring. |
SODA |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Robert Krauthgamer, Ron Mosenzon |
Exact Flow Sparsification Requires Unbounded Size. |
SODA |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Mingyang Deng, Ce Jin 0001, Xiao Mao |
Approximating Knapsack and Partition via Dense Subset Sums. |
SODA |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Michal Dory, Mohsen Ghaffari 0001 |
A Nearly Time-Optimal Distributed Approximation of Minimum Cost k-Edge-Connected Spanning Subgraph. |
SODA |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Mohsen Ghaffari 0001, Christoph Grunau, Bernhard Haeupler, Saeed Ilchi, Václav Rozhon |
Improved Distributed Network Decomposition, Hitting Sets, and Spanners, via Derandomization. |
SODA |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Alkida Balliu, Sebastian Brandt 0002, Fabian Kuhn, Dennis Olivetti |
Distributed Maximal Matching and Maximal Independent Set on Hypergraphs. |
SODA |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Princewill Okoroafor, Vaishnavi Gupta, Robert Kleinberg |
Non-Stochastic CDF Estimation Using Threshold Queries. |
SODA |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Yaonan Jin, Pinyan Lu |
The Price of Stability for First Price Auction. |
SODA |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Tatiana Belova, Alexander Golovnev, Alexander S. Kulikov, Ivan Mihajlin, Denil Sharipov |
Polynomial formulations as a barrier for reduction-based hardness proofs. |
SODA |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Timothy M. Chan, Sariel Har-Peled |
On the Number of Incidences When Avoiding an Induced Biclique in Geometric Settings. |
SODA |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Arjan Cornelissen, Yassine Hamoudi |
A Sublinear-Time Quantum Algorithm for Approximating Partition Functions. |
SODA |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Taihei Oki, Tasuku Soma |
Algebraic Algorithms for Fractional Linear Matroid Parity via Non-commutative Rank. |
SODA |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Dain Kim, Anqi Li, Jonathan Tidor |
Cubic Goldreich-Levin. |
SODA |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Joachim Gudmundsson, Martin P. Seybold, Sampson Wong |
Map matching queries on realistic input graphs under the Fréchet distance. |
SODA |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Gartland, Daniel Lokshtanov |
Graph Classes with Few Minimal Separators. I. Finite Forbidden Induced Subgraphs. |
SODA |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Ngoc Mai Le, Seeun William Umboh, Ningyuan Xie |
The Power of Clairvoyance for Multi-Level Aggregation and Set Cover with Delay. |
SODA |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Klim Efremenko, Bernhard Haeupler, Yael Tauman Kalai, Gillat Kol, Nicolas Resch, Raghuvansh R. Saxena |
Interactive Coding with Small Memory. |
SODA |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Ce Jin 0001, Jakob Nogler |
Quantum Speed-ups for String Synchronizing Sets, Longest Common Substring, and k-mismatch Matching. |
SODA |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Calum MacRury, Will Ma, Nathaniel Grammel |
On (Random-order) Online Contention Resolution Schemes for the Matching Polytope of (Bipartite) Graphs. |
SODA |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Xi Chen 0001, Anindya De, Chin Ho Lee, Rocco A. Servedio, Sandip Sinha |
Approximate Trace Reconstruction from a Single Trace. |
SODA |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Kun He 0011, Qian Li 0012, Xiaoming Sun 0001 |
Moser-Tardos Algorithm: Beyond Shearer's Bound. |
SODA |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Akanksha Agrawal 0001, Lawqueen Kanesh, Daniel Lokshtanov, Fahad Panolan, M. S. Ramanujan 0001, Saket Saurabh 0001, Meirav Zehavi |
Deleting, Eliminating and Decomposing to Hereditary Classes Are All FPT-Equivalent. |
SODA |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Tara Abrishami, Maria Chudnovsky, Cemil Dibek, Pawel Rzazewski |
Polynomial-time algorithm for Maximum Independent Set in bounded-degree graphs with no long induced claws. |
SODA |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Vincent Cohen-Addad, Karthik C. S., Euiwoong Lee |
Johnson Coverage Hypothesis: Inapproximability of k-means and k-median in ℓp-metrics. |
SODA |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Surender Baswana, Abhyuday Pandey |
Sensitivity Oracles for All-Pairs Mincuts. |
SODA |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | C. J. Argue, Anupam Gupta 0001, Marco Molinaro 0001, Sahil Singla 0001 |
Robust Secretary and Prophet Algorithms for Packing Integer Programs. |
SODA |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel Lokshtanov, Fahad Panolan, Saket Saurabh 0001, Jie Xue 0003, Meirav Zehavi |
Subexponential Parameterized Algorithms on Disk Graphs (Extended Abstract). |
SODA |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Benjamin Aram Berendsohn, László Kozma 0002 |
Splay trees on trees. |
SODA |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Haim Kaplan, David Naori, Danny Raz |
Online Weighted Matching with a Sample. |
SODA |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Shimon Kogan, Merav Parter |
New Diameter-Reducing Shortcuts and Directed Hopsets: Breaking the Barrier. |
SODA |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Yossi Azar, Debmalya Panigrahi, Noam Touitou |
Online Graph Algorithms with Predictions. |
SODA |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Soheil Behnezhad, Avrim Blum, Mahsa Derakhshan |
Stochastic Vertex Cover with Few Queries. |
SODA |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Talya Eden, Saleet Mossel, Dana Ron |
Approximating the Arboricity in Sublinear Time. |
SODA |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Haim Kaplan, Robert E. Tarjan, Or Zamir, Uri Zwick |
Simulating a stack using queues. |
SODA |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Nikhil Bansal 0001, Christian Coester, Ravi Kumar 0001, Manish Purohit, Erik Vee |
Learning-Augmented Weighted Paging. |
SODA |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Fabrizio Grandoni 0001, Tobias Mömke, Andreas Wiese |
Unsplittable Flow on a Path: The Game!. |
SODA |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Miriam Schlöter, Martin Skutella, Khai Van Tran |
A Faster Algorithm for Quickest Transshipments via an Extended Discrete Newton Method. |
SODA |
2022 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")
data released under the ODC-BY 1.0 license