-
1
-
-
0028255806
-
Approximation algorithms for NP-complete problems on planar graphs
-
Baker B. Approximation algorithms for NP-complete problems on planar graphs. J. ACM 41 1 (1994) 153-180
-
(1994)
J. ACM
, vol.41
, Issue.1
, pp. 153-180
-
-
Baker, B.1
-
2
-
-
48249152175
-
Fixed-parameter algorithms for Kemeny scores
-
Proceedings of the 4th International Conference on Algorithmic Aspects in Information and Management (AAIM 2008), Springer
-
Betzler N., Fellows M.R., Guo J., Niedermeier R., and Rosamond F.A. Fixed-parameter algorithms for Kemeny scores. Proceedings of the 4th International Conference on Algorithmic Aspects in Information and Management (AAIM 2008). Lecture Notes in Comput. Sci. vol. 5034 (2008), Springer
-
(2008)
Lecture Notes in Comput. Sci.
, vol.5034
-
-
Betzler, N.1
Fellows, M.R.2
Guo, J.3
Niedermeier, R.4
Rosamond, F.A.5
-
3
-
-
0442289197
-
On interval graphs and matrix profiles
-
Billionnet A. On interval graphs and matrix profiles. RAIRO Oper. Res. 20 (1986) 245-256
-
(1986)
RAIRO Oper. Res.
, vol.20
, pp. 245-256
-
-
Billionnet, A.1
-
4
-
-
0031164842
-
On fixed-parameter tractability and approximability of NP-optimization problems
-
Cai L., and Chen J. On fixed-parameter tractability and approximability of NP-optimization problems. J. Comput. System Sci. 54 3 (1997) 465-474
-
(1997)
J. Comput. System Sci.
, vol.54
, Issue.3
, pp. 465-474
-
-
Cai, L.1
Chen, J.2
-
5
-
-
33750238492
-
Fixed-parameter approximation: Conceptual framework and approximability results
-
Proceedings of the 2nd International Workshop on Parameterized and Exact Computation, Springer
-
Cai L., and Huang X. Fixed-parameter approximation: Conceptual framework and approximability results. Proceedings of the 2nd International Workshop on Parameterized and Exact Computation. Lecture Notes in Comput. Sci. vol. 4169 (2006), Springer 96-108
-
(2006)
Lecture Notes in Comput. Sci.
, vol.4169
, pp. 96-108
-
-
Cai, L.1
Huang, X.2
-
6
-
-
33750263582
-
On parameterized approximability
-
Proceedings of the 2nd International Workshop on Parameterized and Exact Computation, Springer
-
Chen Y., Grohe M., and Grüber M. On parameterized approximability. Proceedings of the 2nd International Workshop on Parameterized and Exact Computation. Lecture Notes in Comput. Sci. vol. 4169 (2006), Springer 109-120
-
(2006)
Lecture Notes in Comput. Sci.
, vol.4169
, pp. 109-120
-
-
Chen, Y.1
Grohe, M.2
Grüber, M.3
-
7
-
-
58149230292
-
-
J. Chen, Y. Liu, S. Lu, I. Razgon, B. O'Sullivan, Directed feedback vertex set is FPT, in: Proceedings of the 40th ACM Symposium on Theory of Computing (STOC 2008)
-
J. Chen, Y. Liu, S. Lu, I. Razgon, B. O'Sullivan, Directed feedback vertex set is FPT, in: Proceedings of the 40th ACM Symposium on Theory of Computing (STOC 2008)
-
-
-
-
8
-
-
0343337501
-
Approximating minimum size k-connected spanning subgraphs via matching
-
Cherian J., and Thurimella R. Approximating minimum size k-connected spanning subgraphs via matching. SIAM J. Comput. 30 2 (2000) 528-560
-
(2000)
SIAM J. Comput.
, vol.30
, Issue.2
, pp. 528-560
-
-
Cherian, J.1
Thurimella, R.2
-
9
-
-
31244432687
-
Recognizing Berge graphs
-
Chudnovsky M., Cornuéjols G., Liu X., Seymour P.D., and Vušković K. Recognizing Berge graphs. Combinatorica 25 (2005) 143-186
-
(2005)
Combinatorica
, vol.25
, pp. 143-186
-
-
Chudnovsky, M.1
Cornuéjols, G.2
Liu, X.3
Seymour, P.D.4
Vušković, K.5
-
10
-
-
0042274163
-
Independence numbers of graphs - An extension of the König-Egerv́ary theorem
-
Deming R.W. Independence numbers of graphs - An extension of the König-Egerv́ary theorem. Discrete Math. 27 (1979) 23-33
-
(1979)
Discrete Math.
, vol.27
, pp. 23-33
-
-
Deming, R.W.1
-
12
-
-
33750233605
-
Parameterized approximation algorithms
-
Proceedings of the 2nd International Workshop on Parameterized and Exact Computation, Springer
-
Downey R.G., Fellows M.R., and McCartin C. Parameterized approximation algorithms. Proceedings of the 2nd International Workshop on Parameterized and Exact Computation. Lecture Notes in Comput. Sci. vol. 4169 (2006), Springer 121-129
-
(2006)
Lecture Notes in Comput. Sci.
, vol.4169
, pp. 121-129
-
-
Downey, R.G.1
Fellows, M.R.2
McCartin, C.3
-
14
-
-
0000255727
-
Approximating minimum feedback sets and multicuts in directed graphs
-
Even G., Naor J., Schieber B., and Sudan M. Approximating minimum feedback sets and multicuts in directed graphs. Algorithmica 20 2 (1998) 151-174
-
(1998)
Algorithmica
, vol.20
, Issue.2
, pp. 151-174
-
-
Even, G.1
Naor, J.2
Schieber, B.3
Sudan, M.4
-
15
-
-
58149233159
-
-
M.R. Fellows, personal communication
-
M.R. Fellows, personal communication
-
-
-
-
18
-
-
35448980294
-
-
M.X. Goemans, Minimum bounded degree spanning trees, in: Proceedings of 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006)
-
M.X. Goemans, Minimum bounded degree spanning trees, in: Proceedings of 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006)
-
-
-
-
19
-
-
0027928806
-
-
M.X. Goemans, D.P. Williamson, 0.879-Approximation algorithms for MAX CUT and MAX 2SAT, in: Proceedings of the 26th Annual ACM Symposium on Theory of Computing (STOC 1994), 1994, pp. 422-431
-
M.X. Goemans, D.P. Williamson, 0.879-Approximation algorithms for MAX CUT and MAX 2SAT, in: Proceedings of the 26th Annual ACM Symposium on Theory of Computing (STOC 1994), 1994, pp. 422-431
-
-
-
-
20
-
-
33746103663
-
The linear arrangement problem parameterized above-guaranteed value
-
Proceedings of the 6th Conference on Algorithms and Complexity (CIAC 2006), Springer
-
Gutin G., Rafiey A., Szeider S., and Yeo A. The linear arrangement problem parameterized above-guaranteed value. Proceedings of the 6th Conference on Algorithms and Complexity (CIAC 2006). Lecture Notes in Comput. Sci. vol. 3998 (2006), Springer 356-367
-
(2006)
Lecture Notes in Comput. Sci.
, vol.3998
, pp. 356-367
-
-
Gutin, G.1
Rafiey, A.2
Szeider, S.3
Yeo, A.4
-
21
-
-
33750270296
-
Fixed-parameter complexity of minimum profile problems
-
Proceedings of the 2nd International Workshop on Parameterized and Exact Computation (IWPEC 2006), Springer
-
Gutin G., Szeider S., and Yeo A. Fixed-parameter complexity of minimum profile problems. Proceedings of the 2nd International Workshop on Parameterized and Exact Computation (IWPEC 2006). Lecture Notes in Comput. Sci. vol. 4169 (2006), Springer 60-71
-
(2006)
Lecture Notes in Comput. Sci.
, vol.4169
, pp. 60-71
-
-
Gutin, G.1
Szeider, S.2
Yeo, A.3
-
22
-
-
0036036831
-
-
J. Håstad, S. Venkatesh, On the advantage over a random assignment, in: Proceedings of the 34th Annual ACM Symposium on Theory of Computing (STOC 2002), 2002, pp. 43-52
-
J. Håstad, S. Venkatesh, On the advantage over a random assignment, in: Proceedings of the 34th Annual ACM Symposium on Theory of Computing (STOC 2002), 2002, pp. 43-52
-
-
-
-
23
-
-
35448959960
-
-
P. Heggernes, C. Paul, J.A. Telle, Y. Villanger, Interval completion with few edges, in: Proceedings of the 39th Annual ACM Symposium on Theory of Computing (STOC 2007), 2007, pp. 374-381
-
P. Heggernes, C. Paul, J.A. Telle, Y. Villanger, Interval completion with few edges, in: Proceedings of the 39th Annual ACM Symposium on Theory of Computing (STOC 2007), 2007, pp. 374-381
-
-
-
-
24
-
-
0032057911
-
On Syntactic versus computational views of approximability
-
Khanna S., Motwani R., Sudan M., and Vazirani U. On Syntactic versus computational views of approximability. SIAM J. Comput. 28 1 (1998) 164-191
-
(1998)
SIAM J. Comput.
, vol.28
, Issue.1
, pp. 164-191
-
-
Khanna, S.1
Motwani, R.2
Sudan, M.3
Vazirani, U.4
-
25
-
-
0037202068
-
Parameterized complexity of finding subgraphs with hereditary properties
-
Khot S., and Raman V. Parameterized complexity of finding subgraphs with hereditary properties. Theoret. Comput. Sci. 289 (2002) 997-1008
-
(2002)
Theoret. Comput. Sci.
, vol.289
, pp. 997-1008
-
-
Khot, S.1
Raman, V.2
-
26
-
-
0038999168
-
Profile minimization problem for matrices and graphs
-
Lin Y., and Yuan J. Profile minimization problem for matrices and graphs. Acta Math. Appl. Sin. Engl. Ser. 10 1 (1994) 107-112
-
(1994)
Acta Math. Appl. Sin. Engl. Ser.
, vol.10
, Issue.1
, pp. 107-112
-
-
Lin, Y.1
Yuan, J.2
-
27
-
-
58149259377
-
-
D. Lokshtanov, Wheel-free deletion is W [2]-hard, in: Proceedings of the International Workshop on Exact and Parameterized Computation (IWPEC 2008)
-
D. Lokshtanov, Wheel-free deletion is W [2]-hard, in: Proceedings of the International Workshop on Exact and Parameterized Computation (IWPEC 2008)
-
-
-
-
28
-
-
0001222854
-
Parameterizing above-guaranteed values: MaxSat and MaxCut
-
Mahajan M., and Raman V. Parameterizing above-guaranteed values: MaxSat and MaxCut. J. Algorithms 31 2 (1999) 335-354
-
(1999)
J. Algorithms
, vol.31
, Issue.2
, pp. 335-354
-
-
Mahajan, M.1
Raman, V.2
-
29
-
-
33750229390
-
Parameterizing MAX SNP problems above-guaranteed values
-
Proceedings of the 2nd International Workshop on Parameterized and Exact Computation, Springer
-
Mahajan M., Raman V., and Sikdar S. Parameterizing MAX SNP problems above-guaranteed values. Proceedings of the 2nd International Workshop on Parameterized and Exact Computation. Lecture Notes in Comput. Sci. vol. 4169 (2006), Springer 38-49
-
(2006)
Lecture Notes in Comput. Sci.
, vol.4169
, pp. 38-49
-
-
Mahajan, M.1
Raman, V.2
Sikdar, S.3
-
30
-
-
33845540494
-
Chordal deletion is fixed-parameter tractable
-
Proceedings of the 32nd International Workshop (WG 2006), Springer
-
Marx D. Chordal deletion is fixed-parameter tractable. Proceedings of the 32nd International Workshop (WG 2006). Lecture Notes in Comput. Sci. vol. 4271 (2006), Springer 37-48
-
(2006)
Lecture Notes in Comput. Sci.
, vol.4271
, pp. 37-48
-
-
Marx, D.1
-
31
-
-
38549090020
-
-
D. Marx, I. Schlotter, Obtaining a planar graph by vertex deletion, in: Proceedings of the 33rd International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2007), 2007, pp. 292-303
-
D. Marx, I. Schlotter, Obtaining a planar graph by vertex deletion, in: Proceedings of the 33rd International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2007), 2007, pp. 292-303
-
-
-
-
32
-
-
38149064415
-
The complexity of finding subgraphs whose matching number equals the vertex cover number
-
Proceedings of the 18th International Symposium on Algorithms and Computation (ISAAC 2007), Springer
-
Mishra S., Raman V., Saurabh S., Sikdar S., and Subramanian C.R. The complexity of finding subgraphs whose matching number equals the vertex cover number. Proceedings of the 18th International Symposium on Algorithms and Computation (ISAAC 2007). Lecture Notes in Comput. Sci. vol. 4835 (2007), Springer 268-279
-
(2007)
Lecture Notes in Comput. Sci.
, vol.4835
, pp. 268-279
-
-
Mishra, S.1
Raman, V.2
Saurabh, S.3
Sikdar, S.4
Subramanian, C.R.5
-
34
-
-
84873168785
-
Complexity classification of some edge-modification problems
-
Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 1999), Springer
-
Natanzon A., Shamir R., and Sharan R. Complexity classification of some edge-modification problems. Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 1999). Lecture Notes in Comput. Sci. vol. 1665 (1999), Springer 65-77
-
(1999)
Lecture Notes in Comput. Sci.
, vol.1665
, pp. 65-77
-
-
Natanzon, A.1
Shamir, R.2
Sharan, R.3
-
36
-
-
0346676595
-
New upper bounds for maximum satisfiability
-
Niedermeier R., and Rossmanith P. New upper bounds for maximum satisfiability. J. Algorithms 36 1 (2000) 63-88
-
(2000)
J. Algorithms
, vol.36
, Issue.1
, pp. 63-88
-
-
Niedermeier, R.1
Rossmanith, P.2
-
37
-
-
0026366408
-
Optimization, approximation, and complexity classes
-
Papadimitriou C.H., and Yannakakis M. Optimization, approximation, and complexity classes. J. Comput. System Sci. 43 3 (1991) 425-440
-
(1991)
J. Comput. System Sci.
, vol.43
, Issue.3
, pp. 425-440
-
-
Papadimitriou, C.H.1
Yannakakis, M.2
-
38
-
-
0347557519
-
A polynomial algorithm for constructing a large bipartite subgraph with an application to a satisfiability problem
-
Poljak S., and Turzík D. A polynomial algorithm for constructing a large bipartite subgraph with an application to a satisfiability problem. Canad. J. Math. 34 3 (1982) 519-524
-
(1982)
Canad. J. Math.
, vol.34
, Issue.3
, pp. 519-524
-
-
Poljak, S.1
Turzík, D.2
-
39
-
-
33748996754
-
Faster fixed-parameter tractable algorithms for finding feedback vertex sets
-
Raman V., Saurabh S., and Subramanian C.R. Faster fixed-parameter tractable algorithms for finding feedback vertex sets. ACM Trans. Algorithms 2 3 (2006) 403-415
-
(2006)
ACM Trans. Algorithms
, vol.2
, Issue.3
, pp. 403-415
-
-
Raman, V.1
Saurabh, S.2
Subramanian, C.R.3
-
40
-
-
58149247078
-
-
I. Razgon, B. O'Sullivan, Almost 2-sat is fixed-parameter tractable, in: Proceedings of the 35th International Colloquium on Automata, Languages and Programming (ICALP 2008)
-
I. Razgon, B. O'Sullivan, Almost 2-sat is fixed-parameter tractable, in: Proceedings of the 35th International Colloquium on Automata, Languages and Programming (ICALP 2008)
-
-
-
-
41
-
-
2042441126
-
Finding odd cycle transversals
-
Reed B., Smith K., and Vetta A. Finding odd cycle transversals. Oper. Res. Lett. 32 4 (2004) 299-301
-
(2004)
Oper. Res. Lett.
, vol.32
, Issue.4
, pp. 299-301
-
-
Reed, B.1
Smith, K.2
Vetta, A.3
|