nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A Constant-Time Algorithm for Middle Levels Gray Codes
|
Mütze, Torsten |
|
|
82 |
5 |
p. 1239-1258 |
artikel |
2 |
An Analysis of Budgeted Parallel Search on Conditional Galton–Watson Trees
|
Avis, David |
|
|
82 |
5 |
p. 1329-1345 |
artikel |
3 |
Computing a Pessimistic Stackelberg Equilibrium with Multiple Followers: The Mixed-Pure Case
|
Coniglio, Stefano |
|
|
82 |
5 |
p. 1189-1238 |
artikel |
4 |
Consensus Strings with Small Maximum Distance and Small Distance Sum
|
Bulteau, Laurent |
|
|
82 |
5 |
p. 1378-1409 |
artikel |
5 |
Dividing Splittable Goods Evenly and With Limited Fragmentation
|
Damaschke, Peter |
|
|
82 |
5 |
p. 1298-1328 |
artikel |
6 |
Energy-Optimal Routes for Battery Electric Vehicles
|
Baum, Moritz |
|
|
82 |
5 |
p. 1490-1546 |
artikel |
7 |
Fully-Online Suffix Tree and Directed Acyclic Word Graph Construction for Multiple Texts
|
Takagi, Takuya |
|
|
82 |
5 |
p. 1346-1377 |
artikel |
8 |
Non-Monochromatic and Conflict-Free Colorings on Tree Spaces and Planar Network Spaces
|
Aronov, Boris |
|
|
82 |
5 |
p. 1081-1100 |
artikel |
9 |
Reachability Oracles for Directed Transmission Graphs
|
Kaplan, Haim |
|
|
82 |
5 |
p. 1259-1276 |
artikel |
10 |
Solving and Sampling with Many Solutions
|
Cardinal, Jean |
|
|
82 |
5 |
p. 1474-1489 |
artikel |
11 |
Stable Matchings with Covering Constraints: A Complete Computational Trichotomy
|
Mnich, Matthias |
|
|
82 |
5 |
p. 1136-1188 |
artikel |
12 |
Stable Matching with Uncertain Linear Preferences
|
Aziz, Haris |
|
|
82 |
5 |
p. 1410-1433 |
artikel |
13 |
Stochastic Dominance and the Bijective Ratio of Online Algorithms
|
Angelopoulos, Spyros |
|
|
82 |
5 |
p. 1101-1135 |
artikel |
14 |
Testing Proximity to Subspaces: Approximate ℓ∞ Minimization in Constant Time
|
Hayashi, Kohei |
|
|
82 |
5 |
p. 1277-1297 |
artikel |
15 |
The Geodesic Farthest-Point Voronoi Diagram in a Simple Polygon
|
Oh, Eunjin |
|
|
82 |
5 |
p. 1434-1473 |
artikel |