Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Felix Joos
@article{DBLP:journals/corr/abs-2402-07753,
author = {Marcelo Fonseca Faraj and
Ernestine Gro{\ss}mann and
Felix Joos and
Thomas M{\"{o}}ller and
Christian Schulz},
title = {Engineering Weighted Connectivity Augmentation Algorithms},
journal = {CoRR},
volume = {abs/2402.07753},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2402.07753},
doi = {10.48550/ARXIV.2402.07753},
eprinttype = {arXiv},
eprint = {2402.07753},
timestamp = {Mon, 19 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2402-07753.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jctb/JoosKS23,
author = {Felix Joos and
Marcus K{\"{u}}hn and
Bjarne Sch{\"{u}}lke},
title = {Decomposing hypergraphs into cycle factors},
journal = {J. Comb. Theory, Ser. {B}},
volume = {158},
number = {Part},
pages = {136--175},
year = {2023},
url = {https://doi.org/10.1016/j.jctb.2022.09.004},
doi = {10.1016/J.JCTB.2022.09.004},
timestamp = {Sun, 15 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jctb/JoosKS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/GlockJKKL23,
author = {Stefan Glock and
Felix Joos and
Jaehoon Kim and
Marcus K{\"{u}}hn and
Lyuben Lichev},
editor = {Nikhil Bansal and
Viswanath Nagarajan},
title = {Conflict-free hypergraph matchings},
booktitle = {Proceedings of the 2023 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2023, Florence, Italy, January 22-25, 2023},
pages = {2991--3005},
publisher = {{SIAM}},
year = {2023},
url = {https://doi.org/10.1137/1.9781611977554.ch115},
doi = {10.1137/1.9781611977554.CH115},
timestamp = {Fri, 17 Feb 2023 09:28:57 +0100},
biburl = {https://dblp.org/rec/conf/soda/GlockJKKL23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/EhardJ22,
author = {Stefan Ehard and
Felix Joos},
title = {A Short Proof of the Blow-Up Lemma for Approximate Decompositions},
journal = {Comb.},
volume = {42},
number = {6},
pages = {771--819},
year = {2022},
url = {https://doi.org/10.1007/s00493-020-4640-9},
doi = {10.1007/S00493-020-4640-9},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/EhardJ22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/JoosK22,
author = {Felix Joos and
Marcus K{\"{u}}hn},
title = {Fractional cycle decompositions in hypergraphs},
journal = {Random Struct. Algorithms},
volume = {61},
number = {3},
pages = {425--443},
year = {2022},
url = {https://doi.org/10.1002/rsa.21070},
doi = {10.1002/RSA.21070},
timestamp = {Tue, 12 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/JoosK22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/FountoulakisJP22,
author = {Nikolaos Fountoulakis and
Felix Joos and
Guillem Perarnau},
title = {Percolation on Random Graphs with a Fixed Degree Sequence},
journal = {{SIAM} J. Discret. Math.},
volume = {36},
number = {1},
pages = {1--46},
year = {2022},
url = {https://doi.org/10.1137/20m1347607},
doi = {10.1137/20M1347607},
timestamp = {Mon, 25 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/FountoulakisJP22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2201-03944,
author = {Eoin Hurley and
Felix Joos and
Richard Lang},
title = {Sufficient conditions for perfect mixed tilings},
journal = {CoRR},
volume = {abs/2201.03944},
year = {2022},
url = {https://arxiv.org/abs/2201.03944},
eprinttype = {arXiv},
eprint = {2201.03944},
timestamp = {Fri, 21 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2201-03944.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/BruhnHJ21,
author = {Henning Bruhn and
Matthias Heinlein and
Felix Joos},
title = {The Edge-Erd{\H{o}}s-P{\'{o}}sa Property},
journal = {Comb.},
volume = {41},
number = {2},
pages = {147--173},
year = {2021},
url = {https://doi.org/10.1007/s00493-020-4071-7},
doi = {10.1007/S00493-020-4071-7},
timestamp = {Fri, 07 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/BruhnHJ21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/GlockGJKO21,
author = {Stefan Glock and
Stephen Gould and
Felix Joos and
Daniela K{\"{u}}hn and
Deryk Osthus},
title = {Counting Hamilton cycles in Dirac hypergraphs},
journal = {Comb. Probab. Comput.},
volume = {30},
number = {4},
pages = {631--653},
year = {2021},
url = {https://doi.org/10.1017/S0963548320000619},
doi = {10.1017/S0963548320000619},
timestamp = {Thu, 06 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/GlockGJKO21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/BruhnJS21,
author = {Henning Bruhn and
Felix Joos and
Oliver Schaudt},
title = {Erd{\"{o}}s-P{\'{o}}sa Property for Labeled Minors: 2-Connected
Minors},
journal = {{SIAM} J. Discret. Math.},
volume = {35},
number = {2},
pages = {893--914},
year = {2021},
url = {https://doi.org/10.1137/19M1289340},
doi = {10.1137/19M1289340},
timestamp = {Thu, 29 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/BruhnJS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2110-01570,
author = {Felix Joos and
Jaehoon Kim and
Daniela K{\"{u}}hn and
Deryk Osthus},
title = {Hypergraph regularity and random sampling},
journal = {CoRR},
volume = {abs/2110.01570},
year = {2021},
url = {https://arxiv.org/abs/2110.01570},
eprinttype = {arXiv},
eprint = {2110.01570},
timestamp = {Mon, 25 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2110-01570.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/GlockJKO20,
author = {Stefan Glock and
Felix Joos and
Daniela K{\"{u}}hn and
Deryk Osthus},
title = {Euler Tours in Hypergraphs},
journal = {Comb.},
volume = {40},
number = {5},
pages = {679--690},
year = {2020},
url = {https://doi.org/10.1007/s00493-020-4046-8},
doi = {10.1007/S00493-020-4046-8},
timestamp = {Wed, 02 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/combinatorica/GlockJKO20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/EhardGJ20,
author = {Stefan Ehard and
Stefan Glock and
Felix Joos},
title = {Pseudorandom hypergraph matchings},
journal = {Comb. Probab. Comput.},
volume = {29},
number = {6},
pages = {868--885},
year = {2020},
url = {https://doi.org/10.1017/S0963548320000280},
doi = {10.1017/S0963548320000280},
timestamp = {Mon, 16 Nov 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/EhardGJ20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/JoosK20,
author = {Felix Joos and
Jaehoon Kim},
title = {Spanning trees in randomly perturbed graphs},
journal = {Random Struct. Algorithms},
volume = {56},
number = {1},
pages = {169--219},
year = {2020},
url = {https://doi.org/10.1002/rsa.20886},
doi = {10.1002/RSA.20886},
timestamp = {Fri, 07 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/JoosK20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/GlockJ20,
author = {Stefan Glock and
Felix Joos},
title = {A rainbow blow-up lemma},
journal = {Random Struct. Algorithms},
volume = {56},
number = {4},
pages = {1031--1069},
year = {2020},
url = {https://doi.org/10.1002/rsa.20907},
doi = {10.1002/RSA.20907},
timestamp = {Sun, 13 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/GlockJ20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/BruhnHJ19,
author = {Henning Bruhn and
Matthias Heinlein and
Felix Joos},
title = {Long Cycles have the Edge-Erd{\H{o}}s-P{\'{o}}sa Property},
journal = {Comb.},
volume = {39},
number = {1},
pages = {1--36},
year = {2019},
url = {https://doi.org/10.1007/s00493-017-3669-x},
doi = {10.1007/S00493-017-3669-X},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/BruhnHJ19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/HuynhJW19,
author = {Tony Huynh and
Felix Joos and
Paul Wollan},
title = {A Unified Erd{\H{o}}s-P{\'{o}}sa Theorem for Constrained Cycles},
journal = {Comb.},
volume = {39},
number = {1},
pages = {91--133},
year = {2019},
url = {https://doi.org/10.1007/s00493-017-3683-z},
doi = {10.1007/S00493-017-3683-Z},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/HuynhJW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/DiazJKO19,
author = {Alberto Espuny D{\'{\i}}az and
Felix Joos and
Daniela K{\"{u}}hn and
Deryk Osthus},
title = {Edge Correlations in Random Regular Hypergraphs and Applications to
Subgraph Testing},
journal = {{SIAM} J. Discret. Math.},
volume = {33},
number = {4},
pages = {1837--1863},
year = {2019},
url = {https://doi.org/10.1137/18M1177159},
doi = {10.1137/18M1177159},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/DiazJKO19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorics/EhardJ18,
author = {Stefan Ehard and
Felix Joos},
title = {Paths and Cycles in Random Subgraphs of Graphs with Large Minimum
Degree},
journal = {Electron. J. Comb.},
volume = {25},
number = {2},
pages = {2},
year = {2018},
url = {https://doi.org/10.37236/6761},
doi = {10.37236/6761},
timestamp = {Fri, 10 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorics/EhardJ18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/BruhnJ18,
author = {Henning Bruhn and
Felix Joos},
title = {A Stronger Bound for the Strong Chromatic Index},
journal = {Comb. Probab. Comput.},
volume = {27},
number = {1},
pages = {21--43},
year = {2018},
url = {https://doi.org/10.1017/S0963548317000244},
doi = {10.1017/S0963548317000244},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/BruhnJ18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/BruhnJS18,
author = {Henning Bruhn and
Felix Joos and
Oliver Schaudt},
title = {Long cycles through prescribed vertices have the Erd{\H{o}}s-P{\'{o}}sa
property},
journal = {J. Graph Theory},
volume = {87},
number = {3},
pages = {275--284},
year = {2018},
url = {https://doi.org/10.1002/jgt.22156},
doi = {10.1002/JGT.22156},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/BruhnJS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/BruhnHJ18,
author = {Henning Bruhn and
Matthias Heinlein and
Felix Joos},
title = {Frames, A-Paths, and the Erd{\"{o}}s-P{\'{o}}sa Property},
journal = {{SIAM} J. Discret. Math.},
volume = {32},
number = {2},
pages = {1246--1260},
year = {2018},
url = {https://doi.org/10.1137/17M1148542},
doi = {10.1137/17M1148542},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/BruhnHJ18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Joos17,
author = {Felix Joos},
title = {Parity Linkage and the Erd{\H{o}}s-P{\'{o}}sa Property of Odd
Cycles through Prescribed Vertices in Highly Connected Graphs},
journal = {J. Graph Theory},
volume = {85},
number = {4},
pages = {747--758},
year = {2017},
url = {https://doi.org/10.1002/jgt.22103},
doi = {10.1002/JGT.22103},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Joos17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/JoosKKO17,
author = {Felix Joos and
Jaehoon Kim and
Daniela K{\"{u}}hn and
Deryk Osthus},
editor = {Chris Umans},
title = {A Characterization of Testable Hypergraph Properties},
booktitle = {58th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2017, Berkeley, CA, USA, October 15-17, 2017},
pages = {859--867},
publisher = {{IEEE} Computer Society},
year = {2017},
url = {https://doi.org/10.1109/FOCS.2017.84},
doi = {10.1109/FOCS.2017.84},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/JoosKKO17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/JoosKKO17,
author = {Felix Joos and
Jaehoon Kim and
Daniela K{\"{u}}hn and
Deryk Osthus},
title = {A characterization of testable hypergraph properties},
journal = {CoRR},
volume = {abs/1707.03303},
year = {2017},
url = {http://arxiv.org/abs/1707.03303},
eprinttype = {arXiv},
eprint = {1707.03303},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/JoosKKO17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BruhnCJS16,
author = {Henning Bruhn and
Morgan Chopin and
Felix Joos and
Oliver Schaudt},
title = {Structural Parameterizations for Boxicity},
journal = {Algorithmica},
volume = {74},
number = {4},
pages = {1453--1472},
year = {2016},
url = {https://doi.org/10.1007/s00453-015-0011-0},
doi = {10.1007/S00453-015-0011-0},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/BruhnCJS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/HenningJLR16,
author = {Michael A. Henning and
Felix Joos and
Christian L{\"{o}}wenstein and
Dieter Rautenbach},
title = {Induced 2-regular subgraphs in k-chordal cubic graphs},
journal = {Discret. Appl. Math.},
volume = {205},
pages = {73--79},
year = {2016},
url = {https://doi.org/10.1016/j.dam.2016.01.009},
doi = {10.1016/J.DAM.2016.01.009},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/HenningJLR16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/EckertJR16,
author = {Jonas Eckert and
Felix Joos and
Dieter Rautenbach},
title = {The Cycle Spectrum of Claw-free Hamiltonian Graphs},
journal = {Graphs Comb.},
volume = {32},
number = {1},
pages = {93--101},
year = {2016},
url = {https://doi.org/10.1007/s00373-015-1530-9},
doi = {10.1007/S00373-015-1530-9},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/EckertJR16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/HenningJLS16,
author = {Michael A. Henning and
Felix Joos and
Christian L{\"{o}}wenstein and
Thomas Sasse},
title = {Induced Cycles in Graphs},
journal = {Graphs Comb.},
volume = {32},
number = {6},
pages = {2425--2441},
year = {2016},
url = {https://doi.org/10.1007/s00373-016-1713-z},
doi = {10.1007/S00373-016-1713-Z},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/HenningJLS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/JoosN16,
author = {Felix Joos and
Viet Hang Nguyen},
title = {Induced Matchings in Graphs of Degree at Most 4},
journal = {{SIAM} J. Discret. Math.},
volume = {30},
number = {1},
pages = {154--165},
year = {2016},
url = {https://doi.org/10.1137/140986980},
doi = {10.1137/140986980},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/JoosN16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/Joos16,
author = {Felix Joos},
title = {Induced Matchings in Graphs of Bounded Maximum Degree},
journal = {{SIAM} J. Discret. Math.},
volume = {30},
number = {3},
pages = {1876--1882},
year = {2016},
url = {https://doi.org/10.1137/16M1058078},
doi = {10.1137/16M1058078},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/Joos16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/JoosPRR16,
author = {Felix Joos and
Guillem Perarnau and
Dieter Rautenbach and
Bruce A. Reed},
editor = {Irit Dinur},
title = {How to Determine if a Random Graph with a Fixed Degree Sequence Has
a Giant Component},
booktitle = {{IEEE} 57th Annual Symposium on Foundations of Computer Science, {FOCS}
2016, 9-11 October 2016, Hyatt Regency, New Brunswick, New Jersey,
{USA}},
pages = {695--703},
publisher = {{IEEE} Computer Society},
year = {2016},
url = {https://doi.org/10.1109/FOCS.2016.79},
doi = {10.1109/FOCS.2016.79},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/JoosPRR16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/JoosPRR16,
author = {Felix Joos and
Guillem Perarnau and
Dieter Rautenbach and
Bruce A. Reed},
title = {How to determine if a random graph with a fixed degree sequence has
a giant component},
journal = {CoRR},
volume = {abs/1601.03714},
year = {2016},
url = {http://arxiv.org/abs/1601.03714},
eprinttype = {arXiv},
eprint = {1601.03714},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/JoosPRR16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/FountoulakisJP16,
author = {Nikolaos Fountoulakis and
Felix Joos and
Guillem Perarnau},
title = {Percolation on random graphs with a fixed degree sequence},
journal = {CoRR},
volume = {abs/1611.08496},
year = {2016},
url = {http://arxiv.org/abs/1611.08496},
eprinttype = {arXiv},
eprint = {1611.08496},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/FountoulakisJP16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/CappelleJMR15,
author = {M{\'{a}}rcia R. Cappelle and
Felix Joos and
Janina M{\"{u}}ttel and
Dieter Rautenbach},
title = {Badly-covered graphs},
journal = {Discret. Appl. Math.},
volume = {182},
pages = {99--103},
year = {2015},
url = {https://doi.org/10.1016/j.dam.2013.11.004},
doi = {10.1016/J.DAM.2013.11.004},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/CappelleJMR15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/JoosLR15,
author = {Felix Joos and
Van Bang Le and
Dieter Rautenbach},
title = {Forests and trees among Gallai graphs},
journal = {Discret. Math.},
volume = {338},
number = {2},
pages = {190--195},
year = {2015},
url = {https://doi.org/10.1016/j.disc.2014.09.003},
doi = {10.1016/J.DISC.2014.09.003},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/JoosLR15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/JoosR15,
author = {Felix Joos and
Dieter Rautenbach},
title = {Equality of distance packing numbers},
journal = {Discret. Math.},
volume = {338},
number = {12},
pages = {2374--2377},
year = {2015},
url = {https://doi.org/10.1016/j.disc.2015.06.003},
doi = {10.1016/J.DISC.2015.06.003},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/JoosR15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmgt/Joos15,
author = {Felix Joos},
title = {A note on longest paths in circular arc graph},
journal = {Discuss. Math. Graph Theory},
volume = {35},
number = {3},
pages = {419--426},
year = {2015},
url = {https://doi.org/10.7151/dmgt.1800},
doi = {10.7151/DMGT.1800},
timestamp = {Mon, 08 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dmgt/Joos15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/BruhnJ15,
author = {Henning Bruhn and
Felix Joos},
title = {A stronger bound for the strong chromatic index},
journal = {Electron. Notes Discret. Math.},
volume = {49},
pages = {277--284},
year = {2015},
url = {https://doi.org/10.1016/j.endm.2015.06.038},
doi = {10.1016/J.ENDM.2015.06.038},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/BruhnJ15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/DuarteJPRS15,
author = {M{\'{a}}rcio Ant{\^{o}}nio Duarte and
Felix Joos and
Lucia Draque Penso and
Dieter Rautenbach and
U{\'{e}}verton dos Santos Souza},
title = {On Graphs with Induced Matching Number Almost Equal to Matching Number},
journal = {Electron. Notes Discret. Math.},
volume = {50},
pages = {9--14},
year = {2015},
url = {https://doi.org/10.1016/j.endm.2015.07.003},
doi = {10.1016/J.ENDM.2015.07.003},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/DuarteJPRS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Joos15,
author = {Felix Joos},
title = {A Characterization of Mixed Unit Interval Graphs},
journal = {J. Graph Theory},
volume = {79},
number = {4},
pages = {267--281},
year = {2015},
url = {https://doi.org/10.1002/jgt.21831},
doi = {10.1002/JGT.21831},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Joos15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/Joos15,
author = {Felix Joos},
title = {Random Subgraphs in Sparse Graphs},
journal = {{SIAM} J. Discret. Math.},
volume = {29},
number = {4},
pages = {2350--2360},
year = {2015},
url = {https://doi.org/10.1137/140976340},
doi = {10.1137/140976340},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/Joos15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/DuarteJPRS15,
author = {M{\'{a}}rcio Ant{\^{o}}nio Duarte and
Felix Joos and
Lucia Draque Penso and
Dieter Rautenbach and
U{\'{e}}verton S. Souza},
title = {Maximum induced matchings close to maximum matchings},
journal = {Theor. Comput. Sci.},
volume = {588},
pages = {131--137},
year = {2015},
url = {https://doi.org/10.1016/j.tcs.2015.04.001},
doi = {10.1016/J.TCS.2015.04.001},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/DuarteJPRS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/Joos15,
author = {Felix Joos},
editor = {Ernst W. Mayr},
title = {Parity Linkage and the Erd{\H{o}}s-P{\'{o}}sa Property of Odd
Cycles Through Prescribed Vertices in Highly Connected Graphs},
booktitle = {Graph-Theoretic Concepts in Computer Science - 41st International
Workshop, {WG} 2015, Garching, Germany, June 17-19, 2015, Revised
Papers},
series = {Lecture Notes in Computer Science},
volume = {9224},
pages = {339--350},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-662-53174-7\_24},
doi = {10.1007/978-3-662-53174-7\_24},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wg/Joos15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BruhnJ15,
author = {Henning Bruhn and
Felix Joos},
title = {A stronger bound for the strong chromatic index},
journal = {CoRR},
volume = {abs/1504.02583},
year = {2015},
url = {http://arxiv.org/abs/1504.02583},
eprinttype = {arXiv},
eprint = {1504.02583},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BruhnJ15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/DantasJLMR14,
author = {Simone Dantas and
Felix Joos and
Christian L{\"{o}}wenstein and
Deiwison S. Machado and
Dieter Rautenbach},
title = {Domination and total domination in cubic graphs of large girth},
journal = {Discret. Appl. Math.},
volume = {174},
pages = {128--132},
year = {2014},
url = {https://doi.org/10.1016/j.dam.2014.04.011},
doi = {10.1016/J.DAM.2014.04.011},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/DantasJLMR14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Joos14,
author = {Felix Joos},
title = {A characterization of substar graphs},
journal = {Discret. Appl. Math.},
volume = {175},
pages = {115--118},
year = {2014},
url = {https://doi.org/10.1016/j.dam.2014.05.033},
doi = {10.1016/J.DAM.2014.05.033},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Joos14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Joos14,
author = {Felix Joos},
title = {Independence and matching number in graphs with maximum degree 4},
journal = {Discret. Math.},
volume = {323},
pages = {1--6},
year = {2014},
url = {https://doi.org/10.1016/j.disc.2014.01.006},
doi = {10.1016/J.DISC.2014.01.006},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Joos14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/JoosLORS14,
author = {Felix Joos and
Christian L{\"{o}}wenstein and
Fabiano de S. Oliveira and
Dieter Rautenbach and
Jayme Luiz Szwarcfiter},
title = {Graphs of interval count two with a given partition},
journal = {Inf. Process. Lett.},
volume = {114},
number = {10},
pages = {542--546},
year = {2014},
url = {https://doi.org/10.1016/j.ipl.2014.04.002},
doi = {10.1016/J.IPL.2014.04.002},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/JoosLORS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/JoosRS14,
author = {Felix Joos and
Dieter Rautenbach and
Thomas Sasse},
title = {Induced Matchings in Subcubic Graphs},
journal = {{SIAM} J. Discret. Math.},
volume = {28},
number = {1},
pages = {468--473},
year = {2014},
url = {https://doi.org/10.1137/130944424},
doi = {10.1137/130944424},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/JoosRS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/BruhnCJS14,
author = {Henning Bruhn and
Morgan Chopin and
Felix Joos and
Oliver Schaudt},
editor = {Dieter Kratsch and
Ioan Todinca},
title = {Structural Parameterizations for Boxicity},
booktitle = {Graph-Theoretic Concepts in Computer Science - 40th International
Workshop, {WG} 2014, Nouan-le-Fuzelier, France, June 25-27, 2014.
Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {8747},
pages = {117--128},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-12340-0\_10},
doi = {10.1007/978-3-319-12340-0\_10},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wg/BruhnCJS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/Joos14,
author = {Felix Joos},
editor = {Dieter Kratsch and
Ioan Todinca},
title = {A Characterization of Mixed Unit Interval Graphs},
booktitle = {Graph-Theoretic Concepts in Computer Science - 40th International
Workshop, {WG} 2014, Nouan-le-Fuzelier, France, June 25-27, 2014.
Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {8747},
pages = {324--335},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-12340-0\_27},
doi = {10.1007/978-3-319-12340-0\_27},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/Joos14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/BrandtJMR13,
author = {Stephan Brandt and
Felix Joos and
Janina M{\"{u}}ttel and
Dieter Rautenbach},
title = {Ramsey Results for Cycle Spectra},
journal = {J. Graph Theory},
volume = {74},
number = {2},
pages = {210--215},
year = {2013},
url = {https://doi.org/10.1002/jgt.21704},
doi = {10.1002/JGT.21704},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/BrandtJMR13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorics/Joos12,
author = {Felix Joos},
title = {Random Subgraphs in Cartesian Powers of Regular Graphs},
journal = {Electron. J. Comb.},
volume = {19},
number = {1},
pages = {47},
year = {2012},
url = {https://doi.org/10.37236/2058},
doi = {10.37236/2058},
timestamp = {Fri, 10 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorics/Joos12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
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.
last updated on 2024-04-21 17:25 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:
