Pascal-Francis CNRS

Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("Parameterized algorithms")

Filter

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Language

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Origin

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 42

  • Page / 2
Export

Selection :

  • and

Faster Parameterized Algorithms for MINIMUM FILL-INBODLAENDER, Hans L; HEGGERNES, Pinar; VILLANGER, Yngve et al.Algorithmica. 2011, Vol 61, Num 4, pp 817-838, issn 0178-4617, 22 p.Conference Paper

A parameterized perspective on packing paths of length twoFERNAU, Henning; RAIBLE, Daniel.Journal of combinatorial optimization. 2009, Vol 18, Num 4, pp 319-341, issn 1382-6905, 23 p.Conference Paper

Using nondeterminism to design efficient deterministic algorithmsJIANER CHEN; FRIESEN, Donald K; WEIJIA JIA et al.Algorithmica. 2004, Vol 40, Num 2, pp 83-97, issn 0178-4617, 15 p.Article

Block-graph widthCHANG, Maw-Shang; HUNG, Ling-Ju; KLOKS, Ton et al.Theoretical computer science. 2011, Vol 412, Num 23, pp 2496-2502, issn 0304-3975, 7 p.Article

Parameterized algorithms for d-HITTING SET: The weighted caseFERNAU, Henning.Theoretical computer science. 2010, Vol 411, Num 16-18, pp 1698-1713, issn 0304-3975, 16 p.Article

Clustering with partial informationBODLAENDER, Hans L; FELLOWS, Michael R; HEGGERNES, Pinar et al.Theoretical computer science. 2010, Vol 411, Num 7-9, pp 1202-1211, issn 0304-3975, 10 p.Article

Finding paths of length k in O* (2k) timeWILLIAMS, Ryan.Information processing letters. 2009, Vol 109, Num 6, pp 315-318, issn 0020-0190, 4 p.Article

Multiple hypernode hitting sets and smallest two-cores with targetsDAMASCHKE, Peter.Journal of combinatorial optimization. 2009, Vol 18, Num 3, pp 294-306, issn 1382-6905, 13 p.Conference Paper

The Parameterized Complexity of Unique Coverage and Its VariantsMISRA, Neeldhara; MOSER, Hannes; RAMAN, Venkatesh et al.Algorithmica. 2013, Vol 65, Num 3, pp 517-544, issn 0178-4617, 28 p.Article

Parameterized algorithmics for linear arrangement problemsFERNAU, Henning.Discrete applied mathematics. 2008, Vol 156, Num 17, pp 3166-3177, issn 0166-218X, 12 p.Conference Paper

Planar Feedback Vertex Set and Face Cover: Combinatorial Bounds and Subexponential AlgorithmsKOUTSONAS, Athanassios; THILIKOS, Dimitrios M.Algorithmica. 2011, Vol 60, Num 4, pp 987-1003, issn 0178-4617, 17 p.Article

On parameterized exponential time complexityJIANER CHEN; KANJ, Iyad A; GE XIA et al.Theoretical computer science. 2009, Vol 410, Num 27-29, pp 2641-2648, issn 0304-3975, 8 p.Article

Constraint bipartite vertex cover: simpler exact algorithms and implementationsBAI, Guoqiang; FERNAU, Henning.Journal of combinatorial optimization. 2012, Vol 23, Num 3, pp 331-355, issn 1382-6905, 25 p.Article

A parameterized shared-memory scheme for parameterized metaheuristicsALMEIDA, Francisco; GIMENEZ, Domingo; LOPEZ-ESPIN, Jose J et al.Journal of supercomputing. 2011, Vol 58, Num 3, pp 292-301, issn 0920-8542, 10 p.Conference Paper

Seeing the trees and their branches in the network is hardKANJ, Iyad A; NAKHLEH, Luay; THAN, Cuong et al.Theoretical computer science. 2008, Vol 401, Num 1-3, pp 153-164, issn 0304-3975, 12 p.Article

FPT algorithms for Connected Feedback Vertex SetMISRA, Neeldhara; PHILIP, Geevarghese; RAMAN, Venkatesh et al.Journal of combinatorial optimization. 2012, Vol 24, Num 2, pp 131-146, issn 1382-6905, 16 p.Conference Paper

Minimum fill-in and treewidth of split + ke and split + kv graphsMANCINI, Federico.Discrete applied mathematics. 2010, Vol 158, Num 7, pp 747-754, issn 0166-218X, 8 p.Article

Exact and Parameterized Algorithms for MAX INTERNAL SPANNING TREEBINKELE-RAIBLE, Daniel; FERNAU, Henning; GASPERS, Serge et al.Algorithmica. 2013, Vol 65, Num 1, pp 95-128, issn 0178-4617, 34 p.Article

Facility location problems: A parameterized viewFELLOWS, Michael R; FERNAU, Henning.Discrete applied mathematics. 2011, Vol 159, Num 11, pp 1118-1130, issn 0166-218X, 13 p.Article

The Compatibility of Binary Characters on Phylogenetic Networks : Complexity and Parameterized AlgorithmsKANJ, Iyad A; NAKHLEH, Luay; GE XIA et al.Algorithmica. 2008, Vol 51, Num 2, pp 99-128, issn 0178-4617, 30 p.Article

On the complexity of fixed parameter clique and dominating setEISENBRAND, Friedrich; GRANDONI, Fabrizio.Theoretical computer science. 2004, Vol 326, Num 1-3, pp 57-67, issn 0304-3975, 11 p.Article

The Parameterized Complexity of the Shared Center ProblemCHEN, Zhi-Zhong; WENJI MA; LUSHENG WANG et al.Algorithmica. 2014, Vol 69, Num 2, pp 269-293, issn 0178-4617, 25 p.Article

Parameterized Complexity of the Spanning Tree Congestion ProblemBODLAENDER, Hans L; FOMIN, Fedor V; GOLOVACH, Petr A et al.Algorithmica. 2012, Vol 64, Num 1, pp 85-111, issn 0178-4617, 27 p.Article

Subexponential algorithms for partial cover problemsFOMIN, Fedor V; LOKSHTANOV, Daniel; RAMAN, Venkatesh et al.Information processing letters. 2011, Vol 111, Num 16, pp 814-818, issn 0020-0190, 5 p.Article

On Two Techniques of Combining Branching and TreewidthFOMIN, Fedor V; GASPERS, Serge; SAURABH, Saket et al.Algorithmica. 2009, Vol 54, Num 2, pp 181-207, issn 0178-4617, 27 p.Conference Paper

  • Page / 2