메뉴 건너뛰기




Volumn 5125 LNCS, Issue PART 1, 2008, Pages 551-562

Almost 2-SAT is fixed-parameter tractable (extended abstract)

Author keywords

[No Author keywords available]

Indexed keywords

CHLORINE COMPOUNDS; COMPUTER SCIENCE; LINGUISTICS; TECHNOLOGY; TRANSLATION (LANGUAGES);

EID: 49049092826     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-70575-8_45     Document Type: Conference Paper
Times cited : (19)

References (17)
  • 1
    • 38149045876 scopus 로고    scopus 로고
    • 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 scopus 로고    scopus 로고
    • 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 scopus 로고    scopus 로고
    • 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 scopus 로고    scopus 로고
    • 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
  • 6
    • 38149049172 scopus 로고    scopus 로고
    • 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 scopus 로고    scopus 로고
    • 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 scopus 로고    scopus 로고
    • 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 scopus 로고    scopus 로고
    • 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 scopus 로고    scopus 로고
    • 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 scopus 로고    scopus 로고
    • 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 scopus 로고    scopus 로고
    • 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 scopus 로고    scopus 로고
    • 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)
  • 17
    • 0142152725 scopus 로고    scopus 로고
    • 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)


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.