-
2
-
-
0020752203
-
A fast algorithm for the decomposition of graphs and posets
-
Bauer, H. and Möhring, R. H. A fast algorithm for the decomposition of graphs and posets. Mathematics of Operations Research 8 (1983) 170-184.
-
(1983)
Mathematics of Operations Research
, vol.8
, pp. 170-184
-
-
Bauer, H.1
Möhring, R.H.2
-
3
-
-
0344823719
-
A simple linear time lexBFS cograph recognition algorithm
-
WG 2003
-
Bretscher, A., Corneil, D., Habib, M., Paul, C. A simple linear time lexBFS cograph recognition algorithm, WG 2003, Lecture Notes in Computer Science 2880 (2003) 119-130.
-
(2003)
Lecture Notes in Computer Science
, vol.2880
, pp. 119-130
-
-
Bretscher, A.1
Corneil, D.2
Habib, M.3
Paul, C.4
-
4
-
-
0000971678
-
Fixed-parameter tractability of graph modification problems for hereditary properties
-
Cai, L. Fixed-parameter tractability of graph modification problems for hereditary properties. Information Processing Letters 58 (1996) 171-176.
-
(1996)
Information Processing Letters
, vol.58
, pp. 171-176
-
-
Cai, L.1
-
5
-
-
0012657153
-
Efficient and practical algorithms for sequential modular decomposition
-
Dahlhaus, E., Gustedt, J., McConnel, R. M. Efficient and practical algorithms for sequential modular decomposition. Journal of Algorithms 41 (2001) 360-387.
-
(2001)
Journal of Algorithms
, vol.41
, pp. 360-387
-
-
Dahlhaus, E.1
Gustedt, J.2
McConnel, R.M.3
-
6
-
-
0000134883
-
Fixed-parameter tractability and completeness I: Basic results
-
Downey, R. G. and Fellows, M. R. Fixed-parameter tractability and completeness I: Basic results. SIAM Journal on Computing 24,4 (1995) 873-921.
-
(1995)
SIAM Journal on Computing
, vol.24
, Issue.4
, pp. 873-921
-
-
Downey, R.G.1
Fellows, M.R.2
-
7
-
-
0029290085
-
Fixed-parameter tractability and completeness II: On completeness for W[1]
-
Downey, R. G. and Fellows, M. R. Fixed-parameter tractability and completeness II: On completeness for W[1]. Theoretical Computer Science 141 (1995) 109-131.
-
(1995)
Theoretical Computer Science
, vol.141
, pp. 109-131
-
-
Downey, R.G.1
Fellows, M.R.2
-
10
-
-
0002521124
-
Transitiv orientierbare graphen
-
Gallai, T. Transitiv orientierbare graphen. Acta Math. Acad. Sci. Hungar. 18 (1967) 26-66.
-
(1967)
Acta Math. Acad. Sci. Hungar.
, vol.18
, pp. 26-66
-
-
Gallai, T.1
-
11
-
-
22344446469
-
Graph-modeled data clustering: Fixed-parameter algorithms for clique generation
-
Gramm, J., Guo, J., Hüffner, F., Niedermeier, R. Graph-modeled data clustering: Fixed-parameter algorithms for clique generation. Theory of Computing Systems 38,4 (2005) 373-392.
-
(2005)
Theory of Computing Systems
, vol.38
, Issue.4
, pp. 373-392
-
-
Gramm, J.1
Guo, J.2
Hüffner, F.3
Niedermeier, R.4
-
12
-
-
21044455172
-
Automated generation of search tree algorithms for hard graph modification problems
-
Gramm, J., Guo, J., Hüffner, F., Niedermeier, R. Automated generation of search tree algorithms for hard graph modification problems. Algorithmica 39,4 (2004) 321-347.
-
(2004)
Algorithmica
, vol.39
, Issue.4
, pp. 321-347
-
-
Gramm, J.1
Guo, J.2
Hüffner, F.3
Niedermeier, R.4
-
13
-
-
35048844276
-
A simple linear-time modular decomposition algorithm for graphs, using order extension
-
Habib, M., Montgolfier, F., Paul, C. A simple linear-time modular decomposition algorithm for graphs, using order extension. 9th Scandinavian Workshop on Algorithm Theory (SWAT 2004), Lecture Notes in Computer Science 3111 (2004).
-
(2004)
9th Scandinavian Workshop on Algorithm Theory (SWAT 2004), Lecture Notes in Computer Science
, vol.3111
-
-
Habib, M.1
Montgolfier, F.2
Paul, C.3
-
14
-
-
0000055363
-
Substitution decomposition and connections with combinatorial optimization
-
Möhring, R. H. and Radermacher, F. J. Substitution decomposition and connections with combinatorial optimization. Ann. Discrete Math. 19 (1984) 257-356.
-
(1984)
Ann. Discrete Math.
, vol.19
, pp. 257-356
-
-
Möhring, R.H.1
Radermacher, F.J.2
-
17
-
-
4544362724
-
Complexity classification of some edge modification problems
-
Natanzon, A., Shamir, R., Sharan, R. Complexity classification of some edge modification problems, Discrete Applied Mathematics 113 (1999) 109-128.
-
(1999)
Discrete Applied Mathematics
, vol.113
, pp. 109-128
-
-
Natanzon, A.1
Shamir, R.2
Sharan, R.3
-
18
-
-
0033874612
-
A general method to speed up fixed-parameter-tractable algorithms
-
Niedermeier, R. and Rossmanith, P. A general method to speed up fixed-parameter-tractable algorithms. Information Processing Letters 73 (2000) 125-129.
-
(2000)
Information Processing Letters
, vol.73
, pp. 125-129
-
-
Niedermeier, R.1
Rossmanith, P.2
-
19
-
-
4544382534
-
Cluster graph modification problems
-
Shamir, R., Sharan, R., Tsur, D. Cluster graph modification problems. Discrete Applied Mathematics 144 (2004) 173-182.
-
(2004)
Discrete Applied Mathematics
, vol.144
, pp. 173-182
-
-
Shamir, R.1
Sharan, R.2
Tsur, D.3
|