The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Fedor V. Fomin: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Hans L. Bodlaender, Hajo Broersma, Fedor V. Fomin, Artem V. Pyatkin, Gerhard J. Woeginger
    Radio Labeling with Pre-assigned Frequencies. [Citation Graph (0, 0)][DBLP]
    ESA, 2002, pp:211-222 [Conf]
  2. Hans L. Bodlaender, Fedor V. Fomin, Arie M. C. A. Koster, Dieter Kratsch, Dimitrios M. Thilikos
    On Exact Algorithms for Treewidth. [Citation Graph (0, 0)][DBLP]
    ESA, 2006, pp:672-683 [Conf]
  3. Frederic Dorn, Eelko Penninkx, Hans L. Bodlaender, Fedor V. Fomin
    Efficient Exact Algorithms on Planar Graphs: Exploiting Sphere Cut Branch Decompositions. [Citation Graph (0, 0)][DBLP]
    ESA, 2005, pp:95-106 [Conf]
  4. Jirí Fiala, Aleksei V. Fishkin, Fedor V. Fomin
    Online and Offline Distance Constrained Labeling of Disk Graphs. [Citation Graph (0, 0)][DBLP]
    ESA, 2001, pp:464-475 [Conf]
  5. Fedor V. Fomin, Dimitrios M. Thilikos
    Dominating Sets and Local Treewidth. [Citation Graph (0, 0)][DBLP]
    ESA, 2003, pp:221-229 [Conf]
  6. Fedor V. Fomin, Pinar Heggernes, Dieter Kratsch
    Exact Algorithms for Graph Homomorphisms. [Citation Graph (0, 0)][DBLP]
    FCT, 2005, pp:161-171 [Conf]
  7. Fedor V. Fomin, Pinar Heggernes, Jan Arne Telle
    Graph Searching, Elimination Trees, and a Generalization of Bandwidth. [Citation Graph (0, 0)][DBLP]
    FCT, 2003, pp:73-85 [Conf]
  8. Fedor V. Fomin, Dieter Kratsch, Jean-Christophe Novelli
    Approximating Minimum Cocolourings. [Citation Graph (0, 0)][DBLP]
    FCT, 2001, pp:118-125 [Conf]
  9. Fedor V. Fomin, Andrzej Lingas
    Approximation Algorithms for Time-Dependent Orienteering. [Citation Graph (0, 0)][DBLP]
    FCT, 2001, pp:508-515 [Conf]
  10. Fedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch
    Solving Connected Dominating Set Faster Than 2n. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2006, pp:152-163 [Conf]
  11. Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos
    Fixed-Parameter Algorithms for the (k, r)-Center in Planar Graphs and Map Graphs. [Citation Graph (0, 0)][DBLP]
    ICALP, 2003, pp:829-844 [Conf]
  12. Fedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch
    Measure and Conquer: Domination - A Case Study. [Citation Graph (0, 0)][DBLP]
    ICALP, 2005, pp:191-203 [Conf]
  13. Fedor V. Fomin, Dieter Kratsch, Ioan Todinca
    Exact (Exponential) Algorithms for Treewidth and Minimum Fill-In. [Citation Graph (0, 0)][DBLP]
    ICALP, 2004, pp:568-580 [Conf]
  14. Fedor V. Fomin, Dimitrios M. Thilikos
    Fast Parameterized Algorithms for Graphs on Surfaces: Linear Kernel and Exponential Speed-Up. [Citation Graph (0, 0)][DBLP]
    ICALP, 2004, pp:581-592 [Conf]
  15. Fedor V. Fomin, Fabrizio Grandoni, Artem V. Pyatkin, Alexey A. Stepanov
    Bounding the Number of Minimal Dominating Sets: A Measure and Conquer Approach. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2005, pp:573-582 [Conf]
  16. Fedor V. Fomin, Serge Gaspers, Saket Saurabh
    Branching and Treewidth Based Exact Algorithms. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2006, pp:16-25 [Conf]
  17. Fedor V. Fomin, Serge Gaspers, Artem V. Pyatkin
    Finding a Minimum Feedback Vertex Set in Time O (1.7548n). [Citation Graph (0, 0)][DBLP]
    IWPEC, 2006, pp:184-191 [Conf]
  18. Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos
    Bidimensional Parameters and Local Treewidth. [Citation Graph (0, 0)][DBLP]
    LATIN, 2004, pp:109-118 [Conf]
  19. Hans L. Bodlaender, Fedor V. Fomin
    Equitable Colorings of Bounded Treewidth Graphs. [Citation Graph (0, 0)][DBLP]
    MFCS, 2004, pp:180-190 [Conf]
  20. Hajo Broersma, Fedor V. Fomin, Gerhard J. Woeginger
    Parallel Knock-Out Schemes in Networks. [Citation Graph (0, 0)][DBLP]
    MFCS, 2004, pp:204-214 [Conf]
  21. Johanne Cohen, Fedor V. Fomin, Pinar Heggernes, Dieter Kratsch, Gregory Kucherov
    Optimal Linear Arrangement of Interval Graphs. [Citation Graph (0, 0)][DBLP]
    MFCS, 2006, pp:267-279 [Conf]
  22. Fedor V. Fomin, Pierre Fraigniaud, Nicolas Nisse
    Nondeterministic Graph Searching: From Pathwidth to Treewidth. [Citation Graph (0, 0)][DBLP]
    MFCS, 2005, pp:364-375 [Conf]
  23. Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos
    Subexponential parameterized algorithms on graphs of bounded-genus and H-minor-free graphs. [Citation Graph (0, 0)][DBLP]
    SODA, 2004, pp:830-839 [Conf]
  24. Fedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch
    Measure and conquer: a simple O(20.288n) independent set algorithm. [Citation Graph (0, 0)][DBLP]
    SODA, 2006, pp:18-25 [Conf]
  25. Fedor V. Fomin, Dimitrios M. Thilikos
    Dominating sets in planar graphs: branch-width and exponential speed-up. [Citation Graph (0, 0)][DBLP]
    SODA, 2003, pp:168-177 [Conf]
  26. Fedor V. Fomin, Dimitrios M. Thilikos
    A Simple and Fast Approach for Solving Problems on Planar Graphs. [Citation Graph (0, 0)][DBLP]
    STACS, 2004, pp:56-67 [Conf]
  27. Hans L. Bodlaender, Fedor V. Fomin
    Tree Decompositions with Small Cost. [Citation Graph (0, 0)][DBLP]
    SWAT, 2002, pp:378-387 [Conf]
  28. Hajo Broersma, Fedor V. Fomin, Jan Kratochvíl, Gerhard J. Woeginger
    Planar Graph Coloring with Forbidden Subgraphs: Why Trees and Paths Are Dangerous. [Citation Graph (0, 0)][DBLP]
    SWAT, 2002, pp:160-169 [Conf]
  29. Frederic Dorn, Fedor V. Fomin, Dimitrios M. Thilikos
    Fast Subexponential Algorithm for Non-local Problems on Graphs of Bounded Genus. [Citation Graph (0, 0)][DBLP]
    SWAT, 2006, pp:172-183 [Conf]
  30. Hajo Broersma, Fedor V. Fomin, Petr A. Golovach, Gerhard J. Woeginger
    Backbone Colorings for Networks. [Citation Graph (0, 0)][DBLP]
    WG, 2003, pp:131-142 [Conf]
  31. Hajo Broersma, Fedor V. Fomin, Jaroslav Nesetril, Gerhard J. Woeginger
    More about Subcolorings. [Citation Graph (0, 0)][DBLP]
    WG, 2002, pp:68-79 [Conf]
  32. Fedor V. Fomin, Hans L. Bodlaender
    Approximation of Pathwidth of Outerplanar Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 2001, pp:166-176 [Conf]
  33. Fedor V. Fomin, Petr A. Golovach
    Interval Completion with the Smallest Max-degree. [Citation Graph (0, 0)][DBLP]
    WG, 1998, pp:359-371 [Conf]
  34. Fedor V. Fomin, Dieter Kratsch, Haiko Müller
    On the Domination Search Number. [Citation Graph (0, 0)][DBLP]
    WG, 2000, pp:161-171 [Conf]
  35. Fedor V. Fomin, Dieter Kratsch, Gerhard J. Woeginger
    Exact (Exponential) Algorithms for the Dominating Set Problem. [Citation Graph (0, 0)][DBLP]
    WG, 2004, pp:245-256 [Conf]
  36. Fedor V. Fomin, Martín Matamala, Ivan Rapaport
    The Complexity of Approximating the Oriented Diameter of Chordal Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 2002, pp:211-222 [Conf]
  37. Fedor V. Fomin, Frédéric Mazoit, Ioan Todinca
    Computing Branchwidth Via Efficient Triangulations and Blocks. [Citation Graph (0, 0)][DBLP]
    WG, 2005, pp:374-384 [Conf]
  38. Fedor V. Fomin, Dimitrios M. Thilikos
    On the Monotonicity of Games Generated by Symmetric Submodular Functions. [Citation Graph (0, 0)][DBLP]
    WG, 2001, pp:177-188 [Conf]
  39. Hajo Broersma, Fedor V. Fomin, Jan Kratochvíl, Gerhard J. Woeginger
    Planar Graph Coloring Avoiding Monochromatic Subgraphs: Trees and Paths Make It Difficult. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2006, v:44, n:4, pp:343-361 [Journal]
  40. Fedor V. Fomin, Pinar Heggernes, Jan Arne Telle
    Graph Searching, Elimination Trees, and a Generalization of Bandwidth. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2004, v:41, n:2, pp:73-87 [Journal]
  41. Hajo Broersma, Fedor V. Fomin, Jaroslav Nesetril, Gerhard J. Woeginger
    More About Subcolorings. [Citation Graph (0, 0)][DBLP]
    Computing, 2002, v:69, n:3, pp:187-203 [Journal]
  42. Hans L. Bodlaender, Fedor V. Fomin
    Tree decompositions with small cost. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2005, v:145, n:2, pp:143-154 [Journal]
  43. Fedor V. Fomin
    Searching expenditure and interval graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:135, n:1-3, pp:97-104 [Journal]
  44. Fedor V. Fomin
    Helicopter Search Problems, Bandwidth and Pathwidth. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1998, v:85, n:1, pp:59-70 [Journal]
  45. Fedor V. Fomin
    Note on a Helicopter Search Problem on Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1999, v:95, n:1-3, pp:241-249 [Journal]
  46. Fedor V. Fomin, Petr A. Golovach
    Interval degree and bandwidth of a graph. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:129, n:2-3, pp:345-359 [Journal]
  47. Fedor V. Fomin, Dieter Kratsch, Haiko Müller
    On the Domination Search Number. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:127, n:3, pp:565-580 [Journal]
  48. Fedor V. Fomin, Dieter Kratsch, Haiko Müller
    Algorithms for graphs with small octopus. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:134, n:1-3, pp:105-128 [Journal]
  49. Fedor V. Fomin, Martín Matamala, Erich Prisner, Ivan Rapaport
    AT-free graphs: linear bounds for the oriented diameter. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:141, n:1-3, pp:135-148 [Journal]
  50. Fedor V. Fomin, Dimitrios M. Thilikos
    On the monotonicity of games generated by symmetric submodular functions. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:131, n:2, pp:323-335 [Journal]
  51. Hajo Broersma, Fedor V. Fomin, Rastislav Kralovic, Gerhard J. Woeginger
    Eliminating graphs by means of parallel knock-out schemes. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2007, v:155, n:2, pp:92-102 [Journal]
  52. Fedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch
    Some New Techniques in Design and Analysis of Exact (Exponential) Algorithms. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 2005, v:87, n:, pp:47-77 [Journal]
  53. Fedor V. Fomin
    Pathwidth of Planar and Line Graphs. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2003, v:19, n:1, pp:91-99 [Journal]
  54. Fedor V. Fomin, Kjartan Høie
    Pathwidth of cubic graphs and exact algorithms. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2006, v:97, n:5, pp:191-196 [Journal]
  55. Fedor V. Fomin, Dieter Kratsch, Jean-Christophe Novelli
    Approximating minimum cocolorings. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2002, v:84, n:5, pp:285-290 [Journal]
  56. Fedor V. Fomin, Andrzej Lingas
    Approximation algorithms for time-dependent orienteering. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2002, v:83, n:2, pp:57-62 [Journal]
  57. Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos
    Subexponential parameterized algorithms on bounded-genus graphs and H-minor-free graphs. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2005, v:52, n:6, pp:866-893 [Journal]
  58. Hans L. Bodlaender, Fedor V. Fomin
    Approximation of pathwidth of outerplanar graphs. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2002, v:43, n:2, pp:190-200 [Journal]
  59. Fedor V. Fomin, Dimitrios M. Thilikos
    A 3-approximation for the pathwidth of Halin graphs. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2006, v:4, n:4, pp:499-510 [Journal]
  60. Fedor V. Fomin, Dimitrios M. Thilikos
    Dominating Sets in Planar Graphs: Branch-Width and Exponential Speed-Up. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2006, v:36, n:2, pp:281-309 [Journal]
  61. Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos
    Bidimensional Parameters and Local Treewidth. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2004, v:18, n:3, pp:501-511 [Journal]
  62. Fedor V. Fomin, Petr A. Golovach
    Graph Searching and Interval Completion. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2000, v:13, n:4, pp:454-464 [Journal]
  63. Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos
    Fixed-parameter algorithms for (k, r)-center in planar graphs and map graphs. [Citation Graph (0, 0)][DBLP]
    ACM Transactions on Algorithms, 2005, v:1, n:1, pp:33-47 [Journal]
  64. Hans L. Bodlaender, Fedor V. Fomin
    Equitable colorings of bounded treewidth graphs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:349, n:1, pp:22-30 [Journal]
  65. Jirí Fiala, Aleksei V. Fishkin, Fedor V. Fomin
    On distance constrained labeling of disk graphs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:326, n:1-3, pp:261-292 [Journal]
  66. Fedor V. Fomin, Dimitrios M. Thilikos
    New upper bounds on the decomposability of planar graphs. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2006, v:51, n:1, pp:53-81 [Journal]
  67. Fedor V. Fomin, Martín Matamala, Ivan Rapaport
    Complexity of approximating the oriented diameter of chordal graphs. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2004, v:45, n:4, pp:255-269 [Journal]
  68. Fedor V. Fomin, Serge Gaspers, Saket Saurabh
    Improved Exact Algorithms for Counting 3- and 4-Colorings. [Citation Graph (0, 0)][DBLP]
    COCOON, 2007, pp:65-74 [Conf]
  69. Fedor V. Fomin, Alexey A. Stepanov
    Counting Minimum Weighted Dominating Sets. [Citation Graph (0, 0)][DBLP]
    COCOON, 2007, pp:165-175 [Conf]
  70. Frederic Dorn, Fedor V. Fomin, Dimitrios M. Thilikos
    Subexponential Parameterized Algorithms. [Citation Graph (0, 0)][DBLP]
    ICALP, 2007, pp:15-27 [Conf]
  71. Noga Alon, Fedor V. Fomin, Gregory Gutin, Michael Krivelevich, Saket Saurabh
    Parameterized Algorithms for Directed Maximum Leaf Problems. [Citation Graph (0, 0)][DBLP]
    ICALP, 2007, pp:352-362 [Conf]
  72. Jianer Chen, Fedor V. Fomin, Yang Liu 0002, Songjian Lu, Yngve Villanger
    Improved Algorithms for the Feedback Vertex Set Problems. [Citation Graph (0, 0)][DBLP]
    WADS, 2007, pp:422-433 [Conf]
  73. Fedor V. Fomin, Petr A. Golovach, Jan Kratochvíl, Dieter Kratsch, Mathieu Liedloff
    Branch and Recharge: Exact Algorithms for Generalized Domination. [Citation Graph (0, 0)][DBLP]
    WADS, 2007, pp:507-518 [Conf]
  74. Michael R. Fellows, Fedor V. Fomin, Daniel Lokshtanov, Frances A. Rosamond, Saket Saurabh, Stefan Szeider, Carsten Thomassen
    On the Complexity of Some Colorful Problems Parameterized by Treewidth. [Citation Graph (0, 0)][DBLP]
    COCOA, 2007, pp:366-377 [Conf]
  75. Noga Alon, Fedor V. Fomin, Gregory Gutin, Michael Krivelevich, Saket Saurabh
    Parameterized Algorithms for Directed Maximum Leaf Problems [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  76. Noga Alon, Fedor V. Fomin, Gregory Gutin, Michael Krivelevich, Saket Saurabh
    Better Algorithms and Bounds for Directed Maximum Leaf Problems [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  77. Fedor V. Fomin, Pinar Heggernes, Dieter Kratsch
    Exact Algorithms for Graph Homomorphisms. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2007, v:41, n:2, pp:381-393 [Journal]

  78. Fast Local Search Algorithm for Weighted Feedback Arc Set in Tournaments. [Citation Graph (, )][DBLP]


  79. Algorithm for Finding k-Vertex Out-trees and Its Application to k-Internal Out-branching Problem. [Citation Graph (, )][DBLP]


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


  81. Kernelization. [Citation Graph (, )][DBLP]


  82. Contraction Bidimensionality: The Accurate Picture. [Citation Graph (, )][DBLP]


  83. Faster Steiner Tree Computation in Polynomial-Space. [Citation Graph (, )][DBLP]


  84. Fast Minor Testing in Planar Graphs. [Citation Graph (, )][DBLP]


  85. (Meta) Kernelization. [Citation Graph (, )][DBLP]


  86. Better Algorithms and Bounds for Directed Maximum Leaf Problems. [Citation Graph (, )][DBLP]


  87. Implicit Branching and Parameterized Partial Cover Problems (Extended Abstract). [Citation Graph (, )][DBLP]


  88. Subexponential Algorithms for Partial Cover Problems. [Citation Graph (, )][DBLP]


  89. Kernels for Feedback Arc Set In Tournaments. [Citation Graph (, )][DBLP]


  90. Treewidth Computation and Extremal Combinatorics. [Citation Graph (, )][DBLP]


  91. Spanners in Sparse Graphs. [Citation Graph (, )][DBLP]


  92. Distortion Is Fixed Parameter Tractable. [Citation Graph (, )][DBLP]


  93. Counting Subgraphs via Homomorphisms. [Citation Graph (, )][DBLP]


  94. On tractability of Cops and Robbers game. [Citation Graph (, )][DBLP]


  95. Local Search: Is Brute-Force Avoidable? [Citation Graph (, )][DBLP]


  96. A Linear Vertex Kernel for Maximum Internal Spanning Tree. [Citation Graph (, )][DBLP]


  97. How to Guard a Graph?. [Citation Graph (, )][DBLP]


  98. Sharp Separation and Applications to Exact and Parameterized Algorithms. [Citation Graph (, )][DBLP]


  99. On the Complexity of Reconstructing H -free Graphs from Their Star Systems. [Citation Graph (, )][DBLP]


  100. Iterative Compression and Exact Algorithms. [Citation Graph (, )][DBLP]


  101. A PTAS for the Sparsest Spanners Problem on Apex-Minor-Free Graphs. [Citation Graph (, )][DBLP]


  102. Catalan structures and dynamic programming in H-minor-free graphs. [Citation Graph (, )][DBLP]


  103. Clique-width: on the price of generality. [Citation Graph (, )][DBLP]


  104. Bidimensionality and Kernels. [Citation Graph (, )][DBLP]


  105. Algorithmic Lower Bounds for Problems Parameterized with Clique-Width. [Citation Graph (, )][DBLP]


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


  107. Finding Induced Subgraphs via Minimal Triangulations. [Citation Graph (, )][DBLP]


  108. Beyond Bidimensionality: Parameterized Subexponential Algorithms on Directed Graphs. [Citation Graph (, )][DBLP]


  109. Approximating Acyclicity Parameters of Sparse Hypergraphs. [Citation Graph (, )][DBLP]


  110. Cops and Robber Game without Recharging. [Citation Graph (, )][DBLP]


  111. Faster Parameterized Algorithms for Minor Containment. [Citation Graph (, )][DBLP]


  112. Guard Games on Graphs: Keep the Intruder Out! [Citation Graph (, )][DBLP]


  113. An Exact Algorithm for Minimum Distortion Embedding. [Citation Graph (, )][DBLP]


  114. Fast Exact Algorithms for Hamiltonicity in Claw-Free Graphs. [Citation Graph (, )][DBLP]


  115. Mixed Search Number and Linear-Width of Interval and Split Graphs. [Citation Graph (, )][DBLP]


  116. Improving the gap of Erdös-Pósa property for minor-closed graph classes. [Citation Graph (, )][DBLP]


  117. Three Complexity Results on Coloring Pk-Free Graphs. [Citation Graph (, )][DBLP]


  118. Nondeterministic Graph Searching: From Pathwidth to Treewidth. [Citation Graph (, )][DBLP]


  119. On Two Techniques of Combining Branching and Treewidth. [Citation Graph (, )][DBLP]


  120. Solving Connected Dominating Set Faster than 2 n . [Citation Graph (, )][DBLP]


  121. On the Minimum Feedback Vertex Set Problem: Exact and Enumeration Algorithms. [Citation Graph (, )][DBLP]


  122. Parameterized Algorithms for Partial Cover Problems [Citation Graph (, )][DBLP]


  123. Spanning directed trees with many leaves [Citation Graph (, )][DBLP]


  124. Treewidth computation and extremal combinatorics [Citation Graph (, )][DBLP]


  125. Parameterized Low-distortion Embeddings - Graph metrics into lines and trees [Citation Graph (, )][DBLP]


  126. Approximating acyclicity parameters of sparse hypergraphs [Citation Graph (, )][DBLP]


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


  128. Algorithm for Finding $k$-Vertex Out-trees and its Application to $k$-Internal Out-branching Problem [Citation Graph (, )][DBLP]


  129. (Meta) Kernelization [Citation Graph (, )][DBLP]


  130. Kernels for Feedback Arc Set In Tournaments [Citation Graph (, )][DBLP]


  131. A Linear Vertex Kernel for Maximum Internal Spanning Tree [Citation Graph (, )][DBLP]


  132. Finding Induced Subgraphs via Minimal Triangulations [Citation Graph (, )][DBLP]


  133. Faster Algorithms for Finding and Counting Subgraphs [Citation Graph (, )][DBLP]


  134. Beyond Bidimensionality: Parameterized Subexponential Algorithms on Directed Graphs [Citation Graph (, )][DBLP]


  135. Bidimensionality and EPTAS [Citation Graph (, )][DBLP]


  136. Computing branchwidth via efficient triangulations and blocks. [Citation Graph (, )][DBLP]


  137. Rank-width and tree-width of H-minor-free graphs. [Citation Graph (, )][DBLP]


Search in 0.060secs, Finished in 0.069secs
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