The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Bruce A. Reed: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Vasek Chvátal, B. Reed
    Mick Gets Some (the Odds Are on His Side) [Citation Graph (0, 0)][DBLP]
    FOCS, 1992, pp:620-627 [Conf]
  2. Béla Bollobás, Bruce A. Reed, Andrew Thomason
    An extremal function for the achromatic number. [Citation Graph (0, 0)][DBLP]
    Graph Structure Theory, 1991, pp:161-166 [Conf]
  3. Bruce A. Reed
    Counterexamples to a conjecture of Las Vergnas and Meyniel. [Citation Graph (0, 0)][DBLP]
    Graph Structure Theory, 1991, pp:157-160 [Conf]
  4. Bruce A. Reed, Neil Robertson, Alexander Schrijver, Paul D. Seymour
    Finding dsjoint trees in planar graphs in linear time. [Citation Graph (0, 0)][DBLP]
    Graph Structure Theory, 1991, pp:295-302 [Conf]
  5. Samuel Fiorini, Nadia Hardy, Bruce A. Reed, Adrian Vetta
    Approximate Min-max Relations for Odd Cycles in Planar Graphs. [Citation Graph (0, 0)][DBLP]
    IPCO, 2005, pp:35-50 [Conf]
  6. Gruia Calinescu, Cristina G. Fernandes, Bruce A. Reed
    Multicuts in Unweighted Graphs with Bounded Degree and Bounded Tree-Width. [Citation Graph (0, 0)][DBLP]
    IPCO, 1998, pp:137-152 [Conf]
  7. Alan M. Frieze, Richard M. Karp, Bruce A. Reed
    When is the Assignment Bound Tight for the Asymmetric Traveling Salesman Problem? [Citation Graph (0, 0)][DBLP]
    IPCO, 1992, pp:453-461 [Conf]
  8. Bruce A. Reed
    Perfection, Parity, Planarity, and Packing Paths. [Citation Graph (0, 0)][DBLP]
    IPCO, 1990, pp:407-419 [Conf]
  9. Derek G. Corneil, Michel Habib, Jean-Marc Lanlignel, Bruce A. Reed, Udi Rotics
    Polynomial Time Recognition of Clique-Width \le \leq 3 Graphs (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    LATIN, 2000, pp:126-134 [Conf]
  10. Celina M. Herrera de Figueiredo, Sulamita Klein, Yoshiharu Kohayakawa, Bruce A. Reed
    Finding Skew Partitions Efficiently. [Citation Graph (0, 0)][DBLP]
    LATIN, 2000, pp:163-172 [Conf]
  11. Michael Molloy, Bruce A. Reed
    Colouring Graphs whose Chromatic Number Is Almost Their Maximum Degree. [Citation Graph (0, 0)][DBLP]
    LATIN, 1998, pp:216-225 [Conf]
  12. Ryan B. Hayward, Stefan Hougardy, Bruce A. Reed
    Polynomial time recognition of P4-structure. [Citation Graph (0, 0)][DBLP]
    SODA, 2002, pp:382-389 [Conf]
  13. Dieter Rautenbach, Bruce A. Reed
    Approximately covering by cycles in planar graphs. [Citation Graph (0, 0)][DBLP]
    SODA, 2001, pp:402-406 [Conf]
  14. Michael Molloy, Bruce A. Reed
    Colouring graphs when the number of colours is nearly the maximum degree. [Citation Graph (0, 0)][DBLP]
    STOC, 2001, pp:462-470 [Conf]
  15. Michael Molloy, Bruce A. Reed
    Further Algorithmic Aspects of the Local Lemma. [Citation Graph (0, 0)][DBLP]
    STOC, 1998, pp:524-529 [Conf]
  16. Bruce A. Reed
    How tall is a tree? [Citation Graph (0, 0)][DBLP]
    STOC, 2000, pp:479-483 [Conf]
  17. Bruce A. Reed
    Finding Approximate Separators and Computing Tree Width Quickly [Citation Graph (0, 0)][DBLP]
    STOC, 1992, pp:221-228 [Conf]
  18. Colin McDiarmid, Bruce A. Reed, Alexander Schrijver, B. Shepherd
    Non-Interfering Network Flows. [Citation Graph (0, 0)][DBLP]
    SWAT, 1992, pp:245-257 [Conf]
  19. Zhentao Li, Bruce A. Reed
    Heap Building Bounds. [Citation Graph (0, 0)][DBLP]
    WADS, 2005, pp:14-23 [Conf]
  20. Guillaume Fertin, André Raspaud, Bruce A. Reed
    On Star Coloring of Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 2001, pp:140-153 [Conf]
  21. Ljubomir Perkovic, Bruce A. Reed
    An Improved Algorithm for Finding Tree Decompositions of Small Width. [Citation Graph (0, 0)][DBLP]
    WG, 1999, pp:148-154 [Conf]
  22. Noga Alon, Colin McDiarmid, Bruce A. Reed
    Star arboricity. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1992, v:12, n:4, pp:375-380 [Journal]
  23. Alan M. Frieze, Bruce A. Reed
    Covering the Edges of a Random Graph by Cliques. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1995, v:15, n:4, pp:489-497 [Journal]
  24. Hugh Hind, Michael Molloy, Bruce A. Reed
    Colouring a Graph Frugally. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1997, v:17, n:4, pp:469-482 [Journal]
  25. Kyriakos Kilakos, B. Reed
    Fractionally colouring total graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1993, v:13, n:4, pp:435-440 [Journal]
  26. Michael Molloy, Bruce A. Reed
    A Bound on the Total Chromatic Number. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1998, v:18, n:2, pp:241-280 [Journal]
  27. Dieter Rautenbach, Bruce A. Reed
    The Erdos-Pósa Property for Odd Cycles in Highly Connected Graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2001, v:21, n:2, pp:267-278 [Journal]
  28. Bruce A. Reed
    Mangoes and Blueberries. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1999, v:19, n:2, pp:267-296 [Journal]
  29. Bruce A. Reed, Neil Robertson, Paul D. Seymour, Robin Thomas
    Packing Directed Circuits. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1996, v:16, n:4, pp:535-554 [Journal]
  30. Bruce A. Reed, Benny Sudakov
    List Colouring When The Chromatic Number Is Close To the Order Of The Graph. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2004, v:25, n:1, pp:117-123 [Journal]
  31. Bruce A. Reed, F. Bruce Shepherd
    The Gallai-Younger Conjecture for Planar Graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1996, v:16, n:4, pp:555-566 [Journal]
  32. Michael H. Albert, Alan M. Frieze, Bruce A. Reed
    Multicoloured Hamilton Cycles. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 1995, v:2, n:, pp:- [Journal]
  33. Michael Molloy, Bruce A. Reed
    Critical Subgraphs of a Random Graph. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 1999, v:6, n:, pp:- [Journal]
  34. Colin Cooper, Alan M. Frieze, Michael Molloy, Bruce A. Reed
    Perfect Matchings in Random r-regular, s-uniform Hypergraphs. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1996, v:5, n:, pp:1-14 [Journal]
  35. Colin Cooper, Alan M. Frieze, Bruce A. Reed
    Random Regular Graphs Of Non-Constant Degree: Connectivity And Hamiltonicity. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 2002, v:11, n:3, pp:- [Journal]
  36. Colin Cooper, Alan M. Frieze, Bruce A. Reed, Oliver Riordan
    Random Regular Graphs Of Non-Constant Degree: Independence And Chromatic Number. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 2002, v:11, n:4, pp:- [Journal]
  37. Colin McDiarmid, Bruce A. Reed
    Almost Every Graph can be Covered by [fracDelta2] Linear Forests. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1995, v:4, n:, pp:257-268 [Journal]
  38. Michael Molloy, Bruce A. Reed
    The Size of the Giant Component of a Random Graph with a Given Degree Sequence. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1998, v:7, n:3, pp:295-305 [Journal]
  39. Bruce A. Reed
    Paths, Stars and the Number Three. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1996, v:5, n:, pp:277-295 [Journal]
  40. Bruce A. Reed, Colin McDiarmid
    The Strongly Connected Components of 1-in, 1-out. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1992, v:1, n:, pp:265-274 [Journal]
  41. Simone Dantas, Celina M. Herrera de Figueiredo, Sulamita Klein, Sylvain Gravier, Bruce A. Reed
    Stable skew partition problem. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:143, n:1-3, pp:17-22 [Journal]
  42. Hazel Everett, Sulamita Klein, Bruce A. Reed
    An Algorithm for Finding Homogeneous Pairs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1997, v:72, n:3, pp:209-218 [Journal]
  43. Bruce A. Reed
    Rooted Routing in the Plane. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1995, v:57, n:2-3, pp:213-227 [Journal]
  44. Bruce A. Reed, Siang W. Song, Jayme Luiz Szwarcfiter
    Preface. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:141, n:1-3, pp:1- [Journal]
  45. Claude Berge, Bruce A. Reed
    Optimal packings of edge-disjoint odd cycles. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:211, n:, pp:197-202 [Journal]
  46. Martin Loebl, Jaroslav Nesetril, Bruce A. Reed
    A note on random homomorphism from arbitrary graphs to Z. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:273, n:1-3, pp:173-181 [Journal]
  47. Colin McDiarmid, Bruce A. Reed
    Channel assignment on graphs of bounded treewidth. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:273, n:1-3, pp:183-192 [Journal]
  48. Bruce A. Reed, Paul D. Seymour
    Hadwiger's conjecture for line graphs. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2004, v:25, n:6, pp:873-876 [Journal]
  49. Cláudia Linhares Sales, Frédéric Maffray, Bruce A. Reed
    Recognizing Planar Strict Quasi-Parity Graphs. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2001, v:17, n:4, pp:745-757 [Journal]
  50. Ljubomir Perkovic, Bruce A. Reed
    An Improved Algorithm for Finding Tree Decompositions of Small Width. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2000, v:11, n:3, pp:365-371 [Journal]
  51. Bruce A. Reed
    The height of a random binary search tree. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2003, v:50, n:3, pp:306-332 [Journal]
  52. Gruia Calinescu, Cristina G. Fernandes, Bruce A. Reed
    Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2003, v:48, n:2, pp:333-359 [Journal]
  53. Celina M. Herrera de Figueiredo, Sulamita Klein, Yoshiharu Kohayakawa, Bruce A. Reed
    Finding Skew Partitions Efficiently. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2000, v:37, n:2, pp:505-521 [Journal]
  54. Colin McDiarmid, Bruce A. Reed
    Building Heaps Fast. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1989, v:10, n:3, pp:352-365 [Journal]
  55. Louigi Addario-Berry, Robert E. L. Aldred, Ketan Dalal, Bruce A. Reed
    Vertex colouring edge partitions. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2005, v:94, n:2, pp:237-244 [Journal]
  56. Gérard Cornuéjols, Bruce A. Reed
    Complete Multi-partite Cutsets in Minimal Imperfect Graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1993, v:59, n:2, pp:191-198 [Journal]
  57. Matt DeVos, Guoli Ding, Bogdan Oporowski, Daniel P. Sanders, Bruce A. Reed, Paul D. Seymour, Dirk Vertigan
    Excluding any graph as a minor allows a low tree-width 2-coloring. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2004, v:91, n:1, pp:25-41 [Journal]
  58. Babak Farzad, Michael S. O. Molloy, Bruce A. Reed
    (Delta-k)-critical graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2005, v:93, n:2, pp:173-185 [Journal]
  59. Alan M. Frieze, B. Jackson, Colin J. H. McDiarmid, Bruce A. Reed
    Edge-colouring random graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1988, v:45, n:2, pp:135-149 [Journal]
  60. Frédéric Maffray, Bruce A. Reed
    A Description of Claw-Free Perfect Graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1999, v:75, n:1, pp:134-156 [Journal]
  61. S. E. Markossian, G. S. Gasparian, Bruce A. Reed
    beta-Perfect Graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1996, v:67, n:1, pp:1-11 [Journal]
  62. Colin J. H. McDiarmid, Bruce A. Reed
    On Total Colorings of Graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1993, v:57, n:1, pp:122-130 [Journal]
  63. Colin J. H. McDiarmid, Bruce A. Reed, Alexander Schrijver, F. Bruce Shepherd
    Induced Circuits in Planar Graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1994, v:60, n:2, pp:169-176 [Journal]
  64. Michael S. O. Molloy, Bruce A. Reed
    A Bound on the Strong Chromatic Index of a Graph, . [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1997, v:69, n:2, pp:103-109 [Journal]
  65. Bruce A. Reed
    A Strengthening of Brooks' Theorem. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1999, v:76, n:2, pp:136-149 [Journal]
  66. Bruce A. Reed, Benny Sudakov
    Asymptotically the List Colouring Constants Are 1. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2002, v:86, n:1, pp:27-37 [Journal]
  67. Bruce A. Reed, Paul D. Seymour
    Fractional Colouring and Hadwiger's Conjecture. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1998, v:74, n:2, pp:147-152 [Journal]
  68. Bruce A. Reed, Robin Thomas
    Clique Minors in Graphs and Their Complements. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2000, v:78, n:1, pp:81-85 [Journal]
  69. Samuel Fiorini, Nadia Hardy, Bruce A. Reed, Adrian Vetta
    Approximate min-max relations for odd cycles in planar graphs. [Citation Graph (0, 0)][DBLP]
    Math. Program., 2007, v:110, n:1, pp:71-91 [Journal]
  70. Colin McDiarmid, Bruce A. Reed
    Channel assignment and weighted coloring. [Citation Graph (0, 0)][DBLP]
    Networks, 2000, v:36, n:2, pp:114-117 [Journal]
  71. David Avis, Caterina De Simone, Bruce A. Reed
    On the fractional chromatic index of a graph and its complement. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2005, v:33, n:4, pp:385-388 [Journal]
  72. Bruce A. Reed
    Edge coloring nearly bipartite graphs. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 1999, v:24, n:1-2, pp:11-14 [Journal]
  73. Bruce A. Reed, Kaleigh Smith, Adrian Vetta
    Finding odd cycle transversals. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2004, v:32, n:4, pp:299-301 [Journal]
  74. Noga Alon, Colin McDiarmid, Bruce A. Reed
    Acyclic Coloring of Graphs. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1991, v:2, n:3, pp:277-288 [Journal]
  75. Colin McDiarmid, Bruce A. Reed
    Concentration for self-bounding functions and an inequality of Talagrand. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2006, v:29, n:4, pp:549-557 [Journal]
  76. Colin McDiarmid, Bruce A. Reed
    Linear Arboricity of Random Regular Graphs. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1990, v:1, n:4, pp:443-447 [Journal]
  77. Michael Molloy, Bruce A. Reed
    Near-optimal list colorings. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2000, v:17, n:3-4, pp:376-402 [Journal]
  78. Michael Molloy, Bruce A. Reed
    The Dominating Number of Random Cubic Graph. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1995, v:7, n:3, pp:209-222 [Journal]
  79. Michael Molloy, Bruce A. Reed
    A Critical Point for Random Graphs with a Given Degree Sequence. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1995, v:6, n:2/3, pp:161-180 [Journal]
  80. Luc Devroye, Bruce A. Reed
    On the Variance of the Height of Random Binary Search Trees. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1995, v:24, n:6, pp:1157-1162 [Journal]
  81. Alan M. Frieze, Richard M. Karp, Bruce A. Reed
    When is the Assignment Bound Tight for the Asymmetric Traveling-Salesman Problem? [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1995, v:24, n:3, pp:484-493 [Journal]
  82. Alan M. Frieze, Colin McDiarmid, Bruce A. Reed
    Greedy Matching on the Line. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1990, v:19, n:4, pp:666-672 [Journal]
  83. Hugh Hind, Michael Molloy, Bruce A. Reed
    Total Coloring With Delta + (log Delta) Colors. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:28, n:3, pp:816-821 [Journal]
  84. Chính T. Hoàng, Bruce A. Reed
    On the Co-P3-Structure of Perfect Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2004, v:18, n:3, pp:571-576 [Journal]
  85. Guillaume Fertin, André Raspaud, Bruce A. Reed
    Star coloring of graphs. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2004, v:47, n:3, pp:163-182 [Journal]
  86. Arkadev Chattopadhyay, Bruce A. Reed
    Properly 2-Colouring Linear Hypergraphs. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2007, pp:395-408 [Conf]
  87. Ken-ichi Kawarabayashi, Buce Reed
    Computing crossing number in linear time. [Citation Graph (0, 0)][DBLP]
    STOC, 2007, pp:382-390 [Conf]
  88. Etienne Birmelé, John Adrian Bondy, Bruce A. Reed
    The Erdös-Pósa Property For Long Circuits. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2007, v:27, n:2, pp:135-145 [Journal]
  89. Louigi Addario-Berry, Ketan Dalal, Colin McDiarmid, Bruce A. Reed, Andrew Thomason
    Vertex-Colouring Edge-Weightings. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2007, v:27, n:1, pp:1-12 [Journal]
  90. Benjamin Lévêque, Frédéric Maffray, Bruce Reed, Nicolas Trotignon
    Coloring Artemis graphs [Citation Graph (0, 0)][DBLP]
    CoRR, 2005, v:0, n:, pp:- [Journal]
  91. B. Reed
    A note on the semi-strong perfect graph conjecture. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1985, v:54, n:1, pp:111-112 [Journal]
  92. Bruce A. Reed
    A note on even pairs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1987, v:65, n:3, pp:317-318 [Journal]
  93. Chính T. Hoàng, Bruce A. Reed
    A note on short cycles in diagraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1987, v:66, n:1-2, pp:103-107 [Journal]
  94. Chính T. Hoàng, Bruce A. Reed
    P4-comparability graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1989, v:74, n:1-2, pp:173-200 [Journal]
  95. Colin McDiarmid, Bruce A. Reed
    Colouring proximity graphs in the plane. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:199, n:1-3, pp:123-137 [Journal]
  96. Ljubomir Perkovic, Bruce A. Reed
    Edge coloring regular graphs of high degree. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:165, n:, pp:567-578 [Journal]
  97. Hazel Everett, Celina M. Herrera de Figueiredo, Cláudia Linhares Sales, Frédéric Maffray, Oscar Porto, Bruce A. Reed
    Path parity and perfection. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:165, n:, pp:233-252 [Journal]
  98. Alan Frieze, Bruce Reed
    Polychromatic Hamilton cycles. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:118, n:1-3, pp:69-74 [Journal]

  99. A Simpler Linear Time Algorithm for Embedding Graphs into an Arbitrary Surface and the Genus of Graphs of Bounded Tree-Width. [Citation Graph (, )][DBLP]


  100. Optimization and Recognition for K 5-minor Free Graphs in Linear Time. [Citation Graph (, )][DBLP]


  101. A nearly linear time algorithm for the half integral disjoint paths packing. [Citation Graph (, )][DBLP]


  102. L(2, 1)-labelling of graphs. [Citation Graph (, )][DBLP]


  103. A nearly linear time algorithm for the half integral parity disjoint paths packing problem. [Citation Graph (, )][DBLP]


  104. Asymptotically optimal frugal colouring. [Citation Graph (, )][DBLP]


  105. Recognizing a Totally Odd K4-subdivision, Parity 2-disjoint Rooted Paths and a Parity Cycle Through Specified Elements. [Citation Graph (, )][DBLP]


  106. An (almost) Linear Time Algorithm for Odd Cyles Transversal. [Citation Graph (, )][DBLP]


  107. Hadwiger's conjecture is decidable. [Citation Graph (, )][DBLP]


  108. Odd cycle packing. [Citation Graph (, )][DBLP]


  109. Highly parity linked graphs. [Citation Graph (, )][DBLP]


  110. On the Maximum Degree of a Random Planar Graph. [Citation Graph (, )][DBLP]


  111. Planar graph bipartization in linear time. [Citation Graph (, )][DBLP]


  112. Skew partitions in perfect graphs. [Citation Graph (, )][DBLP]


  113. Fractionally total colouring Gn, p. [Citation Graph (, )][DBLP]


  114. Degree constrained subgraphs. [Citation Graph (, )][DBLP]


  115. Partition into cliques for cubic graphs: Planar case, complexity and approximation. [Citation Graph (, )][DBLP]


  116. Tree-width of graphs without a 3×3 grid minor. [Citation Graph (, )][DBLP]


  117. Finding a maximum-weight induced k-partite subgraph of an i-triangulated graph. [Citation Graph (, )][DBLP]


  118. An upper bound for the chromatic number of line graphs. [Citation Graph (, )][DBLP]


  119. Fractional coloring and the odd Hadwiger's conjecture. [Citation Graph (, )][DBLP]


Search in 0.010secs, Finished in 0.015secs
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