( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
An Exact Algorithm to Check the Existence of (Elementary) Paths and a Generalisation of the Cut Problem in Graphs with Forbidden Transitions.

, , и . SOFSEM, том 7741 из Lecture Notes in Computer Science, стр. 257-267. Springer, (2013)

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.

Benjamin Bender

Cerebrospinal fluid and interstitial fluid volume measurement in the human brain at 3T with EPI. Uni Tübingen, (2009)

Benjamin Köckemann

Abundance, niche breadth and stress in the centre and at the border of the distribution range: a macroecological study on abundant and rare tree specie. Uni Göttingen, (2008)

Benjamin Braatz

Formal modelling and application of graph transformations in the resource description framework. TU Berlin, (2009)

Benjamin Klaus

Benjamin Bajon

 

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

Nash-Williams-type and Chvátal-type Conditions in One-Conflict Graphs., и . SOFSEM, том 8939 из Lecture Notes in Computer Science, стр. 327-338. Springer, (2015)Local Search with Weighting Schemes for the CG: SHOP 2022 Competition (CG Challenge)., , , и . SoCG, том 224 из LIPIcs, стр. 73:1-73:6. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Autour de la connexité dans les graphes avec conflits. (On the Connectivity of Graphs with Conflicts).. Blaise Pascal University, Clermont-Ferrand, France, (2015)Trees in Graphs with Conflict Edges or Forbidden Transitions., , и . TAMC, том 7876 из Lecture Notes in Computer Science, стр. 343-354. Springer, (2013)An Exact Algorithm to Check the Existence of (Elementary) Paths and a Generalisation of the Cut Problem in Graphs with Forbidden Transitions., , и . SOFSEM, том 7741 из Lecture Notes in Computer Science, стр. 257-267. Springer, (2013)Simple Paths and Cycles Avoiding Forbidden Paths.. SOFSEM, том 10706 из Lecture Notes in Computer Science, стр. 285-294. Springer, (2018)Some Hamiltonian Properties of One-Conflict Graphs., и . IWOCA, том 8986 из Lecture Notes in Computer Science, стр. 262-273. Springer, (2014)Sufficient Conditions for a Connected Graph to Have a Hamiltonian Path.. SOFSEM, том 10139 из Lecture Notes in Computer Science, стр. 205-216. Springer, (2017)