Author of the publication

Hypergraph Traversal Revisited: Cost Measures and Dynamic Algorithms.

, , and . MFCS, volume 1450 of Lecture Notes in Computer Science, page 1-16. Springer, (1998)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

A Uniform Approach to Semi-Dynamic Problems on Digraphs., , , and . Theor. Comput. Sci., 203 (1): 69-90 (1998)Multidimensional Interval Routing Schemes., , , and . Theor. Comput. Sci., 205 (1-2): 115-133 (1998)Dynamic Maintenance of Directed Hypergraphs., and . Theor. Comput. Sci., 72 (2&3): 97-117 (1990)An Experimental Study of Dynamic Algorithms for Transitive Closure., , , and . ACM J. Exp. Algorithmics, (2001)Fully Dynamic Shortest Paths and Negative Cycles Detection on Digraphs with Arbitrary Arc Weights., , and . ESA, volume 1461 of Lecture Notes in Computer Science, page 320-331. Springer, (1998)Semidynamic Algorithms for Maintaining Single-Source Shortest Path Trees., , and . Algorithmica, 22 (3): 250-274 (1998)Characterization results of all shortest paths interval routing schemes., , , and . Networks, 37 (4): 225-232 (2001)LOA: The LOGIDATA+ Object Algebra., , and . LOGIDATA+: Deductive Databases with Complex Objects, volume 701 of Lecture Notes in Computer Science, Springer, (1993)Visual Analysis Based on Dominator Trees with Application to Personalized eLearning., , and . ICWL, volume 8613 of Lecture Notes in Computer Science, page 207-212. Springer, (2014)On-Line Computation of Minimal and Maximal Length Paths., , , and . Theor. Comput. Sci., 95 (2): 245-261 (1992)