default search action
Andreas Wiese
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j31]Arindam Khan, Aditya Subramanian, Andreas Wiese:
A PTAS for the horizontal rectangle stabbing problem. Math. Program. 206(1): 607-630 (2024) - [j30]Arturo Merino
, Andreas Wiese
On the Two-Dimensional Knapsack Problem for Convex Polygons. ACM Trans. Algorithms 20(2): 16 (2024) - [c84]Moritz Buchem, Franziska Eberle, Hugo Kooki Kasuya Rosado, Kevin Schewior, Andreas Wiese:
Scheduling on a Stochastic Number of Machines. APPROX/RANDOM 2024: 14:1-14:15 - [c83]Moritz Buchem, Paul Deuker
Approximating the Geometric Knapsack Problem in Near-Linear Time and Dynamically. SoCG 2024: 26:1-26:14 - [c82]Pritam Acharya, Sujoy Bhore, Aaryan Gupta, Arindam Khan, Bratin Mondal, Andreas Wiese:
Approximation Schemes for Geometric Knapsack for Packing Spheres and Fat Objects. ICALP 2024: 8:1-8:20 - [c81]Mohit Jain
A Deadline-Aware Scheduler for Smart Factory using WiFi 6. MobiHoc 2024: 221-230 - [c80]Moritz Buchem, Katja Ettmayr, Hugo K. K. Rosado, Andreas Wiese:
A (3 + ɛ)-approximation algorithm for the minimum sum of radii problem with outliers and extensions for generalized lower bounds. SODA 2024: 1738-1765 - [c79]Alexander Armbruster, Lars Rohwedder, Andreas Wiese:
Simpler constant factor approximation algorithms for weighted flow time - now for any p-norm. SOSA 2024: 63-81 - [e3]José A. Soto
LATIN 2024: Theoretical Informatics - 16th Latin American Symposium, Puerto Varas, Chile, March 18-22, 2024, Proceedings, Part I. Lecture Notes in Computer Science 14578, Springer 2024, ISBN 978-3-031-55597-8 [contents] - [e2]José A. Soto
LATIN 2024: Theoretical Informatics - 16th Latin American Symposium, Puerto Varas, Chile, March 18-22, 2024, Proceedings, Part II. Lecture Notes in Computer Science 14579, Springer 2024, ISBN 978-3-031-55600-5 [contents] - [i43]Arindam Khan, Aditya Subramanian, Tobias Widmann, Andreas Wiese:
On Approximation Schemes for Stabbing Rectilinear Polygons. CoRR abs/2402.02412 (2024) - [i42]Moritz Buchem, Paul Deuker, Andreas Wiese:
Approximating the Geometric Knapsack Problem in Near-Linear Time and Dynamically. CoRR abs/2403.00536 (2024) - [i41]Pritam Acharya, Sujoy Bhore, Aaryan Gupta, Arindam Khan, Bratin Mondal, Andreas Wiese:
Approximation Schemes for Geometric Knapsack for Packing Spheres and Fat Objects. CoRR abs/2404.03981 (2024) - [i40]Moritz Buchem, Franziska Eberle, Hugo Kooki Kasuya Rosado, Kevin Schewior, Andreas Wiese:
Scheduling on a Stochastic Number of Machines. CoRR abs/2407.15737 (2024) - [i39]Mohit Jain, Anis Mishra, Syamantak Das, Andreas Wiese, Arani Bhattacharya, Mukulika Maity:
A Deadline-Aware Scheduler for Smart Factory using WiFi 6. CoRR abs/2408.12274 (2024) - 2023
- [j29]Andrés Cristi
Fixed-Parameter Algorithms for Unsplittable Flow Cover. Theory Comput. Syst. 67(1): 89-124 (2023) - [c78]Arindam Khan, Aditya Lonkar, Saladi Rahul, Aditya Subramanian, Andreas Wiese:
Online and Dynamic Algorithms for Geometric Set Cover and Hitting Set. SoCG 2023: 46:1-46:17 - [c77]Martijn van Ee, Tim Oosterwijk, René Sitters, Andreas Wiese:
Exact and Approximation Algorithms for Routing a Convoy Through a Graph. MFCS 2023: 86:1-86:15 - [c76]MohammadHossein Bateni, Hossein Esfandiari, Hendrik Fichtenberger, Monika Henzinger, Rajesh Jayaram, Vahab Mirrokni, Andreas Wiese:
Optimal Fully Dynamic k-Center Clustering for Adaptive and Oblivious Adversaries. SODA 2023: 2677-2727 - [c75]Alexander Armbruster, Lars Rohwedder
A PTAS for Minimizing Weighted Flow Time on a Single Machine. STOC 2023: 1335-1344 - [e1]Jaroslaw Byrka, Andreas Wiese:
Approximation and Online Algorithms - 21st International Workshop, WAOA 2023, Amsterdam, The Netherlands, September 7-8, 2023, Proceedings. Lecture Notes in Computer Science 14297, Springer 2023, ISBN 978-3-031-49814-5 [contents] - [i38]Arindam Khan, Aditya Lonkar, Saladi Rahul, Aditya Subramanian, Andreas Wiese:
Online and Dynamic Algorithms for Geometric Set Cover and Hitting Set. CoRR abs/2303.09524 (2023) - [i37]MohammadHossein Bateni, Hossein Esfandiari, Hendrik Fichtenberger, Monika Henzinger, Rajesh Jayaram, Vahab Mirrokni, Andreas Wiese:
Optimal Fully Dynamic k-Center Clustering for Adaptive and Oblivious Adversaries. CoRR abs/2303.11843 (2023) - [i36]Alexander Armbruster, Lars Rohwedder, Andreas Wiese:
Simpler constant factor approximation algorithms for weighted flow time - now for any p-norm. CoRR abs/2308.06209 (2023) - [i35]Moritz Buchem, Katja Ettmayr, Hugo K. K. Rosado, Andreas Wiese:
A (3+ε)-approximation algorithm for the minimum sum of radii problem with outliers and extensions for generalized lower bounds. CoRR abs/2311.06111 (2023) - 2022
- [c74]Syamantak Das, Andreas Wiese:
A Simpler QPTAS for Scheduling Jobs with Precedence Constraints. ESA 2022: 40:1-40:11 - [c73]Debajyoti Kar, Arindam Khan, Andreas Wiese:
Approximation Algorithms for Round-UFP and Round-SAP. ESA 2022: 71:1-71:19 - [c72]Arindam Khan, Aditya Lonkar, Arnab Maiti, Amatya Sharma
Tight Approximation Algorithms for Two-Dimensional Guillotine Strip Packing. ICALP 2022: 80:1-80:20 - [c71]Arindam Khan, Aditya Subramanian, Andreas Wiese:
A PTAS for the Horizontal Rectangle Stabbing Problem. IPCO 2022: 361-374 - [c70]Waldo Gálvez, Arindam Khan, Mathieu Mari, Tobias Mömke, Madhusudhan Reddy Pittu, Andreas Wiese:
A 3-Approximation Algorithm for Maximum Independent Set of Rectangles. SODA 2022: 894-905 - [c69]Fabrizio Grandoni, Tobias Mömke, Andreas Wiese:
Unsplittable Flow on a Path: The Game!. SODA 2022: 906-926 - [c68]Fabrizio Grandoni
A PTAS for unsplittable flow on a path. STOC 2022: 289-302 - [i34]Debajyoti Kar, Arindam Khan, Andreas Wiese:
Approximation Algorithms for ROUND-UFP and ROUND-SAP. CoRR abs/2202.03492 (2022) - [i33]Arindam Khan, Aditya Lonkar, Arnab Maiti, Amatya Sharma, Andreas Wiese:
Tight Approximation Algorithms for Two Dimensional Guillotine Strip Packing. CoRR abs/2202.05989 (2022) - [i32]Alexander Armbruster, Lars Rohwedder, Andreas Wiese:
A PTAS for Minimizing Weighted Flow Time on a Single Machine. CoRR abs/2208.03127 (2022) - 2021
- [j28]Waldo Gálvez
Approximating Geometric Knapsack via L-packings. ACM Trans. Algorithms 17(4): 33:1-33:67 (2021) - [c67]Waldo Gálvez
Improved Approximation Algorithms for 2-Dimensional Knapsack: Packing into Multiple L-Shapes, Spirals, and More. SoCG 2021: 39:1-39:17 - [c66]Arindam Khan, Arnab Maiti, Amatya Sharma, Andreas Wiese
On Guillotine Separable Packings for the Two-Dimensional Geometric Knapsack Problem. SoCG 2021: 48:1-48:17 - [c65]Fabrizio Grandoni
Faster (1+ε)-Approximation for Unsplittable Flow on a Path via Resource Augmentation and Back. ESA 2021: 49:1-49:15 - [c64]Tomás Martínez-Muñoz, Andreas Wiese
FPT and FPT-Approximation Algorithms for Unsplittable Flow on Trees. ESA 2021: 67:1-67:15 - [c63]Franziska Eberle, Nicole Megow, Lukas Nölke, Bertrand Simon, Andreas Wiese:
Fully Dynamic Algorithms for Knapsack Problems with Polylogarithmic Update Time. FSTTCS 2021: 18:1-18:17 - [c62]Moritz Buchem, Lars Rohwedder
Additive Approximation Schemes for Load Balancing Problems. ICALP 2021: 42:1-42:17 - [c61]Lars Rohwedder
A (2 + ε)-approximation algorithm for preemptive weighted flow time on a single machine. STOC 2021: 1042-1055 - [i31]Arindam Khan, Arnab Maiti, Amatya Sharma
On Guillotine Separable Packings for the Two-dimensional Geometric Knapsack Problem. CoRR abs/2103.09735 (2021) - [i30]Waldo Gálvez, Fabrizio Grandoni, Arindam Khan, Diego Ramírez-Romero, Andreas Wiese:
Improved Approximation Algorithms for 2-Dimensional Knapsack: Packing into Multiple L-Shapes, Spirals, and More. CoRR abs/2103.10406 (2021) - [i29]Waldo Gálvez, Arindam Khan, Mathieu Mari, Tobias Mömke, Madhusudhan Reddy Pittu, Andreas Wiese:
A 4-Approximation Algorithm for Maximum Independent Set of Rectangles. CoRR abs/2106.00623 (2021) - [i28]Arindam Khan, Aditya Subramanian, Andreas Wiese:
A PTAS for the horizontal rectangle stabbing problem. CoRR abs/2111.05197 (2021) - [i27]Hendrik Fichtenberger, Monika Henzinger, Andreas Wiese:
On fully dynamic constant-factor approximation algorithms for clustering problems. CoRR abs/2112.07217 (2021) - 2020
- [j27]Michal Pilipczuk, Erik Jan van Leeuwen, Andreas Wiese
Quasi-Polynomial Time Approximation Schemes for Packing and Covering Problems in Planar Graphs. Algorithmica 82(6): 1703-1739 (2020) - [j26]Victor Verdugo
Breaking symmetries to rescue sum of squares in the case of makespan scheduling. Math. Program. 183(1): 583-618 (2020) - [j25]Hans Raj Tiwary
On the extension complexity of scheduling polytopes. Oper. Res. Lett. 48(4): 472-479 (2020) - [c60]Monika Henzinger
Dynamic Approximate Maximum Independent Set of Intervals, Hypercubes and Hyperrectangles. SoCG 2020: 51:1-51:14 - [c59]Arturo Merino
On the Two-Dimensional Knapsack Problem for Convex Polygons. ICALP 2020: 84:1-84:16 - [c58]Tobias Mömke
Breaking the Barrier of 2 for the Storage Allocation Problem. ICALP 2020: 86:1-86:19 - [c57]Andrés Cristi, Mathieu Mari, Andreas Wiese
Fixed-Parameter Algorithms for Unsplittable Flow Cover. STACS 2020: 42:1-42:17 - [c56]Andrés Cristi, Andreas Wiese
Better Approximations for General Caching and UFP-Cover Under Resource Augmentation. STACS 2020: 44:1-44:14 - [i26]Monika Henzinger, Stefan Neumann, Andreas Wiese:
Explicit and Implicit Dynamic Coloring of Graphs with Bounded Arboricity. CoRR abs/2002.10142 (2020) - [i25]Monika Henzinger, Stefan Neumann, Andreas Wiese:
Dynamic Approximate Maximum Independent Set of Intervals, Hypercubes and Hyperrectangles. CoRR abs/2003.02605 (2020) - [i24]Martin Böhm, Franziska Eberle, Nicole Megow, Lukas Nölke, Jens Schlöter, Bertrand Simon, Andreas Wiese:
Fully Dynamic Algorithms for Knapsack Problems with Polylogarithmic Update Time. CoRR abs/2007.08415 (2020) - [i23]Moritz Buchem, Lars Rohwedder, Tjark Vredeveld, Andreas Wiese:
Additive Approximation Schemes for Load Balancing Problems. CoRR abs/2007.09333 (2020) - [i22]Arturo Merino
On the Two-Dimensional Knapsack Problem for Convex Polygons. CoRR abs/2007.16144 (2020) - [i21]Lars Rohwedder, Andreas Wiese:
A (2+ε)-approximation algorithm for preemptive weighted flow time on a single machine. CoRR abs/2011.05676 (2020)
2010 – 2019
- 2019
- [j24]Anna Adamaszek, Sariel Har-Peled
Approximation Schemes for Independent Set and Sparse Subsets of Polygons. J. ACM 66(4): 29:1-29:40 (2019) - [j23]Sandy Heydrich
Faster Approximation Schemes for the Two-Dimensional Knapsack Problem. ACM Trans. Algorithms 15(4): 47:1-47:28 (2019) - [j22]Vincenzo Bonifaci
A Generalized Parallel Task Model for Recurrent Real-Time Processes. ACM Trans. Parallel Comput. 6(1): 3:1-3:40 (2019) - [c55]Fabrizio Grandoni
Parameterized Approximation Schemes for Independent Set of Rectangles and Geometric Knapsack. ESA 2019: 53:1-53:16 - [c54]Fabrizio Grandoni
Packing Cars into Narrow Roads: PTASs for Limited Supply Highway. ESA 2019: 54:1-54:14 - [i20]Hans Raj Tiwary, Victor Verdugo, Andreas Wiese:
On the extension complexity of scheduling. CoRR abs/1902.10271 (2019) - [i19]Fabrizio Grandoni, Stefan Kratsch, Andreas Wiese:
Parameterized Approximation Schemes for Independent Set of Rectangles and Geometric Knapsack. CoRR abs/1906.10982 (2019) - [i18]Tobias Mömke, Andreas Wiese:
Breaking the Barrier of 2 for the Storage Allocation Problem. CoRR abs/1911.10871 (2019) - 2018
- [j21]Andreas Wiese
Independent Set of Convex Polygons: From $$n^{\epsilon }$$ n ϵ to $$1+\epsilon $$ 1 + ϵ via Shrinking. Algorithmica 80(3): 918-934 (2018) - [j20]Wiebke Höhn, Julián Mestre, Andreas Wiese
How Unsplittable-Flow-Covering Helps Scheduling with Job-Dependent Cost Functions. Algorithmica 80(4): 1191-1213 (2018) - [j19]Adam Kurpisz
Semidefinite and linear programming integrality gaps for scheduling identical machines. Math. Program. 172(1-2): 231-248 (2018) - [j18]Anna Adamaszek, Parinya Chalermsook, Alina Ene, Andreas Wiese
Submodular unsplittable flow on trees. Math. Program. 172(1-2): 565-589 (2018) - [j17]Aris Anagnostopoulos
A Mazing 2+ϵ Approximation for Unsplittable Flow on a Path. ACM Trans. Algorithms 14(4): 55:1-55:23 (2018) - [c53]Andreas Wiese
Fixed-Parameter Approximation Schemes for Weighted Flowtime. APPROX-RANDOM 2018: 28:1-28:19 - [c52]Michal Pilipczuk
Quasi-Polynomial Time Approximation Schemes for Packing and Covering Problems in Planar Graphs. ESA 2018: 65:1-65:13 - [c51]Fabrizio Grandoni
A (5/3 + ε)-approximation for unsplittable flow on a path: placing small tasks into boxes. STOC 2018: 607-619 - [i17]Michal Pilipczuk, Erik Jan van Leeuwen, Andreas Wiese:
Quasi-polynomial time approximation schemes for packing and covering problems in planar graphs. CoRR abs/1807.07626 (2018) - 2017
- [c50]Syamantak Das, Andreas Wiese:
On Minimizing the Makespan When Some Jobs Cannot Be Assigned on the Same Machine. ESA 2017: 31:1-31:14 - [c49]Waldo Gálvez
Approximating Geometric Knapsack via L-Packings. FOCS 2017: 260-271 - [c48]Antonios Antoniadis, Ruben Hoeksma
A QPTAS for the General Scheduling Problem with Identical Release Dates. ICALP 2017: 31:1-31:14 - [c47]Andreas Wiese
A (1+epsilon)-Approximation for Unsplittable Flow on a Path in Fixed-Parameter Running Time. ICALP 2017: 67:1-67:13 - [c46]Michal Pilipczuk
Approximation and Parameterized Algorithms for Geometric Independent Set with Shrinking. MFCS 2017: 42:1-42:13 - [c45]Sandy Heydrich, Andreas Wiese
Faster approximation schemes for the two-dimensional knapsack problem. SODA 2017: 79-98 - [c44]Fabrizio Grandoni
To Augment or Not to Augment: Solving Unsplittable Flow on a Path by Creating Slack. SODA 2017: 2411-2422 - [i16]Anna Adamaszek, Sariel Har-Peled
Approximation Schemes for Independent Set and Sparse Subsets of Polygons. CoRR abs/1703.04758 (2017) - [i15]Waldo Gálvez, Fabrizio Grandoni, Sandy Heydrich, Salvatore Ingala, Arindam Khan
Approximating Geometric Knapsack via L-packings. CoRR abs/1711.07710 (2017) - 2016
- [j16]Maryam Nazarieh
Identification of key player genes in gene regulatory networks. BMC Syst. Biol. 10: 88 (2016) - [j15]Nicole Megow, Martin Skutella, José Verschae, Andreas Wiese
The Power of Recourse for Online MST and TSP. SIAM J. Comput. 45(3): 859-880 (2016) - [j14]Elisabeth Lübbecke, Olaf Maurer, Nicole Megow
A New Approach to Online Scheduling: Approximating the Optimal Competitive Ratio. ACM Trans. Algorithms 13(1): 15:1-15:34 (2016) - [c43]Stefan Neumann
This House Proves That Debating is Harder Than Soccer. FUN 2016: 25:1-25:14 - [c42]Adam Kurpisz
Semidefinite and Linear Programming Integrality Gaps for Scheduling Identical Machines. IPCO 2016: 152-163 - [c41]Anna Adamaszek
Submodular Unsplittable Flow on Trees. IPCO 2016: 337-349 - [c40]Andreas Wiese:
Independent Set of Convex Polygons: From nϵ to 1+ϵ via Shrinking. LATIN 2016: 700-711 - [c39]Giorgi Nadiradze, Andreas Wiese
On approximating strip packing with a better ratio than 3/2. SODA 2016: 1491-1510 - [i14]Stefan Neumann, Andreas Wiese:
This House Proves that Debating is Harder than Soccer. CoRR abs/1605.03063 (2016) - [i13]Michal Pilipczuk, Erik Jan van Leeuwen, Andreas Wiese:
Approximation and parameterized algorithms for geometric independent set with shrinking. CoRR abs/1611.06501 (2016) - 2015
- [j13]Martin Niemeier, Andreas Wiese
Scheduling with an Orthogonal Resource Constraint. Algorithmica 71(4): 837-858 (2015) - [j12]Alberto Marchetti-Spaccamela
Assigning sporadic tasks to unrelated machines. Math. Program. 152(1-2): 247-274 (2015) - [j11]Matthias Mnich
Scheduling and fixed-parameter tractability. Math. Program. 154(1-2): 533-562 (2015) - [c38]Fidaa Abed
On Guillotine Cutting Sequences. APPROX-RANDOM 2015: 1-19 - [c37]Anna Adamaszek
How to Tame Rectangles: Solving Independent Set and Coloring of Rectangles via Shrinking. APPROX-RANDOM 2015: 43-60 - [c36]Tobias Mömke, Andreas Wiese:
A (2+\epsilon ) ( 2 + ϵ ) -Approximation Algorithm for the Storage Allocation Problem. ICALP (1) 2015: 973-984 - [c35]Jatin Batra, Naveen Garg
New Approximation Schemes for Unsplittable Flow on a Path. SODA 2015: 47-58 - [c34]Anna Adamaszek
A quasi-PTAS for the Two-Dimensional Geometric Knapsack Problem. SODA 2015: 1491-1505 - 2014
- [j10]José Verschae, Andreas Wiese
On the configuration-LP for scheduling on unrelated machines. J. Sched. 17(4): 371-383 (2014) - [j9]Paul S. Bonsma, Jens Schulz, Andreas Wiese
A Constant-Factor Approximation Algorithm for Unsplittable Flow on Paths. SIAM J. Comput. 43(2): 767-799 (2014) - [c33]Wiebke Höhn, Julián Mestre, Andreas Wiese
How Unsplittable-Flow-Covering Helps Scheduling with Job-Dependent Cost Functions. ICALP (1) 2014: 625-636 - [c32]Matthias Mnich
Scheduling and Fixed-Parameter Tractability. IPCO 2014: 381-392 - [c31]Aris Anagnostopoulos, Fabrizio Grandoni
A Mazing 2+∊ Approximation for Unsplittable Flow on a Path. SODA 2014: 26-41 - [c30]Anna Adamaszek
A QPTAS for Maximum Weight Independent Set of Polygons with Polylogarithmically Many Vertices. SODA 2014: 645-656 - [i12]Wiebke Höhn, Julián Mestre, Andreas Wiese:
How Unsplittable-Flow-Covering helps Scheduling with Job-Dependent Cost Functions. CoRR abs/1403.1376 (2014) - 2013
- [j8]Andreas Wiese, Vincenzo Bonifaci
Partitioned EDF scheduling on a few types of unrelated multiprocessors. Real Time Syst. 49(2): 219-238 (2013) - [c29]Vincenzo Bonifaci
Feasibility Analysis in the Sporadic DAG Task Model. ECRTS 2013: 225-233 - [c28]Anna Adamaszek
Approximation Schemes for Maximum Weight Independent Set of Rectangles. FOCS 2013: 400-409 - [c27]Aris Anagnostopoulos
Constant Integrality Gap LP Formulations of Unsplittable Flow on a Path. IPCO 2013: 25-36 - [c26]Maxim Sviridenko, Andreas Wiese
Approximating the Configuration-LP for Minimizing Weighted Sum of Completion Times on Unrelated Machines. IPCO 2013: 387-398 - [c25]Vincenzo Bonifaci
Polynomial-Time Exact Schedulability Tests for Harmonic Real-Time Tasks. RTSS 2013: 236-245 - [c24]Elisabeth Günther, Olaf Maurer, Nicole Megow, Andreas Wiese:
A New Approach to Online Scheduling: Approximating the Optimal Competitive Ratio. SODA 2013: 118-128 - [i11]Nicole Megow, Andreas Wiese:
Competitive-Ratio Approximation Schemes for Minimizing the Makespan in the Online-List Model. CoRR abs/1303.1912 (2013) - [i10]Anna Adamaszek, Andreas Wiese:
Approximation Schemes for Maximum Weight Independent Set of Rectangles. CoRR abs/1307.1774 (2013) - [i9]Anna Adamaszek, Andreas Wiese:
A QPTAS for Maximum Weight Independent Set of Polygons with Polylogarithmically Many Vertices. CoRR abs/1307.4257 (2013) - [i8]Matthias Mnich, Andreas Wiese:
Scheduling Meets Fixed-Parameter Tractability. CoRR abs/1311.4021 (2013) - 2012
- [c23]Alberto Marchetti-Spaccamela
Assigning Sporadic Tasks to Unrelated Parallel Machines. ICALP (1) 2012: 665-676 - [c22]Nicole Megow
The Power of Recourse for Online MST and TSP. ICALP (1) 2012: 689-700 - [c21]Sanjoy K. Baruah, Vincenzo Bonifaci
A Generalized Parallel Task Model for Recurrent Real-time Processes. RTSS 2012: 63-72 - [c20]Martin Niemeier, Andreas Wiese:
Scheduling with an Orthogonal Resource Constraint. WAOA 2012: 242-256 - [i7]Elisabeth Günther, Olaf Maurer, Nicole Megow, Andreas Wiese:
A New Approach to Online Scheduling: Approximating the Optimal Competitive Ratio. CoRR abs/1204.0897 (2012) - [i6]Vincenzo Bonifaci, Andreas Wiese:
Scheduling Unrelated Machines of Few Different Types. CoRR abs/1205.0974 (2012) - [i5]Aris Anagnostopoulos, Fabrizio Grandoni, Stefano Leonardi, Andreas Wiese:
A Mazing 2+eps Approximation for Unsplittable Flow on a Path. CoRR abs/1211.2670 (2012) - [i4]Vincenzo Bonifaci, Alberto Marchetti-Spaccamela, Sebastian Stiller, Andreas Wiese:
Feasibility Tests for Recurrent Real-Time Tasks in the Sporadic DAG Model. CoRR abs/1212.2778 (2012) - 2011
- [b1]Andreas Wiese:
Packet routing and scheduling. Berlin Institute of Technology, 2011, ISBN 978-3-86955-827-1, pp. 1-207 - [j7]Marja Hassinen, Joel Kaasinen, Evangelos Kranakis
Analysing local algorithms in location-aware quasi-unit-disk graphs. Discret. Appl. Math. 159(15): 1566-1580 (2011) - [j6]Friedrich Eisenbrand, Martin Niemeier, Martin Skutella, José Verschae, Andreas Wiese:
Real-time Avionics Optimization. it Inf. Technol. 53(6): 274-279 (2011) - [j5]Iyad A. Kanj, Andreas Wiese
Local algorithms for edge colorings in UDGs. Theor. Comput. Sci. 412(35): 4704-4714 (2011) - [c19]Martin Niemeier, Andreas Wiese, Sanjoy K. Baruah:
Partitioned Real-time Scheduling on Heterogeneous Shared-Memory Multiprocessors. ECRTS 2011: 115-124 - [c18]José Verschae, Andreas Wiese:
On the Configuration-LP for Scheduling on Unrelated Machines. ESA 2011: 530-542 - [c17]Paul S. Bonsma, Jens Schulz, Andreas Wiese:
A Constant Factor Approximation Algorithm for Unsplittable Flow on Paths. FOCS 2011: 47-56 - [c16]Britta Peis, Andreas Wiese:
Universal Packet Routing with Arbitrary Bandwidths and Transit Times. IPCO 2011: 362-375 - [i3]Paul S. Bonsma, Jens Schulz, Andreas Wiese:
A Constant Factor Approximation Algorithm for Unsplittable Flow on Paths. CoRR abs/1102.3643 (2011) - 2010
- [c15]Friedrich Eisenbrand, Karthikeyan Kesavan, Raju S. Mattikalli, Martin Niemeier, Arnold W. Nordsieck, Martin Skutella, José Verschae, Andreas Wiese:
Solving an Avionics Real-Time Scheduling Problem by Advanced IP-Methods. ESA (1) 2010: 11-22 - [c14]Friedrich Eisenbrand, Nicolai Hähnle, Martin Niemeier, Martin Skutella, José Verschae, Andreas Wiese:
Scheduling Periodic Tasks in a Hard Real-Time Environment. ICALP (1) 2010: 299-311 - [c13]Britta Peis, Sebastian Stiller, Andreas Wiese:
Policies for Periodic Packet Routing. ISAAC (2) 2010: 266-278 - [c12]Sebastian Stiller, Andreas Wiese:
Increasing Speed Scheduling and Flow Scheduling. ISAAC (2) 2010: 279-290 - [c11]Britta Peis, Martin Skutella, Andreas Wiese:
Packet Routing on the Grid. LATIN 2010: 120-130 - [c10]Britta Peis, Andreas Wiese:
Throughput Maximization for Periodic Packet Routing on Trees and Grids. WAOA 2010: 213-224 - [i2]Friedrich Eisenbrand, Nicolai Hähnle, Martin Niemeier, Martin Skutella, José Verschae, Andreas Wiese:
Scheduling periodic tasks in a hard real-time environment. Scheduling 2010 - [i1]José Verschae, Andreas Wiese:
On the Configuration-LP for Scheduling on Unrelated Machines. CoRR abs/1011.4957 (2010)
2000 – 2009
- 2009
- [j4]Andreas Wiese, Evangelos Kranakis:
Local PTAS for Independent Set and Vertex Cover in Location Aware Unit Disk Graphs? Ad Hoc Sens. Wirel. Networks 7(3-4): 273-293 (2009) - [j3]Andreas Wiese
Local Construction and Coloring of Spanners of Location Aware Unit Disk Graphs. Discret. Math. Algorithms Appl. 1(4): 555-588 (2009) - [j2]Binay K. Bhattacharya, Mike Burmester, Yuzhuang Hu, Evangelos Kranakis
Optimal movement of mobile sensors for barrier coverage of a planar region. Theor. Comput. Sci. 410(52): 5515-5528 (2009) - [c9]Ronald Koch, Britta Peis, Martin Skutella, Andreas Wiese:
Real-Time Message Routing and Scheduling. APPROX-RANDOM 2009: 217-230 - [c8]Britta Peis, Martin Skutella, Andreas Wiese:
Packet Routing: Complexity and Algorithms. WAOA 2009: 217-228 - [c7]Iyad A. Kanj, Andreas Wiese, Fenghui Zhang:
Local Algorithms for Edge Colorings in UDGs. WG 2009: 202-213 - 2008
- [j1]Andreas Wiese
Impact of Locality on Location Aware Unit Disk Graphs. Algorithms 1(1): 2-29 (2008) - [c6]Andreas Wiese, Evangelos Kranakis
Local Maximal Matching and Local 2-Approximation for Vertex Cover in UDGs. ADHOC-NOW 2008: 1-14 - [c5]Binay K. Bhattacharya, Mike Burmester, Yuzhuang Hu, Evangelos Kranakis
Optimal Movement of Mobile Sensors for Barrier Coverage of a Planar Region. COCOA 2008: 103-115 - [c4]Andreas Wiese, Evangelos Kranakis
Local PTAS for Independent Set and Vertex Cover in Location Aware Unit Disk Graphs. DCOSS 2008: 415-431 - [c3]Ioannis Caragiannis, Christos Kaklamanis, Evangelos Kranakis
Communication in wireless networks with directional antennas. SPAA 2008: 344-351 - [c2]Andreas Wiese, Evangelos Kranakis
Local PTAS for Dominating and Connected Dominating Set in Location Aware Unit Disk Graphs. WAOA 2008: 227-240 - [c1]Andreas Wiese, Evangelos Kranakis
Local Construction and Coloring of Spanners of Location Aware Unit Disk Graphs. WG 2008: 372-383
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-18 20:49 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: