default search action
Journal of Discrete Algorithms, Volume 30
Volume 30, January 2015
- Akash Agrawal, Saladi Rahul, Yuan Li, Ravi Janardan:
Range search on tuples of points. 1-12 - Boris Schauerte
, Carol T. Zamfirescu:
Small k-pyramids and the complexity of determining k. 13-20 - Ton Kloks, Sheung-Hung Poon
On the strong chromatic index and maximum induced matching of tree-cographs, permutation graphs and chordal bipartite graphs. 21-28 - Tibor Jordán, Ildikó Schlotter
Parameterized complexity of spare capacity allocation and the multicost Steiner subgraph problem. 29-44 - Francesco Giordano, Giuseppe Liotta
Computing upward topological book embeddings of upward planar digraphs. 45-69 - Vahid Dabbaghian
Constructing non-cyclic pandiagonal Latin squares of prime orders. 70-77 - Ananda Swarup Das, Prosenjit Gupta, Kishore Kothapalli, Kannan Srinathan:
Reporting and counting maximal points in a query orthogonal rectangle. 78-95 - A. Karim Abu-Affash, Paz Carmi, Matthew J. Katz:
Bottleneck Steiner tree with bounded number of Steiner vertices. 96-100 - Radoslav Fulek
Universal point sets for planar three-trees. 101-112 - Olivier Baudon, Julien Bensmail, Éric Sopena:
On the complexity of determining the irregular chromatic index of a graph. 113-127 - Biagio Bonasera, Emilio Ferrara
Adaptive search over sorted sets. 128-133
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-12-12 20:49 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: