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/siamdm11.bht:"
download as .bib file
@article{DBLP:journals/siamdm/BafnaP98,
author = {Vineet Bafna and
Pavel A. Pevzner},
title = {Sorting by Transpositions},
journal = {{SIAM} J. Discret. Math.},
volume = {11},
number = {2},
pages = {224--240},
year = {1998},
url = {https://doi.org/10.1137/S089548019528280X},
doi = {10.1137/S089548019528280X},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamdm/BafnaP98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/Bang-JensenJ98,
author = {J{\o}rgen Bang{-}Jensen and
Tibor Jord{\'{a}}n},
title = {Edge-Connectivity Augmentation Preserving Simplicity},
journal = {{SIAM} J. Discret. Math.},
volume = {11},
number = {4},
pages = {603--623},
year = {1998},
url = {https://doi.org/10.1137/S0895480197318878},
doi = {10.1137/S0895480197318878},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/Bang-JensenJ98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/BodlaenderDJKKMT98,
author = {Hans L. Bodlaender and
Jitender S. Deogun and
Klaus Jansen and
Ton Kloks and
Dieter Kratsch and
Haiko M{\"{u}}ller and
Zsolt Tuza},
title = {Rankings of Graphs},
journal = {{SIAM} J. Discret. Math.},
volume = {11},
number = {1},
pages = {168--181},
year = {1998},
url = {https://doi.org/10.1137/S0895480195282550},
doi = {10.1137/S0895480195282550},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamdm/BodlaenderDJKKMT98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/BrandstadtDCV98,
author = {Andreas Brandst{\"{a}}dt and
Feodor F. Dragan and
Victor Chepoi and
Vitaly I. Voloshin},
title = {Dually Chordal Graphs},
journal = {{SIAM} J. Discret. Math.},
volume = {11},
number = {3},
pages = {437--455},
year = {1998},
url = {https://doi.org/10.1137/S0895480193253415},
doi = {10.1137/S0895480193253415},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/BrandstadtDCV98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/CalkinW98,
author = {Neil J. Calkin and
Herbert S. Wilf},
title = {The Number of Independent Sets in a Grid Graph},
journal = {{SIAM} J. Discret. Math.},
volume = {11},
number = {1},
pages = {54--60},
year = {1998},
url = {https://doi.org/10.1137/S089548019528993X},
doi = {10.1137/S089548019528993X},
timestamp = {Wed, 07 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamdm/CalkinW98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/CaroER98,
author = {Yair Caro and
Mark N. Ellingham and
J. E. Ramey},
title = {Local Structure When All Maximal Independent Sets Have Equal Weight},
journal = {{SIAM} J. Discret. Math.},
volume = {11},
number = {4},
pages = {644--654},
year = {1998},
url = {https://doi.org/10.1137/S0895480196300479},
doi = {10.1137/S0895480196300479},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/CaroER98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/ChenZOS98,
author = {Robert W. Chen and
Alan Zame and
Andrew M. Odlyzko and
Larry A. Shepp},
title = {An Optimal Acceptance Policy for an Urn Scheme},
journal = {{SIAM} J. Discret. Math.},
volume = {11},
number = {2},
pages = {183--195},
year = {1998},
url = {https://doi.org/10.1137/S0895480195282148},
doi = {10.1137/S0895480195282148},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/ChenZOS98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/Chepoi98,
author = {Victor Chepoi},
title = {On Distance-Preserving and Domination Elimination Orderings},
journal = {{SIAM} J. Discret. Math.},
volume = {11},
number = {3},
pages = {414--436},
year = {1998},
url = {https://doi.org/10.1137/S0895480195291230},
doi = {10.1137/S0895480195291230},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/Chepoi98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/ChorS98,
author = {Benny Chor and
Madhu Sudan},
title = {A Geometric Approach to Betweenness},
journal = {{SIAM} J. Discret. Math.},
volume = {11},
number = {4},
pages = {511--523},
year = {1998},
url = {https://doi.org/10.1137/S0895480195296221},
doi = {10.1137/S0895480195296221},
timestamp = {Tue, 14 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/ChorS98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/Collins98,
author = {Karen L. Collins},
title = {Circulants and Sequences},
journal = {{SIAM} J. Discret. Math.},
volume = {11},
number = {2},
pages = {330--339},
year = {1998},
url = {https://doi.org/10.1137/S0895480193252136},
doi = {10.1137/S0895480193252136},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/Collins98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/CzumajGP98,
author = {Artur Czumaj and
Leszek Gasieniec and
Andrzej Pelc},
title = {Time and Cost Trade-Offs in Gossiping},
journal = {{SIAM} J. Discret. Math.},
volume = {11},
number = {3},
pages = {400--413},
year = {1998},
url = {https://doi.org/10.1137/S0895480295292934},
doi = {10.1137/S0895480295292934},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/CzumajGP98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/DeuinekoRW98,
author = {Vladimir G. Deineko and
R{\"{u}}diger Rudolf and
Gerhard J. Woeginger},
title = {Sometimes Travelling is Easy: The Master Tour Problem},
journal = {{SIAM} J. Discret. Math.},
volume = {11},
number = {1},
pages = {81--93},
year = {1998},
url = {https://doi.org/10.1137/S0895480195281878},
doi = {10.1137/S0895480195281878},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/DeuinekoRW98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/EsponaS98,
author = {Margarida Espona and
Oriol Serra},
title = {Cayley Digraphs Based on the de Bruijn Networks},
journal = {{SIAM} J. Discret. Math.},
volume = {11},
number = {2},
pages = {305--317},
year = {1998},
url = {https://doi.org/10.1137/S0895480196288644},
doi = {10.1137/S0895480196288644},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/EsponaS98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/EtzionV98,
author = {Tuvi Etzion and
Alexander Vardy},
title = {On Perfect Codes and Tilings: Problems and Solutions},
journal = {{SIAM} J. Discret. Math.},
volume = {11},
number = {2},
pages = {205--223},
year = {1998},
url = {https://doi.org/10.1137/S0895480196309171},
doi = {10.1137/S0895480196309171},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/EtzionV98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/EvenLR98,
author = {Shimon Even and
Ami Litman and
Arnold L. Rosenberg},
title = {Monochromatic Paths and Triangulated Graphs},
journal = {{SIAM} J. Discret. Math.},
volume = {11},
number = {4},
pages = {546--556},
year = {1998},
url = {https://doi.org/10.1137/S0895480195283336},
doi = {10.1137/S0895480195283336},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/EvenLR98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/FaigleK98,
author = {Ulrich Faigle and
Walter Kern},
title = {Approximate Core Allocation for Binpacking Games},
journal = {{SIAM} J. Discret. Math.},
volume = {11},
number = {3},
pages = {387--399},
year = {1998},
url = {https://doi.org/10.1137/S0895480296308074},
doi = {10.1137/S0895480296308074},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/FaigleK98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/FengKKL98,
author = {Rongquan Feng and
Jin Ho Kwak and
Juyoung Kim and
Jaeun Lee},
title = {Isomorphism Classes of Concrete Graph Coverings},
journal = {{SIAM} J. Discret. Math.},
volume = {11},
number = {2},
pages = {265--272},
year = {1998},
url = {https://doi.org/10.1137/S089548019630443X},
doi = {10.1137/S089548019630443X},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/FengKKL98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/FiducciaFZ98,
author = {Charles M. Fiduccia and
Rodney W. Forcade and
Jennifer S. Zito},
title = {Geometry and Diameter Bounds of Directed Cayley Graphs of Abelian
Groups},
journal = {{SIAM} J. Discret. Math.},
volume = {11},
number = {1},
pages = {157--167},
year = {1998},
url = {https://doi.org/10.1137/S0895480195286456},
doi = {10.1137/S0895480195286456},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/FiducciaFZ98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/FishburnKLW98,
author = {Peter C. Fishburn and
J. H. Kim and
J. C. Lagarias and
Paul E. Wright},
title = {Interference-Minimizing Colorings of Regular Graphs},
journal = {{SIAM} J. Discret. Math.},
volume = {11},
number = {1},
pages = {15--40},
year = {1998},
url = {https://doi.org/10.1137/S089548019427545X},
doi = {10.1137/S089548019427545X},
timestamp = {Tue, 23 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamdm/FishburnKLW98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/FrankIN98,
author = {Andr{\'{a}}s Frank and
Toshihide Ibaraki and
Hiroshi Nagamochi},
title = {Two Arc-Disjoint Paths in Eulerian Digraphs},
journal = {{SIAM} J. Discret. Math.},
volume = {11},
number = {4},
pages = {557--589},
year = {1998},
url = {https://doi.org/10.1137/S0895480196304970},
doi = {10.1137/S0895480196304970},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/FrankIN98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/Galeana-SanchezL98,
author = {Hortensia Galeana{-}S{\'{a}}nchez and
Xueliang Li},
title = {Semikernels and (\emph{k, l})-Kernels in Digraphs},
journal = {{SIAM} J. Discret. Math.},
volume = {11},
number = {2},
pages = {340--346},
year = {1998},
url = {https://doi.org/10.1137/S0895480195291370},
doi = {10.1137/S0895480195291370},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/Galeana-SanchezL98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/GerardsS98,
author = {A. M. H. Gerards and
F. Bruce Shepherd},
title = {The Graphs with All Subgraphs T-Perfect},
journal = {{SIAM} J. Discret. Math.},
volume = {11},
number = {4},
pages = {524--545},
year = {1998},
url = {https://doi.org/10.1137/S0895480196306361},
doi = {10.1137/S0895480196306361},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/GerardsS98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/GimbelT98,
author = {John G. Gimbel and
Ann N. Trenk},
title = {On the Weakness of an Ordered Set},
journal = {{SIAM} J. Discret. Math.},
volume = {11},
number = {4},
pages = {655--663},
year = {1998},
url = {https://doi.org/10.1137/S0895480197319628},
doi = {10.1137/S0895480197319628},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/GimbelT98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/GuanZ98,
author = {D. J. Guan and
Xuding Zhu},
title = {Multiple Capacity Vehicle Routing on Paths},
journal = {{SIAM} J. Discret. Math.},
volume = {11},
number = {4},
pages = {590--602},
year = {1998},
url = {https://doi.org/10.1137/S0895480197319951},
doi = {10.1137/S0895480197319951},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/GuanZ98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/Guichard98,
author = {David R. Guichard},
title = {Competition Graphs of Hamiltonian Digraphs},
journal = {{SIAM} J. Discret. Math.},
volume = {11},
number = {1},
pages = {128--134},
year = {1998},
url = {https://doi.org/10.1137/S089548019629735X},
doi = {10.1137/S089548019629735X},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/Guichard98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/Han98,
author = {Yunghsiang S. Han},
title = {A New Decoding Algorithm for Complete Decoding of Linear Block Codes},
journal = {{SIAM} J. Discret. Math.},
volume = {11},
number = {4},
pages = {664--671},
year = {1998},
url = {https://doi.org/10.1137/S0895480197323974},
doi = {10.1137/S0895480197323974},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/Han98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/Hofmeister98,
author = {Michael Hofmeister},
title = {A Note on Counting Connected Graph Covering Projections},
journal = {{SIAM} J. Discret. Math.},
volume = {11},
number = {2},
pages = {286--292},
year = {1998},
url = {https://doi.org/10.1137/S0895480195293873},
doi = {10.1137/S0895480195293873},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/Hofmeister98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/HwangC98,
author = {Shiow{-}Fen Hwang and
Gerard J. Chang},
title = {k-Neighborhood-Covering and -Independence Problems for Chordal Graphs},
journal = {{SIAM} J. Discret. Math.},
volume = {11},
number = {4},
pages = {633--643},
year = {1998},
url = {https://doi.org/10.1137/S0895480193244322},
doi = {10.1137/S0895480193244322},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/HwangC98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/KleinbergG98,
author = {Jon M. Kleinberg and
Michel X. Goemans},
title = {The Lov{\'{a}}sz Theta Function and a Semidefinite Programming
Relaxation of Vertex Cover},
journal = {{SIAM} J. Discret. Math.},
volume = {11},
number = {2},
pages = {196--204},
year = {1998},
url = {https://doi.org/10.1137/S0895480195287541},
doi = {10.1137/S0895480195287541},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/KleinbergG98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/Kochol98,
author = {Martin Kochol},
title = {Partial Intersection Theorem and Flows in Abstract Networks},
journal = {{SIAM} J. Discret. Math.},
volume = {11},
number = {3},
pages = {468--486},
year = {1998},
url = {https://doi.org/10.1137/S0895480195295987},
doi = {10.1137/S0895480195295987},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/Kochol98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/KomlosMS98,
author = {J{\'{a}}nos Koml{\'{o}}s and
Yuan Ma and
Endre Szemer{\'{e}}di},
title = {Matching Nuts and Bolts in O(n log n) Time},
journal = {{SIAM} J. Discret. Math.},
volume = {11},
number = {3},
pages = {347--372},
year = {1998},
url = {https://doi.org/10.1137/S0895480196304982},
doi = {10.1137/S0895480196304982},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/KomlosMS98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/KushilevitzR98,
author = {Eyal Kushilevitz and
Adi Ros{\'{e}}n},
title = {A Randomness-Rounds Tradeoff in Private Computation},
journal = {{SIAM} J. Discret. Math.},
volume = {11},
number = {1},
pages = {61--80},
year = {1998},
url = {https://doi.org/10.1137/S089548019427634X},
doi = {10.1137/S089548019427634X},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/KushilevitzR98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/KwakCL98,
author = {Jin Ho Kwak and
Jang{-}Ho Chun and
Jaeun Lee},
title = {Enumeration of Regular Graph Coverings Having Finite Abelian Covering
Transformation Groups},
journal = {{SIAM} J. Discret. Math.},
volume = {11},
number = {2},
pages = {273--285},
year = {1998},
url = {https://doi.org/10.1137/S0895480196304428},
doi = {10.1137/S0895480196304428},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/KwakCL98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/Lenart98,
author = {Cristian Lenart},
title = {A Generalized Distance in Graphs and Centered Partitions},
journal = {{SIAM} J. Discret. Math.},
volume = {11},
number = {2},
pages = {293--304},
year = {1998},
url = {https://doi.org/10.1137/S089548019426303X},
doi = {10.1137/S089548019426303X},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/Lenart98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/Lichtner98,
author = {Jonathan Lichtner},
title = {Iterating an alpha-ary Gray Code},
journal = {{SIAM} J. Discret. Math.},
volume = {11},
number = {3},
pages = {381--386},
year = {1998},
url = {https://doi.org/10.1137/S0895480196308736},
doi = {10.1137/S0895480196308736},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/Lichtner98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/Luczak98,
author = {Tomasz Luczak},
title = {A Greedy Algorithm Estimating the Height of Random Trees},
journal = {{SIAM} J. Discret. Math.},
volume = {11},
number = {2},
pages = {318--329},
year = {1998},
url = {https://doi.org/10.1137/S0895480193258960},
doi = {10.1137/S0895480193258960},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamdm/Luczak98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/MitchellP98,
author = {Chris J. Mitchell and
Kenneth G. Paterson},
title = {Perfect Factors from Cyclic Codes and Interleaving},
journal = {{SIAM} J. Discret. Math.},
volume = {11},
number = {2},
pages = {241--264},
year = {1998},
url = {https://doi.org/10.1137/S089548019630649X},
doi = {10.1137/S089548019630649X},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/MitchellP98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/PadroMM98,
author = {Carles Padr{\'{o}} and
Paz Morillo and
Xavier Mu{\~{n}}oz},
title = {Fault-Tolerant Fixed Routings in Some Families of Digraphs},
journal = {{SIAM} J. Discret. Math.},
volume = {11},
number = {3},
pages = {501--509},
year = {1998},
url = {https://doi.org/10.1137/S0895480195280940},
doi = {10.1137/S0895480195280940},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamdm/PadroMM98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/PaturiZ98,
author = {Ramamohan Paturi and
Francis Zane},
title = {Dimension of Projections in Boolean Functions},
journal = {{SIAM} J. Discret. Math.},
volume = {11},
number = {4},
pages = {624--632},
year = {1998},
url = {https://doi.org/10.1137/S0895480197318313},
doi = {10.1137/S0895480197318313},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/PaturiZ98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/PoonenR98,
author = {Bjorn Poonen and
Michael Rubinstein},
title = {The Number of Intersection Points Made by the Diagonals of a Regular
Polygon},
journal = {{SIAM} J. Discret. Math.},
volume = {11},
number = {1},
pages = {135--156},
year = {1998},
url = {https://doi.org/10.1137/S0895480195281246},
doi = {10.1137/S0895480195281246},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/PoonenR98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/ProskurowskiRS98,
author = {Andrzej Proskurowski and
Frank Ruskey and
Malcolm Smith},
title = {Analysis of Algorithms for Listing Equivalence Classes of \emph{k}-ary
Strings},
journal = {{SIAM} J. Discret. Math.},
volume = {11},
number = {1},
pages = {94--109},
year = {1998},
url = {https://doi.org/10.1137/S0895480192234009},
doi = {10.1137/S0895480192234009},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/ProskurowskiRS98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/Ramras98,
author = {Mark Ramras},
title = {Congestion-free Routings of Linear Complement Permutations},
journal = {{SIAM} J. Discret. Math.},
volume = {11},
number = {3},
pages = {487--500},
year = {1998},
url = {https://doi.org/10.1137/S0895480196301461},
doi = {10.1137/S0895480196301461},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/Ramras98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/Riordan98,
author = {Oliver Riordan},
title = {An Ordering on the Even Discrete Torus},
journal = {{SIAM} J. Discret. Math.},
volume = {11},
number = {1},
pages = {110--127},
year = {1998},
url = {https://doi.org/10.1137/S0895480194278234},
doi = {10.1137/S0895480194278234},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/Riordan98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/RispoliC98,
author = {Fred J. Rispoli and
Steven Cosares},
title = {A Bound of 4 for the Diameter of the Symmetric Traveling Salesman
Polytope},
journal = {{SIAM} J. Discret. Math.},
volume = {11},
number = {3},
pages = {373--380},
year = {1998},
url = {https://doi.org/10.1137/S0895480196312462},
doi = {10.1137/S0895480196312462},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/RispoliC98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/RubinovT98,
author = {Anatoly R. Rubinov and
Vadim G. Timkovsky},
title = {String Noninclusion Optimization Problems},
journal = {{SIAM} J. Discret. Math.},
volume = {11},
number = {3},
pages = {456--467},
year = {1998},
url = {https://doi.org/10.1137/S0895480192234277},
doi = {10.1137/S0895480192234277},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/RubinovT98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/SchrijverSW98,
author = {Alexander Schrijver and
Paul D. Seymour and
Peter Winkler},
title = {The Ring Loading Problem},
journal = {{SIAM} J. Discret. Math.},
volume = {11},
number = {1},
pages = {1--14},
year = {1998},
url = {https://doi.org/10.1137/S0895480195294994},
doi = {10.1137/S0895480195294994},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/SchrijverSW98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/StinsonW98,
author = {Douglas R. Stinson and
Ruizhong Wei},
title = {Combinatorial Properties and Constructions of Traceability Schemes
and Frameproof Codes},
journal = {{SIAM} J. Discret. Math.},
volume = {11},
number = {1},
pages = {41--53},
year = {1998},
url = {https://doi.org/10.1137/S0895480196304246},
doi = {10.1137/S0895480196304246},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/StinsonW98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
retrieved on 2024-04-25 13:02 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:
