( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
The Complexity of Growing a Graph.

, , , , и . ALGOSENSORS, том 13707 из Lecture Notes in Computer Science, стр. 123-137. Springer, (2022)

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.

George Mertzios

Combinatorial optimization and recognition of graph classes with applications to related models. TU Aachen, (2009)

George B Sumyk

George B Sumyk

B Schäfers

B Wiederanders

 

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

Vertex splitting and the recognition of trapezoid graphs., и . Discret. Appl. Math., 159 (11): 1131-1147 (2011)Sliding Window Temporal Graph Coloring., , и . CoRR, (2018)On the intersection of tolerance and cocomparability graphs., и . Discret. Appl. Math., (2016)How Fast Can We Reach a Target Vertex in Stochastic Temporal Graphs?, , , , , и . ICALP, том 132 из LIPIcs, стр. 131:1-131:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Preface., , , , , и . BCC, стр. vii-viii. Cambridge University Press, (2021)The Complexity of Computing Optimum Labelings for Temporal Connectivity., , , и . MFCS, том 241 из LIPIcs, стр. 62:1-62:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Equitable Scheduling on a Single Machine., , , , , и . AAAI, стр. 11818-11825. AAAI Press, (2021)An optimal algorithm for the k-fixed-endpoint path cover on proper interval graphs., и . IWOCA, стр. 197-211. College Publications, (2008)Online Regenerator Placement., , , и . CoRR, (2013)Minimum Bisection Is NP-hard on Unit Disk Graphs., и . MFCS (2), том 8635 из Lecture Notes in Computer Science, стр. 251-262. Springer, (2014)