-
1
-
-
33750241114
-
Greedy localization and color-coding:improved matching and packing algorithms
-
Bodlaender, H.L, Langston, M.A, eds, IWPEC 2006, Springer, Heidelberg
-
Liu, Y., Lu, S., Chen, J., Sze, S.H.: Greedy localization and color-coding:improved matching and packing algorithms. In: Bodlaender, H.L., Langston, M.A. (eds.) IWPEC 2006. LNCS, vol. 4169, pp. 84-95. Springer, Heidelberg (2006)
-
(2006)
LNCS
, vol.4169
, pp. 84-95
-
-
Liu, Y.1
Lu, S.2
Chen, J.3
Sze, S.H.4
-
3
-
-
0346009265
-
An efficient parameterized algorithm for m-SET PACKING
-
Jia, W., Zhang, C., Chen, J.: An efficient parameterized algorithm for m-SET PACKING. J. Algorithms 50, 106-117 (2004)
-
(2004)
J. Algorithms
, vol.50
, pp. 106-117
-
-
Jia, W.1
Zhang, C.2
Chen, J.3
-
4
-
-
13844309916
-
A faster parameterized algorithm for set packing
-
Koutis, I.: A faster parameterized algorithm for set packing. Information Processing Letters 94, 7-9 (2005)
-
(2005)
Information Processing Letters
, vol.94
, pp. 7-9
-
-
Koutis, I.1
-
5
-
-
33750267640
-
-
Fellows, M., Knauer, C., Nishimura, N., Ragde, P., Rosamond, F., Stege, U., Thilikos, D., Whitesides, S.: Faster fixed-parameter tractable algorithms for matching and packing problems. In: Albers, S., Radzik, T. (eds.) ESA 2004. LNCS, 3221, Springer, Heidelberg (2004)
-
Fellows, M., Knauer, C., Nishimura, N., Ragde, P., Rosamond, F., Stege, U., Thilikos, D., Whitesides, S.: Faster fixed-parameter tractable algorithms for matching and packing problems. In: Albers, S., Radzik, T. (eds.) ESA 2004. LNCS, vol. 3221, Springer, Heidelberg (2004)
-
-
-
-
6
-
-
33845543134
-
-
Kneis, J., Moelle, D., Richter, S., Rossmanith, P.: Divide-and-Color. In: Fomin, F.V. (ed.) WG 2006. LNCS, 4271, pp. 58-67. Springer, Heidelberg (2006)
-
Kneis, J., Moelle, D., Richter, S., Rossmanith, P.: Divide-and-Color. In: Fomin, F.V. (ed.) WG 2006. LNCS, vol. 4271, pp. 58-67. Springer, Heidelberg (2006)
-
-
-
-
7
-
-
84969277556
-
Improved algorithms for path, matching, and packing problems
-
Chen, J., Lu, S., Sze, S.-H., Zhang, F.: Improved algorithms for path, matching, and packing problems. In: Proc. 17th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2007), pp. 298-307 (2007)
-
(2007)
Proc. 17th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA
, pp. 298-307
-
-
Chen, J.1
Lu, S.2
Sze, S.-H.3
Zhang, F.4
-
8
-
-
48349132407
-
Improved parameterized set splitting algorithms: A probabilistic approach
-
to appear
-
Chen, J., Lu, S.: Improved parameterized set splitting algorithms: A probabilistic approach. Algorithmica (to appear)
-
Algorithmica
-
-
Chen, J.1
Lu, S.2
-
9
-
-
0029513529
-
Splitters and near-optimal derandomization
-
Naor, M., Schulman, L., Srinivasan, A.: Splitters and near-optimal derandomization. In: Proceedings of the 36th Annual Symposium on Foundations of Computer Science (FOCS 1995), pp. 182-190 (1995)
-
(1995)
Proceedings of the 36th Annual Symposium on Foundations of Computer Science (FOCS
, pp. 182-190
-
-
Naor, M.1
Schulman, L.2
Srinivasan, A.3
-
10
-
-
33750266499
-
Packing edge disjoint triangles: A parameterized view
-
Downey, R.G, Fellows, M.R, Dehne, F, eds, IWPEC 2004, Springer, Heidelberg
-
Mathieson, L., Prieto, E., Shaw, P.: Packing edge disjoint triangles: A parameterized view. In: Downey, R.G., Fellows, M.R., Dehne, F. (eds.) IWPEC 2004. LNCS, vol. 3162, pp. 127-137. Springer, Heidelberg (2004)
-
(2004)
LNCS
, vol.3162
, pp. 127-137
-
-
Mathieson, L.1
Prieto, E.2
Shaw, P.3
|