All papers published in past two days:
Category: Data Structures and Algorithms
#DataStructuresandAlgorithms
π Efficient and Modular Coalgebraic Partition Refinement
π₯ Thorsten WiΓmann, Ulrich Dorsch, Stefan Milius, Lutz SchrΓΆder
π PDF
π Bounds and algorithms for $k$-truss
π₯ Paul Burkhardt, Vance Faber, David G. Harris
π PDF
AI Python & arXiv Channel
Category: Data Structures and Algorithms
#DataStructuresandAlgorithms
π Efficient and Modular Coalgebraic Partition Refinement
π₯ Thorsten WiΓmann, Ulrich Dorsch, Stefan Milius, Lutz SchrΓΆder
π PDF
π Bounds and algorithms for $k$-truss
π₯ Paul Burkhardt, Vance Faber, David G. Harris
π PDF
AI Python & arXiv Channel
Latest Published Articles:
Data Structures and Algorithms
#DataStructuresandAlgorithms
π Efficient and Modular Coalgebraic Partition Refinement
π₯ Thorsten WiΓmann, Ulrich Dorsch, Stefan Milius, Lutz SchrΓΆder
π PDF
π Bounds and algorithms for $k$-truss
π₯ Paul Burkhardt, Vance Faber, David G. Harris
π PDF
π Stability and complexity of mixed discriminants
π₯ Alexander Barvinok
π PDF
π $O(n \log n)$-time text compression by LZ-style longest first substitution
π₯ Akihiro Nishi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
π PDF
π Minimum Shared-Power Edge Cut
π₯ Sergio Cabello, Kshitij Jain, Anna Lubiw, Debajyoti Mondal
π PDF
π Swendsen-Wang Dynamics for General Graphs in the Tree Uniqueness Region
π₯ Antonio Blanca, Zongchen Chen, Eric Vigoda
π PDF
π Computing directed path-width and directed tree-width of recursively defined digraphs
π₯ Frank Gurski, Carolin Rehs
π PDF
π MISSION: Ultra Large-Scale Feature Selection using Count-Sketches
π₯ Amirali Aghazadeh, Ryan Spring, Daniel LeJeune, Gautam Dasarathy, Anshumali Shrivastava, Richard G. Baraniuk
π PDF
π Efficient Enumeration of Subgraphs and Induced Subgraphs with Bounded Girth
π₯ Kazuhiro Kurita, Kunihiro Wasa, Alessio Conte, Hiroki Arimura, Takeaki Uno
π PDF
π Indexed Dynamic Programming to boost Edit Distance and LCSS Computation
π₯ JΓ©rΓ©my Barbay, AndrΓ©s Olivares
π PDF
π Perturbation Resilient Clustering for $k$-Center and Related Problems via LP Relaxations
π₯ Chandra Chekuri, Shalmoli Gupta
π PDF
π Reconciling Multiple Genes Trees via Segmental Duplications and Losses
π₯ Riccardo Dondi, Manuel Lafond, Celine Scornavacca
π PDF
π Scalable Approximation Algorithm for Graph Summarization
π₯ Maham Anwar Beg, Muhammad Ahmad, Arif Zaman, Imdadullah Khan
π PDF
π Minmax-Regret $k$-Sink Location on a Dynamic Tree Network with Uniform Capacities
π₯ Mordecai J. Golin, Sai Sandeep
π PDF
π Deterministic Min-Cost Matching with Delays
π₯ Yossi Azar, Amit Jacob-Fanani
π PDF
#DataStructuresandAlgorithms
AI Python & arXiv Channel
Data Structures and Algorithms
#DataStructuresandAlgorithms
π Efficient and Modular Coalgebraic Partition Refinement
π₯ Thorsten WiΓmann, Ulrich Dorsch, Stefan Milius, Lutz SchrΓΆder
π PDF
π Bounds and algorithms for $k$-truss
π₯ Paul Burkhardt, Vance Faber, David G. Harris
π PDF
π Stability and complexity of mixed discriminants
π₯ Alexander Barvinok
π PDF
π $O(n \log n)$-time text compression by LZ-style longest first substitution
π₯ Akihiro Nishi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
π PDF
π Minimum Shared-Power Edge Cut
π₯ Sergio Cabello, Kshitij Jain, Anna Lubiw, Debajyoti Mondal
π PDF
π Swendsen-Wang Dynamics for General Graphs in the Tree Uniqueness Region
π₯ Antonio Blanca, Zongchen Chen, Eric Vigoda
π PDF
π Computing directed path-width and directed tree-width of recursively defined digraphs
π₯ Frank Gurski, Carolin Rehs
π PDF
π MISSION: Ultra Large-Scale Feature Selection using Count-Sketches
π₯ Amirali Aghazadeh, Ryan Spring, Daniel LeJeune, Gautam Dasarathy, Anshumali Shrivastava, Richard G. Baraniuk
π PDF
π Efficient Enumeration of Subgraphs and Induced Subgraphs with Bounded Girth
π₯ Kazuhiro Kurita, Kunihiro Wasa, Alessio Conte, Hiroki Arimura, Takeaki Uno
π PDF
π Indexed Dynamic Programming to boost Edit Distance and LCSS Computation
π₯ JΓ©rΓ©my Barbay, AndrΓ©s Olivares
π PDF
π Perturbation Resilient Clustering for $k$-Center and Related Problems via LP Relaxations
π₯ Chandra Chekuri, Shalmoli Gupta
π PDF
π Reconciling Multiple Genes Trees via Segmental Duplications and Losses
π₯ Riccardo Dondi, Manuel Lafond, Celine Scornavacca
π PDF
π Scalable Approximation Algorithm for Graph Summarization
π₯ Maham Anwar Beg, Muhammad Ahmad, Arif Zaman, Imdadullah Khan
π PDF
π Minmax-Regret $k$-Sink Location on a Dynamic Tree Network with Uniform Capacities
π₯ Mordecai J. Golin, Sai Sandeep
π PDF
π Deterministic Min-Cost Matching with Delays
π₯ Yossi Azar, Amit Jacob-Fanani
π PDF
#DataStructuresandAlgorithms
AI Python & arXiv Channel
Latest Published Articles:
Data Structures and Algorithms
#DataStructuresandAlgorithms
π Shortest Reconfiguration Sequence for Sliding Tokens on Spiders
π₯ Duc A. Hoang, Amanj Khorramian, Ryuhei Uehara
π PDF
π Cycles to the Rescue! Novel Constraints to Compute Maximum Planar Subgraphs Fast
π₯ Markus Chimani, Tilo Wiedera
π PDF
π A connection between String Covers and Cover Deterministic Finite Tree Automata Minimization
π₯ Alexandru Popa, Andrei Tanasescu
π PDF
π Instance-Optimality in the Noisy Value-and Comparison-Model --- Accept, Accept, Strong Accept: Which Papers get in?
π₯ Vincent Cohen-Addad, Frederik Mallmann-Trenn, Claire Mathieu
π PDF
π Hardness and algorithmic results for the approximate cover problem
π₯ Alexandru Popa, Andrei Tanasescu
π PDF
π An output-sensitive algorithm for the minimization of 2-dimensional String Covers
π₯ Alexandru Popa, Andrei Tanasescu
π PDF
π Game-theoretic derivation of upper hedging prices of multivariate contingent claims and submodularity
π₯ Takeru Matsuda, Akimichi Takemura
π PDF
π The compressions of reticulation-visible networks are tree-child
π₯ Andreas D. M. Gunawan, Hongwei Yan, Louxin Zhang
π PDF
π A Faster External Memory Priority Queue with DecreaseKeys
π₯ Shunhua Jiang, Kasper Green Larsen
π PDF
π Counting Shortest Two Disjoint Paths in Cubic Planar Graphs with an NC Algorithm
π₯ Andreas BjΓΆrklund, Thore Husfeldt
π PDF
π Reducibility and Computational Lower Bounds for Problems with Planted Sparse Structure
π₯ Matthew Brennan, Guy Bresler, Wasim Huleihel
π PDF
π A unifying method for the design of algorithms canonizing combinatorial objects
π₯ Pascal Schweitzer, Daniel Wiebking
π PDF
π Approximating real-rooted and stable polynomials, with combinatorial applications
π₯ Alexander Barvinok
π PDF
π Deterministic $O(1)$-Approximation Algorithms to 1-Center Clustering with Outliers
π₯ Shyam Narayanan
π PDF
π NISQ circuit compilers: search space structure and heuristics
π₯ Alexandru Paler, Alwin Zulehner, Robert Wille
π PDF
#DataStructuresandAlgorithms
AI Python & arXiv Channel
Data Structures and Algorithms
#DataStructuresandAlgorithms
π Shortest Reconfiguration Sequence for Sliding Tokens on Spiders
π₯ Duc A. Hoang, Amanj Khorramian, Ryuhei Uehara
π PDF
π Cycles to the Rescue! Novel Constraints to Compute Maximum Planar Subgraphs Fast
π₯ Markus Chimani, Tilo Wiedera
π PDF
π A connection between String Covers and Cover Deterministic Finite Tree Automata Minimization
π₯ Alexandru Popa, Andrei Tanasescu
π PDF
π Instance-Optimality in the Noisy Value-and Comparison-Model --- Accept, Accept, Strong Accept: Which Papers get in?
π₯ Vincent Cohen-Addad, Frederik Mallmann-Trenn, Claire Mathieu
π PDF
π Hardness and algorithmic results for the approximate cover problem
π₯ Alexandru Popa, Andrei Tanasescu
π PDF
π An output-sensitive algorithm for the minimization of 2-dimensional String Covers
π₯ Alexandru Popa, Andrei Tanasescu
π PDF
π Game-theoretic derivation of upper hedging prices of multivariate contingent claims and submodularity
π₯ Takeru Matsuda, Akimichi Takemura
π PDF
π The compressions of reticulation-visible networks are tree-child
π₯ Andreas D. M. Gunawan, Hongwei Yan, Louxin Zhang
π PDF
π A Faster External Memory Priority Queue with DecreaseKeys
π₯ Shunhua Jiang, Kasper Green Larsen
π PDF
π Counting Shortest Two Disjoint Paths in Cubic Planar Graphs with an NC Algorithm
π₯ Andreas BjΓΆrklund, Thore Husfeldt
π PDF
π Reducibility and Computational Lower Bounds for Problems with Planted Sparse Structure
π₯ Matthew Brennan, Guy Bresler, Wasim Huleihel
π PDF
π A unifying method for the design of algorithms canonizing combinatorial objects
π₯ Pascal Schweitzer, Daniel Wiebking
π PDF
π Approximating real-rooted and stable polynomials, with combinatorial applications
π₯ Alexander Barvinok
π PDF
π Deterministic $O(1)$-Approximation Algorithms to 1-Center Clustering with Outliers
π₯ Shyam Narayanan
π PDF
π NISQ circuit compilers: search space structure and heuristics
π₯ Alexandru Paler, Alwin Zulehner, Robert Wille
π PDF
#DataStructuresandAlgorithms
AI Python & arXiv Channel
5 of Latest Published Articles:
Data Structures and Algorithms
#DataStructuresandAlgorithms
π Is your data low-dimensional?
π₯ Anindya De, Elchanan Mossel, Joe Neeman
π PDF
π Fully Dynamic Maximal Independent Set with Sublinear in n Update Time
π₯ Sepehr Assadi, Krzysztof Onak, Baruch Schieber, Shay Solomon
π PDF
π Finding a Maximum-Weight Convex Set in a Chordal Graph
π₯ Jean Cardinal, Jean-Paul Doignon, Keno Merckx
π PDF
π Approximate Nearest Neighbor Search in High Dimensions
π₯ Alexandr Andoni, Piotr Indyk, Ilya Razenshteyn
π PDF
π Beyond Worst-Case Analysis
π₯ Tim Roughgarden
π PDF
#DataStructuresandAlgorithms
AI Python & arXiv Channel
Data Structures and Algorithms
#DataStructuresandAlgorithms
π Is your data low-dimensional?
π₯ Anindya De, Elchanan Mossel, Joe Neeman
π PDF
π Fully Dynamic Maximal Independent Set with Sublinear in n Update Time
π₯ Sepehr Assadi, Krzysztof Onak, Baruch Schieber, Shay Solomon
π PDF
π Finding a Maximum-Weight Convex Set in a Chordal Graph
π₯ Jean Cardinal, Jean-Paul Doignon, Keno Merckx
π PDF
π Approximate Nearest Neighbor Search in High Dimensions
π₯ Alexandr Andoni, Piotr Indyk, Ilya Razenshteyn
π PDF
π Beyond Worst-Case Analysis
π₯ Tim Roughgarden
π PDF
#DataStructuresandAlgorithms
AI Python & arXiv Channel
5 of Latest Published Articles:
Data Structures and Algorithms
#DataStructuresandAlgorithms
π Tight bounds for popping algorithms
π₯ Heng Guo, Kun He
π PDF
π Near-Optimal Distance Emulator for Planar Graphs
π₯ Hsien-Chih Chang, PaweΕ Gawrychowski, Shay Mozes, Oren Weimann
π PDF
π SWIFT: Maintaining weak-scalability with a dynamic range of $10^4$ in time-step size to harness extreme adaptivity
π₯ Josh Borrow, Richard G. Bower, Peter W. Draper, Pedro Gonnet, Matthieu Schaller
π PDF
π A Novel Algorithm for the All-Best-Swap-Edge Problem on Tree Spanners
π₯ Davide BilΓ², Kleitos Papadopoulos
π PDF
π Ortho-polygon Visibility Representations of 3-connected 1-plane Graphs
π₯ Giuseppe Liotta, Fabrizio Montecchiani, Alessandra Tappini
π PDF
#DataStructuresandAlgorithms
AI Python & arXiv Channel
Data Structures and Algorithms
#DataStructuresandAlgorithms
π Tight bounds for popping algorithms
π₯ Heng Guo, Kun He
π PDF
π Near-Optimal Distance Emulator for Planar Graphs
π₯ Hsien-Chih Chang, PaweΕ Gawrychowski, Shay Mozes, Oren Weimann
π PDF
π SWIFT: Maintaining weak-scalability with a dynamic range of $10^4$ in time-step size to harness extreme adaptivity
π₯ Josh Borrow, Richard G. Bower, Peter W. Draper, Pedro Gonnet, Matthieu Schaller
π PDF
π A Novel Algorithm for the All-Best-Swap-Edge Problem on Tree Spanners
π₯ Davide BilΓ², Kleitos Papadopoulos
π PDF
π Ortho-polygon Visibility Representations of 3-connected 1-plane Graphs
π₯ Giuseppe Liotta, Fabrizio Montecchiani, Alessandra Tappini
π PDF
#DataStructuresandAlgorithms
AI Python & arXiv Channel
To access articles related to a category, touch the HashTag:
π Artificial Intelligence
π #ArtificialIntelligence π
π Hardware Architecture
π #HardwareArchitecture π
π Computational Complexity
π #ComputationalComplexity π
π Computational Engineering, Finance, and Science
π #ComputationalEngineeringFinanceandScience π
π Computational Geometry
π #ComputationalGeometry π
π Computation and Language
π #ComputationandLanguage π
π Cryptography and Security
π #CryptographyandSecurity π
π Computer Vision and Pattern Recognition
π #ComputerVisionandPatternRecognition π
π Computers and Society
π #ComputersandSociety π
π Databases
π #Databases π
π Distributed, Parallel, and Cluster Computing
π #DistributedParallelandClusterComputing π
π Digital Libraries
π #DigitalLibraries π
π Discrete Mathematics
π #DiscreteMathematics π
π Data Structures and Algorithms
π <
π Artificial Intelligence
π #ArtificialIntelligence π
π Hardware Architecture
π #HardwareArchitecture π
π Computational Complexity
π #ComputationalComplexity π
π Computational Engineering, Finance, and Science
π #ComputationalEngineeringFinanceandScience π
π Computational Geometry
π #ComputationalGeometry π
π Computation and Language
π #ComputationandLanguage π
π Cryptography and Security
π #CryptographyandSecurity π
π Computer Vision and Pattern Recognition
π #ComputerVisionandPatternRecognition π
π Computers and Society
π #ComputersandSociety π
π Databases
π #Databases π
π Distributed, Parallel, and Cluster Computing
π #DistributedParallelandClusterComputing π
π Digital Libraries
π #DigitalLibraries π
π Discrete Mathematics
π #DiscreteMathematics π
π Data Structures and Algorithms
π <