1
0
0
(1 - 19 von 21
)
Maximum Shallow Clique Minors in Preferential Attachment Graphs ...
books.google.de
Title, Maximum Shallow Clique Minors in Preferential Attachment Graphs Have Polylogarithmic Size. Authors, Jan Dreier, Philipp Kuinke, Peter Rossmanith. › about
Computer Science authors/titles Dec 2014
arxiv.org
Authors: Jan Dreier, Philipp Kuinke, Rafael Przybylski, Felix Reidl, Peter Rossmanith, Somnath Sikdar. Subjects: Social and Information Networks (cs.
Sofsem 2018: Theory And Practice Of Computer Science: 44th ...
vdoc.pub
— ... Structure Theorems for Erdős–Rényi Graphs and Their Algorithmic Applications (Jan Dreier, Philipp Kuinke, Ba Le Xuan, Peter Rossmanith). › documents
First-Order Model-Checking in Random Graphs and Complex ...
arxiv.org
von J Dreier · · Zitiert von: 2 — Authors:Jan Dreier, Philipp Kuinke, Peter Rossmanith · Download PDF. Abstract: Complex networks are everywhere. They appear for example in ... › cs
[ ] The Complexity of Packing Edge-Disjoint Paths
arxiv.org
Authors:Jan Dreier, Janosch Fuchs, Tim A. Hartmann, Philipp Kuinke, Peter Rossmanith, Bjoern Tauer, Hung-Lung Wang. (Submitted on 1 Oct ...
Peter Rossmanith - dblp
dblp.uni-trier.de
— Jan Dreier, Philipp Kuinke, Ba Le Xuan, Peter Rossmanith: Local Structure Theorems for Erdős-Rényi Graphs and Their Algorithmic Applications ... › pid › Pet...
Philipp Kuinke - dblpdblp.org › Persons
dblp.org
· Jan Dreier , Philipp Kuinke , Peter Rossmanith : Maximum Shallow Clique Minors in Preferential Attachment Graphs Have Polylogarithmic Size.
SOFSEM 2018: Theory and Practice of Computer Science ...link.springer.com › book
link.springer.com
Jan Dreier, Philipp Kuinke, Ba Le Xuan, Peter Rossmanith. Pages PDF · Target Set Selection Parameterized by Clique-Width and Maximum Threshold.
Hung-Lung Wang's Webpage - Research
sites.google.com
Tim A. Hartmann, Jan Dreier, Janosch Fuchs, Philipp Kuinke, Peter Rossmanith, Hung-Lung Wang, Bjoern Tauer: The Complexity of Packing Edge-Disjoint Paths. › hlwang
Accepted Papers - SOFSEM := - OCGsofsem2018.ocg.at › papers
sofsem2018.ocg.at
Jan Dreier, Philipp Kuinke, Ba Le Xuan and Peter Rossmanith Local Structure Theorems for Erdös–Rényi Graphs and their Algorithmic Applications. Tu Ngo ...
FPT papers online - Parameterized Complexity
fpt.wikidot.com
... Janosch Fuchs, Tim A. Hartmann, Philipp Kuinke, Peter Rossmanith, Bjoern Tauer, Hung-Lung Wang. The Complexity of Packing Edge-Disjoint Paths ... Jan Dreier, Philipp Kuinke, Peter Rossmanith. First-Order Model-Checking in Random Graphs and Complex Networks. Lin Chen, Martin Koutecký, Lei Xu, ... › fpt-papers-...
IPEC Accepted Papers
algo2019.ak.in.tum.de
Tim A. Hartmann, Jan Dreier, Janosch Fuchs, Philipp Kuinke, Peter Rossmanith, Hung-Lung Wang and Bjoern Tauer, The Complexity of Packing Edge-Disjoint Paths. › ipe...
DROPS - Maximum Shallow Clique Minors in Preferential Attachment...
drops.dagstuhl.de
@InProceedings{dreier_et_al:LIPIcs:2020:12617, author = {Jan Dreier and Philipp Kuinke and Peter Rossmanith}, title = {{Maximum Shallow ...
Random 2020: Accepted Papers
randomconference.com
A Fast Binary Splitting Approach to Non-Adaptive Group Testing; Jan Dreier, Philipp Kuinke and Peter Rossmanith. Maximum Shallow Clique Minors in ... › ra...
[PDF] Local Structure Theorems for Erdős-Rényi Graphs and Their...
www.semanticscholar.org
Jan Dreier, Philipp Kuinke, +1 author Peter Rossmanith. We analyze some local properties of sparse Erdos-Renyi graphs, where $d(n)/n$ is the edge probability ...
First-Order Model-Checking in Random Graphs and DROPSdrops.dagstuhl.de › opus › volltexte
drops.dagstuhl.de
· @InProceedings{dreier_et_al:LIPIcs:2020:12906, author = {Jan Dreier and Philipp Kuinke and Peter Rossmanith}, title = {{First-Order ...
Alle Infos zum Namen "Philipp Kuinke"
Verwandte Suchanfragen zu Philipp Kuinke
| Bjoern Tauer Moritz Gobbert Janosch Fuchs |
Personen Vorname "Philipp" (30217) Name "Kuinke" (21) |
sortiert nach Relevanz / Datum