Регистрация | Вход в службу | FAQ      [?] 
Recent | Unread | Search | Authors | Tags | Export

AbnerCYH parameterized [27 articles]

Recent papers added to AbnerCYH library classified by the tag parameterized. You can also see everyone's parameterized.
  • Width Parameters Beyond Tree-width and their Applications
    The Computer Journal, Vol. 51, No. 3. (1 May 2008), pp. 326-362.
    by Petr Hlineny, Sang-Il Oum, Detlef Seese, Georg Gottlob
    posted to parameterized graph algorithms by AbnerCYH on 2008-05-02 15:58:05 as **
  • Parameterized Complexity of Geometric Problems
    The Computer Journal, Vol. 51, No. 3. (1 May 2008), pp. 372-384.
    by Panos Giannopoulos, Christian Knauer, Sue Whitesides
    posted to parameterized geometries algorithms by AbnerCYH on 2008-05-02 15:57:51 as **
  • Combinatorial Optimization on Graphs of Bounded Treewidth
    The Computer Journal, Vol. 51, No. 3. (1 May 2008), pp. 255-269.
    by Hans L Bodlaender, Arie M Koster
    posted to parameterized graph algorithms by AbnerCYH on 2008-05-02 15:42:48 as *
  • Fixed-Parameter Tractability, Definability, and Model-Checking
    SIAM Journal on Computing, Vol. 31, No. 1. (2001), pp. 113-145.
    by Jörg Flum, Martin Grohe
    posted to algorithms complexity graph logic parameterized by AbnerCYH on 2008-03-26 09:20:30 as **
  • Techniques for Practical Fixed-Parameter Algorithms
    The Computer Journal, Vol. 51, No. 1. (1 January 2008), pp. 7-25.
    by Falk Huffner, Rolf Niedermeier, Sebastian Wernicke
    posted to algorithms parameterized by AbnerCYH on 2008-01-10 14:03:49 as **
  • On Two Techniques of Combining Branching and Treewidth
    Algorithmica
    by Fedor Fomin, Serge Gaspers, Saket Saurabh, Alexey Stepanov
    posted to algorithms complexity graph math optimization parameterized by AbnerCYH on 2007-12-19 05:34:12 as **
  • Improved Algorithms and Complexity Results for Power Domination in Graphs
    Algorithmica
    by Jiong Guo, Rolf Niedermeier, Daniel Raible
    posted to algorithms complexity graph parameterized by AbnerCYH on 2007-12-10 04:31:52 as **
  • On Fixed-Parameter Tractability and Approximability of NP Optimization Problems
    Journal of Computer and System Sciences, Vol. 54, No. 3. (June 1997), pp. 465-474.
    by Liming Cai, Jianer Chen
    posted to algorithms complexity optimization parameterized by AbnerCYH on 2007-11-15 09:25:10 as **
  • Fixed-Parameter Approximation: Conceptual Framework and Approximability Results
    Parameterized and Exact Computation (2006), pp. 96-108.
    by Liming Cai, Xiuzhen Huang
    posted to algorithms complexity parameterized by AbnerCYH on 2007-11-13 17:12:36 as **
  • Parameterized Approximation Problems
    Parameterized and Exact Computation (2006), pp. 121-129.
    by Rodney Downey, Michael Fellows, Catherine Mccartin
    posted to algorithms complexity parameterized by AbnerCYH on 2007-11-13 17:09:55 as **
  • Parameterized complexity and polynomial-time approximation schemes
    (December 2004)
    by Xiuzhen Huang
    posted to algorithms complexity optimization parameterized by AbnerCYH on 2007-11-13 10:34:03 as **
  • Minimum Membership Set Covering and the Consecutive Ones Property
    Algorithm Theory – SWAT 2006 (2006), pp. 339-350.
    by Michael Dom, Jiong Guo, Rolf Niedermeier, Sebastian Wernicke
    posted to algorithms biology complexity parameterized by AbnerCYH on 2007-11-11 18:09:19 as **
  • On The Parameterized Intractability Of Motif Search Problems
    Combinatorica, Vol. 26, No. 2. (30 April 2006), pp. 141-167.
    by Michael Fellows, Jens Gramm, Rolf Niedermeier
    posted to biology combinatorics complexity graph parameterized by AbnerCYH on 2007-11-10 19:08:20 as **
  • Parameterized Complexity and Biopolymer Sequence Comparison
    The Computer Journal, Vol. 51, No. 3. (27 June 2007), bxm035.
    by Liming Cai, Xiuzhen Huang, Chunmei Liu, Frances Rosamond, Yinglei Song
    posted to biology complexity parameterized by AbnerCYH on 2007-11-10 18:58:22 as **
  • On the Parameterized Intractability of CLOSEST SUBSTRING and Related Problems
    STACS 2002: 19th Annual Symposium on Theoretical Aspects of Computer Science, Antibes - Juan les Pins, France, March 14-16, 2002. Proceedings (2002), pp. 734-734.
    by Michael R Fellows, Jens Gramm, Rolf Niedermeier
    posted to algorithms complexity parameterized by AbnerCYH on 2007-11-10 12:15:48 as **
  • Fixed-parameter tractability and completeness II: On completeness for W[1]
    Theoretical Computer Science, Vol. 141, No. 1-2. (17 April 1995), pp. 109-131.
    by Rod G Downey, Michael R Fellows
    posted to complexity parameterized by AbnerCYH on 2007-11-10 09:34:03 as **
  • Invitation to Fixed Parameter Algorithms (Oxford Lecture Series in Mathematics and Its Applications)
    (20 March 2006)
    by Rolf Niedermeier
    posted to algorithms complexity parameterized by AbnerCYH on 2007-11-10 08:38:48 as **
  • Polynomial time approximation schemes and parameterized complexity
    Discrete Appl. Math., Vol. 155, No. 2. (January 2007), pp. 180-193.
    by Jianer Chen, Xiuzhen Huang, Iyad A Kanj, Ge Xia
    posted to algorithms complexity parameterized by AbnerCYH on 2007-11-08 18:10:38 as **
  • Parameterized Complexity and Approximation Algorithms
    The Computer Journal (28 July 2007), bxm048.
    by Daaniel Marx
    posted to algorithms complexity parameterized by AbnerCYH on 2007-11-08 18:10:33 as ** along with 1 person Kcl
  • Infeasibility of Instance Compression and Succinct PCPs for NP
    No. TR07-096. (2007)
    by Lance Fortnow, Rahul Santhanam
    posted to complexity information parameterized by AbnerCYH on 2007-11-08 17:00:54 as **
  • Some New Techniques in Design and Analysis of Exact (Exponential) Algorithms
    Bulletin of the EATCS, Vol. 87 (2005), pp. 47-77.
    by Fedor V Fomin, Fabrizio Grandoni, Dieter Kratsch
    posted to algorithms parameterized by AbnerCYH on 2007-11-06 13:50:37 as **
  • notes On Parameterized Approximability
    Vol. TR07-106 (28 October 2007)
    by Yijia Chen, Martin Grohe, Magdalena Gruber
    posted to complexity parameterized by AbnerCYH on 2007-11-06 11:20:37 as **
  • The parameterized complexity of sequence alignment and consensus
    Theoretical Computer Science, Vol. 147, No. 1-2. (7 August 1995), pp. 31-54.
    by Hans L Bodlaender, Rodney G Downey, Michael R Fellows, Harold T Wareham
    posted to algorithms complexity parameterized by AbnerCYH on 2007-10-23 09:01:27 as **
  • Linear time algorithms for NP-hard problems restricted to partial k-trees
    Discrete Applied Mathematics, Vol. 23, No. 1. (April 1989), pp. 11-24.
    by Stefan Arnborg, Andrzej Proskurowski
    posted to algorithms graph parameterized by AbnerCYH on 2007-10-03 13:35:29 as **
  • Non deterministic polynomial optimization problems and their approximations
    Theoretical Computer Science, Vol. 15, No. 3. (1981), pp. 251-277.
    by A Paz, S Moran
    posted to algorithms complexity parameterized by AbnerCYH on 2007-10-03 04:20:05 as **
  • Nondeterministic Graph Searching: From Pathwidth to Treewidth
    Algorithmica
    by Fedor Fomin, Pierre Fraigniaud, Nicolas Nisse
    posted to algorithms graph parameterized by AbnerCYH on 2007-10-01 06:07:15 as **
  • Parameterized Algorithmics: A Graph-Theoretic Approach
    (2005)
    by H Fernau
    posted to algorithms graph parameterized by AbnerCYH on 2007-09-23 13:43:35 as **
    • Вы можете ссылаться на эту страницу по адресу: http://www.citeulike.org/user/AbnerCYH/tag/parameterized

    RIS BibTeX RSS
    CiteULike organises scholarly (or academic) papers or literature and provides bibliographic (which means it makes bibliographies) for universities and higher education establishments. It helps undergraduates and postgraduates. People studying for PhDs or in postdoctoral (postdoc) positions. The service is similar in scope to EndNote or RefWorks or any other reference manager like BibTeX, but it is a social bookmarking service for scientists and humanities researchers.