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.

 

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

Computing Weak Consistency in Polynomial Time: Extended Abstract., , , и . PODC, стр. 395-404. ACM, (2015)Incremental Optimization of Independent Sets Under the Reconfiguration Framework., , , и . COCOON, том 11653 из Lecture Notes in Computer Science, стр. 313-324. Springer, (2019)Finding Smallest Supertrees Under Minor Containment., , и . WG, том 1665 из Lecture Notes in Computer Science, стр. 303-312. Springer, (1999)Subgraph Isomorphism, log-Bounded Fragmentation and Graphs of (Locally) Bounded Treewidth., и . MFCS, том 2420 из Lecture Notes in Computer Science, стр. 305-318. Springer, (2002)On Directed Covering and Domination Problems., , и . ISAAC, том 92 из LIPIcs, стр. 45:1-45:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Reconfiguration of Graph Minors., , и . MFCS, том 117 из LIPIcs, стр. 75:1-75:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Graph Editing to a Given Neighbourhood Degree List is Fixed-Parameter Tractable., и . COCOA (2), том 10628 из Lecture Notes in Computer Science, стр. 138-153. Springer, (2017)The Parallel Complexity of Tree Embedding Problems (Extended Abstract)., и . STACS, том 577 из Lecture Notes in Computer Science, стр. 21-32. Springer, (1992)Embeddings of k-Connected Graphs of Pathwidth k., , , и . SWAT, том 1851 из Lecture Notes in Computer Science, стр. 111-124. Springer, (2000)Faster Fixed-Parameter Tractable Algorithms for Matching and Packing Problems., , , , , , , и . ESA, том 3221 из Lecture Notes in Computer Science, стр. 311-322. Springer, (2004)