 | 2012 |
| 21 |  | Kevin Buchin,
Maike Buchin,
Jaroslaw Byrka,
Martin Nöllenburg,
Yoshio Okamoto,
Rodrigo I. Silveira,
Alexander Wolff:
Drawing (Complete) Binary Tanglegrams - Hardness, Approximation, Fixed-Parameter Tractability.
Algorithmica 62(1-2): 309-332 (2012) |
| 2010 |
| 20 |  | Jaroslaw Byrka,
Aravind Srinivasan,
Chaitanya Swamy:
Fault-Tolerant Facility Location: A Randomized Dependent LP-Rounding Algorithm.
IPCO 2010: 244-257 |
| 19 |  | Jaroslaw Byrka,
Andreas Karrenbauer,
Laura Sanità:
The Interval Constrained 3-Coloring Problem.
LATIN 2010: 591-602 |
| 18 |  | Jaroslaw Byrka,
Fabrizio Grandoni,
Thomas Rothvoß,
Laura Sanità:
An improved LP-based approximation for steiner tree.
STOC 2010: 583-592 |
| 17 |  | Jaroslaw Byrka,
Aravind Srinivasan,
Chaitanya Swamy:
Fault-Tolerant Facility Location: a randomized dependent LP-rounding algorithm
CoRR abs/1003.1295: (2010) |
| 16 |  | Jaroslaw Byrka,
MohammadReza Ghodsi,
Aravind Srinivasan:
LP-rounding algorithms for facility-location problems
CoRR abs/1007.3611: (2010) |
| 15 |  | Jaroslaw Byrka,
Sylvain Guillemot,
Jesper Jansson:
New results on optimizing rooted triplets consistency.
Discrete Applied Mathematics 158(11): 1136-1147 (2010) |
| 14 |  | Jaroslaw Byrka,
Pawel Gawrychowski,
Katharina T. Huber,
Steven Kelk:
Worst-case optimal approximation algorithms for maximizing triplet consistency within phylogenetic networks.
J. Discrete Algorithms 8(1): 65-75 (2010) |
| 13 |  | Jaroslaw Byrka,
Karen Aardal:
An Optimal Bifactor Approximation Algorithm for the Metric Uncapacitated Facility Location Problem.
SIAM J. Comput. 39(6): 2212-2231 (2010) |
| 12 |  | Hartwig Bosse,
Jaroslaw Byrka,
Evangelos Markakis:
New algorithms for approximate Nash equilibria in bimatrix games.
Theor. Comput. Sci. 411(1): 164-173 (2010) |
| 2009 |
| 11 |  | Jaroslaw Byrka,
Andreas Karrenbauer,
Laura Sanità:
The interval constrained 3-coloring problem
CoRR abs/0907.3563: (2009) |
| 10 |  | Marcin Bienkowski,
Jaroslaw Byrka,
Miroslaw Korzeniowski,
Friedhelm Meyer auf der Heide:
Optimal algorithms for page migration in dynamic networks.
J. Discrete Algorithms 7(4): 545-569 (2009) |
| 2008 |
| 9 |  | Kevin Buchin,
Maike Buchin,
Jaroslaw Byrka,
Martin Nöllenburg,
Yoshio Okamoto,
Rodrigo I. Silveira,
Alexander Wolff:
Drawing (Complete) Binary Tanglegrams.
Graph Drawing 2008: 324-335 |
| 8 |  | Jaroslaw Byrka,
Sylvain Guillemot,
Jesper Jansson:
New Results on Optimizing Rooted Triplets Consistency.
ISAAC 2008: 484-495 |
| 7 |  | Karen Aardal,
Jaroslaw Byrka,
Mohammad Mahdian:
Facility Location.
Encyclopedia of Algorithms 2008 |
| 6 |  | Kevin Buchin,
Maike Buchin,
Jaroslaw Byrka,
Martin Nöllenburg,
Yoshio Okamoto,
Rodrigo I. Silveira,
Alexander Wolff:
Drawing (Complete) Binary Tanglegrams: Hardness, Approximation, Fixed-Parameter Tractability
CoRR abs/0806.0920: (2008) |
| 2007 |
| 5 |  | Jaroslaw Byrka:
An Optimal Bifactor Approximation Algorithm for the Metric Uncapacitated Facility Location Problem.
APPROX-RANDOM 2007: 29-43 |
| 4 |  | Hartwig Bosse,
Jaroslaw Byrka,
Evangelos Markakis:
New Algorithms for Approximate Nash Equilibria in Bimatrix Games.
WINE 2007: 17-29 |
| 3 |  | Jaroslaw Byrka:
An optimal bifactor approximation algorithm for the metric uncapacitated facility location problem
CoRR abs/cs/0703010: (2007) |
| 2 |  | Jaroslaw Byrka,
Karen Aardal:
The approximation gap for the metric facility location problem is not yet closed.
Oper. Res. Lett. 35(3): 379-384 (2007) |
| 2005 |
| 1 |  | Marcin Bienkowski,
Jaroslaw Byrka:
Bucket Game with Applications to Set Multicover and Dynamic Page Migration.
ESA 2005: 815-826 |