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/siamdm8.bht:"
download as .bib file
@article{DBLP:journals/siamdm/AlonsoRS95,
author = {Laurent Alonso and
Edward M. Reingold and
Ren{\'{e}} Schott},
title = {Multidimensional Divide-and-Conquer Maximin Recurrences},
journal = {{SIAM} J. Discret. Math.},
volume = {8},
number = {3},
pages = {428--447},
year = {1995},
url = {https://doi.org/10.1137/S0895480192232862},
doi = {10.1137/S0895480192232862},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/AlonsoRS95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/AlthoferL95,
author = {Ingo Alth{\"{o}}fer and
Imre Leader},
title = {Correlation of Boolean Functions and Pathology in Recursion Trees},
journal = {{SIAM} J. Discret. Math.},
volume = {8},
number = {4},
pages = {526--535},
year = {1995},
url = {https://doi.org/10.1137/S0895480192240470},
doi = {10.1137/S0895480192240470},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/AlthoferL95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/AndreaeB95,
author = {Thomas Andreae and
Hans{-}J{\"{u}}rgen Bandelt},
title = {Performance Guarantees for Approximation Algorithms Depending on Parametrized
Triangle Inequalities},
journal = {{SIAM} J. Discret. Math.},
volume = {8},
number = {1},
pages = {1--16},
year = {1995},
url = {https://doi.org/10.1137/S0895480192240226},
doi = {10.1137/S0895480192240226},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/AndreaeB95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/AshleyM95,
author = {Jonathan J. Ashley and
Brian H. Marcus},
title = {Canonical Encoders for Sliding Block Decoders},
journal = {{SIAM} J. Discret. Math.},
volume = {8},
number = {4},
pages = {555--605},
year = {1995},
url = {https://doi.org/10.1137/S0895480193244310},
doi = {10.1137/S0895480193244310},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/AshleyM95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/BandeltS95,
author = {Hans{-}J{\"{u}}rgen Bandelt and
Michael Anthony Steel},
title = {Symmetric Matrices Representable by Weighted Trees Over a Cancellative
Abelian Monoid},
journal = {{SIAM} J. Discret. Math.},
volume = {8},
number = {4},
pages = {517--525},
year = {1995},
url = {https://doi.org/10.1137/S0895480191201759},
doi = {10.1137/S0895480191201759},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/BandeltS95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/Bang-JensenFJ95,
author = {J{\o}rgen Bang{-}Jensen and
Andr{\'{a}}s Frank and
Bill Jackson},
title = {Preserving and Increasing Local Edge-Connectivity in Mixed Graphs},
journal = {{SIAM} J. Discret. Math.},
volume = {8},
number = {2},
pages = {155--178},
year = {1995},
url = {https://doi.org/10.1137/S0036142993226983},
doi = {10.1137/S0036142993226983},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/Bang-JensenFJ95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/Barnes95,
author = {Earl R. Barnes},
title = {An Inequality for Probability Moments with Applications},
journal = {{SIAM} J. Discret. Math.},
volume = {8},
number = {3},
pages = {347--358},
year = {1995},
url = {https://doi.org/10.1137/S0895480191221842},
doi = {10.1137/S0895480191221842},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/Barnes95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/BhattCLR95,
author = {Sandeep N. Bhatt and
Fan R. K. Chung and
Frank Thomson Leighton and
Arnold L. Rosenberg},
title = {Salvage-Embeddings of Complete Trees},
journal = {{SIAM} J. Discret. Math.},
volume = {8},
number = {4},
pages = {617--637},
year = {1995},
url = {https://doi.org/10.1137/S089548019224127X},
doi = {10.1137/S089548019224127X},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/BhattCLR95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/BodlaenderKK95,
author = {Hans L. Bodlaender and
Ton Kloks and
Dieter Kratsch},
title = {Treewidth and Pathwidth of Permutation Graphs},
journal = {{SIAM} J. Discret. Math.},
volume = {8},
number = {4},
pages = {606--616},
year = {1995},
url = {https://doi.org/10.1137/S089548019223992X},
doi = {10.1137/S089548019223992X},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/BodlaenderKK95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/BokowskiS95,
author = {J{\"{u}}rgen Bokowski and
Peter Schuchert},
title = {Altshuler's Sphere m\({}^{\mbox{9}}\)\({}_{\mbox{963}}\) Revisited},
journal = {{SIAM} J. Discret. Math.},
volume = {8},
number = {4},
pages = {670--677},
year = {1995},
url = {https://doi.org/10.1137/S0895480193250940},
doi = {10.1137/S0895480193250940},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/BokowskiS95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/BouchetC95,
author = {Andr{\'{e}} Bouchet and
William H. Cunningham},
title = {Delta-Matroids, Jump Systems, and Bisubmodular Polyhedra},
journal = {{SIAM} J. Discret. Math.},
volume = {8},
number = {1},
pages = {17--32},
year = {1995},
url = {https://doi.org/10.1137/S0895480191222926},
doi = {10.1137/S0895480191222926},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/BouchetC95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/CaiC95,
author = {Leizhen Cai and
Derek G. Corneil},
title = {Tree Spanners},
journal = {{SIAM} J. Discret. Math.},
volume = {8},
number = {3},
pages = {359--387},
year = {1995},
url = {https://doi.org/10.1137/S0895480192237403},
doi = {10.1137/S0895480192237403},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/CaiC95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/CarlsonCM95,
author = {Bradley S. Carlson and
C. Y. Roger Chen and
Dikran S. Meliksetian},
title = {Dual Eulerian Properties of Plane Multigraphs},
journal = {{SIAM} J. Discret. Math.},
volume = {8},
number = {1},
pages = {33--50},
year = {1995},
url = {https://doi.org/10.1137/S0895480192238172},
doi = {10.1137/S0895480192238172},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/CarlsonCM95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/Franzblau95,
author = {Deborah S. Franzblau},
title = {Combinatorial Algorithm for a Lower Bound on Frame Rigidity},
journal = {{SIAM} J. Discret. Math.},
volume = {8},
number = {3},
pages = {388--400},
year = {1995},
url = {https://doi.org/10.1137/S0895480191202558},
doi = {10.1137/S0895480191202558},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/Franzblau95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/FraughnaughLMMP95,
author = {Kathryn Fraughnaugh and
J. Richard Lundgren and
Sarah K. Merz and
John S. Maybee and
Norman J. Pullman},
title = {Competition Graphs of Strongly Connected and Hamiltonian Digraphs},
journal = {{SIAM} J. Discret. Math.},
volume = {8},
number = {2},
pages = {179--185},
year = {1995},
url = {https://doi.org/10.1137/S0895480191197234},
doi = {10.1137/S0895480191197234},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/FraughnaughLMMP95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/GonzalezL95,
author = {Jaime Gonzalez and
Osvaldo Landaeta},
title = {A Competitive Strong Spanning Tree Algorithm for the Maximum Bipartite
Matching Problem},
journal = {{SIAM} J. Discret. Math.},
volume = {8},
number = {2},
pages = {186--195},
year = {1995},
url = {https://doi.org/10.1137/S0895480192228966},
doi = {10.1137/S0895480192228966},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/GonzalezL95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/GreenbergS95,
author = {Ronald I. Greenberg and
Jau{-}Der Shih},
title = {Feasible Offset and Optimal Offset for General Single-Layer Channel
Routing},
journal = {{SIAM} J. Discret. Math.},
volume = {8},
number = {4},
pages = {543--554},
year = {1995},
url = {https://doi.org/10.1137/S0895480193251866},
doi = {10.1137/S0895480193251866},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/GreenbergS95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/HamalainenHLO95,
author = {Heikki O. H{\"{a}}m{\"{a}}l{\"{a}}inen and
Iiro S. Honkala and
Simon Litsyn and
Patric R. J. {\"{O}}sterg{\aa}rd},
title = {Bounds for Binary Codes That Are Multiple Coverings of the Farthest-Off
Points},
journal = {{SIAM} J. Discret. Math.},
volume = {8},
number = {2},
pages = {196--207},
year = {1995},
url = {https://doi.org/10.1137/S0895480193252100},
doi = {10.1137/S0895480193252100},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/HamalainenHLO95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/HellZ95,
author = {Pavol Hell and
Xuding Zhu},
title = {The Existence of Homomorphisms to Oriented Cycles},
journal = {{SIAM} J. Discret. Math.},
volume = {8},
number = {2},
pages = {208--222},
year = {1995},
url = {https://doi.org/10.1137/S0895480192239992},
doi = {10.1137/S0895480192239992},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/HellZ95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/Hofmeister95,
author = {Michael Hofmeister},
title = {Enumeration of Concrete Regular Covering Projections},
journal = {{SIAM} J. Discret. Math.},
volume = {8},
number = {1},
pages = {51--61},
year = {1995},
url = {https://doi.org/10.1137/S0895480193248186},
doi = {10.1137/S0895480193248186},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/Hofmeister95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/JamisonO95,
author = {Beverly Jamison and
Stephan Olariu},
title = {P-Components and the Homogeneous Decomposition of Graphs},
journal = {{SIAM} J. Discret. Math.},
volume = {8},
number = {3},
pages = {448--463},
year = {1995},
url = {https://doi.org/10.1137/S0895480191196812},
doi = {10.1137/S0895480191196812},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/JamisonO95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/Jevtic95,
author = {Dusan B. Jevtic},
title = {On Families of Sets of Integral Vectors Whose Representatives form
Sum-Distinct Sets},
journal = {{SIAM} J. Discret. Math.},
volume = {8},
number = {4},
pages = {652--660},
year = {1995},
url = {https://doi.org/10.1137/S0895480194265623},
doi = {10.1137/S0895480194265623},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/Jevtic95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/Jia95,
author = {Xing{-}De Jia},
title = {Extremal Cayley Digraphs of Finite Cyclic Groups},
journal = {{SIAM} J. Discret. Math.},
volume = {8},
number = {1},
pages = {62--75},
year = {1995},
url = {https://doi.org/10.1137/S0895480192242638},
doi = {10.1137/S0895480192242638},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/Jia95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/KarchmerKN95,
author = {Mauricio Karchmer and
Eyal Kushilevitz and
Noam Nisan},
title = {Fractional Covers and Communication Complexity},
journal = {{SIAM} J. Discret. Math.},
volume = {8},
number = {1},
pages = {76--92},
year = {1995},
url = {https://doi.org/10.1137/S0895480192238482},
doi = {10.1137/S0895480192238482},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/KarchmerKN95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/KiersteadPT95,
author = {Henry A. Kierstead and
Stephen G. Penrice and
William T. Trotter},
title = {On-Line and First-Fit Coloring of Graphs That Do Not Induce P\({}_{\mbox{5}}\)},
journal = {{SIAM} J. Discret. Math.},
volume = {8},
number = {4},
pages = {485--498},
year = {1995},
url = {https://doi.org/10.1137/S0895480191218861},
doi = {10.1137/S0895480191218861},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/KiersteadPT95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/KlaweM95,
author = {Maria M. Klawe and
Brendan Mumey},
title = {Upper and Lower Bounds on Constructing Alphabetic Binary Trees},
journal = {{SIAM} J. Discret. Math.},
volume = {8},
number = {4},
pages = {638--651},
year = {1995},
url = {https://doi.org/10.1137/S0895480193256651},
doi = {10.1137/S0895480193256651},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/KlaweM95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/Knuth95,
author = {Donald E. Knuth},
title = {Two-Way Rounding},
journal = {{SIAM} J. Discret. Math.},
volume = {8},
number = {2},
pages = {281--290},
year = {1995},
url = {https://doi.org/10.1137/S0895480194264757},
doi = {10.1137/S0895480194264757},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/Knuth95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/KortsarzP95,
author = {Guy Kortsarz and
David Peleg},
title = {Approximation Algorithms for Minimum-Time Broadcast},
journal = {{SIAM} J. Discret. Math.},
volume = {8},
number = {3},
pages = {401--427},
year = {1995},
url = {https://doi.org/10.1137/S0895480193245923},
doi = {10.1137/S0895480193245923},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/KortsarzP95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/KrishnamurtiN95,
author = {Ramesh Krishnamurti and
Bhagirath Narahari},
title = {An Approximation Algorithm for Preemptive Scheduling on Parallel-Task
Systems},
journal = {{SIAM} J. Discret. Math.},
volume = {8},
number = {4},
pages = {661--669},
year = {1995},
url = {https://doi.org/10.1137/S0895480191221829},
doi = {10.1137/S0895480191221829},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/KrishnamurtiN95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/KushilevitzMR95,
author = {Eyal Kushilevitz and
Yishay Mansour and
Michael O. Rabin},
title = {On Lotteries with Unique Winners},
journal = {{SIAM} J. Discret. Math.},
volume = {8},
number = {1},
pages = {93--98},
year = {1995},
url = {https://doi.org/10.1137/S0895480194262795},
doi = {10.1137/S0895480194262795},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/KushilevitzMR95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/Lee95,
author = {Hanif D. Sherali and
Youngho Lee},
title = {Sequential and Simultaneous Liftings of Minimal Cover Inequalities
for Generalized Upper Bound Constrained Knapsack Polytopes},
journal = {{SIAM} J. Discret. Math.},
volume = {8},
number = {1},
pages = {133--153},
year = {1995},
url = {https://doi.org/10.1137/S0895480192230607},
doi = {10.1137/S0895480192230607},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/Lee95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/LiestmanS95,
author = {Arthur L. Liestman and
Thomas C. Shermer},
title = {Degree-Constrained Network Spanners with Nonconstant Delay},
journal = {{SIAM} J. Discret. Math.},
volume = {8},
number = {2},
pages = {291--321},
year = {1995},
url = {https://doi.org/10.1137/S0895480193251635},
doi = {10.1137/S0895480193251635},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/LiestmanS95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/LinS95,
author = {Yaw{-}Ling Lin and
Steven Skiena},
title = {Algorithms for Square Roots of Graphs},
journal = {{SIAM} J. Discret. Math.},
volume = {8},
number = {1},
pages = {99--118},
year = {1995},
url = {https://doi.org/10.1137/S089548019120016X},
doi = {10.1137/S089548019120016X},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/LinS95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/LovaszNNW95,
author = {L{\'{a}}szl{\'{o}} Lov{\'{a}}sz and
Moni Naor and
Ilan Newman and
Avi Wigderson},
title = {Search Problems in the Decision Tree Model},
journal = {{SIAM} J. Discret. Math.},
volume = {8},
number = {1},
pages = {119--132},
year = {1995},
url = {https://doi.org/10.1137/S0895480192233867},
doi = {10.1137/S0895480192233867},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/LovaszNNW95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/McMorrisP95,
author = {Fred R. McMorris and
Robert C. Powers},
title = {The Median Procedure in a Formal Theory of Consensus},
journal = {{SIAM} J. Discret. Math.},
volume = {8},
number = {4},
pages = {507--516},
year = {1995},
url = {https://doi.org/10.1137/S0895480193256900},
doi = {10.1137/S0895480193256900},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/McMorrisP95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/NewmanW95,
author = {Ilan Newman and
Avi Wigderson},
title = {Lower Bounds on Formula Size of Boolean Functions Using Hypergraph
Entropy},
journal = {{SIAM} J. Discret. Math.},
volume = {8},
number = {4},
pages = {536--542},
year = {1995},
url = {https://doi.org/10.1137/S0895480190283595},
doi = {10.1137/S0895480190283595},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/NewmanW95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/Pippenger95,
author = {Nicholas Pippenger},
title = {Analysis of a Recurrence Arising from a Construction for Nonblocking
Networks},
journal = {{SIAM} J. Discret. Math.},
volume = {8},
number = {2},
pages = {322--345},
year = {1995},
url = {https://doi.org/10.1137/S0895480193255694},
doi = {10.1137/S0895480193255694},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/Pippenger95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/PitassiU95,
author = {Toniann Pitassi and
Alasdair Urquhart},
title = {The Complexity of the Hajos Calculus},
journal = {{SIAM} J. Discret. Math.},
volume = {8},
number = {3},
pages = {464--483},
year = {1995},
url = {https://doi.org/10.1137/S089548019224024X},
doi = {10.1137/S089548019224024X},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/PitassiU95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/SchmidtSS95,
author = {Jeanette P. Schmidt and
Alan Siegel and
Aravind Srinivasan},
title = {Chernoff-Hoeffding Bounds for Applications with Limited Independence},
journal = {{SIAM} J. Discret. Math.},
volume = {8},
number = {2},
pages = {223--250},
year = {1995},
url = {https://doi.org/10.1137/S089548019223872X},
doi = {10.1137/S089548019223872X},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/SchmidtSS95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/SnyderS95,
author = {Timothy Law Snyder and
J. Michael Steele},
title = {Equidistribution in All Dimensions of Worst-Case Point Sets for the
Traveling Salesman Problem},
journal = {{SIAM} J. Discret. Math.},
volume = {8},
number = {4},
pages = {678--683},
year = {1995},
url = {https://doi.org/10.1137/S0895480194262710},
doi = {10.1137/S0895480194262710},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/SnyderS95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/Spinrad95,
author = {Jeremy P. Spinrad},
title = {Nonredundant 1's in Gamma-Free Matrices},
journal = {{SIAM} J. Discret. Math.},
volume = {8},
number = {2},
pages = {251--257},
year = {1995},
url = {https://doi.org/10.1137/S0895480191197210},
doi = {10.1137/S0895480191197210},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/Spinrad95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/WhittleseyGM95,
author = {Marshall A. Whittlesey and
John P. Georges and
David W. Mauro},
title = {On the lambda-Number of Q\({}_{\mbox{n}}\) and Related Graphs},
journal = {{SIAM} J. Discret. Math.},
volume = {8},
number = {4},
pages = {499--506},
year = {1995},
url = {https://doi.org/10.1137/S0895480192242821},
doi = {10.1137/S0895480192242821},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/WhittleseyGM95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/YeapS95,
author = {Gary K. H. Yeap and
Majid Sarrafzadeh},
title = {Sliceable Floorplanning by Graph Dualization},
journal = {{SIAM} J. Discret. Math.},
volume = {8},
number = {2},
pages = {258--280},
year = {1995},
url = {https://doi.org/10.1137/S0895480191266700},
doi = {10.1137/S0895480191266700},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/YeapS95.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-24 11:58 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:
