( en | de | ru )

 

Disambiguation of "Momège, Benjamin"

Author of the publication

copydeleteadd this publication to your clipboard
Finding Paths in Grids with Forbidden Transitions.

, , , and . WG, volume 9224 of Lecture Notes in Computer Science, page 154-168. Springer, (2015)

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. You can also use the button next to the name to display some publications already assigned to the person.

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 Bender

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

Benjamin Braatz

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

Benjamin Müller

Benjamin Klaus

 

Other publications of authors with the same name

Nash-Williams-type and Chvátal-type Conditions in One-Conflict Graphs., and . SOFSEM, volume 8939 of Lecture Notes in Computer Science, page 327-338. Springer, (2015)Local Search with Weighting Schemes for the CG: SHOP 2022 Competition (CG Challenge)., , , and . SoCG, volume 224 of LIPIcs, page 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)Connected graph G with σ2(G)≥23n and K1, 4-free contains a Hamiltonian path.. Discret. Appl. Math., (2018)Some Hamiltonian Properties of One-Conflict Graphs., and . IWOCA, volume 8986 of Lecture Notes in Computer Science, page 262-273. Springer, (2014)Sufficient Conditions for a Connected Graph to Have a Hamiltonian Path.. SOFSEM, volume 10139 of Lecture Notes in Computer Science, page 205-216. Springer, (2017)Simple Paths and Cycles Avoiding Forbidden Paths.. SOFSEM, volume 10706 of Lecture Notes in Computer Science, page 285-294. Springer, (2018)Trees in Graphs with Conflict Edges or Forbidden Transitions., , and . TAMC, volume 7876 of Lecture Notes in Computer Science, page 343-354. Springer, (2013)Conflict Optimization for Binary CSP Applied to Minimum Partition into Plane Subgraphs and Graph Coloring., , , , , , , , , and 1 other author(s). CoRR, (2023)An Exact Algorithm to Check the Existence of (Elementary) Paths and a Generalisation of the Cut Problem in Graphs with Forbidden Transitions., , and . SOFSEM, volume 7741 of Lecture Notes in Computer Science, page 257-267. Springer, (2013)