default search action
Search dblp for Publications
export results for "toc:db/journals/dam/dam42.bht:"
@article{DBLP:journals/dam/BlazewiczKM93, author = {Jacek Blazewicz and Wieslaw Kubiak and Silvano Martello}, title = {Algorithms for Minimizing Maximum Lateness with Unit Length Tasks and Resource Constraints}, journal = {Discret. Appl. Math.}, volume = {42}, number = {2}, pages = {123--138}, year = {1993}, url = {https://doi.org/10.1016/0166-218X(93)90042-M}, doi = {10.1016/0166-218X(93)90042-M}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/BlazewiczKM93.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/ChungHMM93, author = {Sung{-}Jin Chung and Horst W. Hamacher and Francesco Maffioli and Katta G. Murty}, title = {Note on Combinatorial Optimization with Max-Linear Objective Functions}, journal = {Discret. Appl. Math.}, volume = {42}, number = {2}, pages = {139--145}, year = {1993}, url = {https://doi.org/10.1016/0166-218X(93)90043-N}, doi = {10.1016/0166-218X(93)90043-N}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/ChungHMM93.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/DietrichEC93, author = {Brenda L. Dietrich and Laureano F. Escudero and F. Chance}, title = {Efficient Reformulation for 0-1 Programs - Methods and Computational Results}, journal = {Discret. Appl. Math.}, volume = {42}, number = {2}, pages = {147--175}, year = {1993}, url = {https://doi.org/10.1016/0166-218X(93)90044-O}, doi = {10.1016/0166-218X(93)90044-O}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/DietrichEC93.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/Estivill-CastroMW93, author = {Vladimir Estivill{-}Castro and Heikki Mannila and Derick Wood}, title = {Right Invariant Metrics and Measures of Presortedness}, journal = {Discret. Appl. Math.}, volume = {42}, number = {1}, pages = {1--16}, year = {1993}, url = {https://doi.org/10.1016/0166-218X(93)90175-N}, doi = {10.1016/0166-218X(93)90175-N}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/Estivill-CastroMW93.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/GalbiatiM93, author = {Giulia Galbiati and Francesco Maffioli}, title = {Preface}, journal = {Discret. Appl. Math.}, volume = {42}, number = {2}, pages = {119}, year = {1993}, url = {https://doi.org/10.1016/0166-218X(93)90040-U}, doi = {10.1016/0166-218X(93)90040-U}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/GalbiatiM93.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/GalloLP93, author = {Giorgio Gallo and Giustino Longo and Stefano Pallottino}, title = {Directed Hypergraphs and Applications}, journal = {Discret. Appl. Math.}, volume = {42}, number = {2}, pages = {177--201}, year = {1993}, url = {https://doi.org/10.1016/0166-218X(93)90045-P}, doi = {10.1016/0166-218X(93)90045-P}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/GalloLP93.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/Guignard93, author = {Monique Guignard}, title = {Solving Makespan Minimization Problems with Lagrangean Decomposition}, journal = {Discret. Appl. Math.}, volume = {42}, number = {1}, pages = {17--29}, year = {1993}, url = {https://doi.org/10.1016/0166-218X(93)90176-O}, doi = {10.1016/0166-218X(93)90176-O}, timestamp = {Fri, 16 Apr 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dam/Guignard93.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/HedayatKM93, author = {A. Sadam Hedayat and Gholamreza B. Khosrovshahi and Dibyen Majumdar}, title = {A Prospect for a General Method of Constructing \emph{t}-Designs}, journal = {Discret. Appl. Math.}, volume = {42}, number = {1}, pages = {31--50}, year = {1993}, url = {https://doi.org/10.1016/0166-218X(93)90177-P}, doi = {10.1016/0166-218X(93)90177-P}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/HedayatKM93.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/Hochbaum93, author = {Dorit S. Hochbaum}, title = {Why Should Biconnected Components be Identified First}, journal = {Discret. Appl. Math.}, volume = {42}, number = {2}, pages = {203--210}, year = {1993}, url = {https://doi.org/10.1016/0166-218X(93)90046-Q}, doi = {10.1016/0166-218X(93)90046-Q}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/Hochbaum93.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/KanSV93, author = {A. H. G. Rinnooy Kan and Leen Stougie and Carlo Vercellis}, title = {A Class of Generalized Greedy Algorithms for the Multi-Knapsack Problem}, journal = {Discret. Appl. Math.}, volume = {42}, number = {2}, pages = {279--290}, year = {1993}, url = {https://doi.org/10.1016/0166-218X(93)90051-O}, doi = {10.1016/0166-218X(93)90051-O}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/KanSV93.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/Keil93, author = {J. Mark Keil}, title = {The Complexity of Domination Problems in Circle Graphs}, journal = {Discret. Appl. Math.}, volume = {42}, number = {1}, pages = {51--63}, year = {1993}, url = {https://doi.org/10.1016/0166-218X(93)90178-Q}, doi = {10.1016/0166-218X(93)90178-Q}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/Keil93.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/KindervaterLS93, author = {Gerard A. P. Kindervater and Jan Karel Lenstra and Martin W. P. Savelsbergh}, title = {Sequential and Parallel Local Search for the Time-Constrained Traveling Salesman Problem}, journal = {Discret. Appl. Math.}, volume = {42}, number = {2}, pages = {211--225}, year = {1993}, url = {https://doi.org/10.1016/0166-218X(93)90047-R}, doi = {10.1016/0166-218X(93)90047-R}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/KindervaterLS93.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/LucertiniPS93, author = {Mario Lucertini and Yehoshua Perl and Bruno Simeone}, title = {Most Uniform Path Partitioning and its Use in Image Processing}, journal = {Discret. Appl. Math.}, volume = {42}, number = {2}, pages = {227--256}, year = {1993}, url = {https://doi.org/10.1016/0166-218X(93)90048-S}, doi = {10.1016/0166-218X(93)90048-S}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/LucertiniPS93.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/Maffioli93, author = {Francesco Maffioli}, title = {In Memoriam Paolo M. Camerini}, journal = {Discret. Appl. Math.}, volume = {42}, number = {2}, pages = {121--122}, year = {1993}, url = {https://doi.org/10.1016/0166-218X(93)90041-L}, doi = {10.1016/0166-218X(93)90041-L}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/Maffioli93.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/MartelliP93, author = {Mario Martelli and Mario Pedrazzoli}, title = {On Pseudounimodular Matrices}, journal = {Discret. Appl. Math.}, volume = {42}, number = {1}, pages = {113--117}, year = {1993}, url = {https://doi.org/10.1016/0166-218X(93)90183-O}, doi = {10.1016/0166-218X(93)90183-O}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/MartelliP93.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/MichelonM93, author = {Philippe Michelon and Nelson Maculan}, title = {Lagrangean Methods for 0-1 Quadratic Problems}, journal = {Discret. Appl. Math.}, volume = {42}, number = {2}, pages = {257--269}, year = {1993}, url = {https://doi.org/10.1016/0166-218X(93)90049-T}, doi = {10.1016/0166-218X(93)90049-T}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/MichelonM93.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/PapadimitriouSY93, author = {Christos H. Papadimitriou and Paolo Serafini and Mihalis Yannakakis}, title = {Computing the Throughput of a Network with Dedicated Lines}, journal = {Discret. Appl. Math.}, volume = {42}, number = {2}, pages = {271--278}, year = {1993}, url = {https://doi.org/10.1016/0166-218X(93)90050-X}, doi = {10.1016/0166-218X(93)90050-X}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/PapadimitriouSY93.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/Shawe-TaylorAB93, author = {John Shawe{-}Taylor and Martin Anthony and Norman Biggs}, title = {Bounding Sample Size with the Vapnik-Chervonenkis Dimension}, journal = {Discret. Appl. Math.}, volume = {42}, number = {1}, pages = {65--73}, year = {1993}, url = {https://doi.org/10.1016/0166-218X(93)90179-R}, doi = {10.1016/0166-218X(93)90179-R}, timestamp = {Mon, 26 Jun 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dam/Shawe-TaylorAB93.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/Stougie93, author = {Leen Stougie}, title = {A Fast Randomized Algorithm for Partitioning a Graph into Paths of Fixed Length}, journal = {Discret. Appl. Math.}, volume = {42}, number = {2}, pages = {291--303}, year = {1993}, url = {https://doi.org/10.1016/0166-218X(93)90052-P}, doi = {10.1016/0166-218X(93)90052-P}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/Stougie93.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/SunderamW93, author = {Vaidy S. Sunderam and Peter Winkler}, title = {Fast Information Sharing in a Complete Network}, journal = {Discret. Appl. Math.}, volume = {42}, number = {1}, pages = {75--86}, year = {1993}, url = {https://doi.org/10.1016/0166-218X(93)90180-V}, doi = {10.1016/0166-218X(93)90180-V}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/SunderamW93.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/TroutmanK93, author = {Brent M. Troutman and Michael R. Karlinger}, title = {A Note on Subtrees Rooted Along the Primary Path of a Binary Tree}, journal = {Discret. Appl. Math.}, volume = {42}, number = {1}, pages = {87--93}, year = {1993}, url = {https://doi.org/10.1016/0166-218X(93)90181-M}, doi = {10.1016/0166-218X(93)90181-M}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/TroutmanK93.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/Zhang93, author = {Lianwen Zhang}, title = {Studies on Hypergraphs {I:} Hyperforests}, journal = {Discret. Appl. Math.}, volume = {42}, number = {1}, pages = {95--112}, year = {1993}, url = {https://doi.org/10.1016/0166-218X(93)90182-N}, doi = {10.1016/0166-218X(93)90182-N}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/Zhang93.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.