Browse "Dept. of Mathematical Sciences(수리과학과)" by Author Joos, Felix

Showing results 1 to 8 of 8

1
A characterization of testable hypergraph properties

Joos, Felix; Kim, Jaehoon; Kuhn, Daniela; Osthus, Deryk, 58th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2017, pp.859 - 867, IEEE Computer Society Technical Committee on the Mathematical Foundations of Computing (TCMF), 2017-10-16

2
Conflict-free hypergraph matchings

Glock, Stefan; Joos, Felix; Kim, Jaehoon; Kühn, Marcus; Lichev, Lyuben, ACM-SIAM Symposium on Discrete Algorithms (SODA23), pp.2991 - 3005, Society for Industrial and Applied Mathematics, 2023-01-24

3
Conflict-free hypergraph matchings

Glock, Stefan; Joos, Felix; Kim, Jaehoon; Kühn, Marcus; Lichev, Lyuben, Journal of the London Mathematical Society, v.109, no.5, 2024-05

4
Hypergraph regularity and random sampling

Joos, Felix; Kim, Jaehoon; Kuhn, Daniela; Osthus, Deryk, RANDOM STRUCTURES & ALGORITHMS, v.62, no.4, pp.956 - 1015, 2023-07

5
On a rainbow version of Dirac's theorem

Joos, Felix; Kim, Jaehoon, BULLETIN OF THE LONDON MATHEMATICAL SOCIETY, v.52, no.3, pp.498 - 504, 2020-06

6
Optimal packings of bounded degree trees

Joos, Felix; Kim, Jaehoon; Kuhn, Daniela; Osthus, Deryk, JOURNAL OF THE EUROPEAN MATHEMATICAL SOCIETY, v.21, no.12, pp.3573 - 3647, 2019-10

7
Resolution of the Oberwolfach problem

Glock, Stefan; Joos, Felix; Kim, Jaehoon; Kuhn, Daniela; Osthus, Deryk, JOURNAL OF THE EUROPEAN MATHEMATICAL SOCIETY, v.23, no.8, pp.2511 - 2547, 2021-08

8
Spanning trees in randomly perturbed graphs

Joos, Felix; Kim, Jaehoon, RANDOM STRUCTURES & ALGORITHMS, v.56, no.1, pp.169 - 219, 2020-01

rss_1.0 rss_2.0 atom_1.0