Philipp Kuinke | AC Group | TU Wienhttps://ac.tuwien.ac.at/team/philipp-kuinke/Philipp KuinkeHugo Blox Builder (https://hugoblox.com)en-usWed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/media/logo_hu10234977157890132473.pngPhilipp Kuinkehttps://ac.tuwien.ac.at/team/philipp-kuinke/Complexity of independency and cliquy treeshttps://ac.tuwien.ac.at/publication/complexity-of-independency-and-cliquy-trees/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/complexity-of-independency-and-cliquy-trees/First-Order Model-Checking in Random Graphs and Complex Networkshttps://ac.tuwien.ac.at/publication/first-order-model-checking-in-random-graphs-and-complex-networks/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/first-order-model-checking-in-random-graphs-and-complex-networks/Maximum Shallow Clique Minors in Preferential Attachment Graphs have Polylogarithmic Sizehttps://ac.tuwien.ac.at/publication/maximum-shallow-clique-minors-in-preferential-attachment-graphs-have-polylogarithmic-size/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/maximum-shallow-clique-minors-in-preferential-attachment-graphs-have-polylogarithmic-size/The Complexity of Packing Edge-Disjoint Pathshttps://ac.tuwien.ac.at/publication/the-complexity-of-packing-edge-disjoint-paths/Tue, 01 Jan 2019 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-complexity-of-packing-edge-disjoint-paths/Local Structure Theorems for Erdos-Rényi Graphs and Their Algorithmic Applicationshttps://ac.tuwien.ac.at/publication/local-structure-theorems-for-erdos-renyi-graphs-and-their-algorithmic-applications/Mon, 01 Jan 2018 00:00:00 +0000https://ac.tuwien.ac.at/publication/local-structure-theorems-for-erdos-renyi-graphs-and-their-algorithmic-applications/