-
1
-
-
35448988064
-
Inclusion-Exclusion Algorithms for Counting Set Partitions
-
Björklund, A., Husfeldt, T.: Inclusion-Exclusion Algorithms for Counting Set Partitions. In: Proceedings of FOGS 2006, pp. 575-582 (2006)
-
(2006)
Proceedings of FOGS 2006
, pp. 575-582
-
-
Björklund, A.1
Husfeldt, T.2
-
2
-
-
35449001611
-
Fourier meets Mobius: Fast Subset Convolution
-
Björklund, A., Husfeldt, T., Kaski, P., Koivisto, M.: Fourier meets Mobius: Fast Subset Convolution. In: Proceedings of STOC 2007, pp. 67-74 (2007)
-
(2007)
Proceedings of STOC 2007
, pp. 67-74
-
-
Björklund, A.1
Husfeldt, T.2
Kaski, P.3
Koivisto, M.4
-
3
-
-
3042736584
-
Enumerating maximal independent sets with applications to graph colouring
-
Byskov, J.M.: Enumerating maximal independent sets with applications to graph colouring. Oper. Res. Lett. 32(6), 547-556 (2004)
-
(2004)
Oper. Res. Lett
, vol.32
, Issue.6
, pp. 547-556
-
-
Byskov, J.M.1
-
4
-
-
57049178481
-
-
Chen, J., Liu, Y., Lu, S., Razgon, I., O'Sullivan, B.: A Fixed-Parameter Algorithm for the Directed Feedback Vertex Set Problem. In: Proceedings of STOC 2008, pp. 177-186 (2008)
-
Chen, J., Liu, Y., Lu, S., Razgon, I., O'Sullivan, B.: A Fixed-Parameter Algorithm for the Directed Feedback Vertex Set Problem. In: Proceedings of STOC 2008, pp. 177-186 (2008)
-
-
-
-
5
-
-
33750278534
-
The Cluster Editing Problem: Implementations and Experiments
-
Dehne, F., Langston, M.A., Luo, X., Pitre, S., Shaw, P., Zhang, Y.: The Cluster Editing Problem: Implementations and Experiments. In: Proceedings of IWPEC 2006, pp. 13-24 (2006)
-
(2006)
Proceedings of IWPEC
, pp. 13-24
-
-
Dehne, F.1
Langston, M.A.2
Luo, X.3
Pitre, S.4
Shaw, P.5
Zhang, Y.6
-
6
-
-
26844469337
-
-
3) FPT algorithm for the undirected feedback vertex set problem. In: Proceedings of COCOON 2005, pp. 859-869 (2005)
-
3) FPT algorithm for the undirected feedback vertex set problem. In: Proceedings of COCOON 2005, pp. 859-869 (2005)
-
-
-
-
7
-
-
0015330635
-
Theoretical improvements in algorithmic efficiency for network flow problems
-
Edmonds, J., Karp, R.M.: Theoretical improvements in algorithmic efficiency for network flow problems. J. ACM 19(2), 248-264 (1972)
-
(1972)
J. ACM
, vol.19
, Issue.2
, pp. 248-264
-
-
Edmonds, J.1
Karp, R.M.2
-
8
-
-
38149122077
-
Efficient Parameterized Preprocessing for Cluster Editing
-
Fellows, M.R., Langston, M.A., Rosamond, F.A., Shaw, P.: Efficient Parameterized Preprocessing for Cluster Editing. In: Proceedings of FCT 2007, pp. 312-321 (2007)
-
(2007)
Proceedings of FCT
, pp. 312-321
-
-
Fellows, M.R.1
Langston, M.A.2
Rosamond, F.A.3
Shaw, P.4
-
9
-
-
33746093487
-
Parameterized Algorithms for Hitting Set: The Weighted Case
-
Fernau, H.: Parameterized Algorithms for Hitting Set: The Weighted Case. In: Proceedings of CIAC 2006, pp. 332-343 (2006)
-
(2006)
Proceedings of CIAC 2006
, pp. 332-343
-
-
Fernau, H.1
-
10
-
-
33244481489
-
-
0.288 n) independent set algorithm. In: Proceedings of SODA 2006, pp. 18-25 (2006)
-
0.288 n) independent set algorithm. In: Proceedings of SODA 2006, pp. 18-25 (2006)
-
-
-
-
11
-
-
38049088998
-
A More Effective Linear Kernelization for Cluster Editing
-
Guo, J.: A More Effective Linear Kernelization for Cluster Editing. In: Proceedings of ESCAPE 2007, pp. 36-47 (2007)
-
(2007)
Proceedings of ESCAPE
, pp. 36-47
-
-
Guo, J.1
-
12
-
-
33750457677
-
Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization
-
Guo, J., Gramm, J., Hüffner, F., Niedermeier, R., Wernicke, S.: Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization. J. Comput. Syst. Sci. 72(8), 1386-1396 (2006)
-
(2006)
J. Comput. Syst. Sci
, vol.72
, Issue.8
, pp. 1386-1396
-
-
Guo, J.1
Gramm, J.2
Hüffner, F.3
Niedermeier, R.4
Wernicke, S.5
-
13
-
-
54249165932
-
-
5/2 algorithm for maximum matching in bipartite graphs. SIAM J. Computing 2(4), 225-231 (1973)
-
5/2 algorithm for maximum matching in bipartite graphs. SIAM J. Computing 2(4), 225-231 (1973)
-
-
-
-
14
-
-
43049134480
-
Fixed-parameter algorithms for cluster vertex deletion
-
Hiiffner, F., Komusiewicz, C., Moser, H., Niedermeier, R.: Fixed-parameter algorithms for cluster vertex deletion. In: Proceedings of LATIN 2008, pp. 711-722 (2008)
-
(2008)
Proceedings of LATIN
, pp. 711-722
-
-
Hiiffner, F.1
Komusiewicz, C.2
Moser, H.3
Niedermeier, R.4
-
15
-
-
0023978535
-
On Generating All Maximal Independent Sets
-
Johnson, D.S., Papadimitriou, C.H., Yannakakis, M.: On Generating All Maximal Independent Sets. Inf. Process. Lett. 27(3), 119-123 (1988)
-
(1988)
Inf. Process. Lett
, vol.27
, Issue.3
, pp. 119-123
-
-
Johnson, D.S.1
Papadimitriou, C.H.2
Yannakakis, M.3
-
16
-
-
38749119020
-
-
n) Algorithm for Graph Colouring and Other Partitioning Problems via Inclusion-Exclusion. In: Proceedings of FOCS 2006, pp. 583-590 (2006)
-
n) Algorithm for Graph Colouring and Other Partitioning Problems via Inclusion-Exclusion. In: Proceedings of FOCS 2006, pp. 583-590 (2006)
-
-
-
-
17
-
-
51249169586
-
On Cliques in Graphs. Israel J
-
Moon, J.W., Mose, L.: On Cliques in Graphs. Israel J. Mathematics 3, 23-28 (1965)
-
(1965)
Mathematics
, vol.3
, pp. 23-28
-
-
Moon, J.W.1
Mose, L.2
-
18
-
-
37249000536
-
-
Rahmann, S., Wittkop, T., Baumbach, J., Martin, M., Trub, A., Böcker, S.: Exact and Heuristic Algorithms for Weighted Cluster Editing. In: Proceedings of Comput. Syst. Bioinformatics Conference 2007, 6(1), pp. 391-401 (2007)
-
Rahmann, S., Wittkop, T., Baumbach, J., Martin, M., Trub, A., Böcker, S.: Exact and Heuristic Algorithms for Weighted Cluster Editing. In: Proceedings of Comput. Syst. Bioinformatics Conference 2007, vol. 6(1), pp. 391-401 (2007)
-
-
-
-
19
-
-
36849093348
-
Efficient Exact Algorithms through Enumerating Maximal Independent Sets and Other Techniques
-
Raman, V., Saurabh, S., Sikdar, S.: Efficient Exact Algorithms through Enumerating Maximal Independent Sets and Other Techniques. Theory Comput. Syst. 41(3), 1432-4350 (2007)
-
(2007)
Theory Comput. Syst
, vol.41
, Issue.3
, pp. 1432-4350
-
-
Raman, V.1
Saurabh, S.2
Sikdar, S.3
-
20
-
-
2042441126
-
Finding odd cycle transversals
-
Reed, B.A., Smith, K., Vetta, A.: Finding odd cycle transversals. Oper. Res. Lett. 32(4), 299-301 (2004)
-
(2004)
Oper. Res. Lett
, vol.32
, Issue.4
, pp. 299-301
-
-
Reed, B.A.1
Smith, K.2
Vetta, A.3
-
21
-
-
0001038743
-
Algorithms for maximum independent sets
-
Robson, J.M.: Algorithms for maximum independent sets. J. Algorithms 7, 425-440 (1986)
-
(1986)
J. Algorithms
, vol.7
, pp. 425-440
-
-
Robson, J.M.1
-
22
-
-
0001513435
-
Finding a maximum independent set
-
Tarjan, R., Trojanowski, A.: Finding a maximum independent set. SIAM J. Computing 6(3), 537-546 (1977)
-
(1977)
SIAM J. Computing
, vol.6
, Issue.3
, pp. 537-546
-
-
Tarjan, R.1
Trojanowski, A.2
|