@inproceedings{11803,
  abstract     = {We present the first fully dynamic algorithm for maintaining a minimum spanning tree in time o(√n) per operation. To be precise, the algorithm uses O(n 1/3 log n) amortized time per update operation. The algorithm is fairly simple and deterministic. An immediate consequence is the first fully dynamic deterministic algorithm for maintaining connectivity and, bipartiteness in amortized time O(n 1/3 log n) per update, with O(1) worst case time per query.},
  author       = {Henzinger, Monika H and King, Valerie},
  booktitle    = {24th International Colloquium on Automata, Languages and Programming},
  isbn         = {9783540631651},
  issn         = {1611-3349},
  location     = {Bologna, Italy},
  pages        = {594–604},
  publisher    = {Springer Nature},
  title        = {{Maintaining minimum spanning trees in dynamic graphs}},
  doi          = {10.1007/3-540-63165-8_214},
  volume       = {1256},
  year         = {1997},
}

@inproceedings{4441,
  abstract     = {Rectangular hybrid automata model digital control programs of analog plant environments. We study rectangular hybrid automata where the plant state evolves continuously in real-numbered time, and the controller samples the plant state and changes the control state discretely, only at the integer points in time. We prove that rectangular hybrid automata have finite bisimilarity quotients when all control transitions happen at integer times, even if the constraints on the derivatives of the variables vary between control states. This is sharply in contrast with the conventional model where control transitions may happen at any real time, and already the reachability problem is undecidable. Based on the finite bisimilarity quotients, we give an exponential algorithm for the symbolic sampling-controller synthesis of rectangular automata. We show our algorithm to be optimal by proving the problem to be EXPTIME-hard. We also show that rectangular automata form a maximal class of systems for which the sampling-controller synthesis problem can be solved algorithmically.},
  author       = {Henzinger, Thomas A and Kopke, Peter},
  booktitle    = {Proceedings of the 24th International Colloquium on Automata, Languages and Programming},
  isbn         = {9783540631651},
  location     = {Bologna, Italy},
  pages        = {582 -- 593},
  publisher    = {Springer},
  title        = {{Discrete-time control for rectangular hybrid automata}},
  doi          = {10.1007/3-540-63165-8_213},
  volume       = {1256},
  year         = {1997},
}