From post

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)

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.

 

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

Upgrading trees under diameter and budget constraints., , и . Networks, 41 (1): 24-35 (2003)Embedding into the rectilinear grid., и . Networks, 32 (2): 127-132 (1998)Interval Routing in Some Planar Quadrangulations., и . SIROCCO, том 8 из Proceedings in Informatics, стр. 89-104. Carleton Scientific, (2001)An Approximation Algorithm for lınfty-Fitting Robinson Structures to Distances, и . CoRR, (2009)A Multifacility Location Problem on Median Spaces.. Discret. Appl. Math., 64 (1): 1-29 (1996)Packing and Covering delta -Hyperbolic Spaces by Balls., и . APPROX-RANDOM, том 4627 из Lecture Notes in Computer Science, стр. 59-73. Springer, (2007)Constant Approximation Algorithms for Embedding Graph Metrics into Trees and Outerplanar Graphs., , , , и . APPROX-RANDOM, том 6302 из Lecture Notes in Computer Science, стр. 95-109. Springer, (2010)Deciding the Satisfiability of Propositional Formulas in Finitely-Valued Signed Logics., , , и . ISMVL, стр. 100-105. IEEE Computer Society, (2008)Labeled sample compression schemes for complexes of oriented matroids., , и . J. Comput. Syst. Sci., (2024)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)