Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "toc:db/conf/dimacs/dimacs12.bht:"
download as .bib file
@proceedings{DBLP:conf/dimacs/dimacs12,
editor = {David S. Johnson and
Catherine C. McGeoch},
title = {Network Flows And Matching, Proceedings of a {DIMACS} Workshop, New
Brunswick, New Jersey, USA, October 14-16, 1991},
series = {{DIMACS} Series in Discrete Mathematics and Theoretical Computer Science},
volume = {12},
publisher = {{DIMACS/AMS}},
year = {1993},
url = {https://doi.org/10.1090/dimacs/012},
doi = {10.1090/DIMACS/012},
isbn = {978-0-8218-6598-9},
timestamp = {Mon, 22 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/dimacs/dimacs12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dimacs/AlizadethG91,
author = {Farid Alizadeth and
Andrew V. Goldberg},
editor = {David S. Johnson and
Catherine C. McGeoch},
title = {Implementing the Push-Relabel Method for the Maximum Flow Problem
on a Connection Machine},
booktitle = {Network Flows And Matching, Proceedings of a {DIMACS} Workshop, New
Brunswick, New Jersey, USA, October 14-16, 1991},
series = {{DIMACS} Series in Discrete Mathematics and Theoretical Computer Science},
volume = {12},
pages = {65--95},
publisher = {{DIMACS/AMS}},
year = {1991},
url = {https://doi.org/10.1090/dimacs/012/04},
doi = {10.1090/DIMACS/012/04},
timestamp = {Mon, 22 May 2023 16:07:35 +0200},
biburl = {https://dblp.org/rec/conf/dimacs/AlizadethG91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dimacs/AndersonS91,
author = {Richard J. Anderson and
Jo{\~{a}}o Carlos Setubal},
editor = {David S. Johnson and
Catherine C. McGeoch},
title = {Goldberg's Algorithm for Maximum Flow in Perspective: {A} Computational
Study},
booktitle = {Network Flows And Matching, Proceedings of a {DIMACS} Workshop, New
Brunswick, New Jersey, USA, October 14-16, 1991},
series = {{DIMACS} Series in Discrete Mathematics and Theoretical Computer Science},
volume = {12},
pages = {1--18},
publisher = {{DIMACS/AMS}},
year = {1991},
url = {https://doi.org/10.1090/dimacs/012/01},
doi = {10.1090/DIMACS/012/01},
timestamp = {Thu, 09 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/dimacs/AndersonS91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dimacs/ApplegateC91,
author = {David L. Applegate and
William J. Cook},
editor = {David S. Johnson and
Catherine C. McGeoch},
title = {Solving Large-Scale Matching Problems},
booktitle = {Network Flows And Matching, Proceedings of a {DIMACS} Workshop, New
Brunswick, New Jersey, USA, October 14-16, 1991},
series = {{DIMACS} Series in Discrete Mathematics and Theoretical Computer Science},
volume = {12},
pages = {557--576},
publisher = {{DIMACS/AMS}},
year = {1991},
url = {https://doi.org/10.1090/dimacs/012/22},
doi = {10.1090/DIMACS/012/22},
timestamp = {Thu, 09 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/dimacs/ApplegateC91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dimacs/BadicsB91,
author = {Tam{\'{a}}s Badics and
Endre Boros},
editor = {David S. Johnson and
Catherine C. McGeoch},
title = {Implementing a Maximum Flow Algorithm: Experiments with Dynamic Trees},
booktitle = {Network Flows And Matching, Proceedings of a {DIMACS} Workshop, New
Brunswick, New Jersey, USA, October 14-16, 1991},
series = {{DIMACS} Series in Discrete Mathematics and Theoretical Computer Science},
volume = {12},
pages = {43--63},
publisher = {{DIMACS/AMS}},
year = {1991},
url = {https://doi.org/10.1090/dimacs/012/03},
doi = {10.1090/DIMACS/012/03},
timestamp = {Thu, 09 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/dimacs/BadicsB91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dimacs/BlandCJL91,
author = {Robert G. Bland and
Joseph Cheriyan and
David L. Jensen and
Laszlo Lad{\'{a}}nyi},
editor = {David S. Johnson and
Catherine C. McGeoch},
title = {An Empirical Study of Min Cost Flow Algorithms for the Minimum-Cost
Flow Problem},
booktitle = {Network Flows And Matching, Proceedings of a {DIMACS} Workshop, New
Brunswick, New Jersey, USA, October 14-16, 1991},
series = {{DIMACS} Series in Discrete Mathematics and Theoretical Computer Science},
volume = {12},
pages = {119--156},
publisher = {{DIMACS/AMS}},
year = {1991},
url = {https://doi.org/10.1090/dimacs/012/06},
doi = {10.1090/DIMACS/012/06},
timestamp = {Thu, 09 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/dimacs/BlandCJL91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dimacs/BorgerKK91,
author = {James M. Borger and
Sarah Kang and
Philip N. Klein},
editor = {David S. Johnson and
Catherine C. McGeoch},
title = {Approximating Concurrent Flow with Unit Demands and Capacities: An
Implementation},
booktitle = {Network Flows And Matching, Proceedings of a {DIMACS} Workshop, New
Brunswick, New Jersey, USA, October 14-16, 1991},
series = {{DIMACS} Series in Discrete Mathematics and Theoretical Computer Science},
volume = {12},
pages = {371--386},
publisher = {{DIMACS/AMS}},
year = {1991},
url = {https://doi.org/10.1090/dimacs/012/14},
doi = {10.1090/DIMACS/012/14},
timestamp = {Thu, 09 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/dimacs/BorgerKK91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dimacs/BradyJNRS91,
author = {Martin Lee Brady and
Kenneth K. Jung and
H. T. Nguyen and
Raghu Raghavan and
Ramesh Subramonian},
editor = {David S. Johnson and
Catherine C. McGeoch},
title = {The Assignment Problem on Parallel Architectures},
booktitle = {Network Flows And Matching, Proceedings of a {DIMACS} Workshop, New
Brunswick, New Jersey, USA, October 14-16, 1991},
series = {{DIMACS} Series in Discrete Mathematics and Theoretical Computer Science},
volume = {12},
pages = {469--517},
publisher = {{DIMACS/AMS}},
year = {1991},
url = {https://doi.org/10.1090/dimacs/012/19},
doi = {10.1090/DIMACS/012/19},
timestamp = {Thu, 09 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/dimacs/BradyJNRS91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dimacs/Castanon91,
author = {David A. Casta{\~{n}}{\'{o}}n},
editor = {David S. Johnson and
Catherine C. McGeoch},
title = {Reverse Auction Algorithms for Assignment Problems},
booktitle = {Network Flows And Matching, Proceedings of a {DIMACS} Workshop, New
Brunswick, New Jersey, USA, October 14-16, 1991},
series = {{DIMACS} Series in Discrete Mathematics and Theoretical Computer Science},
volume = {12},
pages = {407--429},
publisher = {{DIMACS/AMS}},
year = {1991},
url = {https://doi.org/10.1090/dimacs/012/16},
doi = {10.1090/DIMACS/012/16},
timestamp = {Thu, 09 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/dimacs/Castanon91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dimacs/Crocker91,
author = {Steven T. Crocker},
editor = {David S. Johnson and
Catherine C. McGeoch},
title = {An Experimental Comparison of Two Maximum Cardinality Matching Programs},
booktitle = {Network Flows And Matching, Proceedings of a {DIMACS} Workshop, New
Brunswick, New Jersey, USA, October 14-16, 1991},
series = {{DIMACS} Series in Discrete Mathematics and Theoretical Computer Science},
volume = {12},
pages = {519--537},
publisher = {{DIMACS/AMS}},
year = {1991},
url = {https://doi.org/10.1090/dimacs/012/20},
doi = {10.1090/DIMACS/012/20},
timestamp = {Thu, 09 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/dimacs/Crocker91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dimacs/FujishigeINT91,
author = {Satoru Fujishige and
Kazuo Iwano and
J. Nakano and
Shu Tezuka},
editor = {David S. Johnson and
Catherine C. McGeoch},
title = {A Speculative Contraction Method for Minimum Cost Flows: Toward a
Practical Algorithm},
booktitle = {Network Flows And Matching, Proceedings of a {DIMACS} Workshop, New
Brunswick, New Jersey, USA, October 14-16, 1991},
series = {{DIMACS} Series in Discrete Mathematics and Theoretical Computer Science},
volume = {12},
pages = {219--245},
publisher = {{DIMACS/AMS}},
year = {1991},
url = {https://doi.org/10.1090/dimacs/012/09},
doi = {10.1090/DIMACS/012/09},
timestamp = {Thu, 09 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/dimacs/FujishigeINT91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dimacs/GoldbergK91,
author = {Andrew V. Goldberg and
Michael Kharitonov},
editor = {David S. Johnson and
Catherine C. McGeoch},
title = {On Implementing Scaling Push-Relabel Algorithms for the Minimum-Cost
Flow Problem},
booktitle = {Network Flows And Matching, Proceedings of a {DIMACS} Workshop, New
Brunswick, New Jersey, USA, October 14-16, 1991},
series = {{DIMACS} Series in Discrete Mathematics and Theoretical Computer Science},
volume = {12},
pages = {157--198},
publisher = {{DIMACS/AMS}},
year = {1991},
url = {https://doi.org/10.1090/dimacs/012/07},
doi = {10.1090/DIMACS/012/07},
timestamp = {Thu, 09 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/dimacs/GoldbergK91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dimacs/HaoK91,
author = {Jack Jianxiu Hao and
George Kocur},
editor = {David S. Johnson and
Catherine C. McGeoch},
title = {An Implementation of a Shortest Augmenting Path Algorithm for the
Assignment Problem},
booktitle = {Network Flows And Matching, Proceedings of a {DIMACS} Workshop, New
Brunswick, New Jersey, USA, October 14-16, 1991},
series = {{DIMACS} Series in Discrete Mathematics and Theoretical Computer Science},
volume = {12},
pages = {453--468},
publisher = {{DIMACS/AMS}},
year = {1991},
url = {https://doi.org/10.1090/dimacs/012/18},
doi = {10.1090/DIMACS/012/18},
timestamp = {Thu, 09 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/dimacs/HaoK91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dimacs/Johnson91,
author = {David S. Johnson},
editor = {David S. Johnson and
Catherine C. McGeoch},
title = {Appendix {B:} Panel Discussion Highlights},
booktitle = {Network Flows And Matching, Proceedings of a {DIMACS} Workshop, New
Brunswick, New Jersey, USA, October 14-16, 1991},
series = {{DIMACS} Series in Discrete Mathematics and Theoretical Computer Science},
volume = {12},
pages = {583--592},
publisher = {{DIMACS/AMS}},
year = {1991},
url = {https://doi.org/10.1090/dimacs/012/24},
doi = {10.1090/DIMACS/012/24},
timestamp = {Thu, 09 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/dimacs/Johnson91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dimacs/JohnsonM91,
author = {David S. Johnson and
Catherine C. McGeoch},
editor = {David S. Johnson and
Catherine C. McGeoch},
title = {Preface},
booktitle = {Network Flows And Matching, Proceedings of a {DIMACS} Workshop, New
Brunswick, New Jersey, USA, October 14-16, 1991},
series = {{DIMACS} Series in Discrete Mathematics and Theoretical Computer Science},
volume = {12},
pages = {xi},
publisher = {{DIMACS/AMS}},
year = {1991},
timestamp = {Fri, 15 Jan 2016 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/dimacs/JohnsonM91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dimacs/JoshiGV91,
author = {Anil Joshi and
Arthur S. Goldstein and
Pravin M. Vaidya},
editor = {David S. Johnson and
Catherine C. McGeoch},
title = {A Fast Implementation of a Path-Following Algorithm for Maximizing
a Linear Function over a Network Polytope},
booktitle = {Network Flows And Matching, Proceedings of a {DIMACS} Workshop, New
Brunswick, New Jersey, USA, October 14-16, 1991},
series = {{DIMACS} Series in Discrete Mathematics and Theoretical Computer Science},
volume = {12},
pages = {267--298},
publisher = {{DIMACS/AMS}},
year = {1991},
url = {https://doi.org/10.1090/dimacs/012/11},
doi = {10.1090/DIMACS/012/11},
timestamp = {Thu, 09 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/dimacs/JoshiGV91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dimacs/LeongSS91,
author = {Tishya Leong and
Peter W. Shor and
Clifford Stein},
editor = {David S. Johnson and
Catherine C. McGeoch},
title = {Implementation of a Combinatorial Multicommodity Flow Algorithm},
booktitle = {Network Flows And Matching, Proceedings of a {DIMACS} Workshop, New
Brunswick, New Jersey, USA, October 14-16, 1991},
series = {{DIMACS} Series in Discrete Mathematics and Theoretical Computer Science},
volume = {12},
pages = {387--405},
publisher = {{DIMACS/AMS}},
year = {1991},
url = {https://doi.org/10.1090/dimacs/012/15},
doi = {10.1090/DIMACS/012/15},
timestamp = {Thu, 09 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/dimacs/LeongSS91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dimacs/Maros91,
author = {Istv{\'{a}}n Maros},
editor = {David S. Johnson and
Catherine C. McGeoch},
title = {Performance Evaluation of the {MINET} Minimum Cost Netflow Solver},
booktitle = {Network Flows And Matching, Proceedings of a {DIMACS} Workshop, New
Brunswick, New Jersey, USA, October 14-16, 1991},
series = {{DIMACS} Series in Discrete Mathematics and Theoretical Computer Science},
volume = {12},
pages = {199--217},
publisher = {{DIMACS/AMS}},
year = {1991},
url = {https://doi.org/10.1090/dimacs/012/08},
doi = {10.1090/DIMACS/012/08},
timestamp = {Thu, 09 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/dimacs/Maros91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dimacs/MattinglyR91,
author = {R. Bruce Mattingly and
Nathan P. Ritchey},
editor = {David S. Johnson and
Catherine C. McGeoch},
title = {Implementing on {O(/NM)} Cardinality Matching Algorithm},
booktitle = {Network Flows And Matching, Proceedings of a {DIMACS} Workshop, New
Brunswick, New Jersey, USA, October 14-16, 1991},
series = {{DIMACS} Series in Discrete Mathematics and Theoretical Computer Science},
volume = {12},
pages = {539--556},
publisher = {{DIMACS/AMS}},
year = {1991},
url = {https://doi.org/10.1090/dimacs/012/21},
doi = {10.1090/DIMACS/012/21},
timestamp = {Thu, 09 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/dimacs/MattinglyR91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dimacs/McCormickL91,
author = {S. Thomas McCormick and
Li Liu},
editor = {David S. Johnson and
Catherine C. McGeoch},
title = {An Experimental Implementation of the Dual Cancel and Tighten Algorithm
for Minimum-Cost Network Flow},
booktitle = {Network Flows And Matching, Proceedings of a {DIMACS} Workshop, New
Brunswick, New Jersey, USA, October 14-16, 1991},
series = {{DIMACS} Series in Discrete Mathematics and Theoretical Computer Science},
volume = {12},
pages = {247--266},
publisher = {{DIMACS/AMS}},
year = {1991},
url = {https://doi.org/10.1090/dimacs/012/10},
doi = {10.1090/DIMACS/012/10},
timestamp = {Thu, 09 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/dimacs/McCormickL91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dimacs/McGeoch91,
author = {Catherine C. McGeoch},
editor = {David S. Johnson and
Catherine C. McGeoch},
title = {Appendix {A:} Electronically Available Materials},
booktitle = {Network Flows And Matching, Proceedings of a {DIMACS} Workshop, New
Brunswick, New Jersey, USA, October 14-16, 1991},
series = {{DIMACS} Series in Discrete Mathematics and Theoretical Computer Science},
volume = {12},
pages = {577--582},
publisher = {{DIMACS/AMS}},
year = {1991},
url = {https://doi.org/10.1090/dimacs/012/23},
doi = {10.1090/DIMACS/012/23},
timestamp = {Thu, 09 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/dimacs/McGeoch91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dimacs/NeilsenZ91,
author = {S{\o}ren S. Nielsen and
Stavros A. Zenios},
editor = {David S. Johnson and
Catherine C. McGeoch},
title = {On the Massively Parallel Solution of Linear Network Flow Problems},
booktitle = {Network Flows And Matching, Proceedings of a {DIMACS} Workshop, New
Brunswick, New Jersey, USA, October 14-16, 1991},
series = {{DIMACS} Series in Discrete Mathematics and Theoretical Computer Science},
volume = {12},
pages = {349--369},
publisher = {{DIMACS/AMS}},
year = {1991},
url = {https://doi.org/10.1090/dimacs/012/13},
doi = {10.1090/DIMACS/012/13},
timestamp = {Thu, 09 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/dimacs/NeilsenZ91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dimacs/NguyenV91,
author = {Q. C. Nguyen and
Venkat Venkateswaran},
editor = {David S. Johnson and
Catherine C. McGeoch},
title = {Implementations of the Goldberg-Tarjan Maximum Flow Algorithm},
booktitle = {Network Flows And Matching, Proceedings of a {DIMACS} Workshop, New
Brunswick, New Jersey, USA, October 14-16, 1991},
series = {{DIMACS} Series in Discrete Mathematics and Theoretical Computer Science},
volume = {12},
pages = {19--41},
publisher = {{DIMACS/AMS}},
year = {1991},
url = {https://doi.org/10.1090/dimacs/012/02},
doi = {10.1090/DIMACS/012/02},
timestamp = {Thu, 09 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/dimacs/NguyenV91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dimacs/RamakrishnanKK91,
author = {K. G. Ramakrishnan and
Narendra Karmarkar and
Anil P. Kamath},
editor = {David S. Johnson and
Catherine C. McGeoch},
title = {An Approximate Dual Projective Algorithm for Solving Assignment Problems},
booktitle = {Network Flows And Matching, Proceedings of a {DIMACS} Workshop, New
Brunswick, New Jersey, USA, October 14-16, 1991},
series = {{DIMACS} Series in Discrete Mathematics and Theoretical Computer Science},
volume = {12},
pages = {431--451},
publisher = {{DIMACS/AMS}},
year = {1991},
url = {https://doi.org/10.1090/dimacs/012/17},
doi = {10.1090/DIMACS/012/17},
timestamp = {Thu, 09 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/dimacs/RamakrishnanKK91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dimacs/ResendeV91,
author = {Mauricio G. C. Resende and
Geraldo Veiga},
editor = {David S. Johnson and
Catherine C. McGeoch},
title = {An Efficient Implementation of a Network Interior Point Method},
booktitle = {Network Flows And Matching, Proceedings of a {DIMACS} Workshop, New
Brunswick, New Jersey, USA, October 14-16, 1991},
series = {{DIMACS} Series in Discrete Mathematics and Theoretical Computer Science},
volume = {12},
pages = {299--348},
publisher = {{DIMACS/AMS}},
year = {1991},
url = {https://doi.org/10.1090/dimacs/012/12},
doi = {10.1090/DIMACS/012/12},
timestamp = {Thu, 09 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/dimacs/ResendeV91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dimacs/ShannonMJ91,
author = {Gregory E. Shannon and
John MacCuish and
Elisabeth Johnson},
editor = {David S. Johnson and
Catherine C. McGeoch},
title = {A Case Study in Algorithm Animation: Maximum Flow Algorithms},
booktitle = {Network Flows And Matching, Proceedings of a {DIMACS} Workshop, New
Brunswick, New Jersey, USA, October 14-16, 1991},
series = {{DIMACS} Series in Discrete Mathematics and Theoretical Computer Science},
volume = {12},
pages = {97--118},
publisher = {{DIMACS/AMS}},
year = {1991},
url = {https://doi.org/10.1090/dimacs/012/05},
doi = {10.1090/DIMACS/012/05},
timestamp = {Thu, 09 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/dimacs/ShannonMJ91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dimacs/X91f,
editor = {David S. Johnson and
Catherine C. McGeoch},
title = {Foreword},
booktitle = {Network Flows And Matching, Proceedings of a {DIMACS} Workshop, New
Brunswick, New Jersey, USA, October 14-16, 1991},
series = {{DIMACS} Series in Discrete Mathematics and Theoretical Computer Science},
volume = {12},
pages = {ix},
publisher = {{DIMACS/AMS}},
year = {1991},
timestamp = {Fri, 15 Jan 2016 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/dimacs/X91f.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
retrieved on 2024-04-25 09:09 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
