Author of the publication

Maximum matching width: New characterizations and a fast algorithm for dominating set.

, , and . Discret. Appl. Math., (2018)

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

Maximum Matching Width: New Characterizations and a Fast Algorithm for Dominating Set., , and . IPEC, volume 43 of LIPIcs, page 212-223. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2015)Constructive algorithm for path-width of matroids., , and . CoRR, (2015)Deciding whether there are infinitely many prime graphs with forbidden induced subgraphs., , , and . CoRR, (2016)Constructive algorithm for path-width of matroids., , and . SODA, page 1695-1704. SIAM, (2016)Relation-Aware Language-Graph Transformer for Question Answering., , , , , , , and . AAAI, page 13457-13464. AAAI Press, (2023)Intent-based Product Collections for E-commerce using Pretrained Language Models., , , , , , , , , and . ICDM (Workshops), page 228-237. IEEE, (2021)Metropolis-Hastings Data Augmentation for Graph Neural Networks., , , , , , , and . NeurIPS, page 19010-19020. (2021)Pivotal Role of Language Modeling in Recommender Systems: Enriching Task-specific and Task-agnostic Representation Learning., , , , , , , and . ACL (1), page 1146-1161. Association for Computational Linguistics, (2023)Computing Small Pivot-Minors., , , , , , and . WG, volume 11159 of Lecture Notes in Computer Science, page 125-138. Springer, (2018)Tree pivot-minors and linear rank-width., , , , , , and . CoRR, (2020)