From post

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.

 

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

Linear min-max relation between the treewidth of H-minor-free graphs and its largest grid., и . STACS, том 14 из LIPIcs, стр. 278-289. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2012)A Strongly Polynomial Time Algorithm for the Maximum Supply Rate Problem on Trees., и . FAW, том 10823 из Lecture Notes in Computer Science, стр. 54-67. Springer, (2018)An Improved Fixed-Parameter Algorithm for Max-Cut Parameterized by Crossing Number., , , и . IWOCA, том 11638 из Lecture Notes in Computer Science, стр. 327-338. Springer, (2019)Shortest Reconfiguration of Colorings Under Kempe Changes., , , , , , , и . STACS, том 154 из LIPIcs, стр. 35:1-35:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Breaking o(n1/2)-approximation algorithms for the edge-disjoint paths problem with congestion two., и . STOC, стр. 81-88. ACM, (2011)Fence patrolling by mobile agents with distinct speeds., и . CoRR, (2014)Detection of osteochondritis dissecans using convolutional neural networks for computer-aided diagnosis of baseball elbow., , , , , , , , , и . ISMVL, стр. 59-63. IEEE, (2023)Reconfiguration of Spanning Trees with Degree Constraint or Diameter Constraint., , , , , , и . STACS, том 219 из LIPIcs, стр. 15:1-15:21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)On Reachable Assignments Under Dichotomous Preferences., , , , , , и . PRIMA, том 13753 из Lecture Notes in Computer Science, стр. 650-658. Springer, (2022)Hardness of Finding Combinatorial Shortest Paths on Graph Associahedra., , , , , , и . ICALP, том 261 из LIPIcs, стр. 82:1-82:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)