-
1
-
-
38149045876
-
-
Chen, J., Fomin, F., Liu, Y., Lu, S., Villanger, Y.: Improved algorithms for the feedback vertex set problems. In: Dehne, F., Sack, J.-R., Zeh, N. (eds.) WADS 2007. LNCS, 4619, pp. 422-433. Springer, Heidelberg (2007)
-
Chen, J., Fomin, F., Liu, Y., Lu, S., Villanger, Y.: Improved algorithms for the feedback vertex set problems. In: Dehne, F., Sack, J.-R., Zeh, N. (eds.) WADS 2007. LNCS, vol. 4619, pp. 422-433. Springer, Heidelberg (2007)
-
-
-
-
2
-
-
38149112844
-
-
Chen, J., Liu, Y., Lu, S.: An improved parameterized algorithm for the minimum node multiway cut problem. In: Dehne, F., Sack, J.-R., Zeh, N. (eds.) WADS 2007. LNCS, 4619, pp. 495-506. Springer, Heidelberg (2007)
-
Chen, J., Liu, Y., Lu, S.: An improved parameterized algorithm for the minimum node multiway cut problem. In: Dehne, F., Sack, J.-R., Zeh, N. (eds.) WADS 2007. LNCS, vol. 4619, pp. 495-506. Springer, Heidelberg (2007)
-
-
-
-
3
-
-
57049178481
-
A fixed-parameter algorithm for the directed feedback vertex set problem
-
to appear
-
Chen, J., Liu, Y., Lu, S., O'Sullivan, B., Razgon, I.: A fixed-parameter algorithm for the directed feedback vertex set problem. In: STOC 2008 (to appear, 2008)
-
(2008)
STOC
-
-
Chen, J.1
Liu, Y.2
Lu, S.3
O'Sullivan, B.4
Razgon, I.5
-
4
-
-
3142639213
-
Improved exact algorithms for max-sat
-
Chen, J., Kanj, I.A.: Improved exact algorithms for max-sat. Discrete Applied Mathematics 142(1-3), 17-27 (2004)
-
(2004)
Discrete Applied Mathematics
, vol.142
, Issue.1-3
, pp. 17-27
-
-
Chen, J.1
Kanj, I.A.2
-
5
-
-
49049089767
-
-
Demaine, E., Gutin, G., Marx, D., Stege, U.: Open problems from dagstuhl seminar 07281 (2007), http://drops.dagstuhl.de/opus/volltexte/2007/1254/pdf/ 07281.SWM.Paper.1254.pdf
-
(2007)
Open problems from dagstuhl seminar 07281
-
-
Demaine, E.1
Gutin, G.2
Marx, D.3
Stege, U.4
-
6
-
-
38149049172
-
Parameterized approximability of the disjoint cycle problem
-
Arge, L, Cachin, C, Jurdziński, T, Tarlecki, A, eds, ICALP 2007, Springer, Heidelberg
-
Grohe, M., Grüber, M.: Parameterized approximability of the disjoint cycle problem. In: Arge, L., Cachin, C., Jurdziński, T., Tarlecki, A. (eds.) ICALP 2007. LNCS, vol. 4596, pp. 363-374. Springer, Heidelberg (2007)
-
(2007)
LNCS
, vol.4596
, pp. 363-374
-
-
Grohe, M.1
Grüber, M.2
-
7
-
-
33745650658
-
-
Guo, J., Hüffner, F., Kenar, E., Niedermeier, R., Uhlmann, J.: Complexity and exact algorithms for multicut. In: SOFSEM, pp. 303-312 (2006)
-
Guo, J., Hüffner, F., Kenar, E., Niedermeier, R., Uhlmann, J.: Complexity and exact algorithms for multicut. In: SOFSEM, pp. 303-312 (2006)
-
-
-
-
8
-
-
24944512986
-
-
Hüffner, F.: Algorithm engineering for optimal graph bipartization. In: Nikoletseas, S.E. (ed.) WEA 2005. LNCS, 3503, pp. 240-252. Springer, Heidelberg (2005)
-
Hüffner, F.: Algorithm engineering for optimal graph bipartization. In: Nikoletseas, S.E. (ed.) WEA 2005. LNCS, vol. 3503, pp. 240-252. Springer, Heidelberg (2005)
-
-
-
-
9
-
-
43049144384
-
Techniques for practical fixed-parameter algorithms
-
Hüffner, F., Niedermeier, R.,Wernicke, S.: Techniques for practical fixed-parameter algorithms. The Computer Journal 51(1), 7-25 (2008)
-
(2008)
The Computer Journal
, vol.51
, Issue.1
, pp. 7-25
-
-
Hüffner, F.1
Niedermeier, R.2
Wernicke, S.3
-
10
-
-
0037202068
-
Parameterized complexity of finding subgraphs with hereditary properties
-
Khot, S., Raman, V.: Parameterized complexity of finding subgraphs with hereditary properties. Theoretical Computer Science 289(2), 997-1008 (2002)
-
(2002)
Theoretical Computer Science
, vol.289
, Issue.2
, pp. 997-1008
-
-
Khot, S.1
Raman, V.2
-
12
-
-
0001222854
-
Parameterizing above guaranteed values: Maxsat and maxcut
-
Mahajan, M., Raman, V.: Parameterizing above guaranteed values: Maxsat and maxcut. Journal of Algorithms 31(2), 335-354 (1999)
-
(1999)
Journal of Algorithms
, vol.31
, Issue.2
, pp. 335-354
-
-
Mahajan, M.1
Raman, V.2
-
13
-
-
32144452810
-
Parameterized graph separation problems
-
Marx, D.: Parameterized graph separation problems. Theoretical Computer Science 351(3), 394-406 (2006)
-
(2006)
Theoretical Computer Science
, vol.351
, Issue.3
, pp. 394-406
-
-
Marx, D.1
-
14
-
-
38149064415
-
-
Mishra, S., Raman, V., Saurabh, S., Sikdar, S., Subramanian, C.: The complexity of finding subgraphs whose matching number equals the vertex cover number. In: ISAAC, pp. 268-279 (2007)
-
Mishra, S., Raman, V., Saurabh, S., Sikdar, S., Subramanian, C.: The complexity of finding subgraphs whose matching number equals the vertex cover number. In: ISAAC, pp. 268-279 (2007)
-
-
-
-
16
-
-
2042441126
-
Finding odd cycle transversals
-
Reed, B., Smith, K., Vetta, A.: Finding odd cycle transversals. Operations Research Letters 32(4), 299-301 (2004)
-
(2004)
Operations Research Letters
, vol.32
, Issue.4
, pp. 299-301
-
-
Reed, B.1
Smith, K.2
Vetta, A.3
-
17
-
-
0142152725
-
-
Slivkins, A.: Parameterized tractability of edge-disjoint paths on directed acyclic graphs. In: Di Battista, G., Zwick, U. (eds.) ESA 2003. LNCS, 2832, pp. 482-493. Springer, Heidelberg (2003)
-
Slivkins, A.: Parameterized tractability of edge-disjoint paths on directed acyclic graphs. In: Di Battista, G., Zwick, U. (eds.) ESA 2003. LNCS, vol. 2832, pp. 482-493. Springer, Heidelberg (2003)
-
-
-
|