( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Bounds on spectrum graph coloring.

, , , и . Electron. Notes Discret. Math., (2016)

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.

Hoerst ordenskjöld

Israel Ordenel Heredia Rojas

Rainer Ordenewitz

Jürgen Davids

Volker David

 

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

Spectrum graph coloring to improve Wi-Fi channel assignment in a real-world scenario via edge contraction., , , , и . CoRR, (2018)Spectrum Graph Coloring and Applications to Wi-Fi Channel Assignment., , , и . Symmetry, 10 (3): 65 (2018)Maximum Rectilinear Convex Subsets., , , , , , и . FCT, том 11651 из Lecture Notes in Computer Science, стр. 274-291. Springer, (2019)Comparison of Box--Tiao and Johansen canonical estimators of cointegrating vectors in VEC(1) models, , , и . Journal of Econometrics, 64 (1-2): 3--27 (00 1994)Nonlinear Negotiation Approaches for Complex-Network Optimization: A Study Inspired by Wi-Fi Channel Assignment., , , , и . COREDEMA@ECAI, том 10238 из Lecture Notes in Computer Science, стр. 51-65. (2016)On the number of pseudo-triangulations of certain point sets., , , и . J. Comb. Theory A, 115 (2): 254-278 (2008)A Distributed, Multi-Agent Approach to Reactive Network Resilience., , , , и . AAMAS, стр. 1044-1053. ACM, (2017)Planar minimally rigid graphs and pseudo-triangulations., , , , , , , , и . Comput. Geom., 31 (1-2): 31-61 (2005)Binary Labelings for Plane Quadrangulations and their Relatives., , , и . Discret. Math. Theor. Comput. Sci., 12 (3): 115-138 (2010)Competitive Belief Propagation to Efficiently Solve Complex Multi-agent Negotiations with Network Structure., , , и . AAMAS Workshops (Visionary Papers), том 10643 из Lecture Notes in Computer Science, стр. 1-16. Springer, (2017)