-
2
-
-
32144451317
-
Färbung von Graphen deren sämtliche beziehungsweise deren ungerade Kreise starr sind (Zusammenfassung)
-
C. Berge, Färbung von Graphen deren sämtliche beziehungsweise deren ungerade Kreise starr sind (Zusammenfassung), Wiss. Z. Martin Luther Univ. Halle Wittenberg Math. Naturwiss. Reihe 114-115.
-
Wiss. Z. Martin Luther Univ. Halle Wittenberg Math. Naturwiss.
, vol.114-115
-
-
Berge, C.1
-
3
-
-
0039703553
-
On the complexity of testing for odd holes and induces odd paths
-
D. Bienstock On the complexity of testing for odd holes and induces odd paths Discrete Math. 90 1 1991 85 92
-
(1991)
Discrete Math.
, vol.90
, Issue.1
, pp. 85-92
-
-
Bienstock, D.1
-
4
-
-
34547690835
-
Corrigendum to: On the complexity of testing for odd holes and induces odd paths
-
D. Bienstock "Corrigendum to: on the complexity of testing for odd holes and induces odd paths" Discrete Math. 102 1 1992 109
-
(1992)
Discrete Math.
, vol.102
, Issue.1
, pp. 109
-
-
Bienstock, D.1
-
5
-
-
0031285145
-
On the parameterized complexity of short computation and factorization
-
L. Cai, J. Chen, R.G. Downey, and M.R. Fellows On the parameterized complexity of short computation and factorization Arch. Math. Logic 36 4-5 1997 321 337
-
(1997)
Arch. Math. Logic
, vol.36
, Issue.4-5
, pp. 321-337
-
-
Cai, L.1
Chen, J.2
Downey, R.G.3
Fellows, M.R.4
-
6
-
-
0037074665
-
Perfect code is W[1]-complete
-
M. Cesati Perfect code is W[1]-complete Inform. Process. Lett. 81 3 2002 163 168
-
(2002)
Inform. Process. Lett.
, vol.81
, Issue.3
, pp. 163-168
-
-
Cesati, M.1
-
7
-
-
0346991454
-
The Turing way to parameterized complexity
-
M. Cesati The Turing way to parameterized complexity J. Comput. Syst. Sci. 67 4 2003 654 685
-
(2003)
J. Comput. Syst. Sci.
, vol.67
, Issue.4
, pp. 654-685
-
-
Cesati, M.1
-
8
-
-
0000177976
-
On the efficiency of polynomial time approximation schemes
-
M. Cesati, and L. Trevisan On the efficiency of polynomial time approximation schemes Inform. Process. Lett. 64 4 1997 165 171
-
(1997)
Inform. Process. Lett.
, vol.64
, Issue.4
, pp. 165-171
-
-
Cesati, M.1
Trevisan, L.2
-
9
-
-
0003551573
-
-
Manuscript
-
M. Chudnovsky, N. Robertson, P.D. Seymour, R. Thomas, The strong perfect graph theorem, Manuscript, 2003.
-
(2003)
The Strong Perfect Graph Theorem
-
-
Chudnovsky, M.1
Robertson, N.2
Seymour, P.D.3
Thomas, R.4
-
11
-
-
0344118906
-
A polynomial algorithm for recognizing perfect graphs
-
G. Cornuéjols, X. Liu, K. Vušković, A polynomial algorithm for recognizing perfect graphs, in: Proc. 44th Annu. IEEE Sympos. Foundation on Computer Science, 2003, pp. 20-27.
-
(2003)
Proc. 44th Annu. IEEE Sympos. Foundation on Computer Science
, pp. 20-27
-
-
Cornuéjols, G.1
Liu, X.2
Vušković, K.3
-
12
-
-
0029290085
-
Fixed-parameter tractability and completeness II: On completeness for W[1]
-
R.G. Downey, and M.R. Fellows Fixed-parameter tractability and completeness II: on completeness for W[1] Theoret. Comput. Sci. 141 1995 109 131
-
(1995)
Theoret. Comput. Sci.
, vol.141
, pp. 109-131
-
-
Downey, R.G.1
Fellows, M.R.2
-
14
-
-
84975202487
-
Parameterized complexity and some problems in logic and linguistics
-
Proc. Second Workshop on Structural Complexity and Recursion-theoretic Methods in Logic-Programming Springer, Berlin
-
R.G. Downey, M.R. Fellows, B. Kapron, M.T. Hallett, H. Todd Wareham, Parameterized complexity and some problems in logic and linguistics, in: Proc. Second Workshop on Structural Complexity and Recursion-theoretic Methods in Logic-Programming, Lecture Notes on Computer Science, Vol. 813, Springer, Berlin, 1994, pp. 89-101.
-
(1994)
Lecture Notes on Computer Science
, vol.813
, pp. 89-101
-
-
Downey, R.G.1
Fellows, M.R.2
Kapron, B.3
Hallett, M.T.4
Todd Wareham, H.5
-
15
-
-
0042864376
-
The Robertson-Seymour theorems: A survey of applications
-
B. Richter (Ed.) American Mathematical Society, Providence, RI
-
M.R. Fellows, The Robertson-Seymour theorems: A survey of applications, in: B. Richter (Ed.), Proc. AMS-IMS-SIAM Joint Summer Research Conf. Contemporary Mathematics, Vol. 89, American Mathematical Society, Providence, RI, 1989, pp. 1-18.
-
(1989)
Proc. AMS-IMS-SIAM Joint Summer Research Conf. Contemporary Mathematics
, vol.89
, pp. 1-18
-
-
Fellows, M.R.1
-
21
-
-
0002884211
-
On the complexity of combinatorial problems
-
R.M. Karp On the complexity of combinatorial problems Networks 5 1975 45 68
-
(1975)
Networks
, vol.5
, pp. 45-68
-
-
Karp, R.M.1
-
22
-
-
0001580189
-
Algorithmic aspects of vertex elimination in graphs
-
G.S. Lueker, D.J. Rose, and R.E. Tarjan Algorithmic aspects of vertex elimination in graphs SIAM J. Comput. 5 1976 266 283
-
(1976)
SIAM J. Comput.
, vol.5
, pp. 266-283
-
-
Lueker, G.S.1
Rose, D.J.2
Tarjan, R.E.3
-
23
-
-
32144463122
-
Non-interfering network flows
-
C. McDiarmid, B. Reed, A. Schrijver, B. Shepherd, Non-interfering network flows, in: Proc. Third Scand. Workshop Algorithm Theory, 1992, pp. 245-257.
-
(1992)
Proc. Third Scand. Workshop Algorithm Theory
, pp. 245-257
-
-
McDiarmid, C.1
Reed, B.2
Schrijver, A.3
Shepherd, B.4
-
25
-
-
26844566791
-
-
Habilitation Thesis, Wilhelm-Schickard Institut für Informatik, Universität Tübingen, Germany
-
R. Niedermeier, Invitation to fixed-parameter algorithms, Habilitation Thesis, Wilhelm-Schickard Institut für Informatik, Universität Tübingen, Germany, 2002.
-
(2002)
Invitation to Fixed-parameter Algorithms
-
-
Niedermeier, R.1
-
28
-
-
0021473698
-
Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs
-
R.E. Tarjan, and M. Yannakakis Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs SIAM J. Comput. 13 1984 566 579
-
(1984)
SIAM J. Comput.
, vol.13
, pp. 566-579
-
-
Tarjan, R.E.1
Yannakakis, M.2
|