( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Group Activity Selection Problem.

, , , , , и . WINE, том 7695 из Lecture Notes in Computer Science, стр. 156-169. Springer, (2012)

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.

Gerhard J Gröbner

Gerhard J Fraune

Heinrich J J Mieschendahl

Norbert J J Bock

J J M Ramakers

 

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

A Note on Fair Division under Interval Uncertainty.. International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems, 14 (6): 753-756 (2006)Multigraph realizations of degree sequences: Maximization is easy, minimization is hard., , и . Oper. Res. Lett., 36 (5): 594-596 (2008)An Algorithmic Analysis of the Honey-Bee Game., и . FUN, том 6099 из Lecture Notes in Computer Science, стр. 178-189. Springer, (2010)Dynamic and Kinetic Conflict-Free Coloring of Intervals with Respect to Points., , , , , и . CoRR, (2017)A Lower Bound for Randomized On-Line Scheduling Algorithms., , и . Inf. Process. Lett., 51 (5): 219-222 (1994)The multi-stripe travelling salesman problem., , и . CoRR, (2016)When Does a Dynamic Programming Formulation Guarantee the Existence of an FPTAS?. SODA, стр. 820-829. ACM/SIAM, (1999)Minimum Cost Dynamic Flows: The Series-Parallel Case., и . IPCO, том 920 из Lecture Notes in Computer Science, стр. 329-343. Springer, (1995)The Travelling Salesman and the PQ-Tree., , и . IPCO, том 1084 из Lecture Notes in Computer Science, стр. 490-504. Springer, (1996)An FPTAS for Agreeably Weighted Variance on a Single Machine.. ICALP, том 1644 из Lecture Notes in Computer Science, стр. 707-716. Springer, (1999)