default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFelix Joos
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j45]Eoin Hurley, Felix Joos
, Richard Lang:
Sufficient conditions for perfect mixed tilings. J. Comb. Theory B 170: 128-188 (2025)- 2024
- [j44]Felix Joos, Jonathan Schrodt:
Counting oriented trees in digraphs with large minimum semidegree. J. Comb. Theory B 168: 236-270 (2024) - [j43]Bertille Granet, Felix Joos:
Random perfect matchings in regular graphs. Random Struct. Algorithms 64(1): 3-14 (2024) - [c7]Marcelo Fonseca Faraj, Ernestine Großmann, Felix Joos, Thomas Möller, Christian Schulz:
Engineering Weighted Connectivity Augmentation Algorithms. SEA 2024: 11:1-11:22 - [i8]Marcelo Fonseca Faraj, Ernestine Großmann, Felix Joos, Thomas Möller, Christian Schulz:
Engineering Weighted Connectivity Augmentation Algorithms. CoRR abs/2402.07753 (2024) - [i7]Ernestine Großmann, Felix Joos, Henrik Reinstädtler, Christian Schulz:
Engineering Hypergraph b-Matching Algorithms. CoRR abs/2408.06924 (2024) - 2023
- [j42]Felix Joos, Marcus Kühn, Bjarne Schülke:
Decomposing hypergraphs into cycle factors. J. Comb. Theory B 158(Part): 136-175 (2023) - [j41]Felix Joos, Jaehoon Kim, Daniela Kühn, Deryk Osthus:
Hypergraph regularity and random sampling. Random Struct. Algorithms 62(4): 956-1015 (2023) - [c6]Stefan Glock, Felix Joos, Jaehoon Kim, Marcus Kühn, Lyuben Lichev:
Conflict-free hypergraph matchings. SODA 2023: 2991-3005 - 2022
- [j40]Stefan Ehard, Felix Joos:
A Short Proof of the Blow-Up Lemma for Approximate Decompositions. Comb. 42(6): 771-819 (2022) - [j39]Felix Joos, Marcus Kühn:
Fractional cycle decompositions in hypergraphs. Random Struct. Algorithms 61(3): 425-443 (2022) - [j38]Nikolaos Fountoulakis, Felix Joos, Guillem Perarnau:
Percolation on Random Graphs with a Fixed Degree Sequence. SIAM J. Discret. Math. 36(1): 1-46 (2022) - [i6]Eoin Hurley, Felix Joos, Richard Lang:
Sufficient conditions for perfect mixed tilings. CoRR abs/2201.03944 (2022) - 2021
- [j37]Henning Bruhn, Matthias Heinlein, Felix Joos:
The Edge-Erdős-Pósa Property. Comb. 41(2): 147-173 (2021) - [j36]Stefan Glock, Stephen Gould, Felix Joos, Daniela Kühn, Deryk Osthus:
Counting Hamilton cycles in Dirac hypergraphs. Comb. Probab. Comput. 30(4): 631-653 (2021) - [j35]Henning Bruhn, Felix Joos, Oliver Schaudt:
Erdös-Pósa Property for Labeled Minors: 2-Connected Minors. SIAM J. Discret. Math. 35(2): 893-914 (2021) - [i5]Felix Joos, Jaehoon Kim, Daniela Kühn, Deryk Osthus:
Hypergraph regularity and random sampling. CoRR abs/2110.01570 (2021) - 2020
- [j34]Stefan Glock, Felix Joos, Daniela Kühn, Deryk Osthus:
Euler Tours in Hypergraphs. Comb. 40(5): 679-690 (2020) - [j33]Stefan Ehard, Stefan Glock, Felix Joos:
Pseudorandom hypergraph matchings. Comb. Probab. Comput. 29(6): 868-885 (2020) - [j32]Felix Joos, Jaehoon Kim:
Spanning trees in randomly perturbed graphs. Random Struct. Algorithms 56(1): 169-219 (2020) - [j31]Stefan Glock, Felix Joos:
A rainbow blow-up lemma. Random Struct. Algorithms 56(4): 1031-1069 (2020)
2010 – 2019
- 2019
- [j30]Henning Bruhn, Matthias Heinlein, Felix Joos:
Long Cycles have the Edge-Erdős-Pósa Property. Comb. 39(1): 1-36 (2019) - [j29]Tony Huynh, Felix Joos, Paul Wollan:
A Unified Erdős-Pósa Theorem for Constrained Cycles. Comb. 39(1): 91-133 (2019) - [j28]Alberto Espuny Díaz, Felix Joos, Daniela Kühn, Deryk Osthus:
Edge Correlations in Random Regular Hypergraphs and Applications to Subgraph Testing. SIAM J. Discret. Math. 33(4): 1837-1863 (2019) - 2018
- [j27]Stefan Ehard, Felix Joos:
Paths and Cycles in Random Subgraphs of Graphs with Large Minimum Degree. Electron. J. Comb. 25(2): 2 (2018) - [j26]Henning Bruhn, Felix Joos:
A Stronger Bound for the Strong Chromatic Index. Comb. Probab. Comput. 27(1): 21-43 (2018) - [j25]Henning Bruhn, Felix Joos, Oliver Schaudt:
Long cycles through prescribed vertices have the Erdős-Pósa property. J. Graph Theory 87(3): 275-284 (2018) - [j24]Henning Bruhn, Matthias Heinlein, Felix Joos:
Frames, A-Paths, and the Erdös-Pósa Property. SIAM J. Discret. Math. 32(2): 1246-1260 (2018) - 2017
- [j23]Felix Joos:
Parity Linkage and the Erdős-Pósa Property of Odd Cycles through Prescribed Vertices in Highly Connected Graphs. J. Graph Theory 85(4): 747-758 (2017) - [c5]Felix Joos, Jaehoon Kim, Daniela Kühn, Deryk Osthus:
A Characterization of Testable Hypergraph Properties. FOCS 2017: 859-867 - [i4]Felix Joos, Jaehoon Kim, Daniela Kühn, Deryk Osthus:
A characterization of testable hypergraph properties. CoRR abs/1707.03303 (2017) - 2016
- [j22]Henning Bruhn, Morgan Chopin, Felix Joos, Oliver Schaudt:
Structural Parameterizations for Boxicity. Algorithmica 74(4): 1453-1472 (2016) - [j21]Michael A. Henning, Felix Joos, Christian Löwenstein, Dieter Rautenbach:
Induced 2-regular subgraphs in k-chordal cubic graphs. Discret. Appl. Math. 205: 73-79 (2016) - [j20]Jonas Eckert, Felix Joos, Dieter Rautenbach:
The Cycle Spectrum of Claw-free Hamiltonian Graphs. Graphs Comb. 32(1): 93-101 (2016) - [j19]Michael A. Henning, Felix Joos, Christian Löwenstein, Thomas Sasse:
Induced Cycles in Graphs. Graphs Comb. 32(6): 2425-2441 (2016) - [j18]Felix Joos, Viet Hang Nguyen:
Induced Matchings in Graphs of Degree at Most 4. SIAM J. Discret. Math. 30(1): 154-165 (2016) - [j17]Felix Joos:
Induced Matchings in Graphs of Bounded Maximum Degree. SIAM J. Discret. Math. 30(3): 1876-1882 (2016) - [c4]Felix Joos, Guillem Perarnau, Dieter Rautenbach, Bruce A. Reed:
How to Determine if a Random Graph with a Fixed Degree Sequence Has a Giant Component. FOCS 2016: 695-703 - [i3]Felix Joos, Guillem Perarnau, Dieter Rautenbach, Bruce A. Reed:
How to determine if a random graph with a fixed degree sequence has a giant component. CoRR abs/1601.03714 (2016) - [i2]Nikolaos Fountoulakis, Felix Joos, Guillem Perarnau:
Percolation on random graphs with a fixed degree sequence. CoRR abs/1611.08496 (2016) - 2015
- [j16]Márcia R. Cappelle, Felix Joos, Janina Müttel, Dieter Rautenbach:
Badly-covered graphs. Discret. Appl. Math. 182: 99-103 (2015) - [j15]Felix Joos, Van Bang Le, Dieter Rautenbach:
Forests and trees among Gallai graphs. Discret. Math. 338(2): 190-195 (2015) - [j14]Felix Joos, Dieter Rautenbach:
Equality of distance packing numbers. Discret. Math. 338(12): 2374-2377 (2015) - [j13]Felix Joos:
A note on longest paths in circular arc graph. Discuss. Math. Graph Theory 35(3): 419-426 (2015) - [j12]Henning Bruhn, Felix Joos:
A stronger bound for the strong chromatic index. Electron. Notes Discret. Math. 49: 277-284 (2015) - [j11]Márcio Antônio Duarte, Felix Joos, Lucia Draque Penso, Dieter Rautenbach, Uéverton dos Santos Souza:
On Graphs with Induced Matching Number Almost Equal to Matching Number. Electron. Notes Discret. Math. 50: 9-14 (2015) - [j10]Felix Joos:
A Characterization of Mixed Unit Interval Graphs. J. Graph Theory 79(4): 267-281 (2015) - [j9]Felix Joos:
Random Subgraphs in Sparse Graphs. SIAM J. Discret. Math. 29(4): 2350-2360 (2015) - [j8]Márcio Antônio Duarte, Felix Joos, Lucia Draque Penso, Dieter Rautenbach, Uéverton S. Souza:
Maximum induced matchings close to maximum matchings. Theor. Comput. Sci. 588: 131-137 (2015) - [c3]Felix Joos:
Parity Linkage and the Erdős-Pósa Property of Odd Cycles Through Prescribed Vertices in Highly Connected Graphs. WG 2015: 339-350 - [i1]Henning Bruhn, Felix Joos:
A stronger bound for the strong chromatic index. CoRR abs/1504.02583 (2015) - 2014
- [j7]Simone Dantas, Felix Joos, Christian Löwenstein, Deiwison S. Machado, Dieter Rautenbach:
Domination and total domination in cubic graphs of large girth. Discret. Appl. Math. 174: 128-132 (2014) - [j6]Felix Joos:
A characterization of substar graphs. Discret. Appl. Math. 175: 115-118 (2014) - [j5]Felix Joos:
Independence and matching number in graphs with maximum degree 4. Discret. Math. 323: 1-6 (2014) - [j4]Felix Joos, Christian Löwenstein, Fabiano de S. Oliveira, Dieter Rautenbach, Jayme Luiz Szwarcfiter:
Graphs of interval count two with a given partition. Inf. Process. Lett. 114(10): 542-546 (2014) - [j3]Felix Joos, Dieter Rautenbach, Thomas Sasse:
Induced Matchings in Subcubic Graphs. SIAM J. Discret. Math. 28(1): 468-473 (2014) - [c2]Henning Bruhn, Morgan Chopin, Felix Joos, Oliver Schaudt:
Structural Parameterizations for Boxicity. WG 2014: 117-128 - [c1]Felix Joos:
A Characterization of Mixed Unit Interval Graphs. WG 2014: 324-335 - 2013
- [j2]Stephan Brandt, Felix Joos, Janina Müttel, Dieter Rautenbach:
Ramsey Results for Cycle Spectra. J. Graph Theory 74(2): 210-215 (2013) - 2012
- [j1]Felix Joos:
Random Subgraphs in Cartesian Powers of Regular Graphs. Electron. J. Comb. 19(1): 47 (2012)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-23 20:32 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
