| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
b-Coloring Parameterized by Clique-Width
|
Jaffke, Lars
|
|
|
68 |
4 |
p. 1049-1081
|
artikel
|
| 2 |
Digraph Coloring and Distance to Acyclicity
|
Harutyunyan, Ararat
|
|
|
68 |
4 |
p. 986-1013
|
artikel
|
| 3 |
Equation Satisfiability in Solvable Groups
|
Idziak, Paweł
|
|
|
68 |
4 |
p. 740-757
|
artikel
|
| 4 |
Finite Sequentiality of Finitely Ambiguous Max-Plus Tree Automata
|
Paul, Erik
|
|
|
68 |
4 |
p. 615-661
|
artikel
|
| 5 |
Good r-divisions Imply Optimal Amortized Decremental Biconnectivity
|
Holm, Jacob
|
|
|
68 |
4 |
p. 1014-1048
|
artikel
|
| 6 |
How to Hide a Clique?
|
Feige, Uriel
|
|
|
68 |
4 |
p. 773-813
|
artikel
|
| 7 |
Improved Bounds for Matching in Random-Order Streams
|
Bernstein, Aaron
|
|
|
68 |
4 |
p. 758-772
|
artikel
|
| 8 |
International Colloquium on Automata, Languages and Programming (ICALP 2020)
|
Dawar, Anuj
|
|
|
68 |
4 |
p. 591-592
|
artikel
|
| 9 |
Minimum Cut in O(mlog2n) Time
|
Gawrychowski, Paweł
|
|
|
68 |
4 |
p. 814-834
|
artikel
|
| 10 |
One-Tape Turing Machine and Branching Program Lower Bounds for MCSP
|
Cheraghchi, Mahdi
|
|
|
68 |
4 |
p. 868-899
|
artikel
|
| 11 |
On Polynomial Recursive Sequences
|
Cadilhac, Michaël
|
|
|
68 |
4 |
p. 593-614
|
artikel
|
| 12 |
On the structure of solution-sets to regular word equations
|
Day, Joel D.
|
|
|
68 |
4 |
p. 662-739
|
artikel
|
| 13 |
Preface of STACS 2021 Special Issue
|
Bläser, Markus
|
|
|
68 |
4 |
p. 835-837
|
artikel
|
| 14 |
Reachability in Two-Parametric Timed Automata with one Parameter is EXPSPACE-Complete
|
Göller, Stefan
|
|
|
68 |
4 |
p. 900-985
|
artikel
|
| 15 |
Subgroup Membership in GL(2,Z)
|
Lohrey, Markus
|
|
|
68 |
4 |
p. 1082-1107
|
artikel
|
| 16 |
The Complexity of the Distributed Constraint Satisfaction Problem
|
Butti, Silvia
|
|
|
68 |
4 |
p. 838-867
|
artikel
|
Tijdschrift beschrijving