Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

Oliver Schaudt

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Jan Goedgebeur

> Home > Persons > Oliver Schaudt

Publications

2021
[j40]
- view
  authority control:
- export record
  dblp key:
  - journals/tcs/Bonomo-Braberman21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/Bonomo-Braberman21
Flavia Bonomo-Braberman, Maria Chudnovsky, Jan Goedgebeur, Peter Maceli, Oliver Schaudt, Maya Stein, Mingxian Zhong:
Better 3-coloring algorithms: Excluding a triangle and a seven vertex path. Theor. Comput. Sci. 850: 98-115 (2021)
2020
[j38]
- view
  authority control:
- export record
  dblp key:
  - journals/jct/ChudnovskyGSZ20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jct/ChudnovskyGSZ20
Maria Chudnovsky, Jan Goedgebeur, Oliver Schaudt, Mingxian Zhong:
Obstructions for three-coloring graphs without induced paths on six vertices. J. Comb. Theory, Ser. B 140: 45-83 (2020)
[j36]
- view
  authority control:
- export record
  dblp key:
  - journals/siamdm/ChudnovskyGSZ20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/siamdm/ChudnovskyGSZ20
Maria Chudnovsky, Jan Goedgebeur, Oliver Schaudt, Mingxian Zhong:
Obstructions for Three-Coloring and List Three-Coloring H-Free Graphs. SIAM J. Discret. Math. 34(1): 431-469 (2020)
2018
[j31]
- view
  authority control:
- export record
  dblp key:
  - journals/jgt/GoedgebeurS18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jgt/GoedgebeurS18
Jan Goedgebeur, Oliver Schaudt:
Exhaustive generation of k-critical H-free graphs. J. Graph Theory 87(2): 188-207 (2018)
2017
[i19]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/ChudnovskyGSZ17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/ChudnovskyGSZ17
Maria Chudnovsky, Jan Goedgebeur, Oliver Schaudt, Mingxian Zhong:
Obstructions for three-coloring and list three-coloring H-free graphs. CoRR abs/1703.05684 (2017)
2016
[c12]
- view
  authority control:
- export record
  dblp key:
  - conf/soda/ChudnovskyGSZ16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/soda/ChudnovskyGSZ16
Maria Chudnovsky, Jan Goedgebeur, Oliver Schaudt, Mingxian Zhong:
Obstructions for three-coloring graphs with one forbidden induced subgraph. SODA 2016: 1774-1783
[c11]
- view
  authority control:
- export record
  dblp key:
  - conf/wg/GoedgebeurS16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/wg/GoedgebeurS16
Jan Goedgebeur, Oliver Schaudt:
Exhaustive Generation of k-Critical ℋ-Free Graphs. WG 2016: 109-120
2015
[i14]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/ChudnovskyGSZ15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/ChudnovskyGSZ15
Maria Chudnovsky, Jan Goedgebeur, Oliver Schaudt, Mingxian Zhong:
Obstructions for three-coloring graphs without induced paths on six vertices. CoRR abs/1504.06979 (2015)
[i13]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/GoedgebeurS15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/GoedgebeurS15
Jan Goedgebeur, Oliver Schaudt:
Exhaustive generation of $k$-critical $\mathcal H$-free graphs. CoRR abs/1506.03647 (2015)

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.