Peter Rossmanith | AC Group | TU Wienhttps://ac.tuwien.ac.at/team/peter-rossmanith/Peter RossmanithHugo Blox Builder (https://hugoblox.com)en-usSun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/media/logo_hu10234977157890132473.pngPeter Rossmanithhttps://ac.tuwien.ac.at/team/peter-rossmanith/Evaluating Restricted First-Order Counting Properties on Nowhere Dense Classes and Beyondhttps://ac.tuwien.ac.at/publication/evaluating-restricted-first-order-counting-properties-on-nowhere-dense-classes-and-beyond/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/evaluating-restricted-first-order-counting-properties-on-nowhere-dense-classes-and-beyond/Approximate Evaluation of First-Order Counting Querieshttps://ac.tuwien.ac.at/publication/approximate-evaluation-of-first-order-counting-queries/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/approximate-evaluation-of-first-order-counting-queries/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/Hard Problems on Random Graphshttps://ac.tuwien.ac.at/publication/hard-problems-on-random-graphs/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/hard-problems-on-random-graphs/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/Hardness of FO Model-Checking on Random Graphshttps://ac.tuwien.ac.at/publication/hardness-of-fo-model-checking-on-random-graphs/Tue, 01 Jan 2019 00:00:00 +0000https://ac.tuwien.ac.at/publication/hardness-of-fo-model-checking-on-random-graphs/Motif Counting in Preferential Attachment Graphshttps://ac.tuwien.ac.at/publication/motif-counting-in-preferential-attachment-graphs/Tue, 01 Jan 2019 00:00:00 +0000https://ac.tuwien.ac.at/publication/motif-counting-in-preferential-attachment-graphs/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/Kernelization using structural parameters on sparse graph classeshttps://ac.tuwien.ac.at/publication/kernelization-using-structural-parameters-on-sparse-graph-classes-2/Sun, 01 Jan 2017 00:00:00 +0000https://ac.tuwien.ac.at/publication/kernelization-using-structural-parameters-on-sparse-graph-classes-2/Are There Any Good Digraph Measures?https://ac.tuwien.ac.at/publication/are-there-any-good-digraph-measures/Fri, 01 Jan 2016 00:00:00 +0000https://ac.tuwien.ac.at/publication/are-there-any-good-digraph-measures/Digraph width measures in parameterized algorithmicshttps://ac.tuwien.ac.at/publication/digraph-width-measures-in-parameterized-algorithmics/Wed, 01 Jan 2014 00:00:00 +0000https://ac.tuwien.ac.at/publication/digraph-width-measures-in-parameterized-algorithmics/Finite Integer Index of Pathwidth and Treewidthhttps://ac.tuwien.ac.at/publication/finite-integer-index-of-pathwidth-and-treewidth/Wed, 01 Jan 2014 00:00:00 +0000https://ac.tuwien.ac.at/publication/finite-integer-index-of-pathwidth-and-treewidth/Lower bounds on the complexity of MSO1 model-checkinghttps://ac.tuwien.ac.at/publication/lower-bounds-on-the-complexity-of-mso1-model-checking-2/Wed, 01 Jan 2014 00:00:00 +0000https://ac.tuwien.ac.at/publication/lower-bounds-on-the-complexity-of-mso1-model-checking-2/Kernelization Using Structural Parameters on Sparse Graph Classeshttps://ac.tuwien.ac.at/publication/kernelization-using-structural-parameters-on-sparse-graph-classes/Tue, 01 Jan 2013 00:00:00 +0000https://ac.tuwien.ac.at/publication/kernelization-using-structural-parameters-on-sparse-graph-classes/Lower Bounds on the Complexity of MSO1 Model-Checkinghttps://ac.tuwien.ac.at/publication/lower-bounds-on-the-complexity-of-mso1-model-checking/Sun, 01 Jan 2012 00:00:00 +0000https://ac.tuwien.ac.at/publication/lower-bounds-on-the-complexity-of-mso1-model-checking/Are There Any Good Digraph Width Measures?https://ac.tuwien.ac.at/publication/are-there-any-good-digraph-width-measures/Fri, 01 Jan 2010 00:00:00 +0000https://ac.tuwien.ac.at/publication/are-there-any-good-digraph-width-measures/On Digraph Width Measures in Parameterized Algorithmicshttps://ac.tuwien.ac.at/publication/on-digraph-width-measures-in-parameterized-algorithmics/Thu, 01 Jan 2009 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-digraph-width-measures-in-parameterized-algorithmics/