Author of the publication

Avoiding Routing Loops on the Internet.

, , , and . SIROCCO, volume 13 of Proceedings in Informatics, page 197-210. Carleton Scientific, (2002)

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

Constant-Time Algorithms for Sparsity Matroids., , and . ICALP (1), volume 7391 of Lecture Notes in Computer Science, page 498-509. Springer, (2012)Property Testing on k-Vertex-Connectivity of Graphs., and . ICALP (1), volume 5125 of Lecture Notes in Computer Science, page 539-550. Springer, (2008)Three Equivalent Partial Orders on Graphs with Real Edge-Weights Drawn on a Convex Polygon.. JCDCG, volume 3742 of Lecture Notes in Computer Science, page 123-130. Springer, (2004)A Much Faster Algorithm for Finding a Maximum Clique with Computational Experiments., , , , and . J. Inf. Process., (2017)Linear-Time Enumeration of Isolated Cliques., , and . ESA, volume 3669 of Lecture Notes in Computer Science, page 119-130. Springer, (2005)Constant-Time Approximation Algorithms for the Optimum Branching Problem on Sparse Graphs., , and . ICNC, page 407-413. IEEE Computer Society, (2012)Polynomial-Time Computable Backup Tables for Shortest-Path Routing., , , and . SIROCCO, volume 17 of Proceedings in Informatics, page 163-177. Carleton Scientific, (2003)Edge connectivity between nodes and node-subsets., and . Networks, 31 (3): 157-163 (1998)Helly Numbers of Polyominoes., , , and . CoRR, (2017)2-Dimension Ham Sandwich Theorem for Partitioning into Three Convex Pieces., , and . JCDCG, volume 1763 of Lecture Notes in Computer Science, page 129-157. Springer, (1998)