BibTeX records: Harold N. Gabow

download as .bib file

@article{DBLP:journals/fuin/Gabow17,
  author    = {Harold N. Gabow},
  title     = {The Weighted Matching Approach to Maximum Cardinality Matching},
  journal   = {Fundam. Inform.},
  volume    = {154},
  number    = {1-4},
  pages     = {109--130},
  year      = {2017},
  url       = {https://doi.org/10.3233/FI-2017-1555},
  doi       = {10.3233/FI-2017-1555},
  timestamp = {Thu, 17 Aug 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/fuin/Gabow17},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/corr/Gabow17,
  author    = {Harold N. Gabow},
  title     = {The Weighted Matching Approach to Maximum Cardinality Matching},
  journal   = {CoRR},
  volume    = {abs/1703.03998},
  year      = {2017},
  url       = {http://arxiv.org/abs/1703.03998},
  timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/corr/Gabow17},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/talg/Gabow16,
  author    = {Harold N. Gabow},
  title     = {The Minset-Poset Approach to Representations of Graph Connectivity},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {12},
  number    = {2},
  pages     = {24:1--24:73},
  year      = {2016},
  url       = {http://doi.acm.org/10.1145/2764909},
  doi       = {10.1145/2764909},
  timestamp = {Tue, 03 Jan 2017 00:00:00 +0100},
  biburl    = {http://dblp.org/rec/bib/journals/talg/Gabow16},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/corr/Gabow16,
  author    = {Harold N. Gabow},
  title     = {A Data Structure for Nearest Common Ancestors with Linking},
  journal   = {CoRR},
  volume    = {abs/1611.07055},
  year      = {2016},
  url       = {http://arxiv.org/abs/1611.07055},
  timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/corr/Gabow16},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/corr/Gabow16a,
  author    = {Harold N. Gabow},
  title     = {Data Structures for Weighted Matching and Extensions to {\textdollar}b{\textdollar}-matching
               and {\textdollar}f{\textdollar}-factors},
  journal   = {CoRR},
  volume    = {abs/1611.07541},
  year      = {2016},
  url       = {http://arxiv.org/abs/1611.07541},
  timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/corr/Gabow16a},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/jacm/CyganGS15,
  author    = {Marek Cygan and
               Harold N. Gabow and
               Piotr Sankowski},
  title     = {Algorithmic Applications of Baur-Strassen's Theorem: Shortest Cycles,
               Diameter, and Matchings},
  journal   = {J. {ACM}},
  volume    = {62},
  number    = {4},
  pages     = {28:1--28:30},
  year      = {2015},
  url       = {http://doi.acm.org/10.1145/2736283},
  doi       = {10.1145/2736283},
  timestamp = {Fri, 09 Dec 2016 00:00:00 +0100},
  biburl    = {http://dblp.org/rec/bib/journals/jacm/CyganGS15},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/corr/Gabow15,
  author    = {Harold N. Gabow},
  title     = {Set-merging for the Matching Algorithm of Micali and Vazirani},
  journal   = {CoRR},
  volume    = {abs/1501.00212},
  year      = {2015},
  url       = {http://arxiv.org/abs/1501.00212},
  timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/corr/Gabow15},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/algorithmica/ChangGK14,
  author    = {Jessica Chang and
               Harold N. Gabow and
               Samir Khuller},
  title     = {A Model for Minimizing Active Processor Time},
  journal   = {Algorithmica},
  volume    = {70},
  number    = {3},
  pages     = {368--405},
  year      = {2014},
  url       = {https://doi.org/10.1007/s00453-013-9807-y},
  doi       = {10.1007/s00453-013-9807-y},
  timestamp = {Wed, 17 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/algorithmica/ChangGK14},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/focs/GabowS13,
  author    = {Harold N. Gabow and
               Piotr Sankowski},
  title     = {Algebraic Algorithms for B-Matching, Shortest Undirected Paths, and
               F-Factors},
  booktitle = {54th Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS}
               2013, 26-29 October, 2013, Berkeley, CA, {USA}},
  pages     = {137--146},
  year      = {2013},
  crossref  = {DBLP:conf/focs/2013},
  url       = {https://doi.org/10.1109/FOCS.2013.23},
  doi       = {10.1109/FOCS.2013.23},
  timestamp = {Fri, 19 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/focs/GabowS13},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/corr/abs-1304-6740,
  author    = {Harold N. Gabow and
               Piotr Sankowski},
  title     = {Algebraic Algorithms for b-Matching, Shortest Undirected Paths, and
               f-Factors},
  journal   = {CoRR},
  volume    = {abs/1304.6740},
  year      = {2013},
  url       = {http://arxiv.org/abs/1304.6740},
  timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/corr/abs-1304-6740},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/siamcomp/GabowG12,
  author    = {Harold N. Gabow and
               Suzanne Gallagher},
  title     = {Iterated Rounding Algorithms for the Smallest \emph{k}-Edge Connected
               Spanning Subgraph},
  journal   = {{SIAM} J. Comput.},
  volume    = {41},
  number    = {1},
  pages     = {61--103},
  year      = {2012},
  url       = {https://doi.org/10.1137/080732572},
  doi       = {10.1137/080732572},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/siamcomp/GabowG12},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/tcs/Gabow12,
  author    = {Harold N. Gabow},
  title     = {A combinatoric interpretation of dual variables for weighted matching
               and f-factors},
  journal   = {Theor. Comput. Sci.},
  volume    = {454},
  pages     = {136--163},
  year      = {2012},
  url       = {https://doi.org/10.1016/j.tcs.2012.06.024},
  doi       = {10.1016/j.tcs.2012.06.024},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/tcs/Gabow12},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/esa/ChangGK12,
  author    = {Jessica Chang and
               Harold N. Gabow and
               Samir Khuller},
  title     = {A Model for Minimizing Active Processor Time},
  booktitle = {Algorithms - {ESA} 2012 - 20th Annual European Symposium, Ljubljana,
               Slovenia, September 10-12, 2012. Proceedings},
  pages     = {289--300},
  year      = {2012},
  crossref  = {DBLP:conf/esa/2012},
  url       = {https://doi.org/10.1007/978-3-642-33090-2_26},
  doi       = {10.1007/978-3-642-33090-2_26},
  timestamp = {Fri, 26 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/esa/ChangGK12},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/focs/CyganGS12,
  author    = {Marek Cygan and
               Harold N. Gabow and
               Piotr Sankowski},
  title     = {Algorithmic Applications of Baur-Strassen's Theorem: Shortest Cycles,
               Diameter and Matchings},
  booktitle = {53rd Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS}
               2012, New Brunswick, NJ, USA, October 20-23, 2012},
  pages     = {531--540},
  year      = {2012},
  crossref  = {DBLP:conf/focs/2012},
  url       = {https://doi.org/10.1109/FOCS.2012.72},
  doi       = {10.1109/FOCS.2012.72},
  timestamp = {Fri, 19 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/focs/CyganGS12},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/corr/abs-1204-1616,
  author    = {Marek Cygan and
               Harold N. Gabow and
               Piotr Sankowski},
  title     = {Algorithmic Applications of Baur-Strassen's Theorem: Shortest Cycles,
               Diameter and Matchings},
  journal   = {CoRR},
  volume    = {abs/1204.1616},
  year      = {2012},
  url       = {http://arxiv.org/abs/1204.1616},
  timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/corr/abs-1204-1616},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/corr/abs-1208-0312,
  author    = {Jessica Chang and
               Harold N. Gabow and
               Samir Khuller},
  title     = {A Model for Minimizing Active Processor Time},
  journal   = {CoRR},
  volume    = {abs/1208.0312},
  year      = {2012},
  url       = {http://arxiv.org/abs/1208.0312},
  timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/corr/abs-1208-0312},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/networks/GabowGTW09,
  author    = {Harold N. Gabow and
               Michel X. Goemans and
               {\'{E}}va Tardos and
               David P. Williamson},
  title     = {Approximating the smallest \emph{k}-edge connected spanning subgraph
               by LP-rounding},
  journal   = {Networks},
  volume    = {53},
  number    = {4},
  pages     = {345--357},
  year      = {2009},
  url       = {https://doi.org/10.1002/net.20289},
  doi       = {10.1002/net.20289},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/networks/GabowGTW09},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/talg/Gabow09,
  author    = {Harold N. Gabow},
  title     = {Foreword to special issue on {SODA} 2007},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {5},
  number    = {3},
  pages     = {25:1},
  year      = {2009},
  url       = {http://doi.acm.org/10.1145/1541885.1541886},
  doi       = {10.1145/1541885.1541886},
  timestamp = {Fri, 06 Jan 2017 00:00:00 +0100},
  biburl    = {http://dblp.org/rec/bib/journals/talg/Gabow09},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/talg/GabowN08,
  author    = {Harold N. Gabow and
               Shuxin Nie},
  title     = {Finding a long directed cycle},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {4},
  number    = {1},
  pages     = {7:1--7:21},
  year      = {2008},
  url       = {http://doi.acm.org/10.1145/1328911.1328918},
  doi       = {10.1145/1328911.1328918},
  timestamp = {Fri, 06 Jan 2017 00:00:00 +0100},
  biburl    = {http://dblp.org/rec/bib/journals/talg/GabowN08},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/isaac/GabowN08,
  author    = {Harold N. Gabow and
               Shuxin Nie},
  title     = {Finding Long Paths, Cycles and Circuits},
  booktitle = {Algorithms and Computation, 19th International Symposium, {ISAAC}
               2008, Gold Coast, Australia, December 15-17, 2008. Proceedings},
  pages     = {752--763},
  year      = {2008},
  crossref  = {DBLP:conf/isaac/2008},
  url       = {https://doi.org/10.1007/978-3-540-92182-0_66},
  doi       = {10.1007/978-3-540-92182-0_66},
  timestamp = {Fri, 19 May 2017 01:26:43 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/isaac/GabowN08},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/soda/GabowG08,
  author    = {Harold N. Gabow and
               Suzanne Gallagher},
  title     = {Iterated rounding algorithms for the smallest \emph{k}-edge connected
               spanning subgraph},
  booktitle = {Proceedings of the Nineteenth Annual {ACM-SIAM} Symposium on Discrete
               Algorithms, {SODA} 2008, San Francisco, California, USA, January 20-22,
               2008},
  pages     = {550--559},
  year      = {2008},
  crossref  = {DBLP:conf/soda/2008},
  url       = {http://dl.acm.org/citation.cfm?id=1347082.1347143},
  timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/soda/GabowG08},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/mp/Gabow07,
  author    = {Harold N. Gabow},
  title     = {On the L\({}_{\mbox{infinity}}\)-norm of extreme points for crossing
               supermodular directed network LPs},
  journal   = {Math. Program.},
  volume    = {110},
  number    = {1},
  pages     = {111--144},
  year      = {2007},
  url       = {https://doi.org/10.1007/s10107-006-0061-9},
  doi       = {10.1007/s10107-006-0061-9},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/mp/Gabow07},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/siamcomp/Gabow07,
  author    = {Harold N. Gabow},
  title     = {Finding Paths and Cycles of Superpolylogarithmic Length},
  journal   = {{SIAM} J. Comput.},
  volume    = {36},
  number    = {6},
  pages     = {1648--1671},
  year      = {2007},
  url       = {https://doi.org/10.1137/S0097539704445366},
  doi       = {10.1137/S0097539704445366},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/siamcomp/Gabow07},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/talg/GabowBF07,
  author    = {Harold N. Gabow and
               Michael A. Bender and
               Martin Farach{-}Colton},
  title     = {Introduction to {SODA} 2002 and 2003 special issue},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {3},
  number    = {4},
  pages     = {36},
  year      = {2007},
  url       = {http://doi.acm.org/10.1145/1290672.1290673},
  doi       = {10.1145/1290672.1290673},
  timestamp = {Fri, 06 Jan 2017 00:00:00 +0100},
  biburl    = {http://dblp.org/rec/bib/journals/talg/GabowBF07},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/fmsd/BloemGS06,
  author    = {Roderick Bloem and
               Harold N. Gabow and
               Fabio Somenzi},
  title     = {An Algorithm for Strongly Connected Component Analysis in \emph{n}
               log \emph{n} Symbolic Steps},
  journal   = {Formal Methods in System Design},
  volume    = {28},
  number    = {1},
  pages     = {37--56},
  year      = {2006},
  url       = {https://doi.org/10.1007/s10703-006-4341-z},
  doi       = {10.1007/s10703-006-4341-z},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/fmsd/BloemGS06},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/jacm/Gabow06,
  author    = {Harold N. Gabow},
  title     = {Using expander graphs to find vertex connectivity},
  journal   = {J. {ACM}},
  volume    = {53},
  number    = {5},
  pages     = {800--844},
  year      = {2006},
  url       = {http://doi.acm.org/10.1145/1183907.1183912},
  doi       = {10.1145/1183907.1183912},
  timestamp = {Tue, 06 Mar 2007 00:00:00 +0100},
  biburl    = {http://dblp.org/rec/bib/journals/jacm/Gabow06},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/soda/Gabow06,
  author    = {Harold N. Gabow},
  title     = {Upper degree-constrained partial orientations},
  booktitle = {Proceedings of the Seventeenth Annual {ACM-SIAM} Symposium on Discrete
               Algorithms, {SODA} 2006, Miami, Florida, USA, January 22-26, 2006},
  pages     = {554--563},
  year      = {2006},
  crossref  = {DBLP:conf/soda/2006},
  url       = {http://dl.acm.org/citation.cfm?id=1109557.1109618},
  timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/soda/Gabow06},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/siamdm/Gabow05,
  author    = {Harold N. Gabow},
  title     = {An Improved Analysis for Approximating the Smallest k-Edge Connected
               Spanning Subgraph of a Multigraph},
  journal   = {{SIAM} J. Discrete Math.},
  volume    = {19},
  number    = {1},
  pages     = {1--18},
  year      = {2005},
  url       = {https://doi.org/10.1137/S0895480102414910},
  doi       = {10.1137/S0895480102414910},
  timestamp = {Fri, 26 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/siamdm/Gabow05},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/talg/Gabow05,
  author    = {Harold N. Gabow},
  title     = {Editor's foreword},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {1},
  number    = {1},
  pages     = {1},
  year      = {2005},
  url       = {http://doi.acm.org/10.1145/1077464.1077465},
  doi       = {10.1145/1077464.1077465},
  timestamp = {Wed, 09 Mar 2016 00:00:00 +0100},
  biburl    = {http://dblp.org/rec/bib/journals/talg/Gabow05},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/ipco/Gabow05,
  author    = {Harold N. Gabow},
  title     = {On the L\({}_{\mbox{infinity}}\)-Norm of Extreme Points for Crossing
               Supermodular Directed Network LPs},
  booktitle = {Integer Programming and Combinatorial Optimization, 11th International
               {IPCO} Conference, Berlin, Germany, June 8-10, 2005, Proceedings},
  pages     = {392--406},
  year      = {2005},
  crossref  = {DBLP:conf/ipco/2005},
  url       = {https://doi.org/10.1007/11496915_29},
  doi       = {10.1007/11496915_29},
  timestamp = {Tue, 30 May 2017 16:36:53 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/ipco/Gabow05},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/soda/GabowGTW05,
  author    = {Harold N. Gabow and
               Michel X. Goemans and
               {\'{E}}va Tardos and
               David P. Williamson},
  title     = {Approximating the smallest \emph{k}-edge connected spanning subgraph
               by LP-rounding},
  booktitle = {Proceedings of the Sixteenth Annual {ACM-SIAM} Symposium on Discrete
               Algorithms, {SODA} 2005, Vancouver, British Columbia, Canada, January
               23-25, 2005},
  pages     = {562--571},
  year      = {2005},
  crossref  = {DBLP:conf/soda/2005},
  url       = {http://dl.acm.org/citation.cfm?id=1070432.1070511},
  timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/soda/GabowGTW05},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/stoc/2005,
  editor    = {Harold N. Gabow and
               Ronald Fagin},
  title     = {Proceedings of the 37th Annual {ACM} Symposium on Theory of Computing,
               Baltimore, MD, USA, May 22-24, 2005},
  publisher = {{ACM}},
  year      = {2005},
  isbn      = {1-58113-960-8},
  timestamp = {Tue, 12 Jul 2005 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/stoc/2005},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/ijfcs/SkulrattanakulchaiG04,
  author    = {San Skulrattanakulchai and
               Harold N. Gabow},
  title     = {Coloring Algorithms On Subcubic Graphs},
  journal   = {Int. J. Found. Comput. Sci.},
  volume    = {15},
  number    = {1},
  pages     = {21--40},
  year      = {2004},
  url       = {https://doi.org/10.1142/S0129054104002285},
  doi       = {10.1142/S0129054104002285},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/ijfcs/SkulrattanakulchaiG04},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/siamdm/Gabow04,
  author    = {Harold N. Gabow},
  title     = {An Ear Decomposition Approach to Approximating the Smallest 3-Edge
               Connected Spanning Subgraph of a Multigraph},
  journal   = {{SIAM} J. Discrete Math.},
  volume    = {18},
  number    = {1},
  pages     = {41--70},
  year      = {2004},
  url       = {https://doi.org/10.1137/S0895480102405476},
  doi       = {10.1137/S0895480102405476},
  timestamp = {Fri, 26 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/siamdm/Gabow04},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/soda/GabowN04,
  author    = {Harold N. Gabow and
               Shuxin Nie},
  title     = {Finding a long directed cycle},
  booktitle = {Proceedings of the Fifteenth Annual {ACM-SIAM} Symposium on Discrete
               Algorithms, {SODA} 2004, New Orleans, Louisiana, USA, January 11-14,
               2004},
  pages     = {49--58},
  year      = {2004},
  crossref  = {DBLP:conf/soda/2004},
  url       = {http://dl.acm.org/citation.cfm?id=982792.982800},
  timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/soda/GabowN04},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/soda/Gabow04,
  author    = {Harold N. Gabow},
  title     = {Special edges, and approximating the smallest directed \emph{k}-edge
               connected spanning subgraph},
  booktitle = {Proceedings of the Fifteenth Annual {ACM-SIAM} Symposium on Discrete
               Algorithms, {SODA} 2004, New Orleans, Louisiana, USA, January 11-14,
               2004},
  pages     = {234--243},
  year      = {2004},
  crossref  = {DBLP:conf/soda/2004},
  url       = {http://dl.acm.org/citation.cfm?id=982792.982826},
  timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/soda/Gabow04},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Gabow04,
  author    = {Harold N. Gabow},
  title     = {Finding paths and cycles of superpolylogarithmic length},
  booktitle = {Proceedings of the 36th Annual {ACM} Symposium on Theory of Computing,
               Chicago, IL, USA, June 13-16, 2004},
  pages     = {407--416},
  year      = {2004},
  crossref  = {DBLP:conf/stoc/2004},
  url       = {http://doi.acm.org/10.1145/1007352.1007418},
  doi       = {10.1145/1007352.1007418},
  timestamp = {Wed, 15 Feb 2006 00:00:00 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/stoc/Gabow04},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/cn/BrownG03,
  author    = {Timothy X. Brown and
               Harold N. Gabow},
  title     = {The limits of input-queued switch performance with future packet arrival
               information},
  journal   = {Computer Networks},
  volume    = {42},
  number    = {4},
  pages     = {441--460},
  year      = {2003},
  url       = {https://doi.org/10.1016/S1389-1286(03)00194-4},
  doi       = {10.1016/S1389-1286(03)00194-4},
  timestamp = {Thu, 18 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/cn/BrownG03},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/soda/Gabow03,
  author    = {Harold N. Gabow},
  title     = {Better performance bounds for finding the smallest k-edge connected
               spanning subgraph of a multigraph},
  booktitle = {Proceedings of the Fourteenth Annual {ACM-SIAM} Symposium on Discrete
               Algorithms, January 12-14, 2003, Baltimore, Maryland, {USA.}},
  pages     = {460--469},
  year      = {2003},
  crossref  = {DBLP:conf/soda/2003},
  url       = {http://dl.acm.org/citation.cfm?id=644108.644184},
  timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/soda/Gabow03},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/GabowS02,
  author    = {Harold N. Gabow and
               San Skulrattanakulchai},
  title     = {Coloring Algorithms on Subcubic Graphs},
  booktitle = {Computing and Combinatorics, 8th Annual International Conference,
               {COCOON} 2002, Singapore, August 15-17, 2002, Proceedings},
  pages     = {67--76},
  year      = {2002},
  crossref  = {DBLP:conf/cocoon/2002},
  url       = {https://doi.org/10.1007/3-540-45655-4_9},
  doi       = {10.1007/3-540-45655-4_9},
  timestamp = {Fri, 26 May 2017 14:09:15 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/cocoon/GabowS02},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/soda/Gabow02,
  author    = {Harold N. Gabow},
  title     = {An ear decomposition approach to approximating the smallest 3-edge
               connected spanning subgraph of a multigraph},
  booktitle = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete
               Algorithms, January 6-8, 2002, San Francisco, CA, {USA.}},
  pages     = {84--93},
  year      = {2002},
  crossref  = {DBLP:conf/soda/2002},
  url       = {http://dl.acm.org/citation.cfm?id=545381.545391},
  timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/soda/Gabow02},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/swat/GabowP02,
  author    = {Harold N. Gabow and
               Seth Pettie},
  title     = {The Dynamic Vertex Minimum Problem and Its Application to Clustering-Type
               Approximation Algorithms},
  booktitle = {Algorithm Theory - {SWAT} 2002, 8th Scandinavian Workshop on Algorithm
               Theory, Turku, Finland, July 3-5, 2002 Proceedings},
  pages     = {190--199},
  year      = {2002},
  crossref  = {DBLP:conf/swat/2002},
  url       = {https://doi.org/10.1007/3-540-45471-3_20},
  doi       = {10.1007/3-540-45471-3_20},
  timestamp = {Fri, 26 May 2017 14:09:15 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/swat/GabowP02},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/dam/GabowJ01,
  author    = {Harold N. Gabow and
               Tibor Jord{\'{a}}n},
  title     = {Bipartition constrained edge-splitting in directed graphs},
  journal   = {Discrete Applied Mathematics},
  volume    = {115},
  number    = {1-3},
  pages     = {49--62},
  year      = {2001},
  url       = {https://doi.org/10.1016/S0166-218X(01)00214-1},
  doi       = {10.1016/S0166-218X(01)00214-1},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/dam/GabowJ01},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/jal/GabowKT01,
  author    = {Harold N. Gabow and
               Haim Kaplan and
               Robert Endre Tarjan},
  title     = {Unique Maximum Matching Algorithms},
  journal   = {J. Algorithms},
  volume    = {40},
  number    = {2},
  pages     = {159--183},
  year      = {2001},
  url       = {https://doi.org/10.1006/jagm.2001.1167},
  doi       = {10.1006/jagm.2001.1167},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/jal/GabowKT01},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/jea/GabowK01,
  author    = {Harold N. Gabow and
               Tadayoshi Kohno},
  title     = {A Network-Flow-Based Scheduler: Design, Performance History, and Experimental
               Analysis},
  journal   = {{ACM} Journal of Experimental Algorithmics},
  volume    = {6},
  pages     = {3},
  year      = {2001},
  url       = {http://doi.acm.org/10.1145/945394.945397},
  doi       = {10.1145/945394.945397},
  timestamp = {Mon, 05 Dec 2011 00:00:00 +0100},
  biburl    = {http://dblp.org/rec/bib/journals/jea/GabowK01},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/mobihoc/BrownGZ01,
  author    = {Timothy X. Brown and
               Harold N. Gabow and
               Qi Zhang},
  title     = {Maximum flow-life curve for a wireless ad hoc network},
  booktitle = {Proceedings of the 2nd {ACM} Interational Symposium on Mobile Ad Hoc
               Networking and Computing, MobiHoc 2001, October 4-5, 2001, Long Beach,
               CA, {USA}},
  pages     = {128--136},
  year      = {2001},
  crossref  = {DBLP:conf/mobihoc/2001},
  url       = {http://doi.acm.org/10.1145/501416.501434},
  doi       = {10.1145/501416.501434},
  timestamp = {Wed, 15 Feb 2006 00:00:00 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/mobihoc/BrownGZ01},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/bioinformatics/XuXG00,
  author    = {Ying Xu and
               Dong Xu and
               Harold N. Gabow},
  title     = {Protein domain decomposition using a graph-theoretic approach},
  journal   = {Bioinformatics},
  volume    = {16},
  number    = {12},
  pages     = {1091--1104},
  year      = {2000},
  url       = {https://doi.org/10.1093/bioinformatics/16.12.1091},
  doi       = {10.1093/bioinformatics/16.12.1091},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/bioinformatics/XuXG00},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/ipl/Gabow00,
  author    = {Harold N. Gabow},
  title     = {Path-based depth-first search for strong and biconnected components},
  journal   = {Inf. Process. Lett.},
  volume    = {74},
  number    = {3-4},
  pages     = {107--114},
  year      = {2000},
  url       = {https://doi.org/10.1016/S0020-0190(00)00051-X},
  doi       = {10.1016/S0020-0190(00)00051-X},
  timestamp = {Fri, 26 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/ipl/Gabow00},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/jal/HenzingerRG00,
  author    = {Monika Rauch Henzinger and
               Satish Rao and
               Harold N. Gabow},
  title     = {Computing Vertex Connectivity: New Bounds from Old Techniques},
  journal   = {J. Algorithms},
  volume    = {34},
  number    = {2},
  pages     = {222--250},
  year      = {2000},
  url       = {https://doi.org/10.1006/jagm.1999.1055},
  doi       = {10.1006/jagm.1999.1055},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/jal/HenzingerRG00},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/jco/GabowJ00,
  author    = {Harold N. Gabow and
               Tibor Jord{\'{a}}n},
  title     = {Incrementing Bipartite Digraph Edge-Connectivity},
  journal   = {J. Comb. Optim.},
  volume    = {4},
  number    = {4},
  pages     = {449--486},
  year      = {2000},
  url       = {https://doi.org/10.1023/A:1009885511650},
  doi       = {10.1023/A:1009885511650},
  timestamp = {Thu, 18 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/jco/GabowJ00},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/pc/OlikerBG00,
  author    = {Leonid Oliker and
               Rupak Biswas and
               Harold N. Gabow},
  title     = {Parallel tetrahedral mesh adaptation with dynamic load balancing},
  journal   = {Parallel Computing},
  volume    = {26},
  number    = {12},
  pages     = {1583--1608},
  year      = {2000},
  url       = {https://doi.org/10.1016/S0167-8191(00)00047-8},
  doi       = {10.1016/S0167-8191(00)00047-8},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/pc/OlikerBG00},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/siamcomp/GabowJ00,
  author    = {Harold N. Gabow and
               Tibor Jord{\'{a}}n},
  title     = {How to Make a Square Grid Framework with Cables Rigid},
  journal   = {{SIAM} J. Comput.},
  volume    = {30},
  number    = {2},
  pages     = {649--680},
  year      = {2000},
  url       = {https://doi.org/10.1137/S0097539798347189},
  doi       = {10.1137/S0097539798347189},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/siamcomp/GabowJ00},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/fmcad/BloemGS00,
  author    = {Roderick Bloem and
               Harold N. Gabow and
               Fabio Somenzi},
  title     = {An Algorithm for Strongly Connected Component Analysis in \emph{n}
               log \emph{n} Symbolic Steps},
  booktitle = {Formal Methods in Computer-Aided Design, Third International Conference,
               {FMCAD} 2000, Austin, Texas, USA, November 1-3, 2000, Proceedings},
  pages     = {37--54},
  year      = {2000},
  crossref  = {DBLP:conf/fmcad/2000},
  url       = {https://doi.org/10.1007/3-540-40922-X_4},
  doi       = {10.1007/3-540-40922-X_4},
  timestamp = {Wed, 24 May 2017 15:40:42 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/fmcad/BloemGS00},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/focs/Gabow00,
  author    = {Harold N. Gabow},
  title     = {Using Expander Graphs to Find Vertex Connectivity},
  booktitle = {41st Annual Symposium on Foundations of Computer Science, {FOCS} 2000,
               12-14 November 2000, Redondo Beach, California, {USA}},
  pages     = {410--420},
  year      = {2000},
  crossref  = {DBLP:conf/focs/2000},
  url       = {https://doi.org/10.1109/SFCS.2000.892129},
  doi       = {10.1109/SFCS.2000.892129},
  timestamp = {Fri, 19 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/focs/Gabow00},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/siamdm/Bang-JensenGJS99,
  author    = {J{\o}rgen Bang{-}Jensen and
               Harold N. Gabow and
               Tibor Jord{\'{a}}n and
               Zolt{\'{a}}n Szigeti},
  title     = {Edge-Connectivity Augmentation with Partition Constraints},
  journal   = {{SIAM} J. Discrete Math.},
  volume    = {12},
  number    = {2},
  pages     = {160--207},
  year      = {1999},
  url       = {https://doi.org/10.1137/S0895480197324700},
  doi       = {10.1137/S0895480197324700},
  timestamp = {Fri, 26 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/siamdm/Bang-JensenGJS99},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/soda/GabowJ99,
  author    = {Harold N. Gabow and
               Tibor Jord{\'{a}}n},
  title     = {How to Make a Square Grid Framework with Cables Rigid},
  booktitle = {Proceedings of the Tenth Annual {ACM-SIAM} Symposium on Discrete Algorithms,
               17-19 January 1999, Baltimore, Maryland.},
  pages     = {356--365},
  year      = {1999},
  crossref  = {DBLP:conf/soda/1999},
  url       = {http://dl.acm.org/citation.cfm?id=314500.314588},
  timestamp = {Mon, 14 Mar 2016 15:38:52 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/soda/GabowJ99},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GabowKT99,
  author    = {Harold N. Gabow and
               Haim Kaplan and
               Robert Endre Tarjan},
  title     = {Unique Maximum Matching Algorithms},
  booktitle = {Proceedings of the Thirty-First Annual {ACM} Symposium on Theory of
               Computing, May 1-4, 1999, Atlanta, Georgia, {USA}},
  pages     = {70--78},
  year      = {1999},
  crossref  = {DBLP:conf/stoc/1999},
  url       = {http://doi.acm.org/10.1145/301250.301273},
  doi       = {10.1145/301250.301273},
  timestamp = {Thu, 16 Feb 2012 00:00:00 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/stoc/GabowKT99},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/bioinformatics/TabaskaCGS98,
  author    = {Jack E. Tabaska and
               Robert B. Cary and
               Harold N. Gabow and
               Gary D. Stormo},
  title     = {An {RNA} folding method capable of identifying pseudoknots and base
               triples},
  journal   = {Bioinformatics},
  volume    = {14},
  number    = {8},
  pages     = {691--699},
  year      = {1998},
  url       = {http://bioinformatics.oxfordjournals.org/content/14/8/691.abstract},
  timestamp = {Wed, 29 Jun 2011 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/bioinformatics/TabaskaCGS98},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/jal/Gabow98,
  author    = {Harold N. Gabow},
  title     = {Algorithms for Graphic Polymatroids and Parametris s-Sets},
  journal   = {J. Algorithms},
  volume    = {26},
  number    = {1},
  pages     = {48--86},
  year      = {1998},
  url       = {https://doi.org/10.1006/jagm.1997.0904},
  doi       = {10.1006/jagm.1997.0904},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/jal/Gabow98},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/mp/GabowGW98,
  author    = {Harold N. Gabow and
               Michel X. Goemans and
               David P. Williamson},
  title     = {An efficient approximation algorithm for the survivable network design
               problem},
  journal   = {Math. Program.},
  volume    = {82},
  pages     = {13--40},
  year      = {1998},
  url       = {https://doi.org/10.1007/BF01585864},
  doi       = {10.1007/BF01585864},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/mp/GabowGW98},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/mp/GabowM98,
  author    = {Harold N. Gabow and
               K. S. Manu},
  title     = {Packing algorithms for arborescences (and spanning trees) in capacitated
               graphs},
  journal   = {Math. Program.},
  volume    = {82},
  pages     = {83--109},
  year      = {1998},
  url       = {https://doi.org/10.1007/BF01585866},
  doi       = {10.1007/BF01585866},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/mp/GabowM98},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/europar/OlikerBG98,
  author    = {Leonid Oliker and
               Rupak Biswas and
               Harold N. Gabow},
  title     = {Performance Analysis and Portability of the {PLUM} Load Balancing
               System},
  booktitle = {Euro-Par '98 Parallel Processing, 4th International Euro-Par Conference,
               Southampton, UK, September 1-4, 1998, Proceedings},
  pages     = {307--317},
  year      = {1998},
  crossref  = {DBLP:conf/europar/1998},
  url       = {https://doi.org/10.1007/BFb0057867},
  doi       = {10.1007/BFb0057867},
  timestamp = {Tue, 23 May 2017 11:53:57 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/europar/OlikerBG98},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/soda/Bang-JensenGJS98,
  author    = {J{\o}rgen Bang{-}Jensen and
               Harold N. Gabow and
               Tibor Jord{\'{a}}n and
               Zolt{\'{a}}n Szigeti},
  title     = {Edge-Connectivity Augmentation with Partition Constraints},
  booktitle = {Proceedings of the Ninth Annual {ACM-SIAM} Symposium on Discrete Algorithms,
               25-27 January 1998, San Francisco, California.},
  pages     = {306--315},
  year      = {1998},
  crossref  = {DBLP:conf/soda/1998},
  url       = {http://dl.acm.org/citation.cfm?id=314613.314721},
  timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/soda/Bang-JensenGJS98},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/jcss/GabowX96,
  author    = {Harold N. Gabow and
               Ying Xu},
  title     = {Efficient Theoretic and Practical Algorithms for Linear Matroid Intersection
               Problems},
  journal   = {J. Comput. Syst. Sci.},
  volume    = {53},
  number    = {1},
  pages     = {129--147},
  year      = {1996},
  url       = {https://doi.org/10.1006/jcss.1996.0054},
  doi       = {10.1006/jcss.1996.0054},
  timestamp = {Sat, 20 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/jcss/GabowX96},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/focs/HenzingerRG96,
  author    = {Monika Rauch Henzinger and
               Satish Rao and
               Harold N. Gabow},
  title     = {Computing Vertex Connectivity: New Bounds from Old Techniques},
  booktitle = {37th Annual Symposium on Foundations of Computer Science, {FOCS} '96,
               Burlington, Vermont, USA, 14-16 October, 1996},
  pages     = {462--471},
  year      = {1996},
  crossref  = {DBLP:conf/focs/1996},
  url       = {https://doi.org/10.1109/SFCS.1996.548505},
  doi       = {10.1109/SFCS.1996.548505},
  timestamp = {Fri, 19 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/focs/HenzingerRG96},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/soda/Gabow96,
  author    = {Harold N. Gabow},
  title     = {Perfect Arborescence Packing in Preflow Mincut Graphs},
  booktitle = {Proceedings of the Seventh Annual {ACM-SIAM} Symposium on Discrete
               Algorithms, 28-30 January 1996, Atlanta, Georgia.},
  pages     = {528--538},
  year      = {1996},
  crossref  = {DBLP:conf/soda/1996},
  url       = {http://dl.acm.org/citation.cfm?id=313852.314113},
  timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/soda/Gabow96},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/jal/Gabow95,
  author    = {Harold N. Gabow},
  title     = {Centroids, Representations, and Submodular Flows},
  journal   = {J. Algorithms},
  volume    = {18},
  number    = {3},
  pages     = {586--628},
  year      = {1995},
  url       = {https://doi.org/10.1006/jagm.1995.1022},
  doi       = {10.1006/jagm.1995.1022},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/jal/Gabow95},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/jcss/Gabow95,
  author    = {Harold N. Gabow},
  title     = {A Matroid Approach to Finding Edge Connectivity and Packing Arborescences},
  journal   = {J. Comput. Syst. Sci.},
  volume    = {50},
  number    = {2},
  pages     = {259--273},
  year      = {1995},
  url       = {https://doi.org/10.1006/jcss.1995.1022},
  doi       = {10.1006/jcss.1995.1022},
  timestamp = {Sat, 20 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/jcss/Gabow95},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/ipco/GabowM95,
  author    = {Harold N. Gabow and
               K. S. Manu},
  title     = {Packing Algorithms for Arborescences (and Spanning Trees) in Capacitated
               Graphs},
  booktitle = {Integer Programming and Combinatorial Optimization, 4th International
               {IPCO} Conference, Copenhagen, Denmark, May 29-31, 1995, Proceedings},
  pages     = {388--402},
  year      = {1995},
  crossref  = {DBLP:conf/ipco/1995},
  url       = {https://doi.org/10.1007/3-540-59408-6_67},
  doi       = {10.1007/3-540-59408-6_67},
  timestamp = {Sat, 20 May 2017 15:32:55 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/ipco/GabowM95},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/soda/Gabow95,
  author    = {Harold N. Gabow},
  title     = {Algorithms for Graphic Polymatroids and Parametric s-Sets},
  booktitle = {Proceedings of the Sixth Annual {ACM-SIAM} Symposium on Discrete Algorithms,
               22-24 January 1995. San Francisco, California.},
  pages     = {88--97},
  year      = {1995},
  crossref  = {DBLP:conf/soda/1995},
  url       = {http://dl.acm.org/citation.cfm?id=313651.313667},
  timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/soda/Gabow95},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/algorithmica/Gabow94,
  author    = {Harold N. Gabow},
  title     = {Editor's Foreword: Special Issur on Network Flow Algorithms},
  journal   = {Algorithmica},
  volume    = {11},
  number    = {3},
  pages     = {197--199},
  year      = {1994},
  url       = {https://doi.org/10.1007/BF01240732},
  doi       = {10.1007/BF01240732},
  timestamp = {Wed, 17 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/algorithmica/Gabow94},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/jal/EhrenfeuchtGMS94,
  author    = {Andrzej Ehrenfeucht and
               Harold N. Gabow and
               Ross M. McConnell and
               Stephen J. Sullivan},
  title     = {An O(n{\({^2}\)}) Divide-and-Conquer Algorithm for the Prime Tree
               Decomposition of Two-Structures and Modular Decomposition of Graphs},
  journal   = {J. Algorithms},
  volume    = {16},
  number    = {2},
  pages     = {283--294},
  year      = {1994},
  url       = {https://doi.org/10.1006/jagm.1994.1013},
  doi       = {10.1006/jagm.1994.1013},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/jal/EhrenfeuchtGMS94},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/isaac/XuG94,
  author    = {Ying Xu and
               Harold N. Gabow},
  title     = {Fast Algorithms for Transversal Matroid Intersection Problems},
  booktitle = {Algorithms and Computation, 5th International Symposium, {ISAAC} '94,
               Beijing, P. R. China, August 25-27, 1994, Proceedings},
  pages     = {625--633},
  year      = {1994},
  crossref  = {DBLP:conf/isaac/1994},
  url       = {https://doi.org/10.1007/3-540-58325-4_231},
  doi       = {10.1007/3-540-58325-4_231},
  timestamp = {Sat, 20 May 2017 15:32:55 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/isaac/XuG94},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Gabow94,
  author    = {Harold N. Gabow},
  title     = {Efficient splitting off algorithms for graphs},
  booktitle = {Proceedings of the Twenty-Sixth Annual {ACM} Symposium on Theory of
               Computing, 23-25 May 1994, Montr{\'{e}}al, Qu{\'{e}}bec,
               Canada},
  pages     = {696--705},
  year      = {1994},
  crossref  = {DBLP:conf/stoc/STOC26},
  url       = {http://doi.acm.org/10.1145/195058.195436},
  doi       = {10.1145/195058.195436},
  timestamp = {Thu, 16 Feb 2012 00:00:00 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/stoc/Gabow94},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/focs/Gabow93,
  author    = {Harold N. Gabow},
  title     = {A Framework for Cost-scaling Algorithms for Submodular Flow Problems},
  booktitle = {34th Annual Symposium on Foundations of Computer Science, Palo Alto,
               California, USA, 3-5 November 1993},
  pages     = {449--458},
  year      = {1993},
  crossref  = {DBLP:conf/focs/FOCS34},
  url       = {https://doi.org/10.1109/SFCS.1993.366842},
  doi       = {10.1109/SFCS.1993.366842},
  timestamp = {Fri, 19 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/focs/Gabow93},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/ipco/GabowGW93,
  author    = {Harold N. Gabow and
               Michel X. Goemans and
               David P. Williamson},
  title     = {An efficient approximation algorithm for the survivable network design
               problem},
  booktitle = {Proceedings of the 3rd Integer Programming and Combinatorial Optimization
               Conference, Erice, Italy, April 29 - May 1, 1993},
  pages     = {57--74},
  year      = {1993},
  crossref  = {DBLP:conf/ipco/1993},
  timestamp = {Wed, 09 Oct 2002 11:26:33 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/ipco/GabowGW93},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/soda/Gabow93,
  author    = {Harold N. Gabow},
  title     = {A Representation for Crossing Set Families with Applications to Submodular
               Flow Problems},
  booktitle = {Proceedings of the Fourth Annual {ACM/SIGACT-SIAM} Symposium on Discrete
               Algorithms, 25-27 January 1993, Austin, Texas.},
  pages     = {202--211},
  year      = {1993},
  crossref  = {DBLP:conf/soda/1993},
  url       = {http://dl.acm.org/citation.cfm?id=313559.313753},
  timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/soda/Gabow93},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/algorithmica/GabowW92,
  author    = {Harold N. Gabow and
               Herbert H. Westermann},
  title     = {Forests, Frames, and Games: Algorithms for Matroid Sums and Applications},
  journal   = {Algorithmica},
  volume    = {7},
  number    = {5{\&}6},
  pages     = {465--497},
  year      = {1992},
  url       = {https://doi.org/10.1007/BF01758774},
  doi       = {10.1007/BF01758774},
  timestamp = {Wed, 17 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/algorithmica/GabowW92},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/jacm/GabowT91,
  author    = {Harold N. Gabow and
               Robert Endre Tarjan},
  title     = {Faster Scaling Algorithms for General Graph-Matching Problems},
  journal   = {J. {ACM}},
  volume    = {38},
  number    = {4},
  pages     = {815--853},
  year      = {1991},
  url       = {http://doi.acm.org/10.1145/115234.115366},
  doi       = {10.1145/115234.115366},
  timestamp = {Thu, 20 Nov 2003 00:00:00 +0100},
  biburl    = {http://dblp.org/rec/bib/journals/jacm/GabowT91},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/focs/Gabow91,
  author    = {Harold N. Gabow},
  title     = {Applications of a Poset Representation to Edge Connectivity and Graph
               Rigidity},
  booktitle = {32nd Annual Symposium on Foundations of Computer Science, San Juan,
               Puerto Rico, 1-4 October 1991},
  pages     = {812--821},
  year      = {1991},
  crossref  = {DBLP:conf/focs/FOCS32},
  url       = {https://doi.org/10.1109/SFCS.1991.185453},
  doi       = {10.1109/SFCS.1991.185453},
  timestamp = {Fri, 19 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/focs/Gabow91},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Gabow91,
  author    = {Harold N. Gabow},
  title     = {A Matroid Approach to Finding Edge Connectivity and Packing Arborescences},
  booktitle = {Proceedings of the 23rd Annual {ACM} Symposium on Theory of Computing,
               May 5-8, 1991, New Orleans, Louisiana, {USA}},
  pages     = {112--122},
  year      = {1991},
  crossref  = {DBLP:conf/stoc/STOC23},
  url       = {http://doi.acm.org/10.1145/103418.103436},
  doi       = {10.1145/103418.103436},
  timestamp = {Mon, 17 Oct 2011 15:55:10 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/stoc/Gabow91},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/soda/Gabow90,
  author    = {Harold N. Gabow},
  title     = {Data Structures for Weighted Matching and Nearest Common Ancestors
               with Linking},
  booktitle = {Proceedings of the First Annual {ACM-SIAM} Symposium on Discrete Algorithms,
               22-24 January 1990, San Francisco, California.},
  pages     = {434--443},
  year      = {1990},
  crossref  = {DBLP:conf/soda/1990},
  url       = {http://dl.acm.org/citation.cfm?id=320176.320229},
  timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/soda/Gabow90},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/jacm/GabowGS89,
  author    = {Harold N. Gabow and
               Zvi Galil and
               Thomas H. Spencer},
  title     = {Efficient implementation of graph algorithms using contraction},
  journal   = {J. {ACM}},
  volume    = {36},
  number    = {3},
  pages     = {540--572},
  year      = {1989},
  url       = {http://doi.acm.org/10.1145/65950.65954},
  doi       = {10.1145/65950.65954},
  timestamp = {Thu, 20 Nov 2003 00:00:00 +0100},
  biburl    = {http://dblp.org/rec/bib/journals/jacm/GabowGS89},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/siamcomp/GabowT89,
  author    = {Harold N. Gabow and
               Robert Endre Tarjan},
  title     = {Faster Scaling Algorithms for Network Problems},
  journal   = {{SIAM} J. Comput.},
  volume    = {18},
  number    = {5},
  pages     = {1013--1036},
  year      = {1989},
  url       = {https://doi.org/10.1137/0218069},
  doi       = {10.1137/0218069},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/siamcomp/GabowT89},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/focs/GabowX89,
  author    = {Harold N. Gabow and
               Ying Xu},
  title     = {Efficient Algorithms for Independent Assignments on Graphic and Linear
               Matroids},
  booktitle = {30th Annual Symposium on Foundations of Computer Science, Research
               Triangle Park, North Carolina, USA, 30 October - 1 November 1989},
  pages     = {106--111},
  year      = {1989},
  crossref  = {DBLP:conf/focs/FOCS30},
  url       = {https://doi.org/10.1109/SFCS.1989.63463},
  doi       = {10.1109/SFCS.1989.63463},
  timestamp = {Fri, 19 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/focs/GabowX89},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/cacm/DriscollGST88,
  author    = {James R. Driscoll and
               Harold N. Gabow and
               Ruth Shrairman and
               Robert Endre Tarjan},
  title     = {Relaxed Heaps: An Alternative to Fibonacci Heaps with Applications
               to Parallel Computation},
  journal   = {Commun. {ACM}},
  volume    = {31},
  number    = {11},
  pages     = {1343--1354},
  year      = {1988},
  url       = {http://doi.acm.org/10.1145/50087.50096},
  doi       = {10.1145/50087.50096},
  timestamp = {Tue, 07 Jun 2011 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/cacm/DriscollGST88},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/ipl/GabowT88,
  author    = {Harold N. Gabow and
               Robert Endre Tarjan},
  title     = {A Linear-Time Algorithm for Finding a Minimum Spanning Pseudoforest},
  journal   = {Inf. Process. Lett.},
  volume    = {27},
  number    = {5},
  pages     = {259--263},
  year      = {1988},
  url       = {https://doi.org/10.1016/0020-0190(88)90089-0},
  doi       = {10.1016/0020-0190(88)90089-0},
  timestamp = {Fri, 26 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/ipl/GabowT88},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/jal/GabowT88,
  author    = {Harold N. Gabow and
               Robert Endre Tarjan},
  title     = {Algorithms for Two Bottleneck Optimization Problems},
  journal   = {J. Algorithms},
  volume    = {9},
  number    = {3},
  pages     = {411--417},
  year      = {1988},
  url       = {https://doi.org/10.1016/0196-6774(88)90031-4},
  doi       = {10.1016/0196-6774(88)90031-4},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/jal/GabowT88},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/siamcomp/Gabow88,
  author    = {Harold N. Gabow},
  title     = {Scheduling {UET} Systems on Two Uniform Processors and Length Two
               Pipelines},
  journal   = {{SIAM} J. Comput.},
  volume    = {17},
  number    = {4},
  pages     = {810--829},
  year      = {1988},
  url       = {https://doi.org/10.1137/0217051},
  doi       = {10.1137/0217051},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/siamcomp/Gabow88},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GabowW88,
  author    = {Harold N. Gabow and
               Herbert H. Westermann},
  title     = {Forests, Frames and Games: Algorithms for Matroid Sums and Applications},
  booktitle = {Proceedings of the 20th Annual {ACM} Symposium on Theory of Computing,
               May 2-4, 1988, Chicago, Illinois, {USA}},
  pages     = {407--421},
  year      = {1988},
  crossref  = {DBLP:conf/stoc/STOC20},
  url       = {http://doi.acm.org/10.1145/62212.62252},
  doi       = {10.1145/62212.62252},
  timestamp = {Mon, 17 Oct 2011 15:55:10 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/stoc/GabowW88},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GabowT88,
  author    = {Harold N. Gabow and
               Robert Endre Tarjan},
  title     = {Almost-Optimum Speed-ups of Algorithms for Bipartite Matching and
               Related Problems},
  booktitle = {Proceedings of the 20th Annual {ACM} Symposium on Theory of Computing,
               May 2-4, 1988, Chicago, Illinois, {USA}},
  pages     = {514--527},
  year      = {1988},
  crossref  = {DBLP:conf/stoc/STOC20},
  url       = {http://doi.acm.org/10.1145/62212.62263},
  doi       = {10.1145/62212.62263},
  timestamp = {Mon, 17 Oct 2011 15:55:10 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/stoc/GabowT88},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/combinatorica/GabowGST86,
  author    = {Harold N. Gabow and
               Zvi Galil and
               Thomas H. Spencer and
               Robert Endre Tarjan},
  title     = {Efficient algorithms for finding minimum spanning trees in undirected
               and directed graphs},
  journal   = {Combinatorica},
  volume    = {6},
  number    = {2},
  pages     = {109--122},
  year      = {1986},
  url       = {https://doi.org/10.1007/BF02579168},
  doi       = {10.1007/BF02579168},
  timestamp = {Thu, 18 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/combinatorica/GabowGST86},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/combinatorica/GabowS86,
  author    = {Harold N. Gabow and
               Matthias F. M. Stallmann},
  title     = {An augmenting path algorithm for linear matroid parity},
  journal   = {Combinatorica},
  volume    = {6},
  number    = {2},
  pages     = {123--150},
  year      = {1986},
  url       = {https://doi.org/10.1007/BF02579169},
  doi       = {10.1007/BF02579169},
  timestamp = {Thu, 18 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/combinatorica/GabowS86},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/siamcomp/GalilMG86,
  author    = {Zvi Galil and
               Silvio Micali and
               Harold N. Gabow},
  title     = {An {O(EV} log {V)} Algorithm for Finding a Maximal Weighted Matching
               in General Graphs},
  journal   = {{SIAM} J. Comput.},
  volume    = {15},
  number    = {1},
  pages     = {120--130},
  year      = {1986},
  url       = {https://doi.org/10.1137/0215009},
  doi       = {10.1137/0215009},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/siamcomp/GalilMG86},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/jcss/GabowT85,
  author    = {Harold N. Gabow and
               Robert Endre Tarjan},
  title     = {A Linear-Time Algorithm for a Special Case of Disjoint Set Union},
  journal   = {J. Comput. Syst. Sci.},
  volume    = {30},
  number    = {2},
  pages     = {209--221},
  year      = {1985},
  url       = {https://doi.org/10.1016/0022-0000(85)90014-5},
  doi       = {10.1016/0022-0000(85)90014-5},
  timestamp = {Sat, 20 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/jcss/GabowT85},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/jcss/Gabow85,
  author    = {Harold N. Gabow},
  title     = {Scaling Algorithms for Network Problems},
  journal   = {J. Comput. Syst. Sci.},
  volume    = {31},
  number    = {2},
  pages     = {148--168},
  year      = {1985},
  url       = {https://doi.org/10.1016/0022-0000(85)90039-X},
  doi       = {10.1016/0022-0000(85)90039-X},
  timestamp = {Sat, 20 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/jcss/Gabow85},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/focs/Gabow85,
  author    = {Harold N. Gabow},
  title     = {A Scaling Algorithm for Weighted Matching on General Graphs},
  booktitle = {26th Annual Symposium on Foundations of Computer Science, Portland,
               Oregon, USA, 21-23 October 1985},
  pages     = {90--100},
  year      = {1985},
  crossref  = {DBLP:conf/focs/FOCS26},
  url       = {https://doi.org/10.1109/SFCS.1985.3},
  doi       = {10.1109/SFCS.1985.3},
  timestamp = {Fri, 19 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/focs/Gabow85},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/icalp/GabowS85,
  author    = {Harold N. Gabow and
               Matthias F. M. Stallmann},
  title     = {Efficient Algorithms for Graphic Matroid Intersection and Parity (Extended
               Abstract)},
  booktitle = {Automata, Languages and Programming, 12th Colloquium, Nafplion, Greece,
               July 15-19, 1985, Proceedings},
  pages     = {210--220},
  year      = {1985},
  crossref  = {DBLP:conf/icalp/1985},
  url       = {https://doi.org/10.1007/BFb0015746},
  doi       = {10.1007/BFb0015746},
  timestamp = {Fri, 19 May 2017 12:26:21 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/icalp/GabowS85},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/jal/GabowT84,
  author    = {Harold N. Gabow and
               Robert Endre Tarjan},
  title     = {Efficient Algorithms for a Family of Matroid Intersection Problems},
  journal   = {J. Algorithms},
  volume    = {5},
  number    = {1},
  pages     = {80--131},
  year      = {1984},
  url       = {https://doi.org/10.1016/0196-6774(84)90042-7},
  doi       = {10.1016/0196-6774(84)90042-7},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/jal/GabowT84},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/focs/StallmannG84,
  author    = {Matthias F. M. Stallmann and
               Harold N. Gabow},
  title     = {An Augmenting Path Algorithm for the Parity Problem on Linear Matroids},
  booktitle = {25th Annual Symposium on Foundations of Computer Science, West Palm
               Beach, Florida, USA, 24-26 October 1984},
  pages     = {217--228},
  year      = {1984},
  crossref  = {DBLP:conf/focs/FOCS25},
  url       = {https://doi.org/10.1109/SFCS.1984.715918},
  doi       = {10.1109/SFCS.1984.715918},
  timestamp = {Fri, 19 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/focs/StallmannG84},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/focs/GabowGS84,
  author    = {Harold N. Gabow and
               Zvi Galil and
               Thomas H. Spencer},
  title     = {Efficient Implementation of Graph Algorithms Using Contraction},
  booktitle = {25th Annual Symposium on Foundations of Computer Science, West Palm
               Beach, Florida, USA, 24-26 October 1984},
  pages     = {347--357},
  year      = {1984},
  crossref  = {DBLP:conf/focs/FOCS25},
  url       = {https://doi.org/10.1109/SFCS.1984.715935},
  doi       = {10.1109/SFCS.1984.715935},
  timestamp = {Fri, 19 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/focs/GabowGS84},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GabowBT84,
  author    = {Harold N. Gabow and
               Jon Louis Bentley and
               Robert Endre Tarjan},
  title     = {Scaling and Related Techniques for Geometry Problems},
  booktitle = {Proceedings of the 16th Annual {ACM} Symposium on Theory of Computing,
               April 30 - May 2, 1984, Washington, DC, {USA}},
  pages     = {135--143},
  year      = {1984},
  crossref  = {DBLP:conf/stoc/STOC16},
  url       = {http://doi.acm.org/10.1145/800057.808675},
  doi       = {10.1145/800057.808675},
  timestamp = {Mon, 17 Oct 2011 15:55:10 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/stoc/GabowBT84},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/focs/Gabow83,
  author    = {Harold N. Gabow},
  title     = {Scaling Algorithms for Network Problems},
  booktitle = {24th Annual Symposium on Foundations of Computer Science, Tucson,
               Arizona, USA, 7-9 November 1983},
  pages     = {248--257},
  year      = {1983},
  crossref  = {DBLP:conf/focs/FOCS24},
  url       = {https://doi.org/10.1109/SFCS.1983.68},
  doi       = {10.1109/SFCS.1983.68},
  timestamp = {Fri, 19 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/focs/Gabow83},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GabowT83,
  author    = {Harold N. Gabow and
               Robert Endre Tarjan},
  title     = {A Linear-Time Algorithm for a Special Case of Disjoint Set Union},
  booktitle = {Proceedings of the 15th Annual {ACM} Symposium on Theory of Computing,
               25-27 April, 1983, Boston, Massachusetts, {USA}},
  pages     = {246--251},
  year      = {1983},
  crossref  = {DBLP:conf/stoc/STOC15},
  url       = {http://doi.acm.org/10.1145/800061.808753},
  doi       = {10.1145/800061.808753},
  timestamp = {Mon, 17 Oct 2011 15:55:10 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/stoc/GabowT83},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Gabow83,
  author    = {Harold N. Gabow},
  title     = {An Efficient Reduction Technique for Degree-Constrained Subgraph and
               Bidirected Network Flow Problems},
  booktitle = {Proceedings of the 15th Annual {ACM} Symposium on Theory of Computing,
               25-27 April, 1983, Boston, Massachusetts, {USA}},
  pages     = {448--456},
  year      = {1983},
  crossref  = {DBLP:conf/stoc/STOC15},
  url       = {http://doi.acm.org/10.1145/800061.808776},
  doi       = {10.1145/800061.808776},
  timestamp = {Mon, 17 Oct 2011 15:55:10 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/stoc/Gabow83},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/jacm/Gabow82,
  author    = {Harold N. Gabow},
  title     = {An Almost-Linear Algorithm for Two-Processor Scheduling},
  journal   = {J. {ACM}},
  volume    = {29},
  number    = {3},
  pages     = {766--780},
  year      = {1982},
  url       = {http://doi.acm.org/10.1145/322326.322335},
  doi       = {10.1145/322326.322335},
  timestamp = {Thu, 20 Nov 2003 00:00:00 +0100},
  biburl    = {http://dblp.org/rec/bib/journals/jacm/Gabow82},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/siamcomp/GabowK82,
  author    = {Harold N. Gabow and
               Oded Kariv},
  title     = {Algorithms for Edge Coloring Bipartite Graphs and Multigraphs},
  journal   = {{SIAM} J. Comput.},
  volume    = {11},
  number    = {1},
  pages     = {117--129},
  year      = {1982},
  url       = {https://doi.org/10.1137/0211009},
  doi       = {10.1137/0211009},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/siamcomp/GabowK82},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/focs/GalilMG82,
  author    = {Zvi Galil and
               Silvio Micali and
               Harold N. Gabow},
  title     = {Priority Queues with Variable Priority and an {O(EV} log {V)} Algorithm
               for Finding a Maximal Weighted Matching in General Graphs},
  booktitle = {23rd Annual Symposium on Foundations of Computer Science, Chicago,
               Illinois, USA, 3-5 November 1982},
  pages     = {255--261},
  year      = {1982},
  crossref  = {DBLP:conf/focs/FOCS23},
  url       = {https://doi.org/10.1109/SFCS.1982.36},
  doi       = {10.1109/SFCS.1982.36},
  timestamp = {Fri, 19 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/focs/GalilMG82},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/ipl/Gabow81,
  author    = {Harold N. Gabow},
  title     = {A Linear-Time Recognition Algorithm for Interval Dags},
  journal   = {Inf. Process. Lett.},
  volume    = {12},
  number    = {1},
  pages     = {20--22},
  year      = {1981},
  url       = {https://doi.org/10.1016/0020-0190(81)90069-7},
  doi       = {10.1016/0020-0190(81)90069-7},
  timestamp = {Fri, 26 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/ipl/Gabow81},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/dm/Gabow79,
  author    = {Harold N. Gabow},
  title     = {Algorithmic proofs of two relations between connectivity and the 1-factors
               of a graph},
  journal   = {Discrete Mathematics},
  volume    = {26},
  number    = {1},
  pages     = {33--40},
  year      = {1979},
  url       = {https://doi.org/10.1016/0012-365X(79)90058-X},
  doi       = {10.1016/0012-365X(79)90058-X},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/dm/Gabow79},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/jacm/FusseneggerG79,
  author    = {Frank Fussenegger and
               Harold N. Gabow},
  title     = {A Counting Approach to Lower Bounds for Selection Problems},
  journal   = {J. {ACM}},
  volume    = {26},
  number    = {2},
  pages     = {227--238},
  year      = {1979},
  url       = {http://doi.acm.org/10.1145/322123.322128},
  doi       = {10.1145/322123.322128},
  timestamp = {Thu, 20 Nov 2003 00:00:00 +0100},
  biburl    = {http://dblp.org/rec/bib/journals/jacm/FusseneggerG79},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/focs/GabowT79,
  author    = {Harold N. Gabow and
               Robert Endre Tarjan},
  title     = {Efficient Algorithms for Simple Matroid Intersection Problems},
  booktitle = {20th Annual Symposium on Foundations of Computer Science, San Juan,
               Puerto Rico, 29-31 October 1979},
  pages     = {196--204},
  year      = {1979},
  crossref  = {DBLP:conf/focs/FOCS20},
  url       = {https://doi.org/10.1109/SFCS.1979.14},
  doi       = {10.1109/SFCS.1979.14},
  timestamp = {Fri, 19 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/focs/GabowT79},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/networks/Gabow78,
  author    = {Harold N. Gabow},
  title     = {A good algorithm for smallest spanning trees with a degree constraint},
  journal   = {Networks},
  volume    = {8},
  number    = {3},
  pages     = {201--208},
  year      = {1978},
  url       = {https://doi.org/10.1002/net.3230080304},
  doi       = {10.1002/net.3230080304},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/networks/Gabow78},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/siamcomp/GabowM78,
  author    = {Harold N. Gabow and
               Eugene W. Myers},
  title     = {Finding All Spanning Trees of Directed and Undirected Graphs},
  journal   = {{SIAM} J. Comput.},
  volume    = {7},
  number    = {3},
  pages     = {280--287},
  year      = {1978},
  url       = {https://doi.org/10.1137/0207024},
  doi       = {10.1137/0207024},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/siamcomp/GabowM78},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GabowK78,
  author    = {Harold N. Gabow and
               Oded Kariv},
  title     = {Algorithms for Edge Coloring Bipartite Graphs},
  booktitle = {Proceedings of the 10th Annual {ACM} Symposium on Theory of Computing,
               May 1-3, 1978, San Diego, California, {USA}},
  pages     = {184--192},
  year      = {1978},
  crossref  = {DBLP:conf/stoc/STOC10},
  url       = {http://doi.acm.org/10.1145/800133.804346},
  doi       = {10.1145/800133.804346},
  timestamp = {Mon, 17 Oct 2011 15:55:10 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/stoc/GabowK78},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/siamcomp/Gabow77,
  author    = {Harold N. Gabow},
  title     = {Two Algorithms for Generating Weighted Spanning Trees in Order},
  journal   = {{SIAM} J. Comput.},
  volume    = {6},
  number    = {1},
  pages     = {139--150},
  year      = {1977},
  url       = {https://doi.org/10.1137/0206011},
  doi       = {10.1137/0206011},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/siamcomp/Gabow77},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/ijpp/Gabow76,
  author    = {Harold N. Gabow},
  title     = {Using euler partitions to edge color bipartite multigraphs},
  journal   = {International Journal of Parallel Programming},
  volume    = {5},
  number    = {4},
  pages     = {345--355},
  year      = {1976},
  url       = {https://doi.org/10.1007/BF00998632},
  doi       = {10.1007/BF00998632},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/ijpp/Gabow76},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/ipl/Gabow76,
  author    = {Harold N. Gabow},
  title     = {Some Improved Bounds on the Number of 1-Factors of n-Connected Graphs},
  journal   = {Inf. Process. Lett.},
  volume    = {5},
  number    = {4},
  pages     = {113--115},
  year      = {1976},
  url       = {https://doi.org/10.1016/0020-0190(76)90006-5},
  doi       = {10.1016/0020-0190(76)90006-5},
  timestamp = {Fri, 26 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/ipl/Gabow76},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/ipl/Gabow76a,
  author    = {Harold N. Gabow},
  title     = {A Note on Degree-Constrained Star Subgraphs of Bipartite Graphs},
  journal   = {Inf. Process. Lett.},
  volume    = {5},
  number    = {6},
  pages     = {165--167},
  year      = {1976},
  url       = {https://doi.org/10.1016/0020-0190(76)90012-0},
  doi       = {10.1016/0020-0190(76)90012-0},
  timestamp = {Fri, 26 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/ipl/Gabow76a},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/jacm/Gabow76,
  author    = {Harold N. Gabow},
  title     = {An Efficient Implementation of Edmonds' Algorithm for Maximum Matching
               on Graphs},
  journal   = {J. {ACM}},
  volume    = {23},
  number    = {2},
  pages     = {221--234},
  year      = {1976},
  url       = {http://doi.acm.org/10.1145/321941.321942},
  doi       = {10.1145/321941.321942},
  timestamp = {Thu, 20 Nov 2003 00:00:00 +0100},
  biburl    = {http://dblp.org/rec/bib/journals/jacm/Gabow76},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/mp/Gabow76,
  author    = {Harold N. Gabow},
  title     = {Decomposing symmetric exchanges in matroid bases},
  journal   = {Math. Program.},
  volume    = {10},
  number    = {1},
  pages     = {271--276},
  year      = {1976},
  url       = {https://doi.org/10.1007/BF01580672},
  doi       = {10.1007/BF01580672},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/mp/Gabow76},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/tse/GabowMO76,
  author    = {Harold N. Gabow and
               Shachindra N. Maheswari and
               Leon J. Osterweil},
  title     = {On Two Problems in the Generation of Program Test Paths},
  journal   = {{IEEE} Trans. Software Eng.},
  volume    = {2},
  number    = {3},
  pages     = {227--231},
  year      = {1976},
  url       = {https://doi.org/10.1109/TSE.1976.233819},
  doi       = {10.1109/TSE.1976.233819},
  timestamp = {Wed, 17 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/tse/GabowMO76},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/focs/FusseneggerG76,
  author    = {Frank Fussenegger and
               Harold N. Gabow},
  title     = {Using Comparison Trees to Derive Lower Bounds for Selection Problems},
  booktitle = {17th Annual Symposium on Foundations of Computer Science, Houston,
               Texas, USA, 25-27 October 1976},
  pages     = {178--182},
  year      = {1976},
  crossref  = {DBLP:conf/focs/FOCS17},
  url       = {https://doi.org/10.1109/SFCS.1976.34},
  doi       = {10.1109/SFCS.1976.34},
  timestamp = {Fri, 19 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/focs/FusseneggerG76},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/focs/2013,
  title     = {54th Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS}
               2013, 26-29 October, 2013, Berkeley, CA, {USA}},
  publisher = {{IEEE} Computer Society},
  year      = {2013},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=6685222},
  isbn      = {978-0-7695-5135-7},
  timestamp = {Mon, 15 Dec 2014 18:48:45 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/focs/2013},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/esa/2012,
  editor    = {Leah Epstein and
               Paolo Ferragina},
  title     = {Algorithms - {ESA} 2012 - 20th Annual European Symposium, Ljubljana,
               Slovenia, September 10-12, 2012. Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {7501},
  publisher = {Springer},
  year      = {2012},
  url       = {https://doi.org/10.1007/978-3-642-33090-2},
  doi       = {10.1007/978-3-642-33090-2},
  isbn      = {978-3-642-33089-6},
  timestamp = {Fri, 26 May 2017 00:49:36 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/esa/2012},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/focs/2012,
  title     = {53rd Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS}
               2012, New Brunswick, NJ, USA, October 20-23, 2012},
  publisher = {{IEEE} Computer Society},
  year      = {2012},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=6374356},
  isbn      = {978-1-4673-4383-1},
  timestamp = {Mon, 15 Dec 2014 18:48:44 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/focs/2012},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/isaac/2008,
  editor    = {Seok{-}Hee Hong and
               Hiroshi Nagamochi and
               Takuro Fukunaga},
  title     = {Algorithms and Computation, 19th International Symposium, {ISAAC}
               2008, Gold Coast, Australia, December 15-17, 2008. Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {5369},
  publisher = {Springer},
  year      = {2008},
  url       = {https://doi.org/10.1007/978-3-540-92182-0},
  doi       = {10.1007/978-3-540-92182-0},
  isbn      = {978-3-540-92181-3},
  timestamp = {Fri, 19 May 2017 01:26:43 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/isaac/2008},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/soda/2008,
  editor    = {Shang{-}Hua Teng},
  title     = {Proceedings of the Nineteenth Annual {ACM-SIAM} Symposium on Discrete
               Algorithms, {SODA} 2008, San Francisco, California, USA, January 20-22,
               2008},
  publisher = {{SIAM}},
  year      = {2008},
  url       = {http://dl.acm.org/citation.cfm?id=1347082},
  timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/soda/2008},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/soda/2006,
  title     = {Proceedings of the Seventeenth Annual {ACM-SIAM} Symposium on Discrete
               Algorithms, {SODA} 2006, Miami, Florida, USA, January 22-26, 2006},
  publisher = {{ACM} Press},
  year      = {2006},
  url       = {http://dl.acm.org/citation.cfm?id=1109557},
  isbn      = {0-89871-605-5},
  timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/soda/2006},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/ipco/2005,
  editor    = {Michael J{\"{u}}nger and
               Volker Kaibel},
  title     = {Integer Programming and Combinatorial Optimization, 11th International
               {IPCO} Conference, Berlin, Germany, June 8-10, 2005, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {3509},
  publisher = {Springer},
  year      = {2005},
  url       = {https://doi.org/10.1007/b137143},
  doi       = {10.1007/b137143},
  isbn      = {3-540-26199-0},
  timestamp = {Tue, 30 May 2017 16:36:53 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/ipco/2005},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/soda/2005,
  title     = {Proceedings of the Sixteenth Annual {ACM-SIAM} Symposium on Discrete
               Algorithms, {SODA} 2005, Vancouver, British Columbia, Canada, January
               23-25, 2005},
  publisher = {{SIAM}},
  year      = {2005},
  url       = {http://dl.acm.org/citation.cfm?id=1070432},
  isbn      = {0-89871-585-7},
  timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/soda/2005},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/soda/2004,
  editor    = {J. Ian Munro},
  title     = {Proceedings of the Fifteenth Annual {ACM-SIAM} Symposium on Discrete
               Algorithms, {SODA} 2004, New Orleans, Louisiana, USA, January 11-14,
               2004},
  publisher = {{SIAM}},
  year      = {2004},
  url       = {http://dl.acm.org/citation.cfm?id=982792},
  isbn      = {0-89871-558-X},
  timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/soda/2004},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/stoc/2004,
  editor    = {L{\'{a}}szl{\'{o}} Babai},
  title     = {Proceedings of the 36th Annual {ACM} Symposium on Theory of Computing,
               Chicago, IL, USA, June 13-16, 2004},
  publisher = {{ACM}},
  year      = {2004},
  isbn      = {1-58113-852-0},
  timestamp = {Fri, 03 Sep 2004 08:58:11 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/stoc/2004},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/soda/2003,
  title     = {Proceedings of the Fourteenth Annual {ACM-SIAM} Symposium on Discrete
               Algorithms, January 12-14, 2003, Baltimore, Maryland, {USA}},
  publisher = {{ACM/SIAM}},
  year      = {2003},
  url       = {http://dl.acm.org/citation.cfm?id=644108},
  isbn      = {0-89871-538-5},
  timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/soda/2003},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/cocoon/2002,
  editor    = {Oscar H. Ibarra and
               Louxin Zhang},
  title     = {Computing and Combinatorics, 8th Annual International Conference,
               {COCOON} 2002, Singapore, August 15-17, 2002, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {2387},
  publisher = {Springer},
  year      = {2002},
  url       = {https://doi.org/10.1007/3-540-45655-4},
  doi       = {10.1007/3-540-45655-4},
  isbn      = {3-540-43996-X},
  timestamp = {Fri, 26 May 2017 14:09:15 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/cocoon/2002},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/soda/2002,
  editor    = {David Eppstein},
  title     = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete
               Algorithms, January 6-8, 2002, San Francisco, CA, {USA}},
  publisher = {{ACM/SIAM}},
  year      = {2002},
  url       = {http://dl.acm.org/citation.cfm?id=545381},
  isbn      = {0-89871-513-X},
  timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/soda/2002},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/swat/2002,
  editor    = {Martti Penttonen and
               Erik Meineche Schmidt},
  title     = {Algorithm Theory - {SWAT} 2002, 8th Scandinavian Workshop on Algorithm
               Theory, Turku, Finland, July 3-5, 2002 Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {2368},
  publisher = {Springer},
  year      = {2002},
  url       = {https://doi.org/10.1007/3-540-45471-3},
  doi       = {10.1007/3-540-45471-3},
  isbn      = {3-540-43866-1},
  timestamp = {Fri, 26 May 2017 14:09:15 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/swat/2002},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/mobihoc/2001,
  title     = {Proceedings of the 2nd {ACM} Interational Symposium on Mobile Ad Hoc
               Networking and Computing, MobiHoc 2001, October 4-5, 2001, Long Beach,
               CA, {USA}},
  publisher = {{ACM}},
  year      = {2001},
  isbn      = {1-58113-428-2},
  timestamp = {Thu, 04 Dec 2003 14:50:23 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/mobihoc/2001},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/fmcad/2000,
  editor    = {Warren A. Hunt Jr. and
               Steven D. Johnson},
  title     = {Formal Methods in Computer-Aided Design, Third International Conference,
               {FMCAD} 2000, Austin, Texas, USA, November 1-3, 2000, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {1954},
  publisher = {Springer},
  year      = {2000},
  url       = {https://doi.org/10.1007/3-540-40922-X},
  doi       = {10.1007/3-540-40922-X},
  isbn      = {3-540-41219-0},
  timestamp = {Wed, 24 May 2017 15:40:42 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/fmcad/2000},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/focs/2000,
  title     = {41st Annual Symposium on Foundations of Computer Science, {FOCS} 2000,
               12-14 November 2000, Redondo Beach, California, {USA}},
  publisher = {{IEEE} Computer Society},
  year      = {2000},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=7164},
  isbn      = {0-7695-0850-2},
  timestamp = {Mon, 15 Dec 2014 18:48:44 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/focs/2000},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/soda/1999,
  editor    = {Robert Endre Tarjan and
               Tandy J. Warnow},
  title     = {Proceedings of the Tenth Annual {ACM-SIAM} Symposium on Discrete Algorithms,
               17-19 January 1999, Baltimore, Maryland},
  publisher = {{ACM/SIAM}},
  year      = {1999},
  url       = {http://dl.acm.org/citation.cfm?id=314500},
  isbn      = {0-89871-434-6},
  timestamp = {Mon, 14 Mar 2016 15:38:52 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/soda/1999},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/stoc/1999,
  editor    = {Jeffrey Scott Vitter and
               Lawrence L. Larmore and
               Frank Thomson Leighton},
  title     = {Proceedings of the Thirty-First Annual {ACM} Symposium on Theory of
               Computing, May 1-4, 1999, Atlanta, Georgia, {USA}},
  publisher = {{ACM}},
  year      = {1999},
  isbn      = {1-58113-067-8},
  timestamp = {Mon, 17 Oct 2011 15:55:10 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/stoc/1999},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/europar/1998,
  editor    = {David J. Pritchard and
               Jeff Reeve},
  title     = {Euro-Par '98 Parallel Processing, 4th International Euro-Par Conference,
               Southampton, UK, September 1-4, 1998, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {1470},
  publisher = {Springer},
  year      = {1998},
  url       = {https://doi.org/10.1007/BFb0057834},
  doi       = {10.1007/BFb0057834},
  isbn      = {3-540-64952-2},
  timestamp = {Tue, 23 May 2017 11:53:57 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/europar/1998},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/soda/1998,
  editor    = {Howard J. Karloff},
  title     = {Proceedings of the Ninth Annual {ACM-SIAM} Symposium on Discrete Algorithms,
               25-27 January 1998, San Francisco, California},
  publisher = {{ACM/SIAM}},
  year      = {1998},
  url       = {http://dl.acm.org/citation.cfm?id=314613},
  isbn      = {0-89871-410-9},
  timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/soda/1998},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/focs/1996,
  title     = {37th Annual Symposium on Foundations of Computer Science, {FOCS} '96,
               Burlington, Vermont, USA, 14-16 October, 1996},
  publisher = {{IEEE} Computer Society},
  year      = {1996},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=4141},
  isbn      = {0-8186-7594-2},
  timestamp = {Mon, 15 Dec 2014 18:48:44 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/focs/1996},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/soda/1996,
  editor    = {{\'{E}}va Tardos},
  title     = {Proceedings of the Seventh Annual {ACM-SIAM} Symposium on Discrete
               Algorithms, 28-30 January 1996, Atlanta, Georgia},
  publisher = {{ACM/SIAM}},
  year      = {1996},
  url       = {http://dl.acm.org/citation.cfm?id=313852},
  isbn      = {0-89871-366-8},
  timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/soda/1996},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/ipco/1995,
  editor    = {Egon Balas and
               Jens Clausen},
  title     = {Integer Programming and Combinatorial Optimization, 4th International
               {IPCO} Conference, Copenhagen, Denmark, May 29-31, 1995, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {920},
  publisher = {Springer},
  year      = {1995},
  url       = {https://doi.org/10.1007/3-540-59408-6},
  doi       = {10.1007/3-540-59408-6},
  isbn      = {3-540-59408-6},
  timestamp = {Sat, 20 May 2017 15:32:55 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/ipco/1995},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/soda/1995,
  editor    = {Kenneth L. Clarkson},
  title     = {Proceedings of the Sixth Annual {ACM-SIAM} Symposium on Discrete Algorithms,
               22-24 January 1995. San Francisco, California},
  publisher = {{ACM/SIAM}},
  year      = {1995},
  url       = {http://dl.acm.org/citation.cfm?id=313651},
  isbn      = {0-89871-349-8},
  timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/soda/1995},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/isaac/1994,
  editor    = {Ding{-}Zhu Du and
               Xiang{-}Sun Zhang},
  title     = {Algorithms and Computation, 5th International Symposium, {ISAAC} '94,
               Beijing, P. R. China, August 25-27, 1994, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {834},
  publisher = {Springer},
  year      = {1994},
  url       = {https://doi.org/10.1007/3-540-58325-4},
  doi       = {10.1007/3-540-58325-4},
  isbn      = {3-540-58325-4},
  timestamp = {Sat, 20 May 2017 15:32:55 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/isaac/1994},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/stoc/STOC26,
  editor    = {Frank Thomson Leighton and
               Michael T. Goodrich},
  title     = {Proceedings of the Twenty-Sixth Annual {ACM} Symposium on Theory of
               Computing, 23-25 May 1994, Montr{\'{e}}al, Qu{\'{e}}bec,
               Canada},
  publisher = {{ACM}},
  year      = {1994},
  isbn      = {0-89791-663-8},
  timestamp = {Mon, 17 Oct 2011 15:55:10 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/stoc/STOC26},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/focs/FOCS34,
  title     = {34th Annual Symposium on Foundations of Computer Science, Palo Alto,
               California, USA, 3-5 November 1993},
  publisher = {{IEEE} Computer Society},
  year      = {1993},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=2962},
  isbn      = {0-8186-4370-6},
  timestamp = {Mon, 15 Dec 2014 18:48:44 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/focs/FOCS34},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/ipco/1993,
  editor    = {Giovanni Rinaldi and
               Laurence A. Wolsey},
  title     = {Proceedings of the 3rd Integer Programming and Combinatorial Optimization
               Conference, Erice, Italy, April 29 - May 1, 1993},
  publisher = {{CIACO}},
  year      = {1993},
  timestamp = {Wed, 09 Oct 2002 11:26:33 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/ipco/1993},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/soda/1993,
  editor    = {Vijaya Ramachandran},
  title     = {Proceedings of the Fourth Annual {ACM/SIGACT-SIAM} Symposium on Discrete
               Algorithms, 25-27 January 1993, Austin, Texas},
  publisher = {{ACM/SIAM}},
  year      = {1993},
  url       = {http://dl.acm.org/citation.cfm?id=313559},
  isbn      = {0-89791-562-3},
  timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/soda/1993},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/focs/FOCS32,
  title     = {32nd Annual Symposium on Foundations of Computer Science, San Juan,
               Puerto Rico, 1-4 October 1991},
  publisher = {{IEEE} Computer Society},
  year      = {1991},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=379},
  isbn      = {0-8186-2445-0},
  timestamp = {Mon, 15 Dec 2014 18:48:44 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/focs/FOCS32},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/stoc/STOC23,
  editor    = {Cris Koutsougeras and
               Jeffrey Scott Vitter},
  title     = {Proceedings of the 23rd Annual {ACM} Symposium on Theory of Computing,
               May 5-8, 1991, New Orleans, Louisiana, {USA}},
  publisher = {{ACM}},
  year      = {1991},
  isbn      = {0-89791-397-3},
  timestamp = {Mon, 17 Oct 2011 15:55:10 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/stoc/STOC23},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/soda/1990,
  editor    = {David S. Johnson},
  title     = {Proceedings of the First Annual {ACM-SIAM} Symposium on Discrete Algorithms,
               22-24 January 1990, San Francisco, California},
  publisher = {{SIAM}},
  year      = {1990},
  url       = {http://dl.acm.org/citation.cfm?id=320176},
  isbn      = {0-89871-251-3},
  timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/soda/1990},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/focs/FOCS30,
  title     = {30th Annual Symposium on Foundations of Computer Science, Research
               Triangle Park, North Carolina, USA, 30 October - 1 November 1989},
  publisher = {{IEEE} Computer Society},
  year      = {1989},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=260},
  isbn      = {0-8186-1982-1},
  timestamp = {Mon, 15 Dec 2014 18:48:45 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/focs/FOCS30},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/stoc/STOC20,
  editor    = {Janos Simon},
  title     = {Proceedings of the 20th Annual {ACM} Symposium on Theory of Computing,
               May 2-4, 1988, Chicago, Illinois, {USA}},
  publisher = {{ACM}},
  year      = {1988},
  isbn      = {0-89791-264-0},
  timestamp = {Mon, 17 Oct 2011 15:55:10 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/stoc/STOC20},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/focs/FOCS26,
  title     = {26th Annual Symposium on Foundations of Computer Science, Portland,
               Oregon, USA, 21-23 October 1985},
  publisher = {{IEEE} Computer Society},
  year      = {1985},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=4568115},
  isbn      = {0-8186-0644-4},
  timestamp = {Wed, 17 Dec 2014 17:01:43 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/focs/FOCS26},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/icalp/1985,
  editor    = {Wilfried Brauer},
  title     = {Automata, Languages and Programming, 12th Colloquium, Nafplion, Greece,
               July 15-19, 1985, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {194},
  publisher = {Springer},
  year      = {1985},
  url       = {https://doi.org/10.1007/BFb0015725},
  doi       = {10.1007/BFb0015725},
  isbn      = {3-540-15650-X},
  timestamp = {Fri, 19 May 2017 12:26:21 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/icalp/1985},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/focs/FOCS25,
  title     = {25th Annual Symposium on Foundations of Computer Science, West Palm
               Beach, Florida, USA, 24-26 October 1984},
  publisher = {{IEEE} Computer Society},
  year      = {1984},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=5813},
  isbn      = {0-8186-0591-X},
  timestamp = {Mon, 15 Dec 2014 18:48:45 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/focs/FOCS25},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/stoc/STOC16,
  editor    = {Richard A. DeMillo},
  title     = {Proceedings of the 16th Annual {ACM} Symposium on Theory of Computing,
               April 30 - May 2, 1984, Washington, DC, {USA}},
  publisher = {{ACM}},
  year      = {1984},
  timestamp = {Mon, 17 Oct 2011 15:55:10 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/stoc/STOC16},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/focs/FOCS24,
  title     = {24th Annual Symposium on Foundations of Computer Science, Tucson,
               Arizona, USA, 7-9 November 1983},
  publisher = {{IEEE} Computer Society},
  year      = {1983},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=4568048},
  isbn      = {0-8186-0508-1},
  timestamp = {Mon, 15 Dec 2014 18:48:45 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/focs/FOCS24},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/stoc/STOC15,
  editor    = {David S. Johnson and
               Ronald Fagin and
               Michael L. Fredman and
               David Harel and
               Richard M. Karp and
               Nancy A. Lynch and
               Christos H. Papadimitriou and
               Ronald L. Rivest and
               Walter L. Ruzzo and
               Joel I. Seiferas},
  title     = {Proceedings of the 15th Annual {ACM} Symposium on Theory of Computing,
               25-27 April, 1983, Boston, Massachusetts, {USA}},
  publisher = {{ACM}},
  year      = {1983},
  timestamp = {Mon, 17 Oct 2011 15:55:10 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/stoc/STOC15},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/focs/FOCS23,
  title     = {23rd Annual Symposium on Foundations of Computer Science, Chicago,
               Illinois, USA, 3-5 November 1982},
  publisher = {{IEEE} Computer Society},
  year      = {1982},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=4568363},
  timestamp = {Mon, 15 Dec 2014 18:48:44 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/focs/FOCS23},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/focs/FOCS20,
  title     = {20th Annual Symposium on Foundations of Computer Science, San Juan,
               Puerto Rico, 29-31 October 1979},
  publisher = {{IEEE} Computer Society},
  year      = {1979},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=4567990},
  timestamp = {Mon, 15 Dec 2014 18:48:44 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/focs/FOCS20},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/stoc/STOC10,
  editor    = {Richard J. Lipton and
               Walter A. Burkhard and
               Walter J. Savitch and
               Emily P. Friedman and
               Alfred V. Aho},
  title     = {Proceedings of the 10th Annual {ACM} Symposium on Theory of Computing,
               May 1-3, 1978, San Diego, California, {USA}},
  publisher = {{ACM}},
  year      = {1978},
  timestamp = {Mon, 17 Oct 2011 15:55:10 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/stoc/STOC10},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/focs/FOCS17,
  title     = {17th Annual Symposium on Foundations of Computer Science, Houston,
               Texas, USA, 25-27 October 1976},
  publisher = {{IEEE} Computer Society},
  year      = {1976},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=4567877},
  timestamp = {Mon, 15 Dec 2014 18:48:44 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/focs/FOCS17},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
maintained by Schloss Dagstuhl LZI at University of Trier