:facetid:toc:\"db/journals/dam/dam156.bht\"OK:facetid:toc:db/journals/dam/dam156.bhtR. Julian R. AbelFrank E. BennettSuper-simple Steiner pentagon systems.Discret. Appl. Math.1565780-7932008Journal Articlesopenjournals/dam/AbelB0810.1016/J.DAM.2007.08.016https://doi.org/10.1016/j.dam.2007.08.016https://dblp.org/rec/journals/dam/AbelB08URL#5254488R. Julian R. AbelFrank E. BennettGennian GeExistence of directed triplewhist tournaments with the three person property 3PDTWh(v).Discret. Appl. Math.156142655-26652008Journal Articlesopenjournals/dam/AbelBG0810.1016/J.DAM.2007.10.027https://doi.org/10.1016/j.dam.2007.10.027https://dblp.org/rec/journals/dam/AbelBG08URL#5254489Warren P. AdamsPaul T. HadavasA network approach for specially structured linear programs arising in 0-1 quadratic optimization.Discret. Appl. Math.156112142-21652008Journal Articlesopenjournals/dam/AdamsH0810.1016/J.DAM.2007.08.035https://doi.org/10.1016/j.dam.2007.08.035https://dblp.org/rec/journals/dam/AdamsH08URL#5254490Louigi Addario-BerryKetan DalalBruce A. ReedDegree constrained subgraphs.Discret. Appl. Math.15671168-11742008Journal Articlesopenjournals/dam/Addario-BerryDR0810.1016/J.DAM.2007.05.059https://doi.org/10.1016/j.dam.2007.05.059https://dblp.org/rec/journals/dam/Addario-BerryDR08URL#5254491Jan AdemYves CramaWilly GochetFrits C. R. SpieksmaCounting and enumerating aggregate classifiers.Discret. Appl. Math.156132459-24682008Journal Articlesopenjournals/dam/AdemCGS0810.1016/J.DAM.2008.01.017https://doi.org/10.1016/j.dam.2008.01.017https://dblp.org/rec/journals/dam/AdemCGS08URL#5254492Pankaj K. AgarwalFerran HurtadoGodfried T. ToussaintJoan TriasOn polyhedra induced by point sets in space.Discret. Appl. Math.156142-542008Journal Articlesopenjournals/dam/AgarwalHTT0810.1016/J.DAM.2007.08.033https://doi.org/10.1016/j.dam.2007.08.033https://dblp.org/rec/journals/dam/AgarwalHTT08URL#5254493Geir AgnarssonÁgúst S. EgilssonMagnús M. HalldórssonVertex coloring acyclic digraphs and their corresponding hypergraphs.Discret. Appl. Math.156101918-19282008Journal Articlesopenjournals/dam/AgnarssonEH0810.1016/J.DAM.2007.07.022https://doi.org/10.1016/j.dam.2007.07.022https://dblp.org/rec/journals/dam/AgnarssonEH08URL#5254494Rudolf AhlswedePreface.Discret. Appl. Math.15691343-13442008Journal Articlesopenjournals/dam/Ahlswede0810.1016/J.DAM.2007.10.004https://doi.org/10.1016/j.dam.2007.10.004https://dblp.org/rec/journals/dam/Ahlswede08URL#5254495Rudolf AhlswedeGeneral theory of information transfer: Updated.Discret. Appl. Math.15691348-13882008Journal Articlesopenjournals/dam/Ahlswede08a10.1016/J.DAM.2007.07.007https://doi.org/10.1016/j.dam.2007.07.007https://dblp.org/rec/journals/dam/Ahlswede08aURL#5254496Rudolf AhlswedeRatewise-optimal non-sequential search strategies under constraints on the tests.Discret. Appl. Math.15691431-14432008Journal Articlesopenjournals/dam/Ahlswede08b10.1016/J.DAM.2006.06.013https://doi.org/10.1016/j.dam.2006.06.013https://dblp.org/rec/journals/dam/Ahlswede08bURL#5254497Rudolf AhlswedeHarout K. AydinianOn diagnosability of large multiprocessor networks.Discret. Appl. Math.156183464-34742008Journal Articlesopenjournals/dam/AhlswedeA0810.1016/J.DAM.2008.02.001https://doi.org/10.1016/j.dam.2008.02.001https://dblp.org/rec/journals/dam/AhlswedeA08URL#5254498Rudolf AhlswedeVladimir M. BlinovskyMultiple packing in sum-type metric spaces.Discret. Appl. Math.15691469-14772008Journal Articlesopenjournals/dam/AhlswedeB0810.1016/J.DAM.2007.07.012https://doi.org/10.1016/j.dam.2007.07.012https://dblp.org/rec/journals/dam/AhlswedeB08URL#5254499Rudolf AhlswedeBernhard BalkenholChristian DeppeHaik MashurianT. PartnerT-shift synchronization codes.Discret. Appl. Math.15691461-14682008Journal Articlesopenjournals/dam/AhlswedeBDMP0810.1016/J.DAM.2007.06.020https://doi.org/10.1016/j.dam.2007.06.020https://dblp.org/rec/journals/dam/AhlswedeBDMP08URL#5254500Rudolf AhlswedeFerdinando CicaleseChristian DeppeSearching with lies under error cost constraints.Discret. Appl. Math.15691444-14602008Journal Articlesopenjournals/dam/AhlswedeCD0810.1016/J.DAM.2007.04.033https://doi.org/10.1016/j.dam.2007.04.033https://dblp.org/rec/journals/dam/AhlswedeCD08URL#5254501Rudolf AhlswedeJulien CassaigneAndrás SárközyOn the correlation of binary sequences.Discret. Appl. Math.15691478-14872008Journal Articlesopenjournals/dam/AhlswedeCS0810.1016/J.DAM.2006.11.021https://doi.org/10.1016/j.dam.2006.11.021https://dblp.org/rec/journals/dam/AhlswedeCS08URL#5254502Gabriela AlexeSorin AlexePeter L. HammerAlexander KoganComprehensive vs. comprehensible classifiers in logical analysis of data.Discret. Appl. Math.1566870-8822008Journal Articlesopenjournals/dam/AlexeAHK0810.1016/J.DAM.2005.02.035https://doi.org/10.1016/j.dam.2005.02.035https://dblp.org/rec/journals/dam/AlexeAHK08URL#5254503Carlos Eduardo Rodrigues AlvesE. N. CáceresSiang Wun SongAn all-substrings common subsequence algorithm.Discret. Appl. Math.15671025-10352008Journal Articlesopenjournals/dam/AlvesCS0810.1016/J.DAM.2007.05.056https://doi.org/10.1016/j.dam.2007.05.056https://dblp.org/rec/journals/dam/AlvesCS08URL#5254504S. AmghibechOn the discrete version of Picone's identity.Discret. Appl. Math.15611-102008Journal Articlesopenjournals/dam/Amghibech0810.1016/J.DAM.2007.05.013https://doi.org/10.1016/j.dam.2007.05.013https://dblp.org/rec/journals/dam/Amghibech08URL#5254505Le Thi Hoai AnPham Dinh TaoA continuous approach for the concave cost supply problem via DC programming and DCA.Discret. Appl. Math.1563325-3382008Journal Articlesopenjournals/dam/AnT0810.1016/J.DAM.2007.03.024https://doi.org/10.1016/j.dam.2007.03.024https://dblp.org/rec/journals/dam/AnT08URL#5254506Martin AnthonyAspects of discrete mathematics and probability in the theory of machine learning.Discret. Appl. Math.1566883-9022008Journal Articlesopenjournals/dam/Anthony0810.1016/J.DAM.2007.05.040https://doi.org/10.1016/j.dam.2007.05.040https://dblp.org/rec/journals/dam/Anthony08URL#5254507Martin AnthonyEndre BorosAlexander KoganPreface.Discret. Appl. Math.15668232008Journal Articlesopenjournals/dam/AnthonyBK0810.1016/J.DAM.2007.10.002https://doi.org/10.1016/j.dam.2007.10.002https://dblp.org/rec/journals/dam/AnthonyBK08URL#5254508Mustapha AouchicheGunnar BrinkmannPierre HansenVariable neighborhood search for extremal graphs. 21. Conjectures and results about the independence number.Discret. Appl. Math.156132530-25422008Journal Articlesopenjournals/dam/AouchicheBH0810.1016/J.DAM.2008.03.011https://doi.org/10.1016/j.dam.2008.03.011https://dblp.org/rec/journals/dam/AouchicheBH08URL#5254509Alberto ApostolicoRaffaele GiancarloPeriodicity and repetitions in parameterized strings.Discret. Appl. Math.15691389-13982008Journal Articlesopenjournals/dam/ApostolicoG0810.1016/J.DAM.2006.11.017https://doi.org/10.1016/j.dam.2006.11.017https://dblp.org/rec/journals/dam/ApostolicoG08URL#5254510Harout K. AydinianLevon H. Khachatrian: 1954-2002.Discret. Appl. Math.15691346-13472008Journal Articlesopenjournals/dam/Aydinian0810.1016/J.DAM.2007.10.001https://doi.org/10.1016/j.dam.2007.10.001https://dblp.org/rec/journals/dam/Aydinian08URL#5254511Kannan BalakrishnanManoj ChangatSandi KlavzarThe median function on graphs with bounded profiles.Discret. Appl. Math.156152882-28892008Journal Articlesopenjournals/dam/BalakrishnanCK0810.1016/J.DAM.2007.11.020https://doi.org/10.1016/j.dam.2007.11.020https://dblp.org/rec/journals/dam/BalakrishnanCK08URL#5254512Camino BalbuenaYuqing LinMirka MillerDiameter-sufficient conditions for a graph to be super-restricted connected.Discret. Appl. Math.156152827-28342008Journal Articlesopenjournals/dam/BalbuenaLM0810.1016/J.DAM.2007.11.015https://doi.org/10.1016/j.dam.2007.11.015https://dblp.org/rec/journals/dam/BalbuenaLM08URL#5254513Vojtech BálintA distance approximating trees.Discret. Appl. Math.156142740-27522008Journal Articlesopenjournals/dam/Balint0810.1016/J.DAM.2007.11.012https://doi.org/10.1016/j.dam.2007.11.012https://dblp.org/rec/journals/dam/Balint08URL#5254514József BaloghClifford D. SmythOn the variance of Shannon products of graphs.Discret. Appl. Math.1561110-1182008Journal Articlesopenjournals/dam/BaloghS0810.1016/J.DAM.2007.09.008https://doi.org/10.1016/j.dam.2007.09.008https://dblp.org/rec/journals/dam/BaloghS08URL#5254515Jørgen Bang-JensenAnders YeoThe minimum spanning strong subdigraph problem is fixed parameter tractable.Discret. Appl. Math.156152924-29292008Journal Articlesopenjournals/dam/Bang-JensenY0810.1016/J.DAM.2007.12.003https://doi.org/10.1016/j.dam.2007.12.003https://dblp.org/rec/journals/dam/Bang-JensenY08URL#5254516Rolf BardeliMichael ClausenAndreas RibbrockA covering problem that is easy for trees but I-complete for trivalent graphs.Discret. Appl. Math.156152855-28662008Journal Articlesopenjournals/dam/BardeliCR0810.1016/J.DAM.2007.11.021https://doi.org/10.1016/j.dam.2007.11.021https://dblp.org/rec/journals/dam/BardeliCR08URL#5254517