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