default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID32nd SODA 2021: Virtual Conference
- Dániel Marx:
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, SODA 2021, Virtual Conference, January 10 - 13, 2021. SIAM 2021, ISBN 978-1-61197-646-5 - Front Matter. 1-22
- Kuan Cheng, Venkatesan Guruswami, Bernhard Haeupler
, Xin Li:
Efficient Linear and Affine Codes for Correcting Insertions/Deletions. 1-20 - Venkatesan Guruswami, Johan Håstad:
Explicit two-deletion codes with redundancy matching the existential bound. 21-32 - Chaoping Xing, Chen Yuan:
Beating the probabilistic lower bound on perfect hashing. 33-41 - Thomas Bläsius, Tobias Friedrich, Andreas Göbel, Jordi Levy, Ralf Rothenberger:
The Impact of Heterogeneity and Geometry on the Proof Complexity of Random Satisfiability. 42-53 - Xi Chen, Anindya De, Chin Ho Lee, Rocco A. Servedio, Sandip Sinha:
Polynomial-time trace reconstruction in the smoothed complexity model. 54-73 - Jie Han, Xichao Shu, Guanghui Wang:
Non-linear Hamilton cycles in linear quasi-random hypergraphs. 74-88 - Anupam Gupta, Euiwoong Lee, Jason Li:
The Connectivity Threshold for Dense Graphs. 89-105 - Shuji Kijima, Nobutaka Shimizu, Takeharu Shiraga:
How Many Vertices Does a Random Walk Miss in a Network with Moderately Increasing the Number of Vertices? 106-122 - Nemanja Draganic, Michael Krivelevich, Rajko Nenadov:
Rolling backwards can move you forward: on embedding problems in sparse expanders. 123-134 - Eoin Hurley, Rémi de Joannis de Verclos, Ross J. Kang:
An improved procedure for colouring graphs of bounded local density. 135-148 - Eun Jung Kim, Stefan Kratsch, Marcin Pilipczuk, Magnus Wahlström:
Solving hard cut problems via flow-augmentation. 149-168 - William Lochet:
A Polynomial Time Algorithm for the k-Disjoint Shortest Paths Problem. 169-178 - Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi:
Efficient Computation of Representative Weight Functions with Applications to Parameterized Counting (Extended Version). 179-198 - Daniel Lokshtanov, Pranabendu Misra, M. S. Ramanujan, Saket Saurabh, Meirav Zehavi:
FPT-approximation for FPT Problems. 199-218 - Kristine Vitting Klinkby, Pranabendu Misra, Saket Saurabh:
Strong Connectivity Augmentation is FPT. 219-234 - James B. Orlin, László A. Végh:
Directed Shortest Paths via Approximate Cost Balancing. 235-254 - Adam Karczmarz, Piotr Sankowski:
A Deterministic Parallel APSP Algorithm and its Applications. 255-272 - Fabrizio Grandoni, Giuseppe F. Italiano, Aleksander Lukasiewicz, Nikos Parotsidis, Przemyslaw Uznanski:
All-Pairs LCA in DAGs: Breaking through the O(n2.5) barrier. 273-289 - Shiri Chechik, Gur Lifshitz:
Optimal Girth Approximation for Dense Directed Graphs. 290-300 - Yossi Azar, Runtian Ren, Danny Vainstein:
The Min-Cost Matching with Concave Delays Problem. 301-320 - Clément L. Canonne, Xi Chen, Gautam Kamath, Amit Levi, Erik Waingarten:
Random Restrictions of High Dimensional Distributions and Uniformity Testing with Subcube Conditioning. 321-336 - Dana Ron, Asaf Rosin:
Optimal Distribution-Free Sample-Based Testing of Subsequence-Freeness. 337-256 - Shyam Narayanan:
On Tolerant Distribution Testing in the Conditional Sampling Model. 357-373 - David Steurer, Stefan Tiegel:
SoS Degree Reduction with Applications to Clustering and Robust Moment Estimation. 374-393 - Jasper C. H. Lee, Paul Valiant:
Uncertainty about Uncertainty: Optimal Adaptive Algorithms for Estimating Mixtures of Unknown Coins. 414-433 - Suprovat Ghoshal, Anand Louis:
Approximation Algorithms and Hardness for Strong Unique Games. 414-433 - Per Austrin, Jonah Brown-Cohen, Johan Håstad:
Optimal Inapproximability with Universal Factor Graphs. 434-453 - Jackson Abascal, Venkatesan Guruswami, Pravesh K. Kothari:
Strongly refuting all semi-random Boolean CSPs. 454-472 - Miguel Romero, Marcin Wrochna, Stanislav Zivný:
Treewidth-Pliability and PTAS for Max-CSPs. 473-483 - Joshua Brakensiek, Neng Huang, Aaron Potechin, Uri Zwick:
On the Mysteries of MAX NAE-SAT. 484-503 - Richard Peng, Santosh S. Vempala:
Solving Sparse Linear Systems Faster than Matrix Multiplication. 504-521 - Josh Alman, Virginia Vassilevska Williams:
A Refined Laser Method and Faster Matrix Multiplication. 522-539 - Arun Jambulapati, Aaron Sidford:
Ultrasparse Ultrasparsifiers and Faster Laplacian System Solvers. 540-559 - Arvind V. Mahankali, David P. Woodruff:
Optimal ℓ1 Column Subset Selection and a Fast PTAS for Low Rank Approximation. 560-578 - Santanu S. Dey, Yatharth Dubey, Marco Molinaro:
Branch-and-Bound Solves Random Binary IPs in Polytime. 579-591 - Noam Nisan:
The Demand Query Model for Bipartite Matching. 592-599 - Alexander Kozachinskiy:
Polyhedral Value Iteration for Discounted Games and Energy Games. 600-616 - Guy Avni, Ismaël Jecker, Dorde Zikelic:
Infinite-Duration All-Pay Bidding Games. 617-636 - Ronen Gradwohl, Niklas Hahn, Martin Hoefer, Rann Smorodinsky:
Algorithms for Persuasion with Limited Communication. 637-652 - Sepehr Assadi, Thomas Kesselheim, Sahil Singla:
Improved Truthful Mechanisms for Subadditive Combinatorial Auctions: Breaking the Logarithmic Barrier. 653-661 - Alessandra Graf, David G. Harris, Penny Haxell:
Algorithms for weighted independent transversals and strong colouring. 662-674 - Joachim Gudmundsson, Sampson Wong:
Improving the dilation of a metric graph by adding edges. 675-683 - Nithin Varma, Yuichi Yoshida:
Average Sensitivity of Graph Algorithms. 684-703 - Karthik C. S., Merav Parter:
Deterministic Replacement Path Covering. 704-723 - Robert Cummings, Matthew Fahrbach, Animesh Fatehpuria:
A Fast Minimum Degree Algorithm and Matching Lower Bound. 724-734 - Arturo Merino, Ondrej Micka, Torsten Mütze:
On a combinatorial generation problem of Knuth. 735-743 - Nicola Prezza:
On Locating Paths in Compressed Tries. 744-760 - Diptarka Chakraborty, Debarati Das, Robert Krauthgamer:
Approximating the Median under the Ulam Metric. 761-775 - Matthieu Rosenfeld:
The Growth Rate Over Trees Of Any Family Of Sets Defined By A Monadic Second Order Formula Is Semi-computable. 776-795 - Jiehua Chen, Wojciech Czerwinski, Yann Disser, Andreas Emil Feldmann, Danny Hermelin, Wojciech Nadara, Marcin Pilipczuk, Michal Pilipczuk, Manuel Sorge, Bartlomiej Wróblewski, Anna Zych-Pawlewicz:
Efficient fully dynamic elimination forests with applications to detecting long paths and cycles. 796-809 - Haitao Wang:
Shortest Paths Among Obstacles in the Plane Revisited. 810-821 - Neeraj Kumar, Daniel Lokshtanov, Saket Saurabh, Subhash Suri:
A Constant Factor Approximation for Navigating Through Connected Obstacles in the Plane. 822-839 - Ziyun Huang, Qilong Feng, Jianxin Wang, Jinhui Xu:
PTAS for Minimum Cost Multi-covering with Disks. 840-859 - Parinya Chalermsook, Bartosz Walczak:
Coloring and Maximum Weight Independent Set of Rectangles. 860-868 - Nathaniel Lahn, Sharath Raghvendra:
An O(n5/4) Time ∊-Approximation Algorithm for RMS Matching in a Plane. 869-888 - Padraig Condon, Alberto Espuny Díaz, António Girão, Daniela Kühn, Deryk Osthus:
Hamiltonicity of random subgraphs of the hypercube. 889-898 - Patrick Morris:
A tight condition for triangle factors in pseudorandom graphs. 890-918 - Atul Singh Arora, Jérémie Roland, Chrysoula Vlachou:
Analytic quantum weak coin flipping protocols with arbitrarily small bias. 919-938 - Troy Lee, Miklos Santha, Shengyu Zhang:
Quantum algorithms for graph problems with cut queries. 939-958 - Zhengfeng Ji, Zhihan Jin, Pinyan Lu:
Approximating Permanent of Random Matrices with Vanishing Mean: Made Better and Simpler. 959-975 - Haotian Jiang:
Minimizing Convex Functions with Integral Minimizers. 976-985 - Nikhil Bansal, Jatin Batra, Majid Farhadi, Prasad Tetali:
Improved Approximations for Min Sum Vertex Cover and Generalized Min Sum Set Cover. 998-1005 - Mehrdad Ghadiri, Richard Santiago, F. Bruce Shepherd:
Beyond Submodular Maximization via One-Sided Smoothness. 1006-1025 - Karthekeyan Chandrasekaran, Chandra Chekuri:
Min-max Partitioning of Hypergraphs and Symmetric Submodular Functions. 1026-1038 - Lap Chi Lau, Hong Zhou:
A Local Search Framework for Experimental Design. 1039-1058 - Allen Liu, Renato Paes Leme, Jon Schneider:
Optimal Contextual Pricing and Extensions. 1059-1078 - Yang Cai, Kira Goldner, Steven Ma, Mingfei Zhao:
On Multi-Dimensional Gains from Trade Maximization. 1079-1098 - Mahsa Derakhshan, David M. Pennock, Aleksandrs Slivkins:
Beating Greedy For Approximating Reserve Prices in Multi-Unit VCG Auctions. 1099-1118 - Wenzheng Li, Jan Vondrák:
Estimating the Nash Social Welfare for coverage and other submodular valuations. 1119-1130 - Yuan Deng, Debmalya Panigrahi, Hanrui Zhang:
Online Combinatorial Auctions. 1131-1149 - Arnold Filtser, Omrit Filtser:
Static and Streaming Data Structures for Fréchet Distance Queries. 1150-1170 - Alexandr Andoni, Aleksandar Nikolov, Ilya P. Razenshteyn, Erik Waingarten:
Approximate Nearest Neighbors Beyond Space Partitions. 1171-1190 - Yakov Nekrich:
New Data Structures for Orthogonal Range Reporting and Range Minima Queries. 1191-1205 - Parinya Chalermsook, Syamantak Das, Yunbum Kook, Bundit Laekhanukit, Yang P. Liu, Richard Peng, Mark Sellke, Daniel Vaz:
Vertex Sparsification for Edge Connectivity. 1206-1225 - Sebastian Forster, Gramoz Goranci, Monika Henzinger:
Dynamic Maintenance of Low-Stretch Probabilistic Tree Embeddings with Applications. 1226-1245 - Daniel M. Kane:
Robust Learning of Mixtures of Gaussians. 1246-1258 - Shyam Narayanan:
Improved Algorithms for Population Recovery from the Deletion Channel. 1259-1278 - Ainesh Bakshi, Pravesh K. Kothari:
List-Decodable Subspace Recovery: Dimension Independent Error in Polynomial Time. 1279-1297 - Jess Banks, Sidhanth Mohanty, Prasad Raghavendra:
Local Statistics, Semidefinite Programming, and Community Detection. 1298-1316 - Yanjun Han, Kirankumar Shiragur:
On the Competitive Analysis and High Accuracy Optimality of Profile Maximum Likelihood. 1317-1336 - Yang Cai, Argyris Oikonomou, Grigoris Velegkas, Mingfei Zhao:
An Efficient ∊-BIC to BIC Transformation and Its Application to Black-Box Reduction in Revenue Maximization. 1337-1356 - Santiago R. Balseiro, Vahab S. Mirrokni, Renato Paes Leme, Song Zuo:
Non-Excludable Dynamic Mechanism Design. 1357-1373 - Yash Kanoria, Seungki Min, Pengyu Qian:
In which matching markets does the short side enjoy an advantage? 1374-1386 - Jacob D. Abernethy, Kevin A. Lai, Andre Wibisono:
Fast Convergence of Fictitious Play for Diagonal Payoff Matrices. 1387-1404 - Bhaskar Ray Chaudhury, Jugal Garg, Peter McGlaughlin, Ruta Mehta:
Competitive Allocation of a Mixed Manna. 1405-1424 - Pankaj K. Agarwal, Micha Sharir, Alex Steiger:
Decomposing the Complement of the Union of Cubes in Three Dimensions. 1425-1444 - Kent Quanrud:
Spectral Sparsification of Metrics and Kernels. 1445-1464 - Timothy M. Chan:
(Near-)Linear-Time Randomized Algorithms for Row Minima in Monge Partial Matrices and Related Problems. 1465-1482 - Timothy M. Chan:
Near-Optimal Randomized Algorithms for Selection in Totally Monotone Matrices. 1483-1495 - Dale Koenig, Anastasiia Tsvietkova:
Unlinking, splitting, and some other NP-hard problems in knot theory. 1496-1507 - Pjotr Buys, Andreas Galanis, Viresh Patel, Guus Regts:
Lee-Yang zeros and the complexity of the ferromagnetic Ising Model on bounded-degree graphs. 1508-1519 - Jin-Yi Cai, Tianyu Liu:
An FPTAS for the square lattice six-vertex and eight-vertex models at low temperatures. 1520-1534 - Jin-Yi Cai, Zhiguo Fu, Shuai Shao:
New Planar P-time Computable Six-Vertex Models and a Complete Complexity Classification. 1535-1547 - Zongchen Chen, Andreas Galanis, Daniel Stefankovic, Eric Vigoda:
Rapid Mixing for Colorings via Spectral Independence. 1548-1557 - Weiming Feng, Heng Guo, Yitong Yin, Chihao Zhang:
Rapid Mixing from Spectral Independence beyond the Boolean Domain. 1558-1577 - Isolde Adler, Noleen Köhler, Pan Peng:
On Testability of First-Order Properties in Bounded-Degree Graphs. 1578-1597 - Grzegorz Gluch, Michael Kapralov, Silvio Lattanzi, Aida Mousavifar, Christian Sohler:
Spectral Clustering Oracles in Sublinear Time. 1598-1617 - Nimrod Fiat, Dana Ron:
On Efficient Distance Approximation for Graph Properties. 1618-1637 - Guy Blanc, Jane Lange, Li-Yang Tan:
Query strategies for priced information, revisited. 1638-1650 - Marcel de Sena Dall'Agnol, Tom Gur, Oded Lachish:
A Structural Theorem for Local Algorithms with Applications to Coding, Testing, and Privacy. 1651-1665 - Jana Cslovjecsek, Friedrich Eisenbrand, Christoph Hunkenschröder, Lars Rohwedder, Robert Weismantel:
Block-Structured Integer and Linear Programming in Strongly Polynomial and Near Linear Time. 1666-1681 - Jesper Nederlof, Jakub Pawlewicz, Céline M. F. Swennenhuis, Karol Wegrzycki:
A Faster Exponential Time Algorithm for Bin Packing With a Constant Number of Bins via Additive Combinatorics. 1682-1701 - Stefan Kratsch, Tomás Masarík, Irene Muzi, Marcin Pilipczuk, Manuel Sorge:
Optimal Discretization is Fixed-parameter Tractable. 1702-1719 - Jan Dreier, Peter Rossmanith:
Approximate Evaluation of First-Order Counting Queries. 1720-1739 - Pankaj K. Agarwal, Boris Aronov, Tzvika Geft, Dan Halperin:
On Two-Handed Planar Assembly Partitioning with Connectivity Constraints. 1740-1756 - Ce Jin, Nikhil Vyas, Ryan Williams:
Fast Low-Space Algorithms for Subset Sum. 1757-1776 - Karl Bringmann, Philip Wellnitz:
On Near-Linear-Time Algorithms for Dense Subset Sum. 1777-1796 - Karl Bringmann, Vasileios Nakos:
A Fine-Grained Perspective on Approximating Subset Sum and Partition. 1797-1815 - Divesh Aggarwal, Huck Bennett, Alexander Golovnev, Noah Stephens-Davidowitz:
Fine-grained hardness of CVP(P) - Everything that we can prove (and nothing else). 1816-1835 - Thiago Bergamaschi, Monika Henzinger, Maximilian Probst Gutenberg, Virginia Vassilevska Williams, Nicole Wein:
New Techniques and Fine-Grained Hardness for Dynamic Near-Additive Spanners. 1836-1855 - Huacheng Yu:
Tight Distributed Sketching Lower Bound for Connectivity. 1856-1873 - Michael Kapralov:
Space Lower Bounds for Approximating Maximum Matching in the Edge Arrival Model. 1874-1893 - Arnold Filtser, Michael Kapralov, Navid Nouri:
Graph Spanners by Sketching in Dynamic Streams and the Simultaneous Communication Model. 1894-1913 - Roie Levin, David Wajc:
Streaming Submodular Matching Meets the Primal-Dual Method. 1914-1933 - Michael Mitzenmacher, Saeed Seddighin:
Improved Sublinear Time Algorithm for Longest Increasing Subsequence. 1934-1947 - Tara Abrishami, Maria Chudnovsky, Marcin Pilipczuk, Pawel Rzazewski, Paul D. Seymour:
Induced subgraphs of bounded treewidth and the container method. 1948-1964 - Carla Groenland, Gwenaël Joret, Wojciech Nadara, Bartosz Walczak:
Approximating Pathwidth for Graphs of Small Treewidth. 1965-1976 - Édouard Bonnet, Colin Geniet, Eun Jung Kim, Stéphan Thomassé, Rémi Watrigant:
Twin-width II: small classes. 1977-1996 - Chun-Hung Liu:
Asymptotic dimension of minor-closed families and beyond. 1997-2013 - Jaroslav Nesetril, Patrice Ossona de Mendez, Michal Pilipczuk, Roman Rabinovich, Sebastian Siebertz:
Rankwidth meets stability. 2014-2033 - Makis Arsenis, Odysseas Drosis, Robert Kleinberg:
Constrained-Order Prophet Inequalities. 2034-2046 - José Correa, Andrés Cristi, Laurent Feuilloley, Tim Oosterwijk, Alexandros Tsigonias-Dimitriadis:
The Secretary Problem with Independent Sampling. 2047-2058 - Michael A. Bender, William Kuszmaul:
Randomized Cup Game Algorithms Against Strong Adversaries. 2059-2077 - Marco Molinaro:
Robust Algorithms for Online Convex Problems via Primal-Dual. 2078-2092 - Sébastien Bubeck, Yuval Rabani, Mark Sellke:
Online Multiserver Convex Chasing and Optimization. 2093-2104 - Peter Robinson:
Being Fast Means Being Chatty: The Local Information Cost of Graph Spanners. 2105-2120 - Weiming Feng, Thomas P. Hayes, Yitong Yin:
Distributed Metropolis Sampler with Optimal Parallelism. 2121-2140 - Michael T. Goodrich, Riko Jacob, Nodari Sitchinava:
Atomic Power in Forks: A Super-Logarithmic Lower Bound for Implementing Butterfly Networks in the Nonatomic Binary Fork-Join Model. 2141-2153 - Paul Bastide, George Giakkoupis, Hayk Saribekyan:
Self-Stabilizing Clock Synchronization with 1-bit Messages. 2154-2173 - Pawel Gawrychowski, Wojciech Janczewski, Jakub Lopuszanski:
Shorter Labels for Routing in Trees. 2174-2193 - Stefan Walzer:
Peeling Close to the Orientability Threshold - Spatial Coupling in Hashing-Based Data Structures. 2194-2211 - Gramoz Goranci, Harald Räcke, Thatchaphol Saranurak, Zihan Tan:
The Expander Hierarchy and its Applications to Dynamic Graph Algorithms. 2212-2228 - Peyman Afshani:
A Lower Bound for Dynamic Fractional Cascading. 2229-2248 - Gilad Asharov, Wei-Kai Lin, Elaine Shi:
Sorting Short Keys in Circuits of Size o(n log n). 2249-2268 - Claire Mathieu, Rajmohan Rajaraman, Neal E. Young, Arman Yousefi:
Competitive Data-Structure Dynamization. 2269-2287 - Chaim Even-Zohar, Calvin Leng:
Counting Small Permutation Patterns. 2288-2302 - Jacob Focke, Leslie Ann Goldberg, Marc Roth, Stanislav Zivný:
Counting Homomorphisms to K4-minor-free Graphs, modulo 2. 2303-2314 - Suman K. Bera, Noujan Pashanasangi, C. Seshadhri:
Near-Linear Time Homomorphism Counting in Bounded Degeneracy Graphs: The Barrier of Long Induced Cycles. 2315-2332 - Andreas Björklund, Petteri Kaski:
The Fine-Grained Complexity of Computing the Tutte Polynomial of a Linear Matroid. 2333-2345 - Shuichi Hirahara, Nobutaka Shimizu:
Nearly Optimal Average-Case Complexity of Counting Bicliques Under SETH. 2346-2365 - Zahra Jafargholi, Kasper Green Larsen, Mark Simkin:
Optimal Oblivious Priority Queues. 2366-2383 - Victor Balcer, Albert Cheu, Matthew Joseph, Jieming Mao:
Connecting Robust Shuffle Privacy and Pan-Privacy. 2384-2403 - Nick Gravin, Siyao Guo, Tsz Chiu Kwok, Pinyan Lu:
Concentration bounds for almost k-wise independence with applications to non-uniform security. 2404-2423 - Kuan Cheng, Xin Li:
Efficient Document Exchange and Error Correcting Codes with Asymmetric Information. 2424-2443 - Divesh Aggarwal, Yanlin Chen, Rajendra Kumar, Zeyong Li, Noah Stephens-Davidowitz:
Dimension-Preserving Reductions Between SVP and CVP in Different p-Norms. 2444-2462 - Shiri Chechik, Tianyi Zhang:
Incremental Single Source Shortest Paths in Sparse Digraphs. 2463-2477 - Julia Chuzhoy, Thatchaphol Saranurak:
Deterministic Algorithms for Decremental Shortest Paths via Layered Core Decomposition. 2478-2496 - Ran Duan, Yong Gu, Hanlin Ren:
Approximate Distance Oracles Subject to Multiple Vertex Failures. 2497-2516 - Yaowei Long, Seth Pettie:
Planar Distance Oracles with Better Time-Space Tradeoffs. 2517-2537 - Sayan Bhattacharya, Monika Henzinger, Danupon Nanongkai, Xiaowei Wu:
Dynamic Set Cover: Improved Amortized and Worst-Case Update Time. 2537-2549 - Itai Dinur:
Improved Algorithms for Solving Polynomial Systems over GF(2) by Multiple Parity-Counting. 2550-2564 - Markus Bläser, Christian Ikenmeyer, Vladimir Lysikov, Anurag Pandey, Frank-Olaf Schreyer:
On the Orbit Closure Containment Problem and Slice Rank of Tensors. 2565-2584 - Nicola Cotumaccio, Nicola Prezza:
On Indexing and Compressing Finite Automata. 2585-2599 - Martin Grohe, Pascal Schweitzer, Daniel Wiebking:
Deep Weisfeiler Leman. 2600-2614 - Aris Filos-Ratsikas, Alexandros Hollender, Katerina Sotiraki, Manolis Zampetakis:
A Topological Characterization of Modulo-p Arguments and Implications for Necklace Splitting. 2615-2634 - Vincent Cohen-Addad, Karthik C. S., Euiwoong Lee:
On Approximability of Clustering Problems Without Candidate Centers. 2635-2648 - Eduard Eiben, Fedor V. Fomin, Petr A. Golovach, William Lochet, Fahad Panolan, Kirill Simonov:
EPTAS for k-means Clustering of Affine Subspaces. 2649-2659 - Hendrik Fichtenberger, Silvio Lattanzi, Ashkan Norouzi-Fard, Ola Svensson:
Consistent k-Clustering for General Metrics. 2660-2678 - Vladimir Braverman, Shaofeng H.-C. Jiang, Robert Krauthgamer, Xuan Wu:
Coresets for Clustering in Excluded-minor Graphs and Beyond. 2679-2696 - Maike Buchin, Anne Driemel, Dennis Rohde:
Approximating (k, ℓ-Median Clustering for Polygonal Curves. 2697-2717 - Pawel Gawrychowski, Shay Mozes, Oren Weimann:
Planar Negative k-Cycle. 2717-2724 - Sarah Morell, Ina Seidel, Stefan Weltge:
Minimum-cost integer circulations in given homology classes. 2725-2739 - Giuseppe F. Italiano, Adam Karczmarz, Nikos Parotsidis:
Planar Reachability Under Single Vertex or Edge Failures. 2739-2758 - Erin Wolf Chambers, Jeff Erickson, Patrick Lin, Salman Parsa:
How to Morph Graphs on the Torus. 2759-2778 - Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani:
2-Level Quasi-Planarity or How Caterpillars Climb (SPQR-)Trees. 2779-2798 - Monika Henzinger, Stefan Neumann, Harald Räcke, Stefan Schmid:
Tight Bounds for Online Graph Partitioning. 2799-2818 - Viswanath Nagarajan, Lily Wang:
Online Generalized Network Design Under (Dis)Economies of Scale. 2819-2829 - Sayan Bhattacharya, Fabrizio Grandoni, David Wajc:
Online Edge Coloring Algorithms via the Nibble Method. 2830-2842 - Nikhil Bansal, Haotian Jiang, Raghu Meka, Sahil Singla, Makrand Sinha:
Online Discrepancy Minimization for Stochastic Arrivals. 2842-2861 - Yiding Feng, Rad Niazadeh, Amin Saberi:
Two-stage Stochastic Matching with Application to Ride Hailing. 2862-2877 - Keren Censor-Hillel, Yi-Jun Chang, François Le Gall, Dean Leitersdorf:
Tight Distributed Listing of Cliques. 2878-2891 - Mohsen Ghaffari, Bernhard Haeupler:
A Time-Optimal Randomized Parallel Algorithm for MIS. 2892-2903 - Mohsen Ghaffari, Christoph Grunau, Václav Rozhon:
Improved Deterministic Network Decomposition. 2904-2923 - Greg Bodwin, Michael Dinitz, Caleb Robelle:
Optimal Vertex Fault-Tolerant Spanners in Polynomial Time. 2924-2938 - Krzysztof Nowicki, Krzysztof Onak:
Dynamic Graph Algorithms with Batch Updates in the Massively Parallel Computation Model. 2939-2958 - Sami Davies, Janardhan Kulkarni, Thomas Rothvoss, Jakub Tarnawski, Yihao Zhang:
Scheduling with Communication Delays via LP Hierarchies and Clustering II: Weighted Completion Times on Related Machines. 2958-2977 - Naveen Garg, Sanjeev Khanna, Amit Kumar:
Hardness of Approximation for Orienteering with Multiple Time Windows. 2977-2990 - Shi Li:
Towards PTAS for Precedence Constrained Scheduling via Combinatorial Algorithms. 2991-3010 - Nikhil Bansal, Jatin Batra:
Non-uniform Geometric Set Cover and Scheduling on Multiple Machines. 3011-3021 - Kunal Agrawal, Michael A. Bender, Rathish Das, William Kuszmaul, Enoch Peserico, Michele Scquizzato:
Tight Bounds for Parallel Paging and Green Paging. 3022-3041
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-05-28 20:19 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
