ESA - RankMe – RankMe

85 papers

Year	Title / Authors
2020	28th Annual European Symposium on Algorithms, ESA 2020, Pisa, Italy (Virtual Conference), September 7-9, 2020 Fabrizio Grandoni, Grzegorz Herman, Peter Sanders
2020	A (1-e Yaron Fairstein, Ariel Kulik, Joseph (Seffi) Naor, Danny Raz, Hadas Shachnai
2020	A Constant-Factor Approximation for Directed Latency in Quasi-Polynomial Time. Zachary Friggstad, Chaitanya Swamy
2020	A Linear Fixed Parameter Tractable Algorithm for Connected Pathwidth. Mamadou Moustapha Kanté, Christophe Paul, Dimitrios M. Thilikos
2020	A Polynomial Kernel for Line Graph Deletion. Eduard Eiben, William Lochet
2020	A Sub-Linear Time Framework for Geometric Optimization with Outliers in High Dimensions. Hu Ding
2020	Acyclic, Star and Injective Colouring: A Complexity Picture for H-Free Graphs. Jan Bok, Nikola Jedlicková, Barnaby Martin, Daniël Paulusma, Siani Smith
2020	An Algorithmic Meta-Theorem for Graph Modification to Planarity and FOL. Fedor V. Fomin, Petr A. Golovach, Giannos Stamoulis, Dimitrios M. Thilikos
2020	An Algorithmic Study of Fully Dynamic Independent Sets for Map Labeling. Sujoy Bhore, Guangping Li, Martin Nöllenburg
2020	An Algorithmic Weakening of the Erdős-Hajnal Conjecture. Édouard Bonnet, Stéphan Thomassé, Xuan Thang Tran, Rémi Watrigant
2020	An Efficient, Practical Algorithm and Implementation for Computing Multiplicatively Weighted Voronoi Diagrams. Martin Held, Stefan de Lorenzo
2020	An Optimal Decentralized (Δ + 1)-Coloring Algorithm. Daniel Bertschinger, Johannes Lengler, Anders Martinsson, Robert Meier, Angelika Steger, Milos Trujic, Emo Welzl
2020	Analysis of the Period Recovery Error Bound. Amihood Amir, Itai Boneh, Michael Itzhaki, Eitan Kondratovsky
2020	Approximate CVP Friedrich Eisenbrand, Moritz Venzin
2020	Approximate Turing Kernelization for Problems Parameterized by Treewidth. Eva-Maria C. Hols, Stefan Kratsch, Astrid Pieterse
2020	Approximating k-Connected m-Dominating Sets. Zeev Nutov
2020	Approximation Algorithms for Clustering with Dynamic Points. Shichuan Deng, Jian Li, Yuval Rabani
2020	Approximation of the Diagonal of a Laplacian's Pseudoinverse for Complex Network Analysis. Eugenio Angriman, Maria Predari, Alexander van der Grinten, Henning Meyerhenke
2020	Augmenting the Algebraic Connectivity of Graphs. Bogdan-Adrian Manghiuc, Pan Peng, He Sun
2020	Capacitated Sum-Of-Radii Clustering: An FPT Approximation. Tanmay Inamdar, Kasturi R. Varadarajan
2020	Chordless Cycle Packing Is Fixed-Parameter Tractable. Dániel Marx
2020	Compact Oblivious Routing in Weighted Graphs. Philipp Czerner, Harald Räcke
2020	Coresets for the Nearest-Neighbor Rule. Alejandro Flores-Velazco, David M. Mount
2020	Cutting Polygons into Small Pieces with Chords: Laser-Based Localization. Esther M. Arkin, Rathish Das, Jie Gao, Mayank Goswami, Joseph S. B. Mitchell, Valentin Polishchuk, Csaba D. Tóth
2020	Distance Bounds for High Dimensional Consistent Digital Rays and 2-D Partially-Consistent Digital Rays. Man-Kwun Chiu, Matias Korman, Martin Suderland, Takeshi Tokuyama
2020	Dual Half-Integrality for Uncrossable Cut Cover and Its Application to Maximum Half-Integral Flow. Naveen Garg, Nikhil Kumar
2020	Dynamic Matching Algorithms in Practice. Monika Henzinger, Shahbaz Khan, Richard D. Paul, Christian Schulz
2020	Efficient Computation of 2-Covers of a String. Jakub Radoszewski, Juliusz Straszynski
2020	Engineering Fast Almost Optimal Algorithms for Bipartite Graph Matching. Ioannis Panagiotas, Bora Uçar
2020	Exploiting c-Closure in Kernelization Algorithms for Graph Problems. Tomohiro Koana, Christian Komusiewicz, Frank Sommer
2020	Fast Preprocessing for Optimal Orthogonal Range Reporting and Range Successor with Applications to Text Indexing. Younan Gao, Meng He, Yakov Nekrich
2020	Finding All Global Minimum Cuts in Practice. Monika Henzinger, Alexander Noe, Christian Schulz, Darren Strash
2020	Finding Large H-Colorable Subgraphs in Hereditary Graph Classes. Maria Chudnovsky, Jason King, Michal Pilipczuk, Pawel Rzazewski, Sophie Spirkl
2020	Fine-Grained Complexity of Regular Expression Pattern Matching and Membership. Philipp Schepper
2020	First-Order Model-Checking in Random Graphs and Complex Networks. Jan Dreier, Philipp Kuinke, Peter Rossmanith
2020	Front Matter, Table of Contents, Preface, Conference Organization.
2020	Full Complexity Classification of the List Homomorphism Problem for Bounded-Treewidth Graphs. Karolina Okrasa, Marta Piecyk, Pawel Rzazewski
2020	Fully-Dynamic Coresets. Monika Henzinger, Sagar Kale
2020	Generalizing CGAL Periodic Delaunay Triangulations. Georg Osang, Mael Rouxel-Labbé, Monique Teillaud
2020	Grundy Distinguishes Treewidth from Pathwidth. Rémy Belmonte, Eun Jung Kim, Michael Lampis, Valia Mitsou, Yota Otachi
2020	Improved Algorithms for Alternating Matrix Space Isometry: From Theory to Practice. Peter A. Brooksbank, Yinan Li, Youming Qiao, James B. Wilson
2020	Improved Approximation Algorithm for Set Multicover with Non-Piercing Regions. Rajiv Raman, Saurabh Ray
2020	Improved Bounds for Metric Capacitated Covering Problems. Sayan Bandyapadhyay
2020	Improved Distance Sensitivity Oracles with Subcubic Preprocessing Time. Hanlin Ren
2020	Improved Prophet Inequalities for Combinatorial Welfare Maximization with (Approximately) Subadditive Agents. Hanrui Zhang
2020	Incompressibility of H-Free Edge Modification Problems: Towards a Dichotomy. Dániel Marx, R. B. Sandeep
2020	Kernelization of Whitney Switches. Fedor V. Fomin, Petr A. Golovach
2020	Kruskal-Based Approximation Algorithm for the Multi-Level Steiner Tree Problem. Abu Reyan Ahmed, Faryad Darabi Sahneh, Keaton Hamm, Stephen G. Kobourov, Richard Spence
2020	Light Euclidean Spanners with Steiner Points. Hung Le, Shay Solomon
2020	Linear Expected Complexity for Directional and Multiplicative Voronoi Diagrams. Chenglin Fan, Benjamin Raichel
2020	Linear Time LexDFS on Chordal Graphs. Jesse Beisegel, Ekkehard Köhler, Robert Scheffler, Martin Strehler
2020	Lower Bounds and Approximation Algorithms for Search Space Sizes in Contraction Hierarchies. Johannes Blum, Sabine Storandt
2020	Many Visits TSP Revisited. Lukasz Kowalik, Shaohua Li, Wojciech Nadara, Marcin Smulewicz, Magnus Wahlström
2020	Mincut Sensitivity Data Structures for the Insertion of an Edge. Surender Baswana, Shiv Kumar Gupta, Till Knollmann
2020	Minimum Neighboring Degree Realization in Graphs and Trees. Amotz Bar-Noy, Keerti Choudhary, Avi Cohen, David Peleg, Dror Rawitz
2020	More on Change-Making and Related Problems. Timothy M. Chan, Qizheng He
2020	New Binary Search Tree Bounds via Geometric Inversions. Parinya Chalermsook, Wanchote Po Jiamjitrak
2020	New Bounds on Augmenting Steps of Block-Structured Integer Programs. Lin Chen, Martin Koutecký, Lei Xu, Weidong Shi
2020	Noisy, Greedy and Not so Greedy k-Means++. Anup Bhattacharya, Jan Eube, Heiko Röglin, Melanie Schmidt
2020	On Compact RAC Drawings. Henry Förster, Michael Kaufmann
2020	On the Approximation Ratio of the k-Opt and Lin-Kernighan Algorithm for Metric and Graph TSP. Xianghui Zhong
2020	On the Complexity of BWT-Runs Minimization via Alphabet Reordering. Jason W. Bentley, Daniel Gibney, Sharma V. Thankachan
2020	On the Complexity of Recovering Incidence Matrices. Fedor V. Fomin, Petr A. Golovach, Pranabendu Misra, M. S. Ramanujan
2020	On the Computational Complexity of Linear Discrepancy. Lily Li, Aleksandar Nikolov
2020	Optimal Polynomial-Time Compression for Boolean Max CSP. Bart M. P. Jansen, Michal Wlodarczyk
2020	Optimally Handling Commitment Issues in Online Throughput Maximization. Franziska Eberle, Nicole Megow, Kevin Schewior
2020	Parallel Batch-Dynamic Trees via Change Propagation. Umut A. Acar, Daniel Anderson, Guy E. Blelloch, Laxman Dhulipala, Sam Westrick
2020	Planar Bichromatic Bottleneck Spanning Trees. A. Karim Abu-Affash, Sujoy Bhore, Paz Carmi, Joseph S. B. Mitchell
2020	Polynomial Time Approximation Schemes for Clustering in Low Highway Dimension Graphs. Andreas Emil Feldmann, David Saulpic
2020	Practical Performance of Space Efficient Data Structures for Longest Common Extensions. Patrick Dinklage, Johannes Fischer, Alexander Herlez, Tomasz Kociumaka, Florian Kurpicz
2020	Reconfiguration of Spanning Trees with Many or Few Leaves. Nicolas Bousquet, Takehiro Ito, Yusuke Kobayashi, Haruka Mizuta, Paul Ouvrard, Akira Suzuki, Kunihiro Wasa
2020	Reconstructing Biological and Digital Phylogenetic Trees in Parallel. Ramtin Afshar, Michael T. Goodrich, Pedro Matias, Martha C. Osegueda
2020	Set Cover with Delay - Clairvoyance Is Not Required. Yossi Azar, Ashish Chiplunkar, Shay Kutten, Noam Touitou
2020	Settling the Relationship Between Wilber's Bounds for Dynamic Optimality. Victor Lecomte, Omri Weinstein
2020	Simulating Population Protocols in Sub-Constant Time per Interaction. Petra Berenbrink, David Hammer, Dominik Kaaser, Ulrich Meyer, Manuel Penschuck, Hung Tran
2020	Single-Source Shortest Paths and Strong Connectivity in Dynamic Planar Graphs. Panagiotis Charalampopoulos, Adam Karczmarz
2020	Sometimes Reliable Spanners of Almost Linear Size. Kevin Buchin, Sariel Har-Peled, Dániel Oláh
2020	Space-Efficient, Fast and Exact Routing in Time-Dependent Road Networks. Ben Strasser, Dorothea Wagner, Tim Zeitz
2020	Subexponential Parameterized Algorithms and Kernelization on Almost Chordal Graphs. Fedor V. Fomin, Petr A. Golovach
2020	The Fine-Grained Complexity of Median and Center String Problems Under Edit Distance. Gary Hoppenworth, Jason W. Bentley, Daniel Gibney, Sharma V. Thankachan
2020	The Maximum Binary Tree Problem. Karthekeyan Chandrasekaran, Elena Grigorescu, Gabriel Istrate, Shubhang Kulkarni, Young-San Lin, Minshen Zhu
2020	The Minimization of Random Hypergraphs. Thomas Bläsius, Tobias Friedrich, Martin Schirneck
2020	The Number of Repetitions in 2D-Strings. Panagiotis Charalampopoulos, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen, Wiktor Zuba
2020	Tight Approximation Algorithms for p-Mean Welfare Under Subadditive Valuations. Siddharth Barman, Umang Bhaskar, Anand Krishna, Ranjani G. Sundaram
2020	When Lipschitz Walks Your Dog: Algorithm Engineering of the Discrete Fréchet Distance Under Translation. Karl Bringmann, Marvin Künnemann, André Nusser