default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Applied Mathematics, Volume 163
Volume 163, Part 1, January 2014
- Karl F. Doerner
, Pierre Hansen, Vittorio Maniezzo, Stefan Voß:
Editorial. 1-2 - Claudia Archetti, Gianfranco Guastaroba, Maria Grazia Speranza:
An ILP-refined tabu search for the Directed Profitable Rural Postman Problem. 3-16 - Roberto Baldacci, Marco A. Boschetti, Maurizio Ganovelli, Vittorio Maniezzo:
Algorithms for nesting with defects. 17-33 - Natashia Boland, Thomas Kalinowski, Hamish Waterer, Lanbo Zheng:
Scheduling arc maintenance jobs in a network to maximize total flow over time. 34-52 - Valentina Cacchiani, Vera C. Hemmelmayr, Fabien Tricoire:
A set-covering based heuristic algorithm for the periodic vehicle routing problem. 53-64 - Sonia Cafieri, Pierre Hansen, Leo Liberti:
Improving heuristics for network modularity maximization using an exact algorithm. 65-72 - François Clautiaux, Mauro Dell'Amico, Manuel Iori, Ali Khanafer:
Lower and upper bounds for the Bin Packing Problem with Fragile Objects. 73-86 - Marco Caserta, Stefan Voß:
A hybrid algorithm for the DNA sequencing problem. 87-99
Volume 163, Part 2, January 2014
- Andreas Brandstädt, Konrad Engel, Hans-Dietrich O. F. Gronau, Roger Labahn, Van Bang Le, Florian Pfender:
Preface. 101 - Abdullah Al-Azemi, Anton Betten, Dieter Betten:
Unital designs with blocking sets. 102-112 - Mais Alkhateeb, Anja Kohl:
Investigating the b-chromatic number of bipartite graphs by using the bicomplement. 113-126 - Harald Birkholz, Konrad Engel:
Partition into almost straight trails. 127-135 - Mitre Costa Dourado, Luérbio Faria, Miguel A. Pizaña, Dieter Rautenbach, Jayme Luiz Szwarcfiter:
On defensive alliances and strong global offensive alliances. 136-141 - Daniel Dressler, Martin Strehler:
Polynomial-time algorithms for special cases of the maximum confluent flow problem. 142-154 - Jan Foniok, Bernd Gärtner, Lorenz Klaus, Markus Sprecher:
Counting unique-sink orientations. 155-164 - Martin Grüttmüller, Ian T. Roberts, Leanne J. Rylands:
Antichains and completely separating systems - A catalogue and applications. 165-180 - Lawrence H. Harper:
Morphisms for resistive electrical networks. 181-193 - Imre Leader, Eoin Long:
Tilted Sperner families. 194-198 - Patric R. J. Östergård:
On the minimum size of 4-uniform hypergraphs without property B. 199-204 - Hasmik Sahakyan:
Essential points of the n-cube subset partitioning characterisation. 205-213 - V. V. Shenmaier:
Asymptotically optimal algorithms for geometric Max TSP and Max m-PSP. 214-219 - W. D. Wallis:
Triple arrays and related designs. 220-236
Volume 163, Part 3, January 2014
- Jan Holub:
Stringology algorithms. 237 - Johannes Bubenzer:
Cycle-aware minimization of acyclic deterministic finite-state automata. 238-246 - Domenico Cantone, Simone Faro, Emanuele Giaquinta:
Text searching allowing for inversions and translocations of factors. 247-257 - Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Krzysztof Stencel, Tomasz Walen:
New simple efficient algorithms computing powers and runs in strings. 258-267 - Antoine Deza, Frantisek Franek:
A d-step approach to the maximum number of distinct squares and runs in strings. 268-274 - Maria Federico, Pierre Peterlongo, Nadia Pisanti, Marie-France Sagot:
Rime: Repeat identification. 275-286 - Gabriele Fici, Thierry Lecroq, Arnaud Lefebvre, Élise Prieur-Gaston:
Algorithms for computing Abelian periods of words. 287-297 - Szymon Grabowski, Wojciech Bieniecki:
Tight and simple Web graph compression for forward and reverse neighbor queries. 298-306 - Michael Hirsch, Shmuel T. Klein, Yair Toaff:
Improving deduplication techniques by accelerating remainder calculations. 307-315 - Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Inferring strings from suffix trees and links on a binary alphabet. 316-325 - Shmuel T. Klein, Dana Shapira:
Practical fixed length Lempel-Ziv coding. 326-333 - Kazuhiko Kusano, Ayumi Shinohara:
Average number of occurrences of repetitions in a necklace. 334-342 - Jan Lahoda, Jan Zdárek:
Simple tree pattern matching for trees in the prefix bar notation. 343-351 - Hannu Peltola, Jorma Tarhio:
String matching with lookahead. 352-360 - Marcin Piatkowski, Wojciech Rytter:
Computing the number of cubic runs in standard Sturmian words. 361-372
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.
last updated on 2025-03-01 15:12 CET 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:
