( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Edge Elimination and Weighted Graph Classes.

, , , , , , , и . WG, том 12301 из Lecture Notes in Computer Science, стр. 134-147. Springer, (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.

Ekkehard Köhler

Ekkehard Köhler

Ekkehard Köhler

Ekkehard Köhler

Jens Köhler

 

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

Time-Expanded Graphs for Flow-Dependent Transit Times., , и . ESA, том 2461 из Lecture Notes in Computer Science, стр. 599-611. Springer, (2002)Recognizing Graph Search Trees., , , , , , и . CoRR, (2018)Edge-Dominating Trails in AT-free Graphs (Extended Abstract)., и . Electron. Notes Discret. Math., (1999)Recognizing Graphs without Asteroidal Triples.. WG, том 1928 из Lecture Notes in Computer Science, стр. 255-266. Springer, (2000)Benchmarks for Strictly Fundamental Cycle Bases., , , , и . WEA, том 4525 из Lecture Notes in Computer Science, стр. 365-378. Springer, (2007)Approximating earliest arrival flows with flow-dependent transit times., и . Discret. Appl. Math., 155 (2): 161-171 (2007)Traffic Signal Optimization Using Cyclically Expanded Networks., и . ATMOS, том 14 из OASIcs, стр. 114-129. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany, (2010)Linear Time LexDFS on Chordal Graphs., , , и . ESA, том 173 из LIPIcs, стр. 13:1-13:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Line-Distortion, Bandwidth and Path-Length of a Graph., , и . SWAT, том 8503 из Lecture Notes in Computer Science, стр. 158-169. Springer, (2014)Linear Time LexDFS on Cocomparability Graphs., и . SWAT, том 8503 из Lecture Notes in Computer Science, стр. 319-330. Springer, (2014)