Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
1 | George Karakostas, Stavros G. Kolliopoulos |
Approximation Algorithms for Maximum Weighted Throughput on Unrelated Machines. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX/RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2023, September 11-13, 2023, Atlanta, Georgia, USA, pp. 5:1-5:17, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-296-9. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Noah G. Singer |
Oblivious Algorithms for the Max-kAND Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX/RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2023, September 11-13, 2023, Atlanta, Georgia, USA, pp. 15:1-15:19, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-296-9. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Andrej Bogdanov, Tsun Ming Cheung, Krishnamoorthy Dinesh 0001, John C. S. Lui |
Classical Simulation of One-Query Quantum Distinguishers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX/RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2023, September 11-13, 2023, Atlanta, Georgia, USA, pp. 43:1-43:17, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-296-9. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Russell Impagliazzo, Valentine Kabanets, Ilya Volkovich |
Synergy Between Circuit Obfuscation and Circuit Minimization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX/RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2023, September 11-13, 2023, Atlanta, Georgia, USA, pp. 31:1-31:21, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-296-9. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Jeremiah Blocki, Elena Grigorescu, Tamalika Mukherjee, Samson Zhou |
How to Make Your Approximation Algorithm Private: A Black-Box Differentially-Private Transformation for Tunable Approximation Algorithms of Functions with Low Sensitivity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX/RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2023, September 11-13, 2023, Atlanta, Georgia, USA, pp. 59:1-59:24, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-296-9. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Mark de Berg, Arpan Sadhukhan, Frits C. R. Spieksma |
Stable Approximation Algorithms for Dominating Set and Independent Set. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX/RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2023, September 11-13, 2023, Atlanta, Georgia, USA, pp. 27:1-27:19, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-296-9. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Emin Karayel |
An Embarrassingly Parallel Optimal-Space Cardinality Estimation Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX/RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2023, September 11-13, 2023, Atlanta, Georgia, USA, pp. 35:1-35:22, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-296-9. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Anita Dürr, Nicolas El Maalouly, Lasse Wulf |
An Approximation Algorithm for the Exact Matching Problem in Bipartite Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX/RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2023, September 11-13, 2023, Atlanta, Georgia, USA, pp. 18:1-18:21, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-296-9. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | |
Front Matter, Table of Contents, Preface, Conference Organization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX/RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2023, September 11-13, 2023, Atlanta, Georgia, USA, pp. 0:1-0:24, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-296-9. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Karthekeyan Chandrasekaran, Weihang Wang 0002 |
Approximating Submodular k-Partition via Principal Partition Sequence. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX/RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2023, September 11-13, 2023, Atlanta, Georgia, USA, pp. 3:1-3:16, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-296-9. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Prashanth Amireddy, Srikanth Srinivasan 0001, Madhu Sudan 0001 |
Low-Degree Testing over Grids. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX/RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2023, September 11-13, 2023, Atlanta, Georgia, USA, pp. 41:1-41:22, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-296-9. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Chin Ho Lee, Edward Pyne, Salil P. Vadhan |
On the Power of Regular and Permutation Branching Programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX/RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2023, September 11-13, 2023, Atlanta, Georgia, USA, pp. 44:1-44:22, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-296-9. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Danish Kashaev, Guido Schäfer |
Round and Bipartize for Vertex Cover Approximation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX/RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2023, September 11-13, 2023, Atlanta, Georgia, USA, pp. 20:1-20:20, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-296-9. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Joshua Cook, Dana Moshkovitz |
Tighter MA/1 Circuit Lower Bounds from Verifier Efficient PCPs for PSPACE. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX/RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2023, September 11-13, 2023, Atlanta, Georgia, USA, pp. 55:1-55:22, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-296-9. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Sourav Chakraborty 0001, Chandrima Kayal, Rajat Mittal, Manaswi Paraashar, Swagato Sanyal, Nitin Saurabh |
On the Composition of Randomized Query Complexity and Approximate Degree. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX/RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2023, September 11-13, 2023, Atlanta, Georgia, USA, pp. 63:1-63:23, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-296-9. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Xi Chen 0001, Yaonan Jin, Tim Randolph 0001, Rocco A. Servedio |
Subset Sum in Time 2n/2 / poly(n). ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX/RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2023, September 11-13, 2023, Atlanta, Georgia, USA, pp. 39:1-39:18, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-296-9. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Matej Lieskovský, Jirí Sgall, Andreas Emil Feldmann |
Approximation Algorithms and Lower Bounds for Graph Burning. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX/RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2023, September 11-13, 2023, Atlanta, Georgia, USA, pp. 9:1-9:17, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-296-9. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Nader H. Bshouty |
Superpolynomial Lower Bounds for Learning Monotone Classes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX/RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2023, September 11-13, 2023, Atlanta, Georgia, USA, pp. 34:1-34:20, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-296-9. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Andreas Galanis, Leslie Ann Goldberg, Paulina Smolarova |
Sampling from the Random Cluster Model on Random Regular Graphs at All Temperatures via Glauber Dynamics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX/RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2023, September 11-13, 2023, Atlanta, Georgia, USA, pp. 64:1-64:12, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-296-9. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Eric Allender, Jacob Gray, Saachi Mutreja, Harsha Tirumala, Pengxiang Wang 0002 |
Robustness for Space-Bounded Statistical Zero Knowledge. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX/RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2023, September 11-13, 2023, Atlanta, Georgia, USA, pp. 56:1-56:21, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-296-9. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Amin Coja-Oghlan, Jane Gao, Max Hahn-Klimroth, Joon Lee, Noëla Müller, Maurice Rolvien |
The Full Rank Condition for Sparse Random Matrices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX/RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2023, September 11-13, 2023, Atlanta, Georgia, USA, pp. 54:1-54:14, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-296-9. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Vikrant Ashvinkumar, Sepehr Assadi, Chengyuan Deng, Jie Gao 0001, Chen Wang 0027 |
Evaluating Stability in Massive Social Networks: Efficient Streaming Algorithms for Structural Balance. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX/RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2023, September 11-13, 2023, Atlanta, Georgia, USA, pp. 58:1-58:23, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-296-9. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Roy Gotlib, Tali Kaufman |
Fine Grained Analysis of High Dimensional Random Walks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX/RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2023, September 11-13, 2023, Atlanta, Georgia, USA, pp. 49:1-49:22, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-296-9. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Eden Chlamtác, Yury Makarychev, Ali Vakilian |
Approximating Red-Blue Set Cover and Minimum Monotone Satisfying Assignment. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX/RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2023, September 11-13, 2023, Atlanta, Georgia, USA, pp. 11:1-11:19, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-296-9. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Quanquan C. Liu, Yiduo Ke, Samir Khuller |
Scalable Auction Algorithms for Bipartite Maximum Matching Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX/RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2023, September 11-13, 2023, Atlanta, Georgia, USA, pp. 28:1-28:24, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-296-9. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Morteza Monemizadeh |
Facility Location in the Sublinear Geometric Model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX/RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2023, September 11-13, 2023, Atlanta, Georgia, USA, pp. 6:1-6:24, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-296-9. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Kalen Patton, Matteo Russo, Sahil Singla 0001 |
Submodular Norms with Applications To Online Facility Location and Stochastic Probing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX/RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2023, September 11-13, 2023, Atlanta, Georgia, USA, pp. 23:1-23:22, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-296-9. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Karthik Gajulapalli, Alexander Golovnev, Satyajeet Nagargoje, Sidhant Saraogi |
Range Avoidance for Constant Depth Circuits: Hardness and Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX/RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2023, September 11-13, 2023, Atlanta, Georgia, USA, pp. 65:1-65:18, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-296-9. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Renato Ferreira Pinto Jr. |
Directed Poincaré Inequalities and L¹ Monotonicity Testing of Lipschitz Functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX/RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2023, September 11-13, 2023, Atlanta, Georgia, USA, pp. 61:1-61:18, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-296-9. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Talya Eden, Jakob Bæk Tejs Houen, Shyam Narayanan, Will Rosenbaum, Jakub Tetek |
Bias Reduction for Sum Estimation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX/RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2023, September 11-13, 2023, Atlanta, Georgia, USA, pp. 62:1-62:21, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-296-9. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Lap Chi Lau, Robert Wang 0004, Hong Zhou 0001 |
Experimental Design for Any p-Norm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX/RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2023, September 11-13, 2023, Atlanta, Georgia, USA, pp. 4:1-4:21, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-296-9. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Josefine Foos, Stephan Held, Yannik Kyle Dustin Spitzley |
Tighter Approximation for the Uniform Cost-Distance Steiner Tree Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX/RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2023, September 11-13, 2023, Atlanta, Georgia, USA, pp. 19:1-19:16, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-296-9. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Zachary Friggstad, Ramin Mousavi |
A Constant-Factor Approximation for Quasi-Bipartite Directed Steiner Tree on Minor-Free Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX/RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2023, September 11-13, 2023, Atlanta, Georgia, USA, pp. 13:1-13:18, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-296-9. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Amir Abboud, MohammadHossein Bateni, Vincent Cohen-Addad, Karthik C. S., Saeed Seddighin |
On Complexity of 1-Center in Various Metrics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX/RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2023, September 11-13, 2023, Atlanta, Georgia, USA, pp. 1:1-1:19, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-296-9. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Venkatesan Guruswami, Shilun Li |
A Deterministic Construction of a Large Distance Code from the Wozencraft Ensemble. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX/RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2023, September 11-13, 2023, Atlanta, Georgia, USA, pp. 50:1-50:10, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-296-9. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Chandra Chekuri, Kent Quanrud |
Independent Sets in Elimination Graphs with a Submodular Objective. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX/RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2023, September 11-13, 2023, Atlanta, Georgia, USA, pp. 24:1-24:22, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-296-9. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Yahli Hecht, Dor Minzer, Muli Safra |
NP-Hardness of Almost Coloring Almost 3-Colorable Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX/RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2023, September 11-13, 2023, Atlanta, Georgia, USA, pp. 51:1-51:12, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-296-9. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Kamesh Munagala, Govind S. Sankar, Erin Taylor 0002 |
Probabilistic Metric Embedding via Metric Labeling. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX/RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2023, September 11-13, 2023, Atlanta, Georgia, USA, pp. 2:1-2:10, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-296-9. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Nikhil Ayyadevara, Nikhil Bansal 0001, Milind Prabhu |
On Minimizing Generalized Makespan on Unrelated Machines. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX/RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2023, September 11-13, 2023, Atlanta, Georgia, USA, pp. 21:1-21:13, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-296-9. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Konrad Anand, Andreas Göbel 0001, Marcus Pappik, Will Perkins 0001 |
Perfect Sampling for Hard Spheres from Strong Spatial Mixing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX/RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2023, September 11-13, 2023, Atlanta, Georgia, USA, pp. 38:1-38:18, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-296-9. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Antonio Blanca, Xusheng Zhang |
Rapid Mixing of Global Markov Chains via Spectral Independence: The Unbounded Degree Case. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX/RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2023, September 11-13, 2023, Atlanta, Georgia, USA, pp. 53:1-53:19, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-296-9. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Piotr Berman, Meiram Murzabulatov, Sofya Raskhodnikova, Dragos Ristache |
Testing Connectedness of Images. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX/RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2023, September 11-13, 2023, Atlanta, Georgia, USA, pp. 66:1-66:15, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-296-9. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Ilan Doron Arad, Ariel Kulik, Hadas Shachnai |
An AFPTAS for Bin Packing with Partition Matroid via a New Method for LP Rounding. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX/RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2023, September 11-13, 2023, Atlanta, Georgia, USA, pp. 22:1-22:16, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-296-9. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Nicole Megow, Adam D. Smith (eds.) |
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2023, September 11-13, 2023, Atlanta, Georgia, USA ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX/RANDOM ![Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-296-9 The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP BibTeX RDF |
|
1 | Lindsey Deryckere, Seeun William Umboh |
Online Matching with Set and Concave Delays. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX/RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2023, September 11-13, 2023, Atlanta, Georgia, USA, pp. 17:1-17:17, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-296-9. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Johannes Lengler, Anders Martinsson, Kalina Petrova, Patrick Schnider, Raphael Steiner, Simon Weber 0001, Emo Welzl |
On Connectivity in Random Graph Models with Limited Dependencies. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX/RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2023, September 11-13, 2023, Atlanta, Georgia, USA, pp. 30:1-30:22, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-296-9. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Sepideh Mahabadi, Shyam Narayanan |
Improved Diversity Maximization Algorithms for Matching and Pseudoforest. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX/RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2023, September 11-13, 2023, Atlanta, Georgia, USA, pp. 25:1-25:22, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-296-9. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Shuchi Chawla 0001, Evangelia Gergatsouli, Jeremy McMahan, Christos Tzamos |
Approximating Pandora's Box with Correlations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX/RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2023, September 11-13, 2023, Atlanta, Georgia, USA, pp. 26:1-26:24, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-296-9. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Swastik Kopparty, Vishvajeet N |
Extracting Mergers and Projections of Partitions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX/RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2023, September 11-13, 2023, Atlanta, Georgia, USA, pp. 52:1-52:22, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-296-9. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Ishan Bansal, Joe Cheriyan, Logan Grout, Sharat Ibrahimpur |
Algorithms for 2-Connected Network Design and Flexible Steiner Trees with a Constant Number of Terminals. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX/RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2023, September 11-13, 2023, Atlanta, Georgia, USA, pp. 14:1-14:14, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-296-9. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Elena Grigorescu, Nithish Kumar, Young-San Lin |
Approximation Algorithms for Directed Weighted Spanners. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX/RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2023, September 11-13, 2023, Atlanta, Georgia, USA, pp. 8:1-8:23, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-296-9. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Huck Bennett, Chris Peikert |
Hardness of the (Approximate) Shortest Vector Problem: A Simple Proof via Reed-Solomon Codes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX/RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2023, September 11-13, 2023, Atlanta, Georgia, USA, pp. 37:1-37:20, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-296-9. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Anupam Gupta 0001, Amit Kumar 0001, Debmalya Panigrahi |
Efficient Algorithms and Hardness Results for the Weighted k-Server Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX/RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2023, September 11-13, 2023, Atlanta, Georgia, USA, pp. 12:1-12:19, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-296-9. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Felix Höhne, Rob van Stee |
A 10/7-Approximation for Discrete Bamboo Garden Trimming and Continuous Trimming on Star Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX/RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2023, September 11-13, 2023, Atlanta, Georgia, USA, pp. 16:1-16:19, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-296-9. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Sepehr Assadi, Michael Kapralov, Huacheng Yu |
On Constructing Spanners from Random Gaussian Projections. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX/RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2023, September 11-13, 2023, Atlanta, Georgia, USA, pp. 57:1-57:18, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-296-9. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Alexander Golovnev, Siyao Guo, Spencer Peters, Noah Stephens-Davidowitz |
The (Im)possibility of Simple Search-To-Decision Reductions for Approximation Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX/RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2023, September 11-13, 2023, Atlanta, Georgia, USA, pp. 10:1-10:20, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-296-9. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Meghal Gupta, Rachel Yun Zhang |
Interactive Error Correcting Codes: New Constructions and Impossibility Bounds. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX/RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2023, September 11-13, 2023, Atlanta, Georgia, USA, pp. 32:1-32:14, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-296-9. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Tanvi Bajpai, Chandra Chekuri |
Bicriteria Approximation Algorithms for Priority Matroid Median. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX/RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2023, September 11-13, 2023, Atlanta, Georgia, USA, pp. 7:1-7:22, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-296-9. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Yuval Filmus, Itai Leigh, Artur Riazanov, Dmitry Sokolov 0001 |
Sampling and Certifying Symmetric Functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX/RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2023, September 11-13, 2023, Atlanta, Georgia, USA, pp. 36:1-36:21, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-296-9. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Lior Gishboliner, Nick Kushnir, Asaf Shapira |
Testing Versus Estimation of Graph Properties, Revisited. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX/RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2023, September 11-13, 2023, Atlanta, Georgia, USA, pp. 46:1-46:18, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-296-9. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Fernando Granha Jeronimo |
Fast Decoding of Explicit Almost Optimal ε-Balanced q-Ary Codes And Fast Approximation of Expanding k-CSPs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX/RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2023, September 11-13, 2023, Atlanta, Georgia, USA, pp. 60:1-60:16, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-296-9. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Dorna Abdolazimi, Kasper Lindberg, Shayan Oveis Gharan |
On Optimization and Counting of Non-Broken Bases of Matroids. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX/RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2023, September 11-13, 2023, Atlanta, Georgia, USA, pp. 40:1-40:14, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-296-9. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Vladimir Braverman, Joel Manning, Zhiwei Steven Wu, Samson Zhou |
Private Data Stream Analysis for Universal Symmetric Norm Estimation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX/RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2023, September 11-13, 2023, Atlanta, Georgia, USA, pp. 45:1-45:24, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-296-9. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Charilaos Efthymiou 0001, Thomas P. Hayes, Daniel Stefankovic, Eric Vigoda |
Optimal Mixing via Tensorization for Random Independent Sets on Arbitrary Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX/RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2023, September 11-13, 2023, Atlanta, Georgia, USA, pp. 33:1-33:16, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-296-9. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Joshua Cook, Ron D. Rothblum |
Efficient Interactive Proofs for Non-Deterministic Bounded Space. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX/RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2023, September 11-13, 2023, Atlanta, Georgia, USA, pp. 47:1-47:22, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-296-9. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Rubi Arviv, Lily Chung, Reut Levi, Edward Pyne |
Improved Local Computation Algorithms for Constructing Spanners. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX/RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2023, September 11-13, 2023, Atlanta, Georgia, USA, pp. 42:1-42:23, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-296-9. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Ruben Becker, Arnaud Casteigts, Pierluigi Crescenzi, Bojana Kodric, Malte Renken, Michael Raskin, Viktor Zamaraev |
Giant Components in Random Temporal Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX/RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2023, September 11-13, 2023, Atlanta, Georgia, USA, pp. 29:1-29:17, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-296-9. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Arijit Bishnu, Arijit Ghosh, Gopinath Mishra |
On the Complexity of Triangle Counting Using Emptiness Queries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX/RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2023, September 11-13, 2023, Atlanta, Georgia, USA, pp. 48:1-48:22, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-296-9. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Venkatesan Guruswami, Xin Lyu, Xiuhan Wang |
Range Avoidance for Low-Depth Circuits and Connections to Pseudorandomness. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX/RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2022, September 19-21, 2022, University of Illinois, Urbana-Champaign, USA (Virtual Conference)., pp. 20:1-20:21, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-249-5. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Tali Kaufman, David Mass |
Double Balanced Sets in High Dimensional Expanders. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX/RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2022, September 19-21, 2022, University of Illinois, Urbana-Champaign, USA (Virtual Conference)., pp. 3:1-3:17, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-249-5. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Antonio Blanca, Reza Gheissari |
Sampling from Potts on Random Graphs of Unbounded Degree via Random-Cluster Dynamics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX/RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2022, September 19-21, 2022, University of Illinois, Urbana-Champaign, USA (Virtual Conference)., pp. 24:1-24:15, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-249-5. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Aleksa Stankovic |
Some Results on Approximability of Minimum Sum Vertex Cover. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX/RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2022, September 19-21, 2022, University of Illinois, Urbana-Champaign, USA (Virtual Conference)., pp. 50:1-50:16, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-249-5. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Zhao Song 0002, Ruizhe Zhang 0001 |
Hyperbolic Concentration, Anti-Concentration, and Discrepancy. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX/RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2022, September 19-21, 2022, University of Illinois, Urbana-Champaign, USA (Virtual Conference)., pp. 10:1-10:19, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-249-5. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Nikhil Bansal 0001, Aditi Laddha, Santosh S. Vempala |
A Unified Approach to Discrepancy Minimization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX/RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2022, September 19-21, 2022, University of Illinois, Urbana-Champaign, USA (Virtual Conference)., pp. 1:1-1:22, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-249-5. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Pu Gao, Calum MacRury, Pawel Pralat |
A Fully Adaptive Strategy for Hamiltonian Cycles in the Semi-Random Graph Process. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX/RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2022, September 19-21, 2022, University of Illinois, Urbana-Champaign, USA (Virtual Conference)., pp. 29:1-29:22, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-249-5. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Michael Elkin, Chhaya Trehan |
(1+ε)-Approximate Shortest Paths in Dynamic Streams. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX/RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2022, September 19-21, 2022, University of Illinois, Urbana-Champaign, USA (Virtual Conference)., pp. 51:1-51:23, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-249-5. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Antonio Blanca, Sarah Cannon, Will Perkins 0001 |
Fast and Perfect Sampling of Subgraphs and Polymer Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX/RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2022, September 19-21, 2022, University of Illinois, Urbana-Champaign, USA (Virtual Conference)., pp. 4:1-4:18, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-249-5. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Tali Kaufman, Izhar Oppenheim |
High Dimensional Expansion Implies Amplified Local Testability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX/RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2022, September 19-21, 2022, University of Illinois, Urbana-Champaign, USA (Virtual Conference)., pp. 5:1-5:10, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-249-5. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Tobias Friedrich 0001, Davis Issac, Nikhil Kumar 0001, Nadym Mallek, Ziena Zeif |
A Primal-Dual Algorithm for Multicommodity Flows and Multicuts in Treewidth-2 Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX/RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2022, September 19-21, 2022, University of Illinois, Urbana-Champaign, USA (Virtual Conference)., pp. 55:1-55:18, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-249-5. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Marcin Bienkowski, Martin Böhm 0001, Jaroslaw Byrka, Jan Marcinkowski |
Online Facility Location with Linear Delay. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX/RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2022, September 19-21, 2022, University of Illinois, Urbana-Champaign, USA (Virtual Conference)., pp. 45:1-45:17, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-249-5. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Roy Schwartz 0002, Roded Zats |
Fair Correlation Clustering in General Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX/RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2022, September 19-21, 2022, University of Illinois, Urbana-Champaign, USA (Virtual Conference)., pp. 37:1-37:19, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-249-5. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Dan Karliner, Amnon Ta-Shma |
Improved Local Testing for Multiplicity Codes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX/RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2022, September 19-21, 2022, University of Illinois, Urbana-Champaign, USA (Virtual Conference)., pp. 11:1-11:19, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-249-5. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Amartya Shankha Biswas, Talya Eden, Quanquan C. Liu, Ronitt Rubinfeld, Slobodan Mitrovic |
Massively Parallel Algorithms for Small Subgraph Counting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX/RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2022, September 19-21, 2022, University of Illinois, Urbana-Champaign, USA (Virtual Conference)., pp. 39:1-39:28, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-249-5. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Sepehr Assadi, Hoai-An Nguyen |
Asymptotically Optimal Bounds for Estimating H-Index in Sublinear Time with Applications to Subgraph Counting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX/RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2022, September 19-21, 2022, University of Illinois, Urbana-Champaign, USA (Virtual Conference)., pp. 48:1-48:20, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-249-5. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Ryan Gabrys, Venkatesan Guruswami, João Ribeiro 0002, Ke Wu 0001 |
Beyond Single-Deletion Correcting Codes: Substitutions and Transpositions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX/RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2022, September 19-21, 2022, University of Illinois, Urbana-Champaign, USA (Virtual Conference)., pp. 8:1-8:17, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-249-5. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Shichuan Deng, Qianfan Zhang 0002 |
Ordered k-Median with Outliers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX/RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2022, September 19-21, 2022, University of Illinois, Urbana-Champaign, USA (Virtual Conference)., pp. 34:1-34:22, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-249-5. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Mika Göös, Siddhartha Jain 0002 |
Communication Complexity of Collision. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX/RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2022, September 19-21, 2022, University of Illinois, Urbana-Champaign, USA (Virtual Conference)., pp. 19:1-19:9, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-249-5. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Hridesh Kedia, Shunhao Oh, Dana Randall |
Local Stochastic Algorithms for Alignment in Self-Organizing Particle Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX/RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2022, September 19-21, 2022, University of Illinois, Urbana-Champaign, USA (Virtual Conference)., pp. 14:1-14:20, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-249-5. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Maciej Skorski |
Tight Chernoff-Like Bounds Under Limited Independence. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX/RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2022, September 19-21, 2022, University of Illinois, Urbana-Champaign, USA (Virtual Conference)., pp. 15:1-15:14, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-249-5. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Venkatesan Guruswami, Pravesh K. Kothari, Peter Manohar |
Bypassing the XOR Trick: Stronger Certificates for Hypergraph Clique Number. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX/RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2022, September 19-21, 2022, University of Illinois, Urbana-Champaign, USA (Virtual Conference)., pp. 42:1-42:7, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-249-5. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Iwan M. Duursma, Ryan Gabrys, Venkatesan Guruswami, Ting-Chun Lin, Hsin-Po Wang 0001 |
Accelerating Polarization via Alphabet Extension. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX/RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2022, September 19-21, 2022, University of Illinois, Urbana-Champaign, USA (Virtual Conference)., pp. 17:1-17:15, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-249-5. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Yi Li 0002, Honghao Lin, David P. Woodruff, Yuheng Zhang |
Streaming Algorithms with Large Approximation Factors. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX/RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2022, September 19-21, 2022, University of Illinois, Urbana-Champaign, USA (Virtual Conference)., pp. 13:1-13:23, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-249-5. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Yahel Manor, Or Meir |
Lifting with Inner Functions of Polynomial Discrepancy. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX/RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2022, September 19-21, 2022, University of Illinois, Urbana-Champaign, USA (Virtual Conference)., pp. 26:1-26:17, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-249-5. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Hamed Hatami, Pooya Hatami, William Pires, Ran Tao, Rosie Zhao |
Lower Bound Methods for Sign-Rank and Their Limitations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX/RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2022, September 19-21, 2022, University of Illinois, Urbana-Champaign, USA (Virtual Conference)., pp. 22:1-22:24, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-249-5. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Marcos Kiwi, Markus Schepers, John Sylvester 0001 |
Cover and Hitting Times of Hyperbolic Random Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX/RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2022, September 19-21, 2022, University of Illinois, Urbana-Champaign, USA (Virtual Conference)., pp. 30:1-30:19, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-249-5. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Vishwas Bhargava, Ankit Garg, Neeraj Kayal, Chandan Saha 0001 |
Learning Generalized Depth Three Arithmetic Circuits in the Non-Degenerate Case. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX/RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2022, September 19-21, 2022, University of Illinois, Urbana-Champaign, USA (Virtual Conference)., pp. 21:1-21:22, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-249-5. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Chin Ho Lee, Edward Pyne, Salil P. Vadhan |
Fourier Growth of Regular Branching Programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX/RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2022, September 19-21, 2022, University of Illinois, Urbana-Champaign, USA (Virtual Conference)., pp. 2:1-2:21, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-249-5. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Louis Esperet, Nathaniel Harms, Andrey Kupavskii |
Sketching Distances in Monotone Graph Classes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX/RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2022, September 19-21, 2022, University of Illinois, Urbana-Champaign, USA (Virtual Conference)., pp. 18:1-18:23, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-249-5. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Suprovat Ghoshal, Anand Louis |
Approximating CSPs with Outliers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX/RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2022, September 19-21, 2022, University of Illinois, Urbana-Champaign, USA (Virtual Conference)., pp. 43:1-43:16, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-249-5. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Suprovat Ghoshal |
The Biased Homogeneous r-Lin Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX/RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2022, September 19-21, 2022, University of Illinois, Urbana-Champaign, USA (Virtual Conference)., pp. 47:1-47:14, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-249-5. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|