document.getElementById('index-articles-list').innerHTML = `
  • Limitations of the Impagliazzo-Nisan-Wigderson Pseudorandom Generator Against Permutation Branching Programs
    Impagliazzo-Nisan-Wigderson型伪随机生成器对抗置换分支程序的限制

    William M Hoza,Edward Pyne,Salil Vadhan

    Algorithmica. 2024;86(10):3153-3185. DOI:10.1007/s00453-024-01251-2
  • On the Parameterized Complexity of Compact Set Packing
    关于紧凑集包装参数化复杂度的分析

    Ameet Gadekar

    Algorithmica. 2024;86(11):3579-3597. DOI:10.1007/s00453-024-01269-6
  • Reconfiguring Shortest Paths in Graphs
    图的最短路径重组问题

    Kshitij Gajjar,Agastya Vibhuti Jha,Manish Kumar et al.

    Algorithmica. 2024;86(10):3309-3338. DOI:10.1007/s00453-024-01263-y
  • Slim Tree-Cut Width
    狭隘的树剖宽度

    Robert Ganian,Viktoriia Korchemna

    Algorithmica. 2024;86(8):2714-2738. DOI:10.1007/s00453-024-01241-4
  • Connectivity with Uncertainty Regions Given as Line Segments

    Sergio Cabello,David Gajser

    Algorithmica. 2024;86(5):1512-1544. DOI:10.1007/s00453-023-01200-5
    • `; document.getElementById('index-articles-more').href = `https://i.iikx.com/journal/0178-4617.html`; document.getElementById('index-articles-more').innerHTML='更多内容'; document.getElementById('index-articles-more').style="float:right;background:var(--primary-color);color:#fff;font-size:13px;border-radius:5px;padding:0px 10px;margin-right:5px;line-height:1.7"; document.getElementsByClassName('index-artcles')[0].style.display = 'block'; document.getElementById('showJournalIndexUrl').style.display = 'block'; document.querySelector('#showJournalIndexUrl a').href = `https://i.iikx.com/journal/0178-4617.html`;