![](https://dblp.org/img/logo.ua.320x120.png)
![](https://dblp.org/img/dropdown.dark.16x16.png)
![](https://dblp.org/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.org/img/search.dark.16x16.png)
![search dblp](https://dblp.org/img/search.dark.16x16.png)
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
, Chin-Ting Ung, Yue-Li Wang:
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
, Tamara Mchedlidze
, Antonios Symvonis
, Sue Whitesides:
Computing upward topological book embeddings of upward planar digraphs. 45-69 - Vahid Dabbaghian, Tiankuang Wu:
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
, Csaba D. Tóth:
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
, Giacomo Fiumara, Francesco Pagano, Alessandro Provetti
:
Adaptive search over sorted sets. 128-133
![](https://dblp.org/img/cog.dark.24x24.png)
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.