default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "toc:db/journals/siamdm/siamdm10.bht:"
download as .bib file
@article{DBLP:journals/siamdm/AdamsS97,
author = {Michael J. Adams and
Bryan L. Shader},
title = {A Construction for (\emph{t, m, s})-nets in Base \emph{q}},
journal = {{SIAM} J. Discret. Math.},
volume = {10},
number = {3},
pages = {460--468},
year = {1997},
url = {https://doi.org/10.1137/S0895480195295975},
doi = {10.1137/S0895480195295975},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/AdamsS97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/AndrewsCS97,
author = {George E. Andrews and
Davide Crippa and
Klaus Simon},
title = {\emph{q}-Series Arising From The Study of Random Graphs},
journal = {{SIAM} J. Discret. Math.},
volume = {10},
number = {1},
pages = {41--56},
year = {1997},
url = {https://doi.org/10.1137/S0895480194262497},
doi = {10.1137/S0895480194262497},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/AndrewsCS97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/BaiouM97,
author = {Mourad Ba{\"{\i}}ou and
Ali Ridha Mahjoub},
title = {Steiner 2-Edge Connected Subgraph Polytopes on Series-Parallel Graphs},
journal = {{SIAM} J. Discret. Math.},
volume = {10},
number = {3},
pages = {505--514},
year = {1997},
url = {https://doi.org/10.1137/S0895480193259813},
doi = {10.1137/S0895480193259813},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/BaiouM97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/BertramH97,
author = {Edward A. Bertram and
Peter Hor{\'{a}}k},
title = {Decomposing 4-Regular Graphs into Triangle-Free 2-Factors},
journal = {{SIAM} J. Discret. Math.},
volume = {10},
number = {2},
pages = {309--317},
year = {1997},
url = {https://doi.org/10.1137/S089548019427144X},
doi = {10.1137/S089548019427144X},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/BertramH97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/BollobasB97,
author = {B{\'{e}}la Bollob{\'{a}}s and
Graham R. Brightwell},
title = {The Structure of Random Graph Orders},
journal = {{SIAM} J. Discret. Math.},
volume = {10},
number = {2},
pages = {318--335},
year = {1997},
url = {https://doi.org/10.1137/S0895480194281215},
doi = {10.1137/S0895480194281215},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/BollobasB97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/Bouchet97,
author = {Andr{\'{e}} Bouchet},
title = {Multimatroids I. Coverings by Independent Sets},
journal = {{SIAM} J. Discret. Math.},
volume = {10},
number = {4},
pages = {626--646},
year = {1997},
url = {https://doi.org/10.1137/S0895480193242591},
doi = {10.1137/S0895480193242591},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/Bouchet97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/BrandstadtCD97,
author = {Andreas Brandst{\"{a}}dt and
Victor Chepoi and
Feodor F. Dragan},
title = {Clique \emph{r}-Domination and Clique \emph{r}-Packing Problems on
Dually Chordal Graphs},
journal = {{SIAM} J. Discret. Math.},
volume = {10},
number = {1},
pages = {109--127},
year = {1997},
url = {https://doi.org/10.1137/S0895480194267853},
doi = {10.1137/S0895480194267853},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/BrandstadtCD97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/BrightwellT97,
author = {Graham R. Brightwell and
William T. Trotter},
title = {The Order Dimension of Planar Maps},
journal = {{SIAM} J. Discret. Math.},
volume = {10},
number = {4},
pages = {515--528},
year = {1997},
url = {https://doi.org/10.1137/S0895480192238561},
doi = {10.1137/S0895480192238561},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/BrightwellT97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/CalkinET97,
author = {Neil J. Calkin and
Paul Erd{\"{o}}s and
Craig A. Tovey},
title = {New Ramsey Bounds from Cyclic Graphs of Prime Order},
journal = {{SIAM} J. Discret. Math.},
volume = {10},
number = {3},
pages = {381--387},
year = {1997},
url = {https://doi.org/10.1137/S0895480196298378},
doi = {10.1137/S0895480196298378},
timestamp = {Wed, 07 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamdm/CalkinET97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/CharpinZ97,
author = {Pascale Charpin and
Victor A. Zinoviev},
title = {On Coset Weight Distributions of the 3-Error-Correcting BCH-Codes},
journal = {{SIAM} J. Discret. Math.},
volume = {10},
number = {1},
pages = {128--145},
year = {1997},
url = {https://doi.org/10.1137/S089548019529443X},
doi = {10.1137/S089548019529443X},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/CharpinZ97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/CorneilOS97,
author = {Derek G. Corneil and
Stephan Olariu and
Lorna Stewart},
title = {Asteroidal Triple-Free Graphs},
journal = {{SIAM} J. Discret. Math.},
volume = {10},
number = {3},
pages = {399--430},
year = {1997},
url = {https://doi.org/10.1137/S0895480193250125},
doi = {10.1137/S0895480193250125},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/CorneilOS97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/DrmotaS97,
author = {Michael Drmota and
Mich{\`{e}}le Soria},
title = {Images and Preimages in Random Mappings},
journal = {{SIAM} J. Discret. Math.},
volume = {10},
number = {2},
pages = {246--269},
year = {1997},
url = {https://doi.org/10.1137/S0895480194268421},
doi = {10.1137/S0895480194268421},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/DrmotaS97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/FangV97,
author = {Shao C. Fang and
Santosh S. Venkatesh},
title = {A Threshold Function for Harmonic Update},
journal = {{SIAM} J. Discret. Math.},
volume = {10},
number = {3},
pages = {482--498},
year = {1997},
url = {https://doi.org/10.1137/S0895480195283701},
doi = {10.1137/S0895480195283701},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/FangV97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/FishburnK97,
author = {Peter C. Fishburn and
Jerry S. Kelly},
title = {Super Arrovian Domains with Strict Preferences},
journal = {{SIAM} J. Discret. Math.},
volume = {10},
number = {1},
pages = {83--95},
year = {1997},
url = {https://doi.org/10.1137/S0895480194263508},
doi = {10.1137/S0895480194263508},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/FishburnK97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/FrankKS97,
author = {Andr{\'{a}}s Frank and
Alexander V. Karzanov and
Andr{\'{a}}s Seb{\"{o}}},
title = {On Integer Multiflow Maximization},
journal = {{SIAM} J. Discret. Math.},
volume = {10},
number = {1},
pages = {158--170},
year = {1997},
url = {https://doi.org/10.1137/S0895480195287723},
doi = {10.1137/S0895480195287723},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/FrankKS97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/Fujishige97,
author = {Satoru Fujishige},
title = {A Min-Max Theorem for Bisubmodular Polyhedra},
journal = {{SIAM} J. Discret. Math.},
volume = {10},
number = {2},
pages = {294--308},
year = {1997},
url = {https://doi.org/10.1137/S0895480194264344},
doi = {10.1137/S0895480194264344},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/Fujishige97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/GoldbergK97,
author = {Andrew V. Goldberg and
Robert Kennedy},
title = {Global Price Updates Help},
journal = {{SIAM} J. Discret. Math.},
volume = {10},
number = {4},
pages = {551--572},
year = {1997},
url = {https://doi.org/10.1137/S0895480194281185},
doi = {10.1137/S0895480194281185},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/GoldbergK97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/GuptaI97,
author = {Arvind Gupta and
Russell Impagliazzo},
title = {Bounding the Size of Planar Intertwines},
journal = {{SIAM} J. Discret. Math.},
volume = {10},
number = {3},
pages = {337--358},
year = {1997},
url = {https://doi.org/10.1137/S0895480192239931},
doi = {10.1137/S0895480192239931},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/GuptaI97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/HamelS97,
author = {Ang{\`{e}}le M. Hamel and
Michael Anthony Steel},
title = {The Length of a Leaf Coloration on a Random Binary Tree},
journal = {{SIAM} J. Discret. Math.},
volume = {10},
number = {3},
pages = {359--372},
year = {1997},
url = {https://doi.org/10.1137/S0895480194271591},
doi = {10.1137/S0895480194271591},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamdm/HamelS97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/HeathP97,
author = {Lenwood S. Heath and
Sriram V. Pemmaraju},
title = {Stack and Queue Layouts of Posets},
journal = {{SIAM} J. Discret. Math.},
volume = {10},
number = {4},
pages = {599--625},
year = {1997},
url = {https://doi.org/10.1137/S0895480193252380},
doi = {10.1137/S0895480193252380},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/HeathP97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/Hefner97,
author = {Andreas Hefner},
title = {A Min-Max Theorem for a Constrained Matching Problem},
journal = {{SIAM} J. Discret. Math.},
volume = {10},
number = {2},
pages = {180--189},
year = {1997},
url = {https://doi.org/10.1137/S0895480195280538},
doi = {10.1137/S0895480195280538},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/Hefner97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/HolzmanMP97,
author = {Ron Holzman and
Yosi Marcus and
David Peleg},
title = {Load Balancing in Quorum Systems},
journal = {{SIAM} J. Discret. Math.},
volume = {10},
number = {2},
pages = {223--245},
year = {1997},
url = {https://doi.org/10.1137/S0895480193260303},
doi = {10.1137/S0895480193260303},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/HolzmanMP97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/JuvanM97,
author = {Martin Juvan and
Bojan Mohar},
title = {Obstructions For 2-M{\"{o}}bius Band Embedding Extension Problem},
journal = {{SIAM} J. Discret. Math.},
volume = {10},
number = {1},
pages = {57--72},
year = {1997},
url = {https://doi.org/10.1137/S0895480194264150},
doi = {10.1137/S0895480194264150},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/JuvanM97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/Kahale97,
author = {Nabil Kahal{\'{e}}},
title = {Isoperimetric Inequalities and Eigenvalues},
journal = {{SIAM} J. Discret. Math.},
volume = {10},
number = {1},
pages = {30--40},
year = {1997},
url = {https://doi.org/10.1137/S0895480193259825},
doi = {10.1137/S0895480193259825},
timestamp = {Wed, 31 Mar 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/Kahale97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/Kierstead97,
author = {Hal A. Kierstead},
title = {Classes of Graphs that Are Not Vertex Ramsey},
journal = {{SIAM} J. Discret. Math.},
volume = {10},
number = {3},
pages = {373--380},
year = {1997},
url = {https://doi.org/10.1137/S0895480194264769},
doi = {10.1137/S0895480194264769},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/Kierstead97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/KushilevitzM97,
author = {Eyal Kushilevitz and
Yishay Mansour},
title = {Randomness in Private Computations},
journal = {{SIAM} J. Discret. Math.},
volume = {10},
number = {4},
pages = {647--661},
year = {1997},
url = {https://doi.org/10.1137/S0895480196306130},
doi = {10.1137/S0895480196306130},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/KushilevitzM97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/Linusson97,
author = {Svante Linusson},
title = {Partitions with Restricted Block Sizes, M{\"{o}}bius Functions,
and the \emph{k}-of-Each Problem},
journal = {{SIAM} J. Discret. Math.},
volume = {10},
number = {1},
pages = {18--29},
year = {1997},
url = {https://doi.org/10.1137/S089548019426855X},
doi = {10.1137/S089548019426855X},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/Linusson97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/Mitchell97,
author = {Chris J. Mitchell},
title = {De Bruijn Sequences and Perfect Factors},
journal = {{SIAM} J. Discret. Math.},
volume = {10},
number = {2},
pages = {270--281},
year = {1997},
url = {https://doi.org/10.1137/S0895480195290911},
doi = {10.1137/S0895480195290911},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/Mitchell97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/NagamochiNI97,
author = {Hiroshi Nagamochi and
Kazuhiro Nishimura and
Toshihide Ibaraki},
title = {Computing All Small Cuts in an Undirected Network},
journal = {{SIAM} J. Discret. Math.},
volume = {10},
number = {3},
pages = {469--481},
year = {1997},
url = {https://doi.org/10.1137/S0895480194271323},
doi = {10.1137/S0895480194271323},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/NagamochiNI97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/PeerS97,
author = {Itsik Pe'er and
Ron Shamir},
title = {Realizing Interval Graphs with Size and Distance Constraints},
journal = {{SIAM} J. Discret. Math.},
volume = {10},
number = {4},
pages = {662--687},
year = {1997},
url = {https://doi.org/10.1137/S0895480196306373},
doi = {10.1137/S0895480196306373},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/PeerS97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/PhillipsSW97,
author = {Cynthia A. Phillips and
Clifford Stein and
Joel Wein},
title = {Task Scheduling in Networks},
journal = {{SIAM} J. Discret. Math.},
volume = {10},
number = {4},
pages = {573--598},
year = {1997},
url = {https://doi.org/10.1137/S0895480194279057},
doi = {10.1137/S0895480194279057},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/PhillipsSW97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/ProvanC97,
author = {J. Scott Provan and
Manoj K. Chari},
title = {Counting Problems Associated With Steiner Trees In Graphs},
journal = {{SIAM} J. Discret. Math.},
volume = {10},
number = {3},
pages = {436--446},
year = {1997},
url = {https://doi.org/10.1137/S0895480194262862},
doi = {10.1137/S0895480194262862},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/ProvanC97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/Ramachandramurthi97,
author = {Siddharthan Ramachandramurthi},
title = {The Structure and Number of Obstructions to Treewidth},
journal = {{SIAM} J. Discret. Math.},
volume = {10},
number = {1},
pages = {146--157},
year = {1997},
url = {https://doi.org/10.1137/S0895480195280010},
doi = {10.1137/S0895480195280010},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/Ramachandramurthi97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/Ramras97,
author = {Mark Ramras},
title = {Congestion-free Optimal Routings of Hypercube Automorphisms},
journal = {{SIAM} J. Discret. Math.},
volume = {10},
number = {2},
pages = {201--208},
year = {1997},
url = {https://doi.org/10.1137/S0895480194275175},
doi = {10.1137/S0895480194275175},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/Ramras97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/RichmondM97,
author = {L. Bruce Richmond and
Donatella Merlini},
title = {Stirling Numbers for Complex Arguments},
journal = {{SIAM} J. Discret. Math.},
volume = {10},
number = {1},
pages = {73--82},
year = {1997},
url = {https://doi.org/10.1137/S0895480195284329},
doi = {10.1137/S0895480195284329},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/RichmondM97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/RubinsteinTW97,
author = {J. Hyam Rubinstein and
Doreen A. Thomas and
Nicholas C. Wormald},
title = {Steiner Trees for Terminals Constrained to Curves},
journal = {{SIAM} J. Discret. Math.},
volume = {10},
number = {1},
pages = {1--17},
year = {1997},
url = {https://doi.org/10.1137/S0895480192241190},
doi = {10.1137/S0895480192241190},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/RubinsteinTW97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/Sarangarajan97,
author = {Aravamuthan Sarangarajan},
title = {A Lower Bound for Adjacencies on the Traveling Salesman Polytope},
journal = {{SIAM} J. Discret. Math.},
volume = {10},
number = {3},
pages = {431--435},
year = {1997},
url = {https://doi.org/10.1137/S0895480195283798},
doi = {10.1137/S0895480195283798},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/Sarangarajan97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/Sendrier97,
author = {Nicolas Sendrier},
title = {On the Dimension of the Hull},
journal = {{SIAM} J. Discret. Math.},
volume = {10},
number = {2},
pages = {282--293},
year = {1997},
url = {https://doi.org/10.1137/S0895480195294027},
doi = {10.1137/S0895480195294027},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/Sendrier97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/Tassiulas97,
author = {Leandros Tassiulas},
title = {Worst Case Length of Nearest Neighbor Tours for the Euclidean Traveling
Salesman Problem},
journal = {{SIAM} J. Discret. Math.},
volume = {10},
number = {2},
pages = {171--179},
year = {1997},
url = {https://doi.org/10.1137/S0895480194278246},
doi = {10.1137/S0895480194278246},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/Tassiulas97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/TelleP97,
author = {Jan Arne Telle and
Andrzej Proskurowski},
title = {Algorithms for Vertex Partitioning Problems on Partial \emph{k}-Trees},
journal = {{SIAM} J. Discret. Math.},
volume = {10},
number = {4},
pages = {529--550},
year = {1997},
url = {https://doi.org/10.1137/S0895480194275825},
doi = {10.1137/S0895480194275825},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/TelleP97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/TillichZ97,
author = {Jean{-}Pierre Tillich and
Gilles Z{\'{e}}mor},
title = {Optimal Cycle Codes Constructed From Ramanujan Graphs},
journal = {{SIAM} J. Discret. Math.},
volume = {10},
number = {3},
pages = {447--459},
year = {1997},
url = {https://doi.org/10.1137/S0895480195292065},
doi = {10.1137/S0895480195292065},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/TillichZ97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/UrbaniakWZ97,
author = {Regina Urbaniak and
Robert Weismantel and
G{\"{u}}nter M. Ziegler},
title = {A Variant of the Buchberger Algorithm for Integer Programming},
journal = {{SIAM} J. Discret. Math.},
volume = {10},
number = {1},
pages = {96--108},
year = {1997},
url = {https://doi.org/10.1137/S0895480195281209},
doi = {10.1137/S0895480195281209},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/UrbaniakWZ97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/Weng97,
author = {J. F. Weng},
title = {Linear Steiner Trees for Infinite Spirals},
journal = {{SIAM} J. Discret. Math.},
volume = {10},
number = {3},
pages = {388--398},
year = {1997},
url = {https://doi.org/10.1137/S0895480194274030},
doi = {10.1137/S0895480194274030},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/Weng97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/Yen97,
author = {Lily Yen},
title = {A Combinatorial Proof for Stockhausen's Problem},
journal = {{SIAM} J. Discret. Math.},
volume = {10},
number = {3},
pages = {499--504},
year = {1997},
url = {https://doi.org/10.1137/S0895480195288741},
doi = {10.1137/S0895480195288741},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/Yen97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/YuCH97,
author = {Bo Yu and
Joseph Cheriyan and
Penny E. Haxell},
title = {Hypercubes and Multicommodity Flows},
journal = {{SIAM} J. Discret. Math.},
volume = {10},
number = {2},
pages = {190--200},
year = {1997},
url = {https://doi.org/10.1137/S089548019426560X},
doi = {10.1137/S089548019426560X},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/YuCH97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/YusterZ97,
author = {Raphael Yuster and
Uri Zwick},
title = {Finding Even Cycles Even Faster},
journal = {{SIAM} J. Discret. Math.},
volume = {10},
number = {2},
pages = {209--222},
year = {1997},
url = {https://doi.org/10.1137/S0895480194274133},
doi = {10.1137/S0895480194274133},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/YusterZ97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
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 2025-01-20 15:13 CET 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:
