F. Dehne, M. Fellows and F. Rosamond. An FPT algorithm for set splitting. Proceedings of the 29th Workshop on Graph Theoretic Concepts in Computer Science (WG 2003), Springer-Verlag, Lecture Notes in Computer Science 2880 (2003), 180--191. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Parameterized Complexity for the Skeptic - Downey (2003) (15 citations) (Correct)
....h(L) computes machine M which witnesses that L 2 SUBEXPT IME(f(n) One idea introduced by (the somewhat flawed) Cai and Juedes [CJ01] was to see what kinds of exponents FPT algorithms might have. An illustration of this is the following recent results. Theorem 5. 6 (Dehne, Fellows, and Rosamond [DFR03]) There is a O(n 2 2:5 ) algorithm for SET SPLITTING parameterized by the number of sets to be split. However, there can be no FPT algorithm running in time 2 unless the satisfiability of n variable 3SAT is solvable in time Another one is due to Cai and Jeudes (see their homepage) ....
F. Dehne, M. Fellows and F. Rosamond, "An FPT algorithm for Set Splitting," to appear.
FPT Algorithm - For The Undirected Self-citation (Dehne Fellows Rosamond) (Correct)
No context found.
F. Dehne, M. Fellows and F. Rosamond. An FPT algorithm for set splitting. Proceedings of the 29th Workshop on Graph Theoretic Concepts in Computer Science (WG 2003), Springer-Verlag, Lecture Notes in Computer Science 2880 (2003), 180--191.
An O(2^O(k) n³) FPT Algorithm for the.. - Dehne, Fellows.. (2005) Self-citation (Dehne Fellows Rosamond) (Correct)
No context found.
F. Dehne, M. Fellows and F. Rosamond. An FPT algorithm for set splitting. Proceedings of the 29th Workshop on Graph Theoretic Concepts in Computer Science (WG 2003), Springer-Verlag, Lecture Notes in Computer Science 2880 (2003), 180--191.
An O(2^O(k) n³) FPT Algorithm for the.. - Dehne, Fellows.. (2005) Self-citation (Dehne Fellows Rosamond) (Correct)
No context found.
F. Dehne, M. Fellows and F. Rosamond. An FPT algorithm for set splitting. Proceedings of the 29th Workshop on Graph Theoretic Concepts in Computer Science (WG 2003), Springer-Verlag, Lecture Notes in Computer Science 2880 (2003), 180--191.
The Method of Extremal Structure on the k-MAXIMUM CUT Problem - Prieto (2005) (Correct)
No context found.
R. Downey & M. Fellows, Parameterized Complexity, Springer-Verlag , (1999) F. Dehne & M. Fellows & F.Rosamond, An FPT Algorithm for Set Splitting, Proceedings 29th Workshop on Graph Theoretic Concepts in Computer Science, S. Fedin& A. Kulikov, A 2
The Method of Extremal Structure on the k-MAXIMUM CUT Problem - Prieto (2005) (Correct)
No context found.
R. Downey & M. Fellows, Parameterized Complexity, Springer-Verlag , (1999) F. Dehne & M. Fellows & F.Rosamond, An FPT Algorithm for Set Splitting, Proceedings 29th Workshop on Graph Theoretic Concepts in Computer Science, S. Fedin& A. Kulikov, A 2
The Method of Extremal Structure on the k-MAXIMUM CUT Problem - Prieto (2005) (Correct)
No context found.
R. Downey & M. Fellows, Parameterized Complexity, Springer-Verlag , (1999) F. Dehne & M. Fellows & F.Rosamond, An FPT Algorithm for Set Splitting, Proceedings 29th Workshop on Graph Theoretic Concepts in Computer Science, S. Fedin& A. Kulikov, A 2
The Method of Extremal Structure on the k-MAXIMUM CUT Problem - Prieto (2005) (Correct)
No context found.
R. Downey & M. Fellows, Parameterized Complexity, Springer-Verlag , (1999) F. Dehne & M. Fellows & F.Rosamond, An FPT Algorithm for Set Splitting, Proceedings 29th Workshop on Graph Theoretic Concepts in Computer Science, S. Fedin& A. Kulikov, A 2
The Method of Extremal Structure on the k-MAXIMUM CUT Problem - Prieto (2005) (Correct)
No context found.
R. Downey & M. Fellows, Parameterized Complexity, Springer-Verlag , (1999) F. Dehne & M. Fellows & F.Rosamond, An FPT Algorithm for Set Splitting, Proceedings 29th Workshop on Graph Theoretic Concepts in Computer Science, S. Fedin& A. Kulikov, A 2
The Method of Extremal Structure on the k-MAXIMUM CUT Problem - Prieto (2005) (Correct)
No context found.
R. Downey & M. Fellows, Parameterized Complexity, Springer-Verlag , (1999) F. Dehne & M. Fellows & F.Rosamond, An FPT Algorithm for Set Splitting, Proceedings 29th Workshop on Graph Theoretic Concepts in Computer Science, S. Fedin& A. Kulikov, A 2
Packing Edge Disjoint Triangles: A Parameterized View - Mathieson, Prieto, Shaw (Correct)
No context found.
F. Dehne, M. Fellows, F.Rosamond. An FPT Algorithm for Set Splitting. Proceedings 29th Workshop on Graph Theoretic Concepts in Computer Science, Springer Verlag LNCS 2880, (2003).
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC