PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Dragan, Feodor F."

Author of the publication

copydeleteadd this publication to your clipboard
On the power of BFS to determine a graph's diameter.

, , and . Networks, 42 (4): 209-222 (2003)

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.

F. Dörr

F. Laufer

F. Rusitschka

F. Perni

F. D{\"o}rr

 

Other publications of authors with the same name

Perfect elimination orderings of chordal powers of graphs., , and . Discrete Mathematics, 158 (1-3): 273-278 (1996)Tree spanners on chordal graphs: complexity and algorithms., , , and . Theor. Comput. Sci., 310 (1-3): 329-354 (2004)Collective Additive Tree Spanners of Homogeneously Orderable Graphs., , and . LATIN, volume 4957 of Lecture Notes in Computer Science, page 555-567. Springer, (2008)On the Power of BFS to Determine a Graphs Diameter., , and . LATIN, volume 2286 of Lecture Notes in Computer Science, page 209-223. Springer, (2002)Succinct summarization of transactional databases: an overlapped hyperrectangle scheme., , , and . KDD, page 758-766. ACM, (2008)Provably Good Global Buffering Using an Available Buffer Block Plan., , , , and . ICCAD, page 104-109. IEEE Computer Society, (2000)Fast Approximation and Exact Computation of Negative Curvature Parameters of Graphs., , , , , and . Symposium on Computational Geometry, volume 99 of LIPIcs, page 22:1-22:15. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, (2018)Spanners in Sparse Graphs., , and . ICALP (1), volume 5125 of Lecture Notes in Computer Science, page 597-608. Springer, (2008)On Condorcet and Median Points of Simple Rectilinear Polygons (Extended Abstract)., and . FCT, volume 965 of Lecture Notes in Computer Science, page 181-190. Springer, (1995)Linear Time Algorithms for Hamiltonian Problems on (Claw, Net)-Free Graphs., , and . WG, volume 1665 of Lecture Notes in Computer Science, page 364-376. Springer, (1999)