Author of the publication

Neural Maximum Independent Set.

, , , and . PKDD/ECML Workshops (1), volume 1524 of Communications in Computer and Information Science, page 223-237. Springer, (2021)

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

EPTAS and Subexponential Algorithm for Maximum Clique on Disk and Unit Ball Graphs., , , , , , , , and . CoRR, (2021)Extension of some edge graph problems: Standard, parameterized and approximation complexity., , , , and . Discret. Appl. Math., (December 2023)Token Sliding on Split Graphs., , , , , and . Theory Comput. Syst., 65 (4): 662-686 (2021)On the Complexity of Broadcast Domination and Multipacking in Digraphs., , , and . IWOCA, volume 12126 of Lecture Notes in Computer Science, page 264-276. Springer, (2020)Parity Permutation Pattern Matching., , and . WALCOM, volume 13973 of Lecture Notes in Computer Science, page 384-395. Springer, (2023)Graph Homomorphism Features: Why Not Sample?, , and . PKDD/ECML Workshops (1), volume 1524 of Communications in Computer and Information Science, page 216-222. Springer, (2021)Neural Maximum Independent Set., , , and . PKDD/ECML Workshops (1), volume 1524 of Communications in Computer and Information Science, page 223-237. Springer, (2021)The PACE 2018 Parameterized Algorithms and Computational Experiments Challenge: The Third Iteration., and . IPEC, volume 115 of LIPIcs, page 26:1-26:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Token Sliding on Split Graphs., , , , , and . STACS, volume 126 of LIPIcs, page 13:1-13:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Parameterized Orientable Deletion., , , , and . Algorithmica, 82 (7): 1909-1938 (2020)