Oliver Schaudt

◀ ▶ joint publications with Flavia Bonomo-Braberman

> 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)
2018
[j32]
- view
  authority control:
- export record
  dblp key:
  - journals/combinatorica/BonomoCMSSZ18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/combinatorica/BonomoCMSSZ18
Flavia Bonomo, Maria Chudnovsky, Peter Maceli, Oliver Schaudt, Maya Stein, Mingxian Zhong:
Three-Coloring and List Three-Coloring of Graphs Without Induced Paths on Seven Vertices. Comb. 38(4): 779-801 (2018)
2015
[j22]
- view
  authority control:
- export record
  dblp key:
  - journals/algorithmica/BonomoSSV15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/algorithmica/BonomoSSV15
Flavia Bonomo, Oliver Schaudt, Maya Stein, Mario Valencia-Pabon:
b-Coloring is NP-hard on Co-bipartite Graphs and Polytime Solvable on Tree-Cographs. Algorithmica 73(2): 289-305 (2015)
2014
[c8]
- view
  authority control:
- export record
  dblp key:
  - conf/iscopt/BonomoSSV14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/iscopt/BonomoSSV14
Flavia Bonomo, Oliver Schaudt, Maya Stein, Mario Valencia-Pabon:
b-Coloring is NP-Hard on Co-Bipartite Graphs and Polytime Solvable on Tree-Cographs. ISCO 2014: 100-111
[i8]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/BonomoSS14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/BonomoSS14
Flavia Bonomo, Oliver Schaudt, Maya Jakobine Stein:
3-Colouring graphs without triangles or induced paths on seven vertices. CoRR abs/1410.0040 (2014)
2013
[i1]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/BonomoSSV13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/BonomoSSV13
Flavia Bonomo, Oliver Schaudt, Maya Stein, Mario Valencia-Pabon:
b-coloring is NP-hard on co-bipartite graphs and polytime solvable on tree-cographs. CoRR abs/1310.8313 (2013)

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.