default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Discrete Algorithms, Volume 38-41
Volume 38-41, May - November 2016
- Anna Adamaszek
, Alexandru Popa:
Approximation and hardness results for the maximum edge q-coloring problem. 1-8 - Yijie Han, Tadao Takaoka:
An O(n3loglogn/log2n) time algorithm for all pairs shortest paths. 9-19 - Srecko Brlek, Stefano Brocchi, Andrea Frosini:
Reconstructing binary matrices with timetabling constraints. 20-31 - R. Sritharan:
Graph modification problem for some classes of graphs. 32-37 - Johannes Köbler, Sebastian Kuhnert, Oleg Verbitsky:
Solving the canonical representation and Star System Problems for proper circular-arc graphs in logspace. 38-49
- Haoyue Bai, Antoine Deza, Frantisek Franek:
Corrigendum to "On a lemma of Crochemore and Rytter" [Journal of Discrete Algorithms 34 (2015) 18-22]. 50-51 - Matthew D. Williamson, K. Subramani:
Corrigendum to "On the negative cost girth problem in planar networks" [Journal of Discrete Algorithms 35 (2015) 40-50]. 52-53
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-12-05 22:24 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:
