Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Discrete Algorithms, Volumes 52-53
Volumes 52-53, September 2018
- Ljiljana Brankovic
, Joe Ryan, William F. Smyth:
Editorial. 1 - Rhyd Lewis, Kate Smith-Miles:
A heuristic algorithm for finding cost-effective solutions to real-world school bus routing problems. 2-17 - Tatsuya Ohno, Kensuke Sakai, Yoshimasa Takabatake, Tomohiro I, Hiroshi Sakamoto:
A faster implementation of online RLBWT and its application to LZ77 parsing. 18-28 - Matej Konecný, Stanislav Kucera, Jana Novotná, Jakub Pekárek, Stepán Simsa, Martin Töpfer:
Minimal sum labeling of graphs. 29-37 - Alexandre Blondin Massé, Julien de Carufel, Alain Goupil:
Saturated fully leafed tree-like polyforms and polycubes. 38-54 - Federico Della Croce, Ulrich Pferschy, Rosario Scatamacchia:
Approximating the 3-period Incremental Knapsack Problem. 55-69 - Benoît Darties, Nicolas Champseix, Annie Chateau, Rodolphe Giroudeau, Mathias Weller:
Complexity and lowers bounds for Power Edge Set Problem. 70-91 - Robin Milosz, Sylvie Hamel:
Exploring the median of permutations problem. 92-111 - Andrei Kelarev, Joe Ryan, Leanne Rylands, Jennifer Seberry, Xun Yi:
Discrete algorithms and methods for security of statistical databases related to the work of Mirka Miller. 112-121 - Hiroe Inoue, Yuto Nakashima, Takuya Mieno, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Algorithms and combinatorial properties on shortest unique palindromic substrings. 122-132 - Nathann Cohen, Frédéric Havet, Dorian Mazauric, Ignasi Sau, Rémi Watrigant:
Complexity dichotomies for the MinimumF-Overlay problem. 133-142 - Hanyu Gu, Alexander V. Kononov, Julia Memar, Yakov Zinder:
Efficient Lagrangian heuristics for the two-stage flow shop with job dependent buffer requirements. 143-155 - Sven Mallach:
Linear ordering based MIP formulations for the vertex separation or pathwidth problem. 156-167 - Narayan Vikas:
Computational Complexity Relationship between Compaction, Vertex-Compaction, and Retraction. 168-181 - Uwe Schauz:
Computing the list chromatic index of graphs. 182-191
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.
last updated on 2024-06-10 21:27 CEST 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:
