nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A Cubic Vertex-Kernel for Trivially Perfect Editing
|
Dumas, Maël |
|
|
85 |
4 |
p. 1091-1110 |
artikel |
2 |
3-Colouring Pt-Free Graphs Without Short Odd Cycles
|
Rojas Anríquez, Alberto |
|
|
85 |
4 |
p. 831-853 |
artikel |
3 |
Faster Cut Sparsification of Weighted Graphs
|
Forster, Sebastian |
|
|
85 |
4 |
p. 929-964 |
artikel |
4 |
Few Cuts Meet Many Point Sets
|
Har-Peled, Sariel |
|
|
85 |
4 |
p. 965-975 |
artikel |
5 |
Gapped Indexing for Consecutive Occurrences
|
Bille, Philip |
|
|
85 |
4 |
p. 879-901 |
artikel |
6 |
Leader Election in Well-Connected Graphs
|
Gilbert, Seth |
|
|
85 |
4 |
p. 1029-1066 |
artikel |
7 |
On the Tractability of Covering a Graph with 2-Clubs
|
Dondi, Riccardo |
|
|
85 |
4 |
p. 992-1028 |
artikel |
8 |
Parameterized Inapproximability of Independent Set in H-Free Graphs
|
Dvořák, Pavel |
|
|
85 |
4 |
p. 902-928 |
artikel |
9 |
Rare Siblings Speed-Up Deterministic Detection and Counting of Small Pattern Graphs
|
Kowaluk, Mirosław |
|
|
85 |
4 |
p. 976-991 |
artikel |
10 |
The Complexity of Two Colouring Games
|
Andres, Stephan Dominique |
|
|
85 |
4 |
p. 1067-1090 |
artikel |
11 |
Trade-Offs in Dynamic Coloring for Bipartite and General Graphs
|
Kashyop, Manas Jyoti |
|
|
85 |
4 |
p. 854-878 |
artikel |