SODA - RankMe – RankMe

182 papers

Year	Title / Authors
2020	2-Approximating Feedback Vertex Set in Tournaments. Daniel Lokshtanov, Pranabendu Misra, Joydeep Mukherjee, Fahad Panolan, Geevarghese Philip, Saket Saurabh
2020	A 4 + Zeev Nutov
2020	A Blossom Algorithm for Maximum Edge-Disjoint Satoru Iwata, Yu Yokoi
2020	A Deterministic Linear Program Solver in Current Matrix Multiplication Time. Jan van den Brand
2020	A Little Charity Guarantees Almost Envy-Freeness. Bhaskar Ray Chaudhury, Telikepalli Kavitha, Kurt Mehlhorn, Alkmini Sgouritsa
2020	A Lower Bound for Jumbled Indexing. Peyman Afshani, Ingo van Duijn, Rasmus Killmann, Jesper Sindahl Nielsen
2020	A Lower Bound on Cycle-Finding in Sparse Digraphs. Xi Chen, Tim Randolph, Rocco A. Servedio, Timothy Sun
2020	A New Algorithm for the Robust Semi-random Independent Set Problem. Theo McKenzie, Hermish Mehta, Luca Trevisan
2020	A New Lower Bound on Hadwiger-Debrunner Numbers in the Plane. Chaya Keller, Shakhar Smorodinsky
2020	A PTAS for subset TSP in minor-free graphs. Hung Le
2020	A Strongly Polynomial Algorithm for Finding a Shortest Non-zero Path in Group-Labeled Graphs. Yutaro Yamaguchi
2020	A Tale of Santa Claus, Hypergraphs and Matroids. Sami Davies, Thomas Rothvoss, Yihao Zhang
2020	A Tight Analysis of Greedy Yields Subexponential Time Approximation for Uniform Decision Tree. Ray Li, Percy Liang, Stephen Mussmann
2020	A Truthful Cardinal Mechanism for One-Sided Matching. Rediet Abebe, Richard Cole, Vasilis Gkatzelis, Jason D. Hartline
2020	A complexity dichotomy for hitting connected minors on bounded treewidth graphs: the chair and the banner draw the boundary. Julien Baste, Ignasi Sau, Dimitrios M. Thilikos
2020	A face cover perspective to Arnold Filtser
2020	A nearly 5/3-approximation FPT Algorithm for Min- Ken-ichi Kawarabayashi, Bingkai Lin
2020	A randomly weighted minimum spanning tree with a random cost constraint. Alan M. Frieze, Tomasz Tkocz
2020	Achieving Optimal Backlog in the Vanilla Multi-Processor Cup Game. William Kuszmaul
2020	Adaptive Quantum Simulated Annealing for Bayesian Inference and Estimating Partition Functions. Aram W. Harrow, Annie Y. Wei
2020	Adaptive Shivers Sort: An Alternative Sorting Algorithm. Vincent Jugé
2020	Algorithmic Price Discrimination. Rachel Cummings, Nikhil R. Devanur, Zhiyi Huang, Xiangning Wang
2020	An Improved Algorithm for Incremental Cycle Detection and Topological Ordering in Sparse Graphs. Sayan Bhattacharya, Janardhan Kulkarni
2020	An almost 2-approximation for all-pairs of shortest paths in subquadratic time. Maor Akav, Liam Roditty
2020	Approximate Maximum Matching in Random Streams. Alireza Farhadi, Mohammad Taghi Hajiaghayi, Tung Mai, Anup Rao, Ryan A. Rossi
2020	Approximately counting and sampling small witnesses using a colourful decision oracle. Holger Dell, John Lapinskas, Kitty Meeks
2020	Approximating Nash Social Welfare under Submodular Valuations through (Un)Matchings. Jugal Garg, Pooja Kulkarni, Rucha Kulkarni
2020	Approximating the Distance to Monotonicity of Boolean Functions. Ramesh Krishnan S. Pallavoor, Sofya Raskhodnikova, Erik Waingarten
2020	Approximation Schemes for Capacitated Clustering in Doubling Metrics. Vincent Cohen-Addad
2020	Approximation Schemes via Width/Weight Trade-offs on Minor-free Graphs. Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi
2020	Atomic Embeddability, Clustered Planarity, and Thickenability. Radoslav Fulek, Csaba D. Tóth
2020	Baker game and polynomial-time approximation schemes. Zdenek Dvorák
2020	Better Data Structures for Colored Orthogonal Range Reporting. Timothy M. Chan, Yakov Nekrich
2020	Bulow-Klemperer-Style Results for Welfare Maximization in Two-Sided Markets. Moshe Babaioff, Kira Goldner, Yannai A. Gonczarowski
2020	Cake Cutting on Graphs: A Discrete and Bounded Proportional Protocol. Xiaohui Bei, Xiaoming Sun, Hao Wu, Jialin Zhang, Zhijie Zhang, Wei Zi
2020	Chasing Convex Bodies Optimally. Mark Sellke
2020	Chasing Convex Bodies with Linear Competitive Ratio. C. J. Argue, Anupam Gupta, Guru Guruganesh, Ziye Tang
2020	Chasing Nested Convex Bodies Nearly Optimally. Sébastien Bubeck, Bo'az Klartag, Yin Tat Lee, Yuanzhi Li, Mark Sellke
2020	Coarse-Grained Complexity for Dynamic Algorithms. Sayan Bhattacharya, Danupon Nanongkai, Thatchaphol Saranurak
2020	Combinatorial generation via permutation languages. Elizabeth J. Hartung, Hung Phuc Hoang, Torsten Mütze, Aaron Williams
2020	Competitive Analysis with a Sample and the Secretary Problem. Haim Kaplan, David Naori, Danny Raz
2020	Competitive Online Search Trees on Trees. Prosenjit Bose, Jean Cardinal, John Iacono, Grigorios Koumoutsos, Stefan Langerman
2020	Complexity and Parametric Computation of Equilibria in Atomic Splittable Congestion Games via Weighted Block Laplacians. Max Klimm, Philipp Warode
2020	Composable Core-sets for Determinant Maximization Problems via Spectral Spanners. Piotr Indyk, Sepideh Mahabadi, Shayan Oveis Gharan, Alireza Rezaei
2020	Computational Concentration of Measure: Optimal Bounds, Reductions, and More. Omid Etesami, Saeed Mahloujifar, Mohammad Mahmoody
2020	Computing Circle Packing Representations of Planar Graphs. Sally Dong, Yin Tat Lee, Kent Quanrud
2020	Computing Minimal Persistent Cycles: Polynomial and Hard Cases. Tamal K. Dey, Tao Hou, Sayan Mandal
2020	Computing and Testing Small Connectivity in Near-Linear Time and Queries via Fast Local Cut Algorithms. Sebastian Forster, Danupon Nanongkai, Liu Yang, Thatchaphol Saranurak, Sorrachai Yingchareonthawornchai
2020	Connectivity of Triangulation Flip Graphs in the Plane (Part I: Edge Flips). Uli Wagner, Emo Welzl
2020	Counting and Finding Homomorphisms is Universal for Parameterized Complexity Theory. Marc Roth, Philip Wellnitz
2020	Counting independent sets in unbalanced bipartite graphs. Sarah Cannon, Will Perkins
2020	Decremental SSSP in Weighted Digraphs: Faster and Against an Adaptive Adversary. Maximilian Probst Gutenberg, Christian Wulff-Nilsen
2020	Detecting Feedback Vertex Sets of Size Jason Li, Jesper Nederlof
2020	Deterministic Algorithms for Decremental Approximate Shortest Paths: Faster and Simpler. Maximilian Probst Gutenberg, Christian Wulff-Nilsen
2020	Diameter computation on Guillaume Ducoffe, Michel Habib, Laurent Viennot
2020	Differentially Private Release of Synthetic Graphs. Marek Eliás, Michael Kapralov, Janardhan Kulkarni, Yin Tat Lee
2020	Domain Reduction for Monotonicity Testing: A Hadley Black, Deeparnab Chakrabarty, C. Seshadhri
2020	Dominantly Truthful Multi-task Peer Prediction with a Constant Number of Tasks. Yuqing Kong
2020	Dynamic Low-Stretch Spanning Trees in Subpolynomial Time. Shiri Chechik, Tianyi Zhang
2020	Edge Expansion and Spectral Gap of Nonnegative Matrices. Jenish C. Mehta, Leonard J. Schulman
2020	Efficiency of the floating body as a robust measure of dispersion. Joseph Anderson, Luis Rademacher
2020	Efficiently list-edge coloring multigraphs asymptotically optimally. Fotis Iliopoulos, Alistair Sinclair
2020	Embeddability of Simplicial Complexes is Undecidable. Marek Filakovský, Uli Wagner, Stephan Zhechev
2020	Equivalences between triangle and range query problems. Lech Duraj, Krzysztof Kleiner, Adam Polak, Virginia Vassilevska Williams
2020	Euclidean Bottleneck Bounded-Degree Spanning Tree Ratios. Ahmad Biniaz
2020	Even maps, the Colin de Verdière number and representations of graphs. Vojtech Kaluza, Martin Tancer
2020	Exact computation of a manifold metric, via Lipschitz Embeddings and Shortest Paths on a Graph. Timothy Chu, Gary L. Miller, Donald R. Sheehy
2020	Exponential Separations in Local Differential Privacy. Matthew Joseph, Jieming Mao, Aaron Roth
2020	Extended Formulation Lower Bounds for Refuting Random CSPs. Jonah Brown-Cohen, Prasad Raghavendra
2020	Extremal Distances in Directed Graphs: Tight Spanners and Near-Optimal Approximation Algorithms. Keerti Choudhary, Omer Gold
2020	Factors and loose Hamilton cycles in sparse pseudo-random hypergraphs. Hiêp Hàn, Jie Han, Patrick Morris
2020	Fast LP-based Approximations for Geometric Packing and Covering Problems. Chandra Chekuri, Sariel Har-Peled, Kent Quanrud
2020	Fast and Space Efficient Spectral Sparsification in Dynamic Streams. Michael Kapralov, Aida Mousavifar, Cameron Musco, Christopher Musco, Navid Nouri, Aaron Sidford, Jakab Tardos
2020	Faster Deeksha Adil, Sushant Sachdeva
2020	Faster Algorithms for Edge Connectivity via Random 2-Out Contractions. Mohsen Ghaffari, Krzysztof Nowicki, Mikkel Thorup
2020	Faster Deterministic Distributed Coloring Through Recursive List Coloring. Fabian Kuhn
2020	Faster Deterministic and Las Vegas Algorithms for Offline Approximate Nearest Neighbors in High Dimensions. Josh Alman, Timothy M. Chan, R. Ryan Williams
2020	Faster Update Time for Turnstile Streaming Algorithms. Josh Alman, Huacheng Yu
2020	Faster sublinear approximation of the number of Talya Eden, Dana Ron, C. Seshadhri
2020	Finding Perfect Matchings in Dense Hypergraphs. Jie Han, Peter Keevash
2020	Finding a Bounded-Degree Expander Inside a Dense One. Luca Becchetti, Andrea Clementi, Emanuele Natale, Francesco Pasquale, Luca Trevisan
2020	Finding a latent Chiranjib Bhattacharyya, Ravindran Kannan
2020	Fine-grained complexity of graph homomorphism problem for bounded-treewidth graphs. Karolina Okrasa, Pawel Rzazewski
2020	Flushing Without Cascades. Michael A. Bender, Rathish Das, Martin Farach-Colton, Rob Johnson, William Kuszmaul
2020	Front Matter.
2020	Fully Dynamic Matching: Beating 2-Approximation in Δ Soheil Behnezhad, Jakub Lacki, Vahab S. Mirrokni
2020	Fully-Dynamic All-Pairs Shortest Paths: Improved Worst-Case Time and Space Bounds. Maximilian Probst Gutenberg, Christian Wulff-Nilsen
2020	Hierarchical Shape Construction and Complexity for Slidable Polyominoes under Uniform External Forces. Jose Balanza-Martinez, Timothy Gomez, David Caballero, Austin Luchsinger, Angel A. Cantu, Rene Reyes, Mauricio Flores, Robert Schweller, Tim Wylie
2020	Hierarchy-Based Algorithms for Minimizing Makespan under Precedence and Communication Constraints. Janardhan Kulkarni, Shi Li, Jakub Tarnawski, Minwei Ye
2020	Hitting Topological Minor Models in Planar Graphs is Fixed Parameter Tractable. Petr A. Golovach, Giannos Stamoulis, Dimitrios M. Thilikos
2020	How to Store a Random Walk. Emanuele Viola, Omri Weinstein, Huacheng Yu
2020	How to aggregate Top-lists: Approximation algorithms via scores and average ranks. Claire Mathieu, Simon Mauras
2020	Hyperbolic intersection graphs and (quasi)-polynomial time. Sándor Kisfaludi-Bak
2020	Improved Algorithms for Edit Distance and LCS: Beyond Worst Case. Mahdi Boroujeni, Masoud Seddighin, Saeed Seddighin
2020	Improved Inapproximability of Rainbow Coloring. Per Austrin, Amey Bhangale, Aditya Potukuchi
2020	Improved Local Computation Algorithm for Set Cover via Sparsification. Christoph Grunau, Slobodan Mitrovic, Ronitt Rubinfeld, Ali Vakilian
2020	Improved bounds for centered colorings. Michal Debski, Stefan Felsner, Piotr Micek, Felix Schröder
2020	Improved hardness for Marcin Wrochna, Stanislav Zivný
2020	Individual Sensitivity Preprocessing for Data Privacy. Rachel Cummings, David Durfee
2020	Inference from Auction Prices. Jason D. Hartline, Aleck C. Johnsen, Denis Nekipelov, Zihe Wang
2020	Instance-Optimality in the Noisy Value-and Comparison-Model. Vincent Cohen-Addad, Frederik Mallmann-Trenn, Claire Mathieu
2020	Interleaved Caching with Access Graphs. Ravi Kumar, Manish Purohit, Zoya Svitkina, Erik Vee
2020	Labelings vs. Embeddings: On Distributed Representations of Distances. Arnold Filtser, Lee-Ad Gottlieb, Robert Krauthgamer
2020	Learning from satisfying assignments under continuous distributions. Clément L. Canonne, Anindya De, Rocco A. Servedio
2020	Linear Size Sparsifier and the Geometry of the Operator Norm Ball. Victor Reis, Thomas Rothvoss
2020	Linear rankwidth meets stability. Jaroslav Nesetril, Roman Rabinovich, Patrice Ossona de Mendez, Sebastian Siebertz
2020	List Decodable Learning via Sum of Squares. Prasad Raghavendra, Morris Yau
2020	List Decoding of Direct Sum Codes. Vedat Levi Alev, Fernando Granha Jeronimo, Dylan Quintana, Shashank Srivastava, Madhur Tulsiani
2020	Locally Consistent Parsing for Text Indexing in Small Space. Or Birenzwige, Shay Golan, Ely Porat
2020	Locally Private Uri Stemmer
2020	Lossless Prioritized Embeddings. Michael Elkin, Ofer Neiman
2020	Lower Bounds for Oblivious Near-Neighbor Search. Kasper Green Larsen, Tal Malkin, Omri Weinstein, Kevin Yeo
2020	Multi-transversals for Triangles and the Tuza's Conjecture. Parinya Chalermsook, Samir Khuller, Pattara Sukprasert, Sumedha Uniyal
2020	Navigating an Infinite Space with Unreliable Movements. Anders Martinsson, Jara Uitto
2020	Near-Optimal Bounds for Online Caching with Machine Learned Advice. Dhruv Rohatgi
2020	Near-optimal Approximate Discrete and Continuous Submodular Function Minimization. Brian Axelrod, Yang P. Liu, Aaron Sidford
2020	Nearly Optimal Planar Chih-Hung Liu
2020	Nearly optimal edge estimation with independent set queries. Xi Chen, Amit Levi, Erik Waingarten
2020	New ( Uri Ben-Levy, Merav Parter
2020	New Algorithms and Lower Bounds for All-Pairs Max-Flow in Undirected Graphs. Amir Abboud, Robert Krauthgamer, Ohad Trabelsi
2020	Normalizers and permutational isomorphisms in simply-exponential time. Daniel Wiebking
2020	Oblivious Sketching of High-Degree Polynomial Kernels. Thomas D. Ahle, Michael Kapralov, Jakob Bæk Tejs Knudsen, Rasmus Pagh, Ameya Velingker, David P. Woodruff, Amir Zandieh
2020	On Decoding Cohen-Haeupler-Schulman Tree Codes. Anand Kumar Narayanan, Matthew Weidner
2020	On the Cover of the Rolling Stone. Adrian Dumitrescu, Csaba D. Tóth
2020	On the Learnability of Random Deep Networks. Abhimanyu Das, Sreenivas Gollapudi, Ravi Kumar, Rina Panigrahy
2020	On the Performance of Reed-Muller Codes with respect to Random Errors and Erasures. Ori Sberlo, Amir Shpilka
2020	On the Power of Relaxed Local Decoding Algorithms. Tom Gur, Oded Lachish
2020	On the Tractability of Public Persuasion with No Externalities. Haifeng Xu
2020	Online Probabilistic Metric Embedding: A General Framework for Bypassing Inherent Bounds. Yair Bartal, Nova Fandina, Seeun William Umboh
2020	Online Scheduling via Learned Weights. Silvio Lattanzi, Thomas Lavastida, Benjamin Moseley, Sergei Vassilvitskii
2020	Optimal Bound on the Combinatorial Complexity of Approximating Polytopes. Rahul Arya, Sunil Arya, Guilherme Dias da Fonseca, David M. Mount
2020	Optimal Orthogonal Drawings of Planar 3-Graphs in Linear Time. Walter Didimo, Giuseppe Liotta, Giacomo Ortali, Maurizio Patrignani
2020	Optimal Space-Depth Trade-Off of CNOT Circuits in Quantum Logic Synthesis. Jiaqing Jiang, Xiaoming Sun, Shang-Hua Teng, Bujiao Wu, Kewen Wu, Jialin Zhang
2020	Packing LPs are Hard to Solve Accurately, Assuming Linear Equations are Hard. Rasmus Kyng, Di Wang, Peng Zhang
2020	Parallel Batch-Dynamic Graphs: Algorithms and Lower Bounds. Laxman Dhulipala, David Durfee, Janardhan Kulkarni, Richard Peng, Saurabh Sawlani, Xiaorui Sun
2020	Parallel Machine Scheduling to Minimize Energy Consumption. Antonios Antoniadis, Naveen Garg, Gunjan Kumar, Nikhil Kumar
2020	Parameterized Complexity and Approximability of Directed Odd Cycle Transversal. Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh, Meirav Zehavi
2020	Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, SODA 2020, Salt Lake City, UT, USA, January 5-8, 2020. Shuchi Chawla
2020	Quantifying the Burden of Exploration and the Unfairness of Free Riding. Christopher Jung, Sampath Kannan, Neil Lutz
2020	Quasi-Polynomial Algorithms for Submodular Tree Orienteering and Other Directed Network Design Problems. Rohan Ghuge, Viswanath Nagarajan
2020	Quasi-polynomial time approximation schemes for the Maximum Weight Independent Set Problem in Maria Chudnovsky, Marcin Pilipczuk, Michal Pilipczuk, Stéphan Thomassé
2020	Quasi-popular Matchings, Optimality, and Extended Formulations. Yuri Faenza, Telikepalli Kavitha
2020	Reconstruction of Depth-4 Multilinear Circuits. Vishwas Bhargava, Shubhangi Saraf, Ilya Volkovich
2020	Reconstruction under outliers for Fourier-sparse functions. Xue Chen, Anindya De
2020	Reducing approximate Longest Common Subsequence to approximate Edit Distance. Aviad Rubinstein, Zhao Song
2020	Regular Languages meet Prefix Sorting. Jarno Alanko, Giovanna D'Agostino, Alberto Policriti, Nicola Prezza
2020	Relaxed Locally Correctable Codes with Nearly-Linear Block Length and Constant Query Complexity. Alessandro Chiesa, Tom Gur, Igor Shinkar
2020	Robust Clustering Oracle and Local Reconstructor of Cluster Structure of Graphs. Pan Peng
2020	Round Complexity of Common Randomness Generation: The Amortized Setting. Noah Golowich, Madhu Sudan
2020	Sample Efficient Toeplitz Covariance Estimation. Yonina C. Eldar, Jerry Li, Cameron Musco, Christopher Musco
2020	Sandwiching random regular graphs between binomial random graphs. Pu Gao, Mikhail Isaev, Brendan D. McKay
2020	Selling Information Through Consulting. Yiling Chen, Haifeng Xu, Shuran Zheng
2020	Shorter Labeling Schemes for Planar Graphs. Marthe Bonamy, Cyril Gavoille, Michal Pilipczuk
2020	Shortest Paths in a Hybrid Network Model. John Augustine, Kristian Hinnenthal, Fabian Kuhn, Christian Scheideler, Philipp Schneider
2020	Small Memory Robust Simulation of Client-Server Interactive Protocols over Oblivious Noisy Channels. T.-H. Hubert Chan, Zhibin Liang, Antigoni Polychroniadou, Elaine Shi
2020	Space Efficient Approximation to Maximum Matching Size from Uniform Edge Samples. Michael Kapralov, Slobodan Mitrovic, Ashkan Norouzi-Fard, Jakab Tardos
2020	Spherical Discrepancy Minimization and Algorithmic Lower Bounds for Covering the Sphere. Chris Jones, Matt McPartlon
2020	Sticky Brownian Rounding and its Applications to Constraint Satisfaction Problems. Sepehr Abbasi Zadeh, Nikhil Bansal, Guru Guruganesh, Aleksandar Nikolov, Roy Schwartz, Mohit Singh
2020	Sublinear time approximation of the cost of a metric Artur Czumaj, Christian Sohler
2020	Symmetric Polymorphisms and Efficient Decidability of Promise CSPs. Joshua Brakensiek, Venkatesan Guruswami
2020	Testing convexity of functions over finite domains. Aleksandrs Belovs, Eric Blais, Abhinav Bommireddi
2020	The Combinatorics of the Longest-Chain Rule: Linear Consistency for Proof-of-Stake Blockchains. Erica Blum, Aggelos Kiayias, Cristopher Moore, Saad Quader, Alexander Russell
2020	The Communication Complexity of Optimization. Santosh S. Vempala, Ruosong Wang, David P. Woodruff
2020	The Communication Complexity of Set Intersection and Multiple Equality Testing. Dawei Huang, Seth Pettie, Yixiang Zhang, Zhijun Zhang
2020	The Complexity of Contracts. Paul Dütting, Tim Roughgarden, Inbal Talgam-Cohen
2020	The Directed Flat Wall Theorem. Archontia C. Giannopoulou, Ken-ichi Kawarabayashi, Stephan Kreutzer, O-joung Kwon
2020	The Impacts of Dimensionality, Diffusion, and Directedness on Intrinsic Universality in the abstract Tile Assembly Model. Daniel Hader, Aaron Koch, Matthew J. Patitz, Michael Sharp
2020	The Online Submodular Cover Problem. Anupam Gupta, Roie Levin
2020	The Power of Distributed Verifiers in Interactive Proofs. Moni Naor, Merav Parter, Eylon Yogev
2020	The Two-Sided Game of Googol and Sample-Based Prophet Inequalities. José R. Correa, Andrés Cristi, Boris Epstein, José A. Soto
2020	The rank of sparse random matrices. Amin Coja-Oghlan, Alperen Ali Ergür, Pu Gao, Samuel Hetterich, Maurice Rolvien
2020	The stable set problem in graphs with bounded genus and bounded odd cycle packing number. Michele Conforti, Samuel Fiorini, Tony Huynh, Gwenaël Joret, Stefan Weltge
2020	Tight Bounds for the Subspace Sketch Problem with Applications. Yi Li, Ruosong Wang, David P. Woodruff
2020	Tight Running Time Lower Bounds for Strong Inapproximability of Maximum Pasin Manurangsi
2020	Tightening Curves on Surfaces Monotonically with Applications. Hsien-Chih Chang, Arnaud de Mesmay
2020	Truly Subcubic Min-Plus Product for Less Structured Matrices, with Applications. Virginia Vassilevska Williams, Yinzhan Xu
2020	Ultimate greedy approximation of independent sets in subcubic graphs. Piotr Krysta, Mathieu Mari, Nan Zhi
2020	Vertex Ordering Problems in Directed Graph Streams. Amit Chakrabarti, Prantar Ghosh, Andrew McGregor, Sofya Vorotnikova
2020	Very fast construction of bounded-degree spanning graphs via the semi-random graph process. Omri Ben-Eliezer, Lior Gishboliner, Dan Hefetz, Michael Krivelevich
2020	Weighted Completion Time Minimization for Unrelated Machines via Iterative Fair Contention Resolution. Sungjin Im, Maryam Shadloo
2020	Worst-Case Polylog Incremental SPQR-trees: Embeddings, Planarity, and Triconnectivity. Jacob Holm, Eva Rotenberg
2020	Zeros of ferromagnetic 2-spin systems. Heng Guo, Jingcheng Liu, Pinyan Lu