nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A 3+Ω(1) Lower Bound for Page Migration
|
Matsubayashi, Akira |
|
|
82 |
9 |
p. 2535-2563 |
artikel |
2 |
An Efficient Exhaustive Search Algorithm for the Escherization Problem
|
Nagata, Yuichi |
|
|
82 |
9 |
p. 2502-2534 |
artikel |
3 |
An Efficient Sum Query Algorithm for Distance-Based Locally Dominating Functions
|
Huang, Ziyun |
|
|
82 |
9 |
p. 2415-2431 |
artikel |
4 |
A New Vertex Coloring Heuristic and Corresponding Chromatic Number
|
Zaker, Manouchehr |
|
|
82 |
9 |
p. 2395-2414 |
artikel |
5 |
Compression of Dynamic Graphs Generated by a Duplication Model
|
Turowski, Krzysztof |
|
|
82 |
9 |
p. 2687-2707 |
artikel |
6 |
Independent Set Reconfiguration Parameterized by Modular-Width
|
Belmonte, Rémy |
|
|
82 |
9 |
p. 2586-2605 |
artikel |
7 |
On the Approximability of the Stable Matching Problem with Ties of Size Two
|
Chiang, Robert |
|
|
82 |
9 |
p. 2668-2686 |
artikel |
8 |
On the Tractability of Optimization Problems on H-Graphs
|
Fomin, Fedor V. |
|
|
82 |
9 |
p. 2432-2473 |
artikel |
9 |
Parameterized Multi-Scenario Single-Machine Scheduling Problems
|
Hermelin, Danny |
|
|
82 |
9 |
p. 2644-2667 |
artikel |
10 |
Queue Layouts of Planar 3-Trees
|
Alam, Jawaherul Md. |
|
|
82 |
9 |
p. 2564-2585 |
artikel |
11 |
The Approximability of Multiple Facility Location on Directed Networks with Random Arc Failures
|
Hassin, Refael |
|
|
82 |
9 |
p. 2474-2501 |
artikel |
12 |
The Complexity of Tree Partitioning
|
An, Zhao |
|
|
82 |
9 |
p. 2606-2643 |
artikel |