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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, SODA 2023, Florence, Italy, January 22-25, 2023, pp. 2111-2121, 2023, SIAM, 978-1-61197-755-4. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Daniel Lokshtanov, Giannos Stamoulis |
Shortest Cycles With Monotone Submodular Costs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, SODA 2023, Florence, Italy, January 22-25, 2023, pp. 2214-2227, 2023, SIAM, 978-1-61197-755-4. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Timothy M. Chan |
Finding Triangles and Other Small Subgraphs in Geometric Intersection Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, SODA 2023, Florence, Italy, January 22-25, 2023, pp. 1777-1805, 2023, SIAM, 978-1-61197-755-4. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Oliver Janzer, Benny Sudakov, István Tomon |
Small subgraphs with large average degree. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, SODA 2023, Florence, Italy, January 22-25, 2023, pp. 2345-2353, 2023, SIAM, 978-1-61197-755-4. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Xinrui Jia 0001, Ola Svensson, Weiqiang Yuan 0002 |
The Exact Bipartite Matching Polytope Has Exponential Extension Complexity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, SODA 2023, Florence, Italy, January 22-25, 2023, pp. 1635-1654, 2023, SIAM, 978-1-61197-755-4. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, SODA 2023, Florence, Italy, January 22-25, 2023, pp. 3218-3228, 2023, SIAM, 978-1-61197-755-4. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Soheil Behnezhad, Mohammad Roghani, Aviad Rubinstein, Amin Saberi |
Beating Greedy Matching in Sublinear Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, SODA 2023, Florence, Italy, January 22-25, 2023, pp. 3900-3945, 2023, SIAM, 978-1-61197-755-4. The full citation details ...](Pics/full.jpeg) |
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 ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![SIAM, 978-1-61197-755-4 The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Yakov Nekrich, Saladi Rahul |
4D Range Reporting in the Pointer Machine Model in Almost-Optimal Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, SODA 2023, Florence, Italy, January 22-25, 2023, pp. 1862-1876, 2023, SIAM, 978-1-61197-755-4. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Avi Cohen, Michal Feldman, Divyarthi Mohan, Inbal Talgam-Cohen |
Interdependent Public Projects. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, SODA 2023, Florence, Italy, January 22-25, 2023, pp. 416-443, 2023, SIAM, 978-1-61197-755-4. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, SODA 2023, Florence, Italy, January 22-25, 2023, pp. 3029-3042, 2023, SIAM, 978-1-61197-755-4. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Cole Franks, Tasuku Soma, Michel X. Goemans |
Shrunk subspaces via operator Sinkhorn iteration. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, SODA 2023, Florence, Italy, January 22-25, 2023, pp. 1655-1668, 2023, SIAM, 978-1-61197-755-4. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, SODA 2023, Florence, Italy, January 22-25, 2023, pp. 3734-3758, 2023, SIAM, 978-1-61197-755-4. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, SODA 2023, Florence, Italy, January 22-25, 2023, pp. 4409-4447, 2023, SIAM, 978-1-61197-755-4. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, SODA 2023, Florence, Italy, January 22-25, 2023, pp. 3513-3550, 2023, SIAM, 978-1-61197-755-4. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Anindya De, Shivam Nadimpalli, Rocco A. Servedio |
Testing Convex Truncation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, SODA 2023, Florence, Italy, January 22-25, 2023, pp. 4050-4082, 2023, SIAM, 978-1-61197-755-4. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Andrew Alseth, Matthew J. Patitz |
The Need for Seed (in the abstract Tile Assembly Model). ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, SODA 2023, Florence, Italy, January 22-25, 2023, pp. 4540-4589, 2023, SIAM, 978-1-61197-755-4. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Stéphane Bessy, Marin Bougeret, Dimitrios M. Thilikos, Sebastian Wiederrecht |
Kernelization for Graph Packing Problems via Rainbow Matching. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, SODA 2023, Florence, Italy, January 22-25, 2023, pp. 3654-3663, 2023, SIAM, 978-1-61197-755-4. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Josh Alman, Yunfeng Guan, Ashwin Padaki |
Smaller Low-Depth Circuits for Kronecker Powers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, SODA 2023, Florence, Italy, January 22-25, 2023, pp. 4159-4187, 2023, SIAM, 978-1-61197-755-4. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Nairen Cao, Jeremy T. Fineman |
Parallel Exact Shortest Paths in Almost Linear Work and Square Root Depth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, SODA 2023, Florence, Italy, January 22-25, 2023, pp. 4354-4372, 2023, SIAM, 978-1-61197-755-4. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Alan M. Frieze, Wesley Pegden |
Subexponential mixing for partition chains on grid-like graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, SODA 2023, Florence, Italy, January 22-25, 2023, pp. 3317-3329, 2023, SIAM, 978-1-61197-755-4. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Lucas Pesenti, Adrian Vladu |
Discrepancy Minimization via Regularization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, SODA 2023, Florence, Italy, January 22-25, 2023, pp. 1734-1758, 2023, SIAM, 978-1-61197-755-4. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Monika Henzinger, Jalaj Upadhyay, Sarvagya Upadhyay |
Almost Tight Error Bounds on Differentially Private Continual Counting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, SODA 2023, Florence, Italy, January 22-25, 2023, pp. 5003-5039, 2023, SIAM, 978-1-61197-755-4. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Loukas Georgiadis, Evangelos Kipouridis, Charis Papadopoulos, Nikos Parotsidis |
Faster Computation of 3-Edge-Connected Components in Digraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, SODA 2023, Florence, Italy, January 22-25, 2023, pp. 2489-2531, 2023, SIAM, 978-1-61197-755-4. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Mingyang Deng, Xiao Mao, Ziqian Zhong |
On Problems Related to Unbounded SubsetSum: A Unified Combinatorial Approach. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, SODA 2023, Florence, Italy, January 22-25, 2023, pp. 2980-2990, 2023, SIAM, 978-1-61197-755-4. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Michael Kapralov, Hannah Lawrence, Mikhail Makarov, Cameron Musco, Kshiteej Sheth |
Toeplitz Low-Rank Approximation with Sublinear Query Complexity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, SODA 2023, Florence, Italy, January 22-25, 2023, pp. 4127-4158, 2023, SIAM, 978-1-61197-755-4. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Leslie Ann Goldberg, John Lapinskas |
Instability of backoff protocols with arbitrary arrival rates. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, SODA 2023, Florence, Italy, January 22-25, 2023, pp. 3426-3436, 2023, SIAM, 978-1-61197-755-4. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Sungjin Im, Shi Li 0001 |
Improved Approximations for Unrelated Machine Scheduling. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, SODA 2023, Florence, Italy, January 22-25, 2023, pp. 2917-2946, 2023, SIAM, 978-1-61197-755-4. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Robin Kothari, Ryan O'Donnell |
Mean estimation when you have the source code; or, quantum Monte Carlo methods. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, SODA 2023, Florence, Italy, January 22-25, 2023, pp. 1186-1215, 2023, SIAM, 978-1-61197-755-4. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Joran van Apeldoorn, Arjan Cornelissen, András Gilyén, Giacomo Nannicini |
Quantum tomography using state-preparation unitaries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, SODA 2023, Florence, Italy, January 22-25, 2023, pp. 1265-1318, 2023, SIAM, 978-1-61197-755-4. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, SODA 2023, Florence, Italy, January 22-25, 2023, pp. 3959-4025, 2023, SIAM, 978-1-61197-755-4. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Siu-Wing Cheng, Haoqiang Huang |
Curve Simplification and Clustering under Fréchet Distance. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, SODA 2023, Florence, Italy, January 22-25, 2023, pp. 1414-1432, 2023, SIAM, 978-1-61197-755-4. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Yiding Hua, Rasmus Kyng, Maximilian Probst Gutenberg, Zihang Wu |
Maintaining Expander Decompositions via Sparse Cuts. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, SODA 2023, Florence, Italy, January 22-25, 2023, pp. 48-69, 2023, SIAM, 978-1-61197-755-4. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Binghui Peng, Fred Zhang |
Online Prediction in Sub-linear Space. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, SODA 2023, Florence, Italy, January 22-25, 2023, pp. 1611-1634, 2023, SIAM, 978-1-61197-755-4. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Jonas Ellert, Pawel Gawrychowski, Garance Gourdel |
Optimal Square Detection Over General Alphabets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, SODA 2023, Florence, Italy, January 22-25, 2023, pp. 5220-5242, 2023, SIAM, 978-1-61197-755-4. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, SODA 2023, Florence, Italy, January 22-25, 2023, pp. 5203-5219, 2023, SIAM, 978-1-61197-755-4. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Manuela Fischer, Magnús M. Halldórsson, Yannic Maus |
Fast Distributed Brooks' Theorem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, SODA 2023, Florence, Italy, January 22-25, 2023, pp. 2567-2588, 2023, SIAM, 978-1-61197-755-4. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, SODA 2023, Florence, Italy, January 22-25, 2023, pp. 1433-1463, 2023, SIAM, 978-1-61197-755-4. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Peter Ivanov, Raghu Meka, Emanuele Viola |
Efficient resilient functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, SODA 2023, Florence, Italy, January 22-25, 2023, pp. 2867-2874, 2023, SIAM, 978-1-61197-755-4. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | R. Ravi 0001, Weizhong Zhang, Michael Zlatin |
Approximation Algorithms for Steiner Tree Augmentation Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, SODA 2023, Florence, Italy, January 22-25, 2023, pp. 2429-2448, 2023, SIAM, 978-1-61197-755-4. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Jun-Ting Hsieh, Pravesh K. Kothari, Sidhanth Mohanty |
A simple and sharper proof of the hypergraph Moore bound. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, SODA 2023, Florence, Italy, January 22-25, 2023, pp. 2324-2344, 2023, SIAM, 978-1-61197-755-4. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Michael Kapralov, Akash Kumar 0009, Silvio Lattanzi, Aida Mousavifar |
Learning Hierarchical Cluster Structure of Graphs in Sublinear Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, SODA 2023, Florence, Italy, January 22-25, 2023, pp. 925-939, 2023, SIAM, 978-1-61197-755-4. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Hung Le |
Approximate Distance Oracles for Planar Graphs with Subpolynomial Error Dependency. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, SODA 2023, Florence, Italy, January 22-25, 2023, pp. 1877-1904, 2023, SIAM, 978-1-61197-755-4. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Dmitriy Zhuk, Barnaby Martin, Michal Wrona |
The complete classification for quantified equality constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, SODA 2023, Florence, Italy, January 22-25, 2023, pp. 2746-2760, 2023, SIAM, 978-1-61197-755-4. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Xiaohui Bei, Nick Gravin, Pinyan Lu, Zhihao Gavin Tang |
Bidder Subset Selection Problem in Auction Design. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, SODA 2023, Florence, Italy, January 22-25, 2023, pp. 3788-3801, 2023, SIAM, 978-1-61197-755-4. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Dominik Kempa, Tomasz Kociumaka |
Breaking the n)-Barrier in the Construction of Compressed Suffix Arrays and Suffix Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, SODA 2023, Florence, Italy, January 22-25, 2023, pp. 5122-5202, 2023, SIAM, 978-1-61197-755-4. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Shang-En Huang, Seth Pettie, Leqi Zhu |
Byzantine Agreement with Optimal Resilience via Statistical Fraud Detection. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, SODA 2023, Florence, Italy, January 22-25, 2023, pp. 4335-4353, 2023, SIAM, 978-1-61197-755-4. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, SODA 2023, Florence, Italy, January 22-25, 2023, pp. 1319-1384, 2023, SIAM, 978-1-61197-755-4. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Anupam Gupta 0001, Benjamin Moseley, Rudy Zhou |
Minimizing Completion Times for Stochastic Jobs via Batched Free Times. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, SODA 2023, Florence, Italy, January 22-25, 2023, pp. 1905-1930, 2023, SIAM, 978-1-61197-755-4. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Julia Chuzhoy |
A Distanced Matching Game, Decremental APSP in Expanders, and Faster Deterministic Algorithms for Graph Cut Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, SODA 2023, Florence, Italy, January 22-25, 2023, pp. 2122-2213, 2023, SIAM, 978-1-61197-755-4. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, SODA 2023, Florence, Italy, January 22-25, 2023, pp. 87-99, 2023, SIAM, 978-1-61197-755-4. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Michael Anastos |
Fast algorithms for solving the Hamilton Cycle problem with high probability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, SODA 2023, Florence, Italy, January 22-25, 2023, pp. 2286-2323, 2023, SIAM, 978-1-61197-755-4. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Aleksandar Nikolov |
Private Query Release via the Johnson-Lindenstrauss Transform. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, SODA 2023, Florence, Italy, January 22-25, 2023, pp. 4982-5002, 2023, SIAM, 978-1-61197-755-4. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Renato Paes Leme, Balasubramanian Sivan, Yifeng Teng, Pratik Worah |
Pricing Query Complexity of Revenue Maximization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, SODA 2023, Florence, Italy, January 22-25, 2023, pp. 399-415, 2023, SIAM, 978-1-61197-755-4. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Nikhil Gupta 0008, Chandan Saha 0001, Bhargav Thankey |
Equivalence Test for Read-Once Arithmetic Formulas. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, SODA 2023, Florence, Italy, January 22-25, 2023, pp. 4205-4272, 2023, SIAM, 978-1-61197-755-4. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Jacob Holm, Jakub Tetek |
Massively Parallel Computation on Embedded Planar Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, SODA 2023, Florence, Italy, January 22-25, 2023, pp. 4373-4408, 2023, SIAM, 978-1-61197-755-4. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Michael A. Bender, Alex Conway, Martin Farach-Colton, William Kuszmaul, Guido Tagliavini |
Tiny Pointers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, SODA 2023, Florence, Italy, January 22-25, 2023, pp. 477-508, 2023, SIAM, 978-1-61197-755-4. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, SODA 2023, Florence, Italy, January 22-25, 2023, pp. 3777-3787, 2023, SIAM, 978-1-61197-755-4. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Corwin Sinnamon, Robert E. Tarjan |
A Tight Analysis of Slim Heaps and Smooth Heaps. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, SODA 2023, Florence, Italy, January 22-25, 2023, pp. 549-567, 2023, SIAM, 978-1-61197-755-4. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, SODA 2023, Florence, Italy, January 22-25, 2023, pp. 3713-3733, 2023, SIAM, 978-1-61197-755-4. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, SODA 2023, Florence, Italy, January 22-25, 2023, pp. 2677-2727, 2023, SIAM, 978-1-61197-755-4. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Lorenzo Ciardo, Stanislav Zivný |
Hierarchies of Minion Tests for PCSPs through Tensors. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, SODA 2023, Florence, Italy, January 22-25, 2023, pp. 568-580, 2023, SIAM, 978-1-61197-755-4. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, SODA 2023, Florence, Italy, January 22-25, 2023, pp. 240-275, 2023, SIAM, 978-1-61197-755-4. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Peter Davies |
Improved Distributed Algorithms for the Lovász Local Lemma and Edge Coloring. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, SODA 2023, Florence, Italy, January 22-25, 2023, pp. 4273-4295, 2023, SIAM, 978-1-61197-755-4. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Robert Krauthgamer, Ron Mosenzon |
Exact Flow Sparsification Requires Unbounded Size. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, SODA 2023, Florence, Italy, January 22-25, 2023, pp. 2354-2367, 2023, SIAM, 978-1-61197-755-4. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Mingyang Deng, Ce Jin 0001, Xiao Mao |
Approximating Knapsack and Partition via Dense Subset Sums. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, SODA 2023, Florence, Italy, January 22-25, 2023, pp. 2961-2979, 2023, SIAM, 978-1-61197-755-4. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, SODA 2023, Florence, Italy, January 22-25, 2023, pp. 4296-4334, 2023, SIAM, 978-1-61197-755-4. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, SODA 2023, Florence, Italy, January 22-25, 2023, pp. 2532-2566, 2023, SIAM, 978-1-61197-755-4. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Alkida Balliu, Sebastian Brandt 0002, Fabian Kuhn, Dennis Olivetti |
Distributed Maximal Matching and Maximal Independent Set on Hypergraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, SODA 2023, Florence, Italy, January 22-25, 2023, pp. 2632-2676, 2023, SIAM, 978-1-61197-755-4. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Princewill Okoroafor, Vaishnavi Gupta, Robert Kleinberg |
Non-Stochastic CDF Estimation Using Threshold Queries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, SODA 2023, Florence, Italy, January 22-25, 2023, pp. 3551-3572, 2023, SIAM, 978-1-61197-755-4. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Yaonan Jin, Pinyan Lu |
The Price of Stability for First Price Auction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, SODA 2023, Florence, Italy, January 22-25, 2023, pp. 332-352, 2023, SIAM, 978-1-61197-755-4. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, SODA 2023, Florence, Italy, January 22-25, 2023, pp. 3245-3281, 2023, SIAM, 978-1-61197-755-4. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, SODA 2023, Florence, Italy, January 22-25, 2023, pp. 1398-1413, 2023, SIAM, 978-1-61197-755-4. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Arjan Cornelissen, Yassine Hamoudi |
A Sublinear-Time Quantum Algorithm for Approximating Partition Functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, SODA 2023, Florence, Italy, January 22-25, 2023, pp. 1245-1264, 2023, SIAM, 978-1-61197-755-4. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Taihei Oki, Tasuku Soma |
Algebraic Algorithms for Fractional Linear Matroid Parity via Non-commutative Rank. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, SODA 2023, Florence, Italy, January 22-25, 2023, pp. 4188-4204, 2023, SIAM, 978-1-61197-755-4. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Dain Kim, Anqi Li, Jonathan Tidor |
Cubic Goldreich-Levin. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, SODA 2023, Florence, Italy, January 22-25, 2023, pp. 4846-4892, 2023, SIAM, 978-1-61197-755-4. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, SODA 2023, Florence, Italy, January 22-25, 2023, pp. 1464-1492, 2023, SIAM, 978-1-61197-755-4. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Peter Gartland, Daniel Lokshtanov |
Graph Classes with Few Minimal Separators. I. Finite Forbidden Induced Subgraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, SODA 2023, Florence, Italy, January 22-25, 2023, pp. 3063-3097, 2023, SIAM, 978-1-61197-755-4. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, SODA 2023, Florence, Italy, January 22-25, 2023, pp. 1594-1610, 2023, SIAM, 978-1-61197-755-4. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, SODA 2023, Florence, Italy, January 22-25, 2023, pp. 3587-3613, 2023, SIAM, 978-1-61197-755-4. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, SODA 2023, Florence, Italy, January 22-25, 2023, pp. 5090-5121, 2023, SIAM, 978-1-61197-755-4. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, SODA 2023, Florence, Italy, January 22-25, 2023, pp. 1995-2014, 2023, SIAM, 978-1-61197-755-4. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, SODA 2023, Florence, Italy, January 22-25, 2023, pp. 605-637, 2023, SIAM, 978-1-61197-755-4. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Kun He 0011, Qian Li 0012, Xiaoming Sun 0001 |
Moser-Tardos Algorithm: Beyond Shearer's Bound. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, SODA 2023, Florence, Italy, January 22-25, 2023, pp. 3362-3387, 2023, SIAM, 978-1-61197-755-4. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, SODA 2022, Virtual Conference / Alexandria, VA, USA, January 9 - 12, 2022, pp. 1976-2004, 2022, SIAM, 978-1-61197-707-3. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, SODA 2022, Virtual Conference / Alexandria, VA, USA, January 9 - 12, 2022, pp. 1448-1470, 2022, SIAM, 978-1-61197-707-3. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, SODA 2022, Virtual Conference / Alexandria, VA, USA, January 9 - 12, 2022, pp. 1493-1530, 2022, SIAM, 978-1-61197-707-3. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Surender Baswana, Abhyuday Pandey |
Sensitivity Oracles for All-Pairs Mincuts. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, SODA 2022, Virtual Conference / Alexandria, VA, USA, January 9 - 12, 2022, pp. 581-609, 2022, SIAM, 978-1-61197-707-3. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, SODA 2022, Virtual Conference / Alexandria, VA, USA, January 9 - 12, 2022, pp. 1273-1297, 2022, SIAM, 978-1-61197-707-3. The full citation details ...](Pics/full.jpeg) |
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). ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, SODA 2022, Virtual Conference / Alexandria, VA, USA, January 9 - 12, 2022, pp. 2005-2031, 2022, SIAM, 978-1-61197-707-3. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Benjamin Aram Berendsohn, László Kozma 0002 |
Splay trees on trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, SODA 2022, Virtual Conference / Alexandria, VA, USA, January 9 - 12, 2022, pp. 1875-1900, 2022, SIAM, 978-1-61197-707-3. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Haim Kaplan, David Naori, Danny Raz |
Online Weighted Matching with a Sample. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, SODA 2022, Virtual Conference / Alexandria, VA, USA, January 9 - 12, 2022, pp. 1247-1272, 2022, SIAM, 978-1-61197-707-3. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Shimon Kogan, Merav Parter |
New Diameter-Reducing Shortcuts and Directed Hopsets: Breaking the Barrier. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, SODA 2022, Virtual Conference / Alexandria, VA, USA, January 9 - 12, 2022, pp. 1326-1341, 2022, SIAM, 978-1-61197-707-3. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Yossi Azar, Debmalya Panigrahi, Noam Touitou |
Online Graph Algorithms with Predictions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, SODA 2022, Virtual Conference / Alexandria, VA, USA, January 9 - 12, 2022, pp. 35-66, 2022, SIAM, 978-1-61197-707-3. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Soheil Behnezhad, Avrim Blum, Mahsa Derakhshan |
Stochastic Vertex Cover with Few Queries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, SODA 2022, Virtual Conference / Alexandria, VA, USA, January 9 - 12, 2022, pp. 1808-1846, 2022, SIAM, 978-1-61197-707-3. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Talya Eden, Saleet Mossel, Dana Ron |
Approximating the Arboricity in Sublinear Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, SODA 2022, Virtual Conference / Alexandria, VA, USA, January 9 - 12, 2022, pp. 2404-2425, 2022, SIAM, 978-1-61197-707-3. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Haim Kaplan, Robert E. Tarjan, Or Zamir, Uri Zwick |
Simulating a stack using queues. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, SODA 2022, Virtual Conference / Alexandria, VA, USA, January 9 - 12, 2022, pp. 1901-1924, 2022, SIAM, 978-1-61197-707-3. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Nikhil Bansal 0001, Christian Coester, Ravi Kumar 0001, Manish Purohit, Erik Vee |
Learning-Augmented Weighted Paging. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, SODA 2022, Virtual Conference / Alexandria, VA, USA, January 9 - 12, 2022, pp. 67-89, 2022, SIAM, 978-1-61197-707-3. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Fabrizio Grandoni 0001, Tobias Mömke, Andreas Wiese |
Unsplittable Flow on a Path: The Game!. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, SODA 2022, Virtual Conference / Alexandria, VA, USA, January 9 - 12, 2022, pp. 906-926, 2022, SIAM, 978-1-61197-707-3. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, SODA 2022, Virtual Conference / Alexandria, VA, USA, January 9 - 12, 2022, pp. 90-102, 2022, SIAM, 978-1-61197-707-3. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|