_id,doi,title
10731,10.1038/s41598-022-05333-5,Infection dynamics of COVID-19 virus under lockdown and reopening
12257,10.1103/physreve.106.034321,Social balance on networks: Local minima and best-edge dynamics
9393,10.1007/s10703-021-00373-5,Faster algorithms for quantitative verification in bounded treewidth graphs
9640,10.1038/s41467-021-24271-w,Fast and strong amplifiers of natural selection
10191,10.1145/3485541,The reads-from equivalence for the TSO and PSO memory models
10629,10.4230/LIPIcs.FSTTCS.2021.42,Quantitative verification on product graphs of small treewidth
9987,10.1007/978-3-030-81685-8_16,Stateless model checking under a reads-value-from equivalence
7810,10.1007/978-3-030-44914-8_5,Optimal and perfectly parallel algorithms for on-demand data-flow analysis
8728,10.1007/978-3-030-59152-6_14,Faster algorithms for quantitative analysis of MCs and MDPs with small treewidth
8788,10.1109/TCAD.2020.3012803,Precedence-aware automated competitive analysis of real-time scheduling
7212,10.1371/journal.pcbi.1007494,Limits on amplifiers of natural selection under death-Birth updating
7158,10.1145/3363525,Faster algorithms for dynamic algebraic queries in basic RSMs with constant treewidth
7210,10.1038/s42003-019-0373-y,Population structure determines the tradeoff between fixation probability and fixation time
6380,10.1145/3290366,Efficient parameterized algorithms for data packing
10190,10.1145/3360550,Value-centric dynamic partial order reduction
738,10.1007/s11241-017-9293-4,Automated competitive analysis of real time scheduling with graph games
5751,10.1038/s42003-018-0078-7,Construction of arbitrarily strong amplifiers of natural selection using evolutionary graph theory
6009,10.1145/3210257,Algorithms for algebraic path properties in concurrent systems of constant treewidth components
821,10.15479/AT:ISTA:th_854,Algorithmic advances in program analysis and their applications
512,10.1038/s41598-017-00107-w,Amplification on undirected population structures: Comets beat stars