( en | de | ru )

 

Disambiguation of "Reidl, Felix"

Author of the publication

copydeleteadd this publication to your clipboard
Hyperbolicity, Degeneracy, and Expansion of Random Intersection Graphs.

, , , , , and . WAW, volume 9479 of Lecture Notes in Computer Science, page 29-41. Springer, (2015)

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. You can also use the button next to the name to display some publications already assigned to the person.

Konrad Reidl

Gerhard Reidl

Frank Reidl

Jutta Reidlinger

Joachim Reidl

 

Other publications of authors with the same name

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