( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Kernelization and Sparseness: the Case of Dominating Set.

, , , , , , , , , , , и . STACS, том 47 из LIPIcs, стр. 31:1-31:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)

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.

Konrad Reidl

Gerhard Reidl

Frank Reidl

Jutta Reidlinger

Joachim Reidl

 

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

Path-contractions, edge deletions and connectivity preservation., , , и . J. Comput. Syst. Sci., (2019)Fast Biclustering by Dual Parameterization., , , и . IPEC, том 43 из LIPIcs, стр. 402-413. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2015)Structural sparsity of complex networks: Bounded expansion in random models and real-world graphs., , , , , и . J. Comput. Syst. Sci., (2019)Hyperbolicity, Degeneracy, and Expansion of Random Intersection Graphs., , , , , и . WAW, том 9479 из Lecture Notes in Computer Science, стр. 29-41. Springer, (2015)Harmless Sets in Sparse Classes., , и . IWOCA, том 13270 из Lecture Notes in Computer Science, стр. 299-312. Springer, (2022)Being Even Slightly Shallow Makes Life Hard., , , и . MFCS, том 83 из LIPIcs, стр. 79:1-79:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Asymptotic Analysis of Equivalences and Core-Structures in Kronecker-Style Graph Models., , , , , и . ICDM, стр. 829-834. IEEE Computer Society, (2016)A General Kernelization Technique for Domination and Independence Problems in Sparse Classes., и . IPEC, том 180 из LIPIcs, стр. 11:1-11:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)When You Come at the King You Best Not Miss., , и . FSTTCS, том 250 из LIPIcs, стр. 25:1-25:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Alternative parameterizations of Metric Dimension., , , и . Theor. Comput. Sci., (2020)