1
0
0
(1 - 28 von 36
)
Coloring graphs with forbidden induced subgraphswww.gc.cuny.edu › events › coloring-graphs-forbid...
www.gc.cuny.edu
— This is joint work with Maria Chudnovsky, Jan Goedgebeur, and Oliver Schaudt. More details are available on the seminar webpage ...
Oliver SchaudtCSAuthors
www.csauthors.net
Approximately Coloring Graphs Without Long Induced Paths. Maria Chudnovsky. ,. Oliver Schaudt. ,. Sophie Spirkl. ,. Maya Stein. ,. Mingxian Zhong. Algorithmica, ... Approximately Coloring Graphs Without Long Induced Paths. Maria Chudnovsky. ,. Oliver Schaudt. ,. Sophie Spirkl. ,. Maya Stein. ,. Mingxian Zhong. Algorithmica, ...
Graphs and Combinatorial Optimization: From Theory to ...google.de
books.google.de
... Oliver Schaudt, RWTH Aachen Rainer Schrader, U. Köln Rudiger Schultz, U. Duisburg-Essen Frank Vallentin, U. Köln CTW23 Organizing Committee Dr. Andrea ...
Graph-Theoretic Concepts in Computer Science: 40th ...google.de
books.google.de
... Oliver Schaudt A New Characterization of Pk-free Graphs Eglantine Camby and Oliver Schaudt Contact ...
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.
Partitioning two‐coloured complete multipartite graphs into ...John Wiley
onlinelibrary.wiley.com
von O Schaudt · — Partitioning two-coloured complete multipartite graphs into monochromatic paths and cycles. Oliver Schaudt,. orcid.org
BoxicityGrenoble INP
pagesperso.g-scop.grenoble-inp.fr
Boxicity. Henning Bruhn. Morgan Chopin, Felix Joos, Oliver Schaudt. Page 2. Interval graphs attractive (algorithmic) properties rather limited class.
Preface: : 15th Cologne–Twente Workshop on Graphs and ...ACM Digital Library
dl.acm.org
von B Peis · — Authors: · Britta Peis. RWTH Aachen, Aachen, Germany · Oliver Schaudt. RWTH Aachen, Aachen, Germany · Heiko Röglin. University of Bonn, Bonn, ...
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 ...
b-coloring is NP-hard on co-bipartite graphs and polytime ...Archive ouverte HAL
hal.science
Flavia Bonomo (1, 2) , Oliver Schaudt (3) , Maya Stein (4) , Mario Valencia-Pabon (5, 6). Afficher plus de détails. 1 CONICET - Consejo Nacional de ...
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) ...
Oliver Schaudt's research works | University of Cologne, ...ResearchGate
www.researchgate.net
Oliver Schaudt's 7 research works with 82 citations and 272 reads, including: Preface: 15th Cologne–Twente Workshop on Graphs and Combinatorial Optimization ... Oliver Schaudt's 7 research works with 82 citations and 272 reads, including: Preface: 15th Cologne–Twente Workshop on Graphs and Combinatorial Optimization ...
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 ...
Triangle-free graphs that do not contain an induced ...Elsevier
princeton-staging.elsevierpure.com
Triangle-free graphs that do not contain an induced subdivision of K4 are 3-colorable. Maria Chudnovsky, Chun Hung Liu, Oliver Schaudt, Sophie Spirkl, Nicolas ... Triangle-free graphs that do not contain an induced subdivision of K4 are 3-colorable. Maria Chudnovsky, Chun Hung Liu, Oliver Schaudt, Sophie Spirkl, Nicolas ...
Sophie Spirkl - Researchsites.google.com
sites.google.com
Approximately coloring graphs without long induced paths (with Maria Chudnovsky, Oliver Schaudt, Maya Stein, and Mingxian Zhong), Algorithmica, Short ...
Vertex Partitioning in Graphs: From Structure to Algorithms
www.bing.com
WebMaria Chudnovsky, Neeldhara Misra, Daniel Paulusma, Oliver Schaudt, and Akanksha Agrawal. Vertex Partitioning in Graphs: From Structure to Algorithms (Dagstuhl Seminar …
Accepted PapersIWOCA 2020
iwoca2020.labri.fr
Toni Böhnlein and Oliver Schaudt. On the Complexity of Stackelberg Matroid Pricing Problems. Toru Hasunuma. Connectivity Keeping Trees in 2-Connected Graphs ...
Vertex Partitioning in Graphs: From Structure to Algorithms
www.bing.com
WebNov 27, · Maria Chudnovsky, Neeldhara Misra, Daniel Paulusma, Oliver Schaudt, and Akanksha Agrawal. Vertex Partitioning in Graphs: From Structure to Algorithms (Dagstuhl …
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 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.
Obstructions for three-coloring graphs without induced ...Researcher App
www.researcher-app.com
Maria Chudnovsky, Jan Goedgebeur, Oliver Schaudt, Mingxian Zhong. We prove that there are critical P6 -free graphs, and give the complete list.
Triangle-free graphs that do not contain an induced ...Princeton University
princeton-staging.pure.elsevier.com
Maria Chudnovsky, Chun Hung Liu, Oliver Schaudt, Sophie Spirkl, Nicolas Trotignon, Kristina Vušković. Research output: Contribution to journal › Article ...
Vertex Partitioning in Graphs: From Structure to Algorithms ...Dagstuhl
drops.dagstuhl.de
von M Chudnovsky · — Weitere Beteiligte (Hrsg. etc.): Maria Chudnovsky and Neeldhara Misra and Daniel Paulusma and Oliver Schaudt and Akanksha Agrawal ...
b-coloring is NP-hard on co-bipartite graphs and polytime ...Université de Lorraine
hal.univ-lorraine.fr
von F Bonomo · · Zitiert von: 4 — Flavia Bonomo (1, 2) , Oliver Schaudt (3) , Maya Stein (4) , Mario Valencia-Pabon (5, 6). Afficher plus de détails. 1 CONICET - Consejo Nacional de ...
Home - WG TUM
www14.in.tum.de
Eunjung Kim, Martin Milanic and Oliver Schaudt: Recognizing k-equistable graphs in FPT time. Marek Cygan, Marcin Pilipczuk, Michał Pilipczuk, Erik Jan van ...
publications of mario valencia-pabonLIPN
www-lipn.univ-paris13.fr
b-coloring is NP-hard on co-bipartite graphs and polytime solvable on tree-cographs (with Flavia Bonomo, Oliver Schaudt, Maya Stein). In Proc. of ISCO symposium ...
Alle Infos zum Namen "Oliver Schaudt"
Verwandte Suchanfragen zu Oliver Schaudt
| Henning Bruhn Carl Freytag Clemens Gerhards | Maya Stein Felix Joos Britta Peis | Georg Mogk Ramin Razi Sonja Kracht |
Person "Schaudt" (1) Vorname "Oliver" (42674) Name "Schaudt" (135) |
sortiert nach Relevanz / Datum