( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Additive approximation algorithm for geodesic centers in δ-hyperbolic graphs.

, и . CoRR, (2024)

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.

Georgios Yannis

Christos Yannissis

Yann Malato

Role of the IKK complex during liver regeneration: analysis of the differential role of IKKβ/IKK2 IKKbeta/IKK2 and IKKγ/Nemo IKKgamma/Nemo during liver regeneration. TU Aachen, (2009)

Theodoros Yannacopoulos

Anastasia Yannacopoulou

 

Другие публикации лиц с тем же именем

Augmenting Trees to Meet Biconnectivity and Diameter Constraints., и . Algorithmica, 33 (2): 243-262 (2002)Center and diameter problems in plane triangulations and quadrangulations., , и . SODA, стр. 346-355. ACM/SIAM, (2002)Diameters, centers, and approximating trees of delta-hyperbolicgeodesic spaces and graphs., , , , и . SCG, стр. 59-68. ACM, (2008)Convergecast and Broadcast by Power-Aware Mobile Agents., , , , , и . CoRR, (2016)A Self-stabilizing Algorithm for the Median Problem in Partial Rectangular Grids and Their Relatives., , , и . SIROCCO, том 4474 из Lecture Notes in Computer Science, стр. 81-95. Springer, (2007)The Maximum Labeled Path Problem., , и . WG, том 8747 из Lecture Notes in Computer Science, стр. 152-163. Springer, (2014)Multicommodity network flow with jump constraints., и . Discret. Math., (1997)Upgrading trees under diameter and budget constraints., , и . Networks, 41 (1): 24-35 (2003)Constant Approximation Algorithms for Embedding Graph Metrics into Trees and Outerplanar Graphs., , , , и . APPROX-RANDOM, том 6302 из Lecture Notes in Computer Science, стр. 95-109. Springer, (2010)Medians in Median Graphs and Their Cube Complexes in Linear Time., , , и . ICALP, том 168 из LIPIcs, стр. 10:1-10:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)