default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Discrete Algorithms, Volume 35
Volume 35, November 2015
- Christopher Purcell
, M. Puck Rombach:
On the complexity of role colouring planar graphs, trees and cographs. 1-8 - Abdullah N. Arslan, Dan He, Yu He, Xindong Wu:
Pattern matching with wildcards and length constraints using maximum network flow. 9-16 - Fanica Gavril:
Algorithms for GA-H reduced graphs. 17-26 - Heng-Soon Gan, Hamid Mokhtar, Sanming Zhou:
Forwarding and optical indices of 4-regular circulant networks. 27-39 - Matthew D. Williamson, K. Subramani:
On the negative cost girth problem in planar networks. 40-50 - Mojtaba Nouri Bygi, Mohammad Ghodsi:
Near optimal line segment queries in simple polygons. 51-61 - Chia-Chen Wei, Sun-Yuan Hsieh, Chia-Wei Lee, Sheng-Lung Peng:
An improved approximation algorithm for the partial-terminal Steiner tree problem with edge cost 1 or 2. 62-71
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 2026-04-01 23:24 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:
