, Digraphs: Theory, Algorithms and Applications, 2009.
DOI : 10.1007/978-1-84800-998-1
, Amortized Analysis of Exponential Time-and Parameterized Algorithms: Measure & Conquer and Reference Search Trees, Fachbereich IV, 2010.
, Breaking the <mml:math altimg="si1.gif" overflow="scroll" xmlns:xocs="http://www.elsevier.com/xml/xocs/dtd" xmlns:xs="http://www.w3.org/2001/XMLSchema" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.elsevier.com/xml/ja/dtd" xmlns:ja="http://www.elsevier.com/xml/ja/dtd" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:tb="http://www.elsevier.com/xml/common/table/dtd" xmlns:sb="http://www.elsevier.com/xml/common/struct-bib/dtd" xmlns:ce="http://www.elsevier.com/xml/common/dtd" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:cals="http://www.elsevier.com/xml/common/cals/dtd"><mml:msup><mml:mn>2</mml:mn><mml:mi>n</mml:mi></mml:msup></mml:math>-barrier for Irredundance: Two lines of attack, Journal of Discrete Algorithms, vol.9, issue.3, pp.214-230, 2011.
DOI : 10.1016/j.jda.2011.03.002
, A new upper bound for Max-2-SAT: A graph-theoretic approach, Journal of Discrete Algorithms, vol.8, issue.4, pp.388-401, 2010.
DOI : 10.1016/j.jda.2010.06.001
, An Exact Exponential Time Algorithm for Power Dominating Set, Algorithmica, vol.359, issue.1???3, pp.323-346, 2012.
DOI : 10.1007/s00453-011-9533-2
, An exact exponential-time algorithm for the Directed Maximum Leaf Spanning Tree problem, Journal of Discrete Algorithms, vol.15, pp.43-55, 2012.
DOI : 10.1016/j.jda.2012.03.006
, Exact and Parameterized Algorithms for Max Internal Spanning Tree, Algorithmica, vol.93, issue.50, pp.95-128, 2013.
DOI : 10.1007/s00453-011-9575-5
URL : https://hal.archives-ouvertes.fr/hal-00942924
, Connected Dominating Set in Sensor Networks and MANETs, Handbook of Combinatorial Optimization, pp.329-369, 2005.
DOI : 10.1007/0-387-23830-1_8
, A Faster FPT Algorithm for Finding Spanning Trees with Many Leaves, Mathematical Foundations of Computer Science MFCS LNCS, vol.2747, pp.259-268, 2003.
DOI : 10.1007/978-3-540-45138-9_20
, A 3/2-approximation algorithm for finding spanning trees with many leaves in cubic graphs, Graph-Theoretic Concepts in Computer Science, 34th International Workshop, pp.66-77, 2008.
, Spanning Trees with Many Leaves in Graphs without Diamonds and Blossoms, LNCS, vol.4957, pp.531-543, 2008.
DOI : 10.1007/978-3-540-78773-0_46
, Labeled Search Trees and Amortized Analysis: Improved Upper Bounds for NP-Hard Problems, Algorithmica, vol.43, issue.4, pp.245-273, 2005.
DOI : 10.1007/s00453-004-1145-7
, FPT algorithms and kernels for the Directed k-Leaf problem, Journal of Computer and System Sciences, vol.76, issue.2, pp.144-152, 2010.
DOI : 10.1016/j.jcss.2009.06.005
URL : https://hal.archives-ouvertes.fr/lirmm-00432901
, NP-completeness and degree restricted spanning trees, Discrete Mathematics, vol.105, issue.1-3, pp.41-47, 1992.
DOI : 10.1016/0012-365X(92)90130-8
URL : http://doi.org/10.1016/0012-365x(92)90130-8
, FPT is P-time extremal structure I, Algorithms and Complexity in Durham ACiD 2005, pp.1-41, 2005.
, The complexity ecology of parameters: An illustration using bounded max leaf number, Theory of Computing Systems, pp.822-848, 2009.
, Coordinatized kernels and catalytic reductions: an improved FPT algorithm for Max Leaf Spanning Tree and other problems, Foundations of Software Technology and Theoretical Computer Science, 20th Conference, FST TCS, pp.240-251, 1974.
, An exact algorithm for the Maximum Leaf Spanning Tree problem, Theoretical Computer Science, issue.45, pp.4126290-6302, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00460824
, Exact Algorithms for Maximum Acyclic Subgraph on a Superclass of Cubic Graphs, Workshop on Algorithms and Computation: WALCOM, pp.144-156, 2008.
DOI : 10.1007/978-3-540-77891-2_14
, Solving Connected Dominating Set faster than 2 n . Algorithmica, pp.153-166, 2008.
DOI : 10.1007/11944836_16
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.103.5347
, Exact Exponential Algorithms. Texts in Theoretical Computer Science, 2010.
DOI : 10.1007/978-3-642-16533-7
URL : https://hal.archives-ouvertes.fr/hal-00085561
, Approximation Algorithms for Connected Dominating Sets, Algorithmica, vol.20, issue.4, pp.374-387, 1998.
DOI : 10.1007/PL00009201
, A New Algorithm for Finding Trees with Many Leaves, Algorithmica, vol.6, issue.7, pp.882-897, 2011.
DOI : 10.1007/s00453-010-9454-5
, Limits and applications of group algebras for parameterized problems, Automata, Languages and Programming, 36th International Colloquium, ICALP 2009, Proceedings, Part I, pp.653-664, 2009.
, Approximating Maximum Leaf Spanning Trees in Almost Linear Time, Journal of Algorithms, vol.29, issue.1, pp.132-141, 1998.
DOI : 10.1006/jagm.1998.0944
, A Power Aware Minimum Connected Dominating Set for Wireless Sensor Networks, Journal of Networks, vol.4, issue.6, 2009.
DOI : 10.4304/jnw.4.6.511-519
, An Amortized Search Tree Analysis for k-Leaf Spanning Tree, SOFSEM 2010: Theory and Practice of Computer Science, pp.672-684, 2010.
DOI : 10.1007/978-3-642-11266-9_56
, The connected domination number of a graph, Journal of Mathematical and Physical Sciences, vol.13, issue.6, pp.607-613, 1979.
, Approximationsalgorithmen für das gerichtete Maximum-Leaf-Spanning-Tree-Problem, 2011.
, Approximation Algorithms for the Maximum Leaf Spanning Tree Problem on Acyclic Digraphs, Approximation and Online Algorithms ? 9th International Workshop, pp.77-88, 2011.
DOI : 10.1007/978-3-642-29116-6_7
, 2-approximation algorithm for finding a spanning tree with maximum number of leaves, Algorithms?ESA '98, 6th Annual European Symposium, volume 1461 of LNCS, pp.441-452, 1998.
, Connected Dominating Sets in Wireless Networks with Different Transmission Ranges, IEEE Transactions on Mobile Computing, vol.6, issue.7, pp.721-730, 2007.
DOI : 10.1109/TMC.2007.1034
, Algorithms, Measures and Upper Bounds for Satisfiability and Related Problems, 2007.