1
0
0
(1 - 19 von 23
)
excluding a triangle and a seven vertex path - UGent BiblioUGent Biblio
biblio.ugent.be
von F Bonomo-Braberman · · Zitiert von: 6 — Bonomo-Braberman, Flavia, Maria Chudnovsky, Jan Goedgebeur, Peter Maceli, Oliver Schaudt, Maya Stein, and Mingxian Zhong
[ ] The journey of the union-closed sets conjecturearXiv
arxiv.org
von H Bruhn · · Zitiert von: 71 — The journey of the union-closed sets conjecture. Authors:Henning Bruhn, Oliver Schaudt. von H Bruhn · · Zitiert von: 71 — The journey of the union-closed sets conjecture. Authors:Henning Bruhn, Oliver Schaudt.
Stackelberg Packing GamesSSRN
papers.ssrn.com
von T Böhnlein · Zitiert von: 2 — Oliver Schaudt. affiliation not provided to SSRN. Joachim Schauer. University of Graz. Abstract. Stackelberg pricing games are pricing problems ... von T Böhnlein · Zitiert von: 2 — Oliver Schaudt. affiliation not provided to SSRN. Joachim Schauer. University of Graz. Abstract. Stackelberg pricing games are pricing problems ...
Obstructions for three-coloring and list three-coloring H-free graphsarxiv.org › math
arxiv.org
von M Chudnovsky · · Zitiert von: 9 — Title:Obstructions for three-coloring and list three-coloring H-free graphs. Authors:Maria Chudnovsky, Jan Goedgebeur, Oliver Schaudt, Mingxian Zhong.
Documents authored by Schaudt, Oliver - DROPSdagstuhl.de
drops.dagstuhl.de
von M Chudnovsky · Zitiert von: 3 — ... Oliver Schaudt, and Akanksha Agrawal. Published in: Dagstuhl Reports, Volume ... Authors: David Adjiashvili, Felix Hommelsheim, Moritz Mühlenthaler, and Oliver ... von M Chudnovsky · Zitiert von: 3 — ... Oliver Schaudt, and Akanksha Agrawal. Published in: Dagstuhl Reports, Volume ... Authors: David Adjiashvili, Felix Hommelsheim, Moritz Mühlenthaler, and Oliver ...
On disjoint maximal independent sets in graphsScienceDirect.com
www.sciencedirect.com
von O Schaudt · · Zitiert von: 8 — Author links open overlay panel. Oliver Schaudt. Show more. Add to Mendeley. Share. Cite. https://doi.org j.ipl Get rights and content ... von O Schaudt · · Zitiert von: 8 — Author links open overlay panel. Oliver Schaudt. Show more. Add to Mendeley. Share. Cite. https://doi.org j.ipl Get rights and content ...
The journey of the union-closed sets conjectureUni Ulm
www.uni-ulm.de
von H Bruhn · Zitiert von: 64 — Henning Bruhn and Oliver Schaudt. Abstract. We survey the state of the union-closed sets conjecture. 1 Introduction. One of the first mentions [6] of the ...
The union-closed sets conjecture almost holds for ...Springer
link.springer.com
von H Bruhn · · Zitiert von: 9 — Oliver Schaudt. Part of the book series: CRM Series ((CRMSNS,volume 16)) Henning Bruhn & Oliver Schaudt. Authors. Henning Bruhn. View author ... von H Bruhn · · Zitiert von: 9 — Oliver Schaudt. Part of the book series: CRM Series ((CRMSNS,volume 16)) Henning Bruhn & Oliver Schaudt. Authors. Henning Bruhn. View author ...
Claw-Free t-Perfect Graphs Can Be Recognised in ...Springer
link.springer.com
von H Bruhn · · Zitiert von: 7 — Henning Bruhn &; Oliver Schaudt. Conference paper Accesses. 1 Citations. Part of the Lecture Notes in Computer Science book series (LNTCS,volume 8494) ...
# The Price of Connectivity for Vertex CoverDiscrete Mathematics & Theoretical Computer Science
dmtcs.episciences.org
von E Camby · · Zitiert von: 26 — Eglantine Camby ; Jean Cardinal ; Samuel Fiorini ; Oliver Schaudt - The Price of Connectivity for Vertex Cover · 1 Département de mathématiques Université Libre ... von E Camby · · Zitiert von: 26 — Eglantine Camby ; Jean Cardinal ; Samuel Fiorini ; Oliver Schaudt - The Price of Connectivity for Vertex Cover · 1 Département de mathématiques Université Libre ...
Triangle-free graphs that do not contain an induced ...UWSpace
uwspace.uwaterloo.ca
von M Chudnovsky · · Zitiert von: 9 — Cite this version of the work. Maria Chudnovsky, Chun-Hung Liu, Oliver Schaudt, Sophie Spirkl, Nicolas Trotignon, Kristina Vušković (2019). Triangle-free ... von M Chudnovsky · · Zitiert von: 9 — Cite this version of the work. Maria Chudnovsky, Chun-Hung Liu, Oliver Schaudt, Sophie Spirkl, Nicolas Trotignon, Kristina Vušković (2019). Triangle-free ...
b-coloring is NP-hard on co-bipartite graphs and polytime ...Université de Lorraine
hal.univ-lorraine.fr
von F Bonomo · · Zitiert von: 5 — b-coloring is NP-hard on co-bipartite graphs and polytime solvable on tree-cographs. Flavia Bonomo (1, 2) , Oliver Schaudt (3) , Maya Stein (4) , Mario ... von F Bonomo · · Zitiert von: 5 — b-coloring is NP-hard on co-bipartite graphs and polytime solvable on tree-cographs. Flavia Bonomo (1, 2) , Oliver Schaudt (3) , Maya Stein (4) , Mario ...
A characterization of line graphs that are squares of graphs - INFONAwww.infona.pl › resource
www.infona.pl
von M Milanič · · Zitiert von: 13 — Oliver Schaudt. Université Pierre et Marie Curie, Institut de Mathématiques de Jussieu, 4 place Jussieu, Paris, France ...
Obstructions for Three-Coloring and List Three-Coloring $HSIAM Publications Library
epubs.siam.org
von M Chudnovsky · · Zitiert von: 9 — Authors: Maria Chudnovsky https://orcid.org , Jan Goedgebeur, Oliver Schaudt, and Mingxian ZhongAuthors Info & Affiliations.
Optimization of cleaning strategies based on ANN ...American Institute of Physics
pubs.aip.org
von F Terhag · · Zitiert von: 15 — Oliver Schaudt. Oliver Schaudt. 4. RWTH Aachen University, Department of Mathematics. , Pontdriesch 10, Aachen,. Germany.
Almost Partitioning a 3-Edge-Colored $K_{n,n}$ into Five ...SIAM Publications Library
epubs.siam.org
von R Lang · · Zitiert von: 6 — Authors: Richard Lang, Oliver Schaudt, and Maya SteinAuthors Info & Affiliations. https://doi.org M X · PDF · BibTeX. Tools. Add to favorites ... von R Lang · · Zitiert von: 6 — Authors: Richard Lang, Oliver Schaudt, and Maya SteinAuthors Info & Affiliations. https://doi.org M X · PDF · BibTeX. Tools. Add to favorites ...
Obstructions for three-coloring graphs with one forbidden ...Society for Industrial and Applied Mathematics
epubs.siam.org
von M Chudnovsky · · Zitiert von: 17 — Authors: Maria Chudnovsky, Jan Goedgebeur, Oliver Schaudt, and Mingxian ZhongAuthors Info & Affiliations. https://doi.org ch123.
Approximately Coloring Graphs Without Long Induced PathsUWSpace
uwspace.uwaterloo.ca
von M Chudnovsky · · Zitiert von: 5 — Cite this version of the work. Maria Chudnovsky, Oliver Schaudt, Sophie Spirkl, maya stein, Mingxian Zhong (2017). Approximately Coloring Graphs Without Long ... von M Chudnovsky · · Zitiert von: 5 — Cite this version of the work. Maria Chudnovsky, Oliver Schaudt, Sophie Spirkl, maya stein, Mingxian Zhong (2017). Approximately Coloring Graphs Without Long ...
Obstructions for three-coloring graphs with one forbidden ...Princeton University
collaborate.princeton.edu
von M Chudnovsky · · Zitiert von: 17 — Maria Chudnovsky, Jan Goedgebeur, Oliver Schaudt, Mingxian Zhong. Mathematics. Research output: Chapter in Book/Report/Conference proceeding › Conference ... von M Chudnovsky · · Zitiert von: 17 — Maria Chudnovsky, Jan Goedgebeur, Oliver Schaudt, Mingxian Zhong. Mathematics. Research output: Chapter in Book/Report/Conference proceeding › Conference ...
Alle Infos zum Namen "Oliver Schaudt"
Verwandte Suchanfragen zu Oliver Schaudt
| Henning Bruhn Carl Freytag Britta Peis | Felix Joos Felix Hommelsheim Georg Mogk | Andrea Oversberg Ramin Razi Sonja Kracht |
Person "Schaudt" (1) Vorname "Oliver" (42674) Name "Schaudt" (135) |
sortiert nach Relevanz / Datum