| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A diameter-revealing proof of the Bondy-Lovász lemma
|
An, Hyung-Chan
|
|
|
174 |
C |
p.
|
artikel
|
| 2 |
A faster parameterized algorithm for temporal matching
|
Zschoche, Philipp
|
|
|
174 |
C |
p.
|
artikel
|
| 3 |
An asymptotically tight online algorithm for m-Steiner Traveling Salesman Problem
|
Zhang, Yubai
|
|
|
174 |
C |
p.
|
artikel
|
| 4 |
An improved exact algorithm for minimum dominating set in chordal graphs
|
Abu-Khzam, Faisal N.
|
|
|
174 |
C |
p.
|
artikel
|
| 5 |
A note on distance-preserving graph sparsification
|
Bodwin, Greg
|
|
|
174 |
C |
p.
|
artikel
|
| 6 |
A simple and improved parameterized algorithm for bicluster editing
|
Xiao, Mingyu
|
|
|
174 |
C |
p.
|
artikel
|
| 7 |
Editorial Board
|
|
|
|
174 |
C |
p.
|
artikel
|
| 8 |
Grid straight-line embeddings of trees with a minimum number of bends per path
|
Luca, V.T.F.
|
|
|
174 |
C |
p.
|
artikel
|
| 9 |
Hard problems that quickly become very easy
|
Martin, Barnaby
|
|
|
174 |
C |
p.
|
artikel
|
| 10 |
Improved entropy bounds for parity filtered self-timed ring based random number generators
|
Gomez, Ana I.
|
|
|
174 |
C |
p.
|
artikel
|
| 11 |
Minimum projective linearizations of trees in linear time
|
Alemany-Puig, Lluís
|
|
|
174 |
C |
p.
|
artikel
|
| 12 |
Modular termination of prefix-constrained term rewrite systems
|
Andrianarivelo, Nirina
|
|
|
174 |
C |
p.
|
artikel
|
| 13 |
New network entropy: The domination entropy of graphs
|
Şahin, Bünyamin
|
|
|
174 |
C |
p.
|
artikel
|
| 14 |
Non-uniform packings
|
Gottlieb, Lee-Ad
|
|
|
174 |
C |
p.
|
artikel
|
| 15 |
On d-distance m-tuple (ℓ,r)-domination in graphs
|
Jena, Sangram K.
|
|
|
174 |
C |
p.
|
artikel
|
| 16 |
On matrices potentially useful for tree codes
|
Pudlák, Pavel
|
|
|
174 |
C |
p.
|
artikel
|
| 17 |
On the (im)possibility of improving the round diffusion of generalized Feistel structures
|
Shibutani, Kyoji
|
|
|
174 |
C |
p.
|
artikel
|
| 18 |
Packing batches of items into a single bin
|
Januszewski, Janusz
|
|
|
174 |
C |
p.
|
artikel
|
| 19 |
Randomized consensus with regular registers
|
Hadzilacos, Vassos
|
|
|
174 |
C |
p.
|
artikel
|
| 20 |
Revisiting reachability in Polynomial Interrupt Timed Automata
|
Bérard, Béatrice
|
|
|
174 |
C |
p.
|
artikel
|
| 21 |
Robust algorithms for preemptive scheduling on uniform machines of non-increasing job sizes
|
Levin, Asaf
|
|
|
174 |
C |
p.
|
artikel
|
| 22 |
Two-level hub Steiner trees
|
Fukunaga, Takuro
|
|
|
174 |
C |
p.
|
artikel
|
| 23 |
Vertex degrees and 2-cuts in graphs with many hamiltonian vertex-deleted subgraphs
|
Zamfirescu, Carol T.
|
|
|
174 |
C |
p.
|
artikel
|
| 24 |
Weighted well-covered graphs without cycles of lengths 5, 6 and 7
|
Tankus, David
|
|
|
174 |
C |
p.
|
artikel
|
Tijdschrift beschrijving