Author of the publication

Finding Large Independent Sets in Graphs and Hypergraphs.

, and . 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. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Throughput maximization of real-time scheduling with batching., , , , , and . SODA, page 742-751. ACM/SIAM, (2002)There is no EPTAS for two-dimensional knapsack., and . Inf. Process. Lett., 110 (16): 707-710 (2010)Finding Large Independent Sets in Graphs and Hypergraphs., and . SIAM J. Discret. Math., 18 (3): 488-500 (2004)Approximation schemes for deal splitting and covering integer programs with multiplicity constraints., , , and . Theor. Comput. Sci., 412 (52): 7087-7098 (2011)Online Selection of Intervals and t-Intervals., , and . SWAT, volume 6139 of Lecture Notes in Computer Science, page 383-394. Springer, (2010)An EPTAS for Budgeted Matroid Independent Set., , and . SOSA, page 69-83. SIAM, (2023)Maximizing Throughput in Flow Shop Real-Time Scheduling., , , , and . APPROX-RANDOM, volume 176 of LIPIcs, page 48:1-48:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)The Preemptive Resource Allocation Problem., , and . FSTTCS, volume 150 of LIPIcs, page 26:1-26:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Budgeted Matroid Maximization: a Parameterized Viewpoint., , and . IPEC, volume 285 of LIPIcs, page 13:1-13:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)An APTAS for Bin Packing with Clique-Graph Conflicts., , and . WADS, volume 12808 of Lecture Notes in Computer Science, page 286-299. Springer, (2021)