Author of the publication

On Computing Optimal Tree Ensembles.

, , , and . ICML, volume 202 of Proceedings of Machine Learning Research, page 17364-17374. PMLR, (2023)

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

Approximation Algorithms for BalancedCC Multiwinner Rules., , , and . AAMAS, page 494-502. International Foundation for Autonomous Agents and Multiagent Systems, (2019)Parameterized Algorithms for Module Map Problems., and . ISCO, volume 10856 of Lecture Notes in Computer Science, page 376-388. Springer, (2018)Enumerating connected induced subgraphs: Improved delay and experimental comparison., and . Discret. Appl. Math., (2021)On Critical Node Problems with Vulnerable Vertices., , , and . IWOCA, volume 13270 of Lecture Notes in Computer Science, page 494-508. Springer, (2022)On Computing Optimal Tree Ensembles., , , and . ICML, volume 202 of Proceedings of Machine Learning Research, page 17364-17374. PMLR, (2023)Colored cut games., , , and . Theor. Comput. Sci., (2022)Exact Algorithms for Group Closeness Centrality., , , and . ACDA, page 1-12. SIAM, (2023)Efficient branch-and-bound algorithms for finding triangle-constrained 2-clubs., , , and . J. Comb. Optim., 48 (3): 16 (October 2024)The Parameterized Complexity of s-Club with Triangle and Seed Constraints., , and . IWOCA, volume 13270 of Lecture Notes in Computer Science, page 313-326. Springer, (2022)Computing Dense and Sparse Subgraphs of Weakly Closed Graphs., , and . ISAAC, volume 181 of LIPIcs, page 20:1-20:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)