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/journals/siamdm/siamdm19.bht:"
download as .bib file
@article{DBLP:journals/siamdm/AbramsF05,
author = {Lowell Abrams and
Donniell E. Fishkind},
title = {A Genus Bound for Digital Image Boundaries},
journal = {{SIAM} J. Discret. Math.},
volume = {19},
number = {3},
pages = {807--813},
year = {2005},
url = {https://doi.org/10.1137/S0895480104445691},
doi = {10.1137/S0895480104445691},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/AbramsF05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/AlbersB05,
author = {Susanne Albers and
Helge Bals},
title = {Dynamic {TCP} Acknowledgment: Penalizing Long Delays},
journal = {{SIAM} J. Discret. Math.},
volume = {19},
number = {4},
pages = {938--951},
year = {2005},
url = {https://doi.org/10.1137/S0895480104441656},
doi = {10.1137/S0895480104441656},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/AlbersB05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/AlstrupBR05,
author = {Stephen Alstrup and
Philip Bille and
Theis Rauhe},
title = {Labeling Schemes for Small Distances in Trees},
journal = {{SIAM} J. Discret. Math.},
volume = {19},
number = {2},
pages = {448--462},
year = {2005},
url = {https://doi.org/10.1137/S0895480103433409},
doi = {10.1137/S0895480103433409},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/AlstrupBR05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/ApfelbaumS05,
author = {Roel Apfelbaum and
Micha Sharir},
title = {Repeated Angles in Three and Four Dimensions},
journal = {{SIAM} J. Discret. Math.},
volume = {19},
number = {2},
pages = {294--300},
year = {2005},
url = {https://doi.org/10.1137/S0895480104443941},
doi = {10.1137/S0895480104443941},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/ApfelbaumS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/Bar-YehudaR05,
author = {Reuven Bar{-}Yehuda and
Dror Rawitz},
title = {On the Equivalence between the Primal-Dual Schema and the Local Ratio
Technique},
journal = {{SIAM} J. Discret. Math.},
volume = {19},
number = {3},
pages = {762--797},
year = {2005},
url = {https://doi.org/10.1137/050625382},
doi = {10.1137/050625382},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/Bar-YehudaR05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/Ben-HaimL05,
author = {Yael Ben{-}Haim and
Simon Litsyn},
title = {Exact Minimum Density of Codes Identifying Vertices in the Square
Grid},
journal = {{SIAM} J. Discret. Math.},
volume = {19},
number = {1},
pages = {69--82},
year = {2005},
url = {https://doi.org/10.1137/S0895480104444089},
doi = {10.1137/S0895480104444089},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/Ben-HaimL05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/BermondCCGLM05,
author = {Jean{-}Claude Bermond and
Charles J. Colbourn and
David Coudert and
Gennian Ge and
Alan C. H. Ling and
Xavier Mu{\~{n}}oz},
title = {Traffic Grooming in Unidirectional Wavelength-Division Multiplexed
Rings with Grooming Ratio \emph{C} = 6},
journal = {{SIAM} J. Discret. Math.},
volume = {19},
number = {2},
pages = {523--542},
year = {2005},
url = {https://doi.org/10.1137/S0895480104444314},
doi = {10.1137/S0895480104444314},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamdm/BermondCCGLM05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/Biha05,
author = {Mohamed Didi Biha},
title = {On the 3-Terminal Cut Polyhedron},
journal = {{SIAM} J. Discret. Math.},
volume = {19},
number = {3},
pages = {575--587},
year = {2005},
url = {https://doi.org/10.1137/S0895480104445149},
doi = {10.1137/S0895480104445149},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/Biha05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/BollobasCE05,
author = {B{\'{e}}la Bollob{\'{a}}s and
Don Coppersmith and
Michael Elkin},
title = {Sparse Distance Preservers and Additive Spanners},
journal = {{SIAM} J. Discret. Math.},
volume = {19},
number = {4},
pages = {1029--1055},
year = {2005},
url = {https://doi.org/10.1137/S0895480103431046},
doi = {10.1137/S0895480103431046},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/BollobasCE05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/BouyuklievO05,
author = {Iliya Bouyukliev and
Patric R. J. {\"{O}}sterg{\aa}rd},
title = {Classification of Self-Orthogonal Codes over F\({}_{\mbox{3}}\) and
F\({}_{\mbox{4}}\)},
journal = {{SIAM} J. Discret. Math.},
volume = {19},
number = {2},
pages = {363--370},
year = {2005},
url = {https://doi.org/10.1137/S0895480104441085},
doi = {10.1137/S0895480104441085},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/BouyuklievO05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/Brass05,
author = {Peter Bra{\ss}},
title = {An Upper Bound for the d-Dimensional Analogue of Heilbronn's Triangle
Problem},
journal = {{SIAM} J. Discret. Math.},
volume = {19},
number = {1},
pages = {192--195},
year = {2005},
url = {https://doi.org/10.1137/S0895480103435810},
doi = {10.1137/S0895480103435810},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/Brass05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/BrownN05,
author = {Jason I. Brown and
Richard J. Nowakowski},
title = {Well-Covered Vector Spaces of Graphs},
journal = {{SIAM} J. Discret. Math.},
volume = {19},
number = {4},
pages = {952--965},
year = {2005},
url = {https://doi.org/10.1137/S0895480101393039},
doi = {10.1137/S0895480101393039},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/BrownN05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/BrueniH05,
author = {Dennis J. Brueni and
Lenwood S. Heath},
title = {The {PMU} Placement Problem},
journal = {{SIAM} J. Discret. Math.},
volume = {19},
number = {3},
pages = {744--761},
year = {2005},
url = {https://doi.org/10.1137/S0895480103432556},
doi = {10.1137/S0895480103432556},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/BrueniH05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/BursteinK05,
author = {Alexander Burstein and
Sergey Kitaev},
title = {On Unavoidable Sets of Word Patterns},
journal = {{SIAM} J. Discret. Math.},
volume = {19},
number = {2},
pages = {371--381},
year = {2005},
url = {https://doi.org/10.1137/S0895480104445678},
doi = {10.1137/S0895480104445678},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamdm/BursteinK05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/ChaichanavongM05,
author = {Panu Chaichanavong and
Brian H. Marcus},
title = {Stabilization of Block-Type-Decodability Properties for Constrained
Systems},
journal = {{SIAM} J. Discret. Math.},
volume = {19},
number = {2},
pages = {321--344},
year = {2005},
url = {https://doi.org/10.1137/S0895480104443679},
doi = {10.1137/S0895480104443679},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/ChaichanavongM05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/ChardonM05,
author = {Marc Chardon and
Aziz Moukrim},
title = {The Coffman--Graham Algorithm Optimally Solves {UET} Task Systems
with Overinterval Orders},
journal = {{SIAM} J. Discret. Math.},
volume = {19},
number = {1},
pages = {109--121},
year = {2005},
url = {https://doi.org/10.1137/S0895480101394999},
doi = {10.1137/S0895480101394999},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/ChardonM05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/ChenZLW05,
author = {Robert W. Chen and
Alan Zame and
Chien{-}Tai Lin and
Hsiu{-}fen Wu},
title = {A Random Version of Shepp's Urn Scheme},
journal = {{SIAM} J. Discret. Math.},
volume = {19},
number = {1},
pages = {149--164},
year = {2005},
url = {https://doi.org/10.1137/S0895480102418099},
doi = {10.1137/S0895480102418099},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/ChenZLW05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/CoppersmithL05,
author = {Don Coppersmith and
Moshe Lewenstein},
title = {Constructive Bounds on Ordered Factorizations},
journal = {{SIAM} J. Discret. Math.},
volume = {19},
number = {2},
pages = {301--303},
year = {2005},
url = {https://doi.org/10.1137/S0895480104445861},
doi = {10.1137/S0895480104445861},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/CoppersmithL05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/CurranLY05,
author = {Sean Curran and
Orlando Lee and
Xingxing Yu},
title = {Nonseparating Planar Chains in 4-Connected Graphs},
journal = {{SIAM} J. Discret. Math.},
volume = {19},
number = {2},
pages = {399--419},
year = {2005},
url = {https://doi.org/10.1137/S0895480103434580},
doi = {10.1137/S0895480103434580},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/CurranLY05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/CurranLY05a,
author = {Sean Curran and
Orlando Lee and
Xingxing Yu},
title = {Chain Decompositions of 4-Connected Graphs},
journal = {{SIAM} J. Discret. Math.},
volume = {19},
number = {4},
pages = {848--880},
year = {2005},
url = {https://doi.org/10.1137/S0895480103434592},
doi = {10.1137/S0895480103434592},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/CurranLY05a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/DanielS05,
author = {Philip Daniel and
Charles Semple},
title = {A Class of General Supertree Methods for Nested Taxa},
journal = {{SIAM} J. Discret. Math.},
volume = {19},
number = {2},
pages = {463--480},
year = {2005},
url = {https://doi.org/10.1137/S0895480104441462},
doi = {10.1137/S0895480104441462},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/DanielS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/DrmotaH05,
author = {Michael Drmota and
Hsien{-}Kuei Hwang},
title = {Bimodality and Phase Transitions in the Profile Variance of Random
Binary Search Trees},
journal = {{SIAM} J. Discret. Math.},
volume = {19},
number = {1},
pages = {19--45},
year = {2005},
url = {https://doi.org/10.1137/S0895480104440134},
doi = {10.1137/S0895480104440134},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/DrmotaH05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/DumitriuS05,
author = {Ioana Dumitriu and
Joel H. Spencer},
title = {The Two-Batch Liar Game over an Arbitrary Channel},
journal = {{SIAM} J. Discret. Math.},
volume = {19},
number = {4},
pages = {1056--1064},
year = {2005},
url = {https://doi.org/10.1137/040617510},
doi = {10.1137/040617510},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/DumitriuS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/Dvorak05,
author = {Tom{\'{a}}s Dvor{\'{a}}k},
title = {Hamiltonian Cycles with Prescribed Edges in Hypercubes},
journal = {{SIAM} J. Discret. Math.},
volume = {19},
number = {1},
pages = {135--144},
year = {2005},
url = {https://doi.org/10.1137/S0895480103432805},
doi = {10.1137/S0895480103432805},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/Dvorak05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/ElkinK05,
author = {Michael Elkin and
Guy Kortsarz},
title = {Polylogarithmic Additive Inapproximability of the Radio Broadcast
Problem},
journal = {{SIAM} J. Discret. Math.},
volume = {19},
number = {4},
pages = {881--899},
year = {2005},
url = {https://doi.org/10.1137/S0895480104445319},
doi = {10.1137/S0895480104445319},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/ElkinK05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/Encheva05,
author = {Sylvia B. Encheva},
title = {On Projective Codes Satisfying the Chain Condition},
journal = {{SIAM} J. Discret. Math.},
volume = {19},
number = {1},
pages = {145--148},
year = {2005},
url = {https://doi.org/10.1137/S089548019631431X},
doi = {10.1137/S089548019631431X},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/Encheva05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/ErdosFK05,
author = {P{\'{e}}ter L. Erd{\"{o}}s and
Zolt{\'{a}}n F{\"{u}}redi and
Gyula O. H. Katona},
title = {Two-Part and \emph{k}-Sperner Families: New Proofs Using Permutations},
journal = {{SIAM} J. Discret. Math.},
volume = {19},
number = {2},
pages = {489--500},
year = {2005},
url = {https://doi.org/10.1137/S0895480104443588},
doi = {10.1137/S0895480104443588},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/ErdosFK05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/FederS05,
author = {Tom{\'{a}}s Feder and
Carlos S. Subi},
title = {Disks on a Tree: Analysis of a Combinatorial Game},
journal = {{SIAM} J. Discret. Math.},
volume = {19},
number = {3},
pages = {543--552},
year = {2005},
url = {https://doi.org/10.1137/S0895480102418002},
doi = {10.1137/S0895480102418002},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/FederS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/FengKK05,
author = {Rongquan Feng and
Jin Ho Kwak and
Young Soo Kwon},
title = {Enumerating Typical Circulant Covering Projections Onto a Circulant
Graph},
journal = {{SIAM} J. Discret. Math.},
volume = {19},
number = {1},
pages = {196--207},
year = {2005},
url = {https://doi.org/10.1137/S0895480103431861},
doi = {10.1137/S0895480103431861},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/FengKK05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/FialaKS05,
author = {Jir{\'{\i}} Fiala and
Daniel Kr{\'{a}}l and
Riste Skrekovski},
title = {A Brooks-Type Theorem for the Generalized List T-Coloring},
journal = {{SIAM} J. Discret. Math.},
volume = {19},
number = {3},
pages = {588--609},
year = {2005},
url = {https://doi.org/10.1137/S0895480103437870},
doi = {10.1137/S0895480103437870},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/FialaKS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/FichKPR05,
author = {Faith Ellen Fich and
Andr{\'{e}} K{\"{u}}ndgen and
Michael J. Pelsmajer and
Radhika Ramamurthi},
title = {Graph Minors and Reliable Single Message Transmission},
journal = {{SIAM} J. Discret. Math.},
volume = {19},
number = {4},
pages = {815--847},
year = {2005},
url = {https://doi.org/10.1137/S0895480103421129},
doi = {10.1137/S0895480103421129},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/FichKPR05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/ForstT05,
author = {Gunnar Forst and
Anders Thorup},
title = {What Costs Are Minimized by Huffman Trees?},
journal = {{SIAM} J. Discret. Math.},
volume = {19},
number = {1},
pages = {46--68},
year = {2005},
url = {https://doi.org/10.1137/S0895480103421725},
doi = {10.1137/S0895480103421725},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/ForstT05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/FriedmanT05,
author = {Joel Friedman and
Jean{-}Pierre Tillich},
title = {Generalized Alon--Boppana Theorems and Error-Correcting Codes},
journal = {{SIAM} J. Discret. Math.},
volume = {19},
number = {3},
pages = {700--718},
year = {2005},
url = {https://doi.org/10.1137/S0895480102408353},
doi = {10.1137/S0895480102408353},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/FriedmanT05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/FriezeKS05,
author = {Alan M. Frieze and
Michael Krivelevich and
Benny Sudakov},
title = {The Strong Chromatic Index of Random Graphs},
journal = {{SIAM} J. Discret. Math.},
volume = {19},
number = {3},
pages = {719--727},
year = {2005},
url = {https://doi.org/10.1137/S0895480104445757},
doi = {10.1137/S0895480104445757},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/FriezeKS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/FujishigeI05,
author = {Satoru Fujishige and
Satoru Iwata},
title = {Bisubmodular Function Minimization},
journal = {{SIAM} J. Discret. Math.},
volume = {19},
number = {4},
pages = {1065--1073},
year = {2005},
url = {https://doi.org/10.1137/S0895480103426339},
doi = {10.1137/S0895480103426339},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/FujishigeI05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/Gabow05,
author = {Harold N. Gabow},
title = {An Improved Analysis for Approximating the Smallest k-Edge Connected
Spanning Subgraph of a Multigraph},
journal = {{SIAM} J. Discret. Math.},
volume = {19},
number = {1},
pages = {1--18},
year = {2005},
url = {https://doi.org/10.1137/S0895480102414910},
doi = {10.1137/S0895480102414910},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/Gabow05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/GeorgesM05,
author = {John P. Georges and
David W. Mauro},
title = {On the Structure of Graphs with Non-Surjective L(2, 1)-Labelings},
journal = {{SIAM} J. Discret. Math.},
volume = {19},
number = {1},
pages = {208--223},
year = {2005},
url = {https://doi.org/10.1137/S0895480103429800},
doi = {10.1137/S0895480103429800},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/GeorgesM05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/Gijswijt05,
author = {Dion Gijswijt},
title = {Integer Decomposition for Polyhedra Defined by Nearly Totally Unimodular
Matrices},
journal = {{SIAM} J. Discret. Math.},
volume = {19},
number = {3},
pages = {798--806},
year = {2005},
url = {https://doi.org/10.1137/S089548010343569X},
doi = {10.1137/S089548010343569X},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamdm/Gijswijt05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/GraafV05,
author = {Mart de Graaf and
Paul Valiant},
title = {Polynomial Representations of Symmetric Partial Boolean Functions},
journal = {{SIAM} J. Discret. Math.},
volume = {19},
number = {2},
pages = {481--488},
year = {2005},
url = {https://doi.org/10.1137/S0895480103433562},
doi = {10.1137/S0895480103433562},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/GraafV05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/HeggernesTV05,
author = {Pinar Heggernes and
Jan Arne Telle and
Yngve Villanger},
title = {Computing Minimal Triangulations in Time \emph{O}(\emph{n}\({}^{\mbox{alpha}}\)
\emph{log n}) = \emph{o}(\emph{n} \({}^{\mbox{2.376}}\))},
journal = {{SIAM} J. Discret. Math.},
volume = {19},
number = {4},
pages = {900--913},
year = {2005},
url = {https://doi.org/10.1137/S0895480104445010},
doi = {10.1137/S0895480104445010},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/HeggernesTV05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/HsuK05,
author = {Tsan{-}sheng Hsu and
Ming{-}Yang Kao},
title = {Optimal Augmentation for Bipartite Componentwise Biconnectivity in
Linear Time},
journal = {{SIAM} J. Discret. Math.},
volume = {19},
number = {2},
pages = {345--362},
year = {2005},
url = {https://doi.org/10.1137/S0895480196303216},
doi = {10.1137/S0895480196303216},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/HsuK05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/IwataMS05,
author = {Satoru Iwata and
S. Thomas McCormick and
Maiko Shigeno},
title = {A Strongly Polynomial Cut Canceling Algorithm for Minimum Cost Submodular
Flow},
journal = {{SIAM} J. Discret. Math.},
volume = {19},
number = {2},
pages = {304--320},
year = {2005},
url = {https://doi.org/10.1137/S0895480199361533},
doi = {10.1137/S0895480199361533},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/IwataMS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/JiZ05,
author = {Lijun Ji and
Lie Zhu},
title = {Resolvable Steiner Quadruple Systems for the Last 23 Orders},
journal = {{SIAM} J. Discret. Math.},
volume = {19},
number = {2},
pages = {420--430},
year = {2005},
url = {https://doi.org/10.1137/S0895480104440584},
doi = {10.1137/S0895480104440584},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/JiZ05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/Jonsson05,
author = {Jakob Jonsson},
title = {Simplicial Complexes of Graphs and Hypergraphs with a Bounded Covering
Number},
journal = {{SIAM} J. Discret. Math.},
volume = {19},
number = {3},
pages = {633--650},
year = {2005},
url = {https://doi.org/10.1137/S0895480104443680},
doi = {10.1137/S0895480104443680},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/Jonsson05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/KashyapSV05,
author = {Navin Kashyap and
Paul H. Siegel and
Alexander Vardy},
title = {An Application of Ramsey Theory to Coding for the Optical Channel},
journal = {{SIAM} J. Discret. Math.},
volume = {19},
number = {4},
pages = {921--937},
year = {2005},
url = {https://doi.org/10.1137/S089548010444585X},
doi = {10.1137/S089548010444585X},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/KashyapSV05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/Kaski05,
author = {Petteri Kaski},
title = {Isomorph-Free Exhaustive Generation of Designs with Prescribed Groups
of Automorphisms},
journal = {{SIAM} J. Discret. Math.},
volume = {19},
number = {3},
pages = {664--690},
year = {2005},
url = {https://doi.org/10.1137/S0895480104444788},
doi = {10.1137/S0895480104444788},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/Kaski05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/KhachiyanBEGM05,
author = {Leonid G. Khachiyan and
Endre Boros and
Khaled M. Elbassioni and
Vladimir Gurvich and
Kazuhisa Makino},
title = {On the Complexity of Some Enumeration Problems for Matroids},
journal = {{SIAM} J. Discret. Math.},
volume = {19},
number = {4},
pages = {966--984},
year = {2005},
url = {https://doi.org/10.1137/S0895480103428338},
doi = {10.1137/S0895480103428338},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/KhachiyanBEGM05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/KostochkaNP05,
author = {Alexandr V. Kostochka and
Kittikorn Nakprasit and
Sriram V. Pemmaraju},
title = {On Equitable Coloring of d-Degenerate Graphs},
journal = {{SIAM} J. Discret. Math.},
volume = {19},
number = {1},
pages = {83--95},
year = {2005},
url = {https://doi.org/10.1137/S0895480103436505},
doi = {10.1137/S0895480103436505},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/KostochkaNP05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/KubickiM05,
author = {Grzegorz Kubicki and
Michal Morayne},
title = {Graph-Theoretic Generalization of the Secretary Problem: The Directed
Path Case},
journal = {{SIAM} J. Discret. Math.},
volume = {19},
number = {3},
pages = {622--632},
year = {2005},
url = {https://doi.org/10.1137/S0895480104440596},
doi = {10.1137/S0895480104440596},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/KubickiM05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/KushilevitzM05,
author = {Eyal Kushilevitz and
Yishay Mansour},
title = {Computation in Noisy Radio Networks},
journal = {{SIAM} J. Discret. Math.},
volume = {19},
number = {1},
pages = {96--108},
year = {2005},
url = {https://doi.org/10.1137/S0895480103434063},
doi = {10.1137/S0895480103434063},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/KushilevitzM05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/KwakML05,
author = {Jin Ho Kwak and
Alexander D. Mednykh and
Valery A. Liskovets},
title = {Enumeration of Branched Coverings of Nonorientable Surfaces With Cyclic
Branch Points},
journal = {{SIAM} J. Discret. Math.},
volume = {19},
number = {2},
pages = {388--398},
year = {2005},
url = {https://doi.org/10.1137/S0895480103424043},
doi = {10.1137/S0895480103424043},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamdm/KwakML05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/LingO05,
author = {San Ling and
Ferruh {\"{O}}zbudak},
title = {Improved \emph{p}-ary Codes and Sequence Families from Galois Rings
of Characteristic \emph{p}\({}^{\mbox{2}}\)},
journal = {{SIAM} J. Discret. Math.},
volume = {19},
number = {4},
pages = {1011--1028},
year = {2005},
url = {https://doi.org/10.1137/S089548010444506X},
doi = {10.1137/S089548010444506X},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamdm/LingO05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/LiuZ05,
author = {Daphne Der{-}Fen Liu and
Xuding Zhu},
title = {Circular Distance Two Labeling and the lambda-Number for Outerplanar
Graphs},
journal = {{SIAM} J. Discret. Math.},
volume = {19},
number = {2},
pages = {281--293},
year = {2005},
url = {https://doi.org/10.1137/S0895480102414296},
doi = {10.1137/S0895480102414296},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/LiuZ05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/LiuZ05a,
author = {Daphne Der{-}Fen Liu and
Xuding Zhu},
title = {Multilevel Distance Labelings for Paths and Cycles},
journal = {{SIAM} J. Discret. Math.},
volume = {19},
number = {3},
pages = {610--621},
year = {2005},
url = {https://doi.org/10.1137/S0895480102417768},
doi = {10.1137/S0895480102417768},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/LiuZ05a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/LuzS05,
author = {Carlos J. Luz and
Alexander Schrijver},
title = {A Convex Quadratic Characterization of the Lov{\'{a}}sz Theta
Number},
journal = {{SIAM} J. Discret. Math.},
volume = {19},
number = {2},
pages = {382--387},
year = {2005},
url = {https://doi.org/10.1137/S0895480104429181},
doi = {10.1137/S0895480104429181},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamdm/LuzS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/MaffrayT05,
author = {Fr{\'{e}}d{\'{e}}ric Maffray and
Nicolas Trotignon},
title = {Algorithms for Perfectly Contractile Graphs},
journal = {{SIAM} J. Discret. Math.},
volume = {19},
number = {3},
pages = {553--574},
year = {2005},
url = {https://doi.org/10.1137/S0895480104442522},
doi = {10.1137/S0895480104442522},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/MaffrayT05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/MudgalTGK05,
author = {Apurva Mudgal and
Craig A. Tovey and
Sam Greenberg and
Sven Koenig},
title = {Bounds on the Travel Cost of a Mars Rover Prototype Search Heuristic},
journal = {{SIAM} J. Discret. Math.},
volume = {19},
number = {2},
pages = {431--447},
year = {2005},
url = {https://doi.org/10.1137/S089548010444256X},
doi = {10.1137/S089548010444256X},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/MudgalTGK05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/MuirS05,
author = {James A. Muir and
Douglas R. Stinson},
title = {Alternative Digit Sets for Nonadjacent Representations},
journal = {{SIAM} J. Discret. Math.},
volume = {19},
number = {1},
pages = {165--191},
year = {2005},
url = {https://doi.org/10.1137/S0895480103437651},
doi = {10.1137/S0895480103437651},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/MuirS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/NesetrilT05,
author = {Jaroslav Nesetril and
Claude Tardif},
title = {Short Answers to Exponentially Long Questions: Extremal Aspects of
Homomorphism Duality},
journal = {{SIAM} J. Discret. Math.},
volume = {19},
number = {4},
pages = {914--920},
year = {2005},
url = {https://doi.org/10.1137/S0895480104445630},
doi = {10.1137/S0895480104445630},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/NesetrilT05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/PikeZ05,
author = {David A. Pike and
Yubo Zou},
title = {Decycling Cartesian Products of Two Cycles},
journal = {{SIAM} J. Discret. Math.},
volume = {19},
number = {3},
pages = {651--663},
year = {2005},
url = {https://doi.org/10.1137/S089548010444016X},
doi = {10.1137/S089548010444016X},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/PikeZ05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/RobinsZ05,
author = {Gabriel Robins and
Alexander Zelikovsky},
title = {Tighter Bounds for Graph Steiner Tree Approximation},
journal = {{SIAM} J. Discret. Math.},
volume = {19},
number = {1},
pages = {122--134},
year = {2005},
url = {https://doi.org/10.1137/S0895480101393155},
doi = {10.1137/S0895480101393155},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/RobinsZ05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/Scarabotti05,
author = {Fabio Scarabotti},
title = {The Discrete Sine Transform and the Spectrum of the Finite \emph{q}-ary
Tree},
journal = {{SIAM} J. Discret. Math.},
volume = {19},
number = {4},
pages = {1004--1010},
year = {2005},
url = {https://doi.org/10.1137/S0895480104445344},
doi = {10.1137/S0895480104445344},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/Scarabotti05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/SchaeferS05,
author = {Marcus Schaefer and
Daniel Stefankovic},
title = {Solvability of Graph Inequalities},
journal = {{SIAM} J. Discret. Math.},
volume = {19},
number = {3},
pages = {728--743},
year = {2005},
url = {https://doi.org/10.1137/S0895480199360655},
doi = {10.1137/S0895480199360655},
timestamp = {Thu, 17 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/SchaeferS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/Wild05,
author = {Marcel Wild},
title = {The Asymptotic Number of Binary Codes and Binary Matroids},
journal = {{SIAM} J. Discret. Math.},
volume = {19},
number = {3},
pages = {691--699},
year = {2005},
url = {https://doi.org/10.1137/S0895480104445538},
doi = {10.1137/S0895480104445538},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/Wild05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/Yaman05,
author = {Hande Yaman},
title = {Polyhedral Analysis for the Uncapacitated Hub Location Problem with
Modular Arc Capacities},
journal = {{SIAM} J. Discret. Math.},
volume = {19},
number = {2},
pages = {501--522},
year = {2005},
url = {https://doi.org/10.1137/S0895480103439157},
doi = {10.1137/S0895480103439157},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/Yaman05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/Zhou05,
author = {Sanming Zhou},
title = {Labelling Cayley Graphs on Abelian Groups},
journal = {{SIAM} J. Discret. Math.},
volume = {19},
number = {4},
pages = {985--1003},
year = {2005},
url = {https://doi.org/10.1137/S0895480102404458},
doi = {10.1137/S0895480102404458},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/Zhou05.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-05-29 13:04 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:
