_id,doi,title
11402,10.1016/j.jcss.2022.04.003,Graph planning with expected finite horizon
9239,10.1016/j.jcss.2021.02.008,Bidding mechanisms in graph games
11766,10.1016/s0022-0000(03)00043-6,Scheduling multicasts on unit-capacity trees and meshes
11767,10.1006/jcss.1997.1493,Faster shortest-path algorithms for planar graphs
4057,10.1016/0022-0000(91)90013-U,Corrigendum
4082,10.1016/0022-0000(89)90038-X,Topologically sweeping an arrangement