( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Finding Large Independent Sets in Graphs and Hypergraphs.

, и . SIAM J. Discret. Math., 18 (3): 488-500 (2004)

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.

Edith Hadaschik

Marie-Luisa Hadaschik

Boris Alexander Hadaschik

Kerstin Hadasch

Robert Peter Hadasch

 

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

Throughput maximization of real-time scheduling with batching., , , , , и . ACM Trans. Algorithms, 5 (2): 18:1-18:17 (2009)Fast Asymptotic FPTAS for Packing Fragmentable Items with Costs., и . FCT, том 4639 из Lecture Notes in Computer Science, стр. 482-493. Springer, (2007)The Euclidean k-Supplier Problem., , и . IPCO, том 7801 из Lecture Notes in Computer Science, стр. 290-301. Springer, (2013)Improved Approximations for Vector Bin Packing via Iterative Randomized Rounding., , и . FOCS, стр. 1366-1376. IEEE, (2023)Spatial Voting with Incomplete Voter Information., , , , и . AAAI, стр. 9790-9797. AAAI Press, (2024)Fast Distributed Approximation for Max-Cut., , и . ALGOSENSORS, том 10718 из Lecture Notes in Computer Science, стр. 41-56. Springer, (2017)Real-Time k-bounded Preemptive Scheduling., , , и . ALENEX, стр. 127-137. SIAM, (2016)Fast Information Spreading in Graphs with Large Weak Conductance., и . SIAM J. Comput., 41 (6): 1451-1465 (2012)On Lagrangian Relaxation and Subset Selection Problems., и . WAOA, том 5426 из Lecture Notes in Computer Science, стр. 160-173. Springer, (2008)Minimizing total busy time in parallel scheduling with application to optical networks., , , , , , и . IPDPS, стр. 1-12. IEEE, (2009)