( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
A Timecop's Work Is Harder Than You Think.

, , и . MFCS, том 170 из LIPIcs, стр. 71:1-71:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (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.

Michael Rehs

Jakob Rehs

Bernd Rehs

Hans Rehs

Kurt Rehs

 

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

Exact Solutions for the Steiner Path Cover Problem on Special Graph Classes., , , , , и . OR, стр. 331-338. Springer, (2019)The Knapsack Problem with Conflict Graphs and Forcing Graphs of Bounded Clique-Width., и . OR, стр. 259-265. Springer, (2018)Oriented coloring on recursively defined digraphs., , и . CoRR, (2019)Subset Sum Problems with Special Digraph Constraints., , и . OR, стр. 339-346. Springer, (2019)Computing Digraph Width Measures on Directed Co-graphs - (Extended Abstract)., , и . FCT, том 11651 из Lecture Notes in Computer Science, стр. 292-305. Springer, (2019)Forbidden Directed Minors, Directed Path-Width and Directed Tree-Width of Tree-Like Digraphs., и . SOFSEM, том 11376 из Lecture Notes in Computer Science, стр. 234-246. Springer, (2019)Solutions for the knapsack problem with conflict and forcing graphs of bounded clique-width., и . Math. Methods Oper. Res., 89 (3): 411-432 (2019)Comparing Linear Width Parameters for Directed Graphs., и . Theory Comput. Syst., 63 (6): 1358-1387 (2019)Characterizations for Special Directed Co-graphs., , и . COCOA, том 11949 из Lecture Notes in Computer Science, стр. 252-264. Springer, (2019)Computing Directed Steiner Path Covers for Directed Co-graphs (Extended Abstract)., , , , , и . SOFSEM, том 12011 из Lecture Notes in Computer Science, стр. 556-565. Springer, (2020)