Ghent University Academic Bibliography

Show Sort by

Your filters: cql: parent exact "DISCRETE APPLIED MATHEMATICS"

Mark
Gallai’s question and constructions of almost hypotraceable graphs

Gábor Wiener and Carol Zamfirescu (UGent)

(2018) DISCRETE APPLIED MATHEMATICS. 243. p.270-278
Mark
- journalArticle
- A1
Secure aggregation of distributed information : how a team of agents can safely share secrets in front of a spy

David Fernández-Duque (UGent) and Valentin Goranko

(2016) DISCRETE APPLIED MATHEMATICS. 198. p.118-135
Mark
A note on equidistant subspace codes

Daniele Bartoli (UGent) and Francesco Pavese (UGent)

(2016) DISCRETE APPLIED MATHEMATICS. 198. p.291-296
Mark
A counterexample to the pseudo 2-factor isomorphic graph conjecture

Jan Goedgebeur (UGent)

(2015) DISCRETE APPLIED MATHEMATICS. 193. p.57-60
Mark
House of Graphs: a database of interesting graphs

Gunnar Brinkmann (UGent) , Kris Coolsaet (UGent) , Jan Goedgebeur (UGent) and Hadrien Melot

(2013) DISCRETE APPLIED MATHEMATICS. 161(1-2). p.311-314
Mark
An independent set approach for the communication network of the GPS III system

Gunnar Brinkmann (UGent) , Simon Crevals (UGent) and John Frye

(2013) DISCRETE APPLIED MATHEMATICS. 161(4-5). p.573-579
Mark
(2)-pancyclic graphs

Carol Zamfirescu (UGent)

(2013) DISCRETE APPLIED MATHEMATICS. 161(7-8). p.1128-1136
Mark
Topological relations between separating circles

Peter Veelaert (UGent)

(2013) DISCRETE APPLIED MATHEMATICS. 161(15). p.2336-2347
Mark
Classification and generation of nanocones

Gunnar Brinkmann (UGent) and Nicolas Van Cleemput (UGent)

(2011) DISCRETE APPLIED MATHEMATICS. 159(15). p.1528-1539
Mark
- journalArticle
- A1
- open access
Covering and radius-covering arrays: construction and classification

Charles Colbourn, Gerzson Kéri, Pedro Pablo Rivas Soriano and Jan-Christoph Schlage-Puchta (UGent)

(2010) DISCRETE APPLIED MATHEMATICS. 158(11). p.1158-1180

Academic Bibliography

Gallai’s question and constructions of almost hypotraceable graphs

Secure aggregation of distributed information : how a team of agents can safely share secrets in front of a spy

A note on equidistant subspace codes

A counterexample to the pseudo 2-factor isomorphic graph conjecture

House of Graphs: a database of interesting graphs

An independent set approach for the communication network of the GPS III system

(2)-pancyclic graphs

Topological relations between separating circles

Classification and generation of nanocones

Covering and radius-covering arrays: construction and classification

Contents

Support

Contact