- Minimum degree conditions for large subgraphs2009 | Faculty of Mathematics and Physics
- Isomorphic edge disjoint subgraphs of hypergraphs2016 | Faculty of Mathematics and Physics
- Upper bounds on the size of 4-and 6-cycle-free subgraphs of the hypercube2014 | Faculty of Mathematics and Physics
- Defective Colouring of Graphs Excluding A Subgraph or Minor2019 | Faculty of Mathematics and Physics
- On a Conjecture of Thomassen Concerning Subgraphs of Large Girth2011 | Faculty of Mathematics and Physics
- Matroids induced by packing subgraphs +12005 | Faculty of Mathematics and Physics
- Subgraphs of Hypercubes - Embeddings with Restrictions or Prescriptions +12006 | Publication without faculty affiliation
- On Betti numbers of flag complexes with forbidden induced subgraphs2020 | Faculty of Mathematics and Physics
- Hamiltonian Laceability of Hypercubes Without Isometric Subgraphs2016 | Faculty of Mathematics and Physics
- Tree-depth, subgraph coloring and homomorphism bounds2006 | Faculty of Mathematics and Physics
- Planar graph coloring avoiding monochromatic subgraphs: Trees and paths make it difficult2006 | Faculty of Mathematics and Physics
- Towards the distribution of the size of a largest planar matching and largest planar subgraph in random bipartite graphs (article no. R135)2008 | Faculty of Mathematics and Physics
- The hamiltonian chromatic number of a connected graph without large hamiltonian-connected subgraphs2006 | Faculty of Arts
- TIGHT BOUNDS FOR PLANAR STRONGLY CONNECTED STEINER SUBGRAPH WITH FIXED NUMBER OF TERMINALS (AND EXTENSIONS)2020 | Faculty of Mathematics and Physics
- Partitioning Graphs into Induced Subgraphs2017 | Faculty of Mathematics and Physics
- Induced 2-degenerate Subgraphs of Triangle-free Planar Graphs2018 | Faculty of Mathematics and Physics
- A Dynamic Data Structure for Counting Subgraphs in Sparse Graphs2013 | Faculty of Mathematics and Physics
- On the density of subgraphs in a graph with boundedindependence number1998 | Faculty of Mathematics and Physics
- Subexponential-Time Algorithms for Finding Large Induced Sparse Subgraphs +12019 | Faculty of Mathematics and Physics
- On the density of subgraphs in a graph with bounded independence numberPublication without faculty affiliation
- Complexity of Coloring Graphs without Forbidden Induced Subgraphs2001 | Faculty of Mathematics and Physics
- Comparison of Approaches for Querying Chemical Compounds2019 | Faculty of Mathematics and Physics
- Planar graph coloring with forbidden subgraphs: Why trees and paths are dangerous2002 | Publication without faculty affiliation
- On the clique-width of (4K(1), C-4, C-5, C-7)-free graphs2020 | Faculty of Mathematics and Physics
- Characterizing Subclasses of Cover-Incomparability Graphs by Forbidden Subposets2019 | Faculty of Mathematics and Physics
- Parameterized Approximation Algorithms for Bidirected Steiner Network Problems2021 | Faculty of Mathematics and Physics
- Multi-Agent Pathfinding on Large Maps Using Graph Pruning: This Way or That Way?2023 | Faculty of Mathematics and Physics