| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
Computing a Minimum Subset Feedback Vertex Set on Chordal Graphs Parameterized by Leafage
|
Papadopoulos, Charis
|
|
|
86 |
3 |
p. 874-906
|
artikel
|
| 2 |
Computing Longest Lyndon Subsequences and Longest Common Lyndon Subsequences
|
Bannai, Hideo
|
|
|
86 |
3 |
p. 735-756
|
artikel
|
| 3 |
Data Structures for Computing Unique Palindromes in Static and Non-Static Strings
|
Mieno, Takuya
|
|
|
86 |
3 |
p. 852-873
|
artikel
|
| 4 |
1-Extendability of Independent Sets
|
Bergé, Pierre
|
|
|
86 |
3 |
p. 757-781
|
artikel
|
| 5 |
Faster Algorithm for Finding Maximum 1-Restricted Simple 2-Matchings
|
Artamonov, Stepan
|
|
|
86 |
3 |
p. 717-734
|
artikel
|
| 6 |
List Covering of Regular Multigraphs with Semi-edges
|
Bok, Jan
|
|
|
86 |
3 |
p. 782-807
|
artikel
|
| 7 |
Perfect Matchings with Crossings
|
Aichholzer, Oswin
|
|
|
86 |
3 |
p. 697-716
|
artikel
|
| 8 |
Preface of the Special Issue Dedicated to Selected Papers from IWOCA 2022
|
Bazgan, Cristina
|
|
|
86 |
3 |
p. 695-696
|
artikel
|
| 9 |
Reducing Graph Parameters by Contractions and Deletions
|
Lucke, Felicia
|
|
|
86 |
3 |
p. 825-851
|
artikel
|
| 10 |
Winner Determination Algorithms for Graph Games with Matching Structures
|
Hanaka, Tesshu
|
|
|
86 |
3 |
p. 808-824
|
artikel
|
Tijdschrift beschrijving