Search dblp for Publications

export results for "toc:db/journals/siamdm/siamdm12.bht:"

 download as .bib file

@article{DBLP:journals/siamdm/BafnaBF99,
  author       = {Vineet Bafna and
                  Piotr Berman and
                  Toshihiro Fujito},
  title        = {A 2-Approximation Algorithm for the Undirected Feedback Vertex Set
                  Problem},
  journal      = {{SIAM} J. Discret. Math.},
  volume       = {12},
  number       = {3},
  pages        = {289--297},
  year         = {1999},
  url          = {https://doi.org/10.1137/S0895480196305124},
  doi          = {10.1137/S0895480196305124},
  timestamp    = {Mon, 26 Oct 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/siamdm/BafnaBF99.bib},
  bibsource    = {dblp computer science bibliography, https://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. Discret. Math.},
  volume       = {12},
  number       = {2},
  pages        = {160--207},
  year         = {1999},
  url          = {https://doi.org/10.1137/S0895480197324700},
  doi          = {10.1137/S0895480197324700},
  timestamp    = {Sat, 25 Apr 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamdm/Bang-JensenGJS99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/BjornerW99,
  author       = {Anders Bj{\"{o}}rner and
                  Volkmar Welker},
  title        = {Complexes of Directed Graphs},
  journal      = {{SIAM} J. Discret. Math.},
  volume       = {12},
  number       = {4},
  pages        = {413--424},
  year         = {1999},
  url          = {https://doi.org/10.1137/S0895480198338724},
  doi          = {10.1137/S0895480198338724},
  timestamp    = {Sat, 25 Apr 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamdm/BjornerW99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/BolotashviliKG99,
  author       = {G. Bolotashvili and
                  Michail M. Kovalev and
                  Eberhard Girlich},
  title        = {New Facets of the Linear Ordering Polytope},
  journal      = {{SIAM} J. Discret. Math.},
  volume       = {12},
  number       = {3},
  pages        = {326--336},
  year         = {1999},
  url          = {https://doi.org/10.1137/S0895480196300145},
  doi          = {10.1137/S0895480196300145},
  timestamp    = {Sat, 25 Apr 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamdm/BolotashviliKG99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/BroersmaKKM99,
  author       = {Hajo Broersma and
                  Ton Kloks and
                  Dieter Kratsch and
                  Haiko M{\"{u}}ller},
  title        = {Independent Sets in Asteroidal Triple-Free Graphs},
  journal      = {{SIAM} J. Discret. Math.},
  volume       = {12},
  number       = {2},
  pages        = {276--287},
  year         = {1999},
  url          = {https://doi.org/10.1137/S0895480197326346},
  doi          = {10.1137/S0895480197326346},
  timestamp    = {Sun, 12 Nov 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/siamdm/BroersmaKKM99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/Caprara99,
  author       = {Alberto Caprara},
  title        = {Sorting Permutations by Reversals and Eulerian Cycle Decompositions},
  journal      = {{SIAM} J. Discret. Math.},
  volume       = {12},
  number       = {1},
  pages        = {91--110},
  year         = {1999},
  url          = {https://doi.org/10.1137/S089548019731994X},
  doi          = {10.1137/S089548019731994X},
  timestamp    = {Sat, 25 Apr 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamdm/Caprara99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/ChenK99,
  author       = {Jianer Chen and
                  Saroja P. Kanchi},
  title        = {Graph Ear Decompositions and Graph Embeddings},
  journal      = {{SIAM} J. Discret. Math.},
  volume       = {12},
  number       = {2},
  pages        = {229--242},
  year         = {1999},
  url          = {https://doi.org/10.1137/S0895480196304234},
  doi          = {10.1137/S0895480196304234},
  timestamp    = {Sat, 25 Apr 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamdm/ChenK99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/CzygrinowPR99,
  author       = {Andrzej Czygrinow and
                  Svatopluk Poljak and
                  Vojtech R{\"{o}}dl},
  title        = {Constructive Quasi-Ramsey Numbers and Tournament Ranking},
  journal      = {{SIAM} J. Discret. Math.},
  volume       = {12},
  number       = {1},
  pages        = {48--63},
  year         = {1999},
  url          = {https://doi.org/10.1137/S0895480197318301},
  doi          = {10.1137/S0895480197318301},
  timestamp    = {Sat, 25 Apr 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamdm/CzygrinowPR99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/Dasgupta99,
  author       = {Samit Dasgupta},
  title        = {On the Size of Minimum Super Arrovian Domains},
  journal      = {{SIAM} J. Discret. Math.},
  volume       = {12},
  number       = {4},
  pages        = {524--534},
  year         = {1999},
  url          = {https://doi.org/10.1137/S0895480198332521},
  doi          = {10.1137/S0895480198332521},
  timestamp    = {Sat, 25 Apr 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamdm/Dasgupta99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/DraganNB99,
  author       = {Feodor F. Dragan and
                  Falk Nicolai and
                  Andreas Brandst{\"{a}}dt},
  title        = {Convexity and HHD-Free Graphs},
  journal      = {{SIAM} J. Discret. Math.},
  volume       = {12},
  number       = {1},
  pages        = {119--135},
  year         = {1999},
  url          = {https://doi.org/10.1137/S0895480195321718},
  doi          = {10.1137/S0895480195321718},
  timestamp    = {Sat, 25 Apr 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamdm/DraganNB99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/DuHX99,
  author       = {Ding{-}Zhu Du and
                  Frank K. Hwang and
                  Guoliang Xue},
  title        = {Interconnecting Highways},
  journal      = {{SIAM} J. Discret. Math.},
  volume       = {12},
  number       = {2},
  pages        = {252--261},
  year         = {1999},
  url          = {https://doi.org/10.1137/S089548019732653X},
  doi          = {10.1137/S089548019732653X},
  timestamp    = {Sat, 25 Apr 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamdm/DuHX99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/EnomotoM99,
  author       = {Hikoe Enomoto and
                  Miki Shimabara Miyauchi},
  title        = {Embedding Graphs into a Three Page Book with \emph{O}(\emph{m} log
                  \emph{n}) Crossings of Edges over the Spine},
  journal      = {{SIAM} J. Discret. Math.},
  volume       = {12},
  number       = {3},
  pages        = {337--341},
  year         = {1999},
  url          = {https://doi.org/10.1137/S0895480195280319},
  doi          = {10.1137/S0895480195280319},
  timestamp    = {Sat, 25 Apr 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamdm/EnomotoM99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/FelsnerR99,
  author       = {Stefan Felsner and
                  Klaus Reuter},
  title        = {The Linear Extension Diameter of a Poset},
  journal      = {{SIAM} J. Discret. Math.},
  volume       = {12},
  number       = {3},
  pages        = {360--373},
  year         = {1999},
  url          = {https://doi.org/10.1137/S0895480197326139},
  doi          = {10.1137/S0895480197326139},
  timestamp    = {Sat, 25 Apr 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamdm/FelsnerR99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/FlajoletP99,
  author       = {Philippe Flajolet and
                  Helmut Prodinger},
  title        = {On Stirling Numbers for Complex Arguments and Hankel Contours},
  journal      = {{SIAM} J. Discret. Math.},
  volume       = {12},
  number       = {2},
  pages        = {155--159},
  year         = {1999},
  url          = {https://doi.org/10.1137/S0895480198332594},
  doi          = {10.1137/S0895480198332594},
  timestamp    = {Sat, 25 Apr 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamdm/FlajoletP99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/FriezeKT99,
  author       = {Alan M. Frieze and
                  Michal Karonski and
                  Lubos Thoma},
  title        = {On Perfect Matchings and Hamilton Cycles in Sums of Random Trees},
  journal      = {{SIAM} J. Discret. Math.},
  volume       = {12},
  number       = {2},
  pages        = {208--216},
  year         = {1999},
  url          = {https://doi.org/10.1137/S0895480196313790},
  doi          = {10.1137/S0895480196313790},
  timestamp    = {Sat, 25 Apr 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamdm/FriezeKT99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/GaoW99,
  author       = {Zhicheng Gao and
                  Nicholas C. Wormald},
  title        = {The Size of the Largest Components in Random Planar Maps},
  journal      = {{SIAM} J. Discret. Math.},
  volume       = {12},
  number       = {2},
  pages        = {217--228},
  year         = {1999},
  url          = {https://doi.org/10.1137/S0895480195292053},
  doi          = {10.1137/S0895480195292053},
  timestamp    = {Sat, 25 Apr 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamdm/GaoW99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/GavoilleP99,
  author       = {Cyril Gavoille and
                  David Peleg},
  title        = {The Compactness of Interval Routing},
  journal      = {{SIAM} J. Discret. Math.},
  volume       = {12},
  number       = {4},
  pages        = {459--473},
  year         = {1999},
  url          = {https://doi.org/10.1137/S0895480197328631},
  doi          = {10.1137/S0895480197328631},
  timestamp    = {Sat, 25 Apr 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamdm/GavoilleP99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/Gittenberger99,
  author       = {Bernhard Gittenberger},
  title        = {On the Contour of Random Trees},
  journal      = {{SIAM} J. Discret. Math.},
  volume       = {12},
  number       = {4},
  pages        = {434--458},
  year         = {1999},
  url          = {https://doi.org/10.1137/S0895480195289928},
  doi          = {10.1137/S0895480195289928},
  timestamp    = {Mon, 15 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamdm/Gittenberger99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/GoldbergR99,
  author       = {Andrew V. Goldberg and
                  Satish Rao},
  title        = {Flows in Undirected Unit Capacity Networks},
  journal      = {{SIAM} J. Discret. Math.},
  volume       = {12},
  number       = {1},
  pages        = {1--5},
  year         = {1999},
  url          = {https://doi.org/10.1137/S089548019733103X},
  doi          = {10.1137/S089548019733103X},
  timestamp    = {Sat, 25 Apr 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamdm/GoldbergR99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/GyarfasKL99,
  author       = {Andr{\'{a}}s Gy{\'{a}}rf{\'{a}}s and
                  Zolt{\'{a}}n Kir{\'{a}}ly and
                  Jen{\"{o}} Lehel},
  title        = {On-Line 3-Chromatic Graphs I. Triangle-Free Graphs},
  journal      = {{SIAM} J. Discret. Math.},
  volume       = {12},
  number       = {3},
  pages        = {385--411},
  year         = {1999},
  url          = {https://doi.org/10.1137/S089548019631030X},
  doi          = {10.1137/S089548019631030X},
  timestamp    = {Sat, 25 Apr 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamdm/GyarfasKL99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/HagerK99,
  author       = {William W. Hager and
                  Yaroslav Krylyuk},
  title        = {Graph Partitioning and Continuous Quadratic Programming},
  journal      = {{SIAM} J. Discret. Math.},
  volume       = {12},
  number       = {4},
  pages        = {500--523},
  year         = {1999},
  url          = {https://doi.org/10.1137/S0895480199335829},
  doi          = {10.1137/S0895480199335829},
  timestamp    = {Sat, 25 Apr 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamdm/HagerK99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/HalldorssonIKT99,
  author       = {Magn{\'{u}}s M. Halld{\'{o}}rsson and
                  Kazuo Iwano and
                  Naoki Katoh and
                  Takeshi Tokuyama},
  title        = {Finding Subsets Maximizing Minimum Structures},
  journal      = {{SIAM} J. Discret. Math.},
  volume       = {12},
  number       = {3},
  pages        = {342--359},
  year         = {1999},
  url          = {https://doi.org/10.1137/S0895480196309791},
  doi          = {10.1137/S0895480196309791},
  timestamp    = {Sat, 30 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamdm/HalldorssonIKT99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/HeKL99,
  author       = {Xin He and
                  Ming{-}Yang Kao and
                  Hsueh{-}I Lu},
  title        = {Linear-Time Succinct Encodings of Planar Graphs via Canonical Orderings},
  journal      = {{SIAM} J. Discret. Math.},
  volume       = {12},
  number       = {3},
  pages        = {317--325},
  year         = {1999},
  url          = {https://doi.org/10.1137/S0895480197325031},
  doi          = {10.1137/S0895480197325031},
  timestamp    = {Sat, 25 Apr 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamdm/HeKL99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/ImrichKM99,
  author       = {Wilfried Imrich and
                  Sandi Klavzar and
                  Henry Martyn Mulder},
  title        = {Median Graphs and Triangle-Free Graphs},
  journal      = {{SIAM} J. Discret. Math.},
  volume       = {12},
  number       = {1},
  pages        = {111--118},
  year         = {1999},
  url          = {https://doi.org/10.1137/S0895480197323494},
  doi          = {10.1137/S0895480197323494},
  timestamp    = {Mon, 26 Jun 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamdm/ImrichKM99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/JanssenK99,
  author       = {Jeannette C. M. Janssen and
                  Kyriakos Kilakos},
  title        = {Bounded Stable Sets: Polytopes and Colorings},
  journal      = {{SIAM} J. Discret. Math.},
  volume       = {12},
  number       = {2},
  pages        = {262--275},
  year         = {1999},
  url          = {https://doi.org/10.1137/S089548019630978X},
  doi          = {10.1137/S089548019630978X},
  timestamp    = {Thu, 14 Oct 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamdm/JanssenK99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/JiangMSW99,
  author       = {Tao Jiang and
                  Dhruv Mubayi and
                  Aditya Shastri and
                  Douglas B. West},
  title        = {Edge-Bandwidth of Graphs},
  journal      = {{SIAM} J. Discret. Math.},
  volume       = {12},
  number       = {3},
  pages        = {307--316},
  year         = {1999},
  url          = {https://doi.org/10.1137/S0895480197330758},
  doi          = {10.1137/S0895480197330758},
  timestamp    = {Sat, 25 Apr 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamdm/JiangMSW99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/KaoT99,
  author       = {Ming{-}Yang Kao and
                  Stephen R. Tate},
  title        = {On-Line Difference Maximization},
  journal      = {{SIAM} J. Discret. Math.},
  volume       = {12},
  number       = {1},
  pages        = {78--90},
  year         = {1999},
  url          = {https://doi.org/10.1137/S0895480196307445},
  doi          = {10.1137/S0895480196307445},
  timestamp    = {Sat, 25 Apr 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamdm/KaoT99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/KratochvilT99,
  author       = {Jan Kratochv{\'{\i}}l and
                  Zsolt Tuza},
  title        = {Rankings of Directed Graphs},
  journal      = {{SIAM} J. Discret. Math.},
  volume       = {12},
  number       = {3},
  pages        = {374--384},
  year         = {1999},
  url          = {https://doi.org/10.1137/S0895480197330242},
  doi          = {10.1137/S0895480197330242},
  timestamp    = {Sat, 25 Apr 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamdm/KratochvilT99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/LaihonenL99,
  author       = {Tero Laihonen and
                  Simon Litsyn},
  title        = {New Bounds On Covering Radius as a Function of Dual Distance},
  journal      = {{SIAM} J. Discret. Math.},
  volume       = {12},
  number       = {2},
  pages        = {243--251},
  year         = {1999},
  url          = {https://doi.org/10.1137/S0895480197331703},
  doi          = {10.1137/S0895480197331703},
  timestamp    = {Mon, 15 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamdm/LaihonenL99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/LihLZ99,
  author       = {Ko{-}Wei Lih and
                  Daphne Der{-}Fen Liu and
                  Xuding Zhu},
  title        = {Star Extremal Circulant Graphs},
  journal      = {{SIAM} J. Discret. Math.},
  volume       = {12},
  number       = {4},
  pages        = {491--499},
  year         = {1999},
  url          = {https://doi.org/10.1137/S0895480198342838},
  doi          = {10.1137/S0895480198342838},
  timestamp    = {Sat, 25 Apr 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamdm/LihLZ99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/MahajanV99,
  author       = {Meena Mahajan and
                  V. Vinay},
  title        = {Determinant: Old Algorithms, New Insights},
  journal      = {{SIAM} J. Discret. Math.},
  volume       = {12},
  number       = {4},
  pages        = {474--490},
  year         = {1999},
  url          = {https://doi.org/10.1137/S0895480198338827},
  doi          = {10.1137/S0895480198338827},
  timestamp    = {Sat, 25 Apr 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamdm/MahajanV99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/Merris99,
  author       = {Russell Merris},
  title        = {Note: An Upper Bound for the Diameter of a Graph},
  journal      = {{SIAM} J. Discret. Math.},
  volume       = {12},
  number       = {3},
  pages        = {412},
  year         = {1999},
  url          = {https://doi.org/10.1137/S0895480195282471},
  doi          = {10.1137/S0895480195282471},
  timestamp    = {Sat, 25 Apr 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamdm/Merris99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/Mohar99,
  author       = {Bojan Mohar},
  title        = {A Linear Time Algorithm for Embedding Graphs in an Arbitrary Surface},
  journal      = {{SIAM} J. Discret. Math.},
  volume       = {12},
  number       = {1},
  pages        = {6--26},
  year         = {1999},
  url          = {https://doi.org/10.1137/S089548019529248X},
  doi          = {10.1137/S089548019529248X},
  timestamp    = {Sat, 25 Apr 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamdm/Mohar99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/PhelpsL99,
  author       = {Kevin T. Phelps and
                  Mike LeVan},
  title        = {Nonsystematic Perfect codes},
  journal      = {{SIAM} J. Discret. Math.},
  volume       = {12},
  number       = {1},
  pages        = {27--34},
  year         = {1999},
  url          = {https://doi.org/10.1137/S0895480196312206},
  doi          = {10.1137/S0895480196312206},
  timestamp    = {Sat, 25 Apr 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamdm/PhelpsL99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/RaghavachariV99,
  author       = {Balaji Raghavachari and
                  Jeyakesavan Veerasamy},
  title        = {A 3/2-Approximation Algorithm for the Mixed Postman Problem},
  journal      = {{SIAM} J. Discret. Math.},
  volume       = {12},
  number       = {4},
  pages        = {425--433},
  year         = {1999},
  url          = {https://doi.org/10.1137/S0895480197331454},
  doi          = {10.1137/S0895480197331454},
  timestamp    = {Sat, 25 Apr 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamdm/RaghavachariV99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/Rifa99,
  author       = {Josep Rif{\`{a}}},
  title        = {Well-Ordered Steiner Triple Systems and 1-Perfect Partitions of the
                  \emph{n}-cube},
  journal      = {{SIAM} J. Discret. Math.},
  volume       = {12},
  number       = {1},
  pages        = {35--47},
  year         = {1999},
  url          = {https://doi.org/10.1137/S0895480197330722},
  doi          = {10.1137/S0895480197330722},
  timestamp    = {Mon, 15 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamdm/Rifa99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/ServatiusW99,
  author       = {Brigitte Servatius and
                  Walter Whiteley},
  title        = {Constraining Plane Configurations in Computer-Aided Design: Combinatorics
                  of Directions and Lengths},
  journal      = {{SIAM} J. Discret. Math.},
  volume       = {12},
  number       = {1},
  pages        = {136--153},
  year         = {1999},
  url          = {https://doi.org/10.1137/S0895480196307342},
  doi          = {10.1137/S0895480196307342},
  timestamp    = {Sat, 30 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamdm/ServatiusW99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/Will99,
  author       = {Todd G. Will},
  title        = {Switching Distance Between Graphs with the Same Degrees},
  journal      = {{SIAM} J. Discret. Math.},
  volume       = {12},
  number       = {3},
  pages        = {298--306},
  year         = {1999},
  url          = {https://doi.org/10.1137/S0895480197331156},
  doi          = {10.1137/S0895480197331156},
  timestamp    = {Sat, 25 Apr 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamdm/Will99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/Zhang99,
  author       = {Louxin Zhang},
  title        = {Optimal Bounds for Matching Routing on Trees},
  journal      = {{SIAM} J. Discret. Math.},
  volume       = {12},
  number       = {1},
  pages        = {64--77},
  year         = {1999},
  url          = {https://doi.org/10.1137/S0895480197323159},
  doi          = {10.1137/S0895480197323159},
  timestamp    = {Sat, 25 Apr 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamdm/Zhang99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics