Stop the war!
Остановите войну!
for scientists:
default search action
Search dblp for Publications
export results for "toc:db/journals/siamdm/siamdm17.bht:"
@article{DBLP:journals/siamdm/BacsoGGPS04, author = {G{\'{a}}bor Bacs{\'{o}} and Sylvain Gravier and Andr{\'{a}}s Gy{\'{a}}rf{\'{a}}s and Myriam Preissmann and Andr{\'{a}}s Seb{\"{o}}}, title = {Coloring the Maximal Cliques of Graphs}, journal = {{SIAM} J. Discret. Math.}, volume = {17}, number = {3}, pages = {361--376}, year = {2004}, url = {https://doi.org/10.1137/S0895480199359995}, doi = {10.1137/S0895480199359995}, timestamp = {Sat, 25 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamdm/BacsoGGPS04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamdm/BanksCS04, author = {William D. Banks and Alessandro Conflitti and Igor E. Shparlinski}, title = {Number Theoretic Designs for Directed Regular Graphs of Small Diameter}, journal = {{SIAM} J. Discret. Math.}, volume = {17}, number = {3}, pages = {377--383}, year = {2004}, url = {https://doi.org/10.1137/S0895480101396676}, doi = {10.1137/S0895480101396676}, timestamp = {Mon, 26 Oct 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/siamdm/BanksCS04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamdm/Barahona04, author = {Francisco Barahona}, title = {Fractional Packing of T-Joins}, journal = {{SIAM} J. Discret. Math.}, volume = {17}, number = {4}, pages = {661--669}, year = {2004}, url = {https://doi.org/10.1137/S0895480102409619}, doi = {10.1137/S0895480102409619}, timestamp = {Sat, 25 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamdm/Barahona04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamdm/BargZ04, author = {Alexander Barg and Gilles Z{\'{e}}mor}, title = {Error Exponents of Expander Codes under Linear-Complexity Decoding}, journal = {{SIAM} J. Discret. Math.}, volume = {17}, number = {3}, pages = {426--445}, year = {2004}, url = {https://doi.org/10.1137/S0895480102403799}, doi = {10.1137/S0895480102403799}, timestamp = {Sat, 25 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamdm/BargZ04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamdm/BrandstadtL04, author = {Andreas Brandst{\"{a}}dt and Van Bang Le}, title = {Split-Perfect Graphs: Characterizations and Algorithmic Use}, journal = {{SIAM} J. Discret. Math.}, volume = {17}, number = {3}, pages = {341--360}, year = {2004}, url = {https://doi.org/10.1137/S0895480100367676}, doi = {10.1137/S0895480100367676}, timestamp = {Sat, 25 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamdm/BrandstadtL04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamdm/CharikarKKRST04, author = {Moses Charikar and Jon M. Kleinberg and Ravi Kumar and Sridhar Rajagopalan and Amit Sahai and Andrew Tomkins}, title = {Minimizing Wirelength in Zero and Bounded Skew Clock Trees}, journal = {{SIAM} J. Discret. Math.}, volume = {17}, number = {4}, pages = {582--595}, year = {2004}, url = {https://doi.org/10.1137/S0895480199352622}, doi = {10.1137/S0895480199352622}, timestamp = {Sun, 12 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/siamdm/CharikarKKRST04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamdm/ChenHZ04, author = {W. R. Chen and Frank K. Hwang and Xuding Zhu}, title = {Equivalence of the 1-Rate Model to the Classical Model on Strictly Nonblocking Switching Networks}, journal = {{SIAM} J. Discret. Math.}, volume = {17}, number = {3}, pages = {446--452}, year = {2004}, url = {https://doi.org/10.1137/S0895480102414806}, doi = {10.1137/S0895480102414806}, timestamp = {Sat, 25 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamdm/ChenHZ04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamdm/Cheng04, author = {Christine T. Cheng}, title = {Improved Approximation Algorithms for the Demand Routing and Slotting Problem with Unit Demands on Rings}, journal = {{SIAM} J. Discret. Math.}, volume = {17}, number = {3}, pages = {384--402}, year = {2004}, url = {https://doi.org/10.1137/S0895480101386723}, doi = {10.1137/S0895480101386723}, timestamp = {Sat, 25 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamdm/Cheng04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamdm/Crespi04, author = {Valentino Crespi}, title = {Exact Formulae for the Lova'sz Theta Function of Sparse Circulant Graphs}, journal = {{SIAM} J. Discret. Math.}, volume = {17}, number = {4}, pages = {670--674}, year = {2004}, url = {https://doi.org/10.1137/S089548010241852X}, doi = {10.1137/S089548010241852X}, timestamp = {Sat, 25 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamdm/Crespi04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamdm/DoughertyF04, author = {Randall Dougherty and Vance Faber}, title = {The Degree-Diameter Problem for Several Varieties of Cayley Graphs {I:} The Abelian Case}, journal = {{SIAM} J. Discret. Math.}, volume = {17}, number = {3}, pages = {478--519}, year = {2004}, url = {https://doi.org/10.1137/S0895480100372899}, doi = {10.1137/S0895480100372899}, timestamp = {Sat, 25 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamdm/DoughertyF04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamdm/FlamminiP04, author = {Michele Flammini and St{\'{e}}phane P{\'{e}}rennes}, title = {Lower Bounds on the Broadcasting and Gossiping Time of Restricted Protocols}, journal = {{SIAM} J. Discret. Math.}, volume = {17}, number = {4}, pages = {521--540}, year = {2004}, url = {https://doi.org/10.1137/S0895480101386450}, doi = {10.1137/S0895480101386450}, timestamp = {Sat, 25 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamdm/FlamminiP04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamdm/GerkeM04, author = {Stefanie Gerke and Colin McDiarmid}, title = {Graph Imperfection with a Co-Site Constraint}, journal = {{SIAM} J. Discret. Math.}, volume = {17}, number = {3}, pages = {403--425}, year = {2004}, url = {https://doi.org/10.1137/S0895480102402514}, doi = {10.1137/S0895480102402514}, timestamp = {Sat, 25 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamdm/GerkeM04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamdm/Graver04, author = {Jack E. Graver}, title = {Encoding Fullerenes and Geodesic Domes}, journal = {{SIAM} J. Discret. Math.}, volume = {17}, number = {4}, pages = {596--614}, year = {2004}, url = {https://doi.org/10.1137/S0895480101391041}, doi = {10.1137/S0895480101391041}, timestamp = {Sat, 25 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamdm/Graver04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamdm/KiersteadZ04, author = {Hal A. Kierstead and Yingxian Zhu}, title = {Radius Three Trees in Graphs with Large Chromatic Number}, journal = {{SIAM} J. Discret. Math.}, volume = {17}, number = {4}, pages = {571--581}, year = {2004}, url = {https://doi.org/10.1137/S0895480198339869}, doi = {10.1137/S0895480198339869}, timestamp = {Sat, 25 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamdm/KiersteadZ04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamdm/KindlerR04, author = {Guy Kindler and Dan Romik}, title = {On Distributions Computable by Random Walks on Graphs}, journal = {{SIAM} J. Discret. Math.}, volume = {17}, number = {4}, pages = {624--633}, year = {2004}, url = {https://doi.org/10.1137/S089548010343106X}, doi = {10.1137/S089548010343106X}, timestamp = {Sat, 25 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamdm/KindlerR04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamdm/KrokhinJJ04, author = {Andrei A. Krokhin and Peter Jeavons and Peter Jonsson}, title = {Constraint Satisfaction Problems on Intervals and Length}, journal = {{SIAM} J. Discret. Math.}, volume = {17}, number = {3}, pages = {453--477}, year = {2004}, url = {https://doi.org/10.1137/S0895480102410201}, doi = {10.1137/S0895480102410201}, timestamp = {Sat, 25 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamdm/KrokhinJJ04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamdm/MiersR04, author = {C. Robert Miers and Frank Ruskey}, title = {Counting Strings with Given Elementary Symmetric Function Evaluations {I:} Strings over Z\({}_{\mbox{p}}\) with p Prime}, journal = {{SIAM} J. Discret. Math.}, volume = {17}, number = {4}, pages = {675--685}, year = {2004}, url = {https://doi.org/10.1137/S0895480102415381}, doi = {10.1137/S0895480102415381}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamdm/MiersR04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamdm/MustafaP04, author = {Nabil H. Mustafa and Aleksandar Pekec}, title = {Listen to Your Neighbors: How (Not) to Reach a Consensus}, journal = {{SIAM} J. Discret. Math.}, volume = {17}, number = {4}, pages = {634--660}, year = {2004}, url = {https://doi.org/10.1137/S0895480102408213}, doi = {10.1137/S0895480102408213}, timestamp = {Sat, 25 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamdm/MustafaP04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamdm/OrdentlichR04, author = {Erik Ordentlich and Ron M. Roth}, title = {Independent Sets in Regular Hypergraphs and Multidimensional Runlength-Limited Constraints}, journal = {{SIAM} J. Discret. Math.}, volume = {17}, number = {4}, pages = {615--623}, year = {2004}, url = {https://doi.org/10.1137/S0895480102419767}, doi = {10.1137/S0895480102419767}, timestamp = {Sat, 25 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamdm/OrdentlichR04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamdm/ToS04, author = {Vu Dong T{\^{o}} and Reihaneh Safavi{-}Naini}, title = {On the Maximal Codes of Length 3 with the 2-Identifiable Parent Property}, journal = {{SIAM} J. Discret. Math.}, volume = {17}, number = {4}, pages = {548--570}, year = {2004}, url = {https://doi.org/10.1137/S0895480102400424}, doi = {10.1137/S0895480102400424}, timestamp = {Sat, 25 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamdm/ToS04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamdm/Trevisan04, author = {Luca Trevisan}, title = {On Local Versus Global Satisfiability}, journal = {{SIAM} J. Discret. Math.}, volume = {17}, number = {4}, pages = {541--547}, year = {2004}, url = {https://doi.org/10.1137/S0895480197326528}, doi = {10.1137/S0895480197326528}, timestamp = {Sat, 25 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamdm/Trevisan04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamdm/AzizougluE03, author = {M. Cemil Azizouglu and {\"{O}}mer Eugeciouglu}, title = {Extremal Sets Minimizing Dimension-Normalized Boundary in Hamming Graphs}, journal = {{SIAM} J. Discret. Math.}, volume = {17}, number = {2}, pages = {219--236}, year = {2003}, url = {https://doi.org/10.1137/S0895480100375053}, doi = {10.1137/S0895480100375053}, timestamp = {Sat, 31 Jul 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamdm/AzizougluE03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamdm/BarbeH03, author = {Andr{\'{e}} Barb{\'{e}} and Fritz von Haeseler}, title = {Symmetric Codes over Rings}, journal = {{SIAM} J. Discret. Math.}, volume = {17}, number = {2}, pages = {254--263}, year = {2003}, url = {https://doi.org/10.1137/S0895480102413771}, doi = {10.1137/S0895480102413771}, timestamp = {Fri, 23 Jul 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamdm/BarbeH03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamdm/Ben-AmeurG03, author = {Walid Ben{-}Ameur and {\'{E}}ric Gourdin}, title = {Internet Routing and Related Topology Issues}, journal = {{SIAM} J. Discret. Math.}, volume = {17}, number = {1}, pages = {18--49}, year = {2003}, url = {https://doi.org/10.1137/S0895480100377428}, doi = {10.1137/S0895480100377428}, timestamp = {Fri, 23 Jul 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamdm/Ben-AmeurG03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamdm/Bilbao03, author = {Jes{\'{u}}s Mario Bilbao}, title = {Cooperative Games under Augmenting Systems}, journal = {{SIAM} J. Discret. Math.}, volume = {17}, number = {1}, pages = {122--133}, year = {2003}, url = {https://doi.org/10.1137/S0895480102402745}, doi = {10.1137/S0895480102402745}, timestamp = {Thu, 14 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamdm/Bilbao03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamdm/FaginKS03, author = {Ronald Fagin and Ravi Kumar and D. Sivakumar}, title = {Comparing Top k Lists}, journal = {{SIAM} J. Discret. Math.}, volume = {17}, number = {1}, pages = {134--160}, year = {2003}, url = {https://doi.org/10.1137/S0895480102412856}, doi = {10.1137/S0895480102412856}, timestamp = {Fri, 23 Jul 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamdm/FaginKS03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamdm/FederHM03, author = {Tom{\'{a}}s Feder and Pavol Hell and Bojan Mohar}, title = {Acyclic Homomorphisms and Circular Colorings of Digraphs}, journal = {{SIAM} J. Discret. Math.}, volume = {17}, number = {1}, pages = {161--169}, year = {2003}, url = {https://doi.org/10.1137/S0895480103422184}, doi = {10.1137/S0895480103422184}, timestamp = {Fri, 23 Jul 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamdm/FederHM03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamdm/GeorgesM03, author = {John P. Georges and David W. Mauro}, title = {On Regular Graphs Optimally Labeled with a Condition at Distance Two}, journal = {{SIAM} J. Discret. Math.}, volume = {17}, number = {2}, pages = {320--331}, year = {2003}, url = {https://doi.org/10.1137/S0895480101391247}, doi = {10.1137/S0895480101391247}, timestamp = {Fri, 23 Jul 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamdm/GeorgesM03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamdm/Gottlieb03, author = {Eric Gottlieb}, title = {On the Homology of the h, k-Equal Dowling Lattice}, journal = {{SIAM} J. Discret. Math.}, volume = {17}, number = {1}, pages = {50--71}, year = {2003}, url = {https://doi.org/10.1137/S0895480103422482}, doi = {10.1137/S0895480103422482}, timestamp = {Fri, 23 Jul 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamdm/Gottlieb03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamdm/Jordan03, author = {Tibor Jord{\'{a}}n}, title = {Constrained Edge-Splitting Problems}, journal = {{SIAM} J. Discret. Math.}, volume = {17}, number = {1}, pages = {88--102}, year = {2003}, url = {https://doi.org/10.1137/S0895480199364483}, doi = {10.1137/S0895480199364483}, timestamp = {Fri, 23 Jul 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamdm/Jordan03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamdm/JordanS03, author = {Tibor Jord{\'{a}}n and Zolt{\'{a}}n Szigeti}, title = {Detachments Preserving Local Edge-Connectivity of Graphs}, journal = {{SIAM} J. Discret. Math.}, volume = {17}, number = {1}, pages = {72--87}, year = {2003}, url = {https://doi.org/10.1137/S0895480199363933}, doi = {10.1137/S0895480199363933}, timestamp = {Fri, 23 Jul 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamdm/JordanS03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamdm/Kashyap03, author = {Navin Kashyap}, title = {Maximizing the Shannon Capacity of Constrained Systems with Two Constraints}, journal = {{SIAM} J. Discret. Math.}, volume = {17}, number = {2}, pages = {298--319}, year = {2003}, url = {https://doi.org/10.1137/S0895480102402757}, doi = {10.1137/S0895480102402757}, timestamp = {Fri, 23 Jul 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamdm/Kashyap03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamdm/KashyapS03, author = {Navin Kashyap and Paul H. Siegel}, title = {Equalities among Capacities of (d, k)-Constrained Systems}, journal = {{SIAM} J. Discret. Math.}, volume = {17}, number = {2}, pages = {276--297}, year = {2003}, url = {https://doi.org/10.1137/S0895480102413710}, doi = {10.1137/S0895480102413710}, timestamp = {Fri, 23 Jul 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamdm/KashyapS03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamdm/LaroseZ03, author = {Beno{\^{\i}}t Larose and L{\'{a}}szl{\'{o}} Z{\'{a}}dori}, title = {The Complexity of the Extendibility Problem for Finite Posets}, journal = {{SIAM} J. Discret. Math.}, volume = {17}, number = {1}, pages = {114--121}, year = {2003}, url = {https://doi.org/10.1137/S0895480101389478}, doi = {10.1137/S0895480101389478}, timestamp = {Fri, 23 Jul 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamdm/LaroseZ03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamdm/LewensteinS03, author = {Moshe Lewenstein and Maxim Sviridenko}, title = {A 5/8 Approximation Algorithm for the Maximum Asymmetric {TSP}}, journal = {{SIAM} J. Discret. Math.}, volume = {17}, number = {2}, pages = {237--248}, year = {2003}, url = {https://doi.org/10.1137/S0895480102402861}, doi = {10.1137/S0895480102402861}, timestamp = {Fri, 23 Jul 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamdm/LewensteinS03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamdm/LiW03, author = {Xueliang Li and Lusheng Wang}, title = {Solutions for Two Conjectures on the Inverse Problem of the Wiener Index of Peptoids}, journal = {{SIAM} J. Discret. Math.}, volume = {17}, number = {2}, pages = {210--218}, year = {2003}, url = {https://doi.org/10.1137/S0895480101387261}, doi = {10.1137/S0895480101387261}, timestamp = {Wed, 20 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamdm/LiW03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamdm/LuoCV03, author = {Luo Yuan and Wende Chen and A. J. Han Vinck}, title = {The Determination of the Chain Good Weight Hierarchies with High Dimension}, journal = {{SIAM} J. Discret. Math.}, volume = {17}, number = {2}, pages = {196--209}, year = {2003}, url = {https://doi.org/10.1137/S0895480102416684}, doi = {10.1137/S0895480102416684}, timestamp = {Fri, 23 Jul 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamdm/LuoCV03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamdm/MyersW03, author = {Amy N. Myers and Herbert S. Wilf}, title = {Some New Aspects of the Coupon Collector's Problem}, journal = {{SIAM} J. Discret. Math.}, volume = {17}, number = {1}, pages = {1--17}, year = {2003}, url = {https://doi.org/10.1137/S0895480102403076}, doi = {10.1137/S0895480102403076}, timestamp = {Fri, 23 Jul 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamdm/MyersW03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamdm/Onn03, author = {Shmuel Onn}, title = {Convex Matroid Optimization}, journal = {{SIAM} J. Discret. Math.}, volume = {17}, number = {2}, pages = {249--253}, year = {2003}, url = {https://doi.org/10.1137/S0895480102408559}, doi = {10.1137/S0895480102408559}, timestamp = {Sat, 09 Apr 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamdm/Onn03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamdm/RuckensteinR03, author = {Gitit Ruckenstein and Ron M. Roth}, title = {Bounds on the List-Decoding Radius of Reed-Solomon Codes}, journal = {{SIAM} J. Discret. Math.}, volume = {17}, number = {2}, pages = {171--195}, year = {2003}, url = {https://doi.org/10.1137/S0895480101395506}, doi = {10.1137/S0895480101395506}, timestamp = {Fri, 23 Jul 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamdm/RuckensteinR03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamdm/Tapia-RecillasV03, author = {Horacio Tapia{-}Recillas and Gerardo Vega}, title = {On Z\({}_{\mbox{2}}\)k-Linear and Quaternary Codes}, journal = {{SIAM} J. Discret. Math.}, volume = {17}, number = {1}, pages = {103--113}, year = {2003}, url = {https://doi.org/10.1137/S0895480101397219}, doi = {10.1137/S0895480101397219}, timestamp = {Fri, 23 Jul 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamdm/Tapia-RecillasV03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamdm/WangL03, author = {Wei{-}Fan Wang and Ko{-}Wei Lih}, title = {Labeling Planar Graphs with Conditions on Girth and Distance Two}, journal = {{SIAM} J. Discret. Math.}, volume = {17}, number = {2}, pages = {264--275}, year = {2003}, url = {https://doi.org/10.1137/S0895480101390448}, doi = {10.1137/S0895480101390448}, timestamp = {Fri, 23 Jul 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamdm/WangL03.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.