( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Partitioning Graphs into Two Trees.

, , и . Acta Cybern., 11 (3): 233-240 (1994)

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.

Ulrich Pötter

Statistical models of incomplete data and their use in the social sciences. Uni Bochum, habilitation, (2009)

Ulrich Mayer

Analysis of the molecular mechanisms underlying the activity of the Ets-1-USF-1 transcription factor complex on the HIV-1 LTR. Uni Heidelberg, (2004)

Ulrich Niedermeier

Magnetic field effect in organic light emitting diodes. TU Darmstadt, (2009)

Ulrich Essen

Ulrich Lommer

 

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

Committee Selection with a Weight Constraint Based on Lexicographic Rankings of Individuals., , и . ADT, том 5783 из Lecture Notes in Computer Science, стр. 50-61. Springer, (2009)Approximating the 3-period Incremental Knapsack Problem., , и . J. Discrete Algorithms, (2018)Resource allocation with time intervals., , и . Theor. Comput. Sci., 411 (49): 4217-4234 (2010)Greedy Algorithms for On-Line Data Compression., , , и . J. Algorithms, 25 (2): 274-289 (1997)On a Stackelberg Subset Sum Game., , и . CoRR, (2018)Decision-Support System for the Optimal Technology Split of a Decarbonized Bus Network., и . COMPSAC, стр. 1279-1284. IEEE, (2021)A Dynamic Algorithm Configuration Framework Using Combinatorial Problem Features and Reinforcement Learning., и . MIC (2), том 14754 из Lecture Notes in Computer Science, стр. 142-157. Springer, (2024)Approximating the Incremental Knapsack Problem., , и . CoRR, (2018)The Knapsack Problem with Conflict Graphs., и . J. Graph Algorithms Appl., 13 (2): 233-249 (2009)An Efficient Approximation Scheme for the Subset-Sum Problem., , и . ISAAC, том 1350 из Lecture Notes in Computer Science, стр. 394-403. Springer, (1997)