The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Henning Fernau: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Faisal N. Abu-Khzam, Henning Fernau, Michael A. Langston
    Asymptotically Faster Algorithms for Parameterized FACE COVER. [Citation Graph (0, 0)][DBLP]
    ACiD, 2005, pp:43-58 [Conf]
  2. Henning Fernau, David Manlove
    Vertex and Edge Covers with Clustering Properties: Complexity and Algorithms. [Citation Graph (0, 0)][DBLP]
    ACiD, 2006, pp:69-84 [Conf]
  3. Henning Fernau
    Algorithms for Learning Regular Expressions. [Citation Graph (0, 0)][DBLP]
    ALT, 2005, pp:297-311 [Conf]
  4. Henning Fernau
    Identification of Function Distinguishable Languages. [Citation Graph (0, 0)][DBLP]
    ALT, 2000, pp:116-130 [Conf]
  5. Henning Fernau
    Terminal distinguishable languages. [Citation Graph (0, 0)][DBLP]
    AMAI, 2000, pp:- [Conf]
  6. Henning Bordihn, Henning Fernau, Markus Holzer
    On Iterated Sequential Transducers. [Citation Graph (0, 0)][DBLP]
    Grammars and Automata for String Processing, 2003, pp:121-130 [Conf]
  7. Henning Fernau, Rudolf Freund
    Accepting Array Grammars with Control Mechanisms. [Citation Graph (0, 0)][DBLP]
    New Trends in Formal Languages, 1997, pp:95-118 [Conf]
  8. Henning Fernau, Markus Holzer
    External Contextual and Conditional Languages. [Citation Graph (0, 0)][DBLP]
    Recent Topics in Mathematical and Computational Linguistics, 2000, pp:104-120 [Conf]
  9. Henning Fernau, Markus Holzer
    Conditional Context-Free Languages of Finite Index. [Citation Graph (0, 0)][DBLP]
    New Trends in Formal Languages, 1997, pp:10-26 [Conf]
  10. Henning Fernau, Ralf Stiebe
    Valence Grammars with Target Sets. [Citation Graph (0, 0)][DBLP]
    Words, Semigroups, and Transductions, 2001, pp:129-140 [Conf]
  11. Henning Fernau, Torben Hagerup, Naomi Nishimura, Prabhakar Ragde, Klaus Reinhardt
    On the parameterized complexity of the generalized rush hour puzzle. [Citation Graph (0, 0)][DBLP]
    CCCG, 2003, pp:6-9 [Conf]
  12. Henning Fernau
    Parameterized Algorithms for Hitting Set: The Weighted Case. [Citation Graph (0, 0)][DBLP]
    CIAC, 2006, pp:332-343 [Conf]
  13. Jochen Alber, Henning Fernau, Rolf Niedermeier
    Graph Separators: A Parameterized View. [Citation Graph (0, 0)][DBLP]
    COCOON, 2001, pp:318-327 [Conf]
  14. Henning Fernau
    On Parameterized Enumeration. [Citation Graph (0, 0)][DBLP]
    COCOON, 2002, pp:564-573 [Conf]
  15. Henning Fernau
    Efficient Learning of Some Linear Matrix Languages. [Citation Graph (0, 0)][DBLP]
    COCOON, 1999, pp:221-230 [Conf]
  16. Henning Fernau
    Learning Tree Languages from Text. [Citation Graph (0, 0)][DBLP]
    COLT, 2002, pp:153-168 [Conf]
  17. Henning Fernau
    Remarks on Adult Languages of Propagating Systems with Restricted Parallelism. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 1993, pp:90-101 [Conf]
  18. Henning Fernau, Klaus Reinhardt
    Decidability of code properties. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 1999, pp:153-163 [Conf]
  19. Henning Fernau, Ralf Stiebe
    Valuated and Valence Grammars: An Algebraic View. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2001, pp:281-292 [Conf]
  20. Henning Bordihn, Henning Fernau
    Accepting Grammars and Systems: An Overview. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 1995, pp:199-208 [Conf]
  21. Henning Fernau, Michael Kaufmann, Mathias Poths
    Comparing Trees Via Crossing Minimization. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2005, pp:457-469 [Conf]
  22. Henning Fernau, Klaus-Jörn Lange, Klaus Reinhardt
    Advocating Ownership. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1996, pp:286-297 [Conf]
  23. Vida Dujmovic, Henning Fernau, Michael Kaufmann
    Fixed Parameter Algorithms for one-sided crossing minimization Revisited. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2003, pp:332-344 [Conf]
  24. Henning Fernau, Rudolf Freund, Markus Holzer
    Regulated Array Grammars of Finite Index. Part I: Theoretical Investigations. [Citation Graph (0, 0)][DBLP]
    Grammatical Models of Multi-Agent Systems, 1999, pp:157-181 [Conf]
  25. Henning Fernau, Rudolf Freund, Markus Holzer
    Regulated Array Grammars of Finite Index. Part II: Syntactic Pattern Recognition. [Citation Graph (0, 0)][DBLP]
    Grammatical Models of Multi-Agent Systems, 1999, pp:284-296 [Conf]
  26. Jochen Alber, Henning Fernau, Rolf Niedermeier
    Parameterized Complexity: Exponential Speed-Up for Planar Graph Problems. [Citation Graph (0, 0)][DBLP]
    ICALP, 2001, pp:261-272 [Conf]
  27. Henning Fernau, Ludwig Staiger
    Valuations and Unambiguity of Languages, with Applications to Fractal Geometry. [Citation Graph (0, 0)][DBLP]
    ICALP, 1994, pp:11-22 [Conf]
  28. Henning Fernau
    Fragmentation: Enhancing Identifiability. [Citation Graph (0, 0)][DBLP]
    ICGI, 2002, pp:92-105 [Conf]
  29. Henning Fernau
    Extracting Minimum Length Document Type Definitions Is NP-Hard. [Citation Graph (0, 0)][DBLP]
    ICGI, 2004, pp:277-278 [Conf]
  30. Henning Fernau, José M. Sempere
    Permutations and Control Sets for Learning Non-regular Language Families. [Citation Graph (0, 0)][DBLP]
    ICGI, 2000, pp:75-88 [Conf]
  31. Bradford Starkie, Henning Fernau
    The Boisdale Algorithm - An Induction Method for a Subclass of Unification Grammar from Positive Data. [Citation Graph (0, 0)][DBLP]
    ICGI, 2004, pp:235-247 [Conf]
  32. Henning Fernau
    k-gram Extensions of Terminal Distinguishable Languages. [Citation Graph (0, 0)][DBLP]
    ICPR, 2000, pp:2125-2128 [Conf]
  33. Faisal N. Abu-Khzam, Henning Fernau
    Kernels: Annotated, Proper and Induced. [Citation Graph (0, 0)][DBLP]
    IWPEC, 2006, pp:264-275 [Conf]
  34. Henning Fernau
    edge dominating set: Efficient Enumeration-Based Exact Algorithms. [Citation Graph (0, 0)][DBLP]
    IWPEC, 2006, pp:142-153 [Conf]
  35. Falk Hüffner, Stefan Edelkamp, Henning Fernau, Rolf Niedermeier
    Finding Optimal Solutions to Atomix. [Citation Graph (0, 0)][DBLP]
    KI/ÖGAI, 2001, pp:229-243 [Conf]
  36. Henning Fernau
    Nonterminal Complexity of Programmed Grammars. [Citation Graph (0, 0)][DBLP]
    MCU, 2001, pp:202-213 [Conf]
  37. Henning Fernau, Rudolf Freund, Markus Holzer
    The Generative Power of d-Dimensional #-Context-Free Array Grammars. [Citation Graph (0, 0)][DBLP]
    MCU (2), 1998, pp:43-56 [Conf]
  38. Jochen Alber, Hongbing Fan, Michael R. Fellows, Henning Fernau, Rolf Niedermeier, Frances A. Rosamond, Ulrike Stege
    Refined Search Tree Technique for DOMINATING SET on Planar Graphs. [Citation Graph (0, 0)][DBLP]
    MFCS, 2001, pp:111-122 [Conf]
  39. Henning Fernau
    On Unconditional Transfer. [Citation Graph (0, 0)][DBLP]
    MFCS, 1996, pp:348-359 [Conf]
  40. Henning Fernau, David W. Juedes
    A Geometric Approach to Parameterized Algorithms for Domination Problems on Planar Graphs. [Citation Graph (0, 0)][DBLP]
    MFCS, 2004, pp:488-499 [Conf]
  41. Henning Fernau, Rolf Niedermeier
    An Efficient Exact Algorithm for Constraint Bipartite Vertex Cover. [Citation Graph (0, 0)][DBLP]
    MFCS, 1999, pp:387-397 [Conf]
  42. Henning Fernau, Ralf Stiebe
    Regulations by Valences. [Citation Graph (0, 0)][DBLP]
    MFCS, 1997, pp:239-248 [Conf]
  43. Henning Fernau, Ludwig Staiger
    IFS and Control Languages. [Citation Graph (0, 0)][DBLP]
    MFCS, 1998, pp:740-750 [Conf]
  44. Henning Fernau
    Learning XML Grammars. [Citation Graph (0, 0)][DBLP]
    MLDM, 2001, pp:73-87 [Conf]
  45. Frank K. H. A. Dehne, Michael R. Fellows, Henning Fernau, Elena Prieto, Frances A. Rosamond
    NONBLOCKER: Parameterized Algorithmics for minimum dominating set. [Citation Graph (0, 0)][DBLP]
    SOFSEM, 2006, pp:237-245 [Conf]
  46. Henning Fernau
    Approximative Learning of Regular Languages. [Citation Graph (0, 0)][DBLP]
    SOFSEM, 2001, pp:223-232 [Conf]
  47. Henning Fernau
    Two-Layer Planarization: Improving on Parameterized Algorithmics. [Citation Graph (0, 0)][DBLP]
    SOFSEM, 2005, pp:137-146 [Conf]
  48. Henning Fernau
    ROMAN DOMINATION: A Parameterized Perspective. [Citation Graph (0, 0)][DBLP]
    SOFSEM, 2006, pp:262-271 [Conf]
  49. Henning Fernau
    Regulated Grammars with Leftmost Derivation. [Citation Graph (0, 0)][DBLP]
    SOFSEM, 1998, pp:322-331 [Conf]
  50. Henning Fernau, Daniel Raible
    Alliances in Graphs: a Complexity-Theoretic Study. [Citation Graph (0, 0)][DBLP]
    SOFSEM (2), 2007, pp:61-70 [Conf]
  51. Henning Fernau, Rudolf Freund
    Bounded Parallelism in Array Grammars Used for Character Recognition. [Citation Graph (0, 0)][DBLP]
    SSPR, 1996, pp:40-49 [Conf]
  52. Henning Fernau, Rudolf Freund, Markus Holzer
    Character Recognition with k-Head Finite Array Automata. [Citation Graph (0, 0)][DBLP]
    SSPR/SPR, 1998, pp:282-291 [Conf]
  53. Henning Fernau, Agnes Radl
    Algorithms for Learning Function Distinguishable Regular Languages. [Citation Graph (0, 0)][DBLP]
    SSPR/SPR, 2002, pp:64-73 [Conf]
  54. Jianer Chen, Henning Fernau, Iyad A. Kanj, Ge Xia
    Parametric Duality and Kernelization: Lower Bounds and Upper Bounds on Kernel Size. [Citation Graph (0, 0)][DBLP]
    STACS, 2005, pp:269-280 [Conf]
  55. Jochen Alber, Hans L. Bodlaender, Henning Fernau, Rolf Niedermeier
    Fixed Parameter Algorithms for PLANAR DOMINATING SET and Related Problems. [Citation Graph (0, 0)][DBLP]
    SWAT, 2000, pp:97-110 [Conf]
  56. Henning Fernau
    Graph Separator Algorithms: A Refined Analysis. [Citation Graph (0, 0)][DBLP]
    WG, 2002, pp:186-197 [Conf]
  57. Henning Fernau
    Valuations Regular Expressions, and Fractal Geometry. [Citation Graph (0, 0)][DBLP]
    Appl. Algebra Eng. Commun. Comput., 1995, v:7, n:1, pp:59-75 [Journal]
  58. Henning Fernau
    Parallel communicating grammar systems with terminal transmission. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 2001, v:37, n:7, pp:511-540 [Journal]
  59. Henning Fernau
    Unconditional Transfer in Regulated Rewriting. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1997, v:34, n:11, pp:837-857 [Journal]
  60. Henning Fernau, Markus Holzer
    Accepting Multi-Agent Systems II. [Citation Graph (0, 0)][DBLP]
    Acta Cybern., 1996, v:12, n:4, pp:361-380 [Journal]
  61. Jochen Alber, Hans L. Bodlaender, Henning Fernau, Ton Kloks, Rolf Niedermeier
    Fixed Parameter Algorithms for DOMINATING SET and Related Problems on Planar Graphs. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2002, v:33, n:4, pp:461-493 [Journal]
  62. Henning Fernau
    Identifying Terminal Distinguishable Languages. [Citation Graph (0, 0)][DBLP]
    Ann. Math. Artif. Intell., 2004, v:40, n:3-4, pp:263-282 [Journal]
  63. Henning Fernau, Markus Holzer, Henning Bordihn
    Accepting Multi-Agent Systems. [Citation Graph (0, 0)][DBLP]
    Computers and Artificial Intelligence, 1996, v:15, n:2-3, pp:- [Journal]
  64. Henning Fernau
    Education(al) matters: teaching P versus NP. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 2003, v:80, n:, pp:237-246 [Journal]
  65. Henning Fernau
    A predicate for separating language classes. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1995, v:56, n:, pp:- [Journal]
  66. Henning Fernau
    Closure Properties of Ordered Languages. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1996, v:58, n:, pp:- [Journal]
  67. Jochen Alber, Henning Fernau, Rolf Niedermeier
    Parameterized Complexity: Exponential Speed-Up for Planar Graph Problems [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2001, v:8, n:23, pp:- [Journal]
  68. Henning Fernau
    Parametric Duality: Kernel Sizes and Algorithmics [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2004, v:, n:027, pp:- [Journal]
  69. Henning Fernau
    A Top-Down Approach to Search-Trees: Improved Algorithmics for 3-Hitting Set [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2004, v:, n:073, pp:- [Journal]
  70. Henning Fernau
    Two-Layer Planarization: Improving on Parameterized Algorithmics [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2004, v:, n:078, pp:- [Journal]
  71. Henning Fernau
    On Function-limited Lindenmayer Systems. [Citation Graph (0, 0)][DBLP]
    Elektronische Informationsverarbeitung und Kybernetik, 1991, v:27, n:1, pp:21-53 [Journal]
  72. Henning Fernau
    Adult Languages of Propagating Systems with Restricted Parallelism. [Citation Graph (0, 0)][DBLP]
    Elektronische Informationsverarbeitung und Kybernetik, 1993, v:29, n:5, pp:249-267 [Journal]
  73. Henning Fernau
    Membership for 1-Limited ET0L Languages Is Not Decidable. [Citation Graph (0, 0)][DBLP]
    Elektronische Informationsverarbeitung und Kybernetik, 1994, v:30, n:4, pp:191-211 [Journal]
  74. Henning Bordihn, Henning Fernau, Markus Holzer
    On Accepting Pure Lindenmayer Systems. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1999, v:38, n:4, pp:365-375 [Journal]
  75. Henning Fernau
    On Grammar and Language Families. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1996, v:25, n:1, pp:17-34 [Journal]
  76. Henning Fernau, Rudolf Freund, Markus Holzer
    Representations of Recursively Enumerable Array Languages by Contextual Array Grammars. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2005, v:64, n:1-4, pp:159-170 [Journal]
  77. Henning Fernau, Ralf Stiebe
    Valences in Lindenmayer Systems. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2001, v:45, n:4, pp:329-358 [Journal]
  78. Henning Fernau
    Regulated Grammars under Leftmost Derivation. [Citation Graph (0, 0)][DBLP]
    Grammars, 2000, v:3, n:1, pp:37-62 [Journal]
  79. Henning Fernau
    Parallel Grammars: A Phenomenology. [Citation Graph (0, 0)][DBLP]
    Grammars, 2003, v:6, n:1, pp:25-87 [Journal]
  80. Henning Fernau, Ludwig Staiger
    Iterated Function Systems and Control Languages. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2001, v:168, n:2, pp:125-143 [Journal]
  81. Jürgen Dassow, Henning Fernau, Gheorghe Paun
    On the Leftmost Derivation in Matrix Grammars. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 1999, v:10, n:1, pp:61-80 [Journal]
  82. Henning Fernau
    A Note on Uniformly Limited ETOL Systems with Unique Interpretation. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1995, v:54, n:4, pp:199-204 [Journal]
  83. Henning Fernau, Alexander Meduna
    A simultaneous reduction of several measures of descriptional complexity in scattered context grammars. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2003, v:86, n:5, pp:235-240 [Journal]
  84. Jochen Alber, Henning Fernau, Rolf Niedermeier
    Parameterized complexity: exponential speed-up for planar graph problems. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2004, v:52, n:1, pp:26-56 [Journal]
  85. Henning Fernau, Rolf Niedermeier
    An Efficient Exact Algorithm for Constraint Bipartite Vertex Cover. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2001, v:38, n:2, pp:374-410 [Journal]
  86. Henning Bordihn, Henning Fernau
    Accepting Grammars and Systems via Context Condition Grammars. [Citation Graph (0, 0)][DBLP]
    Journal of Automata, Languages and Combinatorics, 1996, v:1, n:2, pp:97-112 [Journal]
  87. Henning Fernau
    Membership for k-Limited ET0L Languages Is Not Decidable. [Citation Graph (0, 0)][DBLP]
    Journal of Automata, Languages and Combinatorics, 1996, v:1, n:4, pp:243-246 [Journal]
  88. Henning Fernau
    Graph-Controlled Grammars as Language Acceptors. [Citation Graph (0, 0)][DBLP]
    Journal of Automata, Languages and Combinatorics, 1997, v:2, n:2, pp:79-92 [Journal]
  89. Henning Fernau, Markus Holzer
    Graph-Controlled Cooperating Distributed Grammar Systems with Singleton Components. [Citation Graph (0, 0)][DBLP]
    Journal of Automata, Languages and Combinatorics, 2002, v:7, n:4, pp:487-503 [Journal]
  90. Henning Fernau, Frank Stephan
    Characterizations of Recursively Enumerable Sets by Programmed Grammars With Unconditional Transfer. [Citation Graph (0, 0)][DBLP]
    Journal of Automata, Languages and Combinatorics, 1999, v:4, n:2, pp:117-152 [Journal]
  91. Jochen Alber, Hongbing Fan, Michael R. Fellows, Henning Fernau, Rolf Niedermeier, Frances A. Rosamond, Ulrike Stege
    A refined search tree technique for Dominating Set on planar graphs. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2005, v:71, n:4, pp:385-405 [Journal]
  92. Jochen Alber, Henning Fernau, Rolf Niedermeier
    Graph separators: a parameterized view. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2003, v:67, n:4, pp:808-832 [Journal]
  93. Henning Fernau
    Two-Layer Planarization: Improving on Parameterized Algorithmics. [Citation Graph (0, 0)][DBLP]
    J. Graph Algorithms Appl., 2005, v:9, n:2, pp:205-238 [Journal]
  94. Henning Fernau
    Remarks on Propagating Partition-Limited ETOL Systems. [Citation Graph (0, 0)][DBLP]
    J. UCS, 1996, v:2, n:11, pp:745-755 [Journal]
  95. Henning Fernau
    Even linear simple matrix languages: formal language properties and grammatical inference. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:289, n:1, pp:425-456 [Journal]
  96. Henning Fernau
    Identification of function distinguishable languages. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:290, n:3, pp:1679-1711 [Journal]
  97. Henning Fernau
    Nonterminal complexity of programmed grammars. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:2, n:296, pp:225-251 [Journal]
  98. Henning Fernau
    Valuations of Languages, with Applications to Fractal Geometry. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1995, v:137, n:2, pp:177-217 [Journal]
  99. Henning Fernau, Markus Holzer, Rudolf Freund
    Hybrid modes in cooperating distributed grammar systems: internal versus external hybridization. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:259, n:1-2, pp:405-426 [Journal]
  100. Henning Fernau, Markus Holzer, Rudolf Freund
    Hybrid modes in cooperating distributed grammar systems: combining the t-mode with the modes le k and =k. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:299, pp:633-662 [Journal]
  101. Henning Fernau, Alexander Meduna
    On the degree of scattered context-sensitivity. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:290, n:3, pp:2121-2124 [Journal]
  102. Henning Fernau, Ralf Stiebe
    Sequential grammars and automata with valences. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:276, n:1-2, pp:377-405 [Journal]
  103. Henning Fernau, Dietmar Wätjen
    Remarks on Regulated Limited ET0L Systems and Regulated Context-Free Grammars. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1998, v:194, n:1-2, pp:35-55 [Journal]
  104. Henning Bordihn, Henning Fernau, Markus Holzer, Vincenzo Manca, Carlos Martín-Vide
    Iterated sequential transducers as language generating devices. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:369, n:1-3, pp:67-81 [Journal]

  105. Facility Location Problems: A Parameterized View. [Citation Graph (, )][DBLP]


  106. A Parameterized Route to Exact Puzzles: Breaking the 2n-Barrier for Irredundance. [Citation Graph (, )][DBLP]


  107. The Curse of Connectivity: t-Total Vertex (Edge) Cover. [Citation Graph (, )][DBLP]


  108. A Faster Exact Algorithm for the Directed Maximum Leaf Spanning Tree Problem. [Citation Graph (, )][DBLP]


  109. Exact Elimination of Cycles in Graphs. [Citation Graph (, )][DBLP]


  110. Bounding resources in Cooperating Distributed Grammar Systems. [Citation Graph (, )][DBLP]


  111. How Powerful is Unconditional Transfer? - When UT meets AC. [Citation Graph (, )][DBLP]


  112. An Optimal Construction of Finite Automata from Regular Expressions. [Citation Graph (, )][DBLP]


  113. Hölder Norms and a Hierarchy Theorem for Parameterized Classes of CCG. [Citation Graph (, )][DBLP]


  114. Power Domination in O*(1.7548n) Using Reference Search Trees. [Citation Graph (, )][DBLP]


  115. An Exact Algorithm for the Maximum Leaf Spanning Tree Problem. [Citation Graph (, )][DBLP]


  116. A New Upper Bound for Max-2-SAT: A Graph-Theoretic Approach. [Citation Graph (, )][DBLP]


  117. Local elimination-strategies in automata for shorter regular expressions. [Citation Graph (, )][DBLP]


  118. An Amortized Search Tree Analysis for k-Leaf Spanning Tree. [Citation Graph (, )][DBLP]


  119. Kernel(s) for Problems with No Kernel: On Out-Trees with Many Leaves. [Citation Graph (, )][DBLP]


  120. Searching Trees: An Essay. [Citation Graph (, )][DBLP]


  121. Exact and Parameterized Algorithms for Max Internal Spanning Tree. [Citation Graph (, )][DBLP]


  122. Exact Algorithms for Maximum Acyclic Subgraph on a Superclass of Cubic Graphs. [Citation Graph (, )][DBLP]


  123. A Parameterized Perspective on Packing Paths of Length Two. [Citation Graph (, )][DBLP]


  124. Constraint Bipartite Vertex Cover: Simpler Exact Algorithms and Implementations. [Citation Graph (, )][DBLP]


  125. Finding Consistent Categorial Grammars of Bounded Value: A Parameterized Approach. [Citation Graph (, )][DBLP]


  126. Dynamic programming for queen domination. [Citation Graph (, )][DBLP]


  127. Global r-alliances and total domination. [Citation Graph (, )][DBLP]


  128. Packing Paths: Recycling Saves Time. [Citation Graph (, )][DBLP]


  129. Exact Exponential-Time Algorithms for Finding Bicliques in a Graph. [Citation Graph (, )][DBLP]


  130. The Complexity of Probabilistic Lobbying. [Citation Graph (, )][DBLP]


  131. A Top-Down Approach to Search-Trees: Improved Algorithmics for 3-Hitting Set. [Citation Graph (, )][DBLP]


  132. A New Upper Bound for Max-2-Sat: A Graph-Theoretic Approach [Citation Graph (, )][DBLP]


  133. A Parameterized Perspective on P2-Packings [Citation Graph (, )][DBLP]


  134. Kernel(s) for Problems With no Kernel: On Out-Trees With Many Leaves [Citation Graph (, )][DBLP]


  135. Exact Exponential Time Algorithms for Max Internal Spanning Tree [Citation Graph (, )][DBLP]


  136. The Complexity of Probabilistic Lobbying [Citation Graph (, )][DBLP]


  137. Breaking the 2^n-Barrier for Irredundance: A Parameterized Route to Solving Exact Puzzles [Citation Graph (, )][DBLP]


  138. A Faster Exact Algorithm for the Directed Maximum Leaf Spanning Tree Problem [Citation Graph (, )][DBLP]


  139. Parameterized algorithmics for linear arrangement problems. [Citation Graph (, )][DBLP]


  140. Offensive r-alliances in graphs. [Citation Graph (, )][DBLP]


  141. On the complement graph and defensive k-alliances. [Citation Graph (, )][DBLP]


  142. minimum dominating set of queens: A trivial programming exercise? [Citation Graph (, )][DBLP]


  143. A sum labelling for the generalised friendship graph. [Citation Graph (, )][DBLP]


  144. Parameterized Algorithms for Hitting Set: the Weighted Case. [Citation Graph (, )][DBLP]


Search in 0.014secs, Finished in 0.017secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002