Kristian de Lichtenberg

1. Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity
   2001/07/01 by Jacob Holm, Kristian de Lichtenberg, Mikkel Thorup · 15 citations
   Computer Science · #Interconnection Networks and Systems #Advanced Graph Theory Research #Complexity and Algorithms in Graphs
2. Maintaining Information in Fully-Dynamic Trees with Top Trees
   2003/10/31 by Stephen Alstrup, Jacob Holm, Alstrup, Stephen +5 · 3 citations
   Computer Science · #Complexity and Algorithms in Graphs #Data Management and Algorithms #Data Structures and Algorithms (cs.DS) #E.1 #F.2.2 #FOS: Computer and information sciences #G.2.2 #Graph Theory and Algorithms #cs.DS
3. Maintaining information in fully dynamic trees with top trees
   2005/10/01 by Stephen Alstrup, Jacob Holm, Kristian de Lichtenberg +1 · 2 citations
   Computer Science · #Complexity and Algorithms in Graphs #Data Management and Algorithms #Graph Theory and Algorithms