J. Discrete Algorithms

Keyphrases

Publications

2018

Federico Della Croce, Ulrich Pferschy, Rosario Scatamacchia
Approximating the 3-period Incremental Knapsack Problem. J. Discrete Algorithms (2018)
Ljiljana Brankovic, Joe Ryan, William F. Smyth
Editorial. J. Discrete Algorithms (2018)
Rhyd Lewis, Kate Smith-Miles
A heuristic algorithm for finding cost-effective solutions to real-world school bus routing problems. J. Discrete Algorithms (2018)
Narayan Vikas
Computational Complexity Relationship between Compaction, Vertex-Compaction, and Retraction. J. Discrete Algorithms (2018)
Hiroe Inoue, Yuto Nakashima, Takuya Mieno, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Algorithms and combinatorial properties on shortest unique palindromic substrings. J. Discrete Algorithms (2018)
Sven Mallach
Linear ordering based MIP formulations for the vertex separation or pathwidth problem. J. Discrete Algorithms (2018)
Robin Milosz, Sylvie Hamel
Exploring the median of permutations problem. J. Discrete Algorithms (2018)
Nathann Cohen, Frédéric Havet, Dorian Mazauric, Ignasi Sau, Rémi Watrigant
Complexity dichotomies for the MinimumF-Overlay problem. J. Discrete Algorithms (2018)
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. J. Discrete Algorithms (2018)
Benoît Darties, Nicolas Champseix, Annie Chateau, Rodolphe Giroudeau, Mathias Weller
Complexity and lowers bounds for Power Edge Set Problem. J. Discrete Algorithms (2018)
Tatsuya Ohno, Kensuke Sakai, Yoshimasa Takabatake, Tomohiro I, Hiroshi Sakamoto
A faster implementation of online RLBWT and its application to LZ77 parsing. J. Discrete Algorithms (2018)
Alexandre Blondin Massé, Julien de Carufel, Alain Goupil
Saturated fully leafed tree-like polyforms and polycubes. J. Discrete Algorithms (2018)
Uwe Schauz
Computing the list chromatic index of graphs. J. Discrete Algorithms (2018)
Hanyu Gu, Alexander V. Kononov, Julia Memar, Yakov Zinder
Efficient Lagrangian heuristics for the two-stage flow shop with job dependent buffer requirements. J. Discrete Algorithms (2018)
Matej Konecný, Stanislav Kucera, Jana Novotná, Jakub Pekárek, Stepán Simsa, Martin Töpfer
Minimal sum labeling of graphs. J. Discrete Algorithms (2018)

volume 51, 2018

volume 50, 2018

volume 49, 2018

volume 48, 2018

volume 45, 2017

volume 44, 2017

volume 43, 2017

volume 42, 2017