From post

07281 Abstracts Collection -- Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs.

, , , и . Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs, том 07281 из Dagstuhl Seminar Proceedings, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany, (2007)

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.

 

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

A Provably, Linear Time, In-place and Stable Merge Algorithm via the Perfect Shuffle., и . CoRR, (2015)Faster Fixed-Parameter Tractable Algorithms for Matching and Packing Problems., , , , , , , и . Algorithmica, 52 (2): 167-176 (2008)An O(pn + 1.151p)-Algorithm for p-Profit Cover and Its Practical Implications for Vertex Cover., , , и . ISAAC, том 2518 из Lecture Notes in Computer Science, стр. 249-261. Springer, (2002)The Role of the Goal in Solving Hard Computational Problems: Do People Really Optimize?, , и . J. Probl. Solving, (2018)Characterizing problems for realizing policies in self-adaptive and self-managing systems., , , , и . SEAMS, стр. 70-79. ACM, (2011)QWalkVis: Quantum Walks Visualization Application., , , , и . QCE, стр. 87-93. IEEE, (2023)SARS-CoV-2 Ribosomal Frameshifting Pseudoknot: Detection of Inter-viral Structural Similarity., , , и . ICHI, стр. 451-460. IEEE, (2021)Base64Geo: an efficient data structure and transmission format for large, dense, scalar GIS datasets., , , и . CASCON, стр. 106-115. IBM / ACM, (2016)Parameterized pursuit-evasion games., и . Theor. Comput. Sci., 411 (43): 3845-3858 (2010)Human Performance on Hard Non-Euclidean Graph Problems: Vertex Cover., , и . J. Probl. Solving, (2012)