The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Harold N. Gabow: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Harold N. Gabow, Robert Endre Tarjan
    Faster Scaling Algorithms for Network Problems. [Citation Graph (2, 0)][DBLP]
    SIAM J. Comput., 1989, v:18, n:5, pp:1013-1036 [Journal]
  2. Harold N. Gabow, Robert Endre Tarjan
    Faster Scaling Algorithms for General Graph-Matching Problems. [Citation Graph (1, 0)][DBLP]
    J. ACM, 1991, v:38, n:4, pp:815-853 [Journal]
  3. Harold N. Gabow, San Skulrattanakulchai
    Coloring Algorithms on Subcubic Graphs. [Citation Graph (0, 0)][DBLP]
    COCOON, 2002, pp:67-76 [Conf]
  4. Leonid Oliker, Rupak Biswas, Harold N. Gabow
    Performance Analysis and Portability of the PLUM Load Balancing System. [Citation Graph (0, 0)][DBLP]
    Euro-Par, 1998, pp:307-317 [Conf]
  5. Roderick Bloem, Harold N. Gabow, Fabio Somenzi
    An Algorithm for Strongly Connected Component Analysis in n log n Symbolic Steps. [Citation Graph (0, 0)][DBLP]
    FMCAD, 2000, pp:37-54 [Conf]
  6. Frank Fussenegger, Harold N. Gabow
    Using Comparison Trees to Derive Lower Bounds for Selection Problems [Citation Graph (0, 0)][DBLP]
    FOCS, 1976, pp:178-182 [Conf]
  7. Harold N. Gabow
    Using Expander Graphs to Find Vertex Connectivity. [Citation Graph (0, 0)][DBLP]
    FOCS, 2000, pp:410-420 [Conf]
  8. Harold N. Gabow
    Scaling Algorithms for Network Problems [Citation Graph (0, 0)][DBLP]
    FOCS, 1983, pp:248-257 [Conf]
  9. Harold N. Gabow
    A Scaling Algorithm for Weighted Matching on General Graphs [Citation Graph (0, 0)][DBLP]
    FOCS, 1985, pp:90-100 [Conf]
  10. Harold N. Gabow
    Applications of a Poset Representation to Edge Connectivity and Graph Rigidity [Citation Graph (0, 0)][DBLP]
    FOCS, 1991, pp:812-821 [Conf]
  11. Harold N. Gabow
    A Framework for Cost-scaling Algorithms for Submodular Flow Problems [Citation Graph (0, 0)][DBLP]
    FOCS, 1993, pp:449-458 [Conf]
  12. Harold N. Gabow, Zvi Galil, Thomas H. Spencer
    Efficient Implementation of Graph Algorithms Using Contraction [Citation Graph (0, 0)][DBLP]
    FOCS, 1984, pp:347-357 [Conf]
  13. Harold N. Gabow, Robert Endre Tarjan
    Efficient Algorithms for Simple Matroid Intersection Problems [Citation Graph (0, 0)][DBLP]
    FOCS, 1979, pp:196-204 [Conf]
  14. Harold N. Gabow, Ying Xu
    Efficient Algorithms for Independent Assignments on Graphic and Linear Matroids [Citation Graph (0, 0)][DBLP]
    FOCS, 1989, pp:106-111 [Conf]
  15. Zvi Galil, Silvio Micali, Harold N. Gabow
    Priority Queues with Variable Priority and an O(EV log V) Algorithm for Finding a Maximal Weighted Matching in General Graphs [Citation Graph (0, 0)][DBLP]
    FOCS, 1982, pp:255-261 [Conf]
  16. Monika Rauch Henzinger, Satish Rao, Harold N. Gabow
    Computing Vertex Connectivity: New Bounds from Old Techniques. [Citation Graph (0, 0)][DBLP]
    FOCS, 1996, pp:462-471 [Conf]
  17. Matthias F. M. Stallmann, Harold N. Gabow
    An Augmenting Path Algorithm for the Parity Problem on Linear Matroids [Citation Graph (0, 0)][DBLP]
    FOCS, 1984, pp:217-228 [Conf]
  18. Harold N. Gabow, Matthias F. M. Stallmann
    Efficient Algorithms for Graphic Matroid Intersection and Parity (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ICALP, 1985, pp:210-220 [Conf]
  19. Harold N. Gabow
    On the Linfinity-Norm of Extreme Points for Crossing Supermodular Directed Network LPs. [Citation Graph (0, 0)][DBLP]
    IPCO, 2005, pp:392-406 [Conf]
  20. Harold N. Gabow, Michel X. Goemans, David P. Williamson
    An efficient approximation algorithm for the survivable network design problem. [Citation Graph (0, 0)][DBLP]
    IPCO, 1993, pp:57-74 [Conf]
  21. Harold N. Gabow, K. S. Manu
    Packing Algorithms for Arborescences (and Spanning Trees) in Capacitated Graphs. [Citation Graph (0, 0)][DBLP]
    IPCO, 1995, pp:388-402 [Conf]
  22. Ying Xu, Harold N. Gabow
    Fast Algorithms for Transversal Matroid Intersection Problems [Citation Graph (0, 0)][DBLP]
    ISAAC, 1994, pp:625-633 [Conf]
  23. Timothy X. Brown, Harold N. Gabow, Qi Zhang
    Maximum flow-life curve for a wireless ad hoc network. [Citation Graph (0, 0)][DBLP]
    MobiHoc, 2001, pp:128-136 [Conf]
  24. Jørgen Bang-Jensen, Harold N. Gabow, Tibor Jordán, Zoltán Szigeti
    Edge-Connectivity Augmentation with Partition Constraints. [Citation Graph (0, 0)][DBLP]
    SODA, 1998, pp:306-315 [Conf]
  25. Harold N. Gabow
    An ear decomposition approach to approximating the smallest 3-edge connected spanning subgraph of a multigraph. [Citation Graph (0, 0)][DBLP]
    SODA, 2002, pp:84-93 [Conf]
  26. Harold N. Gabow
    Better performance bounds for finding the smallest k-edge connected spanning subgraph of a multigraph. [Citation Graph (0, 0)][DBLP]
    SODA, 2003, pp:460-469 [Conf]
  27. Harold N. Gabow
    Special edges, and approximating the smallest directed k-edge connected spanning subgraph. [Citation Graph (0, 0)][DBLP]
    SODA, 2004, pp:234-243 [Conf]
  28. Harold N. Gabow
    Upper degree-constrained partial orientations. [Citation Graph (0, 0)][DBLP]
    SODA, 2006, pp:554-563 [Conf]
  29. Harold N. Gabow
    Data Structures for Weighted Matching and Nearest Common Ancestors with Linking. [Citation Graph (0, 0)][DBLP]
    SODA, 1990, pp:434-443 [Conf]
  30. Harold N. Gabow
    A Representation for Crossing Set Families with Applications to Submodular Flow Problems. [Citation Graph (0, 0)][DBLP]
    SODA, 1993, pp:202-211 [Conf]
  31. Harold N. Gabow
    Algorithms for Graphic Polymatroids and Parametric s-Sets. [Citation Graph (0, 0)][DBLP]
    SODA, 1995, pp:88-97 [Conf]
  32. Harold N. Gabow
    Perfect Arborescence Packing in Preflow Mincut Graphs. [Citation Graph (0, 0)][DBLP]
    SODA, 1996, pp:528-538 [Conf]
  33. Harold N. Gabow, Michel X. Goemans, Éva Tardos, David P. Williamson
    Approximating the smallest k-edge connected spanning subgraph by LP-rounding. [Citation Graph (0, 0)][DBLP]
    SODA, 2005, pp:562-571 [Conf]
  34. Harold N. Gabow, Tibor Jordán
    How to Make a Square Grid Framework with Cables Rigid. [Citation Graph (0, 0)][DBLP]
    SODA, 1999, pp:356-365 [Conf]
  35. Harold N. Gabow, Shuxin Nie
    Finding a long directed cycle. [Citation Graph (0, 0)][DBLP]
    SODA, 2004, pp:49-58 [Conf]
  36. Harold N. Gabow
    Finding paths and cycles of superpolylogarithmic length. [Citation Graph (0, 0)][DBLP]
    STOC, 2004, pp:407-416 [Conf]
  37. Harold N. Gabow
    An Efficient Reduction Technique for Degree-Constrained Subgraph and Bidirected Network Flow Problems [Citation Graph (0, 0)][DBLP]
    STOC, 1983, pp:448-456 [Conf]
  38. Harold N. Gabow
    A Matroid Approach to Finding Edge Connectivity and Packing Arborescences [Citation Graph (0, 0)][DBLP]
    STOC, 1991, pp:112-122 [Conf]
  39. Harold N. Gabow
    Efficient splitting off algorithms for graphs. [Citation Graph (0, 0)][DBLP]
    STOC, 1994, pp:696-705 [Conf]
  40. Harold N. Gabow, Jon Louis Bentley, Robert Endre Tarjan
    Scaling and Related Techniques for Geometry Problems [Citation Graph (0, 0)][DBLP]
    STOC, 1984, pp:135-143 [Conf]
  41. Harold N. Gabow, Oded Kariv
    Algorithms for Edge Coloring Bipartite Graphs [Citation Graph (0, 0)][DBLP]
    STOC, 1978, pp:184-192 [Conf]
  42. Harold N. Gabow, Haim Kaplan, Robert Endre Tarjan
    Unique Maximum Matching Algorithms. [Citation Graph (0, 0)][DBLP]
    STOC, 1999, pp:70-78 [Conf]
  43. Harold N. Gabow, Robert Endre Tarjan
    A Linear-Time Algorithm for a Special Case of Disjoint Set Union [Citation Graph (0, 0)][DBLP]
    STOC, 1983, pp:246-251 [Conf]
  44. Harold N. Gabow, Robert Endre Tarjan
    Almost-Optimum Speed-ups of Algorithms for Bipartite Matching and Related Problems [Citation Graph (0, 0)][DBLP]
    STOC, 1988, pp:514-527 [Conf]
  45. Harold N. Gabow, Herbert H. Westermann
    Forests, Frames and Games: Algorithms for Matroid Sums and Applications [Citation Graph (0, 0)][DBLP]
    STOC, 1988, pp:407-421 [Conf]
  46. Harold N. Gabow, Seth Pettie
    The Dynamic Vertex Minimum Problem and Its Application to Clustering-Type Approximation Algorithms. [Citation Graph (0, 0)][DBLP]
    SWAT, 2002, pp:190-199 [Conf]
  47. Harold N. Gabow
    Editor's Foreword: Special Issur on Network Flow Algorithms. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1994, v:11, n:3, pp:197-199 [Journal]
  48. Harold N. Gabow, Herbert H. Westermann
    Forests, Frames, and Games: Algorithms for Matroid Sums and Applications. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1992, v:7, n:5&6, pp:465-497 [Journal]
  49. Jack E. Tabaska, Robert B. Cary, Harold N. Gabow, Gary D. Stormo
    An RNA folding method capable of identifying pseudoknots and base triples. [Citation Graph (0, 0)][DBLP]
    Bioinformatics, 1998, v:14, n:8, pp:691-699 [Journal]
  50. Ying Xu, Dong Xu, Harold N. Gabow
    Protein domain decomposition using a graph-theoretic approach. [Citation Graph (0, 0)][DBLP]
    Bioinformatics, 2000, v:16, n:12, pp:1091-1104 [Journal]
  51. James R. Driscoll, Harold N. Gabow, Ruth Shrairman, Robert Endre Tarjan
    Relaxed Heaps: An Alternative to Fibonacci Heaps with Applications to Parallel Computation. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1988, v:31, n:11, pp:1343-1354 [Journal]
  52. Timothy X. Brown, Harold N. Gabow
    The limits of input-queued switch performance with future packet arrival information. [Citation Graph (0, 0)][DBLP]
    Computer Networks, 2003, v:42, n:4, pp:441-460 [Journal]
  53. Harold N. Gabow, Zvi Galil, Thomas H. Spencer, Robert Endre Tarjan
    Efficient algorithms for finding minimum spanning trees in undirected and directed graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1986, v:6, n:2, pp:109-122 [Journal]
  54. Harold N. Gabow, Matthias F. M. Stallmann
    An augmenting path algorithm for linear matroid parity. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1986, v:6, n:2, pp:123-150 [Journal]
  55. Harold N. Gabow, Tibor Jordán
    Bipartition constrained edge-splitting in directed graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2001, v:115, n:1-3, pp:49-62 [Journal]
  56. Roderick Bloem, Harold N. Gabow, Fabio Somenzi
    An Algorithm for Strongly Connected Component Analysis in n log n Symbolic Steps. [Citation Graph (0, 0)][DBLP]
    Formal Methods in System Design, 2006, v:28, n:1, pp:37-56 [Journal]
  57. San Skulrattanakulchai, Harold N. Gabow
    Coloring Algorithms On Subcubic Graphs. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2004, v:15, n:1, pp:21-40 [Journal]
  58. Harold N. Gabow
    Path-based depth-first search for strong and biconnected components. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2000, v:74, n:3-4, pp:107-114 [Journal]
  59. Harold N. Gabow
    Some Improved Bounds on the Number of 1-Factors of n-Connected Graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1976, v:5, n:4, pp:113-115 [Journal]
  60. Harold N. Gabow
    A Note on Degree-Constrained Star Subgraphs of Bipartite Graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1976, v:5, n:6, pp:165-167 [Journal]
  61. Harold N. Gabow
    A Linear-Time Recognition Algorithm for Interval Dags. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1981, v:12, n:1, pp:20-22 [Journal]
  62. Harold N. Gabow, Robert Endre Tarjan
    A Linear-Time Algorithm for Finding a Minimum Spanning Pseudoforest. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1988, v:27, n:5, pp:259-263 [Journal]
  63. Frank Fussenegger, Harold N. Gabow
    A Counting Approach to Lower Bounds for Selection Problems. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1979, v:26, n:2, pp:227-238 [Journal]
  64. Harold N. Gabow
    An Efficient Implementation of Edmonds' Algorithm for Maximum Matching on Graphs. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1976, v:23, n:2, pp:221-234 [Journal]
  65. Harold N. Gabow
    An Almost-Linear Algorithm for Two-Processor Scheduling. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1982, v:29, n:3, pp:766-780 [Journal]
  66. Harold N. Gabow, Zvi Galil, Thomas H. Spencer
    Efficient implementation of graph algorithms using contraction. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1989, v:36, n:3, pp:540-572 [Journal]
  67. Harold N. Gabow
    Using expander graphs to find vertex connectivity. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2006, v:53, n:5, pp:800-844 [Journal]
  68. Andrzej Ehrenfeucht, Harold N. Gabow, Ross M. McConnell, Stephen J. Sullivan
    An O(n²) Divide-and-Conquer Algorithm for the Prime Tree Decomposition of Two-Structures and Modular Decomposition of Graphs. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1994, v:16, n:2, pp:283-294 [Journal]
  69. Harold N. Gabow
    Centroids, Representations, and Submodular Flows. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1995, v:18, n:3, pp:586-628 [Journal]
  70. Harold N. Gabow
    Algorithms for Graphic Polymatroids and Parametris s-Sets. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1998, v:26, n:1, pp:48-86 [Journal]
  71. Harold N. Gabow, Haim Kaplan, Robert Endre Tarjan
    Unique Maximum Matching Algorithms. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2001, v:40, n:2, pp:159-183 [Journal]
  72. Harold N. Gabow, Robert Endre Tarjan
    Efficient Algorithms for a Family of Matroid Intersection Problems. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1984, v:5, n:1, pp:80-131 [Journal]
  73. Harold N. Gabow, Robert Endre Tarjan
    Algorithms for Two Bottleneck Optimization Problems. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1988, v:9, n:3, pp:411-417 [Journal]
  74. Monika Rauch Henzinger, Satish Rao, Harold N. Gabow
    Computing Vertex Connectivity: New Bounds from Old Techniques. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2000, v:34, n:2, pp:222-250 [Journal]
  75. Harold N. Gabow, Tibor Jordán
    Incrementing Bipartite Digraph Edge-Connectivity. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 2000, v:4, n:4, pp:449-486 [Journal]
  76. Harold N. Gabow
    Scaling Algorithms for Network Problems. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1985, v:31, n:2, pp:148-168 [Journal]
  77. Harold N. Gabow
    A Matroid Approach to Finding Edge Connectivity and Packing Arborescences. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1995, v:50, n:2, pp:259-273 [Journal]
  78. Harold N. Gabow, Robert Endre Tarjan
    A Linear-Time Algorithm for a Special Case of Disjoint Set Union. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1985, v:30, n:2, pp:209-221 [Journal]
  79. Harold N. Gabow, Ying Xu
    Efficient Theoretic and Practical Algorithms for Linear Matroid Intersection Problems. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1996, v:53, n:1, pp:129-147 [Journal]
  80. Harold N. Gabow, Tadayoshi Kohno
    A Network-Flow-Based Scheduler: Design, Performance History, and Experimental Analysis. [Citation Graph (0, 0)][DBLP]
    ACM Journal of Experimental Algorithms, 2001, v:6, n:, pp:3- [Journal]
  81. Harold N. Gabow, Michel X. Goemans, David P. Williamson
    An efficient approximation algorithm for the survivable network design problem. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1998, v:82, n:, pp:13-40 [Journal]
  82. Harold N. Gabow, K. S. Manu
    Packing algorithms for arborescences (and spanning trees) in capacitated graphs. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1998, v:82, n:, pp:83-109 [Journal]
  83. Harold N. Gabow
    On the Linfinity-norm of extreme points for crossing supermodular directed network LPs. [Citation Graph (0, 0)][DBLP]
    Math. Program., 2007, v:110, n:1, pp:111-144 [Journal]
  84. Leonid Oliker, Rupak Biswas, Harold N. Gabow
    Parallel tetrahedral mesh adaptation with dynamic load balancing. [Citation Graph (0, 0)][DBLP]
    Parallel Computing, 2000, v:26, n:12, pp:1583-1608 [Journal]
  85. Harold N. Gabow
    Two Algorithms for Generating Weighted Spanning Trees in Order. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1977, v:6, n:1, pp:139-150 [Journal]
  86. Harold N. Gabow
    Scheduling UET Systems on Two Uniform Processors and Length Two Pipelines. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1988, v:17, n:4, pp:810-829 [Journal]
  87. Harold N. Gabow, Tibor Jordán
    How to Make a Square Grid Framework with Cables Rigid. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2000, v:30, n:2, pp:649-680 [Journal]
  88. Harold N. Gabow, Oded Kariv
    Algorithms for Edge Coloring Bipartite Graphs and Multigraphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1982, v:11, n:1, pp:117-129 [Journal]
  89. Harold N. Gabow, Eugene W. Myers
    Finding All Spanning Trees of Directed and Undirected Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1978, v:7, n:3, pp:280-287 [Journal]
  90. Zvi Galil, Silvio Micali, Harold N. Gabow
    An O(EV log V) Algorithm for Finding a Maximal Weighted Matching in General Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1986, v:15, n:1, pp:120-130 [Journal]
  91. Harold N. Gabow
    Finding Paths and Cycles of Superpolylogarithmic Length. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2007, v:36, n:6, pp:1648-1671 [Journal]
  92. Jørgen Bang-Jensen, Harold N. Gabow, Tibor Jordán, Zoltán Szigeti
    Edge-Connectivity Augmentation with Partition Constraints. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1999, v:12, n:2, pp:160-207 [Journal]
  93. Harold N. Gabow
    An Ear Decomposition Approach to Approximating the Smallest 3-Edge Connected Spanning Subgraph of a Multigraph. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2004, v:18, n:1, pp:41-70 [Journal]
  94. Harold N. Gabow
    An Improved Analysis for Approximating the Smallest k-Edge Connected Spanning Subgraph of a Multigraph. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2005, v:19, n:1, pp:1-18 [Journal]
  95. Harold N. Gabow
    Editor's foreword. [Citation Graph (0, 0)][DBLP]
    ACM Transactions on Algorithms, 2005, v:1, n:1, pp:1- [Journal]
  96. Harold N. Gabow, Shachindra N. Maheswari, Leon J. Osterweil
    On Two Problems in the Generation of Program Test Paths. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Software Eng., 1976, v:2, n:3, pp:227-231 [Journal]

  97. Finding Long Paths, Cycles and Circuits. [Citation Graph (, )][DBLP]


  98. Iterated rounding algorithms for the smallest k-edge connected spanning subgraph. [Citation Graph (, )][DBLP]


Search in 0.163secs, Finished in 0.167secs
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