Felix Joos

Richard Lang

J. Comb. Theory B, 2025

2024

Random perfect matchings in regular graphs.

[BibT_eX]

[DOI]

Bertille Granet

Random Struct. Algorithms, January, 2024

Counting oriented trees in digraphs with large minimum semidegree.

[BibT_eX]

[DOI]

Jonathan Schrodt

J. Comb. Theory B, 2024

Engineering Hypergraph b-Matching Algorithms.

[BibT_eX]

[DOI]

CoRR, 2024

Engineering Weighted Connectivity Augmentation Algorithms.

[BibT_eX]

[DOI]

Marcelo Fonseca Faraj

Proceedings of the 22nd International Symposium on Experimental Algorithms, 2024

2023

Hypergraph regularity and random sampling.

[BibT_eX]

[DOI]

Random Struct. Algorithms, July, 2023

Decomposing hypergraphs into cycle factors.

[BibT_eX]

[DOI]

Marcus Kühn

Bjarne Schülke

J. Comb. Theory B, 2023

Conflict-free hypergraph matchings.

[BibT_eX]

[DOI]

Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

2022

Percolation on Random Graphs with a Fixed Degree Sequence.

[BibT_eX]

[DOI]

Nikolaos Fountoulakis

Guillem Perarnau

SIAM J. Discret. Math., 2022

Fractional cycle decompositions in hypergraphs.

[BibT_eX]

[DOI]

Marcus Kühn

Random Struct. Algorithms, 2022

A Short Proof of the Blow-Up Lemma for Approximate Decompositions.

[BibT_eX]

[DOI]

Stefan Ehard

Comb., 2022

2021

Erdös-Pósa Property for Labeled Minors: 2-Connected Minors.

[BibT_eX]

[DOI]

Oliver Schaudt

SIAM J. Discret. Math., 2021

Counting Hamilton cycles in Dirac hypergraphs.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2021

The Edge-Erdős-Pósa Property.

[BibT_eX]

[DOI]

Matthias Heinlein

Comb., 2021

2020

A rainbow blow-up lemma.

[BibT_eX]

[DOI]

Stefan Glock

Random Struct. Algorithms, July, 2020

Spanning trees in randomly perturbed graphs.

[BibT_eX]

[DOI]

Jaehoon Kim

Random Struct. Algorithms, 2020

Pseudorandom hypergraph matchings.

[BibT_eX]

[DOI]

Stefan Ehard

Stefan Glock

Comb. Probab. Comput., 2020

Euler Tours in Hypergraphs.

[BibT_eX]

[DOI]

Comb., 2020

2019

Edge Correlations in Random Regular Hypergraphs and Applications to Subgraph Testing.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2019

A Unified Erdős-Pósa Theorem for Constrained Cycles.

[BibT_eX]

[DOI]

Tony Huynh

Paul Wollan

Comb., 2019

Long Cycles have the Edge-Erdős-Pósa Property.

[BibT_eX]

[DOI]

Matthias Heinlein

Comb., 2019

2018

Frames, A-Paths, and the Erdös-Pósa Property.

[BibT_eX]

[DOI]

Matthias Heinlein

SIAM J. Discret. Math., 2018

Long cycles through prescribed vertices have the Erdős-Pósa property.

[BibT_eX]

[DOI]

Oliver Schaudt

J. Graph Theory, 2018

Paths and Cycles in Random Subgraphs of Graphs with Large Minimum Degree.

[BibT_eX]

[DOI]

Stefan Ehard

Electron. J. Comb., 2018

2017

Parity Linkage and the Erdős-Pósa Property of Odd Cycles through Prescribed Vertices in Highly Connected Graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2017

A Characterization of Testable Hypergraph Properties.

[BibT_eX]

[DOI]

Proceedings of the 58th IEEE Annual Symposium on Foundations of Computer Science, 2017

2016

Induced Matchings in Graphs of Degree at Most 4.

[BibT_eX]

[DOI]

Viet Hang Nguyen

SIAM J. Discret. Math., 2016

Induced Matchings in Graphs of Bounded Maximum Degree.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2016

Induced Cycles in Graphs.

[BibT_eX]

[DOI]

Graphs Comb., 2016

The Cycle Spectrum of Claw-free Hamiltonian Graphs.

[BibT_eX]

[DOI]

Jonas Eckert

Graphs Comb., 2016

Induced 2-regular subgraphs in k-chordal cubic graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2016

Structural Parameterizations for Boxicity.

[BibT_eX]

[DOI]

Algorithmica, 2016

How to Determine if a Random Graph with a Fixed Degree Sequence Has a Giant Component.

[BibT_eX]

[DOI]

Proceedings of the IEEE 57th Annual Symposium on Foundations of Computer Science, 2016

2015

Maximum induced matchings close to maximum matchings.

[BibT_eX]

[DOI]

Márcio Antônio Duarte

Theor. Comput. Sci., 2015

Random Subgraphs in Sparse Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2015

A Characterization of Mixed Unit Interval Graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2015

On Graphs with Induced Matching Number Almost Equal to Matching Number.

[BibT_eX]

[DOI]

Márcio Antônio Duarte

Lucia Draque Penso

Uéverton dos Santos Souza

Electron. Notes Discret. Math., 2015

A stronger bound for the strong chromatic index.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2015

A note on longest paths in circular arc graph.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2015

Equality of distance packing numbers.

[BibT_eX]

[DOI]

Discret. Math., 2015

Forests and trees among Gallai graphs.

[BibT_eX]

[DOI]

Van Bang Le

Discret. Math., 2015

Badly-covered graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2015

2014

Induced Matchings in Subcubic Graphs.

[BibT_eX]

[DOI]

Thomas Sasse

SIAM J. Discret. Math., 2014

Graphs of interval count two with a given partition.

[BibT_eX]

[DOI]

Christian Löwenstein

Fabiano de S. Oliveira

Jayme Luiz Szwarcfiter

Inf. Process. Lett., 2014

Independence and matching number in graphs with maximum degree 4.

[BibT_eX]

[DOI]

Discret. Math., 2014

A characterization of substar graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2014

Domination and total domination in cubic graphs of large girth.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2014

2013

Ramsey Results for Cycle Spectra.

[BibT_eX]

[DOI]

J. Graph Theory, 2013

2012

Random Subgraphs in Cartesian Powers of Regular Graphs.

[BibT_eX]

[DOI]