Truy cập công khai

Finding topological subgraphs is fixed-parameter tractable

M Grohe, K Kawarabayashi, D Marx, P Wollan

Proceedings of the forty-third annual ACM symposium on Theory of computing …, 2011

Các cơ quan ủy nhiệm: Hungarian Scientific Research Fund

A unified Erdős–Pósa theorem for constrained cycles

T Huynh, F Joos, P Wollan

Combinatorica 39 (1), 91-133, 2019

Các cơ quan ủy nhiệm: European Commission

K6 minors in large 6-connected graphs

K Kawarabayashi, S Norine, R Thomas, P Wollan

Journal of Combinatorial Theory, Series B 129, 158-203, 2018

Các cơ quan ủy nhiệm: US National Science Foundation, European Commission

A new proof of the flat wall theorem

K Kawarabayashi, R Thomas, P Wollan

Journal of Combinatorial Theory, Series B 129, 204-238, 2018

Các cơ quan ủy nhiệm: US National Science Foundation, European Commission

Immersions in highly edge connected graphs

D Marx, P Wollan

SIAM Journal on Discrete Mathematics 28 (1), 503-520, 2014

Các cơ quan ủy nhiệm: Hungarian Scientific Research Fund, European Commission

The grid theorem for vertex-minors

J Geelen, O Kwon, R McCarty, P Wollan

Journal of Combinatorial Theory, Series B 158, 93-116, 2023

Các cơ quan ủy nhiệm: US Department of Defense, Natural Sciences and Engineering Research Council …

Forcing clique immersions through chromatic number

G Gauthier, TN Le, P Wollan

European Journal of Combinatorics 81, 98-118, 2019

Các cơ quan ủy nhiệm: European Commission

K6 minors in 6-connected graphs of bounded tree-width

K Kawarabayashi, S Norine, R Thomas, P Wollan

Journal of Combinatorial Theory, Series B 136, 1-32, 2019

Các cơ quan ủy nhiệm: US National Science Foundation, European Commission

Space proof complexity for random 3-CNFs

P Bennett, I Bonacina, N Galesi, T Huynh, M Molloy, P Wollan

Information and Computation 255, 165-176, 2017

Các cơ quan ủy nhiệm: European Commission

A structure theorem for strong immersions

Z Dvořák, P Wollan

Journal of Graph Theory 83 (2), 152-163, 2016

Các cơ quan ủy nhiệm: European Commission

Excluding a ladder

T Huynh, G Joret, P Micek, MT Seweryn, P Wollan

Combinatorica 42 (3), 405-432, 2022

Các cơ quan ủy nhiệm: Australian Research Council, Narodowe Centrum Nauki

[PDF] siam.org

An exact characterization of tractable demand patterns for maximum disjoint path problems

D Marx, P Wollan

Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete …, 2014

Các cơ quan ủy nhiệm: Hungarian Scientific Research Fund, European Commission

Chi-boundedness of graph classes excluding wheel vertex-minors

H Choi, O Kwon, S Oum, P Wollan

Journal of Combinatorial Theory, Series B 135, 319-348, 2019

Các cơ quan ủy nhiệm: European Commission

Rooted grid minors

D Marx, P Seymour, P Wollan

Journal of Combinatorial Theory, Series B 122, 428-437, 2017

Các cơ quan ủy nhiệm: US National Science Foundation, US Department of Defense, European Commission

Displaying blocking pairs in signed graphs

B Guenin, I Pivotto, P Wollan

European Journal of Combinatorics 51, 135-164, 2016

Các cơ quan ủy nhiệm: Australian Research Council, Natural Sciences and Engineering Research …

[PDF] wiley.com