@article{11402,
  abstract     = {Fixed-horizon planning considers a weighted graph and asks to construct a path that maximizes the sum of weights for a given time horizon T. However, in many scenarios, the time horizon is not fixed, but the stopping time is chosen according to some distribution such that the expected stopping time is T. If the stopping-time distribution is not known, then to ensure robustness, the distribution is chosen by an adversary as the worst-case scenario. A stationary plan for every vertex always chooses the same outgoing edge. For fixed horizon or fixed stopping-time distribution, stationary plans are not sufficient for optimality. Quite surprisingly we show that when an adversary chooses the stopping-time distribution with expected stopping-time T, then stationary plans are sufficient. While computing optimal stationary plans for fixed horizon is NP-complete, we show that computing optimal stationary plans under adversarial stopping-time distribution can be achieved in polynomial time.},
  author       = {Chatterjee, Krishnendu and Doyen, Laurent},
  issn         = {1090-2724},
  journal      = {Journal of Computer and System Sciences},
  pages        = {1--21},
  publisher    = {Elsevier},
  title        = {{Graph planning with expected finite horizon}},
  doi          = {10.1016/j.jcss.2022.04.003},
  volume       = {129},
  year         = {2022},
}

@article{9239,
  abstract     = {A graph game proceeds as follows: two players move a token through a graph to produce a finite or infinite path, which determines the payoff of the game. We study bidding games in which in each turn, an auction determines which player moves the token. Bidding games were largely studied in combination with two variants of first-price auctions called “Richman” and “poorman” bidding. We study taxman bidding, which span the spectrum between the two. The game is parameterized by a constant : portion τ of the winning bid is paid to the other player, and portion  to the bank. While finite-duration (reachability) taxman games have been studied before, we present, for the first time, results on infinite-duration taxman games: we unify, generalize, and simplify previous equivalences between bidding games and a class of stochastic games called random-turn games.},
  author       = {Avni, Guy and Henzinger, Thomas A and Žikelić, Đorđe},
  issn         = {1090-2724},
  journal      = {Journal of Computer and System Sciences},
  number       = {8},
  pages        = {133--144},
  publisher    = {Elsevier},
  title        = {{Bidding mechanisms in graph games}},
  doi          = {10.1016/j.jcss.2021.02.008},
  volume       = {119},
  year         = {2021},
}

@article{11766,
  abstract     = {This paper studies the multicast routing and admission control problem on unit-capacity tree and mesh topologies in the throughput model. The problem is a generalization of the edge-disjoint paths problem and is NP-hard both on trees and meshes. We study both the offline and the online version of the problem: In the offline setting, we give the first constant-factor approximation algorithm for trees, and an -factor approximation algorithm for meshes. In the online setting, we give the first polylogarithmic competitive online algorithm for tree and mesh topologies. No polylogarithmic-competitive algorithm is possible on general network topologies (Lower bounds for on-line graph problems with application to on-line circuits and optical routing, in: Proceedings of the 28th ACM Symposium on Theory of Computing, 1996, pp. 531–540) and there exists a polylogarithmic lower bound on the competitive ratio of any online algorithm on tree topologies (Making commitments in the face of uncertainity: how to pick a winner almost every time, in: Proceedings of the 28th Annual ACM Symposium on Theory of Computing, 1996, pp. 519–530). We prove the same lower bound for meshes.},
  author       = {Henzinger, Monika H and Leonardi, Stefano},
  issn         = {0022-0000},
  journal      = {Journal of Computer and System Sciences},
  number       = {3},
  pages        = {567--611},
  publisher    = {Elsevier},
  title        = {{Scheduling multicasts on unit-capacity trees and meshes}},
  doi          = {10.1016/s0022-0000(03)00043-6},
  volume       = {66},
  year         = {2003},
}

@article{11767,
  abstract     = {We give a linear-time algorithm for single-source shortest paths in planar graphs with nonnegative edge-lengths. Our algorithm also yields a linear-time algorithm for maximum flow in a planar graph with the source and sink on the same face. For the case where negative edge-lengths are allowed, we give an algorithm requiringO(n4/3 log(nL)) time, whereLis the absolute value of the most negative length. This algorithm can be used to obtain similar bounds for computing a feasible flow in a planar network, for finding a perfect matching in a planar bipartite graph, and for finding a maximum flow in a planar graph when the source and sink are not on the same face. We also give parallel and dynamic versions of these algorithms.},
  author       = {Henzinger, Monika H and Klein, Philip and Rao, Satish and Subramanian, Sairam},
  issn         = {0022-0000},
  journal      = {Journal of Computer and System Sciences},
  number       = {1},
  pages        = {3--23},
  publisher    = {Elsevier},
  title        = {{Faster shortest-path algorithms for planar graphs}},
  doi          = {10.1006/jcss.1997.1493},
  volume       = {55},
  year         = {1997},
}

@article{4057,
  author       = {Edelsbrunner, Herbert},
  issn         = {1090-2724},
  journal      = {Journal of Computer and System Sciences},
  number       = {2},
  pages        = {249 -- 251},
  publisher    = {Elsevier},
  title        = {{Corrigendum}},
  doi          = {10.1016/0022-0000(91)90013-U},
  volume       = {42},
  year         = {1991},
}

@article{4082,
  abstract     = {Sweeping a collection of figures in the Euclidean plane with a straight line is one of the novel algorithmic paradigms that have emerged in the field of computational geometry. In this paper we demonstrate the advantages of sweeping with a topological line that is not necessarily straight. We show how an arrangement of n lines in the plane can be swept over in O(n2) time and O(n) space by a such a line. In the process each element, i.e., vertex, edge, or region, is visited once in a consistent ordering. Our technique makes use of novel data structures which exhibit interesting amortized complexity behavior; the result is an algorithm that improves upon all its predecessors either in the space or the time bounds, as well as being eminently practical. Numerous applications of the technique to problems in computational geometry are given—many through the use of duality transforms. Examples include solving visibility problems, detecting degeneracies in configurations, computing the extremal shadows of convex polytopes, and others. Even though our basic technique solves a planar problem, its applications include several problems in higher dimensions.},
  author       = {Edelsbrunner, Herbert and Guibas, Leonidas},
  issn         = {1090-2724},
  journal      = {Journal of Computer and System Sciences},
  number       = {1},
  pages        = {165 -- 194},
  publisher    = {Elsevier},
  title        = {{Topologically sweeping an arrangement}},
  doi          = {10.1016/0022-0000(89)90038-X},
  volume       = {38},
  year         = {1989},
}