| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A Faster Interior-Point Method for Sum-of-Squares Optimization
|
Jiang, Shunhua
|
|
|
85 |
9 |
p. 2843-2884
|
artikel
|
| 2 |
Bitonic st-Orderings for Upward Planar Graphs: Splits and Bends in the Variable Embedding Scenario
|
Angelini, Patrizio
|
|
|
85 |
9 |
p. 2667-2692
|
artikel
|
| 3 |
Computing Bend-Minimum Orthogonal Drawings of Plane Series–Parallel Graphs in Linear Time
|
Didimo, Walter
|
|
|
85 |
9 |
p. 2605-2666
|
artikel
|
| 4 |
Induced Disjoint Paths and Connected Subgraphs for H-Free Graphs
|
Martin, Barnaby
|
|
|
85 |
9 |
p. 2580-2604
|
artikel
|
| 5 |
MAX CUT in Weighted Random Intersection Graphs and Discrepancy of Sparse Random Set Systems
|
Nikoletseas, Sotiris
|
|
|
85 |
9 |
p. 2817-2842
|
artikel
|
| 6 |
Max-3-Lin Over Non-abelian Groups with Universal Factor Graphs
|
Bhangale, Amey
|
|
|
85 |
9 |
p. 2693-2734
|
artikel
|
| 7 |
Monotone Arithmetic Complexity of Graph Homomorphism Polynomials
|
Komarath, Balagopal
|
|
|
85 |
9 |
p. 2554-2579
|
artikel
|
| 8 |
Public Bayesian Persuasion: Being Almost Optimal and Almost Persuasive
|
Castiglioni, Matteo
|
|
|
85 |
9 |
p. 2885-2921
|
artikel
|
| 9 |
Reconfiguration of Spanning Trees with Degree Constraints or Diameter Constraints
|
Bousquet, Nicolas
|
|
|
85 |
9 |
p. 2779-2816
|
artikel
|
| 10 |
Tight Approximation Algorithms for Geometric Bin Packing with Skewed Items
|
Khan, Arindam
|
|
|
85 |
9 |
p. 2735-2778
|
artikel
|
| 11 |
Transmitting Once to Elect a Leader on Wireless Networks
|
Ravelomanana, Vlady
|
|
|
85 |
9 |
p. 2529-2553
|
artikel
|
Tijdschrift beschrijving