Ghent University Academic Bibliography

Your filters: cql: parent exact "THEORETICAL COMPUTER SCIENCE"

Add to list
- Journal Article
- A1
- open access
No six-cell neighborhood cellular automaton solves the parity problem

Anna Nenca, Barbara Wolnik (UGent) and Bernard De Baets (UGent)

(2024) THEORETICAL COMPUTER SCIENCE. 1021.
Add to list
- Journal Article
- A1
- open access
Colouring graphs with no induced six-vertex path or diamond

Jan Goedgebeur (UGent) , Shenwei Huang, Yiao Ju and Owen Merkel

(2023) THEORETICAL COMPUTER SCIENCE. 941. p.278-299
Add to list
- Journal Article
- A1
- open access
A decomposition theorem for number-conserving multi-state cellular automata on triangular grids

Barbara Wolnik (UGent) , Anna Nenca and Bernard De Baets (UGent)

(2023) THEORETICAL COMPUTER SCIENCE. 953.
Add to list
- Journal Article
- A1
- open access
Better 3-coloring algorithms : excluding a triangle and a seven vertex path

Flavia Bonomo-Braberman, Maria Chudnovsky, Jan Goedgebeur (UGent) , Peter Maceli, Oliver Schaudt, Maya Stein and Mingxian Zhong

(2021) THEORETICAL COMPUTER SCIENCE. 850. p.98-115
Add to list
- Journal Article
- A1
- open access
k-Critical graphs in P5-free graphs

Kathie Cameron, Jan Goedgebeur (UGent) , Shenwei Huang and Yongtang Shi

(2021) THEORETICAL COMPUTER SCIENCE. 864. p.80-91
Add to list
- Journal Article
- A1
- open access
On the status sequences of trees

Aida Abiad (UGent) , Boris Brimkov and Alexander Grigoriev

(2020) THEORETICAL COMPUTER SCIENCE. 856. p.110-120
Add to list
Generation of various classes of trivalent graphs

Gunnar Brinkmann (UGent) , Nicolas Van Cleemput (UGent) and Tomaž Pisanski

(2013) THEORETICAL COMPUTER SCIENCE. 502. p.16-29
Add to list
- Journal Article
- A1
A colouring protocol for the generalized Russian cards problem

Andrés Cordón-Franco, Hans van Ditmarsch, David Fernández-Duque (UGent) and Fernando Soler-Toscano

(2013) THEORETICAL COMPUTER SCIENCE. 495. p.81-95
Add to list
Fuzzy-rough nearest neighbour classification and prediction

Richard Jensen and Chris Cornelis (UGent)

(2011) THEORETICAL COMPUTER SCIENCE. 412(42). p.5871-5884
Add to list
- Journal Article
- A1
- open access
On the complex behavior of simple tag systems : an experimental approach

Liesbeth De Mol (UGent)

(2011) THEORETICAL COMPUTER SCIENCE. 412(1-2). p.97-112

Academic Bibliography

No six-cell neighborhood cellular automaton solves the parity problem

Colouring graphs with no induced six-vertex path or diamond

A decomposition theorem for number-conserving multi-state cellular automata on triangular grids

Better 3-coloring algorithms : excluding a triangle and a seven vertex path

k-Critical graphs in P5-free graphs

On the status sequences of trees

Generation of various classes of trivalent graphs

A colouring protocol for the generalized Russian cards problem

Fuzzy-rough nearest neighbour classification and prediction

On the complex behavior of simple tag systems : an experimental approach

Contents

Support

Contact