SCOPUS 정보 검색 플랫폼

Information Processing Letters

Volumn 110, Issue 11, 2010, Pages 451-454

Note on max Lin-2 above average

(3) Crowston, Robert a Gutin, Gregory a Jones, Mark a

a UNIVERSITY OF LONDON (United Kingdom)

Author keywords

Algorithms; Fixed parameter tractability; Max Lin; Max Sat

Indexed keywords

ALGORITHMS; FOURIER ANALYSIS; PARAMETERIZATION;

COMBINATORIAL PROOF; COMPUTABLE FUNCTIONS; FIXED-PARAMETER TRACTABILITY; MAX LIN; MAX-SAT; OPTIMAL SOLUTIONS; PARAMETERIZED PROBLEMS; PROBABILISTIC APPROACHES;

ALUMINUM;

EID: 77955922306 PISSN: 00200190 EISSN: None Source Type: Journal
DOI: 10.1016/j.ipl.2010.04.010 Document Type: Article

Times cited : (13)

References (11)

1
- 77951692326
- Solving MAX-r-SAT above a tight lower bound
- N. Alon, G. Gutin, E.J. Kim, S. Szeider, A. Yeo, Solving MAX-r-SAT above a tight lower bound, in: Proc. SODA 2010, pp. 511-517.
- (2010) Proc. SODA , pp. 511-517
- Alon, N.¹ Gutin, G.² Kim, E.J.³ Szeider, S.⁴ Yeo, A.⁵

2
- 0003706269
- Springer
- R.G. Downey, M.R. Fellows, Parameterized Complexity, Springer, 1999.
- (1999) Parameterized Complexity
- Downey, R.G.¹ Fellows, M.R.²

3
- 33745187077
- Springer
- J. Flum, M. Grohe, Parameterized Complexity Theory, Springer, 2006.
- (2006) Parameterized Complexity Theory
- Flum, J.¹ Grohe, M.²

4
- 72249094201
- A probabilistic approach to problems parameterized above tight lower bound
- G. Gutin, E.J. Kim, S. Szeider, A. Yeo, A probabilistic approach to problems parameterized above tight lower bound, in: Proc. IWPEC'09, in: Lect. Notes Comput. Sci., vol. 5917, 2009, pp. 234-245.
- (2009) Proc. IWPEC'09, In: Lect. Notes Comput. Sci. , vol.5917 , pp. 234-245
- Gutin, G.¹ Kim, E.J.² Szeider, S.³ Yeo, A.⁴

5
- 36849063037
- The linear arrangement problem parameterized above guaranteed value
- G. Gutin, A. Rafiey, S. Szeider, A. Yeo, The linear arrangement problem parameterized above guaranteed value, Theory Comput. Syst. 41 (2007) 521-538.
- (2007) Theory Comput. Syst. , vol.41 , pp. 521-538
- Gutin, G.¹ Rafiey, A.² Szeider, S.³ Yeo, A.⁴

6
- 50849096745
- Fixed-parameter complexity of minimum profile problems
- G. Gutin, S. Szeider, A. Yeo, Fixed-parameter complexity of minimum profile problems, Algorithmica 52 (2) (2008) 133-152.
- (2008) Algorithmica , vol.52 , Issue.2 , pp. 133-152
- Gutin, G.¹ Szeider, S.² Yeo, A.³

7
- 11144258880
- On the advantage over a random assignment
- DOI 10.1002/rsa.20031
- J. Håstad, S. Venkatesh, On the advantage over a random assignment, Random Structures Algorithms 25 (2) (2004) 117-149. (Pubitemid 40031413)
- (2004) Random Structures and Algorithms , vol.25 , Issue.2 , pp. 117-149
- Hastad, J.¹ Venkatesh, S.²

8
- 70349391743
- Interval completion is fixed parameter tractable
- Y. Villanger, P. Heggernes, C. Paul, J.A. Telle, Interval completion is fixed parameter tractable, SIAM J. Comput. 38 (5) (2009) 2007-2020.
- (2009) SIAM J. Comput. , vol.38 , Issue.5 , pp. 2007-2020
- Villanger, Y.¹ Heggernes, P.² Paul, C.³ Telle, J.A.⁴

9
- 0001222854
- Parameterizing above guaranteed values: MaxSat and MaxCut
- M. Mahajan, V. Raman, Parameterizing above guaranteed values: MaxSat and MaxCut, J. Algorithms 31 (2) (1999) 335-354. (Pubitemid 129610428)
- (1999) Journal of Algorithms , vol.31 , Issue.2 , pp. 335-354
- Mahajan, M.¹ Raman, V.²

10
- 58149231112
- Parameterizing above or below guaranteed values
- M. Mahajan, V. Raman, S. Sikdar, Parameterizing above or below guaranteed values, J. Comput. Syst. Sci. 75 (2) (2009) 137-153.
- (2009) J. Comput. Syst. Sci. , vol.75 , Issue.2 , pp. 137-153
- Mahajan, M.¹ Raman, V.² Sikdar, S.³

11
- 84920368087
- Oxford University Press
- R. Niedermeier, Invitation to Fixed-Parameter Algorithms, Oxford University Press, 2006.
- (2006) Invitation to Fixed-Parameter Algorithms
- Niedermeier, R.¹

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