Andreas Wiese
Andreas Wiese
Adjoint Professor
Preverjeni e-poštni naslov na dii.uchile.cl
A generalized parallel task model for recurrent real-time processes
S Baruah, V Bonifaci, A Marchetti-Spaccamela, L Stougie, A Wiese
RTSS’12: proceedings of the 33rd IEEE real-time systems symposium, 2012
Feasibility analysis in the sporadic dag task model
V Bonifaci, A Marchetti-Spaccamela, S Stiller, A Wiese
2013 25th Euromicro conference on real-time systems, 225-233, 2013
Optimal movement of mobile sensors for barrier coverage of a planar region
B Bhattacharya, M Burmester, Y Hu, E Kranakis, Q Shi, A Wiese
Theoretical Computer Science 410 (52), 5515-5528, 2009
Approximation Schemes for Maximum Weight Independent Set of Rectangles
A Adamaszek, A Wiese
arXiv preprint arXiv:1307.1774, 2013
A constant-factor approximation algorithm for unsplittable flow on paths
P Bonsma, J Schulz, A Wiese
SIAM journal on computing 43 (2), 767-799, 2014
Scheduling and fixed-parameter tractability
M Mnich, A Wiese
Mathematical Programming 154 (1), 533-562, 2015
Communication in wireless networks with directional antennas
I Caragiannis, C Kaklamanis, E Kranakis, D Krizanc, A Wiese
Proceedings of the twentieth annual symposium on Parallelism in algorithms …, 2008
On the configuration-LP for scheduling on unrelated machines
J Verschae, A Wiese
Journal of Scheduling 17, 371-383, 2014
A mazing 2+ ε approximation for unsplittable flow on a path
A Anagnostopoulos, F Grandoni, S Leonardi, A Wiese
ACM Transactions on Algorithms (TALG) 14 (4), 1-23, 2018
Scheduling periodic tasks in a hard real-time environment
N Hähnle, F Eisenbrand, J Verschae, A Wiese, M Niemeier, M Skutella
37th International Colloquium on Automata, Languages and Programming …, 2010
A quasi-PTAS for the two-dimensional geometric knapsack problem
A Adamaszek, A Wiese
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete …, 2014
Identification of key player genes in gene regulatory networks
M Nazarieh, A Wiese, T Will, M Hamed, V Helms
BMC Systems Biology 10, 1-12, 2016
Polynomial-time exact schedulability tests for harmonic real-time tasks
V Bonifaci, A Marchetti-Spaccamela, N Megow, A Wiese
2013 IEEE 34th Real-Time Systems Symposium, 236-245, 2013
New approximation schemes for unsplittable flow on a path
J Batra, N Garg, A Kumar, T Mömke, A Wiese
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete …, 2014
Packet routing: Complexity and algorithms
B Peis, M Skutella, A Wiese
Approximation and Online Algorithms: 7th International Workshop, WAOA 2009 …, 2010
Solving an avionics real-time scheduling problem by advanced IP-methods
F Eisenbrand, K Kesavan, R Mattikalli, M Niemeier, A Nordsieck, ...
Algorithms–ESA 2010, 11-22, 2010
A QPTAS for maximum weight independent set of polygons with polylogarithmically many vertices
A Adamaszek, A Wiese
Proceedings of the twenty-fifth annual ACM-SIAM symposium on Discrete …, 2014
Approximating geometric knapsack via L-packings
W Gálvez, F Grandoni, S Heydrich, S Ingala, A Khan, A Wiese
2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS …, 2017
Partitioned EDF scheduling on a few types of unrelated multiprocessors
A Wiese, V Bonifaci, S Baruah
The University of North Carolina, Tech. Rep, 2012
Approximation schemes for independent set and sparse subsets of polygons
A Adamaszek, S Har-Peled, A Wiese
Journal of the ACM (JACM) 66 (4), 1-40, 2019
Sistem trenutno ne more izvesti postopka. Poskusite znova pozneje.
Članki 1–20