|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 167 occurrences of 134 keywords
|
|
|
|
|
Results
Found 4524 publication records. Showing 4524 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Monika Henzinger, Andrea Lincoln, Barna Saha |
The Complexity of Average-Case Dynamic Subgraph Counting.  |
SODA  |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Dmitriy Kunisky, Jonathan Niles-Weed |
Strong recovery of geometric planted matchings. |
SODA |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Avi Kadria, Liam Roditty, Aaron Sidford, Virginia Vassilevska Williams, Uri Zwick |
Algorithmic trade-offs for girth approximation in undirected graphs. |
SODA |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Tali Kaufman, Rasmus Kyng, Federico Soldà |
Scalar and Matrix Chernoff Bounds from ℓ∞-Independence. |
SODA |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Moses Charikar, Prasanna Ramakrishnan |
Metric Distortion Bounds for Randomized Social Choice. |
SODA |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Soh Kumabe, Yuichi Yoshida |
Average Sensitivity of Dynamic Programming. |
SODA |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Sabyasachi Basu, Akash Kumar 0003, C. Seshadhri 0001 |
The complexity of testing all properties of planar graphs, and the role of isomorphism. |
SODA |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Ariel D. Procaccia, Jamie Tucker-Foltz |
Compact Redistricting Plans Have Many Spanning Trees. |
SODA |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Edin Husic, Georg Loho, Ben Smith, László A. Végh |
On complete classes of valuated matroids. |
SODA |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Sumanta Ghosh, Rohit Gurjar, Roshan Raj |
A Deterministic Parallel Reduction from Weighted Matroid Intersection Search to Decision. |
SODA |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Debarati Das 0001, Maximilian Probst Gutenberg, Christian Wulff-Nilsen |
A Near-Optimal Offline Algorithm for Dynamic All-Pairs Shortest Paths in Planar Digraphs. |
SODA |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Lijie Chen 0001, Ce Jin 0001, R. Ryan Williams, Hongxun Wu |
Truly Low-Space Element Distinctness and Subset Sum via Pseudorandom Hash Functions. |
SODA |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Jugal Garg, Yixin Tao, László A. Végh |
Approximating Equilibrium under Constrained Piecewise Linear Concave Utilities with Applications to Matching Markets. |
SODA |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Bryce Sandlund, Lingyi Zhang |
Selectable Heaps and Optimal Lazy Search Trees. |
SODA |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Souvik Dhara, Julia Gaudio, Elchanan Mossel, Colin Sandon |
Spectral recovery of binary censored block models. |
SODA |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Jiashuo Jiang, Will Ma, Jiawei Zhang 0006 |
Tight Guarantees for Multi-unit Prophet Inequalities and Online Stochastic Knapsack. |
SODA |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Dingding Dong, Nitya Mani, Yufei Zhao |
Enumerating k-SAT functions. |
SODA |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Lin Chen 0009, Liangde Tao, José Verschae |
Tight running times for minimum ℓq-norm load balancing: beyond exponential dependencies on 1/∊. |
SODA |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Zongchen Chen, Andreas Galanis, Daniel Stefankovic, Eric Vigoda |
Sampling Colorings and Independent Sets of Random Regular Bipartite Graphs in the Non-Uniqueness Region. |
SODA |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Jacob Focke, Dániel Marx, Pawel Rzazewski |
Counting list homomorphisms from graphs of bounded treewidth: tight complexity bounds. |
SODA |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Dániel Marx, Pranabendu Misra, Daniel Neuen, Prafullkumar Tale |
A Framework for Parameterized Subexponential Algorithms for Generalized Cycle Hitting Problems on Planar Graphs. |
SODA |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Maryam Fazel, Yin Tat Lee, Swati Padmanabhan, Aaron Sidford |
Computing Lewis Weights to High Precision. |
SODA |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Anindya De, Shivam Nadimpalli, Rocco A. Servedio |
Approximating Sumset Size. |
SODA |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Jun-Ting Hsieh, Pravesh K. Kothari |
Algorithmic Thresholds for Refuting Random Polynomial Systems. |
SODA |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Matthew Jenssen, Aditya Potukuchi, Will Perkins 0001 |
Approximately counting independent sets in bipartite graphs via graph containers. |
SODA |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Constantine Caramanis, Paul Dütting, Matthew Faw, Federico Fusco, Philip Lazos, Stefano Leonardi 0001, Orestis Papadigenopoulos, Emmanouil Pountourakis, Rebecca Reiffenhäuser |
Single-Sample Prophet Inequalities via Greedy-Ordered Selection. |
SODA |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Manuel Cáceres, Massimo Cairo, Brendan Mumey, Romeo Rizzi, Alexandru I. Tomescu |
Sparsifying, Shrinking and Splicing for Minimum Path Cover in Parameterized Linear Time. |
SODA |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Bartlomiej Dudek 0001, Pawel Gawrychowski, Garance Gourdel, Tatiana Starikovskaya |
Streaming Regular Expression Membership and Pattern Matching. |
SODA |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Karl Bringmann, Nick Fischer, Vasileios Nakos |
Deterministic and Las Vegas Algorithms for Sparse Nonnegative Convolution. |
SODA |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Yeganeh Alimohammadi, Christian Borgs, Amin Saberi |
Algorithms Using Local Graph Features to Predict Epidemics. |
SODA |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Xi Chen 0001, Yaonan Jin, Tim Randolph 0001, Rocco A. Servedio |
Average-Case Subset Balancing Problems. |
SODA |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Piotr Indyk, Shyam Narayanan, David P. Woodruff |
Frequency Estimation with One-Sided Error. |
SODA |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Adam Karczmarz |
Improved Strongly Polynomial Algorithms for Deterministic MDPs, 2VPI Feasibility, and Discounted All-Pairs Shortest Paths. |
SODA |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Mitali Bafna, Max Hopkins, Tali Kaufman, Shachar Lovett |
High Dimensional Expanders: Eigenstripping, Pseudorandomness, and Unique Games. |
SODA |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Jean Cardinal, Arturo I. Merino, Torsten Mütze |
Efficient generation of elimination trees and graph associahedra. |
SODA |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Nägele, Richard Santiago, Rico Zenklusen |
Congruency-Constrained TU Problems Beyond the Bimodular Case. |
SODA |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Albert Atserias, Víctor Dalmau |
Promise Constraint Satisfaction and Width. |
SODA |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Dvir Fried, Shay Golan 0001, Tomasz Kociumaka, Tsvi Kopelowitz, Ely Porat, Tatiana Starikovskaya |
An Improved Algorithm for The k-Dyck Edit Distance Problem. |
SODA |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Wei-Kai Lin, Elaine Shi |
Optimal Sorting Circuits for Short Keys. |
SODA |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Zi Yang Kang, Francisco Pernice, Jan Vondrák |
Fixed-Price Approximations in Bilateral Trade. |
SODA |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel Neuen |
Isomorphism Testing for Graphs Excluding Small Topological Subgraphs. |
SODA |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Gregor Bankhamer, Petra Berenbrink, Felix Biermeier, Robert Elsässer, Hamed Hosseinpour, Dominik Kaaser, Peter Kling |
Fast Consensus via the Unconstrained Undecided State Dynamics. |
SODA |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Rasmus Kyng, Simon Meierhans, Maximilian Probst Gutenberg |
Incremental SSSP for Sparse Digraphs Beyond the Hopset Barrier. |
SODA |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Haotian Wang 0002, Feng Luo, Jie Gao 0001 |
Co-evolution of Opinion and Social Tie Dynamics Towards Structural Balance. |
SODA |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Christopher J. Bishop |
Optimal angle bounds for Steiner triangulations of polygons. |
SODA |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Sami Davies, Janardhan Kulkarni, Thomas Rothvoss, Sai Sandeep, Jakub Tarnawski, Yihao Zhang |
On the Hardness of Scheduling With Non-Uniform Communication Delays. |
SODA |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Timothy M. Chan, Da Wei Zheng |
Hopcroft's Problem, Log-Star Shaving, 2D Fractional Cascading, and Decision Trees. |
SODA |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Kim-Manuel Klein |
On the Fine-Grained Complexity of the Unbounded SubsetSum and the Frobenius Problem. |
SODA |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Hossein Esfandiari, Vahab S. Mirrokni, Shyam Narayanan |
Almost Tight Approximation Algorithms for Explainable Clustering. |
SODA |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Nadiia Chepurko, Kenneth L. Clarkson, Praneeth Kacham, David P. Woodruff |
Near-Optimal Algorithms for Linear Algebra in the Current Matrix Multiplication Time. |
SODA |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Sepehr Assadi, Arun Jambulapati, Yujia Jin, Aaron Sidford, Kevin Tian |
Semi-Streaming Bipartite Matching in Fewer Passes and Optimal Space. |
SODA |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Yossi Azar, Stefano Leonardi 0001, Noam Touitou |
Distortion-Oblivious Algorithms for Minimizing Flow Time. |
SODA |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Giuseppe Persiano, Kevin Yeo |
Limits of Preprocessing for Single-Server PIR. |
SODA |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Shyan Akmal, Ce Jin 0001 |
Near-Optimal Quantum Algorithms for String Problems. |
SODA |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | David P. Woodruff, Taisuke Yasuda 0002 |
Improved Algorithms for Low Rank Approximation from Sparsity. |
SODA |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Alessandro Epasto, Mohammad Mahdian, Vahab S. Mirrokni, Peilin Zhong |
Massively Parallel and Dynamic Algorithms for Minimum Size Clustering. |
SODA |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Soheil Behnezhad, Sanjeev Khanna |
New Trade-Offs for Fully Dynamic Matching via Hierarchical EDCS. |
SODA |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Libor Barto, Marcin Kozik |
Combinatorial Gap Theorem and Reductions between Promise CSPs. |
SODA |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Marvin Künnemann, André Nusser |
Polygon Placement Revisited: (Degree of Freedom + 1)-SUM Hardness and an Improvement via Offline Dynamic Rectangle Union. |
SODA |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Xi Chen 0001, Anindya De, Chin Ho Lee, Rocco A. Servedio, Sandip Sinha |
Near-Optimal Average-Case Approximate Trace Reconstruction from Few Traces. |
SODA |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Ruoxu Cen, Jason Li 0006, Debmalya Panigrahi |
Augmenting Edge Connectivity via Isolating Cuts. |
SODA |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Shant Boodaghians, Bhaskar Ray Chaudhury, Ruta Mehta |
Polynomial Time Algorithms to Find an Approximate Competitive Equilibrium for Chores. |
SODA |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Manuel Lafond |
Recognizing k-leaf powers in polynomial time, for constant k. |
SODA |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Jian Li 0015, Daogao Liu |
Multi-token Markov Game with Switching Costs. |
SODA |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Lorenzo Beretta 0001, Jakub Tetek |
Better Sum Estimation via Weighted Sampling. |
SODA |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Dominik Kempa, Barna Saha |
An Upper Bound and Linear-Space Queries on the LZ-End Parsing. |
SODA |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Lorenzo Ciardo, Stanislav Zivný |
CLAP: A New Algorithm for Promise CSPs. |
SODA |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Hung Le 0001, Cuong Than |
Greedy Spanners in Euclidean Spaces Admit Sublinear Separators. |
SODA |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Gilad Asharov, Ilan Komargodski, Wei-Kai Lin, Enoch Peserico, Elaine Shi |
Optimal Oblivious Parallel RAM. |
SODA |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Santiago Aranguri, Hsien-Chih Chang, Dylan Fridman |
Untangling Planar Graphs and Curves by Staying Positive. |
SODA |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Moses Charikar, Lunjia Hu |
Near-Optimal Explainable k-Means for All Dimensions. |
SODA |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Thomas Chen, Xi Chen 0001, Binghui Peng, Mihalis Yannakakis |
Computational Hardness of the Hylland-Zeckhauser Scheme. |
SODA |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Kevin Lu, Virginia Vassilevska Williams, Nicole Wein, Zixuan Xu |
Better Lower Bounds for Shortcut Sets and Additive Spanners via an Improved Alternation Product. |
SODA |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Anupam Gupta 0001, Vijaykrishna Gurunathan, Ravishankar Krishnaswamy, Amit Kumar 0001, Sahil Singla 0001 |
Online Discrepancy with Recourse for Vectors and Graphs. |
SODA |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Per Austrin, Kilian Risse |
Perfect Matching in Random Graphs is as Hard as Tseitin. |
SODA |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi 0001, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki |
Monotone edge flips to an orientation of maximum edge-connectivity à la Nash-Williams. |
SODA |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Shucheng Chi, Ran Duan, Tianle Xie |
Faster Algorithms for Bounded-Difference Min-Plus Product. |
SODA |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Antonio Blanca, Pietro Caputo, Zongchen Chen, Daniel Parisi, Daniel Stefankovic, Eric Vigoda |
On Mixing of Markov Chains: Coupling, Spectral Independence, and Entropy Factorization. |
SODA |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Eric Balkanski, Pranav Garimidi, Vasilis Gkatzelis, Daniel Schoepflin 0001, Xizhi Tan |
Deterministic Budget-Feasible Clock Auctions. |
SODA |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Sara Ahmadian, Hossein Esfandiari, Vahab S. Mirrokni, Binghui Peng |
Robust Load Balancing with Machine Learned Advice. |
SODA |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Édouard Bonnet, Eun Jung Kim 0002, Amadeus Reinald, Stéphan Thomassé |
Twin-width VI: the lens of contraction sequences. |
SODA |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Amir Abboud, Robert Krauthgamer, Ohad Trabelsi |
Friendly Cut Sparsifiers and Faster Gomory-Hu Trees. |
SODA |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Max Klimm, Guillaume Sagnol, Martin Skutella, Khai Van Tran |
Competitive Strategies for Symmetric Rendezvous on the Line. |
SODA |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Aditya Jayaprakash, Mohammad R. Salavatipour |
Approximation Schemes for Capacitated Vehicle Routing on Graphs of Bounded Treewidth, Bounded Doubling, or Highway Dimension. |
SODA |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Timothy M. Chan, Qizheng He, Subhash Suri, Jie Xue 0003 |
Dynamic Geometric Set Cover, Revisited. |
SODA |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Sayan Bandyapadhyay, William Lochet, Daniel Lokshtanov, Saket Saurabh 0001, Jie Xue 0003 |
Subexponential Parameterized Algorithms for Cut and Cycle Hitting Problems on H<-Minor-Free Graphs. |
SODA |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Chiranjib Bhattacharyya, Ravindran Kannan, Amit Kumar 0001 |
How many Clusters? - An algorithmic answer. |
SODA |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Vincent Cohen-Addad, Anupam Gupta 0001, Lunjia Hu, Hoon Oh, David Saulpic |
An Improved Local Search Algorithm for k-Median. |
SODA |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Goran Zuzic, Gramoz Goranci, Mingquan Ye, Bernhard Haeupler, Xiaorui Sun |
Universally-Optimal Distributed Shortest Paths and Transshipment via Graph-Based ℓ1-Oblivious Routing. |
SODA |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Aviv Bick, Gillat Kol, Rotem Oshman |
Distributed Zero-Knowledge Proofs Over Networks. |
SODA |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Waldo Gálvez, Arindam Khan 0001, Mathieu Mari, Tobias Mömke, Madhusudhan Reddy Pittu, Andreas Wiese |
A 3-Approximation Algorithm for Maximum Independent Set of Rectangles. |
SODA |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Arun Ganesh, Tomasz Kociumaka, Andrea Lincoln, Barna Saha |
How Compression and Approximation Affect Efficiency in String Distance Measures. |
SODA |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Lior Gishboliner, Yevgeny Levanzov, Asaf Shapira, Raphael Yuster |
Counting Homomorphic Cycles in Degenerate Graphs. |
SODA |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Amin Coja-Oghlan, Oliver Cooley, Mihyun Kang, Joon Lee, Jean Bernoulli Ravelomanana |
The Sparse Parity Matrix. |
SODA |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Hung Le 0001, Shay Solomon |
Near-Optimal Spanners for General Graphs in (Nearly) Linear Time. |
SODA |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Calvin Beideman, Karthekeyan Chandrasekaran, Weihang Wang 0002 |
Deterministic enumeration of all minimum k-cut-sets in hypergraphs for fixed k. |
SODA |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Alessandro Epasto, Mohammad Mahdian, Vahab S. Mirrokni, Peilin Zhong |
Improved Sliding Window Algorithms for Clustering and Coverage via Bucketing-Based Sketches. |
SODA |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Telikepalli Kavitha, Tamás Király, Jannik Matuschke, Ildikó Schlotter, Ulrike Schmidt-Kraepelin |
The popular assignment problem: when cardinality is more important than popularity. |
SODA |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov |
Algorithmic Extensions of Dirac's Theorem. |
SODA |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Sepehr Assadi |
A Two-Pass (Conditional) Lower Bound for Semi-Streaming Maximum Matching. |
SODA |
2022 |
DBLP DOI BibTeX RDF |
|
Displaying result #401 - #500 of 4524 (100 per page; Change: ) Pages: [ <<][ 1][ 2][ 3][ 4][ 5][ 6][ 7][ 8][ 9][ 10][ 11][ 12][ 13][ 14][ >>] |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")
data released under the ODC-BY 1.0 license