Referenzen
| 65. |
Analysis of Ward's method
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms
, Seite 2939--2957.
Herausgeber: SIAM, Philadelphia, PA,
2019
|
| 64. |
New deterministic algorithms for solving parity games
Discrete Optim.,
30:73--95
2018
|
| 63. |
The alternating stock size problem and the gasoline puzzle
ACM Trans. Algorithms,
14(2):Art. 19, 23
2018
DOI: 10.1145/3178539
|
| 62. |
Probabilistic analysis of online (class-constrained) bin packing and bin covering
LATIN 2018: Theoretical informatics Band 10807
aus Lecture Notes in Comput. Sci.
Seite 461--474.
Herausgeber: Springer, Cham,
2018
|
| 61. |
Improved analysis of complete-linkage clustering
Algorithmica,
78(4):1131--1150
2017
|
| 60. |
Polynomial kernels for weighted problems
J. Comput. System Sci.,
84:1--10
2017
|
| 59. |
Smoothed analysis of local search for the maximum-cut problem
ACM Trans. Algorithms,
13(2):Art. 25, 12
2017
DOI: 10.1145/3011870
|
| 58. |
The smoothed number of Pareto-optimal solutions in non-integer bicriteria optimization
Theory and applications of models of computation Band 10185
aus Lecture Notes in Comput. Sci.
Seite 543--555.
Herausgeber: Springer, Cham,
2017
|
| 57. |
Smoothed analysis of the 2-opt algorithm for the general TSP
ACM Trans. Algorithms,
13(1):Art. 10, 15
2016
DOI: 10.1145/2972953
|
| 56. |
New deterministic algorithms for solving parity games
LATIN 2016: theoretical informatics Band 9644
aus Lecture Notes in Comput. Sci.
Seite 634--645.
Herausgeber: Springer, Berlin,
2016
|
| 55. |
Probabilistic analysis of the dual next-fit algorithm for bin covering
LATIN 2016: theoretical informatics Band 9644
aus Lecture Notes in Comput. Sci.
Seite 469--482.
Herausgeber: Springer, Berlin,
2016
|
| 54. |
The alternating stock size problem and the gasoline puzzle
24th Annual European Symposium on Algorithms Band 57
aus LIPIcs. Leibniz Int. Proc. Inform.
Seite Art. No. 71, 16.
Herausgeber: Schloss Dagstuhl. Leibniz-Zent. Inform., Wadern,
2016
|