Anna Adamaszek

48 papers A* 10A 3B 4C 1Journal 26Unranked 3

Year	Rank	Type	Title / Venue / Authors
2022	J	`jnl`	Almost Tight Bounds for Reordering Buffer Management. SIAM J. Comput. Anna Adamaszek, Artur Czumaj, Matthias Englert, Harald Räcke
2022	J	`jnl`	The Art Gallery Problem is ∃ℝ-complete. J. ACM Mikkel Abrahamsen, Anna Adamaszek, Tillmann Miltzow
2020	J	`jnl`	Almost all trees are almost graceful. Random Struct. Algorithms Anna Adamaszek, Peter Allen, Codrut Grosu, Jan Hladký
2019	J	`jnl`	An ACM Trans. Algorithms Anna Adamaszek, Artur Czumaj, Matthias Englert, Harald Räcke
2019	J	`jnl`	Approximation Schemes for Independent Set and Sparse Subsets of Polygons. J. ACM Anna Adamaszek, Sariel Har-Peled, Andreas Wiese
2018	A	`conf`	Approximating Airports and Railways. STACS Anna Adamaszek, Antonios Antoniadis, Amit Kumar, Tobias Mömke
2018	J	`jnl`	Approximation Schemes for Capacitated Geometric Network Design. SIAM J. Discret. Math. Anna Adamaszek, Artur Czumaj, Andrzej Lingas, Jakub Onufry Wojtaszczyk
2018	J	`jnl`	Fast Fencing. CoRR Mikkel Abrahamsen, Anna Adamaszek, Karl Bringmann, Vincent Cohen-Addad, Mehran Mehr, Eva Rotenberg, Alan Roytman, Mikkel Thorup
2018	A*	`conf`	Fast fencing. STOC Mikkel Abrahamsen, Anna Adamaszek, Karl Bringmann, Vincent Cohen-Addad, Mehran Mehr, Eva Rotenberg, Alan Roytman, Mikkel Thorup
2018	A*	`conf`	New Approximation Algorithms for (1, 2)-TSP. ICALP Anna Adamaszek, Matthias Mnich, Katarzyna Paluch
2018	J	`jnl`	Submodular unsplittable flow on trees. Math. Program. Anna Adamaszek, Parinya Chalermsook, Alina Ene, Andreas Wiese
2018	A*	`conf`	The art gallery problem is ∃ ℝ-complete. STOC Mikkel Abrahamsen, Anna Adamaszek, Tillmann Miltzow
2017	J	`jnl`	Approximation Schemes for Independent Set and Sparse Subsets of Polygons. CoRR Anna Adamaszek, Sariel Har-Peled, Andreas Wiese
2017	J	`jnl`	Hardness of Approximation for Strip Packing. ACM Trans. Comput. Theory Anna Adamaszek, Tomasz Kociumaka, Marcin Pilipczuk, Michal Pilipczuk
2017	A*	`conf`	Irrational Guards are Sometimes Needed. SoCG Mikkel Abrahamsen, Anna Adamaszek, Tillmann Miltzow
2017	J	`jnl`	Irrational Guards are Sometimes Needed. CoRR Mikkel Abrahamsen, Anna Adamaszek, Tillmann Miltzow
2017	J	`jnl`	Reordering buffer management with advice. J. Sched. Anna Adamaszek, Marc P. Renault, Adi Rosén, Rob van Stee
2017	J	`jnl`	The Art Gallery Problem is ∃ℝ-complete. CoRR Mikkel Abrahamsen, Anna Adamaszek, Tillmann Miltzow
2016	A	`conf`	Airports and Railways: Facility Location Meets Network Design. STACS Anna Adamaszek, Antonios Antoniadis, Tobias Mömke
2016	J	`jnl`	Approximation and hardness results for the maximum edge q-coloring problem. J. Discrete Algorithms Anna Adamaszek, Alexandru Popa
2016	J	`jnl`	Hardness of approximation for strip packing. CoRR Anna Adamaszek, Tomasz Kociumaka, Marcin Pilipczuk, Michal Pilipczuk
2016	J	`jnl`	Lower Bounds for Locally Highly Connected Graphs. Graphs Comb. Anna Adamaszek, Michal Adamaszek, Matthias Mnich, Jens M. Schmidt
2016	B	`conf`	Submodular Unsplittable Flow on Trees. IPCO Anna Adamaszek, Parinya Chalermsook, Alina Ene, Andreas Wiese
2015	A*	`conf`	A quasi-PTAS for the Two-Dimensional Geometric Knapsack Problem. SODA Anna Adamaszek, Andreas Wiese
2015	J	`jnl`	Algorithmic and Hardness Results for the Colorful Components Problems. Algorithmica Anna Adamaszek, Alexandru Popa
2015	—	`conf`	How to Tame Rectangles: Solving Independent Set and Coloring of Rectangles via Shrinking. APPROX-RANDOM Anna Adamaszek, Parinya Chalermsook, Andreas Wiese
2014	A*	`conf`	A QPTAS for Maximum Weight Independent Set of Polygons with Polylogarithmically Many Vertices. SODA Anna Adamaszek, Andreas Wiese
2014	B	`conf`	Algorithmic and Hardness Results for the Colorful Components Problems. LATIN Anna Adamaszek, Alexandru Popa
2014	C	`conf`	Approximation and Hardness Results for the Maximum Edges in Transitive Closure Problem. IWOCA Anna Adamaszek, Guillaume Blin, Alexandru Popa
2013	J	`jnl`	A QPTAS for Maximum Weight Independent Set of Polygons with Polylogarithmically Many Vertices. CoRR Anna Adamaszek, Andreas Wiese
2013	J	`jnl`	Algorithmic and Hardness Results for the Colorful Components Problems. CoRR Anna Adamaszek, Alexandru Popa
2013	A*	`conf`	Approximation Schemes for Maximum Weight Independent Set of Rectangles. FOCS Anna Adamaszek, Andreas Wiese
2013	J	`jnl`	Approximation Schemes for Maximum Weight Independent Set of Rectangles. CoRR Anna Adamaszek, Andreas Wiese
2013	B	`conf`	Reordering Buffer Management with Advice. WAOA Anna Adamaszek, Marc P. Renault, Adi Rosén, Rob van Stee
2012	A*	`conf`	An SODA Anna Adamaszek, Artur Czumaj, Matthias Englert, Harald Räcke
2012	—	`—`	Approximation algorithms for geometric, caching and scheduling problems. Anna Adamaszek
2012	A*	`conf`	Optimal online buffer scheduling for block devices. STOC Anna Adamaszek, Artur Czumaj, Matthias Englert, Harald Räcke
2011	A*	`conf`	Almost tight bounds for reordering buffer management. STOC Anna Adamaszek, Artur Czumaj, Matthias Englert, Harald Räcke
2011	—	`conf`	Approximation Schemes for Capacitated Geometric Network Design. ICALP (1) Anna Adamaszek, Artur Czumaj, Andrzej Lingas, Jakub Onufry Wojtaszczyk
2011	J	`jnl`	Uniqueness of Graph Square Roots of Girth Six. Electron. J. Comb. Anna Adamaszek, Michal Adamaszek
2010	—	`conf`	Approximation and Hardness Results for the Maximum Edge ISAAC (2) Anna Adamaszek, Alexandru Popa
2010	J	`jnl`	Combinatorics of the change-making problem. Eur. J. Comb. Anna Adamaszek, Michal Adamaszek
2010	A	`conf`	Large-Girth Roots of Graphs. STACS Anna Adamaszek, Michal Adamaszek
2010	J	`jnl`	Large-Girth Roots of Graphs. SIAM J. Discret. Math. Anna Adamaszek, Michal Adamaszek
2010	J	`jnl`	Ptas for k-Tour Cover Problem on the Plane for Moderately Large Values of k. Int. J. Found. Comput. Sci. Anna Adamaszek, Artur Czumaj, Andrzej Lingas
2009	J	`jnl`	Large-girth roots of graphs CoRR Anna Adamaszek, Michal Adamaszek
2009	B	`conf`	PTAS for ISAAC Anna Adamaszek, Artur Czumaj, Andrzej Lingas
2009	J	`jnl`	PTAS for k-tour cover problem on the plane for moderately large values of k CoRR Anna Adamaszek, Artur Czumaj, Andrzej Lingas