( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Dichotomies for Tree Minor Containment with Structural Parameters.

, , , , и . CoRR, (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.

Kazuhiro Koshiyama

 

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

Efficient Enumeration of Induced Matchings in a Graph without Cycles with Length Four., , , и . CoRR, (2017)Finding the Anticover of a String., , , , , , и . CPM, том 161 из LIPIcs, стр. 2:1-2:11. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Enumerating Empty and Surrounding Polygons., , , , , и . IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 106 (9): 1082-1091 (сентября 2023)An Improved Deterministic Parameterized Algorithm for Cactus Vertex Deletion., , , , , , , и . Theory Comput. Syst., 66 (2): 502-515 (2022)An Efficient Algorithm for Enumerating Chordal Bipartite Induced Subgraphs in Sparse Graphs., , , и . CoRR, (2019)Efficient enumeration of dominating sets for sparse graphs., , , и . Discret. Appl. Math., (2021)Efficient Constant-Factor Approximate Enumeration of Minimal Subsets for Monotone Properties with Cardinality Constraints., , и . CoRR, (2020)Finding Diverse Trees, Paths, and More., , , и . AAAI, стр. 3778-3786. AAAI Press, (2021)Linear-Delay Enumeration for Minimal Steiner Problems., , и . PODS, стр. 301-313. ACM, (2022)Optimal LZ-End Parsing Is Hard., , , , , и . CPM, том 259 из LIPIcs, стр. 3:1-3:11. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)