According to our database
1,
Felix Joos
authored at least 51 papers
between 2012 and 2025.
Collaborative distances:
2025
Sufficient conditions for perfect mixed tilings.
J. Comb. Theory B, 2025
The Hypergraph Removal Process.
Proceedings of the 57th Annual ACM Symposium on Theory of Computing, 2025
2024
Random perfect matchings in regular graphs.
Random Struct. Algorithms, January, 2024
Counting oriented trees in digraphs with large minimum semidegree.
J. Comb. Theory B, 2024
Asymptotically Enumerating Independent Sets in Regular <i>k</i>-Partite <i>k</i>-Uniform Hypergraphs.
CoRR, 2024
Engineering Hypergraph b-Matching Algorithms.
CoRR, 2024
Engineering Weighted Connectivity Augmentation Algorithms.
Proceedings of the 22nd International Symposium on Experimental Algorithms, 2024
2023
Hypergraph regularity and random sampling.
Random Struct. Algorithms, July, 2023
Decomposing hypergraphs into cycle factors.
J. Comb. Theory B, 2023
Conflict-free hypergraph matchings.
Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023
2022
Percolation on Random Graphs with a Fixed Degree Sequence.
SIAM J. Discret. Math., 2022
Fractional cycle decompositions in hypergraphs.
Random Struct. Algorithms, 2022
A Short Proof of the Blow-Up Lemma for Approximate Decompositions.
Comb., 2022
2021
Erdös-Pósa Property for Labeled Minors: 2-Connected Minors.
SIAM J. Discret. Math., 2021
Counting Hamilton cycles in Dirac hypergraphs.
Comb. Probab. Comput., 2021
The Edge-Erdős-Pósa Property.
Comb., 2021
2020
Random Struct. Algorithms, July, 2020
Spanning trees in randomly perturbed graphs.
Random Struct. Algorithms, 2020
Pseudorandom hypergraph matchings.
Comb. Probab. Comput., 2020
Euler Tours in Hypergraphs.
Comb., 2020
2019
Edge Correlations in Random Regular Hypergraphs and Applications to Subgraph Testing.
SIAM J. Discret. Math., 2019
A Unified Erdős-Pósa Theorem for Constrained Cycles.
Comb., 2019
Long Cycles have the Edge-Erdős-Pósa Property.
Comb., 2019
2018
Frames, A-Paths, and the Erdös-Pósa Property.
SIAM J. Discret. Math., 2018
Long cycles through prescribed vertices have the Erdős-Pósa property.
J. Graph Theory, 2018
Paths and Cycles in Random Subgraphs of Graphs with Large Minimum Degree.
Electron. J. Comb., 2018
2017
A Characterization of Testable Hypergraph Properties.
Proceedings of the 58th IEEE Annual Symposium on Foundations of Computer Science, 2017
2016
Induced Matchings in Graphs of Degree at Most 4.
SIAM J. Discret. Math., 2016
Induced Matchings in Graphs of Bounded Maximum Degree.
SIAM J. Discret. Math., 2016
Induced Cycles in Graphs.
Graphs Comb., 2016
The Cycle Spectrum of Claw-free Hamiltonian Graphs.
Graphs Comb., 2016
Induced 2-regular subgraphs in k-chordal cubic graphs.
Discret. Appl. Math., 2016
How to Determine if a Random Graph with a Fixed Degree Sequence Has a Giant Component.
Proceedings of the IEEE 57th Annual Symposium on Foundations of Computer Science, 2016
2015
Maximum induced matchings close to maximum matchings.
Theor. Comput. Sci., 2015
Random Subgraphs in Sparse Graphs.
SIAM J. Discret. Math., 2015
On Graphs with Induced Matching Number Almost Equal to Matching Number.
Electron. Notes Discret. Math., 2015
A stronger bound for the strong chromatic index.
Electron. Notes Discret. Math., 2015
A note on longest paths in circular arc graph.
Discuss. Math. Graph Theory, 2015
Equality of distance packing numbers.
Discret. Math., 2015
Forests and trees among Gallai graphs.
Discret. Math., 2015
Discret. Appl. Math., 2015
Parity Linkage and the Erdős-Pósa Property of Odd Cycles Through Prescribed Vertices in Highly Connected Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2015
2014
Induced Matchings in Subcubic Graphs.
SIAM J. Discret. Math., 2014
Graphs of interval count two with a given partition.
Inf. Process. Lett., 2014
Independence and matching number in graphs with maximum degree 4.
Discret. Math., 2014
A characterization of substar graphs.
Discret. Appl. Math., 2014
Domination and total domination in cubic graphs of large girth.
Discret. Appl. Math., 2014
A Characterization of Mixed Unit Interval Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2014
Structural Parameterizations for Boxicity.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2014
2013
Ramsey Results for Cycle Spectra.
J. Graph Theory, 2013
2012
Random Subgraphs in Cartesian Powers of Regular Graphs.
Electron. J. Comb., 2012
