{"topic":{"slug":"algorithms-complexity","name":"Algorithms & Complexity Breakthroughs","domain":"math-cs","description":"Almost-linear-time max flow, shortest paths beyond Dijkstra's sorting barrier, matrix multiplication exponent improvements and space-time simulation results.","keywords":["almost-linear time","maximum flow","shortest paths","matrix multiplication","sorting barrier","time-space"],"paper_count":192,"latest_published":"2026-10-25","url":"https://space-kitty.com/topics/algorithms-complexity","api_url":"https://space-kitty.com/api/v1/topics/algorithms-complexity"},"dossier":null,"top_papers":[{"id":"doi:10.1016/j.ces.2012.08.039","kind":"article","title":"Droplet formation and breakup dynamics in microfluidic flow-focusing devices: From dripping to jetting","authors":["Taotao Fu","Yining Wu","Youguang Ma","Huai Li"],"author_count":4,"year":2012,"published":"2012-08-29","venue":"Chemical Engineering Science","cited_by":313,"doi":"10.1016/j.ces.2012.08.039","arxiv_id":null,"nct_id":null,"source_url":"https://doi.org/10.1016/j.ces.2012.08.039","archive_url":"https://space-kitty.com/papers/doi:10.1016/j.ces.2012.08.039"},{"id":"doi:10.1104/pp.17.00287","kind":"article","title":"Stomatal Function across Temporal and Spatial Scales: Deep-Time Trends, Land-Atmosphere Coupling and Global Models","authors":["Peter J. Franks","Joseph A. Berry","Danica Lombardozzi","Gordon B. Bonan"],"author_count":4,"year":2017,"published":"2017-04-26","venue":"PLANT PHYSIOLOGY","cited_by":159,"doi":"10.1104/pp.17.00287","arxiv_id":null,"nct_id":null,"source_url":"https://doi.org/10.1104/pp.17.00287","archive_url":"https://space-kitty.com/papers/doi:10.1104/pp.17.00287"},{"id":"doi:10.5194/hess-17-4297-2013","kind":"article","title":"A thermodynamic approach to link self-organization, preferential flow and rainfall–runoff behaviour","authors":["Erwin Zehe","Uwe Ehret","Theresa Blume","Axel Kleidon","Ulrike Scherer","Martijn C. Westhoff"],"author_count":6,"year":2013,"published":"2013-11-01","venue":"Hydrology and earth system sciences","cited_by":80,"doi":"10.5194/hess-17-4297-2013","arxiv_id":null,"nct_id":null,"source_url":"https://doi.org/10.5194/hess-17-4297-2013","archive_url":"https://space-kitty.com/papers/doi:10.5194/hess-17-4297-2013"},{"id":"doi:10.1016/j.ijpe.2016.02.004","kind":"article","title":"Closed loop supply chain networks: Designs for energy and time value efficiency","authors":["Dinesh K. Kadambala","Nachiappan Subramanian","Manoj Kumar Tiwari","Muhammad Dan-Asabe Abdulrahman","Chang Liu"],"author_count":5,"year":2016,"published":"2016-02-16","venue":"International Journal of Production Economics","cited_by":79,"doi":"10.1016/j.ijpe.2016.02.004","arxiv_id":null,"nct_id":null,"source_url":"https://doi.org/10.1016/j.ijpe.2016.02.004","archive_url":"https://space-kitty.com/papers/doi:10.1016/j.ijpe.2016.02.004"},{"id":"arxiv:1903.05956","kind":"article","title":"Fast Approximate Shortest Paths in the Congested Clique","authors":["Keren Censor-Hillel","Michal Dory","Janne H. Korhonen","Dean Leitersdorf"],"author_count":4,"year":2019,"published":"2019-03-14","venue":"Distributed Computing","cited_by":43,"doi":"10.1007/s00446-020-00380-5","arxiv_id":"1903.05956","nct_id":null,"source_url":"https://arxiv.org/abs/1903.05956","archive_url":"https://space-kitty.com/papers/arxiv:1903.05956"},{"id":"arxiv:1601.04640","kind":"article","title":"CUDA programs for solving the time-dependent dipolar Gross–Pitaevskii equation in an anisotropic trap","authors":["Vladimir Lončar","Antun Balaž","Aleksandar Bogojević","Srdjan Škrbić","Paulsamy Muruganandam","Sadhan K. Adhikari"],"author_count":6,"year":2015,"published":"2015-12-18","venue":"Computer Physics Communications","cited_by":62,"doi":"10.1016/j.cpc.2015.11.014","arxiv_id":"1601.04640","nct_id":null,"source_url":"https://doi.org/10.1016/j.cpc.2015.11.014","archive_url":"https://space-kitty.com/papers/arxiv:1601.04640"},{"id":"doi:10.1016/j.jnnfm.2019.04.003","kind":"article","title":"A new finite element formulation for viscoelastic flows: Circumventing simultaneously the LBB condition and the high-Weissenberg number problem","authors":["Stylianos Varchanis","Alexandros Syrakos","Yannis Dimakopoulos","JOHN A. TSAMOPOULOS"],"author_count":4,"year":2019,"published":"2019-04-13","venue":"Journal of Non-Newtonian Fluid Mechanics","cited_by":59,"doi":"10.1016/j.jnnfm.2019.04.003","arxiv_id":null,"nct_id":null,"source_url":"https://doi.org/10.1016/j.jnnfm.2019.04.003","archive_url":"https://space-kitty.com/papers/doi:10.1016/j.jnnfm.2019.04.003"},{"id":"arxiv:1610.05329","kind":"article","title":"OpenMP, OpenMP/MPI, and CUDA/MPI C programs for solving the time-dependent dipolar Gross–Pitaevskii equation","authors":["Vladimir Lončar","Luis E. Young-S.","Srdjan Škrbić","Paulsamy Muruganandam","Sadhan K. Adhikari","Antun Balaž"],"author_count":6,"year":2016,"published":"2016-09-09","venue":"Computer Physics Communications","cited_by":59,"doi":"10.1016/j.cpc.2016.07.029","arxiv_id":"1610.05329","nct_id":null,"source_url":"https://doi.org/10.1016/j.cpc.2016.07.029","archive_url":"https://space-kitty.com/papers/arxiv:1610.05329"},{"id":"doi:10.1016/j.fuel.2019.116486","kind":"article","title":"Modelling of fully-coupled CO2 diffusion and adsorption-induced coal matrix swelling","authors":["K.H.S.M. Sampath","M.S.A. Perera","Stephan Konrad Matthai","Pathegama Gamage Ranjith","Dongyin Li"],"author_count":5,"year":2019,"published":"2019-11-06","venue":"Fuel","cited_by":57,"doi":"10.1016/j.fuel.2019.116486","arxiv_id":null,"nct_id":null,"source_url":"https://doi.org/10.1016/j.fuel.2019.116486","archive_url":"https://space-kitty.com/papers/doi:10.1016/j.fuel.2019.116486"},{"id":"arxiv:1705.02044","kind":"preprint","title":"A Survey of Shortest-Path Algorithms","authors":["Amgad Madkour","Walid G. Aref","Faizan Ur Rehman","Mohamed Abdur Rahman","Saleh Basalamah"],"author_count":5,"year":2017,"published":"2017-05-04","venue":null,"cited_by":58,"doi":null,"arxiv_id":"1705.02044","nct_id":null,"source_url":"https://arxiv.org/abs/1705.02044","archive_url":"https://space-kitty.com/papers/arxiv:1705.02044"},{"id":"arxiv:1712.09121","kind":"article","title":"Improved Distributed Algorithms for Exact Shortest Paths","authors":["Mohsen Ghaffari","Jason Li"],"author_count":2,"year":2017,"published":"2017-12-25","venue":"ACM Symposium on Theory of Computing (STOC)","cited_by":54,"doi":"10.1145/3188745.3188948","arxiv_id":"1712.09121","nct_id":null,"source_url":"https://arxiv.org/abs/1712.09121","archive_url":"https://space-kitty.com/papers/arxiv:1712.09121"},{"id":"arxiv:2311.18295","kind":"article","title":"Almost-Linear Time Algorithms for Incremental Graphs: Cycle Detection, SCCs, $s$-$t$ Shortest Path, and Minimum-Cost Flow","authors":["Li Chen","Rasmus Kyng","Yang P. Liu","Simon Meierhans","Maximilian Probst Gutenberg"],"author_count":5,"year":2023,"published":"2023-11-30","venue":"ACM Symposium on Theory of Computing (STOC)","cited_by":12,"doi":"10.1145/3618260.3649745","arxiv_id":"2311.18295","nct_id":null,"source_url":"https://arxiv.org/abs/2311.18295","archive_url":"https://space-kitty.com/papers/arxiv:2311.18295"},{"id":"doi:10.1002/hyp.13780","kind":"article","title":"Non‐linear quickflow response as indicators of runoff generation mechanisms","authors":["Charles I. Scaife","Nitin K. Singh","R. E. Emanuel","Chelcy Ford Miniat","Lawrence E. Band"],"author_count":5,"year":2020,"published":"2020-04-15","venue":"Hydrological Processes","cited_by":48,"doi":"10.1002/hyp.13780","arxiv_id":null,"nct_id":null,"source_url":"https://doi.org/10.1002/hyp.13780","archive_url":"https://space-kitty.com/papers/doi:10.1002/hyp.13780"},{"id":"doi:10.1016/j.apenergy.2010.11.006","kind":"article","title":"Experimental investigation of frost formation on a parallel flow evaporator","authors":["Jianghong Wu","Guang Ouyang","Puxiu Hou","Haobin Xiao"],"author_count":4,"year":2010,"published":"2010-12-10","venue":"Applied Energy","cited_by":53,"doi":"10.1016/j.apenergy.2010.11.006","arxiv_id":null,"nct_id":null,"source_url":"https://doi.org/10.1016/j.apenergy.2010.11.006","archive_url":"https://space-kitty.com/papers/doi:10.1016/j.apenergy.2010.11.006"},{"id":"arxiv:2203.00671","kind":"preprint","title":"Maximum Flow and Minimum-Cost Flow in Almost-Linear Time","authors":["Li Chen","Rasmus Kyng","Yang P. Liu","Richard Peng","Maximilian Probst Gutenberg","Sushant Sachdeva"],"author_count":6,"year":2022,"published":"2022-03-01","venue":null,"cited_by":12,"doi":null,"arxiv_id":"2203.00671","nct_id":null,"source_url":"https://arxiv.org/abs/2203.00671","archive_url":"https://space-kitty.com/papers/arxiv:2203.00671"}],"newest_papers":[{"id":"arxiv:2610.34273","kind":"preprint","title":"Asymptotic Rank of Complete Graph Tensors","authors":["Huanyi Zhou"],"author_count":1,"year":2026,"published":"2026-10-25","venue":null,"cited_by":0,"doi":null,"arxiv_id":"2610.34273","nct_id":null,"source_url":"https://arxiv.org/abs/2610.34273","archive_url":"https://space-kitty.com/papers/arxiv:2610.34273"},{"id":"arxiv:2610.34302","kind":"preprint","title":"Bicriteria Approximate Navigable Graphs in General Metrics","authors":["Hongyi Chen","Tianyi Zhang"],"author_count":2,"year":2026,"published":"2026-10-25","venue":null,"cited_by":0,"doi":null,"arxiv_id":"2610.34302","nct_id":null,"source_url":"https://arxiv.org/abs/2610.34302","archive_url":"https://space-kitty.com/papers/arxiv:2610.34302"},{"id":"arxiv:2610.32556","kind":"preprint","title":"Combinatorial Minimum Cost Flow in Almost-Linear Time on Dense Graphs","authors":["Bernhard Haeupler","Yonggang Jiang","Thatchaphol Saranurak"],"author_count":3,"year":2026,"published":"2026-10-23","venue":null,"cited_by":0,"doi":null,"arxiv_id":"2610.32556","nct_id":null,"source_url":"https://arxiv.org/abs/2610.32556","archive_url":"https://space-kitty.com/papers/arxiv:2610.32556"},{"id":"arxiv:2610.32836","kind":"preprint","title":"Compressed Boolean Matrix Multiplication using Bicliques","authors":["Nicolás Araya","José Zagal","Cecilia Hernández","Gonzalo Navarro"],"author_count":4,"year":2026,"published":"2026-10-23","venue":null,"cited_by":0,"doi":null,"arxiv_id":"2610.32836","nct_id":null,"source_url":"https://arxiv.org/abs/2610.32836","archive_url":"https://space-kitty.com/papers/arxiv:2610.32836"},{"id":"arxiv:2610.30054","kind":"preprint","title":"Multiplying matrices via polynomials: exposition and barriers","authors":["Alimzhan Amanov","Maxim van den Berg","Jeroen Zuiddam"],"author_count":3,"year":2026,"published":"2026-10-21","venue":null,"cited_by":0,"doi":null,"arxiv_id":"2610.30054","nct_id":null,"source_url":"https://arxiv.org/abs/2610.30054","archive_url":"https://space-kitty.com/papers/arxiv:2610.30054"},{"id":"arxiv:2610.30458","kind":"preprint","title":"Polynomial pathwidth for graphs vertex-coverable by few shortest paths and algorithms for quasi-shortest path covers","authors":["Li-Hsuan Chen","Florent Foucaud","Ling-Ju Hung","Ralf Klasing","Lucas Lorieau","Peter Rossmanith"],"author_count":6,"year":2026,"published":"2026-10-21","venue":null,"cited_by":0,"doi":null,"arxiv_id":"2610.30458","nct_id":null,"source_url":"https://arxiv.org/abs/2610.30458","archive_url":"https://space-kitty.com/papers/arxiv:2610.30458"},{"id":"arxiv:2610.27451","kind":"preprint","title":"A 55-Addition Rank-23 Scheme for $3\\times3$ Matrix Multiplication via Exact Two-Sided Minimization","authors":["Greg Sidebottom"],"author_count":1,"year":2026,"published":"2026-10-20","venue":null,"cited_by":0,"doi":null,"arxiv_id":"2610.27451","nct_id":null,"source_url":"https://arxiv.org/abs/2610.27451","archive_url":"https://space-kitty.com/papers/arxiv:2610.27451"},{"id":"arxiv:2610.27935","kind":"preprint","title":"Improved Approximation and Hardness Results for the Monitoring Edge-Geodetic Set Problem","authors":["Davide Bilò","Giordano Colli","Stefano Leucci"],"author_count":3,"year":2026,"published":"2026-10-20","venue":null,"cited_by":0,"doi":null,"arxiv_id":"2610.27935","nct_id":null,"source_url":"https://arxiv.org/abs/2610.27935","archive_url":"https://space-kitty.com/papers/arxiv:2610.27935"},{"id":"arxiv:2610.28573","kind":"preprint","title":"Dynamic Distances Without Matrix Inverse","authors":["Jan van den Brand","Adam Karczmarz","Aryan Patel"],"author_count":3,"year":2026,"published":"2026-10-20","venue":null,"cited_by":0,"doi":null,"arxiv_id":"2610.28573","nct_id":null,"source_url":"https://arxiv.org/abs/2610.28573","archive_url":"https://space-kitty.com/papers/arxiv:2610.28573"},{"id":"arxiv:2610.28627","kind":"preprint","title":"Matrix Multiplication from Polynomial Packings: A Constructive and Elementary Proof of $ω\\le9/4$","authors":["Rafael Pass"],"author_count":1,"year":2026,"published":"2026-10-20","venue":null,"cited_by":0,"doi":null,"arxiv_id":"2610.28627","nct_id":null,"source_url":"https://arxiv.org/abs/2610.28627","archive_url":"https://space-kitty.com/papers/arxiv:2610.28627"}],"related_topics":[{"slug":"ai-mathematics","name":"AI for Mathematics & Formal Proof","api_url":"https://space-kitty.com/api/v1/topics/ai-mathematics"},{"slug":"landmark-math-results","name":"Landmark Results in Pure Mathematics","api_url":"https://space-kitty.com/api/v1/topics/landmark-math-results"}],"premium":{"dossier":null,"research_pack":{"url":"https://space-kitty.com/api/v1/topics/algorithms-complexity/pack","price_usd":"0.20"}},"more":"https://space-kitty.com/api/v1/topics/algorithms-complexity/papers?sort=top&limit=100"}