| Publication | Date of Publication | Type |
|---|
| Euclidean bottleneck Steiner tree is fixed-parameter tractable | 2024-11-28 | Paper |
| Minimum-membership geometric set cover, revisited | 2024-10-16 | Paper |
| FPT constant-approximations for capacitated clustering to minimize the sum of cluster radii | 2024-10-16 | Paper |
| Subexponential parameterized algorithms for cut and cycle hitting problems on \(H\)-minor-free graphs | 2024-07-19 | Paper |
| True contraction decomposition and almost ETH-tight bipartization for unit-disk graphs | 2024-05-14 | Paper |
| Detours in directed graphs | 2024-04-23 | Paper |
Edge separators for graphs excluding a minor
The Electronic Journal of Combinatorics | 2024-02-16 | Paper |
| Parameterized Complexity of Directed Spanner Problems. | 2023-11-13 | Paper |
scientific article; zbMATH DE number 7764101 (Why is no real title available?)
(available as arXiv preprint) | 2023-11-13 | Paper |
How to find a good explanation for clustering?
Artificial Intelligence | 2023-08-28 | Paper |
Detours in directed graphs
Journal of Computer and System Sciences | 2023-07-10 | Paper |
Powers of paths in tournaments
Combinatorics, Probability and Computing | 2023-03-30 | Paper |
A Polynomial Kernel for Line Graph Deletion
(available as arXiv preprint) | 2023-02-07 | Paper |
| Exact and Approximate Digraph Bandwidth | 2023-02-03 | Paper |
| scientific article; zbMATH DE number 7650395 (Why is no real title available?) | 2023-02-03 | Paper |
Parameterized complexity of directed spanner problems
Algorithmica | 2022-08-03 | Paper |
Packing and covering balls in graphs excluding a minor
Combinatorica | 2021-08-03 | Paper |
Progress on the adjacent vertex distinguishing edge coloring conjecture
SIAM Journal on Discrete Mathematics | 2020-12-04 | Paper |
The directed 2-linkage problem with length constraints
Theoretical Computer Science | 2020-03-12 | Paper |
The directed 2-linkage problem with length constraints
Theoretical Computer Science | 2020-03-12 | Paper |
Subdivisions in digraphs of large out-degree or large dichromatic number
The Electronic Journal of Combinatorics | 2019-08-05 | Paper |
Subdivisions in digraphs of large out-degree or large dichromatic number
The Electronic Journal of Combinatorics | 2019-08-05 | Paper |
A proof of the Erdös-Sands-Sauer-Woodrow conjecture
Journal of Combinatorial Theory. Series B | 2019-07-17 | Paper |
Subdivisions of oriented cycles in digraphs with large chromatic number
Journal of Graph Theory | 2019-01-03 | Paper |
Immersion of transitive tournaments in digraphs with large minimum outdegree
Journal of Combinatorial Theory. Series B | 2018-12-20 | Paper |
Bispindles in strongly connected digraphs with large chromatic number
The Electronic Journal of Combinatorics | 2018-06-14 | Paper |
Bispindle in strongly connected digraphs with large chromatic number
(available as arXiv preprint) | 2018-04-09 | Paper |
| Bispindle in strongly connected digraphs with large chromatic number | 2018-04-09 | Paper |
The structure of typical eye-free graphs and a Turán-type result for two weighted colours
Combinatorics, Probability and Computing | 2017-10-27 | Paper |
Equitable orientations of sparse uniform hypergraphs
The Electronic Journal of Combinatorics | 2016-12-06 | Paper |
Equitable orientations of sparse uniform hypergraphs
The Electronic Journal of Combinatorics | 2016-12-06 | Paper |
